pax_global_header00006660000000000000000000000064144213415630014515gustar00rootroot0000000000000052 comment=1a1a20895bfa9778df82b339bbd05b27ca1d7c10 UEFITool-A66/000077500000000000000000000000001442134156300130015ustar00rootroot00000000000000UEFITool-A66/.gitattributes000066400000000000000000000007431442134156300157000ustar00rootroot00000000000000# Auto detect text files and perform LF normalization * text=auto # Custom for Visual Studio *.cs diff=csharp *.sln merge=union *.csproj merge=union *.vbproj merge=union *.fsproj merge=union *.dbproj merge=union # Standard to msysgit *.doc diff=astextplain *.DOC diff=astextplain *.docx diff=astextplain *.DOCX diff=astextplain *.dot diff=astextplain *.DOT diff=astextplain *.pdf diff=astextplain *.PDF diff=astextplain *.rtf diff=astextplain *.RTF diff=astextplain UEFITool-A66/.github/000077500000000000000000000000001442134156300143415ustar00rootroot00000000000000UEFITool-A66/.github/workflows/000077500000000000000000000000001442134156300163765ustar00rootroot00000000000000UEFITool-A66/.github/workflows/main.yml000066400000000000000000000411331442134156300200470ustar00rootroot00000000000000name: CI/CD on: push: pull_request: workflow_dispatch: release: types: [published] jobs: # Release builds build_release_macos: name: Release build (macOS universal, static Qt 6.5.0) runs-on: macos-12 steps: - uses: actions/checkout@v3 - name: Get Qt uses: actions/checkout@v3 with: repository: LongSoft/qt-6-static-universal-macos path: qt lfs: true - name: Unpack Qt shell: bash working-directory: qt run: sudo 7z x qt-6.5.0-static-universal-macos.7z -o/opt - name: Create build directory run: cmake -E make_directory ${{runner.workspace}}/build - name: Configure everything working-directory: ${{runner.workspace}}/build run: cmake -DCMAKE_PREFIX_PATH="/opt/qt-6.5.0-static-universal-macos" -DCMAKE_OSX_ARCHITECTURES="x86_64;arm64" -DCMAKE_OSX_DEPLOYMENT_TARGET="11.0" ../UEFITool - name: Build everything working-directory: ${{runner.workspace}}/build shell: bash run: cmake --build . --config Release - name: Create dist directory run: cmake -E make_directory ${{runner.workspace}}/UEFITool/dist - name: Archive everything working-directory: ${{runner.workspace}}/build shell: bash run: | UEFITOOL_VER=$(cat ../UEFITool/version.h | grep PROGRAM_VERSION | cut -d'"' -f2 | sed 's/NE alpha /A/') ; \ zip -qryj ../UEFITool/dist/UEFIExtract_NE_${UEFITOOL_VER}_universal_mac.zip ./UEFIExtract/UEFIExtract zip -qryj ../UEFITool/dist/UEFIFind_NE_${UEFITOOL_VER}_universal_mac.zip ./UEFIFind/UEFIFind cd UEFITool zip -qry ../../UEFITool/dist/UEFITool_NE_${UEFITOOL_VER}_universal_mac.zip ./UEFITool.app - name: Upload to artifacts uses: actions/upload-artifact@v3 with: name: macOS builds path: dist/*.zip - name: Upload to releases if: github.event_name == 'release' uses: svenstaro/upload-release-action@v2 with: repo_token: ${{ secrets.GITHUB_TOKEN }} file: dist/*.zip tag: ${{ github.ref }} file_glob: true build_release_linux: name: Release build (Linux x64, shared Qt 6) runs-on: ubuntu-22.04 steps: - uses: actions/checkout@v3 - name: Get Qt run: | sudo apt update sudo apt-get install -qq zip cmake libgl1-mesa-dev qt6-base-dev - name: Create build directory run: cmake -E make_directory ${{runner.workspace}}/build - name: Configure everything working-directory: ${{runner.workspace}}/build run: cmake ../UEFITool - name: Build everything working-directory: ${{runner.workspace}}/build shell: bash run: cmake --build . --config Release - name: Create dist directory run: cmake -E make_directory ${{runner.workspace}}/UEFITool/dist - name: Archive everything working-directory: ${{runner.workspace}}/build shell: bash run: | UEFITOOL_VER=$(cat ../UEFITool/version.h | grep PROGRAM_VERSION | cut -d'"' -f2 | sed 's/NE alpha /A/') ; \ zip -qryj ../UEFITool/dist/UEFIExtract_NE_${UEFITOOL_VER}_x64_linux.zip ./UEFIExtract/uefiextract zip -qryj ../UEFITool/dist/UEFIFind_NE_${UEFITOOL_VER}_x64_linux.zip ./UEFIFind/uefifind zip -qryj ../UEFITool/dist/UEFITool_NE_${UEFITOOL_VER}_x64_linux.zip ./UEFITool/uefitool - name: Upload to artifacts uses: actions/upload-artifact@v3 with: name: Linux builds path: dist/*.zip - name: Upload to releases if: github.event_name == 'release' uses: svenstaro/upload-release-action@v2 with: repo_token: ${{ secrets.GITHUB_TOKEN }} file: dist/*.zip tag: ${{ github.ref }} file_glob: true build_release_freebsd: name: Release build (FreeBSD x64, shared Qt 6) runs-on: macos-12 steps: - uses: actions/checkout@v3 - name: Build on FreeBSD inside macOS VM id: test uses: vmactions/freebsd-vm@v0 with: usesh: true prepare: | pkg install -y zip cmake qt6-base run: | mkdir dist mkdir build cd build cmake .. cmake --build . --config Release UEFITOOL_VER=$(cat ../version.h | grep PROGRAM_VERSION | cut -d'"' -f2 | sed 's/NE alpha /A/') ; \ zip -qryj ../dist/UEFIExtract_NE_${UEFITOOL_VER}_x64_freebsd.zip ./UEFIExtract/uefiextract zip -qryj ../dist/UEFIFind_NE_${UEFITOOL_VER}_x64_freebsd.zip ./UEFIFind/uefifind zip -qryj ../dist/UEFITool_NE_${UEFITOOL_VER}_x64_freebsd.zip ./UEFITool/uefitool - name: Upload to artifacts uses: actions/upload-artifact@v3 with: name: FreeBSD builds path: dist/*.zip - name: Upload to releases if: github.event_name == 'release' uses: svenstaro/upload-release-action@v2 with: repo_token: ${{ secrets.GITHUB_TOKEN }} file: dist/*.zip tag: ${{ github.ref }} file_glob: true build_release_windows_32: name: Release build (Win32, static Qt 5.6.3) runs-on: windows-2019 steps: - uses: actions/checkout@v3 - name: Get Qt 5.6.3 uses: actions/checkout@v3 with: repository: LongSoft/qt-5.6.3-static-x86-msvc2017 path: qt5 lfs: true - name: Unpack Qt 5.6.3 shell: bash working-directory: qt5 run: 7z x qt-5.6.3-static-x86-msvc2017.7z -o../.. - name: Create dist directory shell: bash run: mkdir dist - name: Create UEFIExtract build directory run: cmake -E make_directory ${{runner.workspace}}/build/UEFIExtract - name: Configure UEFIExtract shell: bash working-directory: ${{runner.workspace}}/build/UEFIExtract run: cmake -G "Visual Studio 16 2019" -T "v141_xp" ../../UEFITool/UEFIExtract/ - name: Build UEFIExtract working-directory: ${{runner.workspace}}/build/UEFIExtract shell: bash run: cmake --build . --config Release - name: Archive UEFIExtract working-directory: ${{runner.workspace}}/build/UEFIExtract/Release shell: bash run: | UEFITOOL_VER=$(cat ../../../UEFITool/version.h | grep PROGRAM_VERSION | cut -d'"' -f2 | sed 's/NE alpha /A/') ; \ 7z a ../../../UEFITool/dist/UEFIExtract_NE_${UEFITOOL_VER}_win32.zip UEFIExtract.exe - name: Create UEFIFind build directory run: cmake -E make_directory ${{runner.workspace}}/build/UEFIFind - name: Configure UEFIFind working-directory: ${{runner.workspace}}/build/UEFIFind shell: bash run: cmake -G "Visual Studio 16 2019" -T "v141_xp" ../../UEFITool/UEFIFind/ - name: Build UEFIFind working-directory: ${{runner.workspace}}/build/UEFIFind shell: bash run: cmake --build . --config Release - name: Archive UEFIFind working-directory: ${{runner.workspace}}/build/UEFIFind/Release shell: bash run: | UEFITOOL_VER=$(cat ../../../UEFITool/version.h | grep PROGRAM_VERSION | cut -d'"' -f2 | sed 's/NE alpha /A/') ; \ 7z a ../../../UEFITool/dist/UEFIFind_NE_${UEFITOOL_VER}_win32.zip UEFIFind.exe - name: Create UEFITool build directory run: cmake -E make_directory ${{runner.workspace}}/build/UEFITool - name: Configure UEFITool shell: bash working-directory: ${{runner.workspace}}/build/UEFITool run: ../../qt-5.6.3-static-x86-msvc2017/bin/qmake.exe -tp vc ../../UEFITool/UEFITool/ - name: Build UEFITool working-directory: ${{runner.workspace}}/build/UEFITool shell: cmd run: | call "C:\Program Files (x86)\Microsoft Visual Studio\2019\Enterprise\VC\Auxiliary\Build\vcvars32.bat" msbuild -t:Rebuild -p:PlatformToolset=v141_xp;Configuration=Release - name: Archive UEFITool working-directory: ${{runner.workspace}}/build/UEFITool/release shell: bash run: | UEFITOOL_VER=$(cat ../../../UEFITool/version.h | grep PROGRAM_VERSION | cut -d'"' -f2 | sed 's/NE alpha /A/') ; \ 7z a ../../../UEFITool/dist/UEFITool_NE_${UEFITOOL_VER}_win32.zip UEFITool.exe - name: Upload to artifacts uses: actions/upload-artifact@v3 with: name: Windows 32-bit builds path: dist/*.zip - name: Upload to releases if: github.event_name == 'release' uses: svenstaro/upload-release-action@v2 with: repo_token: ${{ secrets.GITHUB_TOKEN }} file: dist/*.zip tag: ${{ github.ref }} file_glob: true build_release_windows_64: name: Release build (Win64, static Qt 6.5.0) runs-on: windows-2022 steps: - uses: actions/checkout@v3 - name: Get Qt 6.5.0 uses: actions/checkout@v3 with: repository: LongSoft/qt-6-static-x64-msvc2022 path: qt6 lfs: true - name: Unpack Qt 6.5.0 shell: bash working-directory: qt6 run: 7z x qt-6.5.0-static-x64-msvc2022.7z -o../.. - name: Create build directory run: cmake -E make_directory ${{runner.workspace}}/build - name: Configure everything working-directory: ${{runner.workspace}}/build shell: cmd run: cmake -DCMAKE_PREFIX_PATH="D:\a\UEFITool\qt-6.5.0-static-x64-msvc2022" -DCMAKE_MSVC_RUNTIME_LIBRARY="MultiThreaded" ../UEFITool - name: Build everything working-directory: ${{runner.workspace}}/build shell: bash run: cmake --build . --config Release - name: Create dist directory run: cmake -E make_directory ${{runner.workspace}}/UEFITool/dist - name: Archive everything working-directory: ${{runner.workspace}}/build shell: bash run: | UEFITOOL_VER=$(cat ../UEFITool/version.h | grep PROGRAM_VERSION | cut -d'"' -f2 | sed 's/NE alpha /A/') ; \ 7z a ../UEFITool/dist/UEFIExtract_NE_${UEFITOOL_VER}_win64.zip ./UEFIExtract/Release/UEFIExtract.exe 7z a ../UEFITool/dist/UEFIFind_NE_${UEFITOOL_VER}_win64.zip ./UEFIFind/Release/UEFIFind.exe 7z a ../UEFITool/dist/UEFITool_NE_${UEFITOOL_VER}_win64.zip ./UEFITool/Release/UEFITool.exe - name: Upload to artifacts uses: actions/upload-artifact@v3 with: name: Windows 64-bit builds path: dist/*.zip - name: Upload to releases if: github.event_name == 'release' uses: svenstaro/upload-release-action@v2 with: repo_token: ${{ secrets.GITHUB_TOKEN }} file: dist/*.zip tag: ${{ github.ref }} file_glob: true # Build Tests build_test_linux_meson: name: Meson build system test (shared Qt 5) runs-on: ubuntu-22.04 steps: - uses: actions/checkout@v3 - name: Get Deps run: | sudo apt update sudo apt-get install -qq cmake meson zlib1g-dev qtbase5-dev - name: Configure build run: mkdir build-meson && meson ./build-meson - name: Build everything run: ninja -C build-meson build_test_windows_mingw: name: MinGW compiler test (shared Qt 6.5.0) runs-on: windows-latest steps: - uses: actions/checkout@v3 - name: Install Qt uses: jurplel/install-qt-action@v3 with: version: '6.5.0' host: 'windows' target: 'desktop' arch: 'win64_mingw' - name: Build everything run: | cmake -G "MinGW Makefiles" -B build . cmake --build build --parallel # Static Analysis build_analyze_linux_coverity: env: PROJECT_TYPE: TOOL JOB_TYPE: COVERITY if: github.repository_owner == 'LongSoft' && github.event_name != 'pull_request' name: Coverity Static Analysis (shared Qt 6.5.0) runs-on: ubuntu-latest steps: - uses: actions/checkout@v3 - name: Install Qt uses: jurplel/install-qt-action@v3 with: version: '6.5.0' host: 'linux' target: 'desktop' - name: Create build directory run: cmake -E make_directory ${{runner.workspace}}/build - name: Configure everything working-directory: ${{runner.workspace}}/build run: cmake ../UEFITool - name: Run Coverity working-directory: ${{runner.workspace}}/build run: | src=$(/usr/bin/curl -Lfs https://raw.githubusercontent.com/acidanthera/ocbuild/master/coverity/covstrap-linux.sh) && eval "$src" || exit 1 env: COVERITY_SCAN_TOKEN: ${{ secrets.COVERITY_SCAN_TOKEN }} COVERITY_SCAN_EMAIL: ${{ secrets.COVERITY_SCAN_EMAIL }} COVERITY_BUILD_COMMAND: cmake --build . build_analyze_linux_pvs_studio_and_codeql: if: github.repository_owner == 'LongSoft' && github.event_name != 'pull_request' name: PVS-Studio and CodeQL Static Analysis (shared Qt 6.5.0) runs-on: ubuntu-latest steps: - uses: actions/checkout@v3 - name: Install Qt uses: jurplel/install-qt-action@v3 with: version: '6.5.0' host: 'linux' target: 'desktop' - name: Install PVS-Studio run: | wget -q -O - https://files.pvs-studio.com/etc/pubkey.txt \ | sudo apt-key add - sudo wget -O /etc/apt/sources.list.d/viva64.list \ https://files.pvs-studio.com/etc/viva64.list sudo apt update sudo apt install pvs-studio pvs-studio-analyzer credentials ${{ secrets.PVS_STUDIO_CREDENTIALS }} - name: Initialize CodeQL uses: github/codeql-action/init@v2 with: languages: cpp - name: Build everything run: | cmake -DCMAKE_EXPORT_COMPILE_COMMANDS=On -B build . cmake --build build - name: Perform CodeQL analysis uses: github/codeql-action/analyze@v2 - name: Perform PVS-Studio analysis run: | pvs-studio-analyzer analyze -f build/compile_commands.json -j - name: Convert PVS-Studio report run: | plog-converter -t sarif -o pvs-report.sarif PVS-Studio.log - name: Publish PVS-Studio report uses: github/codeql-action/upload-sarif@v2 with: sarif_file: pvs-report.sarif category: PVS-Studio build_analyze_linux_sonarcloud: if: github.repository_owner == 'LongSoft' && github.event_name != 'pull_request' name: SonarCloud Static Analysis (shared Qt 6.5.0) runs-on: ubuntu-latest env: SONAR_SCANNER_VERSION: 4.7.0.2747 SONAR_SERVER_URL: "https://sonarcloud.io" BUILD_WRAPPER_OUT_DIR: build_wrapper_output_directory # Directory where build-wrapper output will be placed steps: - uses: actions/checkout@v3 with: fetch-depth: 0 # Shallow clones should be disabled for a better relevancy of analysis - name: Install Qt uses: jurplel/install-qt-action@v3 with: version: '6.5.0' host: 'linux' target: 'desktop' - name: Set up JDK 11 uses: actions/setup-java@v3 with: distribution: 'zulu' java-version: 11 - name: Download and set up sonar-scanner env: SONAR_SCANNER_DOWNLOAD_URL: https://binaries.sonarsource.com/Distribution/sonar-scanner-cli/sonar-scanner-cli-${{ env.SONAR_SCANNER_VERSION }}-linux.zip run: | mkdir -p $HOME/.sonar curl -sSLo $HOME/.sonar/sonar-scanner.zip ${{ env.SONAR_SCANNER_DOWNLOAD_URL }} unzip -o $HOME/.sonar/sonar-scanner.zip -d $HOME/.sonar/ echo "$HOME/.sonar/sonar-scanner-${{ env.SONAR_SCANNER_VERSION }}-linux/bin" >> $GITHUB_PATH - name: Download and set up build-wrapper env: BUILD_WRAPPER_DOWNLOAD_URL: ${{ env.SONAR_SERVER_URL }}/static/cpp/build-wrapper-linux-x86.zip run: | curl -sSLo $HOME/.sonar/build-wrapper-linux-x86.zip ${{ env.BUILD_WRAPPER_DOWNLOAD_URL }} unzip -o $HOME/.sonar/build-wrapper-linux-x86.zip -d $HOME/.sonar/ echo "$HOME/.sonar/build-wrapper-linux-x86" >> $GITHUB_PATH - name: Run build-wrapper run: | cmake -B build . build-wrapper-linux-x86-64 --out-dir ${{ env.BUILD_WRAPPER_OUT_DIR }} cmake --build build - name: Run sonar-scanner env: GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }} SONAR_TOKEN: ${{ secrets.SONAR_TOKEN }} run: | sonar-scanner --define sonar.host.url="${{ env.SONAR_SERVER_URL }}" --define sonar.cfamily.build-wrapper-output="${{ env.BUILD_WRAPPER_OUT_DIR }}" UEFITool-A66/.gitignore000066400000000000000000000061241442134156300147740ustar00rootroot00000000000000################# ## Qt ################# moc_*.* ui_*.* qrc_*.* ################# ## Qt Creator ################# *.pro.user.* ################# ## Eclipse ################# *.pydevproject .project .metadata bin/ tmp/ *.tmp *.bak *.swp *~.nib local.properties .classpath .settings/ .loadpath # External tool builders .externalToolBuilders/ # Locally stored "Eclipse launch configurations" *.launch # CDT-specific .cproject # PDT-specific .buildpath ################# ## Visual Studio ################# ## Ignore Visual Studio temporary files, build results, and ## files generated by popular Visual Studio add-ons. # User-specific files *.suo *.user *.sln.docstates # Build results [Dd]ebug/ [Rr]elease/ x64/ build/ [Bb]in/ [Oo]bj/ # MSTest test Results [Tt]est[Rr]esult*/ [Bb]uild[Ll]og.* *_i.c *_p.c *.ilk *.meta *.obj *.pch *.pdb *.pgc *.pgd *.rsp *.sbr *.tlb *.tli *.tlh *.tmp *.tmp_proj *.log *.vspscc *.vssscc .builds *.pidb *.log *.scc # Visual C++ cache files ipch/ *.aps *.ncb *.opensdf *.sdf *.cachefile # Visual Studio profiler *.psess *.vsp *.vspx # Guidance Automation Toolkit *.gpState # ReSharper is a .NET coding add-in _ReSharper*/ *.[Rr]e[Ss]harper # TeamCity is a build add-in _TeamCity* # DotCover is a Code Coverage Tool *.dotCover # NCrunch *.ncrunch* .*crunch*.local.xml # Installshield output folder [Ee]xpress/ # DocProject is a documentation generator add-in DocProject/buildhelp/ DocProject/Help/*.HxT DocProject/Help/*.HxC DocProject/Help/*.hhc DocProject/Help/*.hhk DocProject/Help/*.hhp DocProject/Help/Html2 DocProject/Help/html # Click-Once directory publish/ # Publish Web Output *.Publish.xml *.pubxml # NuGet Packages Directory ## TODO: If you have NuGet Package Restore enabled, uncomment the next line #packages/ # Windows Azure Build Output csx *.build.csdef # Windows Store app package directory AppPackages/ # Others sql/ *.Cache ClientBin/ [Ss]tyle[Cc]op.* ~$* *~ *.dbmdl *.[Pp]ublish.xml *.pfx *.publishsettings # RIA/Silverlight projects Generated_Code/ # Backup & report files from converting an old project file to a newer # Visual Studio version. Backup files are not needed, because we have git ;-) _UpgradeReport_Files/ Backup*/ UpgradeLog*.XML UpgradeLog*.htm # SQL Server files App_Data/*.mdf App_Data/*.ldf ############# ## Windows detritus ############# # Windows image file caches Thumbs.db ehthumbs.db # Folder config file Desktop.ini .directory # Recycle Bin used on file shares $RECYCLE.BIN/ # Mac crap .DS_Store ############# ## Python ############# *.py[co] # Packages *.egg *.egg-info dist/ build/ eggs/ parts/ var/ sdist/ develop-eggs/ .installed.cfg # Installer logs pip-log.txt # Unit test / coverage reports .coverage .tox #Translations *.mo #Mr Developer .mr.developer.cfg ############# ## qmake / make ############# *.o Makefile uefitool_plugin_import.cpp UEFITool.app/ UEFITool/XCBuildData UEFIDump/UEFIDump UEFIExtract/UEFIExtract UEFIExtract/guids.csv UEFIFind/UEFIFind .qmake.stash CMakeCache.txt CMakeFiles cmake_install.cmake DerivedData *.xcodeproj compile_commands.json CMakeScripts UEFITool/qrc_uefitool.cpp XcodeQT5 XcodeQT6 *.dSYM UEFITool-A66/CMakeLists.txt000066400000000000000000000002301442134156300155340ustar00rootroot00000000000000CMAKE_MINIMUM_REQUIRED(VERSION 3.22) PROJECT(UEFITool_everything) ADD_SUBDIRECTORY(UEFIExtract) ADD_SUBDIRECTORY(UEFIFind) ADD_SUBDIRECTORY(UEFITool) UEFITool-A66/LICENSE.md000066400000000000000000000024211442134156300144040ustar00rootroot00000000000000Copyright (c) 2015, Nikolaj Schlej All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. UEFITool-A66/README.md000066400000000000000000000162211442134156300142620ustar00rootroot00000000000000# UEFITool UEFITool is a viewer and editor of firmware images conforming to UEFI Platform Interface (PI) Specifications. ![UEFITool icon](https://raw.githubusercontent.com/LongSoft/UEFITool/new_engine/UEFITool/icons/uefitool_64x64.png "UEFITool icon") ![CI Status](https://github.com/LongSoft/UEFITool/actions/workflows/main.yml/badge.svg?branch=new_engine) [![Scan Status](https://scan.coverity.com/projects/17209/badge.svg?flat=1)](https://scan.coverity.com/projects/17209) [![Quality Gate Status](https://sonarcloud.io/api/project_badges/measure?project=LongSoft_UEFITool&metric=alert_status)](https://sonarcloud.io/summary/new_code?id=LongSoft_UEFITool) ## Very Brief Introduction to UEFI Unified Extensible Firmware Interface or UEFI is a post-BIOS firmware specification originally written by Intel for Itanium architecture and than adapted for X86 systems. The first EFI-compatible x86 firmwares were used on Apple Macintosh systems in 2006 and PC motherboard vendors started putting UEFI-compatible firmwares on their boards in 2011. In 2015 there are numerous systems using UEFI-compatible firmware including PCs, Macs, Tablets and Smartphones on x86, x86-64 and ARM architectures. More information on UEFI is available on [UEFI Forum official site](http://www.uefi.org/faq) and in [Wikipedia](http://en.wikipedia.org/wiki/Unified_Extensible_Firmware_Interface). ## Very Brief Introduction to UEFITool UEFITool is a cross-platform open source application written in C++/Qt, that parses UEFI-compatible firmware image into a tree structure, verifies image's integrity and provides a GUI to manipulate image's elements. Project development started in the middle of 2013 because of the lack of cross-platform open source utilities for tinkering with UEFI images. In the beginning of 2015 the major refactoring round was started to make the program compatible with newer UEFI features including FFSv3 volumes and fixed image elements. It's in development right now with the following features still missing: * Editor part, i.e image reconstruction routines * Console UI The missing parts are in development and the version with a new engine will be made as soon as image reconstruction works again. ## Derived projects There are some other projects that use UEFITool's engine: * UEFIExtract, which uses ffsParser to parse supplied firmware image into a tree structure and dumps the parsed structure recursively on the FS. Jethro Beekman's [tree](https://github.com/jethrogb/uefireverse) utility can be used to work with the extracted tree. * UEFIFind, which uses ffsParser to find image elements containing a specified pattern. It was developed for [UBU](http://www.win-raid.com/t154f16-Tool-Guide-News-quot-UEFI-BIOS-Updater-quot-UBU.html) project. ## Alternatives Right now there are some alternatives to UEFITool that you could find useful too: * **[FMMT](https://github.com/tianocore/edk2/tree/master/BaseTools/Source/Python/FMMT)** by TianoCore. Python-based open source toolset for modifying EDK2-based UEFI firmware images. Does not support any IBV customizations, but is _official_, and lives in EDK2 repository. * **[Fiano](https://github.com/linuxboot/fiano)** by Google and Facebook. Go-based cross-platform open source toolset for modifying UEFI firmware images. * **[PhoenixTool](https://forums.mydigitallife.net/threads/tool-to-insert-replace-slic-in-phoenix-insyde-dell-efi-bioses.13194)** by [AndyP](https://forums.mydigitallife.net/members/andyp.39295). Windows-only freeware GUI application written in C#. Used mostly for SLIC-related modifications, but it not limited to this task. Requires Microsoft .NET 3.5 to work properly. Supports unpacking firmware images from various vendor-specific formats like encrypted HP update files and Dell installers. * **[uefi-firmware-parser](https://github.com/theopolis/uefi-firmware-parser)** by [Teddy Reed](https://github.com/theopolis). Cross-platform open source console application written in Python. Very tinker-friendly due to use of Python. Can be used in scripts to automate firmware patching. * **[Chipsec](https://github.com/chipsec/chipsec)** by Intel. Cross-platform partially open source console application written in Python and C. Can be used to test Intel-based platforms for various security-related misconfigurations, but also has NVRAM parser and other components aimed to firmware modification. ## Installation You can either use [pre-built binaries for Windows and macOS](https://github.com/LongSoft/UEFITool/releases) or build a binary yourself. * To build a binary that uses Qt library (UEFITool) you need a C++ compiler and an instance of [Qt5 or Qt6](https://www.qt.io) library. Install both of them, get the sources, generate makefiles using qmake (`qmake ./UEFITool/uefitool.pro`) and use your system's make command on that generated files (i.e. `nmake release`, `make release` and so on). Qt6-based builds can also use CMAKE as an altearnative build system. * To build a binary that doesn't use Qt (UEFIExtract, UEFIFind), you need a C++ compiler and [CMAKE](https://cmake.org) utility to generate a makefile for your OS and build environment. Install both of them, get the sources, generate makefiles using cmake (`cmake UEFIExtract`) and use your system's make command on that generated files (i.e. `nmake release`, `make release` and so on). Non-Qt builds can also use Meson as an alternative build system. ## Known issues * Image editing is currently only possible using an outdated and unsupported UEFITool 0.28 (`old_engine` branch) and the tools based on it (`UEFIReplace`, `UEFIPatch`). This is the top priority issue #67, which is being worked on, albeit slowly (due to the amount of coding and testing required to implement it correctly). * Some vendor-specific firmware update files can be opened incorrectly or can't be opened at all. This includes encrypted HP update files, Dell HDR and EXE files, some InsydeFlash FD files and so on. Enabling support for such files will require massive amount of reverse-engineering which is almost pointless because the updated image can be obtained from BIOS chip where it's already decrypted and unpacked. * Intel Firmware Interface Table (FIT) editing is not supported right now. FIT contains pointers to various image components that must be loaded before executing the first CPU instruction from the BIOS chip. Those components include CPU microcode updates, binaries and settings used by BIOS Guard and Boot Guard technologies and some other stuff. More information on FIT can be obtained [here](https://edc.intel.com/content/www/us/en/design/products-and-solutions/software-and-services/firmware-and-bios/firmware-interface-table/firmware-interface-table/). ## Bug repellents * [Coverity Scan](https://scan.coverity.com/projects/17209) - static analyzer for C, C++, C#, JavaScript, Ruby, or Python code. * [SonarCloud](https://sonarcloud.io/project/overview?id=LongSoft_UEFITool) - cloud-based code analysis service. * [PVS-Studio](https://pvs-studio.com/en/pvs-studio/?utm_source=github&utm_medium=organic&utm_campaign=open_source) - static analyzer for C, C++, C#, and Java code. * [CodeQL](https://codeql.github.com/docs/codeql-overview/about-codeql) - code analysis engine developed by GitHub to automate security checks. UEFITool-A66/UEFIExtract/000077500000000000000000000000001442134156300150645ustar00rootroot00000000000000UEFITool-A66/UEFIExtract/CMakeLists.txt000066400000000000000000000036241442134156300176310ustar00rootroot00000000000000CMAKE_MINIMUM_REQUIRED(VERSION 3.1.0 FATAL_ERROR) PROJECT(UEFIExtract) SET(CMAKE_CXX_STANDARD 11) SET(CMAKE_CXX_STANDARD_REQUIRED ON) SET(CMAKE_CXX_EXTENSIONS OFF) SET(PROJECT_SOURCES uefiextract_main.cpp ffsdumper.cpp uefidump.cpp ../common/guiddatabase.cpp ../common/types.cpp ../common/descriptor.cpp ../common/ffs.cpp ../common/nvram.cpp ../common/nvramparser.cpp ../common/meparser.cpp ../common/ffsparser.cpp ../common/fitparser.cpp ../common/ffsreport.cpp ../common/peimage.cpp ../common/treeitem.cpp ../common/treemodel.cpp ../common/utility.cpp ../common/LZMA/LzmaDecompress.c ../common/LZMA/SDK/C/Bra.c ../common/LZMA/SDK/C/Bra86.c ../common/LZMA/SDK/C/CpuArch.c ../common/LZMA/SDK/C/LzmaDec.c ../common/Tiano/EfiTianoDecompress.c ../common/ustring.cpp ../common/bstrlib/bstrlib.c ../common/bstrlib/bstrwrap.cpp ../common/generated/ami_nvar.cpp ../common/generated/intel_acbp_v1.cpp ../common/generated/intel_acbp_v2.cpp ../common/generated/intel_keym_v1.cpp ../common/generated/intel_keym_v2.cpp ../common/generated/intel_acm.cpp ../common/kaitai/kaitaistream.cpp ../common/digest/sha1.c ../common/digest/sha256.c ../common/digest/sha512.c ../common/digest/sm3.c ../common/zlib/adler32.c ../common/zlib/compress.c ../common/zlib/crc32.c ../common/zlib/deflate.c ../common/zlib/gzclose.c ../common/zlib/gzlib.c ../common/zlib/gzread.c ../common/zlib/gzwrite.c ../common/zlib/inflate.c ../common/zlib/infback.c ../common/zlib/inftrees.c ../common/zlib/inffast.c ../common/zlib/trees.c ../common/zlib/uncompr.c ../common/zlib/zutil.c ) ADD_DEFINITIONS(-DU_ENABLE_NVRAM_PARSING_SUPPORT -DU_ENABLE_ME_PARSING_SUPPORT -DU_ENABLE_FIT_PARSING_SUPPORT -DU_ENABLE_GUID_DATABASE_SUPPORT) ADD_EXECUTABLE(UEFIExtract ${PROJECT_SOURCES}) IF(UNIX) SET_TARGET_PROPERTIES(UEFIExtract PROPERTIES OUTPUT_NAME uefiextract) ENDIF() INSTALL( TARGETS UEFIExtract RUNTIME DESTINATION bin ) UEFITool-A66/UEFIExtract/ffsdumper.cpp000066400000000000000000000206111442134156300175630ustar00rootroot00000000000000/* ffsdumper.cpp Copyright (c) 2015, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "ffsdumper.h" #include USTATUS FfsDumper::dump(const UModelIndex & root, const UString & path, const DumpMode dumpMode, const UINT8 sectionType, const UString & guid) { dumped = false; counterHeader = counterBody = counterRaw = counterInfo = 0; fileList.clear(); if (changeDirectory(path)) { printf("Directory \"%s\" already exists.\n", (const char*)path.toLocal8Bit()); return U_DIR_ALREADY_EXIST; } currentPath = path; USTATUS result = recursiveDump(root, path, dumpMode, sectionType, guid); if (result) { printf("Error %zu returned from recursiveDump (directory \"%s\").\n", result, (const char*)path.toLocal8Bit()); return result; } else if (!dumped) { removeDirectory(path); printf("Removed directory \"%s\" since nothing was dumped.\n", (const char*)path.toLocal8Bit()); return U_ITEM_NOT_FOUND; } return U_SUCCESS; } USTATUS FfsDumper::recursiveDump(const UModelIndex & index, const UString & path, const DumpMode dumpMode, const UINT8 sectionType, const UString & guid) { if (!index.isValid()) return U_INVALID_PARAMETER; if (guid.isEmpty() || (model->subtype(index) == EFI_SECTION_FREEFORM_SUBTYPE_GUID && guidToUString(readUnaligned((const EFI_GUID*)(model->header(index).constData() + sizeof(EFI_COMMON_SECTION_HEADER)))) == guid) || guidToUString(readUnaligned((const EFI_GUID*)model->header(index).constData())) == guid || guidToUString(readUnaligned((const EFI_GUID*)model->header(model->findParentOfType(index, Types::File)).constData())) == guid) { if (!changeDirectory(path) && !makeDirectory(path)) { printf("Cannot use directory \"%s\" (recursiveDump part 1).\n", (const char*)path.toLocal8Bit()); return U_DIR_CREATE; } if (currentPath != path) { counterHeader = counterBody = counterRaw = counterInfo = 0; currentPath = path; } if (fileList.count(index) == 0 && (dumpMode == DUMP_ALL || model->rowCount(index) == 0) && (sectionType == IgnoreSectionType || model->subtype(index) == sectionType)) { if ((dumpMode == DUMP_ALL || dumpMode == DUMP_CURRENT || dumpMode == DUMP_HEADER) && !model->header(index).isEmpty()) { fileList.insert(index); UString filename; if (counterHeader == 0) filename = usprintf("%s/header.bin", path.toLocal8Bit()); else filename = usprintf("%s/header_%d.bin", path.toLocal8Bit(), counterHeader); counterHeader++; std::ofstream file(filename.toLocal8Bit(), std::ofstream::binary); if (!file) { printf("Cannot open header \"%s\".\n", (const char*)filename.toLocal8Bit()); return U_FILE_OPEN; } const UByteArray &data = model->header(index); file.write(data.constData(), data.size()); dumped = true; } if ((dumpMode == DUMP_ALL || dumpMode == DUMP_CURRENT || dumpMode == DUMP_BODY) && !model->body(index).isEmpty()) { fileList.insert(index); UString filename; if (counterBody == 0) filename = usprintf("%s/body.bin", path.toLocal8Bit()); else filename = usprintf("%s/body_%d.bin", path.toLocal8Bit(), counterBody); counterBody++; std::ofstream file(filename.toLocal8Bit(), std::ofstream::binary); if (!file) { printf("Cannot open body \"%s\".\n", (const char*)filename.toLocal8Bit()); return U_FILE_OPEN; } const UByteArray &data = model->body(index); file.write(data.constData(), data.size()); dumped = true; } if (dumpMode == DUMP_FILE) { UModelIndex fileIndex = index; if (model->type(fileIndex) != Types::File) { fileIndex = model->findParentOfType(index, Types::File); if (!fileIndex.isValid()) fileIndex = index; } // We may select parent file during ffs extraction. if (fileList.count(fileIndex) == 0) { fileList.insert(fileIndex); UString filename; if (counterRaw == 0) filename = usprintf("%s/file.ffs", path.toLocal8Bit()); else filename = usprintf("%s/file_%d.ffs", path.toLocal8Bit(), counterRaw); counterRaw++; std::ofstream file(filename.toLocal8Bit(), std::ofstream::binary); if (!file) { printf("Cannot open file \"%s\".\n", (const char*)filename.toLocal8Bit()); return U_FILE_OPEN; } const UByteArray &headerData = model->header(fileIndex); const UByteArray &bodyData = model->body(fileIndex); const UByteArray &tailData = model->tail(fileIndex); file.write(headerData.constData(), headerData.size()); file.write(bodyData.constData(), bodyData.size()); file.write(tailData.constData(), tailData.size()); dumped = true; } } } // Always dump info unless explicitly prohibited if ((dumpMode == DUMP_ALL || dumpMode == DUMP_CURRENT || dumpMode == DUMP_INFO) && (sectionType == IgnoreSectionType || model->subtype(index) == sectionType)) { UString info = usprintf("Type: %s\nSubtype: %s\n%s%s\n", itemTypeToUString(model->type(index)).toLocal8Bit(), itemSubtypeToUString(model->type(index), model->subtype(index)).toLocal8Bit(), (model->text(index).isEmpty() ? UString("") : usprintf("Text: %s\n", model->text(index).toLocal8Bit())).toLocal8Bit(), model->info(index).toLocal8Bit()); UString filename; if (counterInfo == 0) filename = usprintf("%s/info.txt", path.toLocal8Bit()); else filename = usprintf("%s/info_%d.txt", path.toLocal8Bit(), counterInfo); counterInfo++; std::ofstream file(filename.toLocal8Bit()); if (!file) { printf("Cannot open info \"%s\".\n", (const char*)filename.toLocal8Bit()); return U_FILE_OPEN; } file << info.toLocal8Bit(); dumped = true; } } USTATUS result; for (int i = 0; i < model->rowCount(index); i++) { UModelIndex childIndex = index.child(i, 0); bool useText = FALSE; if (model->type(childIndex) != Types::Volume) useText = !model->text(childIndex).isEmpty(); UString childPath = path; if (dumpMode == DUMP_ALL || dumpMode == DUMP_CURRENT) { if (!changeDirectory(path) && !makeDirectory(path)) { printf("Cannot use directory \"%s\" (recursiveDump part 2).\n", (const char*)path.toLocal8Bit()); return U_DIR_CREATE; } UString name = usprintf("%d %s", i, (useText ? model->text(childIndex) : model->name(childIndex)).toLocal8Bit()); fixFileName (name, false); childPath = usprintf("%s/%s", path.toLocal8Bit(), name.toLocal8Bit()); } result = recursiveDump(childIndex, childPath, dumpMode, sectionType, guid); if (result) { printf("Error %zu returned from recursiveDump (child directory \"%s\").\n", result, (const char*)childPath.toLocal8Bit()); return result; } } return U_SUCCESS; } UEFITool-A66/UEFIExtract/ffsdumper.h000066400000000000000000000031721442134156300172330ustar00rootroot00000000000000/* ffsdumper.h Copyright (c) 2015, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef FFSDUMPER_H #define FFSDUMPER_H #include #include "../common/basetypes.h" #include "../common/ustring.h" #include "../common/treemodel.h" #include "../common/ffs.h" #include "../common/filesystem.h" #include "../common/utility.h" class FfsDumper { public: enum DumpMode { DUMP_CURRENT, DUMP_ALL, DUMP_BODY, DUMP_HEADER, DUMP_INFO, DUMP_FILE }; static const UINT8 IgnoreSectionType = 0xFF; explicit FfsDumper(TreeModel * treeModel) : model(treeModel), dumped(false), counterHeader(0), counterBody(0), counterRaw(0), counterInfo(0) {} ~FfsDumper() {}; USTATUS dump(const UModelIndex & root, const UString & path, const DumpMode dumpMode = DUMP_CURRENT, const UINT8 sectionType = IgnoreSectionType, const UString & guid = UString()); private: USTATUS recursiveDump(const UModelIndex & root, const UString & path, const DumpMode dumpMode, const UINT8 sectionType, const UString & guid); TreeModel* model; UString currentPath; bool dumped; int counterHeader, counterBody, counterRaw, counterInfo; std::set fileList; }; #endif // FFSDUMPER_H UEFITool-A66/UEFIExtract/meson.build000066400000000000000000000003471442134156300172320ustar00rootroot00000000000000executable( 'UEFIExtract', sources: [ 'uefiextract_main.cpp', 'ffsdumper.cpp', 'uefidump.cpp', ], link_with: [ lzma, bstrlib, uefitoolcommon, ], dependencies: [ zlib, ], install: true, ) UEFITool-A66/UEFIExtract/uefidump.cpp000066400000000000000000000106241442134156300174110ustar00rootroot00000000000000/* ffsdumper.cpp Copyright (c) 2018, LongSoft. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "uefidump.h" #include "../common/ffs.h" #include "../common/utility.h" #include "../common/filesystem.h" #include #include #include #include USTATUS UEFIDumper::dump(const UByteArray & buffer, const UString & inPath, const UString & guid) { UString path = UString(inPath) + UString(".dump"); UString reportPath = UString(inPath) + UString(".report.txt"); if (initialized) { // Check if called with a different buffer as before if (buffer != currentBuffer) { // Reinitalize if so initialized = false; } } if (!initialized) { // Fill currentBuffer currentBuffer = buffer; // Parse FFS structure USTATUS result = ffsParser.parse(buffer); if (result) return result; ffsParser.outputInfo(); // Create ffsReport FfsReport ffsReport(&model); std::vector report = ffsReport.generate(); if (report.size()) { std::ofstream ofs; ofs.open(reportPath, std::ofstream::out); for (size_t i = 0; i < report.size(); i++) { ofs << report[i].toLocal8Bit() << std::endl; } ofs.close(); } initialized = true; } // Check for dump directory existence if (isExistOnFs(path)) return U_DIR_ALREADY_EXIST; // Create dump directory and cd to it if (!makeDirectory(path)) return U_DIR_CREATE; if (!changeDirectory(path)) return U_DIR_CHANGE; dumped = false; USTATUS result = recursiveDump(model.index(0,0)); if (result) return result; else if (!dumped) return U_ITEM_NOT_FOUND; return U_SUCCESS; } USTATUS UEFIDumper::recursiveDump(const UModelIndex & index) { if (!index.isValid()) return U_INVALID_PARAMETER; // Construct file name UString orgName = uniqueItemName(index); UString name = orgName; bool nameFound = false; for (int i = 1; i < 1000; ++i) { if (!isExistOnFs(name + UString("_info.txt"))) { nameFound = true; break; } name = orgName + UString("_") + usprintf("%03d", i); } if (!nameFound) { printf("Cannot find unique name for \"%s\".\n", (const char*)orgName.toLocal8Bit()); return U_INVALID_PARAMETER; //TODO: replace with proper errorCode } // Add header and body only for leaf sections if (model.rowCount(index) == 0) { // Header UByteArray data = model.header(index); if (!data.isEmpty()) { std::ofstream file; UString str = name + UString("_header.bin"); file.open(str.toLocal8Bit(), std::ios::out | std::ios::binary); file.write(data.constData(), data.size()); file.close(); } // Body data = model.body(index); if (!data.isEmpty()) { std::ofstream file; UString str = name + UString("_body.bin"); file.open(str.toLocal8Bit(), std::ios::out | std::ios::binary); file.write(data.constData(), data.size()); file.close(); } } // Info UString info = "Type: " + itemTypeToUString(model.type(index)) + "\n" + "Subtype: " + itemSubtypeToUString(model.type(index), model.subtype(index)) + "\n"; if (model.text(index).length() > 0) info += "Text: " + model.text(index) + "\n"; info += model.info(index) + "\n"; std::ofstream file; UString str = name + UString("_info.txt"); file.open(str.toLocal8Bit(), std::ios::out); file.write(info.toLocal8Bit(), info.length()); file.close(); dumped = true; // Process child items USTATUS result; for (int i = 0; i < model.rowCount(index); i++) { result = recursiveDump(index.child(i, 0)); if (result) return result; } return U_SUCCESS; } UEFITool-A66/UEFIExtract/uefidump.h000066400000000000000000000022321442134156300170520ustar00rootroot00000000000000/* uefidump.h Copyright (c) 2018, LongSoft. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef UEFIDUMP_H #define UEFIDUMP_H #include "../common/basetypes.h" #include "../common/ustring.h" #include "../common/treemodel.h" #include "../common/ffsparser.h" #include "../common/ffsreport.h" class UEFIDumper { public: explicit UEFIDumper() : model(), ffsParser(&model), ffsReport(&model), currentBuffer(), initialized(false), dumped(false) {} ~UEFIDumper() {} USTATUS dump(const UByteArray & buffer, const UString & path, const UString & guid = UString()); private: USTATUS recursiveDump(const UModelIndex & root); TreeModel model; FfsParser ffsParser; FfsReport ffsReport; UByteArray currentBuffer; bool initialized; bool dumped; }; #endif UEFITool-A66/UEFIExtract/uefiextract_main.cpp000066400000000000000000000214441442134156300211240ustar00rootroot00000000000000/* uefiextract_main.cpp Copyright (c) 2018, LongSoft. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include #include #include #include #include "../version.h" #include "../common/basetypes.h" #include "../common/ustring.h" #include "../common/filesystem.h" #include "../common/ffsparser.h" #include "../common/ffsreport.h" #include "../common/guiddatabase.h" #include "ffsdumper.h" #include "uefidump.h" enum ReadType { READ_INPUT, READ_OUTPUT, READ_MODE, READ_SECTION }; void print_usage() { std::cout << "UEFIExtract " PROGRAM_VERSION << std::endl << "Usage: UEFIExtract {-h | --help | -v | --version} - show help and/or version information." << std::endl << " UEFIExtract imagefile - generate report and GUID database, then dump only leaf tree items into .dump folder." << std::endl << " UEFIExtract imagefile all - generate report and GUID database, then dump all tree items into .dump folder." << std::endl << " UEFIExtract imagefile unpack - generate report, then dump all tree items into a single .dump folder (legacy UEFIDump compatibility mode)." << std::endl << " UEFIExtract imagefile dump - only generate dump, no report or GUID database needed." << std::endl << " UEFIExtract imagefile report - only generate report, no dump or GUID database needed." << std::endl << " UEFIExtract imagefile guids - only generate GUID database, no dump or report needed." << std::endl << " UEFIExtract imagefile GUID_1 ... [ -o FILE_1 ... ] [ -m MODE_1 ... ] [ -t TYPE_1 ... ] -" << std::endl << " Dump only FFS file(s) with specific GUID(s), without report or GUID database." << std::endl << " Type is section type or FF to ignore. Mode is one of: all, body, header, info, file." << std::endl << " Return value is a bit mask where 0 at position N means that file with GUID_N was found and unpacked, 1 otherwise." << std::endl; } int main(int argc, char *argv[]) { initGuidDatabase("guids.csv"); if (argc <= 1) { print_usage(); return 1; } // Help and version if (argc == 2) { UString arg = UString(argv[1]); if (arg == UString("-h") || arg == UString("--help")) { print_usage(); return 0; } else if (arg == UString("-v") || arg == UString("--version")) { std::cout << PROGRAM_VERSION << std::endl; return 0; } } // Check that input file exists USTATUS result; UByteArray buffer; UString path = getAbsPath(argv[1]); result = readFileIntoBuffer(path, buffer); if (result) return result; // Hack to support legacy UEFIDump mode if (argc == 3 && !std::strcmp(argv[2], "unpack")) { UEFIDumper uefidumper; return (uefidumper.dump(buffer, UString(argv[1])) != U_SUCCESS); } // Create model and ffsParser TreeModel model; FfsParser ffsParser(&model); // Parse input buffer result = ffsParser.parse(buffer); if (result) return result; ffsParser.outputInfo(); // Create ffsDumper FfsDumper ffsDumper(&model); // Dump only leaf elements, no report or GUID database if (argc == 3 && !std::strcmp(argv[2], "dump")) { return (ffsDumper.dump(model.index(0, 0), path + UString(".dump")) != U_SUCCESS); } // Dump named GUIDs found in the image, no dump or report else if (argc == 3 && !std::strcmp(argv[2], "guids")) { GuidDatabase db = guidDatabaseFromTreeRecursive(&model, model.index(0, 0)); if (!db.empty()) { return guidDatabaseExportToFile(path + UString(".guids.csv"), db); } } // Generate report, no dump or GUID database else if (argc == 3 && !std::strcmp(argv[2], "report")) { FfsReport ffsReport(&model); std::vector report = ffsReport.generate(); if (report.size()) { std::ofstream file; file.open((path + UString(".report.txt")).toLocal8Bit()); for (size_t i = 0; i < report.size(); i++) file << report[i].toLocal8Bit() << '\n'; return 0; } return 1; } // Either default or all mode else if (argc == 2 || (argc == 3 && !std::strcmp(argv[2], "all"))) { // Generate report FfsReport ffsReport(&model); std::vector report = ffsReport.generate(); if (report.size()) { std::ofstream file; file.open((path + UString(".report.txt")).toLocal8Bit()); for (size_t i = 0; i < report.size(); i++) file << report[i].toLocal8Bit() << '\n'; } // Create GUID database GuidDatabase db = guidDatabaseFromTreeRecursive(&model, model.index(0, 0)); if (!db.empty()) { guidDatabaseExportToFile(path + UString(".guids.csv"), db); } // Dump all non-leaf elements, with report and GUID database, default if (argc == 2) { return (ffsDumper.dump(model.index(0, 0), path + UString(".dump")) != U_SUCCESS); } else if (argc == 3 && !std::strcmp(argv[2], "all")) { // Dump every element with report and GUID database return (ffsDumper.dump(model.index(0, 0), path + UString(".dump"), FfsDumper::DUMP_ALL) != U_SUCCESS); } } // Dump specific files, without report or GUID database else { std::vector inputs, outputs; std::vector modes; std::vector sectionTypes; ReadType readType = READ_INPUT; for (int i = 2; i < argc; i++) { const char *arg = argv[i]; if (!std::strcmp(arg, "-i")) { readType = READ_INPUT; continue; } else if (!std::strcmp(arg, "-o")) { readType = READ_OUTPUT; continue; } else if (!std::strcmp(arg, "-m")) { readType = READ_MODE; continue; } else if (!std::strcmp(arg, "-t")) { readType = READ_SECTION; continue; } if (readType == READ_INPUT) { inputs.push_back(arg); } else if (readType == READ_OUTPUT) { outputs.push_back(getAbsPath(arg)); } else if (readType == READ_MODE) { if (!std::strcmp(arg, "all")) modes.push_back(FfsDumper::DUMP_ALL); else if (!std::strcmp(arg, "body")) modes.push_back(FfsDumper::DUMP_BODY); else if (!std::strcmp(arg, "header")) modes.push_back(FfsDumper::DUMP_HEADER); else if (!std::strcmp(arg, "info")) modes.push_back(FfsDumper::DUMP_INFO); else if (!std::strcmp(arg, "file")) modes.push_back(FfsDumper::DUMP_FILE); else return U_INVALID_PARAMETER; } else if (readType == READ_SECTION) { char *converted = const_cast(arg); UINT8 sectionType = (UINT8)std::strtol(arg, &converted, 16); if (converted == arg) return U_INVALID_PARAMETER; sectionTypes.push_back(sectionType); } } if (inputs.empty() || (!outputs.empty() && inputs.size() != outputs.size()) || (!modes.empty() && inputs.size() != modes.size()) || (!sectionTypes.empty() && inputs.size() != sectionTypes.size())) return U_INVALID_PARAMETER; USTATUS lastError = U_SUCCESS; for (size_t i = 0; i < inputs.size(); i++) { UString outPath = outputs.empty() ? path + UString(".dump") : outputs[i]; FfsDumper::DumpMode mode = modes.empty() ? FfsDumper::DUMP_ALL : modes[i]; UINT8 type = sectionTypes.empty() ? FfsDumper::IgnoreSectionType : sectionTypes[i]; result = ffsDumper.dump(model.index(0, 0), outPath, mode, type, inputs[i]); if (result) { std::cout << "Guid " << inputs[i].toLocal8Bit() << " failed with " << result << " code!" << std::endl; lastError = result; } } return lastError; } // If parameters are different, show version and usage information print_usage(); return 1; } UEFITool-A66/UEFIFind/000077500000000000000000000000001442134156300143325ustar00rootroot00000000000000UEFITool-A66/UEFIFind/CMakeLists.txt000066400000000000000000000032601442134156300170730ustar00rootroot00000000000000CMAKE_MINIMUM_REQUIRED(VERSION 3.1.0 FATAL_ERROR) PROJECT(UEFIFind) SET(CMAKE_CXX_STANDARD 11) SET(CMAKE_CXX_STANDARD_REQUIRED ON) SET(CMAKE_CXX_EXTENSIONS OFF) SET(PROJECT_SOURCES uefifind_main.cpp uefifind.cpp ../common/guiddatabase.cpp ../common/types.cpp ../common/descriptor.cpp ../common/ffs.cpp ../common/nvram.cpp ../common/nvramparser.cpp ../common/ffsparser.cpp ../common/fitparser.cpp ../common/peimage.cpp ../common/treeitem.cpp ../common/treemodel.cpp ../common/utility.cpp ../common/LZMA/LzmaDecompress.c ../common/LZMA/SDK/C/Bra.c ../common/LZMA/SDK/C/Bra86.c ../common/LZMA/SDK/C/CpuArch.c ../common/LZMA/SDK/C/LzmaDec.c ../common/Tiano/EfiTianoDecompress.c ../common/ustring.cpp ../common/bstrlib/bstrlib.c ../common/bstrlib/bstrwrap.cpp ../common/generated/ami_nvar.cpp ../common/generated/intel_acbp_v1.cpp ../common/generated/intel_acbp_v2.cpp ../common/generated/intel_keym_v1.cpp ../common/generated/intel_keym_v2.cpp ../common/generated/intel_acm.cpp ../common/kaitai/kaitaistream.cpp ../common/digest/sha1.c ../common/digest/sha256.c ../common/digest/sha512.c ../common/digest/sm3.c ../common/zlib/adler32.c ../common/zlib/compress.c ../common/zlib/crc32.c ../common/zlib/deflate.c ../common/zlib/gzclose.c ../common/zlib/gzlib.c ../common/zlib/gzread.c ../common/zlib/gzwrite.c ../common/zlib/inflate.c ../common/zlib/infback.c ../common/zlib/inftrees.c ../common/zlib/inffast.c ../common/zlib/trees.c ../common/zlib/uncompr.c ../common/zlib/zutil.c ) ADD_EXECUTABLE(UEFIFind ${PROJECT_SOURCES}) IF(UNIX) SET_TARGET_PROPERTIES(UEFIFind PROPERTIES OUTPUT_NAME uefifind) ENDIF() INSTALL( TARGETS UEFIFind RUNTIME DESTINATION bin ) UEFITool-A66/UEFIFind/meson.build000066400000000000000000000003141442134156300164720ustar00rootroot00000000000000executable( 'UEFIFind', sources: [ 'uefifind_main.cpp', 'uefifind.cpp', ], link_with: [ lzma, bstrlib, uefitoolcommon, ], dependencies: [ zlib, ], install: true, ) UEFITool-A66/UEFIFind/uefifind.cpp000066400000000000000000000115561442134156300166370ustar00rootroot00000000000000/* uefifind.cpp Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "uefifind.h" #include #include UEFIFind::UEFIFind() { model = new TreeModel(); ffsParser = new FfsParser(model); initDone = false; } UEFIFind::~UEFIFind() { delete ffsParser; delete model; model = NULL; } USTATUS UEFIFind::init(const UString & path) { USTATUS result; UByteArray buffer; result = readFileIntoBuffer(path, buffer); if (result) return result; result = ffsParser->parse(buffer); if (result) return result; initDone = true; return U_SUCCESS; } USTATUS UEFIFind::findFileRecursive(const UModelIndex index, const UString & hexPattern, const UINT8 mode, std::set > & files) { if (!index.isValid()) return U_SUCCESS; if (hexPattern.isEmpty()) return U_INVALID_PARAMETER; const char *hexPatternRaw = hexPattern.toLocal8Bit(); std::vector pattern, patternMask; if (!makePattern(hexPatternRaw, pattern, patternMask)) return U_INVALID_PARAMETER; // Check for "all substrings" pattern size_t count = 0; for (size_t i = 0; i < patternMask.size(); i++) if (patternMask[i] == 0) count++; if (count == patternMask.size()) return U_SUCCESS; bool hasChildren = (model->rowCount(index) > 0); for (int i = 0; i < model->rowCount(index); i++) { findFileRecursive(index.model()->index(i, index.column(), index), hexPattern, mode, files); } // TODO: handle a case where an item has both compressed and uncompressed bodies UByteArray data; if (hasChildren) { if (mode == SEARCH_MODE_HEADER) data = model->header(index); else if (mode == SEARCH_MODE_ALL) data = model->header(index) + model->body(index); } else { if (mode == SEARCH_MODE_HEADER) data = model->header(index); else if (mode == SEARCH_MODE_BODY) data = model->body(index); else data = model->header(index) + model->body(index); } const UINT8 *rawData = reinterpret_cast(data.constData()); INTN offset = findPattern(pattern.data(), patternMask.data(), pattern.size(), rawData, data.size(), 0); // For patterns that cross header|body boundary, skip patterns entirely located in body, since // children search above has already found them. if (hasChildren && mode == SEARCH_MODE_ALL && offset >= model->header(index).size()) { offset = -1; } if (offset >= 0) { if (model->type(index) != Types::File) { UModelIndex parentFile = model->findParentOfType(index, Types::File); if (model->type(index) == Types::Section && model->subtype(index) == EFI_SECTION_FREEFORM_SUBTYPE_GUID) files.insert(std::pair(parentFile, index)); else files.insert(std::pair(parentFile, UModelIndex())); } else { files.insert(std::pair(index, UModelIndex())); } } return U_SUCCESS; } USTATUS UEFIFind::find(const UINT8 mode, const bool count, const UString & hexPattern, UString & result) { UModelIndex root = model->index(0, 0); std::set > files; result.clear(); USTATUS returned = findFileRecursive(root, hexPattern, mode, files); if (returned) return returned; if (count) { if (!files.empty()) result += usprintf("%lu\n", files.size()); return U_SUCCESS; } for (std::set >::const_iterator citer = files.begin(); citer != files.end(); ++citer) { UByteArray data(16, '\x00'); std::pair indexes = *citer; if (!model->hasEmptyHeader(indexes.first)) data = model->header(indexes.first).left(16); result += guidToUString(readUnaligned((const EFI_GUID*)data.constData())); // Special case of freeform subtype GUID files if (indexes.second.isValid() && model->subtype(indexes.second) == EFI_SECTION_FREEFORM_SUBTYPE_GUID) { data = model->header(indexes.second); result += UString(" ") + (guidToUString(readUnaligned((const EFI_GUID*)(data.constData() + sizeof(EFI_COMMON_SECTION_HEADER))))); } result += UString("\n"); } return U_SUCCESS; } UEFITool-A66/UEFIFind/uefifind.h000066400000000000000000000023001442134156300162670ustar00rootroot00000000000000/* uefifind.h Copyright (c) 2015, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef UEFIFIND_H #define UEFIFIND_H #include #include #include "../common/basetypes.h" #include "../common/ustring.h" #include "../common/filesystem.h" #include "../common/ffsparser.h" #include "../common/ffs.h" #include "../common/utility.h" class UEFIFind { public: explicit UEFIFind(); ~UEFIFind(); USTATUS init(const UString & path); USTATUS find(const UINT8 mode, const bool count, const UString & hexPattern, UString & result); private: USTATUS findFileRecursive(const UModelIndex index, const UString & hexPattern, const UINT8 mode, std::set > & files); FfsParser* ffsParser; TreeModel* model; bool initDone; }; #endif // UEFIFIND_H UEFITool-A66/UEFIFind/uefifind_main.cpp000066400000000000000000000136171442134156300176430ustar00rootroot00000000000000/* uefifind_main.cpp Copyright (c) 2018, LongSoft. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include #include #include #include #include "../version.h" #include "../common/guiddatabase.h" #include "uefifind.h" void print_usage() { std::cout << "UEFIFind " PROGRAM_VERSION << std::endl << "Usage: UEFIFind {-h | --help | -v | -version}" << std::endl << " UEFIFind imagefile {header | body | all} {list | count} pattern" << std::endl << " UEFIFind imagefile file patternsfile" << std::endl; } int main(int argc, char *argv[]) { UEFIFind w; USTATUS result; initGuidDatabase("guids.csv"); if (argc == 1) { print_usage(); return U_SUCCESS; } else if (argc == 2) { UString arg = argv[1]; if (arg == UString("-h") || arg == UString("--help")) { print_usage(); return U_SUCCESS; } else if (arg == UString("-v") || arg == UString("--version")) { std::cout << PROGRAM_VERSION << std::endl; return U_SUCCESS; } } else if (argc == 5) { UString inputArg = argv[1]; UString modeArg = argv[2]; UString subModeArg = argv[3]; UString patternArg = argv[4]; // Get search mode UINT8 mode; if (modeArg == UString("header")) mode = SEARCH_MODE_HEADER; else if (modeArg == UString("body")) mode = SEARCH_MODE_BODY; else if (modeArg == UString("all")) mode = SEARCH_MODE_ALL; else return U_INVALID_PARAMETER; // Get result type bool count; if (subModeArg == UString("list")) count = false; else if (subModeArg == UString("count")) count = true; else return U_INVALID_PARAMETER; // Parse input file result = w.init(inputArg); if (result) return result; // Go find the supplied pattern UString found; result = w.find(mode, count, patternArg, found); if (result) return result; // Nothing is found if (found.isEmpty()) return U_ITEM_NOT_FOUND; // Print result std::cout << found.toLocal8Bit(); return U_SUCCESS; } else if (argc == 4) { UString inputArg = argv[1]; UString modeArg = argv[2]; UString patternArg = argv[3]; // Get search mode if (modeArg != UString("file")) return U_INVALID_PARAMETER; // Open patterns file if (!isExistOnFs(patternArg)) return U_FILE_OPEN; std::ifstream patternsFile(patternArg.toLocal8Bit()); if (!patternsFile) return U_FILE_OPEN; // Parse input file result = w.init(inputArg); if (result) return result; // Perform searches bool somethingFound = false; while (!patternsFile.eof()) { std::string line; std::getline(patternsFile, line); // Use sharp symbol as commentary if (line.size() == 0 || line[0] == '#') continue; // Split the read line std::vector list; std::string::size_type prev = 0, curr = 0; while ((curr = line.find(' ', curr)) != std::string::npos) { std::string substring( line.substr(prev, curr-prev) ); list.push_back(UString(substring.c_str())); prev = ++curr; } list.push_back(UString(line.substr(prev, curr-prev).c_str())); if (list.size() < 3) { std::cout << line << std::endl << "skipped, too few arguments" << std::endl << std::endl; continue; } // Get search mode UINT8 mode; if (list.at(0) == UString("header")) mode = SEARCH_MODE_HEADER; else if (list.at(0) == UString("body")) mode = SEARCH_MODE_BODY; else if (list.at(0) == UString("all")) mode = SEARCH_MODE_ALL; else { std::cout << line << std::endl << "skipped, invalid search mode" << std::endl << std::endl; continue; } // Get result type bool count; if (list.at(1) == UString("list")) count = false; else if (list.at(1) == UString("count")) count = true; else { std::cout << line << std::endl << "skipped, invalid result type" << std::endl << std::endl; continue; } // Go find the supplied pattern UString found; result = w.find(mode, count, list.at(2), found); if (result) { std::cout << line << std::endl << "skipped, find failed with error " << (UINT32)result << std::endl << std::endl; continue; } if (found.isEmpty()) { // Nothing is found std::cout << line << std::endl << "nothing found" << std::endl << std::endl; } else { // Print result std::cout << line << std::endl << found.toLocal8Bit() << std::endl; somethingFound = true; } } // Nothing is found if (!somethingFound) return U_ITEM_NOT_FOUND; return U_SUCCESS; } print_usage(); return U_INVALID_PARAMETER; } UEFITool-A66/UEFITool/000077500000000000000000000000001442134156300143675ustar00rootroot00000000000000UEFITool-A66/UEFITool/CMakeLists.txt000066400000000000000000000102001442134156300171200ustar00rootroot00000000000000CMAKE_MINIMUM_REQUIRED(VERSION 3.22) PROJECT(UEFITool LANGUAGES C CXX) SET(CMAKE_CXX_STANDARD 11) SET(CMAKE_CXX_STANDARD_REQUIRED ON) SET(CMAKE_CXX_EXTENSIONS OFF) FIND_PACKAGE(Qt6 REQUIRED COMPONENTS Widgets) SET(PROJECT_FORMS uefitool.ui searchdialog.ui hexviewdialog.ui gotobasedialog.ui gotoaddressdialog.ui ) SET(PROJECT_HEADERS uefitool.h hexspinbox.h searchdialog.h hexviewdialog.h gotobasedialog.h gotoaddressdialog.h qhexview5/qhexview.h ) SET(PROJECT_SOURCES icons/uefitool.icns uefitool.rc uefitool_main.cpp uefitool.cpp searchdialog.cpp hexviewdialog.cpp hexlineedit.cpp ffsfinder.cpp hexspinbox.cpp qhexview5/model/buffer/qhexbuffer.cpp qhexview5/model/buffer/qdevicebuffer.cpp qhexview5/model/buffer/qmemorybuffer.cpp qhexview5/model/commands/hexcommand.cpp qhexview5/model/commands/insertcommand.cpp qhexview5/model/commands/removecommand.cpp qhexview5/model/commands/replacecommand.cpp qhexview5/model/qhexcursor.cpp qhexview5/model/qhexdelegate.cpp qhexview5/model/qhexdocument.cpp qhexview5/model/qhexmetadata.cpp qhexview5/model/qhexutils.cpp qhexview5/qhexview.cpp ../common/fitparser.cpp ../common/guiddatabase.cpp ../common/nvram.cpp ../common/nvramparser.cpp ../common/meparser.cpp ../common/ffsops.cpp ../common/types.cpp ../common/descriptor.cpp ../common/ffs.cpp ../common/peimage.cpp ../common/utility.cpp ../common/ffsbuilder.cpp ../common/ffsparser.cpp ../common/ffsreport.cpp ../common/treeitem.cpp ../common/treemodel.cpp ../common/LZMA/LzmaCompress.c ../common/LZMA/LzmaDecompress.c ../common/LZMA/SDK/C/CpuArch.c ../common/LZMA/SDK/C/Bra.c ../common/LZMA/SDK/C/Bra86.c ../common/LZMA/SDK/C/LzFind.c ../common/LZMA/SDK/C/LzmaDec.c ../common/LZMA/SDK/C/LzmaEnc.c ../common/Tiano/EfiTianoDecompress.c ../common/Tiano/EfiTianoCompress.c ../common/Tiano/EfiTianoCompressLegacy.c ../common/ustring.cpp ../common/digest/sha1.c ../common/digest/sha256.c ../common/digest/sha512.c ../common/digest/sm3.c ../common/generated/ami_nvar.cpp ../common/generated/intel_acbp_v1.cpp ../common/generated/intel_acbp_v2.cpp ../common/generated/intel_keym_v1.cpp ../common/generated/intel_keym_v2.cpp ../common/generated/intel_acm.cpp ../common/kaitai/kaitaistream.cpp ../common/zlib/adler32.c ../common/zlib/compress.c ../common/zlib/crc32.c ../common/zlib/deflate.c ../common/zlib/gzclose.c ../common/zlib/gzlib.c ../common/zlib/gzread.c ../common/zlib/gzwrite.c ../common/zlib/inflate.c ../common/zlib/infback.c ../common/zlib/inftrees.c ../common/zlib/inffast.c ../common/zlib/trees.c ../common/zlib/uncompr.c ../common/zlib/zutil.c ) QT_ADD_RESOURCES(PROJECT_SOURCES uefitool.qrc ) ADD_DEFINITIONS( -DU_ENABLE_NVRAM_PARSING_SUPPORT -DU_ENABLE_ME_PARSING_SUPPORT -DU_ENABLE_FIT_PARSING_SUPPORT -DU_ENABLE_GUID_DATABASE_SUPPORT ) SET_SOURCE_FILES_PROPERTIES(icons/uefitool.icns PROPERTIES MACOSX_PACKAGE_LOCATION "Resources") ADD_EXECUTABLE(UEFITool ${PROJECT_HEADERS} ${PROJECT_FORMS} ${PROJECT_SOURCES}) TARGET_INCLUDE_DIRECTORIES(UEFITool PRIVATE "${CMAKE_CURRENT_SOURCE_DIR}") TARGET_LINK_LIBRARIES(UEFITool PRIVATE Qt6::Widgets) SET_TARGET_PROPERTIES(UEFITool PROPERTIES WIN32_EXECUTABLE ON MACOSX_BUNDLE ON MACOSX_BUNDLE_INFO_PLIST "${CMAKE_CURRENT_SOURCE_DIR}/Info.plist" AUTOMOC ON AUTOUIC ON ) IF(UNIX AND (NOT APPLE) AND (NOT CYGWIN)) SET_TARGET_PROPERTIES(UEFITool PROPERTIES OUTPUT_NAME uefitool) INSTALL(FILES icons/uefitool_16x16.png DESTINATION share/icons/hicolor/16x16/apps RENAME uefitool.png) INSTALL(FILES icons/uefitool_32x32.png DESTINATION share/icons/hicolor/32x32/apps RENAME uefitool.png) INSTALL(FILES icons/uefitool_64x64.png DESTINATION share/icons/hicolor/64x64/apps RENAME uefitool.png) INSTALL(FILES icons/uefitool_128x128.png DESTINATION share/icons/hicolor/128x128/apps RENAME uefitool.png) INSTALL(FILES icons/uefitool_256x256.png DESTINATION share/icons/hicolor/256x256/apps RENAME uefitool.png) INSTALL(FILES icons/uefitool_512x512.png DESTINATION share/icons/hicolor/512x512/apps RENAME uefitool.png) INSTALL(FILES uefitool.desktop DESTINATION share/applications) ENDIF() INSTALL(TARGETS UEFITool BUNDLE DESTINATION "/Applications" ) UEFITool-A66/UEFITool/Info.plist000066400000000000000000000015571442134156300163470ustar00rootroot00000000000000 CFBundleDocumentTypes CFBundleTypeExtensions * CFBundleTypeRole Viewer LSHandlerRank None CFBundleExecutable UEFITool CFBundleGetInfoString UEFITool NE CFBundleIconFile uefitool CFBundleIdentifier $(PRODUCT_BUNDLE_IDENTIFIER) CFBundlePackageType APPL CFBundleSignature ???? NSPrincipalClass NSApplication UEFITool-A66/UEFITool/ffsfinder.cpp000066400000000000000000000207521442134156300170470ustar00rootroot00000000000000/* ffsfinder.cpp Copyright (c) 2015, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "ffsfinder.h" #if QT_VERSION_MAJOR >= 6 #include #else #include #endif USTATUS FfsFinder::findHexPattern(const UModelIndex & index, const UByteArray & hexPattern, const UINT8 mode) { if (!index.isValid()) return U_SUCCESS; if (hexPattern.isEmpty()) return U_INVALID_PARAMETER; // Check for "all substrings" pattern if (hexPattern.count('.') == hexPattern.length()) return U_SUCCESS; bool hasChildren = (model->rowCount(index) > 0); for (int i = 0; i < model->rowCount(index); i++) { findHexPattern(index.model()->index(i, index.column(), index), hexPattern, mode); } UByteArray data; if (hasChildren) { if (mode == SEARCH_MODE_HEADER) data = model->header(index); else if (mode == SEARCH_MODE_ALL) data = model->header(index) + model->body(index); } else { if (mode == SEARCH_MODE_HEADER) data = model->header(index); else if (mode == SEARCH_MODE_BODY) data = model->body(index); else data = model->header(index) + model->body(index); } UString hexBody = UString(data.toHex()); #if QT_VERSION_MAJOR >= 6 QRegularExpression regexp = QRegularExpression(UString(hexPattern)); regexp.setPatternOptions(QRegularExpression::CaseInsensitiveOption); QRegularExpressionMatch regexpmatch; INT32 offset = (INT32)hexBody.indexOf(regexp, 0, ®expmatch); #else QRegExp regexp = QRegExp(UString(hexPattern), Qt::CaseInsensitive); INT32 offset = regexp.indexIn(hexBody); #endif while (offset >= 0) { if (offset % 2 == 0) { // For patterns that cross header|body boundary, skip patterns entirely located in body, since // children search above has already found them. if (!(hasChildren && mode == SEARCH_MODE_ALL && offset/2 >= model->header(index).size())) { UModelIndex parentFileIndex = model->findParentOfType(index, Types::File); UString name = model->name(index); if (model->parent(index) == parentFileIndex) { name = model->name(parentFileIndex) + UString("/") + name; } else if (parentFileIndex.isValid()) { name = model->name(parentFileIndex) + UString("/.../") + name; } msg(UString("Hex pattern \"") + UString(hexPattern) + UString("\" found as \"") + hexBody.mid(offset, hexPattern.length()).toUpper() + UString("\" in ") + name + usprintf(" at %s-offset %02Xh", mode == SEARCH_MODE_BODY ? "body" : "header", offset / 2), index); } } #if QT_VERSION_MAJOR >= 6 offset = (INT32)hexBody.indexOf(regexp, (qsizetype)offset + 1, ®expmatch); #else offset = regexp.indexIn(hexBody, offset + 1); #endif } return U_SUCCESS; } USTATUS FfsFinder::findGuidPattern(const UModelIndex & index, const UByteArray & guidPattern, const UINT8 mode) { if (guidPattern.isEmpty()) return U_INVALID_PARAMETER; if (!index.isValid()) return U_SUCCESS; bool hasChildren = (model->rowCount(index) > 0); for (int i = 0; i < model->rowCount(index); i++) { findGuidPattern(index.model()->index(i, index.column(), index), guidPattern, mode); } UByteArray data; if (hasChildren) { if (mode != SEARCH_MODE_BODY) data = model->header(index); } else { if (mode == SEARCH_MODE_HEADER) data.append(model->header(index)); else if (mode == SEARCH_MODE_BODY) data.append(model->body(index)); else data.append(model->header(index)).append(model->body(index)); } UString hexBody = UString(data.toHex()); QList list = guidPattern.split('-'); if (list.count() != 5) return U_INVALID_PARAMETER; UByteArray hexPattern; // Reverse first GUID block hexPattern.append(list.at(0).mid(6, 2)); hexPattern.append(list.at(0).mid(4, 2)); hexPattern.append(list.at(0).mid(2, 2)); hexPattern.append(list.at(0).mid(0, 2)); // Reverse second GUID block hexPattern.append(list.at(1).mid(2, 2)); hexPattern.append(list.at(1).mid(0, 2)); // Reverse third GUID block hexPattern.append(list.at(2).mid(2, 2)); hexPattern.append(list.at(2).mid(0, 2)); // Append fourth and fifth GUID blocks as is hexPattern.append(list.at(3)).append(list.at(4)); // Check for "all substrings" pattern if (hexPattern.count('.') == hexPattern.length()) return U_SUCCESS; #if QT_VERSION_MAJOR >= 6 QRegularExpression regexp((QString)UString(hexPattern)); regexp.setPatternOptions(QRegularExpression::CaseInsensitiveOption); QRegularExpressionMatch regexpmatch; INT32 offset = (INT32)hexBody.indexOf(regexp, 0, ®expmatch); #else QRegExp regexp(UString(hexPattern), Qt::CaseInsensitive); INT32 offset = regexp.indexIn(hexBody); #endif while (offset >= 0) { if (offset % 2 == 0) { UModelIndex parentFileIndex = model->findParentOfType(index, Types::File); UString name = model->name(index); if (model->parent(index) == parentFileIndex) { name = model->name(parentFileIndex) + UString("/") + name; } else if (parentFileIndex.isValid()) { name = model->name(parentFileIndex) + UString("/.../") + name; } msg(UString("GUID pattern \"") + UString(guidPattern) + UString("\" found as \"") + hexBody.mid(offset, hexPattern.length()).toUpper() + UString("\" in ") + name + usprintf(" at %s-offset %02Xh", mode == SEARCH_MODE_BODY ? "body" : "header", offset / 2), index); } #if QT_VERSION_MAJOR >= 6 offset = (INT32)hexBody.indexOf(regexp, (qsizetype)offset + 1, ®expmatch); #else offset = regexp.indexIn(hexBody, offset + 1); #endif } return U_SUCCESS; } USTATUS FfsFinder::findTextPattern(const UModelIndex & index, const UString & pattern, const UINT8 mode, const bool unicode, const Qt::CaseSensitivity caseSensitive) { if (pattern.isEmpty()) return U_INVALID_PARAMETER; if (!index.isValid()) return U_SUCCESS; bool hasChildren = (model->rowCount(index) > 0); for (int i = 0; i < model->rowCount(index); i++) { findTextPattern(index.model()->index(i, index.column(), index), pattern, mode, unicode, caseSensitive); } UByteArray body; if (hasChildren) { if (mode != SEARCH_MODE_BODY) body = model->header(index); } else { if (mode == SEARCH_MODE_HEADER) body.append(model->header(index)); else if (mode == SEARCH_MODE_BODY) body.append(model->body(index)); else body.append(model->header(index)).append(model->body(index)); } UString data = UString::fromLatin1((const char*)body.constData(), body.length()); UString searchPattern; if (unicode) searchPattern = UString::fromLatin1((const char*)pattern.utf16(), pattern.length() * 2); else searchPattern = pattern; int offset = -1; while ((offset = (int)data.indexOf(searchPattern, (int)(offset + 1), caseSensitive)) >= 0) { UModelIndex parentFileIndex = model->findParentOfType(index, Types::File); UString name = model->name(index); if (model->parent(index) == parentFileIndex) { name = model->name(parentFileIndex) + UString("/") + name; } else if (parentFileIndex.isValid()) { name = model->name(parentFileIndex) + UString("/.../") + name; } msg((unicode ? UString("Unicode") : UString("ASCII")) + UString(" text \"") + UString(pattern) + UString("\" found in ") + name + usprintf(" at %s-offset %02Xh", mode == SEARCH_MODE_BODY ? "body" : "header", offset), index); } return U_SUCCESS; } UEFITool-A66/UEFITool/ffsfinder.h000066400000000000000000000031121442134156300165030ustar00rootroot00000000000000/* fssfinder.h Copyright (c) 2015, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef FFSFINDER_H #define FFSFINDER_H #include #include "../common/ubytearray.h" #include "../common/ustring.h" #include "../common/basetypes.h" #include "../common/treemodel.h" class FfsFinder { public: FfsFinder(const TreeModel * treeModel) : model(treeModel) {} ~FfsFinder() {} std::vector > getMessages() const { return messagesVector; } void clearMessages() { messagesVector.clear(); } USTATUS findHexPattern(const UModelIndex & index, const UByteArray & hexPattern, const UINT8 mode); USTATUS findGuidPattern(const UModelIndex & index, const UByteArray & guidPattern, const UINT8 mode); USTATUS findTextPattern(const UModelIndex & index, const UString & pattern, const UINT8 mode, const bool unicode, const Qt::CaseSensitivity caseSensitive); private: const TreeModel* model; std::vector > messagesVector; void msg(const UString & message, const UModelIndex &index = UModelIndex()) { messagesVector.push_back(std::pair(message, index)); } }; #endif // FFSFINDER_H UEFITool-A66/UEFITool/gotoaddressdialog.h000066400000000000000000000010131442134156300202310ustar00rootroot00000000000000#ifndef GOTOADDRESSDIALOG_H #define GOTOADDRESSDIALOG_H #include #include #include "ui_gotoaddressdialog.h" class GoToAddressDialog : public QDialog { Q_OBJECT public: GoToAddressDialog(QWidget* parent = NULL) : QDialog(parent, Qt::WindowTitleHint | Qt::WindowSystemMenuHint | Qt::WindowCloseButtonHint), ui(new Ui::GoToAddressDialog) { ui->setupUi(this); } ~GoToAddressDialog() { delete ui; } Ui::GoToAddressDialog* ui; }; #endif // GOTOADDRESSDIALOG_H UEFITool-A66/UEFITool/gotoaddressdialog.ui000066400000000000000000000062041442134156300204260ustar00rootroot00000000000000 GoToAddressDialog 0 0 270 86 Select item at address false 5 5 5 5 5 5 5 5 5 5 Select item at address: 0 0 Qt::Horizontal QDialogButtonBox::Cancel|QDialogButtonBox::Ok HexSpinBox QSpinBox
hexspinbox.h
 buttonBox buttonBox accepted() GoToAddressDialog accept() 182 185 157 194 buttonBox rejected() GoToAddressDialog reject() 182 185 286 194 UEFITool-A66/UEFITool/gotobasedialog.h000066400000000000000000000007551442134156300175320ustar00rootroot00000000000000#ifndef GOTOBASEDIALOG_H #define GOTOBASEDIALOG_H #include #include #include "ui_gotobasedialog.h" class GoToBaseDialog : public QDialog { Q_OBJECT public: GoToBaseDialog(QWidget* parent = NULL): QDialog(parent, Qt::WindowTitleHint | Qt::WindowSystemMenuHint | Qt::WindowCloseButtonHint), ui(new Ui::GoToBaseDialog) { ui->setupUi(this); } ~GoToBaseDialog() {delete ui;} Ui::GoToBaseDialog* ui; }; #endif // GOTOBASEDIALOG_H UEFITool-A66/UEFITool/gotobasedialog.ui000066400000000000000000000061621442134156300177160ustar00rootroot00000000000000 GoToBaseDialog 0 0 270 86 Select item at base false 5 5 5 5 5 5 5 5 5 5 Select item at base: 0 0 Qt::Horizontal QDialogButtonBox::Cancel|QDialogButtonBox::Ok HexSpinBox QSpinBox
hexspinbox.h
 buttonBox buttonBox accepted() GoToBaseDialog accept() 182 185 157 194 buttonBox rejected() GoToBaseDialog reject() 182 185 286 194 UEFITool-A66/UEFITool/hexlineedit.cpp000066400000000000000000000043611442134156300174010ustar00rootroot00000000000000/* hexlineedit.cpp Copyright (c) 2014, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "hexlineedit.h" #if QT_VERSION_MAJOR >= 6 #include #else #include #endif HexLineEdit::HexLineEdit(QWidget * parent) :QLineEdit(parent) { m_editAsGuid = false; } HexLineEdit::HexLineEdit(const QString & contents, QWidget * parent) :QLineEdit(contents, parent) { m_editAsGuid = false; } HexLineEdit::~HexLineEdit() { } void HexLineEdit::keyPressEvent(QKeyEvent * event) { QClipboard *clipboard; QString originalText; if (m_editAsGuid && (event == QKeySequence::Delete || event->key() == Qt::Key_Backspace)) { int pos = cursorPosition(); if (event->key() == Qt::Key_Backspace && pos > 0) { cursorBackward(false); pos = cursorPosition(); } QString txt = text(); QString selected = selectedText(); if (!selected.isEmpty()) { pos = QLineEdit::selectionStart(); for (int i = pos; i < pos + selected.length(); i++) if (txt[i] != QChar('-')) txt[i] = QChar('.'); } else { txt[pos] = QChar('.'); } setCursorPosition(0); insert(txt); setCursorPosition(pos); return; } if (event == QKeySequence::Paste) { clipboard = QApplication::clipboard(); originalText = clipboard->text(); QString cleanedHex = QString(originalText).replace(QString("0x"), QString(""), Qt::CaseInsensitive); #if QT_VERSION_MAJOR >= 6 cleanedHex.remove(QRegularExpression("[^a-fA-F\\d]+")); #else cleanedHex.remove(QRegExp("[^a-fA-F\\d]+")); #endif clipboard->setText(cleanedHex); } // Call original event handler QLineEdit::keyPressEvent(event); } UEFITool-A66/UEFITool/hexlineedit.h000066400000000000000000000023151442134156300170430ustar00rootroot00000000000000/* hexlineedit.h Copyright (c) 2014, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef HEXLINEEDIT_H #define HEXLINEEDIT_H #include #include #include #include #include #include #include "../common/basetypes.h" class HexLineEdit : public QLineEdit { Q_OBJECT Q_PROPERTY(bool editAsGuid READ editAsGuid WRITE setEditAsGuid) public: HexLineEdit(QWidget * parent = 0); HexLineEdit(const QString & contents, QWidget * parent = 0); ~HexLineEdit(); void setEditAsGuid(bool editAsGuid) { m_editAsGuid = editAsGuid; } bool editAsGuid() const { return m_editAsGuid; } private: bool m_editAsGuid; protected: void keyPressEvent(QKeyEvent * event); }; #endif // HEXLINEEDIT_H UEFITool-A66/UEFITool/hexspinbox.cpp000066400000000000000000000021741442134156300172660ustar00rootroot00000000000000/* hexspinbox.cpp Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "hexspinbox.h" #include HexSpinBox::HexSpinBox(QWidget *parent) : #if QT_VERSION_MAJOR >= 6 QSpinBox(parent), validator(QRegularExpression("0x([0-9a-fA-F]){1,8}")) #else QSpinBox(parent), validator(QRegExp("0x([0-9a-fA-F]){1,8}")) #endif { this->setRange(INT_MIN, INT_MAX); this->setPrefix("0x"); } QValidator::State HexSpinBox::validate(QString &text, int &pos) const { return validator.validate(text, pos); } QString HexSpinBox::textFromValue(int val) const { return QString::number((uint)val, 16).toUpper(); } int HexSpinBox::valueFromText(const QString &text) const { return (int)text.toUInt(NULL, 16); } UEFITool-A66/UEFITool/hexspinbox.h000066400000000000000000000020771442134156300167350ustar00rootroot00000000000000/* hexspinbox.h Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef HEXSPINBOX_H #define HEXSPINBOX_H #include #if QT_VERSION_MAJOR >= 6 #include #else #include #endif class HexSpinBox : public QSpinBox { Q_OBJECT public: HexSpinBox(QWidget *parent = 0); protected: QValidator::State validate(QString &text, int &pos) const; int valueFromText(const QString &text) const; QString textFromValue(int value) const; private: #if QT_VERSION_MAJOR >= 6 QRegularExpressionValidator validator; #else QRegExpValidator validator; #endif }; #endif // HEXSPINBOX_H UEFITool-A66/UEFITool/hexviewdialog.cpp000066400000000000000000000037701442134156300177410ustar00rootroot00000000000000/* hexviewdialog.cpp Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "hexviewdialog.h" HexViewDialog::HexViewDialog(QWidget *parent) : QDialog(parent, Qt::WindowTitleHint | Qt::WindowSystemMenuHint | Qt::WindowCloseButtonHint), ui(new Ui::HexViewDialog), hexView(NULL) { // Create UI ui->setupUi(this); hexView = new QHexView(this); hexView->setReadOnly(true); ui->layout->addWidget(hexView); } HexViewDialog::~HexViewDialog() { delete hexView; delete ui; } void HexViewDialog::setFont(const QFont &font) { hexView->setFont(font); } void HexViewDialog::setItem(const UModelIndex & index, HexViewType type) { const TreeModel * model = (const TreeModel*)index.model(); UString itemName = model->name(index); UString itemText = model->text(index); // Set hex data and dialog title QByteArray hexdata; UString dialogTitle; switch (type) { case fullHexView: dialogTitle = UString("Hex view: "); hexdata = model->header(index) + model->body(index) + model->tail(index); break; case bodyHexView: dialogTitle = UString("Body hex view: "); hexdata = model->body(index); break; case uncompressedHexView: dialogTitle = UString("Uncompressed hex view: "); hexdata = model->uncompressedData(index); break; } dialogTitle += itemText.isEmpty() ? itemName : itemName + " | " + itemText; setWindowTitle(dialogTitle); hexView->setData(hexdata); hexView->setFont(QApplication::font()); } UEFITool-A66/UEFITool/hexviewdialog.h000066400000000000000000000021071442134156300173770ustar00rootroot00000000000000/* hexviewdialog.h Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef HEXVIEWDIALOG_H #define HEXVIEWDIALOG_H #include #include "../common/treemodel.h" #include "qhexview5/qhexview.h" #include "ui_hexviewdialog.h" class HexViewDialog : public QDialog { Q_OBJECT public: enum HexViewType { fullHexView, bodyHexView, uncompressedHexView }; HexViewDialog(QWidget *parent = 0); ~HexViewDialog(); Ui::HexViewDialog* ui; void setItem(const UModelIndex & index, HexViewType dataType); void setFont(const QFont &font); private: QHexView * hexView; }; #endif // HEXVIEWDIALOG_H UEFITool-A66/UEFITool/hexviewdialog.ui000066400000000000000000000014211442134156300175630ustar00rootroot00000000000000 HexViewDialog 0 0 640 480 0 5 5 5 5 UEFITool-A66/UEFITool/icons/000077500000000000000000000000001442134156300155025ustar00rootroot00000000000000UEFITool-A66/UEFITool/icons/uefitool.icns000066400000000000000000012174411442134156300202200ustar00rootroot00000000000000icns!ic12 ”‰PNG  IHDR@@ªiqÞsRGB®ÎéDeXIfMM*‡i  @ @FQB° öIDATxí[ipUUþ²‡ì KB A„=l²ªd±0.€8*ê¸òg´œrù!C3å è8â¨# nà  û˜P„°C†°…$@ȾÈžùúæÝ—›÷Þ½//‰Ö¤‹®sîYút÷éÓÝç¼tA—º4Ð¥. üÿjÀ©½¢755…snq1„èKô ºµ ]Cê*jǨõ&VTÔ¶©u)ëˆÕÄÄ|b1ÕÉÉé2Ë_(´3ñâ!âíÇÈÐR¢Ë/¢Ž&¦ow8J¶U ZóÔC‚£Ù¹¤;èöê(';sx,Rì±eW>†DÒˆ¿áU™+XK%ü¬6Ø* @á9éqŒ­ÉíiË)¨@N‘ðf ýz w°uGû[Npê(*¡^„«^‡©ý!–&¼ÐÜq*ËŽ]1‘o]|6&‹&PÂDëžv ãÌ¥Äô(ÈÁ‹FŽö566a_viK Sž©Ì*¸ºúGÉÚÿ‚Ñ]Ðü%Î2šlÙÇ9J·lW¿/”ãË’[ü´Üô}ª¨ 5µú hú2Õ1bòc6gé*€£ÇÙœ¡Ó(Ìí>‘‹­‡/¢êV­ÍQ[生RØÀý5¸V*ù5ä—Tá‹ä,ü”‘KkA6›`ä$Ãk444"9#‹wfâ:™›4¯Í€AÁpsuÁêZdå•à§¯Qp*@JØ·ép6–xº#ÈÏ®.Ψ¸Y‹mG³ñ»ƒ¹¨mlÀ`7|êé†ø˜^pv2ôáÚUbµÚº.šÍ{ø¬v°^}Û‘KxtwŠdwMåꌤˆô òž‹ÅØVV›m²_'ŒðpÁ´Þ~õõÀŽK%ØQYËCÒ²ëÃ=\ñš5ÑndÍ€Þ‚^?XrµŽ‘´‰²ÄùQ½|°½L΢5x8;aíÌA˜=²¼Ý[/w…s¶¹€7f×vï Ü×¾Œó‰BðÎÇð×Ìk¢l/æ …ÖµƒÚ•Âr¬Î"“: Ψ@ÌŠj%|wvó‰l<¸é8ºq£ïïŒ?/ƒî>žfBýºáÅÄax7sjTgiîÎ\+gÚ\nnšVÇ«R€¤¿ïÿxe˜«•Õ¨d&èÃ]UáBQ%^ÙuIÑÝñô¸ŒˆîZ’ B÷èå"lJÍjö-9:;®”ayI%¢B;öL¡{Ι náj³Í+š*’üÔÔÖ¡¨¬ ûOçâ‰}çPmc‡¼iúƒ¼ÜÐ Î/À›–N@ wËËK?'‚ßà=bMòÏØ—ž‡(f‘õõL¶®U ËÆ%饨 ,™<ýzÁ“–àîêjEÓÄöŒs,e‘o‡°ýàY¤ç!ýj9vV¡@œ”&EUp£d_/ˆÇ¨~!ôcM(àNm<™‹ñý{aÆ x2Ÿ·„2 ¾)íÖÉÆsûã®Á‘òöPæo9v 6±É­ךàã‘¡~ê™#¢Ñ»‡¿%y]8tyfÛ+§ÄbþÈóÐÈ`_ ˆèÕ[âO»Nãæ }º#ÀË<) ±æà„Q1«G\Dwó\‰4wQin8Ìã`n6Wj¸{Êo)ˆÌëH å«’µÌã-+)@ÏÑi‰ñ,Ͼ3BÛ¤Ôų¿< Âö¥ã±3S•FyC !¹Ò?]6CÃ[„W‰øqn•SX#? رʶƒQ`ME®ìíî O‹ðt“ÞºžÇÅ•~aá„;L]6ò^ߨ(ÀÂ4;ãbBÅœÉ-©œBe©<ŸvG -ÅÞÚÍýÖlµ8¦€^zì MÒ…;«‚„¼•_%ccJ†ÂŸ7Õ»‹&¢7os*­Y=¼1'>Z™rIQÒšÝxuÛ ¬ý) Wo‡§¿ iÚY[é·á“T^l•Ž)ÀÎî‹„u ¨FMàÂ]pZòLw†`¦¯/ cg¢7q@(M9Àɼbdpì¾ ×Q\Z‰uÏÞƒ© k+ôÔ…ÛX:è쟯|^Së&µ08,w0^;SâØâbzûÏ+JbGõÌ)"écC±|ÞXelÜ8Uh ÛªÛg±Õ,# °ò¹çÄᥘî—(;jr»Ëà.ª »žy¥ØÊ0ï`Tp2ÍÕæ㨌Žn4yõÉ«‚!²JnŠk5‹_öôÁ“c¨.ݦÒ! ¸Úp¾\T†Í)gðIÚEª’@Ô¢v©­JÎļ14[eÃðö7)êî·’&ƒWXi ôF§+ŠoÖ@Ž‰ Á< eU|9–7Áᬀ·vgÐqñ°ècój’ÏñÇ+I0:®?nݪÁß×ïÂ_èl+¨TÙùõ‹'!ñ®ø¶°§Ž¡Çµ º.‡!J~MýÚö4ëV¹Å}»3M¹òN1á!Á­²´ÜkE˜ùæÈ4%FÖš[^Ù¯/»šçn¹^gç`gjÂz qÒp¸ñNá<ÊŒñ3[ãÁ ´¦UeãW¬ù¯í?g‹¥Í»›ú‡yˆ¿³ùqDw ã±T€Í…u}'är>Åvˆ¦I _±q w6p&¯´Ñ¼Øt2œÖ^ÖÑU€‰‰ÕÉLTD/,ŠíiSxQÈþ@âÕMþÞºSÁP{ XOVw&;SMo¶hο)rèlÛ"£m;ÅO´ –u] ¤3Œe= ¶ýFJ ã 4ÿ #~íY€xò,˜EäÝõ7"ü\{‹4v ƒH英ģò}›ƒ˜½ìü¾Nç“Ç©ÓcÄÄÛ 2ÈÐ2¢CNÄ®ÐÓ"ê'š&ÊTJìò#Š š*²Úi ©„Š’ÛW%Ãメò_flÆyöuA—º4Ð¥. ti@GÿëÝz‹¶wûIEND®B`‚ic07 þ‰PNG  IHDR€€Ã>aËsRGB®ÎéDeXIfMM*‡i  € €HŽw `IDATxí] \WÒ/ûVNÅQÁûŠg4FÍm6fÝlò™ÄM¢&~n6Éæ2ù’5æÒĬ~ë1ÆÄcxߊŠ€Šœ "È})—òý«¡af†î™ÀÍ¿¦{ú¨W¯ªº^½zõ^™ÀÄL0qÀÄL0qÀÄL0qÀÄL0qÀÄL0qà?œf°~‘&%ÙT¯$2Cqµ³¹\q£¤¤$[o€………«¹¹¹®u633³nÜw¾}û¶¹XÑN:‰‡wíïܹc†gIu„s¼ç¯Ýõ–ÀÃB6„%œ”O:wîü"ŽMÐF€l´²²zÅÕbcçP/0DøY‹âââûÁ±!¸ô"^êCå•·¨÷ê“”­¥“òì›=œéÍYádi¡9ú(‡1ïA4qž££ãF”ÁJ WQß^ Û|ëÖ­(ßñ wXáƒ6ºpµ—ÿ’ÄܤšºæÐ.ãêH€ˆê'p¼»€&–£^20D,&Ož¼áÜn‰)ê´pÜþÔ•œ–ÿ‚ì­¨¥¬¼bu”æ7ºˆnááᯃ Klm¦ÂÛþ¾ ú§¾Ý¿Y]G ùz ­¶¾žŽ¦°òt\€0=0îêeô±¬“&Mz Èžh‡†âò›]\Õ<´"±HÜoH. šZnb;&@6}úôyÔY`“môU+Dúë˜,¹›ªØ+ù”P«A•(ùÆÁ¸C7k)·¨òn¤ìW£,:ƒ,Ùò”ûkX§ƒzc87¼-ø€~³ÞÅðØü–„x^ý§ôåzÓÀô³bL€ˆA£”Áò”eôR€~ýúM[¾ X»÷OÍ"}!;¿„¾‡'ßø2ë½O½^¬— ÕÖÖÑ¿$Ð÷‡“®ȧ™Ënø9 ´ÿÖÖÖCä<¤Ï½7«hÍÞ‹´8±ìbséõ \š1ÐBº»’…–¬ õr.\+…âàí3À0θ<8‘l‰ÌZ¹XQs ËèxR.}—CQÕÐÉœœl,éˆÎ.R'S‘ßÄ "Ù —Aày†*Bµ$·Ñg_»/^½TH·Á÷²;õ´,¹ýKm‹§Â’ ¡Ï—TÜ¢£©y ŸIÜž[IEe•t[‡)gÁ߬ª¦ ¨ÏÚÓ4çhE•W å_©»C3]¦ÍÇRˆëf @“ÜxYdÉ´u•¾›Z+œJKK“¡ÉFéTÞª¦o¢.àÍ/ÐßkgIÏôõ¢É|ÈÓÍ©‰Â¼¢ :“–GÑé´#«Œâk” ⌱µ¤I¾ŽîïNá=Ü©«+§.²a¨§œ‚R:˜p6^Ì£],t-ÐÛ²}0ŸfDöTÜ€Žš™3gvß¾}{ Š¯Á&ÉîÉQ¾×êí·ßöxë­·®j©£A§«kêhMT½|¡Ô·NÿkKzwTwàI;c2éý¸ë”aôÈy¤¿Õß“¦…ûÒÑ„lz'&—RÐÞK4#[FÐÌ¡Ô x”$˜7n\p²¶Î@Ü$W¬O:5 22ò¤’„3®›U5´jw<-Ù¿#öFÌh U'ŠƒòHª±B„3ãü À n£d– KðÎp?š5,HQK€<©!!!G@Z (.5ƒä:›#öÏ9jŠ ížxZœ³ÏΖÈSIûzŠE´“÷œa÷syhÛ…‚e–€¦iöá+´=ú²N¿B.“ár³,G¦‚Ó §3„å<ÐÚ½Õuµ´j_-Ì~kwÿ]‡Ò,;zElš=¢—"–~;&r¬º|€³a¥”*nÕÒº½)´ø|¾L#ªí‹çš­GÀ I˜a¸cˆî¹¨’•@N€‘š¡»¡ˆpWí›Ýçaös~—ÂoR=´%¯J£òªZz|Lo„$Ë® …x€ˆ£ì8€ÊQÊp=ëÍàësûù;‡tøöpd >³ÏËÖY‚ù{ŠX€NˆˆÍŽYaÉ2½¨¶ôöÚ ¬§»ÚÒô¡½˜½†‚|yÊ,‘•LàrÝè«ž´ 6G&†ÝÞ /J°µyw¶ +s3º‰æèZU]zPFù/’A=9ØN ì—WS™¬ŒH22ÙM€äš(T=ÇqñÇÆô¡­)…´¿‚ƒWÆ/0ù¹Þ]饩ÈÅÖŠÌU}á梛Õt9·„Ž$æÐö¤<Ê‚Rdâ¼1[©-ihçsú4²…È63ºªædoMsû{Ñþºn3ìEA]è#ƒ(Ø×,5Dà:A9º€–.ž4Û‹“ëèza9í¹˜E N¤V¾–§]¡€kfô!;[-wÿ´ÍŠ¢)²ì ð(Ù ˜,Š'¬$°¦Nq²¦—ÆcÜÀO–“ÅÍDqEý!fcyªÏú»ÐÀ`_%«,ÊH2N9 ÀHÙÊ(j©«“=}x_ ÍÜ•H7²·Á–æôÁø`ÕÇ—Üme5ëç3òéÇ)´:­ŠÐ+ònorµëLK¢3¨R:g†wÇжâìl Wâ¹ ­üÛ"zw£‡N_¥ïo–~ewàµÞôܤþäíb'™Aç—Þ¤Ž%Ó+ CUcæ¸ÛÒŸF÷¢qýº[†@GzgÏ%:t1}áOÂ3¼Ú:Œ8ÚYSd7Wúž“/ô„DÔþ÷áäE-¥W­ #y[Ž'Ó˜û¨RG@!xÔoùè@z`p¹:4·ÓÂü©§§½òãiÚQt«á~ÿ1ÑdéýýÈÊ’³¹Û¤sÉÈt–"ãx†~ùûi0É_Ý “/}š >þJýõßçi_1ÙØ‚zÀ/yª‡ ýaloêÛ½«ª1ŠâÞCO/WúŸ9döS4m—©–€µ³åo’f‡Q€¸”lú­æ_߶oì`Ÿ¦Šµv’]Dï8GûóÊ1ª×ÜÎ{âí\ÿà E²±ÒÍž`WúÇ£C©è_ÇèX¥ôæ £_íM OžqWd¨µºêº®»†ºžTðÚ- yä2•Š—¸Í;™‘úÔ­AÅ­Úy&•–L¡ !]¼á n>"Ácöˆòvµo MÓug;ÝÝ…Ž]Bú™ X‘^L/dPP·®2žRþÖ¡1)×éçBvþô}ý‘ýar·Í«ÇïëÝqô&ÚzÕ°ÓPxökŸFÁ>n’#rLiRV!-Ýrš"óX.í°XÑI×)з w­”—¬DŒí®uHá:v) ü30Y<ŒA32=RwL} Ÿ;=šSJUÿñq¢a½¼h`·$ëÁn7àdÊ›H=›˜A;Óàüéÿò7éú«¿]¤AÁÞäå¬Ý„O  ÞôZ(믧SiÊÉG*GÄlðör [µôoÊ,¦g’3©_¯n‚´‡%hS(-¯¤ôœJÉ* øÌ"Ú›YJg8ú§óø!´Û½:S†ScË«(ƒ9}¹¾~,’*_gEáÞÂé¤,úáD­Î(¢±ˆ.ÎE'ØDž쬭0飞®”Ѫ£©Åó%B”hð†šâxF#*êëJh†ü<œæ…RFUžSUSKI¹´íîš”|ʃÉ3†ÛYÑ⠽龰ä°5ÉAç@\:ýpê2MYwŒVNEúuÙJp µÑÃ9üÙEåôá/ghuzõ½Þ^œNŽ¶<¯ÂÑŒŒ  ç×ì§rdL%í»{ØQÞ(ç9N{ó¥ß®ÔÙÊÒhÍ„Å>//ïå®]»¾#PÚÊ¿ÿ^»ŸŽe—ÑÑ›p¹ôzË[0ÑņV?=’zxºhtžJ1¢w¾À’ñ4¤‹Í܃F†ú‘½ôQlŽ ¦eÒŽèTZŸMiè¶Ý‡rW<A¡þw"ªSx.õ:M…Þ0 GÓ„Ò™ éíHï>3¾é´¶ƒ7n¼åááñ9®s4MRžºQ-À‡xã•ohÞ{0œ„ÑNx3ùMŒBðÉÏÑ4í§ ÜyžÞHcúv"zVˆòô2d`×a")ÏKÈÆà¶è4úè\&•ñE(î„–ÿöøHIŽb€·y[˜ÑÃ-—½·¬JØÞeZŒFU¥GÑFºÙP?iýfW{Zöèp =™DÏE]¢g÷]"‡‰4o²¿£µ0WÏ3üU£©*E‚jzé-:†ˆ`±ÊÛ»¨ý÷ì¡’„ÏòqDž³ æÊhŒ X©(¬RÉvß}¡>²L9;hŒ ¥Z¼ÙÏH¦r8];y¶0oàå@wzJÄx¤‡‰»9bÜ ×¤0Ÿ 5üÌ}àŠ ‘êÆ}ì'ï@Õè)<(E<ÝêÞÃÉ‹Š%|©Ð²(Yw±öFŒfPfãöº[—扠rxÁJðØؾ4ßÏY=!VæôóÜäëÞ²¼j~ŠË5–ÁÝ{6•ö`rªRõnÆ#§ÆÒï5®ð[ Ðæ‰7’»|ú‚†›—Î&,§ÕMõö¤AèÖ©Cº„O}¶“fÿc'Ý(»»‰½œCÏ|¾‹æl>MiBlC¹º+jIÕ*uÏ(€=ÆOE¯]­M?ÓsŠhù¦#t0ö2xÆ–çn@×qâl•´(¦¿…9=31¬E¿»1O>I[rËèœÅÔkùBï!A­O~:FÃVí§mXlé î4щ(Zðë}þîª(öËÈN`K!èKy°Ü]SÍäUÇu:1“–žÎ óètŠÂÅ {ªßBãÐÀƒ—èÌ-ÍÝ䥣‚„Hœúƒ§“³èÓKÔ4Üäb‘Š•¿ž¢×¤P-·ç¿òc¨/z)I_ï&2`]!õ²ùûžQ€\xòUÈØ[k7ZÑ&pkÅÁDâQ¿H$\:¨Eì<°°Ããƒüé ¶êÐóÆè¡~Zø›Ö¥Þ`œyq[,å˜ìfG 'ô¥aýüÉÍŒâÛßð«Cÿ×ÎÍFv5,@Z»«N¢›£=:>Œ¶,¼Ÿ|1¦_XÚ2¿-Èãã[cHG˜« VþÐ<”Urw›ÏÙ†ïI?½6ƒ¦ i¾*Â{àظ À-€‚/Å"Ø{ÿÇü‰ä­¥×à‰$Žµ«ÓÆJcgÝYcÂÚ>\á ÿûä¾ôÊCÃÉAcˆ™ïÁ½Jn©2ü¤‘ Yz;>¢)å= ž¶Tàtk+tÿ´Á°^ðòUñãد«£VGÓ4{9PÔÓ#(Ñ>NÕšÒ-^Áº7Ö_[] 9¯Ð ¥z MK‰Ñ?±¨³—s…t V¼·µ½?z ¯hónkƒÇG÷!/øÖ<2÷ó™ϊϱ¬*«9?P2›ÄGµî½Œ˜A*[н’\³K›…„kt,áÅd•ÐAÄÙoI¼C®"m¬kÿvuiX¡Ký†ÄÌÔÕÉŽ\…‰ =ê÷ˆ¿»ºb¡øªé¹kÐ!Èfà#]Â-Ärr‰ÈyEá!™ÿzÀÚŒèjOý|œi8’SûÉ€J-R¶謽Z©®ÎŽ4iX(Lˆ’¥eæÐÖ©´&1— õÈ ˆÁÈX&–oצqÉ×hÓÉ4š;º7=8²/úòÚÊs­Àè:,0Ú( t(ñå¬|Ê@oE¶À9êbKOF GÑÜ]Dé•ÄÔëgT ³Äð«‹“ é(l ó‹(ãæ1ÉÙtkùï-ÑZŸ÷/§Ô.•ðJá@:RÑwO0ú·„Z#±Ý€¿ìµíðy*฼ø†é¹OÄ ¤ikÐk_m§Ã±©øÞ_Ë™»,ämGâéÓÃw;€\67Cš€—³¿’Ë]•&[¬nw}xÌ Ñ ™˜á{ &™N%\¥ é7(>I\e´OohŪûÂgøÖГ)×(<4@÷Ò®ê¨fíª©×iÙ±4Áªj&O™³,ôr b|ïx*ñ&cTÈ`Ù“Øvä…õöo—n¡>>€l-ÓÄ%îrývü"U Ÿbc”`ã^omL˧ç/q^ú¬%¦P [,[6²ehö”4Q¤ãçØeÞÀü[ª{W%^‚c®*Ñ#0¾ÔÕá#? ç¼öÄ8ê`Ý/][¿äÚË/ÿÙƒþòÔ$%šÙ/§l €n›" À:äåáF[Þxˆþà†_  hÞ@/?>^É!a‘‘ÌâVA®ÔCjZÅ*ãOwúûüÉô ‡™ÿΚ~ó—Ì›BN Sôižå*šÙzÅ,€Xi/wújá z‰!¿x“J^~â> [ëÓÓ̤ÚÚZÙ‹ÈU€úêêjxnÊ[‚_¸Ÿæú¹`„ VL‚5à$îöô@W;,Ù&í)x¥ÞÓŸù3>D1Ò‘'“H,÷½³ÿÊÜÉŠ½ù¢4àŸñÚ@ÜH9ê' .,,T>$ÖH.[‚åÏO£Š•Ûè‘·†oþ¼?kÒ[Æ=p꽿ó]ÄR°Æ3Z†ïü<}ùz¹Sqiýz †Þ=DyZÂÉ 4™ÑûÃé¥'&Sݵկ¼¼œe#K´OiY ÷-|}}ÍÆÿRËËÊœq°·¥1ýý¨<#‡Î ËÇ6ãebÀ:ûKÆ÷¡åœLƒ‘C`kc-¬©×‹-ÎÂÇû`ò¨s b÷Xz­F+šËÑvôDwWšу>{r,Í™)¤nsoÆ4F$ïÁþÝÈ÷N-eå•bl£å`Ñ;ÃoßÁNûmeK9³rãÆ<ÄÈÍ´¤Ú a)Èq7Öøt¬[EEÅy|ð‰—Û0ääaÕ6ÓÑÆI™^Hñúpú@š>6 )æpµäðs,¤òV%¥]£©Ÿý› Zâ•Xƒ'ýÜhÕ’GeÓV6£ª­«£¼E´êç£ôÁÙ«8Ó ‡wñæ¿úô(¬æ¹‡ÉÐzûfx1{á ✠Àyö-5PÃÓr€ïeê]«ªªváCÅ4àSôTæ|ùãAò÷t¦É#úÃÜv‘Œ¿ªº†^ùt3­ÆÀpdÁ$ÑO2*V„ IWiÇÑóxÆ oþDÅÛ|Ubà^±²²ƒs<¼ÈÙ1’,€€Ëc¤·á&¶…x`þÀ[ÏÏ$sdñèZ‚ SÎ6ŽÀºÁ«“¤'‰¨ãGúxDX°øSÒž½ûð¾=©?büÌ5N7&ÔÔÔ$?§TIzóEZäôXøŒ¼®¬¬,ND`ì=3N®ð™&Î: Ô–©×s›ÞßGïáZÎP6¶ð¹¾h–Y& kɧ[9 ÀÈyÝÉ“'4ó¹ ½zøÐ 8†BÌöXÉ[݉‰‰,vþŒf˜Á<òÈ#Ù09ùDG†NxûLDfb Zûþ¨`ï@ŸŽ\MBûŸ9uêT¤8 M¿¤’A Àf¦ñ€í’Kidžö¤XÞ½É0ŠRâþAL í&Ãùlª–””l‡cÎ$Ä´jÉdÈUFÌ P½nݺ-Ó—z”L™B7::ØÒðžÜ{(qµû8Ÿ-IGtÿª£¢¢~}¬¢ ™\¹ À\,À²eË ‹ŠŠ¾—\R;ÝÈÓ­G…õÔ«ôp|—`È€^z=ÛVáíß2wîÜ,”Ç!Pn¢YF’A®0b.€›+V¬ø£ƒÊt´³‘`XXyèX,B[±C<ÉÞŽç,vL€.Û´iÓ— Ž—0@±rAªˆÙ&¢a%xŸ3CBB¾P½h:n\½zõ¯þþþëQrÖ›¢²,€¾ ÀÏq‰Õs+..þÀÙÙyŽMÐF@¿»»û‹ÊqäG%ÇÿUIÔ§ àçE_€cÎe .|ïÖ­[±ªˆMÇÆã„ž²|ùòeCó,ÙÞ¿H¡î-+B}||üGGÇcC†  Ù]DnÚ+ÏÄ_27lØ0Ñ¢E™Àν0öþe™}Uª UÆÅžç}ûöÕØÚÚý8â-ÜÕã6_4û ßlfKÐ#À±/¶Þ}ôѸk×®}xõe­â$*xö×®_¿þí7ß|3 ¼ëƒ­6lœGƼUÊj•ÂÈŒ 8EEàuŸ¸Yàpo6›7oî1qƒ~ÖÖÖAÈbñu0Nž ìÈ ®…Y¿¡§!Çâbll쉇~8£{lâ9ºÇs”Otöôöø£(ªMjØ7;)¬µlþEeà= œÏYX¹q twrrrF¦‘-þƒÚ?è†Rðš¾î Ы+'8Û@³X¾`¡ðûèå 5·a+!ðJdï–eddä¯\¹2?..Ž8Ül²yãnoâo±­WTðÀ/€1@µ .‡AÜXøIäM<ÇÊ"n|¿*mªÇ¸tO(8ÞóÆÂ{¬¸ ~~‹{Qè⽸dhKÆŠeñž-îÕ…ÎçÅ{¹ÖªÇüû^Q˜nQ Ä= X²xÌ÷ñq›@{3W,_Üs¥UÛ„ m\ˆºBpñªçÚ˜Sq&˜8` &˜8` &˜8` &˜8` ¿ ü?½Žˆö0ú£IEND®B`‚ic13Ue‰PNG  IHDR\r¨fsRGB®ÎéDeXIfMM*‡i   gêI@IDATxí} |UÕñÿdß÷=!ì$ˆ,‚ŠøÓº ÕÚªÕVµ»¿.¶µ¶êßîµµÕÖZmëZpdS‘$l!$=!ûž„ü¿s“.á%yïåÝûî gò¹9÷Ýå,sÏÌ™3gf‘‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰1à¤qþŽ’ýHx鞣´ïr®gßéÞ¯Ÿ[—Sç6ÕVõ5q.Ò¡_y¸ëCŸëo½Êk=Çò¾^„gªõ5q.Ru›L]Sßç®ã¢¦1”ÄoNÕç4mÚ4§ŒŒ gΦ­­Í©¦¦¦¯««Ë)44ÔiÒ¤Iα±±Nááá.qqq®îîîν½½.¾¾¾Nnnn.gWWW~×ÓÓSÉ÷ܹsJêááÁ— ¿•¼ù7ßSßGžÊ¥îîn¥nü›Ïàå:ÿæs”«Üêééá|•ß8¼‡k|Ýæeô1 ½ç‘?¡Ž\†ò›¯ó9_c@ùœë;àß|ŽöΕ÷cå?Ä×ð›ø]´Ÿ¯ó¹xŽ2ž”ëüòïÁ·8Ïê¦Èÿ|iiiO]]]o}}ýùŠŠŠóGí«¬¬ìÃ7vòññQòÀw>ÿî»ïr6ƒu8×8UƒòžúÂx8çN3ž@Ýq®é$‰|Þ¼yÎ3fÌð˜:uj¿¿,:`ŽéÎÎÎó@Ô³ñ|?õŽ'ì\ÞmaÎT^´Lâ˜Ç)ôƒ¢“'OÖæææv‚ô€ÁSVVÖùãÇ ¦ ˆ^ü×Åo‡M‘8lPquÄ9§LðÎ<²c4pž2eŠË×¾öµ(Œä˼¼¼ÄÊD.Ab@Á˜C1$‹¿544lüè£NýóŸÿ<7yòä> a\1A0ŽØ ÔuWàÔùþûïWˆþÏþs$þFˆŽà§;b#eíƒ0„rH Ãà±î‰'žÈÃtðüæÍ›{!ð´D0µ$ >·O¥­(UMDV¼n—WÔu„”¤Œò_ýêW½¯¾úêÛ0ÊÿDj—ÊBǺ:;;Ÿñÿ󩧞ª…¾¡÷ã?Œ@¤¢ÍÅÔÄ$`äTÔ÷ÂòÉ'CfÏžýsÌãï7rdÝP8~Z^^þ‡zè tE=Œ@0Aü"uìƨöƒ:±ÆW/Üo¾ùfï7Þx#yD6 ºaÊćŠ½öÚk}ÐYaÌ}’û¦²2ƒT V85.(ËWÆ­žR3HN¹.·ß~»+D~÷ÿüç?«çλšûDƒ·AVoœa€§—‘‘‘ßD_tÆ´788Ø)??h+ÅÀ5ôºa~ â2L…TuHtÑ»$$$¸B¹—˜˜¸!Nõ¼<•°Z«««WÝu×]û¡{êv¤iQ%€¡Äï qß}ÅŠžùË_þöˆ?Ð^_[–+10î0 ûÒ½÷Þ» `ì z†‘†¼fÿŸFdjâWD~̳Ü\¿G}ô(/ í6Y‰K1€©h\JJÊ7 þ»©©©FC•¢o_ú²®­B¢>œŠù¾Ûü㨙3gÂ5o;áI+1`°R°üÎ;ïÜ¿k×.¶‡îÅÁ+|0 e ýWíð_œŠ¾¤HQ&|…ø—,Yâ -ÿ•P¶l¼äiyAbÀàÀT€•„¯B'pUL€‰_vo :{WDÔcøQ!·ÆÆÆ»0§zÙÞ•“åK X‹˜¿'±à}–zp¨mì. 0ÁÙ.!þ믿Þs¨û%ñÛûÓÈòÇŠx€~V„¿Ä2¡òb[¦9ÑçE:Öb¬~ßÞ @ `pägâÿÇ?þ±z´ºUòE‰aLà±’’’‡—/_îŽj & hOЀ]jlÏUÑpN®Lü¿øÅ/â’““wزP‰0‡´kÀö9r¤¬°°P­àsA •>|¶öf‚ø]®¼òJwØW^sÍ5GP]æ’$ÆüüüVOŸ>ýM,i9uꔚ p;íÂ쟱ƒÄáŠ%o¬óçÁÀ‡m«%H ŒK L˜0á! ý½¬¬¬ Œà²T N7È`Þëñƒüàw ~ÿqùÕe£$0€>îºråÊk@­PÓ„®¸ëY(—ÉK®Xë÷€m Bsíӳ㭬†–NúÒ²h}K× µ‰VmŒDÄççFÑÝ “ÉÙÙ]H«–é—/|îþ¾°qçÎà—…¡®RÐDêÕrAüBëï ç ·ÔÔÔ÷õªÀx,‡Ãq×4SQ×y:Ï?4>zziwq=užãem Ö`‘ª^_¼x±7–…±  ]9ªž @4ŒS.×eÙ²eìÒûØPGZƒDùN?zÏŸ§ì3uTÑÍÆfÚC'̦sÔÐÚ©}aã´ž ÀÄýùøøxž °4Ì4¡¦]Z®'àq€y¿Û=÷Üôœ.-Ç…ttõбš6j8¯`TVwŸ§ŠúÖqŒUí› Á»_zé¥Ä… šbÚW%èÅÔœM™ûÃÊ=üÞÔ¥•ã¼úÖ:^ß©«‡IyOÖ´öO9Æ9~µlÞœ9s6x{{«­M šÑ²xÝ7Bù‘:ó¿úÕ¯"±ÁÄ\FdÄÐÜÄpò÷öÐÜEV,ÿ•Ä¯ÓܲJšDPðjúØò ?·¤Žþs „6ÕtP>“UóâÉ˃uhŽ Øõj,d·  Ý ´„‘ª «×Šp…Õ‡ËÙ³gïhÃ&üŠ«é×›óè?0ÁmDÏ{§®‡Ž~R@KVÒiQ”‘<ÜÝ\A Ú4“EÞ\0žzFjÉÙÞ^:ˆåÈëÒzA€Út)fz-å÷çWÑúܳôYu3åaÚÁÄÏðÿ”QGwݱ ‰|<Ù·Æ1~7!XÈ㨽0 fFÀ M˜€6_ëî¹Ò 'ƒÏ¿›£Ïÿ¹²¨ûÇOò饊f,¿õw¾^$ÇØ#¯´‘>…yì'kèæDSbdyºÛž°¸{Ìg ø ضÓÙ9Tä¦-X°5àŸÝŽyÄ_“SNë«Ú¨°§JÇ‹›[„ç²+Éø¾)=ž¼=Vp¾ãŽ;¼srrÚhG ¤CZ|qû­ý¥%W¼ž¼¬­¤QÞ+9ÛLOoÈ¥w«[‰hÝŽC,ʹ-eMt}LÝyE<ÅFø“‹3£aìÀ¾ÿù˜ÿëëü3ZÍOµvQmS…ÚÆÄCŒø{ó*iíÑ*ÚÏÃ"L5˜Ù ÀýÓûK©’ÁW&‘·ƒNfÏž„66ààN#èh¸féº €à’žžî°»ùŠ‘ÿ…ONÒkƒÄ?|Gä€;Úº(’ÀnH wM‹ ES&Rdˆ/¹ºXƸ”¾yo5”yå ˆJ*AT¦…Vt('*ñí†xîçíN¡þ^ä‘ØÙŠ9øu-tôL }t¬’>¬lC[{†e¸êÊ2®Xû]Ny»»Ðéq9ˆDGGŸAàPÁÔÍ´é¹– €+ÊÄïåkÓšë˜YiM }ÿý#ôa}›Y±¿j}Ԋμ£âî½Å”q¬Šœ…yr ùz¹›¥,ã¹~‚nìªl¡3n,'ü yòÙ)(_8\Ažn.Ð @Óu€SPª››þãBpâÆøøøLq” êY†‘ÿ»kÓ{ lo?væ[ˆéôûèäË‚Šé—$Óô¸0rC”]óA8;rËéµì ÊÂœºŒÅü±+š£[Ú\aJÀÇûÀ]Ô±jJ÷ó ÕÓ'в™Ñìuø@ÛN´÷å¬RÚ YËFM6„ƒÈÿû`BÝ`ª·cuÀ+3Ž°L«¯¯Ä/S®:ŸÛ´GhÁâEÅ°M²3¼2ù\GùÙȇGþu í6!~uÛK1:½‰~ëŽÓÊ„`Z”Nåõí´ád5m­m§ ‚-ŽºL{žsø°êÆ^:°û -Í«¦k“BÈË…Ÿª£-X59eƒ¸ö•×6Lµœ•ªêB˜FbìŠ{ÿÂ$ší¸clØÇdVþðR\DÓàœ¥u\CQæH)ü˜h>JiÉ+G ]Ä™‘*îñÇåà•wO…žRCžÊãrÇÁ¾´nÃ ¼¢;›‚ i6HOþdÅ ­[Ë•vòôôÔ’ÑXÜlÖ¯\==šÒrk(«­Ó¶þ•×F¾`o ø89Ó Ä,ˆÔ,«¥mÄ@%^¡!Kß7÷y]s@£inty.~B=8=œ"̈V£K…d!vÁSWºÝ87Æ!¼m$­%¥¾t)Çä¸#RÌÊŒÚVTOoÀíw<ƒ “˜b„¡ÍÐÇúéy¸:!îtÿ Ó 7ävÄ hFÐÍøæWc·Q¢ÁAJúðLŸ‹Æ!’B¡ø»oz$%Dfô×ͺ&tCç3z¶qزBÁö–i‘ôqíij°q4ša Õñ†3lB}Üéé 4':˜ð¼àÏa¹œqðÛFph.v•mÅ:x]û9*†Äѳ-´¿²‰`Éô ezÀμ£c34-*Ãß“®žmq°VM+ÕŸ9ÍY¯ @ ¦Â,.‚Cu_‰h½ËTÒ{èðöÜfÛâÊûBŸF&«#öà*ÄÈO õSˆÞÜÞÄ*ÑØåèN0…–£ð4˜A~Ee—7ÒnœŸîè3` ÁÜœ•‡ ó/’ЪäPšü\® @TX]ʱæ#FûÒCócéàÆ\l8¡_„kêjÎ;nÍWŇҖO¡ÔˆòT ÊÌyóÂ3LÎ^I/Ö9„ƒ#6âýPbÞ67Ž¦L ´JÜ·¤ã²²°ú€O—ÑŸöŸ¡ƒ ~ýÚñËÈi ðö•´HŒþ¾F®æ¸`Œ`]2Ö/é‘ù®ù ôiyeÄ#l¸6ùa-Œð¥ÇO¦¥Ø‰ØËŠyþpy›ºÎ¤ÝŽÿ;OUÓ÷·Ǽ¿zG˜_ðF|±ä˜\5,ó¡é‰Ê~ ¦Ú{9]ÓZp\²‚8ý!tìDu(ú@cu]þX+"ýéaDµ-}¨¯§æŽ+]X8X\Kk² é_§j©¦{`̇4` ÜÇÕÀáW±G'½÷~{¨”Z†yÞTš]CÝB°üyæþþ`øFggg]4Ò’¨zo)½a  Ü‹Í=MwqÕ :òˆ:ëù·ÍšD÷‚ø'b‹­`›ÔªvØŒôÕ½§5§„Úð{$|pGºkê÷B«~–yÿC\ûîu3(:Ô—^ÚuŠ¶Úw½û/ÑÂoJO‰þŒ-˜Ž€M:£^™p§H £û¦M Ü%Ô„up{¨÷¦„Ñÿ^5™¦Â‰‰—å´žç×ù}pè ½q¨˜¶ck¯ ó|Ó%{£Nÿ %êýð£OÄVènа ðÅÐýó“iÆ„@z|ýaʪmë_iè˜&bZòØ 0:@Ð¥óI `HOp‡¥Ü²™“hNn5}M·½€Ç§©°Ü{lA"Ý}E–ÞÜ4U¦°„ÞŒðXY…géÛNÒîêf-^®7Äé"üèË¥µlJ”oß¾\ñ\F|½yw&ýêãz9¿fT¦b*Ÿ±\c«Ç›£(sZŒ²ô;–¼ôxWJz`ÙDÌvÏaÞÛ¥ã¶U&ªAó NÿzålÊHaiëMÍâþÌó_Á²ÞÖ’,…ö/왪_s’üàWðüâdº%-ŽB±¤Æ†C#¶†¢¸_zrårÚx”^†Ý…ž ®QPHÞ»oìIè %;}¥.h»7eÓQØÃÛ ’1òÿâÆ”™4AÓuêLqŠ°ýùÚì"zŠºì¦;’rIÜ„ôµ”pº 6³á_`É”„ß„þâégS0v¿~.»L7&À Ê uw€¾¸äŸ¥7ój¨ÅN{è}Î;‹S&jFü,åÔ#Þ»Šè_û ) [sŠûÃhëÙ±(=ȇ~tÍTZ %šï¦$Á0VúÖu3©’Æ_Vè2(cßr´œæ¥F“‡lÇÌ‚"¥`²lõ(ï³1§„Ž!J¬½`–·+l¢E#«¹uóüý…ÕôêžBZSROç†!x‘§îOÁ~eö$ű(>¤ß±HÜ·6 Æ2ÜWÌÄ| LÛ¢¦h´¶ñ»-}\Ü@·œ©¦´ä‰†_õÖ:uŒ ‘ÖXÈ¿¢¶™6ÕQ§F®F<–†ú󞶅^òqxóýróqú¤¨†êF!|.ÝÏ,‰ ¦_^?æL µ9SŠÀtàû7Ì¢#{h'”Ž,™h þû5è9x¥ÇÛ“w®— À@è†âo+FÿÃX«Ö¼'ŽÐï8j1ï^kK¨‚ùîúì3ôWˆû‡š:i4+sV9. õ¡¯^‘@×L¡ÅàÈ–5êÏ‹uÑ0Ç}nÅ zøíýtŒuB{om­l£‡+hj|„†%9NÖ’ |+ý_Ç|´ÞŽ£?sž¸$óZ¼-€ÍÊ°Âÿ½—E¥^,Ǹ–ˆç#à|cJ=yýLŠ æÙ¶¨‰é<¸g[:é“ü**ÃT@ÈÇ4ïÐéjJ W‚¢èQ¦5e@ hÛQ`˜JHÄôbl_^(>¶!¾að=êeö²kÁHèoõXY}kÍú¼¶ÄÏEß668º&*€¾µ8•æ'NP–Ë´¢}æouí´-·œ^ßwš>®jÖm5€7ƒù¼à,­Êì"?˜*¤)°Ž_¦ 0»O×Qm¯>£ÐHM;ÙÒE ­ûX€×ößØS@ŸbÔa‡q"ó¤AÄ_G_ÌLãÁ‘V”uB󼢞žßzœÞ+¬í_}аŒ‚Œnlªþ¶¼vÙK<•`¯À=• þag(ÇrÕû‡KhU¼æn-°á »{)§ì|¬n™º1á‡ùÒÃsciÑä(Š†‘Ž»†fÆlspÓ¬µð-xõHBŠ»`¬®œµ ¶à½J0¡M‡K) «-ž—„ß· £qðèeÏzÏ÷Òöc¥tûÅØìèœ×L¢EXogB¶8ðçW @4í›S~M t „HAn”î¯X.HŠTˆð³Zâ[ÐÚI›ão|šGð3M ©U]D¾lã±»¢™êÚlbX€¸|Y¦—-`£cUv¶‘>:Qpغx_šÕÉÚ»zéˆÈ VƒuwkÁ æº7̘£¢HjÁ4‡ÍŠy¥G{k™‹9õáAMª?;QN¯íÔU/ÞP„©Ö߶Ÿ¤²ºJBXñð‡R­•€éªú*ÕùŸTÚáÜ©z!îµBã\ÅSV~%å âÏ)¬…çc¨ÅˆÔ‰‡Œ3ö_h4«#_É«$—óèÉ[2(21.Ü6ä‹ûJ yôæù‡Ûæù\q| öÇg $ m™/¸åúÁ9§ ¢¸±²°Áɺ6êB>Ì ´þæÿÞ烪Šsw¡ä/Jô¤+’"h:l&@2ð€åd@éÀ–xWS并Âνó»âê:s×Eµt¤©‹ÎB$­b¨-±hv^ˆÙB`CŸDowŠÂ|ÜŒ  K¬kÂz8ÏÕY àM8þ3Ùš·vÓa6;3&T‰Ìkvq:=¨¬çÃØh–Rÿ¼ë4킾Axú1ót㎘ Zž:‘¦Ç†R<æÝ><ÒBÇÙ¿9 7¢&´?·¼ž6圡ßÂn¿KùVÚ1‚n”Ù¦Ô€=²;Zȳº…ÂO×Ó·“´–ÓãC(1&"$zŸ·¢0d‰EcÞ¤|5é dfçDß å÷åUЈõ§aÑWÈŒ‡$5Â(ï B¸5u}qNM›L>ýXÿžE]`¥Xþû¼ ŠÞ=VN9ÕM0I†žxX{¦Žòþ³‡þoùTºmNv÷ÑÖ=ØLÔ+±¸ÿ æùÏm=F‡k[úëÂÛì@tE˜ê=– 8™Ö;ôy–##8kF|8ÅGÒ㛎PG·~_®uç¨Ð%ÐÄ¥Žćˆ…ßÂÔ`¬–L Ù‰‘ŠâÐ’Œ>žVìI:]èG—œ±á¯Ý×€`ÎT5P^yí‘F”ÚJt˜zÜçm¬Œ^2¾¿oádšŽù&oÖaŠ8ÆßLÄ%¼ëñù˜Cïί wŽ–QVC;‡ÅÜCæÐ øíߎ;©‘Aäi'FÀ˜eÂφcÍóï¼jªÆœZPÇ ˜x Èêõ³ãi"lF‹ þVÞ¾„èBNX™ùÚæcƒÒ„ú­Ï™ñ²’:𱽩 ÎSMµ­€æMð£Ù“‚irTM @„!òòp·©e¡^€ Œ¯yjÁÞìÕ⛕•5?==ý œÛþ¾î} k®cMç¨Ǿæ»#7‰ñU„ËzjU†Äsä§/¾Ë«˜ÿþ³\z~ Õ{@vþÎÂdz %ÌÏ Ó->ãÅu¿x=¿1~¾é(­=Qƒ‹­ª’‰°`¿¾%æ`Ê2–%Æ:lÝ~Ó߶Ѿª&±s ¢ Ø!R\zˆ7-L ¥ûV̹psŒg999÷¤¥¥íA6¼s-‡¦âežYÙT$rHÀ÷Q-D{»Nçñ%F&ËÇöû7ÎQjF{~è}&žhl]öìªtZK‡'Û?OVQ#ÚþÔŽ|Ú”[Fw`cË+§DÓdH<50%Y Í×ÒßLâlYxóó͇ÏÐ[˜Ÿç(NE|G0Ÿ>D r¥§®LBxõdŠ€‚o¬u ‚èýÓeS鎷÷Q ¯$ ª`9ZÕËF¬,­ƒBÑ– @.Žð±« `²;Bõo¥ûzÐW—L£pŒÒÖ“—;”†é 4 Óƒ9{NÒo>9A¹wBc¾û³“äµ=Ÿn„öúKéØJ6Däå颰²²`&mÞ1¸ïüÚž|z)§”Z!…(zA÷›ùtÊüé³h%D~®¯-€H:ôóƒ¼i ‹F…s@VeP{µ–¦ë¥‹€Ž8Ø]LWëÜ; îhñCp¬‰‡ÙVà…¹ñ} R)=6ŒžYŸMï!À[ÕµAú/– 7œ:KsEm9LÏî-¤î!ÄÑ‹‡8¶o'ÖÖ7—ÔÑ–âºþõk<§<Ê)òaLöð³iåt¦¤|Ï4Ìö¡?Þ1ŸfA"ë|ßt ìȈÝ|!©Ÿ ÷”¼n-“ ß'­ÅƒMßóÍŒ ³héËÒ 0ó À7¯KSŒƒþ´¯ˆÎb47ýä;ʉ@žHM¼1Â-ñt¬ç~qS¤íˆ_) íôÁæ"ŠVÁŒz‰úÉÔ< 8&Pz²y ´ÇS>PþM ±Ýܤ6!`çc×Ì‚ÁLýjõ(ÃûHoŒý[/þvU-„±V#¿º–n˜ôs/õUyn ØF]k‹šŒ“ÎËq߃ó§GJwß—ażæ27®BFïz¸^w°¯€™ÀÞ…åðóøáš}´ìoŸÑ?óÏ*Þ‘f¾.³:°qï¶a£=†õu­wò©Ì–ψ¥{Ž—Ó«¹6 ¿ÅñržÇž8³•~m½·ÃTùƒƒ§aËßLé0æy ¶ á83ôÇh£­‡‹è…]tNPýÆGøÞÆýäÃ5Ç!®;&00jy×\OÛ •Mq¹ßó´Â’)}"ÛãT¯Fü‚8¸½š¬°{gOýñš„]ò`>°ët%Ý¿`òE €Ÿ?tæ,½»û$½y¢’*ÅTÏs;Â` BYonÚÊÁœZÉg†Ã€c2€áZcïëè´¬T«b…}íýq6½€Ý{¹Ó{Ãíôùk§ÑýK¦ÃãϼOÆž„ËfÅÑtäŒøØh<y·°Á2¬¢|cÙ4š]|aãð!ôÊ2`ÿSò¿ 1à˜ À†°uVíi»Çà®Ì¤ÐÿrèÚ© ç¤A%Pª}{Ãa„ËŠ ðô3X ¸vF ݱ¿€þUP¡U5$›‘A¢ú,ž:Éì€#­ØZm-+¹Ò—¿ÿ'ÇKèå]ù´Qœ˜YŠçxrs%Ksãé6H}¡p”toÆgÓ#ŽÉĈ1¦¦kór#DÙvˆ¿&iÀŒ"™n¦bKîW¿t=ƒiÀÄ¥ë ¦f0ÏŽá~ÈEó葲õÁÎ77ÏŽ¥7±”fI˜4–1®€ÑÏD3G®CMkåcôWT—‚s‰Ê¡ '[é±5û©–Å}q'®®ôÐÜ8z`ñlZhÚˆÊÀß\4ÅSódIGl™ê\ÎÝ€0äz¸åáÐÙIé¥û—Òßàg¿Ûv1§f¯ê÷§y`“sræA^J%Âm×à­Ã®™kvÜA&èFˆö=€Là©QÍñ3O G;¿65’ÖÜýìÖ+(%2xxâä&s—­Ä€dV"n¸×ÎcÌüþ¼ážý:n¶õºgÑ4zý‘ké S(ÀÙ…öc§ß#%µ 3=—þ'&Â0éþŒxÄå7¦ Ù¼x ¶&²CÒ¨qÚð‡FŸqÿE¸3?{ÏbZ:5†8(3 úbÀA§ú"É’ÒúÀN# †"±Ú G³ÂM|ÿïæ º>ë² (‘bcK(ÊÍÎã–9ñôÚ¾S”‡Ý‡GÞŸgE|(øXÏ sü‘b¿0S»4ïEè²Ò¡\„ǤùACÁ5Ä2Áh ÷ÍÆ€c2³›§ÿƒLÇ@ lÕ†¨|6«™ ú90õmF62øÉè`Zíz^«GDž­lBb~œ#·Y™ú óo†ò÷¯\æÁþ@]‘µ Ñ9©L”po0&pŒ¾Ã°Àë„8ìæbÙjN‹X?À@,Ž'˜ž<\`l3š•]†êYêëßÿüÅ߆ ‰”ò€DbŸCóG}u+/ÎW}Gž[ÇÔp_0èÁƒàiÞ4ÀÆH x)Æ!h§²¶62þ¡,ð·"ž«jNâ"æ ”×ƒscI±!^ø“Y ýÞõC«g¿u‘lxl]Islwa¿;ÉŒeko[W’¥ò¤ 43Üö²Ñ†/¤ /Y(À ‹¼h|¾ ¥åŠ¹ITÛÜF*¦þ­=ÆÂÆò®E-1ÄÃçÎ!»  À&ì Y×B[,·k³®,kÞâ=æ*`æš–0ÁPÓV?Owº.eeÂxóRw³¥à‹-ÈÀ&^=C±U`åclÆÆ'~[‹Ò®®°—Öl]o“UîíeWÛÁ5A^”„9­'«•8wJû–êxkr#Ͻ3Á”âøâç\°-¶%À_b2”{¿¼k!,Ã.5WåY’)žeÅ"ïô¬`Räa”õ ž¦@Zº«ŽºH¶ÞéôõoÜ@ùÅg±0ö /­§ìÚ6*…õ] Î($÷96Ôø:<Ûü1êZ Õ؉0È×ËJ…™éYI—DÉØÏîD;o5g@\üœ…ô¯däWh>.dÈŠæÐJzñÝÑ~u‡Ù…ÕŠKÎǾà…ïˆU’ɾîÊtjƤ š39šâ&šgžmnímM3Õ« èéá ºmáXÒ ò£Œi±Ô‚ $ÏTÔÒî㥴îãXç.‡µojaO؇ 6rËêèŠDL„¤bF…xqo~9­Ù•G·/šJWO%oŒ0²Ž9Œüˆ?Öö±{а ¯+ñ,¨óÈ%Z—¿`%̇·aO{C$ô"Ñ`œ‹c‚hÑ´hš?BÑ}Àà]0Õ±ä›Ó½vÖ… Á6§FF¸ìÜùãÈìÔXº£¡™NB2È.¨¤ì’z:€ýäÊ!ðÎ96¯À(_±¹³‡ÖgÒÖ¼[À‰ü¼=éÝÂz÷ÌúòŒBúÊâé4@¾èlce^ÀW46fÓ-P§eHLg4p•Ïyâ`7_K€w-úèP!ÄÖèzÀ ˆ@ønW`Û³Q4 {¦â[N Túœ%v–´Y<+% 3Rf¼5!4"BhþÌjƒ=þ©Ò³´-ç m€ñKa{·"ðþwz¯}o‡TR³lEÁ¬Ö\à72kåÐq´AüýëáRÚ”WA+§ÇÐWÿ?yBÐ¥óks3Çs,¢‡a-Þ©˜09Ê÷)^x¶Ñú«h’òâîü î´ӚGy+µIˆ·{…ë&‡Ó"ÄSHˆ #?¬j¸ãºÖD¯®ó¸ÚI·©¹"àcyøR†¿ÍžC÷4´P$ƒÃ…U”ﺽ5­T§– ´„ít²¬†Øß$­ Sx$žOÃ~x»*êÁ®œ¨~ôê«t¡]¦XP·M·sþx̹£ÂƒÑmaZµ@28QXIaSÿqadP«Qýj±ø±öÀ)ºrJŒ åØðhðe­rj$í.gÐO8ÜÊ ?¾>‡R>Ï¥oaK°;±S0»ûZÂ\øÙtnî^½ì•3”)@ÿ–ßCoYý›‹QŠ2QÞ0™²cÑ.¢EQê4̃c¸œ`#__”B™3â”>Â}…çó—èÑÚ>½¸ÙHŽ™+8:söÌY‰ôÃû–ÓÚo\OOf&·5*ï‘ ¸Çýö]Dö9XT…)°ùŸ;áµ3ã(;û¶9ÞzŽ¾þÞ~úê_6Ò¦ìS°:ì4[Áγû@l>²8«…`~ûÙmxëÑ3ô!VR´wô‡/ÏO »®K§ÄIä5 ÌÓªñ˜ïe†ù¢_·mSú. ÓŸž¬¤£Å, ;ê kü¿)ƒVb÷]'ÖU ÔÍëÐ #5g ×òjþ{Èÿö7ÑoßÛMÇJk”€›Ã€ÎÎŽAŠž„öZPÕa‹â‘¼ABº¹òìÊ+Êö~ßO ¹¢®O©ÞïÚ(M®1‚¹„ËtaF˜ ÷•Yû*#"`þªäÃèæ›À×|!¦ï”‰ÁôÜÝ‹hurÅ`Ä ÁJÇæ'ÑÚÇo¦ßÝ0›faMŸkÍ2B~kýÑxþn=½¼%›ÎBƒ>\pRwŒz#ZúX©L §;<-ykw.=öö.ªS,"™rG~¢¸¦‰~÷Ù±Q=GÎi仾˜òÍŸHÁP_î0®•€æ|\0'š7-Ž2väS)läµîØk¡Á¿~_­^4ÃtØ«a žŒ©À¼–Š«ë© "qê¤p †;ðƒËÓhv¾úÙúëÁ3Ô…#3‚&„ ûîúC´9»ˆî^8EqÈñ÷‚|3 1ðˆ!¿Q+“„Îׇ©Œ—y °}ÐÞ¿¹ýý7¯’$Ä\h‚åÿ{eÃ~CK˜f¿"# ëùºt-›2漵ƀҕ0"Œ¡K¹£fÀ†DW%‡Óºêf:§QUÏÁ¨å+’£(%:ÔlÑ“é6êuQ;x=Flý|õZ˜zš^ÿì(­/kTÖÌ;Á >„!ÔÆ7wÑâ=ùôäsh|ØH0‚a‰œé8°æ“5µwÑŸ7¤¶çQ˜^4¹f¼ŽÐ Øæû±"z÷h‰ææÜ &øÑô¤è ¸¸³Æø¡—€vr¯êsðòÏb(S@ ýÕæžjㄼ«¶•žý`Õ¶ ÄÍ·A_ã%ÃUó&Ó‹¯ ?Ý<‡0Ú;3±a„?‡6l-:K_~åúñ¿>¥}ÊfŠJŸ1ÙF\UîY^¹rléõ,6ú¨bOV5.Ê_ü¾4_./çL5=óÑAª£¼ø½áêiÝuñ–”×׊x—Ö\»+zM›µdƒØéîîæ¯eXàQq2`Þ6%œüX>ÖØ ñ X¾µí¨1ÈVÅ°ã‡ïþò5iôΣ+è»ó”-µ)Í9xýÊ.¡›ÿº‰ž[³‹r¡(ìc.0,ŒtÏôK 9‚{­`õ-ôÜÚ=´¿N[ÑŸkž9grT ºt}ÓÈ2ÐU­¦õ £Kü=¼<Üé–…SiÃÉjÊ‚BM+ÀØH¿ûô8EÂ’ï–Œ«¬ù†«›;ìæÀIe2”‡+Ò+èÙ²èÓ’:E¡Æ¤K’¿üüE¹(’€é|úÅk¥%Ï‹¾¾ªê€0§?®?@ëNc p~t¸wUÙX{ê F¹Ê¿8˜÷JèÇ€.l#¬‰Oo¬OÀR@"l+R"Èãñ•{¥­¢"â#ï즹ÅÄ;ÛXgÀKˆ‹áEø*O VÍ¥ØW@ý±—äÌÏû- Mµ -Å3V×JyÑD¾Šdpq®­PX¾²ùý~ou J&Þµ î‰R°äÞe3ÉÇ‹–I` èÂìe lé'ö…ÞÍ™)”ŒŽ¢5Ôaiðûoí¢œ’³ýÑtm\ ûôG!œøC×Í¥¿?²‚n›EîÌØ.¦ÁKKUÓߥwmv…w~ýó£ô‹-GaÔ„BG«×˜KF¨ó”pš™blåŸhæxPŠ¶ðˆ¢ùç,l ',LKšD7%‡lål7諉J…‰ƒ˜ó~ùåÍ´?¿L&À¨àÈ>©0vúûC×Ò[_\DË"ú¹þÐ:‰ßx§=­þdÈHäuQ*~ð&¡Ýô¯OÓw¡ô«Cì†Ahzã{NV|CË3ðɸR‚›ñ'uèèì¢bhë{”Å( z¢Š:8÷#ÐœßÿOiO~Å°†;cEO ü!ö®ÊœJ¯|ýº^o pdkúà[|Çz0•on.ýϛѣ짎ÁmÄL=oÛkí`j»a—Ðn1–õíû›R;-Î÷µûtm¯nu‡+‹3áÞPóáW¶ÐÇòͶç!»aoñï+Ðã.O†E`µ0L¦(¯þ¿ÿp/=¹1Û•Å Sʈ—7!²Ð–½¹Ô£‘÷爅[xs\Ip²°ùöy¼¾©•>:PHå\_eD'Õ!e‚;ÞÜAw½¶þ3Þ( µnJ>§íÄÖe#µKaÖT@´‡ÇÙià÷7ðÑÅký:àuhE°Rüýæ£TUÓhMët}À,ÚvUÑE èâÂûÃ8‚ﮜS´³æÀÜ9õ”Ù äéué¹w¶SAU½ÍõìcÿΞ“Ô‚t$è§M p€,í¹ÄÖ†‡š;i'\¨±yè÷€ ÁZŠN«Øä@—Æ\Ú<ó¯ð¨ð˜êBæçhÝ“Õ`Ïíʧ‡þº‘va™°MY²³./õ[LÔÇŠ«éµì3£!{ óóãZÁèßÙS@ÕøÞÖ+:µÇÌxÒÏÆîN<÷ß–•G{ëž«jçƒ-·cÁû_ÞB¿Y³ƒ ±Ùèpž}ævÅö®sôÞÄ%`7Jû¬Yè—Wí»ÑÚÆ÷w $Ü[›*ÎUæâÏÏé‚u™ØyY‹˜gkÌ¢Ê <Ì_¿º€§¶åÒÊßHoo?BåØmˆ#åZ ì¡·.+Ÿ^†× 9½Š™ ¥<›Ÿïf·_s °´6~žCÀ½›SJEeÕ6ÎÙñ²ÓÊØa0Áá-ûri[%»¯÷2¹çÂVþQøÕgÂãoUf*ÝžB8ÔÍŒøuÐø¿·'—žxwÕw³!òèÀv€Š$4ú£ÊlÔs¢¬–^ÿ$«¬_0‡6å¶,Û ÷ì¤Ø þi<2ÐK KËa hù°5ô‹iô»´²–þ¹ã$U|¥¢(ü¸²‘¶®Ù _‚ctöà[85†¢C(ÈÏ[Ù<„÷âc`)WJÎ6ÐûûNÒKû ¨ŽC’™£WíŽ&𠢊‚:¬\ëøôeD-®ƒ?¿>ºë±w†v4âÍg®ŒfO‰5œk°^Ö³º0€±.mr`¾ôùÁÚÓÐN¯M¶Î•Çð“ ­ôS8n;A“¼\)}„#¦ûäP_ mTQÓLÅ ítsþÁ¦ žŒ\«>˜ ˜z”õ<ÚŸ‚NbÝÚv¤ˆŽ`¤jý|~ðdä2Œp7N_ol͡Ępò÷õ6B•ë —ÞL`D;î§Uµ ´á¢é°ÚÛÁ€ë߀9wClp8•7^4Àe$fl°ÁV{,IÔb{®ÊzìºTZK;íg< «P&ñr¨?Gþò v`ºít9]13ÉpR€xÕ…èÑKË`¦´æ“lú Q€Æˆ˜›¶hK%züöãƒTÝÔA‡aPQ¿£ü9¶)fàÄ _iÃÀ¿cˆbôHÓ“9Hˆ—ú–½Ïu‘¥taz)4,ùbEØ6ìÍÅTgAÌ:KòwägÏvŸ§WJŒ{ "1á âç†éÒ5õÁ ‡ªùøtÝpà$]{åL¹1ˆ>h·o)<÷ß~¨€´tŒ§¾lS¤ö‚àÏ%|›–`œÌNc™tíî“ÔÐÌ¡Èzí¥¡‹€^vÍæ|:^¯.æú}Øü÷°:[a2½Üñ° AT÷ÀÜ(&Â0Ÿ7§;ù]@{{»Êé{ÌuS]˜ß¾µéí†ÕŸ¤} Rò>…X&ý‚“T5†£ÌçÍ3Ú5èä qÆ0jörÄ×ßpñê—PÙû%èï¼¹q >?gwaØŒì±5F¯ë"‰D„Ð5w†‰7RdzùaÀúŽë0”C†q%{$e•UëzèÒÒ®®.f³†_/ºoåúÞµ3(ûHàÙö-“‚éÉ/.¥© Ç¡áì ¥¯‹Ô¬ èÕs?š—§Ýrõ\:;ù°ŸÞaè”pybÀ ´~g|(}玅ð ˆeÛtýp„AS­7ÓlÕš(,0ý0gfI~¾^t÷M™ØÚ™~¸áUØ9€™Õ–r,»IDATÙ<ò¯ÀNËÿw÷bJ‰Ÿhˆ‘_4+gBÐŒø¹,-À`Å«ªªÔÜL´Ñî)orëòtåÃÿà6«•pY`À #ÿ}‰áô­ÛRr\¤¡ˆŸ?ÀÙ³g;†|ˆAzr}L?µdƒkhh0$à úA'pÇu󈃂ütã1*S$Mp=ˆyb_ ðž K±YÊwïZ„-áŒ5ò ÌTWW³Ø¬yGÔƒôUTTqF´ÏP©'$ÛÁx»èç?>BG`.a|b€µÞ÷'òœ‘!G~õšššq± ¨p0H¢]†MYàéÀcKS);îJpÇÈ¿<ÌW!þ)ØÜË}Ãa¹¶¶V©Y«eÀ‹D0CKâ#ðêÀêæÓÓ7§Ñ4ì"+aü`€~÷$„Òï±_âäÄ(ÃÍù‡bº®®Ži†éè"ZúÜXk= àø-X_õk…µ~Ÿ]BW^=‡Ú°ƒÌï?Í¥ã"F¿­?ÃÀR3Jì’ÀÛu*`ër´F˜5ù´ÝmwÃц@#ƒ!ElÝ~”å…2®› (üRŒOüŒRLÔƒ¦­±2øÕ´`¢²"¥àà`'XV¸¹¹M,ÙÀ'>^ž´úÆLòÅvZO~xˆN!4·ìîF+’B•ˆ¿à’Z ¯´1ìË«E5ÉÓÁ’1ͺ}fÅFÒÚ}§à›ÑFöÌÖÀe}!6„~ðÅ%Xês âg``\HÜ–>ÿ¾ÖÖÖì   ‡`\if7-ƒ,ÏÑ Ÿäb‰Ð6ŠAñS°ûðâøZuåÊLKÁ Äyº)'Ÿ>ÚGN×RV$xïñÞØ›lº-I §• §QÚÔxEñº|þTÚ°ã(m:\¬ìZTF`‹ÖóÈ¿2:ˆ¾{çU49!šXûï»™“>>>\Y5Ôç6k†€¨WX9Р¾–––<0qÏ!RÞ.|õ ™ÄößÿÀÀ¡õUus£kâ‚éžå³hVjù#˜§PD]·pÍ›‘H«ŽÒë[ÓgåMTF0$W^ª§;Ý<5’n]2 #q¤}Ç™7+ÄL §n]D×/¬§»ŽÑ¿wÐ>D!êw׶ß.(sÕ¤ úÉ—–)K}ŽBüÜZxÏæð ‰SõÁ·ø·MAKÀUPYYyZÍ’˜˜›V^ÌX1xó’4˜ ÷Ð [ŽÑÁÖN‹Šå9n‚‡+]›F+®H¡ù³R(Ðßç“SDM¢ ºQiÒ¦ÆÑޜڊH»³î ¦ 펵t;hw(¢Ïð§+S#iñœdbÍ;/¹µµÇ£äŽéP\t=x[(-ž›Bƒl:RJûêÛ©iÐ(Î<Ô{±Ü±_ù±Îϸu$hnnÎçAu‡fÕ׊ˆŠ+)}åsæÌѬ!ZfÌDw^?ñãédS‰™®Úˆ7¿,*€î¿v6¥ctÀˆ?Zgäûá!tãÒ¹´dÞTº« ”Þýì0}rª– ;»¡0³ý<Ù–¸c±;+(™h÷ÊShî´x ò#78^ %|Såºb÷âÔÄhJˆ™@7]u–ÞÝzˆÞÐÄÒÜ´}> £üMõgL¶ÍFÌxÊ6-A!èë”Ñ«ëöÑG†Š œU3Ì%!>ôý{–Æ¥W]?Kγ²²8,‘ù9Õ ´`\a–Ô 8êÔ)9é­B¬³ šµF‡Œ¹CþF7w7úÕúlÊn뤉õ¯ÃÈsóüÊ@|ù ¡£ŠúÖTÕsj^ÇNöv§ýhj$`qoj—2Ï·d´7§ ‚ÌšOOOš@wäÓ¦½y´öhåcZÄ&s_d—Þ;)b¿­Ë7§Ž¶|fãÆüqyࣾ %[£ä¥PWRTü|xÇx`üúˆæÓ híY{Ï:=ÀböªÅ3èýãåt¢Ó8 QÆÔX]æÝLä¬S¹ JRÖ¯4·¶)K‰ŽNüÜJJJ6`@0…v´ìWZ¯Fp¶Í½¯¼òJ‰–Ñ;oî„‘õ"~nwrVp]-»bCÌC8¦û`/Ü"eßX¿ÏûC°ÂiOƬ_¿>›§Ëh‹ ~ACœÚ´Äš¨87Diо}û°{tO¥Í[q™e裚Ì)ÑŠ½šîñZT a $alx饗x¯:Á[¦#¼­%àb™ p#&=ÀyØ8¿Ë7$X^"›=yŤØ %è™ñÊ´ÈõqÔ:À\þØâ©H5i–– @T| 0HÏÁƒ·kÒ’Ë,Ó¤Ø 4 Ë^lw`Oàâ“ýÜiö”8‡4º±']\\¼ž—Êp]¿˜–4­€ ~‘*b=À·¾õ­3p vx›M¾†™øùÒ-™)Š¹­¯ÙüQÖ"/EaÁÐIH~ò“Ÿì9}ú4ý&ÀôÃL@3Њˆ ‹(S\ìõôôì-//I< Së0À&Ù³’)Å×îJÀ ˆ éS&骵cÆ~ âÿ§Žy` @HÎ\q1Ú¼z0Á˜«õ?~¼ûßÿþ÷G6oÉe–!à4!, ²­=!–‰<KpöÄãÎ;ÿé_¿˜hFø¢­Z3.GÍ&ðâ‹/6‚ãí•©uðÄjÀÜÉQÌK`¢«è˜:÷ÁÍ7Ô‡Âà¼$Áz `e¬úÑG=[f¦˜€õ™ò¦– @ÝÅ@i v=é^»víó£ÔMÞK`ö”XJB {è'º»ÐuÉŠQÎ(U•·GÀ@vvöÏFáø3.%f̺±Øý³Ÿý¬ ž/ò–à`K“ÃÈKaåjž«ýyŒ—+â$ÁüYËqÄ $8ð#Pˆ·?øàƒ‡° ˆ_Hârëø\ÐãËqå/’ð»S€îßþö·iÒªË(Sö³_‘9êcŠ¬FíRúˆ Âü_}Už[‚ 6< û&~qÀ4£á‹:jÍS3¥¡rVO rE@| ëR6‡ ÁÙˆ 'x€èç¦F“+ë0€0yÛ~øáSXúcßf>ñó@M;Ö`Æ[Z3Q5àF* >sæ̹U«Výû 6‰ej9ý}in|¸®¦ÁqðƒHÁžzÌ€$XŽŽ“ÿøã?È?‚øÕ€.£?×Ú^ @4ö\}}ý¹Í›7ÓrÊ7<b;sfÅxê3s§™è©D+u©e8qâÄÏùñ?•½é™ 0Mðà(ˆŸMÍA bJ è***êzä‘Gò!m×¼µã´ÅC7“|pSÏÀÄF\17|±ÅºË1wßÒ•+Wn×þ¨%1`Z‡åXð†^ò›(‡SìÅâ‰Ã‡O@@€7ðÚk¯m@g†i›‰ñ‹^xaå³Ï>‹`Ù•íheN9Ü43Ý–Q–´“S=@0.‹Ïù`†à »ø 8utt¬»êª«Vƒ ¨ŸÅ#$ÆÞÿý/ÿô§?-…Ñ<‡þât¨ °.£?cTϵ#AÔê”Ï•S瞸¸¸S¦L¹…+'Ab`¥ æSÞÞÞØ95K…Ï#.žîI°+xÔ?räÈÓ·ÞzëöÎÎÎ.D¿fí¾`CÅþ¡£¿ÝˆŸ‘&ˆÏ®TÕCÍÄê€X!`FÀç0ò qÿàƒVc«±ûqM‚Ä€]0ÀZþ‡zèwØÑ·A=x„W¿õÅÈÏs~»iüM!ÈÞSu˜ nÈ©úŠå>Þ kßš5kŽ±nk¬®®®AêÌä¹Ä€–@¯æ7ß|óaŒúÃf¥¦ìLäêQ_=òó¨/Ä~u¿Ö²Šfåm @TVÔ‡%>gÅŽC|ð”@Hœòo÷°°07èÜžyæ™è/|á ßÄa6®KÐcW¶}ûöçÄó\y{`ÓÏ#¾8˜ FÀ×xy[¬ó«1e Ã=»ƒ 8»WDUQ'N™0Œ@!züV¦HÅo÷ÐÐPì˜åâúï|'øž{îY5qâÄ;qŸ§$ƌĭشqãÆ·¾÷½ï•a%Š÷¶P¸ |N3`ÂWÏ÷í®ð3…Al¦îÙ󚨗`‚¨„‚ø…4 H ØxÄÄï ©Àå׿þubFFÆ20‡ 0”Îëöü¢ŽWvˆ~[^^Þ–'žx‚—ôz°¦ßƒé'µÙ±›"|!ò‹‘Ÿ1`˜‘_|Ahâ·‘RQ7NÕŒ€™€)F ¦ œò}¾ 6$u­­­uBè1Õ«W'Θ1cAxxør’ Æü'ˆÔó9tKyo¿ýv“óó{«ªªXqÇ-f‚øE*F|~Fmà#ˆ^¤¸mDfœ]\uýÔL@=-PF~¼64ŒB<ë †à †à aÙ²eî³fÍòNKK ‡¿A$Vbýýý'ûúú΀ˆÇ+Æx¹&¹¹ÉO UWW—=zô,–ðZÖ¯_ßåããCLð¸Î£¶ b5ñ‹‘_2ŒA¼ÃÄ.Æ¢!‰Ÿ+¦&0þmTõäT‚°9©TÜçTL%8åà \Þ ‹‡‡‡L6 {~;8:ƒ18#u{²+®{àygž^ðÁ€÷œqÍ MðSÔ“·ÊRÎy?¾­±n@‹ò¸=L@À™. .¸UÊå \"íƺ{/BlñqžÏçqº DÜÛÑbTïåU#¬Çy¢O¾qøÖçžžÛĨ&dõ¡ÝŹHÕ#>çÁù <‰—Œ ƒÖ˜Õ»¤V¢¾œò!Y0EôÇu1ú‹TÜ©ú=‘ÈS¤\øÐs¾¦¾/Áþ0Ehâš:å󡇚ðù\¾ lþ-Fx‘ŠkâyÎS?NåŠß†L±«ëÌçÊH>ò¹ ò‘Rñœ`ê|Ä90>çƒA¤CÏMýækôÁÀPBSÿæsqpmø\ª8çßâÄÏ¿‘‹k"÷8yàT9W§|nxPwjÃWvHÕuçsq¢V§Ì †=_ãwÔω<†¦xlð=êsqM¦öÁ#ƒ©”¯‰ëjÂåkü[Lä#‹çEŠÇóùó5‡ñÐÕmàsSÇP"7õÛÔ{"ïáRõ‡Ϩ¯Ésí0`ŠàÔ×ø\üçCÓ‘˜?;ô¾ú}Ñ2¾æ°0Þ:­º=|.~‹s‘2çÃ¥üQÅ=>gàßCÁÔµ¡ÏÈßÚa`8×Ñr Äùh© ü¡ïˆVˆ¼Åo‡MÇsçU·Mœ›Jùš©ëüQÅõ¡çü[€úqM¦úbÀA½&~s:Ü9×zè}ÑñŽø=.ÒË©óm«ú·8©ú㚺&îtO<#Sí10q½/~‹”k¨>7õ[ûVØ¡Ù/EºÄÉ¥8OW†úxj›l‹Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Cbàÿ­¤Ed‚¾IEND®B`‚ic08Ue‰PNG  IHDR\r¨fsRGB®ÎéDeXIfMM*‡i   gêI@IDATxí} |UÕñÿdß÷=!ì$ˆ,‚ŠøÓº ÕÚªÕVµ»¿.¶µ¶êßîµµÕÖZmëZpdS‘$l!$=!ûž„ü¿s“.á%yïåÝûî gò¹9÷Ýå,sÏÌ™3gf‘‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰‰1à¤qþŽ’ýHx鞣´ïr®gßéÞ¯Ÿ[—Sç6ÕVõ5q.Ò¡_y¸ëCŸëo½Êk=Çò¾^„gªõ5q.Ru›L]Sßç®ã¢¦1”ÄoNÕç4mÚ4§ŒŒ gΦ­­Í©¦¦¦¯««Ë)44ÔiÒ¤Iα±±Nááá.qqq®îîîν½½.¾¾¾Nnnn.gWWW~×ÓÓSÉ÷ܹsJêááÁ— ¿•¼ù7ßSßGžÊ¥îîn¥nü›Ïàå:ÿæs”«Üêééá|•ß8¼‡k|Ýæeô1 ½ç‘?¡Ž\†ò›¯ó9_c@ùœë;àß|ŽöΕ÷cå?Ä×ð›ø]´Ÿ¯ó¹xŽ2ž”ëüòïÁ·8Ïê¦Èÿ|iiiO]]]o}}ýùŠŠŠóGí«¬¬ìÃ7vòññQòÀw>ÿî»ïr6ƒu8×8UƒòžúÂx8çN3ž@Ýq®é$‰|Þ¼yÎ3fÌð˜:uj¿¿,:`ŽéÎÎÎó@Ô³ñ|?õŽ'ì\ÞmaÎT^´Lâ˜Ç)ôƒ¢“'OÖæææv‚ô€ÁSVVÖùãÇ ¦ ˆ^ü×Åo‡M‘8lPquÄ9§LðÎ<²c4pž2eŠË×¾öµ(Œä˼¼¼ÄÊD.Ab@Á˜C1$‹¿544lüè£NýóŸÿ<7yòä> a\1A0ŽØ ÔuWàÔùþûïWˆþÏþs$þFˆŽà§;b#eíƒ0„rH Ãà±î‰'žÈÃtðüæÍ›{!ð´D0µ$ >·O¥­(UMDV¼n—WÔu„”¤Œò_ýêW½¯¾úêÛ0ÊÿDj—ÊBǺ:;;Ÿñÿ󩧞ª…¾¡÷ã?Œ@¤¢ÍÅÔÄ$`äTÔ÷ÂòÉ'CfÏžýsÌãï7rdÝP8~Z^^þ‡zè tE=Œ@0Aü"uìƨöƒ:±ÆW/Üo¾ùfï7Þx#yD6 ºaÊćŠ½öÚk}ÐYaÌ}’û¦²2ƒT V85.(ËWÆ­žR3HN¹.·ß~»+D~÷ÿüç?«çλšûDƒ·AVoœa€§—‘‘‘ßD_tÆ´788Ø)??h+ÅÀ5ôºa~ â2L…TuHtÑ»$$$¸B¹—˜˜¸!Nõ¼<•°Z«««WÝu×]û¡{êv¤iQ%€¡Äï qß}ÅŠžùË_þöˆ?Ð^_[–+10î0 ûÒ½÷Þ» `ì z†‘†¼fÿŸFdjâWD~̳Ü\¿G}ô(/ í6Y‰K1€©h\JJÊ7 þ»©©©FC•¢o_ú²®­B¢>œŠù¾Ûü㨙3gÂ5o;áI+1`°R°üÎ;ïÜ¿k×.¶‡îÅÁ+|0 e ýWíð_œŠ¾¤HQ&|…ø—,Yâ -ÿ•P¶l¼äiyAbÀàÀT€•„¯B'pUL€‰_vo :{WDÔcøQ!·ÆÆÆ»0§zÙÞ•“åK X‹˜¿'±à}–zp¨mì. 0ÁÙ.!þ믿Þs¨û%ñÛûÓÈòÇŠx€~V„¿Ä2¡òb[¦9ÑçE:Öb¬~ßÞ @ `pägâÿÇ?þ±z´ºUòE‰aLà±’’’‡—/_îŽj & hOЀ]jlÏUÑpN®Lü¿øÅ/â’““wزP‰0‡´kÀö9r¤¬°°P­àsA •>|¶öf‚ø]®¼òJwØW^sÍ5GP]æ’$ÆüüüVOŸ>ýM,i9uꔚ p;íÂ쟱ƒÄáŠ%o¬óçÁÀ‡m«%H ŒK L˜0á! ý½¬¬¬ Œà²T N7È`Þëñƒüàw ~ÿqùÕe£$0€>îºråÊk@­PÓ„®¸ëY(—ÉK®Xë÷€m Bsíӳ㭬†–NúÒ²h}K× µ‰VmŒDÄççFÑÝ “ÉÙÙ]H«–é—/|îþ¾°qçÎà—…¡®RÐDêÕrAüBëï ç ·ÔÔÔ÷õªÀx,‡Ãq×4SQ×y:Ï?4>zziwq=užãem Ö`‘ª^_¼x±7–…±  ]9ªž @4ŒS.×eÙ²eìÒûØPGZƒDùN?zÏŸ§ì3uTÑÍÆfÚC'̦sÔÐÚ©}aã´ž ÀÄýùøøxž °4Ì4¡¦]Z®'àq€y¿Û=÷Üôœ.-Ç…ttõбš6j8¯`TVwŸ§ŠúÖqŒUí› Á»_zé¥Ä… šbÚW%èÅÔœM™ûÃÊ=üÞÔ¥•ã¼úÖ:^ß©«‡IyOÖ´öO9Æ9~µlÞœ9s6x{{«­M šÑ²xÝ7Bù‘:ó¿úÕ¯"±ÁÄ\FdÄÐÜÄpò÷öÐÜEV,ÿ•Ä¯ÓܲJšDPðjúØò ?·¤Žþs „6ÕtP>“UóâÉ˃uhŽ Øõj,d·  Ý ´„‘ª «×Šp…Õ‡ËÙ³gïhÃ&üŠ«é×›óè?0ÁmDÏ{§®‡Ž~R@KVÒiQ”‘<ÜÝ\A Ú4“EÞ\0žzFjÉÙÞ^:ˆåÈëÒzA€Út)fz-å÷çWÑúܳôYu3åaÚÁÄÏðÿ”QGwݱ ‰|<Ù·Æ1~7!XÈ㨽0 fFÀ M˜€6_ëî¹Ò 'ƒÏ¿›£Ïÿ¹²¨ûÇOò饊f,¿õw¾^$ÇØ#¯´‘>…yì'kèæDSbdyºÛž°¸{Ìg ø ضÓÙ9Tä¦-X°5àŸÝŽyÄ_“SNë«Ú¨°§JÇ‹›[„ç²+Éø¾)=ž¼=Vp¾ãŽ;¼srrÚhG ¤CZ|qû­ý¥%W¼ž¼¬­¤QÞ+9ÛLOoÈ¥w«[‰hÝŽC,ʹ-eMt}LÝyE<ÅFø“‹3£aìÀ¾ÿù˜ÿëëü3ZÍOµvQmS…ÚÆÄCŒø{ó*iíÑ*ÚÏÃ"L5˜Ù ÀýÓûK©’ÁW&‘·ƒNfÏž„66ààN#èh¸féº €à’žžî°»ùŠ‘ÿ…ONÒkƒÄ?|Gä€;Úº(’ÀnH wM‹ ES&Rdˆ/¹ºXƸ”¾yo5”yå ˆJ*AT¦…Vt('*ñí†xîçíN¡þ^ä‘ØÙŠ9øu-tôL }t¬’>¬lC[{†e¸êÊ2®Xû]Ny»»Ðéq9ˆDGGŸAàPÁÔÍ´é¹– €+ÊÄïåkÓšë˜YiM }ÿý#ôa}›Y±¿j}Ԋμ£âî½Å”q¬Šœ…yr ùz¹›¥,ã¹~‚nìªl¡3n,'ü yòÙ)(_8\Ažn.Ð @Óu€SPª››þãBpâÆøøøLq” êY†‘ÿ»kÓ{ lo?væ[ˆéôûèäË‚Šé—$Óô¸0rC”]óA8;rËéµì ÊÂœºŒÅü±+š£[Ú\aJÀÇûÀ]Ô±jJ÷ó ÕÓ'в™Ñìuø@ÛN´÷å¬RÚ YËFM6„ƒÈÿû`BÝ`ª·cuÀ+3Ž°L«¯¯Ä/S®:ŸÛ´GhÁâEÅ°M²3¼2ù\GùÙȇGþu í6!~uÛK1:½‰~ëŽÓÊ„`Z”Nåõí´ád5m­m§ ‚-ŽºL{žsø°êÆ^:°û -Í«¦k“BÈË…Ÿª£-X59eƒ¸ö•×6Lµœ•ªêB˜FbìŠ{ÿÂ$ší¸clØÇdVþðR\DÓàœ¥u\CQæH)ü˜h>JiÉ+G ]Ä™‘*îñÇåà•wO…žRCžÊãrÇÁ¾´nÃ ¼¢;›‚ i6HOþdÅ ­[Ë•vòôôÔ’ÑXÜlÖ¯\==šÒrk(«­Ó¶þ•×F¾`o ø89Ó Ä,ˆÔ,«¥mÄ@%^¡!Kß7÷y]s@£inty.~B=8=œ"̈V£K…d!vÁSWºÝ87Æ!¼m$­%¥¾t)Çä¸#RÌÊŒÚVTOoÀíw<ƒ “˜b„¡ÍÐÇúéy¸:!îtÿ Ó 7ävÄ hFÐÍøæWc·Q¢ÁAJúðLŸ‹Æ!’B¡ø»oz$%Dfô×ͺ&tCç3z¶qزBÁö–i‘ôqíij°q4ša Õñ†3lB}Üéé 4':˜ð¼àÏa¹œqðÛFph.v•mÅ:x]û9*†Äѳ-´¿²‰`Éô ezÀμ£c34-*Ãß“®žmq°VM+ÕŸ9ÍY¯ @ ¦Â,.‚Cu_‰h½ËTÒ{èðöÜfÛâÊûBŸF&«#öà*ÄÈO õSˆÞÜÞÄ*ÑØåèN0…–£ð4˜A~Ee—7ÒnœŸîè3` ÁÜœ•‡ ó/’ЪäPšü\® @TX]ʱæ#FûÒCócéàÆ\l8¡_„kêjÎ;nÍWŇҖO¡ÔˆòT ÊÌyóÂ3LÎ^I/Ö9„ƒ#6âýPbÞ67Ž¦L ´JÜ·¤ã²²°ú€O—ÑŸöŸ¡ƒ ~ýÚñËÈi ðö•´HŒþ¾F®æ¸`Œ`]2Ö/é‘ù®ù ôiyeÄ#l¸6ùa-Œð¥ÇO¦¥Ø‰ØËŠyþpy›ºÎ¤ÝŽÿ;OUÓ÷·Ǽ¿zG˜_ðF|±ä˜\5,ó¡é‰Ê~ ¦Ú{9]ÓZp\²‚8ý!tìDu(ú@cu]þX+"ýéaDµ-}¨¯§æŽ+]X8X\Kk² é_§j©¦{`̇4` ÜÇÕÀáW±G'½÷~{¨”Z†yÞTš]CÝB°üyæþþ`øFggg]4Ò’¨zo)½a  Ü‹Í=MwqÕ :òˆ:ëù·ÍšD÷‚ø'b‹­`›ÔªvØŒôÕ½§5§„Úð{$|pGºkê÷B«~–yÿC\ûîu3(:Ô—^ÚuŠ¶Úw½û/ÑÂoJO‰þŒ-˜Ž€M:£^™p§H £û¦M Ü%Ô„up{¨÷¦„Ñÿ^5™¦Â‰‰—å´žç×ù}pè ½q¨˜¶ck¯ ó|Ó%{£Nÿ %êýð£OÄVènа ðÅÐýó“iÆ„@z|ýaʪmë_iè˜&bZòØ 0:@Ð¥óI `HOp‡¥Ü²™“hNn5}M·½€Ç§©°Ü{lA"Ý}E–ÞÜ4U¦°„ÞŒðXY…géÛNÒîêf-^®7Äé"üèË¥µlJ”oß¾\ñ\F|½yw&ýêãz9¿fT¦b*Ÿ±\c«Ç›£(sZŒ²ô;–¼ôxWJz`ÙDÌvÏaÞÛ¥ã¶U&ªAó NÿzålÊHaiëMÍâþÌó_Á²ÞÖ’,…ö/왪_s’üàWðüâdº%-ŽB±¤Æ†C#¶†¢¸_zrårÚx”^†Ý…ž ®QPHÞ»oìIè %;}¥.h»7eÓQØÃÛ ’1òÿâÆ”™4AÓuêLqŠ°ýùÚì"zŠºì¦;’rIÜ„ôµ”pº 6³á_`É”„ß„þâégS0v¿~.»L7&À Ê uw€¾¸äŸ¥7ój¨ÅN{è}Î;‹S&jFü,åÔ#Þ»Šè_û ) [sŠûÃhëÙ±(=ȇ~tÍTZ %šï¦$Á0VúÖu3©’Æ_Vè2(cßr´œæ¥F“‡lÇÌ‚"¥`²lõ(ï³1§„Ž!J¬½`–·+l¢E#«¹uóüý…ÕôêžBZSROç†!x‘§îOÁ~eö$ű(>¤ß±HÜ·6 Æ2ÜWÌÄ| LÛ¢¦h´¶ñ»-}\Ü@·œ©¦´ä‰†_õÖ:uŒ ‘ÖXÈ¿¢¶™6ÕQ§F®F<–†ú󞶅^òqxóýróqú¤¨†êF!|.ÝÏ,‰ ¦_^?æL µ9SŠÀtàû7Ì¢#{h'”Ž,™h þû5è9x¥ÇÛ“w®— À@è†âo+FÿÃX«Ö¼'ŽÐï8j1ï^kK¨‚ùîúì3ôWˆû‡š:i4+sV9. õ¡¯^‘@×L¡ÅàÈ–5êÏ‹uÑ0Ç}nÅ zøíýtŒuB{om­l£‡+hj|„†%9NÖ’ |+ý_Ç|´ÞŽ£?sž¸$óZ¼-€ÍÊ°Âÿ½—E¥^,Ǹ–ˆç#à|cJ=yýLŠ æÙ¶¨‰é<¸g[:é“ü**ÃT@ÈÇ4ïÐéjJ W‚¢èQ¦5e@ hÛQ`˜JHÄôbl_^(>¶!¾að=êeö²kÁHèoõXY}kÍú¼¶ÄÏEß668º&*€¾µ8•æ'NP–Ë´¢}æouí´-·œ^ßwš>®jÖm5€7ƒù¼à,­Êì"?˜*¤)°Ž_¦ 0»O×Qm¯>£ÐHM;ÙÒE ­ûX€×ößØS@ŸbÔa‡q"ó¤AÄ_G_ÌLãÁ‘V”uB󼢞žßzœÞ+¬í_}аŒ‚Œnlªþ¶¼vÙK<•`¯À=• þag(ÇrÕû‡KhU¼æn-°á »{)§ì|¬n™º1á‡ùÒÃsciÑä(Š†‘Ž»†fÆlspÓ¬µð-xõHBŠ»`¬®œµ ¶à½J0¡M‡K) «-ž—„ß· £qðèeÏzÏ÷Òöc¥tûÅØìèœ×L¢EXogB¶8ðçW @4í›S~M t „HAn”î¯X.HŠTˆð³Zâ[ÐÚI›ão|šGð3M ©U]D¾lã±»¢™êÚlbX€¸|Y¦—-`£cUv¶‘>:Qpغx_šÕÉÚ»zéˆÈ VƒuwkÁ æº7̘£¢HjÁ4‡ÍŠy¥G{k™‹9õáAMª?;QN¯íÔU/ÞP„©Ö߶Ÿ¤²ºJBXñð‡R­•€éªú*ÕùŸTÚáÜ©z!îµBã\ÅSV~%å âÏ)¬…çc¨ÅˆÔ‰‡Œ3ö_h4«#_É«$—óèÉ[2(21.Ü6ä‹ûJ yôæù‡Ûæù\q| öÇg $ m™/¸åúÁ9§ ¢¸±²°Áɺ6êB>Ì ´þæÿÞ烪Šsw¡ä/Jô¤+’"h:l&@2ð€åd@éÀ–xWS并Âνó»âê:s×Eµt¤©‹ÎB$­b¨-±hv^ˆÙB`CŸDowŠÂ|ÜŒ  K¬kÂz8ÏÕY àM8þ3Ùš·vÓa6;3&T‰Ìkvq:=¨¬çÃØh–Rÿ¼ë4킾Axú1ót㎘ Zž:‘¦Ç†R<æÝ><ÒBÇÙ¿9 7¢&´?·¼ž6圡ßÂn¿KùVÚ1‚n”Ù¦Ô€=²;Zȳº…ÂO×Ó·“´–ÓãC(1&"$zŸ·¢0d‰EcÞ¤|5é dfçDß å÷åUЈõ§aÑWÈŒ‡$5Â(ï B¸5u}qNM›L>ýXÿžE]`¥Xþû¼ ŠÞ=VN9ÕM0I†žxX{¦Žòþ³‡þoùTºmNv÷ÑÖ=ØLÔ+±¸ÿ æùÏm=F‡k[úëÂÛì@tE˜ê=– 8™Ö;ôy–##8kF|8ÅGÒ㛎PG·~_®uç¨Ð%ÐÄ¥Žćˆ…ßÂÔ`¬–L Ù‰‘ŠâÐ’Œ>žVìI:]èG—œ±á¯Ý×€`ÎT5P^yí‘F”ÚJt˜zÜçm¬Œ^2¾¿oádšŽù&oÖaŠ8ÆßLÄ%¼ëñù˜Cïί wŽ–QVC;‡ÅÜCæÐ øíߎ;©‘Aäi'FÀ˜eÂφcÍóï¼jªÆœZPÇ ˜x Èêõ³ãi"lF‹ þVÞ¾„èBNX™ùÚæcƒÒ„ú­Ï™ñ²’:𱽩 ÎSMµ­€æMð£Ù“‚irTM @„!òòp·©e¡^€ Œ¯yjÁÞìÕ⛕•5?==ý œÛþ¾î} k®cMç¨Ǿæ»#7‰ñU„ËzjU†Äsä§/¾Ë«˜ÿþ³\z~ Õ{@vþÎÂdz %ÌÏ Ó->ãÅu¿x=¿1~¾é(­=Qƒ‹­ª’‰°`¿¾%æ`Ê2–%Æ:lÝ~Ó߶Ѿª&±s ¢ Ø!R\zˆ7-L ¥ûV̹psŒg999÷¤¥¥íA6¼s-‡¦âežYÙT$rHÀ÷Q-D{»Nçñ%F&ËÇöû7ÎQjF{~è}&žhl]öìªtZK‡'Û?OVQ#ÚþÔŽ|Ú”[Fw`cË+§DÓdH<50%Y Í×ÒßLâlYxóó͇ÏÐ[˜Ÿç(NE|G0Ÿ>D r¥§®LBxõdŠ€‚o¬u ‚èýÓeS鎷÷Q ¯$ ª`9ZÕËF¬,­ƒBÑ– @.Žð±« `²;Bõo¥ûzÐW—L£pŒÒÖ“—;”†é 4 Óƒ9{NÒo>9A¹wBc¾û³“äµ=Ÿn„öúKéØJ6Däå颰²²`&mÞ1¸ïüÚž|z)§”Z!…(zA÷›ùtÊüé³h%D~®¯-€H:ôóƒ¼i ‹F…s@VeP{µ–¦ë¥‹€Ž8Ø]LWëÜ; îhñCp¬‰‡ÙVà…¹ñ} R)=6ŒžYŸMï!À[ÕµAú/– 7œ:KsEm9LÏî-¤î!ÄÑ‹‡8¶o'ÖÖ7—ÔÑ–âºþõk<§<Ê)òaLöð³iåt¦¤|Ï4Ìö¡?Þ1ŸfA"ë|ßt ìȈÝ|!©Ÿ ÷”¼n-“ ß'­ÅƒMßóÍŒ ³héËÒ 0ó À7¯KSŒƒþ´¯ˆÎb47ýä;ʉ@žHM¼1Â-ñt¬ç~qS¤íˆ_) íôÁæ"ŠVÁŒz‰úÉÔ< 8&Pz²y ´ÇS>PþM ±Ýܤ6!`çc×Ì‚ÁLýjõ(ÃûHoŒý[/þvU-„±V#¿º–n˜ôs/õUyn ØF]k‹šŒ“ÎËq߃ó§GJwß—ażæ27®BFïz¸^w°¯€™ÀÞ…åðóøáš}´ìoŸÑ?óÏ*Þ‘f¾.³:°qï¶a£=†õu­wò©Ì–ψ¥{Ž—Ó«¹6 ¿ÅñržÇž8³•~m½·ÃTùƒƒ§aËßLé0æy ¶ á83ôÇh£­‡‹è…]tNPýÆGøÞÆýäÃ5Ç!®;&00jy×\OÛ •Mq¹ßó´Â’)}"ÛãT¯Fü‚8¸½š¬°{gOýñš„]ò`>°ët%Ý¿`òE €Ÿ?tæ,½»û$½y¢’*ÅTÏs;Â` BYonÚÊÁœZÉg†Ã€c2€áZcïëè´¬T«b…}íýq6½€Ý{¹Ó{Ãíôùk§ÑýK¦ÃãϼOÆž„ËfÅÑtäŒøØh<y·°Á2¬¢|cÙ4š]|aãð!ôÊ2`ÿSò¿ 1à˜ À†°uVíi»Çà®Ì¤ÐÿrèÚ© ç¤A%Pª}{Ãa„ËŠ ðô3X ¸vF ݱ¿€þUP¡U5$›‘A¢ú,ž:Éì€#­ØZm-+¹Ò—¿ÿ'ÇKèå]ù´Qœ˜YŠçxrs%Ksãé6H}¡p”toÆgÓ#ŽÉĈ1¦¦kór#DÙvˆ¿&iÀŒ"™n¦bKîW¿t=ƒiÀÄ¥ë ¦f0ÏŽá~ÈEó葲õÁÎ77ÏŽ¥7±”fI˜4–1®€ÑÏD3G®CMkåcôWT—‚s‰Ê¡ '[é±5û©–Å}q'®®ôÐÜ8z`ñlZhÚˆÊÀß\4ÅSódIGl™ê\ÎÝ€0äz¸åáÐÙIé¥û—Òßàg¿Ûv1§f¯ê÷§y`“sræA^J%Âm×à­Ã®™kvÜA&èFˆö=€Là©QÍñ3O G;¿65’ÖÜýìÖ+(%2xxâä&s—­Ä€dV"n¸×ÎcÌüþ¼ážý:n¶õºgÑ4zý‘ké S(ÀÙ…öc§ß#%µ 3=—þ'&Â0éþŒxÄå7¦ Ù¼x ¶&²CÒ¨qÚð‡FŸqÿE¸3?{ÏbZ:5†8(3 úbÀA§ú"É’ÒúÀN# †"±Ú G³ÂM|ÿïæ º>ë² (‘bcK(ÊÍÎã–9ñôÚ¾S”‡Ý‡GÞŸgE|(øXÏ sü‘b¿0S»4ïEè²Ò¡\„ǤùACÁ5Ä2Áh ÷ÍÆ€c2³›§ÿƒLÇ@ lÕ†¨|6«™ ú90õmF62øÉè`Zíz^«GDž­lBb~œ#·Y™ú óo†ò÷¯\æÁþ@]‘µ Ñ9©L”po0&pŒ¾Ã°Àë„8ìæbÙjN‹X?À@,Ž'˜ž<\`l3š•]†êYêëßÿüÅ߆ ‰”ò€DbŸCóG}u+/ÎW}Gž[ÇÔp_0èÁƒàiÞ4ÀÆH x)Æ!h§²¶62þ¡,ð·"ž«jNâ"æ ”×ƒscI±!^ø“Y ýÞõC«g¿u‘lxl]Islwa¿;ÉŒeko[W’¥ò¤ 43Üö²Ñ†/¤ /Y(À ‹¼h|¾ ¥åŠ¹ITÛÜF*¦þ­=ÆÂÆò®E-1ÄÃçÎ!»  À&ì Y×B[,·k³®,kÞâ=æ*`æš–0ÁPÓV?Owº.eeÂxóRw³¥à‹-ÈÀ&^=C±U`åclÆÆ'~[‹Ò®®°—Öl]o“UîíeWÛÁ5A^”„9­'«•8wJû–êxkr#Ͻ3Á”âøâç\°-¶%À_b2”{¿¼k!,Ã.5WåY’)žeÅ"ïô¬`Räa”õ ž¦@Zº«ŽºH¶ÞéôõoÜ@ùÅg±0ö /­§ìÚ6*…õ] Î($÷96Ôø:<Ûü1êZ Õ؉0È×ËJ…™éYI—DÉØÏîD;o5g@\üœ…ô¯däWh>.dÈŠæÐJzñÝÑ~u‡Ù…ÕŠKÎǾà…ïˆU’ɾîÊtjƤ š39šâ&šgžmnímM3Õ« èéá ºmáXÒ ò£Œi±Ô‚ $ÏTÔÒî㥴îãXç.‡µojaO؇ 6rËêèŠDL„¤bF…xqo~9­Ù•G·/šJWO%oŒ0²Ž9Œüˆ?Öö±{а ¯+ñ,¨óÈ%Z—¿`%̇·aO{C$ô"Ñ`œ‹c‚hÑ´hš?BÑ}Àà]0Õ±ä›Ó½vÖ… Á6§FF¸ìÜùãÈìÔXº£¡™NB2È.¨¤ì’z:€ýäÊ!ðÎ96¯À(_±¹³‡ÖgÒÖ¼[À‰ü¼=éÝÂz÷ÌúòŒBúÊâé4@¾èlce^ÀW46fÓ-P§eHLg4p•Ïyâ`7_K€w-úèP!ÄÖèzÀ ˆ@ønW`Û³Q4 {¦â[N Túœ%v–´Y<+% 3Rf¼5!4"BhþÌjƒ=þ©Ò³´-ç m€ñKa{·"ðþwz¯}o‡TR³lEÁ¬Ö\à72kåÐq´AüýëáRÚ”WA+§ÇÐWÿ?yBÐ¥óks3Çs,¢‡a-Þ©˜09Ê÷)^x¶Ñú«h’òâîü î´ӚGy+µIˆ·{…ë&‡Ó"ÄSHˆ #?¬j¸ãºÖD¯®ó¸ÚI·©¹"àcyøR†¿ÍžC÷4´P$ƒÃ…U”ﺽ5­T§– ´„ít²¬†Øß$­ Sx$žOÃ~x»*êÁ®œ¨~ôê«t¡]¦XP·M·sþx̹£ÂƒÑmaZµ@28QXIaSÿqadP«Qýj±ø±öÀ)ºrJŒ åØðhðe­rj$í.gÐO8ÜÊ ?¾>‡R>Ï¥oaK°;±S0»ûZÂ\øÙtnî^½ì•3”)@ÿ–ßCoYý›‹QŠ2QÞ0™²cÑ.¢EQê4̃c¸œ`#__”B™3â”>Â}…çó—èÑÚ>½¸ÙHŽ™+8:söÌY‰ôÃû–ÓÚo\OOf&·5*ï‘ ¸Çýö]Dö9XT…)°ùŸ;áµ3ã(;û¶9ÞzŽ¾þÞ~úê_6Ò¦ìS°:ì4[Áγû@l>²8«…`~ûÙmxëÑ3ô!VR´wô‡/ÏO »®K§ÄIä5 ÌÓªñ˜ïe†ù¢_·mSú. ÓŸž¬¤£Å, ;ê kü¿)ƒVb÷]'ÖU ÔÍëÐ #5g ×òjþ{Èÿö7ÑoßÛMÇJk”€›Ã€ÎÎŽAŠž„öZPÕa‹â‘¼ABº¹òìÊ+Êö~ßO ¹¢®O©ÞïÚ(M®1‚¹„ËtaF˜ ÷•Yû*#"`þªäÃèæ›À×|!¦ï”‰ÁôÜÝ‹hurÅ`Ä ÁJÇæ'ÑÚÇo¦ßÝ0›faMŸkÍ2B~kýÑxþn=½¼%›ÎBƒ>\pRwŒz#ZúX©L §;<-ykw.=öö.ªS,"™rG~¢¸¦‰~÷Ù±Q=GÎi仾˜òÍŸHÁP_î0®•€æ|\0'š7-Ž2väS)läµîØk¡Á¿~_­^4ÃtØ«a žŒ©À¼–Š«ë© "qê¤p †;ðƒËÓhv¾úÙúëÁ3Ô…#3‚&„ ûîúC´9»ˆî^8EqÈñ÷‚|3 1ðˆ!¿Q+“„Îׇ©Œ—y °}ÐÞ¿¹ýý7¯’$Ä\h‚åÿ{eÃ~CK˜f¿"# ëùºt-›2漵ƀҕ0"Œ¡K¹£fÀ†DW%‡Óºêf:§QUÏÁ¨å+’£(%:ÔlÑ“é6êuQ;x=Flý|õZ˜zš^ÿì(­/kTÖÌ;Á >„!ÔÆ7wÑâ=ùôäsh|ØH0‚a‰œé8°æ“5µwÑŸ7¤¶çQ˜^4¹f¼ŽÐ Øæû±"z÷h‰ææÜ &øÑô¤è ¸¸³Æø¡—€vr¯êsðòÏb(S@ ýÕæžjㄼ«¶•žý`Õ¶ ÄÍ·A_ã%ÃUó&Ó‹¯ ?Ý<‡0Ú;3±a„?‡6l-:K_~åúñ¿>¥}ÊfŠJŸ1ÙF\UîY^¹rléõ,6ú¨bOV5.Ê_ü¾4_./çL5=óÑAª£¼ø½áêiÝuñ–”×׊x—Ö\»+zM›µdƒØéîîæ¯eXàQq2`Þ6%œüX>ÖØ ñ X¾µí¨1ÈVÅ°ã‡ïþò5iôΣ+è»ó”-µ)Í9xýÊ.¡›ÿº‰ž[³‹r¡(ìc.0,ŒtÏôK 9‚{­`õ-ôÜÚ=´¿N[ÑŸkž9grT ºt}ÓÈ2ÐU­¦õ £Kü=¼<Üé–…SiÃÉjÊ‚BM+ÀØH¿ûô8EÂ’ï–Œ«¬ù†«›;ìæÀIe2”‡+Ò+èÙ²èÓ’:E¡Æ¤K’¿üüE¹(’€é|úÅk¥%Ï‹¾¾ªê€0§?®?@ëNc p~t¸wUÙX{ê F¹Ê¿8˜÷JèÇ€.l#¬‰Oo¬OÀR@"l+R"Èãñ•{¥­¢"â#ï즹ÅÄ;ÛXgÀKˆ‹áEø*O VÍ¥ØW@ý±—äÌÏû- Mµ -Å3V×JyÑD¾Šdpq®­PX¾²ùý~ou J&Þµ î‰R°äÞe3ÉÇ‹–I` èÂìe lé'ö…ÞÍ™)”ŒŽ¢5Ôaiðûoí¢œ’³ýÑtm\ ûôG!œøC×Í¥¿?²‚n›EîÌØ.¦ÁKKUÓߥwmv…w~ýó£ô‹-GaÔ„BG«×˜KF¨ó”pš™blåŸhæxPŠ¶ðˆ¢ùç,l ',LKšD7%‡lål7諉J…‰ƒ˜ó~ùåÍ´?¿L&À¨àÈ>©0vúûC×Ò[_\DË"ú¹þÐ:‰ßx§=­þdÈHäuQ*~ð&¡Ýô¯OÓw¡ô«Cì†Ahzã{NV|CË3ðɸR‚›ñ'uèèì¢bhë{”Å( z¢Š:8÷#ÐœßÿOiO~Å°†;cEO ü!ö®ÊœJ¯|ýº^o pdkúà[|Çz0•on.ýϛѣ짎ÁmÄL=oÛkí`j»a—Ðn1–õíû›R;-Î÷µûtm¯nu‡+‹3áÞPóáW¶ÐÇòͶç!»aoñï+Ðã.O†E`µ0L¦(¯þ¿ÿp/=¹1Û•Å Sʈ—7!²Ð–½¹Ô£‘÷爅[xs\Ip²°ùöy¼¾©•>:PHå\_eD'Õ!e‚;ÞÜAw½¶þ3Þ( µnJ>§íÄÖe#µKaÖT@´‡ÇÙià÷7ðÑÅký:àuhE°Rüýæ£TUÓhMët}À,ÚvUÑE èâÂûÃ8‚ﮜS´³æÀÜ9õ”Ù äéué¹w¶SAU½ÍõìcÿΞ“Ô‚t$è§M p€,í¹ÄÖ†‡š;i'\¨±yè÷€ ÁZŠN«Øä@—Æ\Ú<ó¯ð¨ð˜êBæçhÝ“Õ`Ïíʧ‡þº‘va™°MY²³./õ[LÔÇŠ«éµì3£!{ óóãZÁèßÙS@ÕøÞÖ+:µÇÌxÒÏÆîN<÷ß–•G{ëž«jçƒ-·cÁû_ÞB¿Y³ƒ ±Ùèpž}ævÅö®sôÞÄ%`7Jû¬Yè—Wí»ÑÚÆ÷w $Ü[›*ÎUæâÏÏé‚u™ØyY‹˜gkÌ¢Ê <Ì_¿º€§¶åÒÊßHoo?BåØmˆ#åZ ì¡·.+Ÿ^†× 9½Š™ ¥<›Ÿïf·_s °´6~žCÀ½›SJEeÕ6ÎÙñ²ÓÊØa0Áá-ûri[%»¯÷2¹çÂVþQøÕgÂãoUf*ÝžB8ÔÍŒøuÐø¿·'—žxwÕw³!òèÀv€Š$4ú£ÊlÔs¢¬–^ÿ$«¬_0‡6å¶,Û ÷ì¤Ø þi<2ÐK KËa hù°5ô‹iô»´²–þ¹ã$U|¥¢(ü¸²‘¶®Ù _‚ctöà[85†¢C(ÈÏ[Ù<„÷âc`)WJÎ6ÐûûNÒKû ¨ŽC’™£WíŽ&𠢊‚:¬\ëøôeD-®ƒ?¿>ºë±w†v4âÍg®ŒfO‰5œk°^Ö³º0€±.mr`¾ôùÁÚÓÐN¯M¶Î•Çð“ ­ôS8n;A“¼\)}„#¦ûäP_ mTQÓLÅ ítsþÁ¦ žŒ\«>˜ ˜z”õ<ÚŸ‚NbÝÚv¤ˆŽ`¤jý|~ðdä2Œp7N_ol͡Ępò÷õ6B•ë —ÞL`D;î§Uµ ´á¢é°ÚÛÁ€ë߀9wClp8•7^4Àe$fl°ÁV{,IÔb{®ÊzìºTZK;íg< «P&ñr¨?Gþò v`ºít9]13ÉpR€xÕ…èÑKË`¦´æ“lú Q€Æˆ˜›¶hK%züöãƒTÝÔA‡aPQ¿£ü9¶)fàÄ _iÃÀ¿cˆbôHÓ“9Hˆ—ú–½Ïu‘¥taz)4,ùbEØ6ìÍÅTgAÌ:KòwägÏvŸ§WJŒ{ "1á âç†éÒ5õÁ ‡ªùøtÝpà$]{åL¹1ˆ>h·o)<÷ß~¨€´tŒ§¾lS¤ö‚àÏ%|›–`œÌNc™tíî“ÔÐÌ¡Èzí¥¡‹€^vÍæ|:^¯.æú}Øü÷°:[a2½Üñ° AT÷ÀÜ(&Â0Ÿ7§;ù]@{{»Êé{ÌuS]˜ß¾µéí†ÕŸ¤} Rò>…X&ý‚“T5†£ÌçÍ3Ú5èä qÆ0jörÄ×ßpñê—PÙû%èï¼¹q >?gwaØŒì±5F¯ë"‰D„Ð5w†‰7RdzùaÀúŽë0”C†q%{$e•UëzèÒÒ®®.f³†_/ºoåúÞµ3(ûHàÙö-“‚éÉ/.¥© Ç¡áì ¥¯‹Ô¬ èÕs?š—§Ýrõ\:;ù°ŸÞaè”pybÀ ´~g|(}玅ð ˆeÛtýp„AS­7ÓlÕš(,0ý0gfI~¾^t÷M™ØÚ™~¸áUØ9€™Õ–r,»IDATÙ<ò¯ÀNËÿw÷bJ‰Ÿhˆ‘_4+gBÐŒø¹,-À`Å«ªªÔÜL´Ñî)orëòtåÃÿà6«•pY`À #ÿ}‰áô­ÛRr\¤¡ˆŸ?ÀÙ³g;†|ˆAzr}L?µdƒkhh0$à úA'pÇu󈃂ütã1*S$Mp=ˆyb_ ðž K±YÊwïZ„-áŒ5ò ÌTWW³Ø¬yGÔƒôUTTqF´ÏP©'$ÛÁx»èç?>BG`.a|b€µÞ÷'òœ‘!G~õšššq± ¨p0H¢]†MYàéÀcKS);îJpÇÈ¿<ÌW!þ)ØÜË}Ãa¹¶¶V©Y«eÀ‹D0CKâ#ðêÀêæÓÓ7§Ñ4ì"+aü`€~÷$„Òï±_âäÄ(ÃÍù‡bº®®Ži†éè"ZúÜXk= àø-X_õk…µ~Ÿ]BW^=‡Ú°ƒÌï?Í¥ã"F¿­?ÃÀR3Jì’ÀÛu*`ër´F˜5ù´ÝmwÃц@#ƒ!ElÝ~”å…2®› (üRŒOüŒRLÔƒ¦­±2øÕ´`¢²"¥àà`'XV¸¹¹M,ÙÀ'>^ž´úÆLòÅvZO~xˆN!4·ìîF+’B•ˆ¿à’Z ¯´1ìË«E5ÉÓÁ’1ͺ}fÅFÒÚ}§à›ÑFöÌÖÀe}!6„~ðÅ%Xês âg``\HÜ–>ÿ¾ÖÖÖì   ‡`\if7-ƒ,ÏÑ Ÿäb‰Ð6ŠAñS°ûðâøZuåÊLKÁ Äyº)'Ÿ>ÚGN×RV$xïñÞØ›lº-I §• §QÚÔxEñº|þTÚ°ã(m:\¬ìZTF`‹ÖóÈ¿2:ˆ¾{çU49!šXûï»™“>>>\Y5Ôç6k†€¨WX9Р¾–––<0qÏ!RÞ.|õ ™ÄößÿÀÀ¡õUus£kâ‚éžå³hVjù#˜§PD]·pÍ›‘H«ŽÒë[ÓgåMTF0$W^ª§;Ý<5’n]2 #q¤}Ç™7+ÄL §n]D×/¬§»ŽÑ¿wÐ>D!êw׶ß.(sÕ¤ úÉ—–)K}ŽBüÜZxÏæð ‰SõÁ·ø·MAKÀUPYYyZÍ’˜˜›V^ÌX1xó’4˜ ÷Ð [ŽÑÁÖN‹Šå9n‚‡+]›F+®H¡ù³R(Ðßç“SDM¢ ºQiÒ¦ÆÑޜڊH»³î ¦ 펵t;hw(¢Ïð§+S#iñœdbÍ;/¹µµÇ£äŽéP\t=x[(-ž›Bƒl:RJûêÛ©iÐ(Î<Ô{±Ü±_ù±Îϸu$hnnÎçAu‡fÕ׊ˆŠ+)}åsæÌѬ!ZfÌDw^?ñãédS‰™®Úˆ7¿,*€î¿v6¥ctÀˆ?Zgäûá!tãÒ¹´dÞTº« ”Þýì0}rª– ;»¡0³ý<Ù–¸c±;+(™h÷ÊShî´x ò#78^ %|Såºb÷âÔÄhJˆ™@7]u–ÞÝzˆÞÐÄÒÜ´}> £üMõgL¶ÍFÌxÊ6-A!èë”Ñ«ëöÑG†Š œU3Ì%!>ôý{–Æ¥W]?Kγ²²8,‘ù9Õ ´`\a–Ô 8êÔ)9é­B¬³ šµF‡Œ¹CþF7w7úÕúlÊn뤉õ¯ÃÈsóüÊ@|ù ¡£ŠúÖTÕsj^ÇNöv§ýhj$`qoj—2Ï·d´7§ ‚ÌšOOOš@wäÓ¦½y´öhåcZÄ&s_d—Þ;)b¿­Ë7§Ž¶|fãÆüqyࣾ %[£ä¥PWRTü|xÇx`üúˆæÓ híY{Ï:=ÀböªÅ3èýãåt¢Ó8 QÆÔX]æÝLä¬S¹ JRÖ¯4·¶)K‰ŽNüÜJJJ6`@0…v´ìWZ¯Fp¶Í½¯¼òJ‰–Ñ;oî„‘õ"~nwrVp]-»bCÌC8¦û`/Ü"eßX¿ÏûC°ÂiOƬ_¿>›§Ëh‹ ~ACœÚ´Äš¨87Diо}û°{tO¥Í[q™e裚Ì)ÑŠ½šîñZT a $alx饗x¯:Á[¦#¼­%àb™ p#&=ÀyØ8¿Ë7$X^"›=yŤØ %è™ñÊ´ÈõqÔ:À\þØâ©H5i–– @T| 0HÏÁƒ·kÒ’Ë,Ó¤Ø 4 Ë^lw`Oàâ“ýÜiö”8‡4º±']\\¼ž—Êp]¿˜–4­€ ~‘*b=À·¾õ­3p vx›M¾†™øùÒ-™)Š¹­¯ÙüQÖ"/EaÁÐIH~ò“Ÿì9}ú4ý&ÀôÃL@3Њˆ ‹(S\ìõôôì-//I< Së0À&Ù³’)Å×îJÀ ˆ éS&骵cÆ~ âÿ§Žy` @HÎ\q1Ú¼z0Á˜«õ?~¼ûßÿþ÷G6oÉe–!à4!, ²­=!–‰<KpöÄãÎ;ÿé_¿˜hFø¢­Z3.GÍ&ðâ‹/6‚ãí•©uðÄjÀÜÉQÌK`¢«è˜:÷ÁÍ7Ô‡Âà¼$Áz `e¬úÑG=[f¦˜€õ™ò¦– @ÝÅ@i v=é^»víó£ÔMÞK`ö”XJB {è'º»ÐuÉŠQÎ(U•·GÀ@vvöÏFáø3.%f̺±Øý³Ÿý¬ ž/ò–à`K“ÃÈKaåjž«ýyŒ—+â$ÁüYËqÄ $8ð#Pˆ·?øàƒ‡° ˆ_Hârëø\ÐãËqå/’ð»S€îßþö·iÒªË(Sö³_‘9êcŠ¬FíRúˆ Âü_}Už[‚ 6< û&~qÀ4£á‹:jÍS3¥¡rVO rE@| ëR6‡ ÁÙˆ 'x€èç¦F“+ë0€0yÛ~øáSXúcßf>ñó@M;Ö`Æ[Z3Q5àF* >sæ̹U«Výû 6‰ej9ý}in|¸®¦ÁqðƒHÁžzÌ€$XŽŽ“ÿøã?È?‚øÕ€.£?×Ú^ @4ö\}}ý¹Í›7ÓrÊ7<b;sfÅxê3s§™è©D+u©e8qâÄÏùñ?•½é™ 0Mðà(ˆŸMÍA bJ è***êzä‘Gò!m×¼µã´ÅC7“|pSÏÀÄF\17|±ÅºË1wßÒ•+Wn×þ¨%1`Z‡åXð†^ò›(‡SìÅâ‰Ã‡O@@€7ðÚk¯m@g†i›‰ñ‹^xaå³Ï>‹`Ù•íheN9Ü43Ý–Q–´“S=@0.‹Ïù`†à »ø 8utt¬»êª«Vƒ ¨ŸÅ#$ÆÞÿý/ÿô§?-…Ñ<‡þât¨ °.£?cTϵ#AÔê”Ï•S瞸¸¸S¦L¹…+'Ab`¥ æSÞÞÞØ95K…Ï#.žîI°+xÔ?räÈÓ·ÞzëöÎÎÎ.D¿fí¾`CÅþ¡£¿ÝˆŸ‘&ˆÏ®TÕCÍÄê€X!`FÀç0ò qÿàƒVc«±ûqM‚Ä€]0ÀZþ‡zèwØÑ·A=x„W¿õÅÈÏs~»iüM!ÈÞSu˜ nÈ©úŠå>Þ kßš5kŽ±nk¬®®®AêÌä¹Ä€–@¯æ7ß|óaŒúÃf¥¦ìLäêQ_=òó¨/Ä~u¿Ö²Šfåm @TVÔ‡%>gÅŽC|ð”@Hœòo÷°°07èÜžyæ™è/|á ßÄa6®KÐcW¶}ûöçÄó\y{`ÓÏ#¾8˜ FÀ×xy[¬ó«1e Ã=»ƒ 8»WDUQ'N™0Œ@!züV¦HÅo÷ÐÐPì˜åâúï|'øž{îY5qâÄ;qŸ§$ƌĭشqãÆ·¾÷½ï•a%Š÷¶P¸ |N3`ÂWÏ÷í®ð3…Al¦îÙ󚨗`‚¨„‚ø…4 H ØxÄÄï ©Àå׿þubFFÆ20‡ 0”Îëöü¢ŽWvˆ~[^^Þ–'žx‚—ôz°¦ßƒé'µÙ±›"|!ò‹‘Ÿ1`˜‘_|Ahâ·‘RQ7NÕŒ€™€)F ¦ œò}¾ 6$u­­­uBè1Õ«W'Θ1cAxxør’ Æü'ˆÔó9tKyo¿ýv“óó{«ªªXqÇ-f‚øE*F|~Fmà#ˆ^¤¸mDfœ]\uýÔL@=-PF~¼64ŒB<ë †à †à aÙ²eî³fÍòNKK ‡¿A$Vbýýý'ûúú΀ˆÇ+Æx¹&¹¹ÉO UWW—=zô,–ðZÖ¯_ßåããCLð¸Î£¶ b5ñ‹‘_2ŒA¼ÃÄ.Æ¢!‰Ÿ+¦&0þmTõäT‚°9©TÜçTL%8åà \Þ ‹‡‡‡L6 {~;8:ƒ18#u{²+®{àygž^ðÁ€÷œqÍ MðSÔ“·ÊRÎy?¾­±n@‹ò¸=L@À™. .¸UÊå \"íƺ{/BlñqžÏçqº DÜÛÑbTïåU#¬Çy¢O¾qøÖçžžÛĨ&dõ¡ÝŹHÕ#>çÁù <‰—Œ ƒÖ˜Õ»¤V¢¾œò!Y0EôÇu1ú‹TÜ©ú=‘ÈS¤\øÐs¾¦¾/Áþ0Ehâš:å󡇚ðù\¾ lþ-Fx‘ŠkâyÎS?NåŠß†L±«ëÌçÊH>ò¹ ò‘Rñœ`ê|Ä90>çƒA¤CÏMýækôÁÀPBSÿæsqpmø\ª8çßâÄÏ¿‘‹k"÷8yàT9W§|nxPwjÃWvHÕuçsq¢V§Ì †=_ãwÔω<†¦xlð=êsqM¦öÁ#ƒ©”¯‰ëjÂåkü[Lä#‹çEŠÇóùó5‡ñÐÕmàsSÇP"7õÛÔ{"ïáRõ‡Ϩ¯Ésí0`ŠàÔ×ø\üçCÓ‘˜?;ô¾ú}Ñ2¾æ°0Þ:­º=|.~‹s‘2çÃ¥üQÅ=>gàßCÁÔµ¡ÏÈßÚa`8×Ñr Äùh© ü¡ïˆVˆ¼Åo‡MÇsçU·Mœ›Jùš©ëüQÅõ¡çü[€úqM¦úbÀA½&~s:Ü9×zè}ÑñŽø=.ÒË©óm«ú·8©ú㚺&îtO<#Sí10q½/~‹”k¨>7õ[ûVØ¡Ù/EºÄÉ¥8OW†úxj›l‹Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Ä€Cbàÿ­¤Ed‚¾IEND®B`‚ic04˜ARGB9fƒlf:‚ž‡ÿ €9‰ÿ;e‰ÿgl‰ÿll‰ÿll‰ÿll‰ÿll‰ÿlk‰ÿle‰ÿg:‰ÿ<€Ÿ‡ÿ¢‚;gƒlg<‡ÿ‚‚ÿêÛøÿ€ÿíÿ‰Øúó€ÿÿÿý³/oUMoôÿÿ€ÿ<¬³Ñ4Vûÿÿÿÿá%ƒÖµÅ\S×øÿÿÿ™÷¡ѱÛÿÿÿœ;‰ÍÁb·‡êÿ€ÿ®Ù¥l«4k€ÿÿÿü…_=J-ìÿÿ€ÿ冬7…§²€ÿÿüÿ›àÿý€ÿ€‰ÿ‚‡ÿ‡ÿ‚‚ÿïåúÿ€ÿñÿ°ˆãûö€ÿÿÿþÈ‹¡††•“¢öÿÿ€ÿ<ÃÓå–“üÿÿÿÿ笃¼çÓßžàùÿÿÿut³ûÀxåÒttâÿÿÿ²z¨âÚ£×Ôo£íÿ€ÿ½säǧǃŽ€ÿÿÿücnŒ}|clîÿÿ€ÿ蜸l^šµ½€ÿÿüÿ©[ãÿý€ÿ€‰ÿ‚‡ÿ‡ÿ‚‚ÿõîüÿ€ÿöÿϺíüù€ÿÿÿþۺŶ¶¾½Æùÿÿ€ÿ<×°²ãî¾°»ýÿÿÿÿîÇ°ÔïâêÁµéûÿÿÿ¥¤ÊüÔ§îᤥéÿÿÿǤÁëæÁã៽òÿ€ÿΟëØÂÖª®€ÿÿÿý¶’™«£¡’˜ñÿÿ€ÿí´È•²ÅË€ÿÿýÿ¼Šèÿþ€ÿ€‰ÿ‚‡ÿic14ÝK‰PNG  IHDRôxÔúsRGB®ÎéDeXIfMM*‡i    øµ…@IDATxì½”¤Wuﻫsι{z¦'gi”¥Q–P@B#Œñ½Æ6ÏÏÆÆ÷®çõîZ¿‹—ÁoÙËØ?óÀp¹ï‚0 @y4šœzBçXsî÷Û_÷תžéžŽÕUßWûH5U]õ…sþç|gç½E¬†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`†€!`,Œ@`á¯í[C`a>ýéOÇé/ŸúÔ§æøã?þã¹Ï|?dzzZ¿sÖ×sÏ=(,,t>gff:ï©©©½{÷Ê¥K— Î+11ѹ¶žç§ŸCמ÷}AAóswww÷œ¹)ÇäææJOOÏܱîyW¿s²sŒû½þ­-==]w½ÁÐÐÓ·Ùãô_†‡‡cõwšÛw÷;½®ûÒßÏîùIII±±1ç;> Ÿãf‹×ëéïî}øìŒ÷hn¦aŠêKû;Åx¦~vú¯¿3æiÆì|ú™ctí¸ÇÎ{ŸýÞ9Dÿ¡é=æŽgNœë3/sߥ¥¥M3Â|N 8¿ë94çsȽ„µé|×××7s€þHÓ?rrr¦YcÎ÷úë˹wGGÇÜwúÁ=~Þ—³LMM9×Ò÷ÉÉÉ鉉 ç5‹ƒ®§éþþ~ç˜`08ýó?ÿóÎg}¾BŸ+þÖu1ïÔ¿õ8žO§_ú·5C`)œ…´ÔAö»ï°q”¨»›n2÷Ýw_Üý÷ߟÈÆ™Á&žQÎ…Håð*ˆ/`#+á»M “§/6¿~ÓÏ9¾GÌhl<ãžÛîöööQí ΙvŸq~צŒºÃ`ÌüiÿÆ"ÆÄά«d¦£ ¸Dþ¥—^Š?xð`ZFFF9Ç^6„[yíᘛx¯ˆhl¤†€ïf„Ç`NÂ,œ@ûp&áRkkkï7¾ñq½+À(èFaÌ‚âóf €'Ø‘êuxgÎœ |þóŸOÎÏÏߎºõA ðïá§TÿßFf+@à8ÌÁ ¼~„)â(­çå—_žR¦€æ˜õô}׳C=€€1˜¤etÑ™GUñé±O>ùdü¾}ûÊQÛ†Ûbÿ4_'.ã:vˆ!`.§a¾Žiá%üiÎâÇ3Èl's¦c\¤<ún €G'NDW¥ÿ¡}(ð¥/})#++ë~Tù¿ËozwXÖsCÀˆRZaþoÿõرc ª!Ð~šÉ JgkÝ2` EÑ!Î|AøêYÿÔSOmGÊÿ0RþïÑGs¼‹¢‰²®~G€}è_Ðü}mmíK0D-L¡p‡mÚ‰(~Ÿ›­(îc¬wÍ™#UïÏÚòs‹‹‹¢ÿŒÙðc}uØø (@@™Be?ýýïÿ¬†/š™ &e]0` Eà¹yùÖ·¾wçw&•––¾õþŸÑ—­èÝÒ0 å 0Ž™àOp$üÒÇ>ö± ¾H~èjÜ÷å\ÇŽÙæÍÜËn±4Î|¨m»~Ü?üÃ?d¢÷ÇHûÿûÒ§Ú†€!`DçÑ üâ÷¾÷½Ú+ö47I‘1Q2MÆDÇD8óàªù¿öµ¯U$''5ÚÑÑ=ë…!`«C¦ ­ÀǾüå/?¯XŽá8Ë€p ºükÎ~²užyæ™pêû §\þ%ìHCÀ0<À0Nƒ¿}áÂ…oàÏ4iŒ@äçÌ€ÈÌÁî8ÌÄýýßÿ}¹Æ¿MWnŒLw쮆€!`lS0øÌg>ó=i"šÌ4°aÐÏ¿Ñ!šÿµý&æðVç¾›o¾9cË–-_ÂÆÿl˜îg—5 C Z¨§Ò“ú§zŽN™³àÆOÓAÚø[Çܬ•ðãØ—ðè£þÿgb°!`!à#ð3ª*~ˆÚ$Á³€a΂!8…ãc|8.jל‡€~'/?•õâý×ý¶]»vUã৹ø­†€!Ó°n¦\óÙ³gOZyyù‹ZjûìÙ³JüM@ óÊ0€Ãð¶*õWTT$Ïÿen÷ ụ]Ù0 O#ÐHÝ{(^ÖˆI@}\-€ûîéÁE[çMžqˆ¿†õ©ÔOBŒÛ«ªªÎp«Cá¹]Õ0 _ •’’ò{wß}w€Äg¯P€È´aœÖ9)5Œ÷ˆµK;˜šÔkÓnã5 uF ±··÷¾¿üË¿¬7mÀ:#;{9Ó¬®Jø‹5þÙgŸ-Ù¹sg=ßÝ´~·°+†€!3¨6àwÝuWu{{û¹£Gºf\×i °>@º 2€“_üç>÷¹Çqj9Â¥“ÖçòvCÀ0bLxâ‰'*öïßÿ}j ˆ0ÁuZ .áZ§ËÅäe 5¡ÏÃ?÷«¿ú«΂ý˜DÂm†@ø8åÊ•;¾þõ¯šI`}@6`õ8ºØiˆ_܇?üáTTþ?#¤å†Õ_ÒÎ4 CÀ¸ッƒ·}ò“Ÿ))é7I¤v¿€óæ° CN1 Œe~œ#þjïÿƒ?øƒòÒÒÒ+œ›¼Ìóí0CÀ0 5 €™õç{ì±–¶¶¶ã0z%ó XžÆ¬ ´yÄÿ/þâ/öæååç +»Œm†€!°`žxüñǧΟ?ÿ*™õRƬPc–Øñ甸üàUTðÓä>Ö CÀ0"€õTîÿ¹Ÿû¹BÞ8›4(½ðî-]¢æÝlLÏ]œâPûÇýùŸÿùÝôyacnmw1 CÀ¸”þ~›cÜôÁª 0ÇÀëÆoqKün?¿["ŽP¿xˆÿ=FümY†€!=`øøøøøÿñ;¿ó;jŽUÍ}EO'£°'f¸þ¤ÌIþJü ;Ù—••õÚõO±_ CÀ06̾ç=˜ÐÏÞzë-“þ—1Æ,Ò<âÿ7ó7ùùùŽ§Éâ§Ø/†€!`‘B&àž|°›G XzŒX#—ø;©}ÿäOþ¤°¬¬¬†CÝï>˾5 CÀˆ(ø<úÀ\¨®®>Gt€ë `{÷³bákׂâ.'Ãß 7Ü^QQq‘ÃÌ_âZ¬ìCÀ0¢Š}ýË_þr{ó¹çžÓþ©s îífP4f›5‰™÷9âÏŸŠMÂÓO?ý"þÒæf†€!`D3™™™/ýÑýQ®úoÑO—Ö¹{|4w}Ãúf&€ùPëâÐWÜ/ÿò/'üÙŸýÙ_à]ú¾ù‡Ø_†€!`@ @n€gëëëÿ–ÉÚÚZ·ËÆÌ"árE.0±üîÿ¡$ñ_üâŸHLLü­XÄÆn†€—@{»é÷ÿ÷¿N­5w+½3â2¡¦˜Ã]qGú»¿û»ÅÅů„àd CÀ0<ˆ‘{HÜÑØØxìøñãæ2‡Æ¼ËÆÝ|óÍqüàSî»ï¾8Gs Y(öÑ0 ¯"@dÀc÷ÜsÏw‡‡‡ƒ³áʸ‚ŸW‡µæ~Ǻ À]úغuk‡?üá/CüSÖŒ¬]À0 C j ˉèJRAN¹´Ï¥QÓÏìˆ ÂFÞ3Úî¥ Àqú#Óß8ý}0Ú:hý1 CÀX3Ù”oÿ¼ z\ÉúÖ|E_ –ÕÜ.çØ·o_jÿªûýÀãóiÝ÷8“SÒÙ7,_ùéE¹Ü;"ãü-Ó>0[Ÿ w–gÉ-[òäà–B‰‹sAOšuß3 à}ì¯ÿú¯¿”žž~â«_ýê×üÚ|ðÍ d%ÿÆ*àî<ú§áG?úѯð9y%àÙ±†Àz#  @ÿИ\è–ÿàÕ:åîOë}§¿^ @aJ¼l-H“I˜š83Ánü$ØïçwïÞ]à7uæÌ%üúRZsL@,›âO’ˆ8Á{qyÆž C ÒŒOLJçÀˆtŒ‰âÏž¤¼FOcߨt ŒÊÄÄTìí¶‘^\vŒO~ò“_˜5( tB÷÷˜yEÀl‡À!$)77÷;13ã6ШF`htBj‚Ò51!“ÚSÉ$#0ç þ͘6zGdzÊGƒ‹êUe»r¼ü"¦€]$|s³*=piÃÕ‡ûöïXdt2âÿK¿ôK‰ŸøÄ'þ+^ÿI¾a˜g˜€@ö¡þ?ÕÜ+ãjû÷L×—ÕQUûŸ›˜–ö¡qéì‘)ÕjX3"„@eeå? ªÆªW©¸:8(ý“ºÿ¸KÖo㟖º±I©ëÃÜ1H4€iü6Áž9>K­€ ©@¬žûòÜXVÚáXaÔ¸Gy$áïþîïn€ ؾR°ìxC L#ŽŒKkÏœë–)•þ}*„0Ö ÌNÇè¤{‡Dí‘FàøÀ»õÖ[¯öð+>w,0î$êXãz{{ãIñwsØC ¨/\΃ãr ûøˆ:ø¸‘â@úHxÔŽ³ã8ù¬‘F 99ùwð K¥¡Z€Hw+ì÷@AtT:ÄüÇå+_©¤<ä¾°#k70–‰€†Ã©W|; @5±ÿÃ㦥ÂßÐ=(cã“ä8ò7óÌe`‡ErüêSO=SZ¿3ó¤ÖWâŽ;>áuf·7æ!0‰4\ì—&’äÄJ~(}D>8õæ!b@FFÆß´i“愉-€ß]EŽô_VVÿ¹Ï}.Ÿ”¿nüÒ²; # ÎC£cRÝÖ/— Dü_ø@?}«€KŒ·«X†ñ°fDüÂ>ó™Ï¼oV à2‘îVXïïg`žô¯±žØx>V4íâ†À ˜„à÷ŽIÄ°‰D@äÇ]á¼yøL@'æ­{08j €7gѽ&/À_ONN†šÒ#‘Ÿ¡;yñxÿ§&%%ý’_'ÒÆåMœò¿¤Åm%;^þçÍq¬¦×0m8`ˆ½Çj ²s6Œ/~ñ‹7>|8” Øø^lÐcˆ#Æ3´¿n¦vC`ÙŒ¡ ¯iï—®ñi™P~U)aL¼2Ãs¹cPºÑLY>€e¯;0¼`.þ?ÕÀ]\3€+H†÷Ƹº_wÂt|ñõõõ Tüûãàk·4E@ÕÿC¨¿Ï¶öK»ªÁcÊÓÌÏ©ÎA´Ã¢ubjø‹® û!Ò¨ŸØ³Ï>«!J?ô¥ôėͯ €N–Nš3Ÿýìgó ýÛìË´AyQ-þƒô{©{H:´øOŒQÀA¤þ+ÃÒ50&ýTA´p@Ï.eßuే~Ø÷f?2®ôï0O<ñD"•ÿÌöï»GÔûRé¿ûãÈ”tÆ‚÷ÿUS†Ë£\†ïéÆ ›Hc®ÈþŒùùùŸîëë e\º±>…ãÆ~d\œéŸzÏñÄwþW÷K{7¢>¤ÞÆÎ!éÆñ?Æüÿæ¦`E]ph\ÚH ìÿHsöQŽãMŸúÔ§ò)§~JK”ð]ó+àLØöíÛãÿê¯þj³–â»™³yÿ×ø³m}ÒC" Øm" –DHa͈î½÷Þÿtûí·ûZ à7ÀUÓè»VüKغuëÓѲ ¬†€"0SügŒ\øÃr @Ï„*ÃcÂõÿÚqâPGUÀº®!§ ’2FÖ h@€*¿ÙÚÚêjüF+ˆý8(— ˆkooOKKû­hXLÖCÀE@}ý´øO'Îoq‚Óxø˜mŒ½q|JÚ†&LÌ ³+!êN(`þ¯ýÚ¯eбÐpÀ¨ëçZ:äW@Çÿ‰O|"‹IÌZ @v®!°Þ¨ Ø7"A2žÇ n2–4õ8@‰ˆè²|ë½ÔìzkDà駟¾ëÎ;ïômN?1®ä¯ïq·Ýv[£>zÏçßN7Öÿ¯mï“ÚžGñ¿î7ðاyb{IƒÐ@N€‰Xõ†ôØœÅJw‰øÏä5(}ñMSÎÆOÍeâFFF♼ûip6ï# ÒÿÐeqþ;Gü¿L¡ÐÃVÍÐ&—ƒ2Jyà”ä‰ øjŸ™cû×s>þ‘ÂÂÂPG@Ïázö“À§Ž)îÆoL¤Ýå~iïч€CÝðcÉñKÇÚKÌ{ËÀ¸4ŒBüUýËÄ_—%ãï ÈàÈXLEèôkDÍ 1:®Î Ö¢ ?üÃ?¬ª¬¬tµ®mÝ\Uü¸“¢ï:¦øüã%«BÄNÚ4äKãà›:ú¥oø!JÂNÆ@>xUÿw0ÞvœÞj&Œø;‹ *d=4ŽKc0…~oêì8N*価iêì—zLBÁž¡˜»×æ–H²»7oÞìj\šé •ßL:9Êþ&ìܹó6¯-´Xé¯únbàÕåùêNÙ™Ÿ&ûʳeki¶ä¤'K"&7¿ª€•ñ©CÕÝñS5w¬Kÿ³‹~ ‚`ÒÞ;,E9i’‘šäËÇA ÿ$k`h§GÁ3]òÒ¥  Q êž÷•JyA¦ó ø*++ëiLÊ_£ë}á]‰¿/ž\?1:)úrìÿÙÙÙVý0¢­© ¼¤/Çk;äžh‘ãýc’ß>(Ûê»eO^ŠÜ»£HönÊ“ÌTeâ„(Žhªû£cFÕ{û+ªn™¶Ä7¡`öãXs´¥( & ôïVU¿2¾þy±©[εôÈÉ–~9Û;&Õ|7mi$#bÏð˜|à–J)ËÏ’¤DÕ:[‹4jJžuô]8 €xr8Çá¼ñD¤ŽÝ>ªþ®kï‘·.å¥+òjïˆ4³)^¤NÓè˜Ôcï™$+Ü€ì,É’ $¡B¤Á$Ç wþµ¼ø—–þUwMÏ°´ñyFˆð… ±.ÓÑGB¤K”¾Y "RrB¼«m]—ËGì"jãïd­wÈY%þíCr‰5pž<ç0wŒ+w 0ƒShê“œÔy`_@JrÓ%591bý¶¿‹ÀG>ò‘Ì×_}˜oBµz€§`?0®äïHÿ:AýèGSgë9ëY‹Ûwï ‡ðÿ´¦Sþ©¿ƒMÞy~؈kžF%Ú'÷¡¾ƒ×^ åìÄ,P”“.é)IŽF †²ê.(!Pû LN7Ìã¸ê«ùìDà臼ļ÷â¢~ñqªòæ8ÕÁU¾^>µí7v ʹÖ>y¹¾G^Ǵֿ͙CügÆØÀó0Ö?*i5ÝR‘Œ‚hZÊ`‚““ü™ˆÞCSûÈ#ìƬÜQ]]í2êýâ]õàŽÎaÊÊÊâž|òÉ­î—öyÔæÙ7<*Ç®åÿ;Ý‚ä? ñWÆ9„yv6Âi鞘’÷MË[]²iè¾²¹g±l-Æ?€M1)!Aâã½IÔÓ»‰”·]8{c°v½¼ ƒšhT0‘¤èµ,jãWí…2{êÜzª®S^«é’]Ô}€ñë„)šÖ諯rn;¿¿ˆfLNµÈS\ãθ€ù,ÕFU\\|7´å Ý|Ü×B³¸Ñ][Óýü¸€KK dãðšP±“× µ{·t 8áWÞi’—{ˆôB%ŸÐ›é5À&8À{ïÍ5“òFs¿Ü]–%+reϦ\)͢ñà9ôŠ„¨8ô! žÆöÛÅÆNé»ÐaÛg‡*2ÝÒ†Ü& ?+M¼Âë©ÄïF¶Ôµ÷Ê…æ^y¿–3Øøë(w¬Q½ºî—hº*Ú |±Gdâ\»´Â ¼ÿ–Í ùh¼Éú.1hüœ™™ù mmmNW}åà7 n||<.55õf¬)ßwQÕþWZºåèå |¯ºC~Fœw{ÿr[?çŸÁ[ú¯Îñ^9Õ1$»ê»äŽ-ù²·2Oò2Sg¥Äå^12Ç馮Ò&“íÃD,ƒÈô8Bw(d_i‚ø·¡6ßY‘Ç_ÑOò4—…2w›»åÚN¹Ô="501jã¯e®ÇTÜ×E°Ì¦Ê0õyMYë>)¾AÞwS¥á‚9ÀÚÆ#@yà2ÊÊ»*)×9Eç fvãû½Ôý°šÜBßãêêê)))÷,5pû=¼(ñoíê‡øwÈ«uÝòT Ë€®é»á(Dàu¤¨sÊ  &iL/ÞÒ› 3¤ m@~Vª$'b'uWÂ5‰ðŒa€þªj»f„¢7ºÃ[[)"#š žZ)1šUâW5¿–tnÇ¡¯¿SÍ}ò ’ÿ…áI¹¢&.òXí\s^Zƒ ü!r{¥,;(·Lá!©Iæ¸àâ ó—=ôPò‘#GÔPww·ÑwÏ>Ð^gB'A?Çíß¿?Àl>[‹Jüûñä>…4ôí Äú#uòݪ7CG‚š–ç7G¦äT}ŸÜÔ: ”fÈÍ•9rcU¡(€tÍ4ZBuW˜‚éï!Ø;$-¨s «% šÏ¼­:¾Õ 9+VÃ0|É„ÂEË|*n¿ÿöžA9ÓÐ-ÇzäeBúÞ’~4\ʬ~­‡ ÍuTð"š€À™6‰cmkhìŒ ÌBCÚä—Éÿìg?ÛÇÍ\G@OÍë €;ññ׉yàRÝ/í}ãÐXçvÔ·ÇqøûÊ;ÍØü‘ü‘dÖIfSš—£“iiè“Ÿ‡äVœ¬îßQ »ÊsˆTe!s¹ÃDA „Úûõ]=Ù{¨p§Òáðx§F%ÖG@‰g5Z’€4H)Iñ½™ÄPÊDJË£s:ÁÚVUk÷ œ%ÏË—»å4ÚŠR:+¡Ö(†pˆ‚AÂ#_Ä|¦Ž-˜G»¡Â|_BaûeÇŽÛ¶lÙRW[[«[K$¶—u›w2ô=îöÛo·Àë¾L–wAÝ$k[{å(Ä[å§êíϦ¸nÄ?¤ÃŠË©dzõú6ȃ—:ä@i–ª*-D ¨F`£2 Ò'Ñ‹†}5C¸;¤žêv—0}Ô‘ì¨F Rã¨[ü'd,ö1irCä­à d©CÃÓ/•˜z ²R$;=…BA‰ŽF`£v_%è÷.ü7ÎAôãÕ_”+$í¹H9çV˜Û1‡ê‡ƒôÏà¢k« &à¥nêHŒua›$YÐf)ÉÏpL_¡èÙçð!——··´´ôe€P @øn¸WöwèСøªªª€›Ýâ*Tò× o]j—Wj»äg}á#þïÞZÕé"Ù /÷H7*ã66æ ¶öƒh!ªÈ(§žä©3DãÝóÖç“nÌZÀE‰~7’¾†}5ïÝ3ÒLQe_‚HTã³0¤‡E>\Ÿ±DÕUÀê ÌÒÏP«w!]—µôJQF’g§J 9! y×TÁi)‰aK¥Ó5Drª.汉ÿ"}8K‚ªS0&çXcW üªåYUÿ²Àǧæñ4¦µ´¦^)Îl“;wŠ”äY² eÁ·áxËÄÄ„oˆ¿Bâ@ÇáhrssämÞ­_XÛ8ÔYK à‰šyá2vÔòá’ü±nƯSPèu˜€ø<‰ ù®Í£²Œ‚ê(˜Eõ°'ëž?Ž_ÕûêÙ¯ùܵŽ½JûÕ0@ow Ë;ô¡ÇQ|(Xƒ#Ø‚ƒ/›ñ•h¦8Ðó#ýNÈä¡Ä8ÙŸ•,‹2dGq&Œ@ªäg¦P;"eŽXÿõ_Ñ"=ê´©á«W(Òsç¾HPu„8þ~Õàl(á™oî«É‚ÆûÆ$©:(Yc+Rjš€Â÷‘ì²÷655é B™¥=<èÞl^g\M ¾Ç)wÆ$mõæTx³×šäGíÜo_l“¯o’×\É_7Én³óe «|“Ü?#Ûàmy©rÛ¦l¹m[±l*œÉª¦„b%¦™ËÎØ€G‘L;ñünAÒ¯n(àvSG;Ž~˜ƒ!Þ=¼'lô¬-r?ežx«¶ÓcQêš’W ~™0™ÛRd[vŠÜTž#»Ê²¥˜”ÑYiÊä%HŽr+™_½¾cãg-k"õa9F­Š¹ÏÌ7õcØøÑô¨’æü£"ÓÀ¤}s ®œh–ÇÑ>Ý»·ŒÚšÃÃ9)ø ¤Å777;'÷réO8oÖk{PpÜIƒÁ8 7ì +bvñ9tÓl œï ªú}ýx36ÿ$Ý #»Iª6 ™ »y< ím“r’äCoÔ÷Ê}[ód/Ž‚› ³Ð$A$®ŸjÖ%ücØ_û ǪC<‰×÷Rº^µ¡ÚoFÚoQÀÜç>ÌádÖŽ€æËïç.ˆ´®¯ˆòÉ y£sDŠÎ´Ê®ÜTÙ¯Àn˜™¬‘)A¼žã 3S\W5Xš¢¹Zóô£^?ŠÄQmüd¯ÔŒ•á¶ñ¯}ÄZY“?ÅÔ4B”M'f¦÷ߺŘ€•¹ŠãqL8~ü¸jô¥Íe<ùàû…pT2ÝÝÝ€m3óbÿ†µù×ÕNmþ?¹Ô)¯(ñ×Øçÿùcž–z$Ȧ Ô¹¨ë{"ϵõËÊØ\ U%Ù’ŽS™F \ÝÔ]ÕÀMêÌ×Ñ'µ©©Æùë6aµë×BüáFÛ˜¯‰ßþžÙg»YZOá2¦˜DÖ\íð„œÃôs’ðÐíy²ÿ bæÕF®f ¡»º !í« §ÆîYû.à°y Ö|Hê¹öÆÚø¯îÝõÿVæ´izBÞé‡iè•Ì”FyÏÁ ' Æ’]»µüzàÀäçž{Î]LîûZ.Ñs½Ì¸œ—¨Ÿã¶oßÊ™EX?ß\í¤í8F½ƒ·ÿ+„àý3ŽQ½ÑZÚ–’Èl¹LöÝËäá߈¿¿sHúp.S_Žê4[²:•iñµÿjü¹VokĦiÿ\{¿œì–×°I÷ëÎë¾ü<ÉÑ>6‡Ð°Ùó¯ú]¼ƒV ‹°¼`Únï–]˜i¶böÙ\”éä‰ÐÊzZap˜è‘n¼ú5œ¯žc5Ï‹„hžfM8ɪ¿h@‡NuMÖë(cΤ€P‘û6‘,(ß …kövïÞŵ»x9Bg¸î³Q×õ2àbära½{÷&¹_Ú{xP›?„S ûü¯ÓmØdGfˆ¿ÅhnÚ=l§ç 1»BF¡cTd;Œº÷þª<ÙG-hR±ëØ1kœiì–籿 ¸•Pƒ!$Î1 á‹Þv˜2êG`!x5z §½âÊJ§åá-yrûÖ|Ç4 &@Ó Ãaõ-ü7ŽÀØ©¡óÂ8sì¹Æ¸5Á 0<-ò~>'ÀȪc ù¬ÿlVUU¥¥¥Õ ÍÑõ¿ËÆ]Ñ/ €#ùßvÛm–(ŒkG%õŒV›ÿWŽ6aó×ô¾3RXo»®—Vµî¦ŠË“ã2ÐIX¶ü½Wºä†â4©ÈÍp$þ l¦‡&¤³q™Œvæf]òþÅ&à{0ýô“,J ëԟ©Ú•“,9) RÍüVRhJ³ùqÜp´j¯–9ÓhA´Š 2§Ú¤߀§n®t4V@h™ .ó0r”£i>zòäÉP ô2ÏŽ¾Ã¼Î„raÂBô}Ö‚€Úü/SìäíKAùWª”½ìAâ ŒælkaóoÁ? •ðbös“ú¥…„=­H„m³etù4„ŽÀ>/…€2nÝú"žÿâ¨ÈûÒ1¨ƒhŒë _åš«¥9û»³žÑb¼ÊsÙÃúeyËÓ·h¡ + ´L —sÒ>~f®úßeôÝ“ Éë €ÎÙÜ$””ômmÝPµjñ·©ê§…}~ŒÃŸÖn÷èšÁgæ™mf¿l&‡€‚ö]û¾'Ÿç±ÙÇ9 ôCüq)y&¬¹¡þs‡øâcjäYÒB˜·ÊrÚåÐÖi§v€ú?X[;„™ç'''»4gíŒð¼Ìè$hsÞËËËdj²"@3˜¬Û¿*ù÷’}ìD-%} 9úw<¥û•©Ÿ$cqšuƒÍ.8DßOëvc3L€Öˆ?×æ$¿RÇG+ ´V«ø  ˆ_.àÒ U\):Nñ2 ºÈÉɉKMM͉XýÑ '>ºwPŽê÷ÕcÍN¨ŸCüý(=ùcÊl†€£Ý¢íx±kD¦ÉÏÑŽ£îÄ–æeâ¨Úkk«E !!¡ø*À¥A«½dDÏó: à9ÜœY /¢húèæ*ù×µõ8¡~ÿ Ç¢ŸRÕ/’üøbŠ!6Ÿ|´ç@u‡ôcâzÿmUR‚O@%–­­øøøŠžž‡æp—ø»{N½ä@g2 vœ3òW7­vV(*ù×µõÊëÕTôÃCþ‹64·hgì³!`¬ ¥FMhIl”ØØ+ùÍr÷îR)εB«”“Д÷ööêé¡Äµ—‹øy^g\Î+ ˜€¢ˆ#êñ(ñïì%NúJ»¼Dü7ȧ? ¶SÏ›ußXžÝZ˜€12¦^ìÜ4uÄ10?ËñXðûrQH-ž™™hkkÓc\&`Ñã£ý¯3sø37 œCdå”ø÷RØçÈ¥6ù'›Â>ñ7›ÿÊÁ´3 hA€ç·sÀ ¤Jž>Þ"Oír×nu 4Ÿ€ÕLQHàjNªs¼Ê¸’¿‚é|VÇ ì3Ƭry©Í¿1Øç$ùùê±Fâ‰)„ÂwÖ CÀû¨9 u|\^ê!u2y<‚¤~ú d:鑽?Âj¸ÛÕ¯ëÀ:ÞÉ« € N‚¶ÀÈÈH ...wæOûw%(ñ¿ÔÔ%G.·Ëà04WÒw%±c C ªPv^}Þ"Çé­Sä±C•RfÉ‚V0sqÆá.°‚3£ïP¯3Š¨ÃÀPÕ-Þ­p©Ú¿•ô¾N’ Šü3…rflþ+¼nÑ€ë€c`6I½JrRe_ežc°*‚Ë›¾ìììÐXJW]ÞÉQv”…4Ð××GÉOÓ¬d}¹…}Ž×´Ë7Ï´ÉKÄ ø"ÃßJP°c C& yŸòÄQ@èƒ<ó‰$ *&DÐ -½²²²L°4Lr„«† ƒAÁ Ð2.v%þ*ù¿s¹Mþ_ û¼ŠZ°ß)ƒê¹PÖeŽØ3 PÚ&Æåy ÛNâðÛB¾€÷ÞT)%8&,ÈÓbmè Ãð¹  @)ø"/kæM@EEż¿Ã0ï¾¹¤Võ»ÔÜEaŸvùÖÙ6‡øw9Äß7C´†ÀheÌ–ñ1y¹kŠ‚I„ RLè™[«M€% Z<4¡™”òÍ„æˆþI½N}ØÀ³¬t¾›¤—:å«Á!µù«ðoÍ0 …`Ó¨™˜¢Šà˜ìlí—»GÇ‘lÓp¡¢ì¼oL~ádéééfpWèUï©8õd`¶Ú ãj¾Wc†À‚d°£¤'JrÒŒSà‚Åà—8†ÒMOÓÐxz*Í°ðôÅÇÅÉ–’9¸)W+ÉÂxe^=½f¨}kë†@A ;3’åÞÝ¥’žbƒBÅàn¢žßH}Ãà˜áùÉYcëö‘çØ)ô±£,GîÙ–/‰¾Ñ^­Fv!CÀA .^nÉL’;+2¥ª$Û …@£¡5¾ÙD½ÎÌ}Ó\µJCþŒƒ P'žmÅYrGAªl1& ûh¡䲫îÎI‘h ÓS“œœ¡¿Çúç´´4ß0^uœ#ü,FçsJJŠ×™™°>Wú —ä¥Ë¡²,9Ú5,u1Çž°Bn7<‡@b Nv$Æɶ<†Ò ÿ[x½J7¯_ˆfÏÌP¦àšÆúªÈÉH•;v–Ⱦ¬$©ÐHµX3 C`´ÛïÙ”íHÿZH}ˆ¬ÍG @"ßøbóô 'CàüY²¿®A@ë}We˽UùÒ9:%T›žš¼æ8ûÂ0b$‚*ÒÜßÁþ°£<Ïâþc` ø†½3'À¥W+å’‡žƒ› dwnŠlC  ßY3 XG ›ä¾ÒLÙR˜%¹™©¶7,²$&''}³iz™˜7 øÌû{‘¹‹ù¯5‰Õ&ðérCF¢¨ÍÏš!`Ä6CUž/‡pü+ÈI“”dÓ¨.¶"f¢çýêYÚã'€Q²ykrá?Ô ;ßÊ|é—·:¤alRÈhÍÌKØ6ïUŽ.do ù¸Ê‹Ùiш{B9‚ÁÎìd9XUàÄýÛT/>Q8O‡ÒOCå€0ÀÐIY|öì{²½Õ&A˜+°L£é0ÍÑ®ÔZI4Ü™Øq³yÏ"”+›ЙðÅi|—‚„—ŠƒW2ß'°áÃÎ4ÎâÜ JÁó¡.üàø” Qfˆ÷^=£Ò9>)Cü61¡÷ƒYtùE½ŽóäñÁüIfAõÐs¶ ýÿ®¼9´­È!þæä¡ù[cWýÀ(4¾IΰÆ9]Öé M´Sžìªé’z ~ti=PkÞ@@§J‰?t·25Qvå¤Êž¢LÉ#ßC:BÉžÒˆúHås™K™ï$^ññ€ù:¥åSÌý$×G4J!˜1ˆýï؇Ç&¤×Œ€¾za»Y/Ý£”Œå÷~  è5f˜‘Y]†Àe6¼lLõ23xSV k'Ã)ûë£BwáœG]ѾXÕ~a$//Ï€.ù ˆÅVêìÇ!ðlïˆté®”ÅZT#àÐýiI#F;3=IgȃØnï«*”BT¹)h”Ø'*±ç}µ;•Z…Æ©9 q™˜eFÆ¥­oDšF¤µDšûG¥¦oX.óÝ¿£1U&BÏs—ÓÜššíÉj;Õ“â½Î©â¦ˆõqëg&Á,´‚ê#d-vð à§ü̵ü!9„ûÜ»«HNµI}×ôN[^€ÂÅ÷ Æ!bC×%éþ^<¶ßG±–C¹RE–ÇdæSUûŽ|ＯøóN %.ÿ1€Øg+@pUÊ«äÞ¬˜ò¬ 3å©ÝÅòÀö)ÍJEÕ?#ñ‡«'*ºFe>Þu ˜¹cvJ¢”Ñ=ø”ŒMâG€¶ {hLz‡¤®kP.ûåíÖ^y£cPF0!8ëKÅÏ™ ‡«ÛvÝ%ØùÄŽÙJÊߜ̋û_/?þìu@çD·¤@FF†Ʋák,‘13-In¬Ì•nl»/ŒÉè†÷Ân¸(ª>ç%òn¢˜Òþ>*;î£J[en†$áØ7Ç/z‘ðþ jã$85;¤;·J”ÖTIf²ìÌÏ›è¯fŸ¼Ò9(u¼jÐ œé’+h &]¿9¯ÄðöÕ®>ƒ@xoOO 8O `Þ,åïŠVF¤¹uözû†h’ 8ézµßG /ñyÒÌÆ|CsŸœVû­#v.~’ý>zÔåª*Ï„¨ e;Rÿc»Jån²8n+Èt<ü£yR§Ã¼´dçU06™#ÁQ¹Ä4ì“4%m}ÒÃÙ‰a΄΀œ±‡Z»²®­€¡ùÛ—Ÿ*›‹³’ –EÀ7 @\œZ,­­Õ”çgÉîòy˜ :XÛ#5˜£ïj.hç¬i¡+D>Nn…ØßA¤Æûö•Ë.TìêݯóÍÄ¡Ák$‚š+ŠpR¼es¾DHßû÷–ɨhw ýgagW»—›š â0`µàÓIèbQ éH£³é.7ßl¯Q8[ÿƒ)ñrcaªØR$ÉøX‹]ü2ûÓ¬qkD€:Ý]–)­5“r&ÀÂ×êrNWs Òo›ñþÜ4¹Œ·ËŽâ,Âú’%ƒ¼ì~¡‰šg  Ûÿé–^y­6(Ç»åÑ'sÒ¿âå2ËÁÎŽY0a7ö{Ë–|Çñ/Îj¬ ?Žîèèè]ñIQz‚—€y{"&/%*–G2ªÀ<Ô´7ôfk¿ÔLLȈmÆá››Y? MÍ|€d,‹3ås·cç¿‘¸l‡ðÏ[åáëJ¸¯<ÅX»Ǥ¹—¨Tÿ/£úÿ÷+ÒD1Uýƒe ã,o"0ïŬ´`GYž¤ð¼ûG™F쮺taaaîU_yöOßÍ 'G©gç!*:®›AZrªÁÙUÝ.  :7¥yŒ X¿ R,•ªOS‰‘ǫ̀õK þí,–ÇwË.¤þüô'&[òzs³ vøÿK—ÛåÕún9‡Ô?JÄétçðî?ÄÿE{^k˜õ¬‡r®ÅŽì,œ€ä#¥ï"Há«Bùvþþ‘ lû}ò}Âú~r9(G™ë ¤æ)ü@ð [ýBÔÐÔd’–d~º<¼½HÞ¿¿Bª ü©aªJ§LY.ðñ½e2Lh`Ú¹V ÖtJU.§}KRŠãîžÒL)ÎÍŸh¥fVý»ÞøCg¹Þ¨Øõæ!0Ɔy–Jn'H |”|±hþW⟃]úYˆÉ/ßZ%{‰í_Ê;}ˆQø‡Òå ÌšÈçÿk¨ûÿ"yÕ¯ìѤ×Ô¸FSQ×ÙGn„§w•`ç/”ýZîXý% ÒáÔÈëµ31_}ðàf©Ä,Ÿ™,ß8Õ$Ý06¾d°šÒµéxýû–ÑYÓª´“g0À–ÂuPÑK‚—×/¶ÊÒw8ÒŒ9¢ÉAm};žþÿ â¿ÇÄ_']¥~ÍÙÿÝ3MNLÿy<æ›`F0÷L+Y^+e†‰À4ilþ³þ§ö—Ë6êä¦&#™Æ¯ùò×]¸!?ê02ŠoÛ\(ùÔcпÿñT£ôâà8ã°Ö†Ü,ÒáÎë1y¼Ã¼ÞµgȉýO6-ÀºÎŠù¬+œv±hF`dt\š‚}rŽ@­ææu‰æ¯gßTžm›‰é§*%`š|Æ«$C‡Ô‘oí–‹í½òÊ¥6yµx=itÛ‚È*5®v€zlý ±›ú·â(yi_3ö)ã”A&¿HùK(°­ CžÙW.0µoiúà|\%ÇjÇ<»F¢â ì›Ðn\ìƉ“| ™8Z°¾3c>닧]-J˜f3éÇö¾±K.i*`õ5Ï0H% r3ÞÔê—M6ºµz©Gbº•.«6§‡ yÕ¨øß!´ïGdÌû19ü5Îß!ú¡~!ÌϲûË9mž‚º¿<=EoÉ'¦¿Ø‰’¨¿hÀMÍ·b‚hèÂáqB‚£=Ž¹C£ý²´X³µDlœ®ë"r'[rp†Ô|Ö «0ÀÕˆØßs !)6wöÉ ÕíROàXl¢n(D’%'ýÎÂ,'1—pp ¿Æó×Q=ïG8ø}§ºUNãà7ŒÓߘ¾u°ókÍã¤þRbøwgÊGoØDß’ò$¯*¦?œ§Ã¼ÿ@%㱕7Éw/¶Ëf‡ ç7ìÚÓÒÀ|ÿøJ§ì«Ì“<²*à—¬”c ÜÈ€˜äÕ QCÂZ þç±%!î¿u<¥¹µñBÕR<¦úwÒ÷BÔÁïu$ýoŸ‡ðó¹SÎ8ó»&U¿»¨¸N♂jÿ½„õ=´­Ho+”-Ô@Pu¨RÁ=%ÒïÊód ÉypWI‡’eµý£Ú2jŽýÕû­›dM§4m3Ïo>Ùêûà¡yr¢hÆDÑdDKWTjÃŽXø…^ZQã3Í·úŠ­ })~ÊsÒ¢B…½\ôÇP÷;‰|ˆã?… çT[ŸœÀɯâïHº5XÃ|*Áÿ9HÑ{Š2ä‰]EÔA(ÄÆNø©£YRZ¨æœýÄÊÿ"™Ûð 8…VdÜæ|– v”× C£ ß&j+ì¨(p’y°öÉ Ð7¬”1k_¾»Â´ÆýŽH‰SŽHýª„b ÄÂË¡×Ô´šQÎ ›§þ^¼À›ˆØxår»|›¾ç±ù7aûwûÖ*’;K4È”>Ü &»ˆã¿ß-{¼‰æEðJSgÄL·Á¸<ÔÒ#˜¼Î÷£a>Øâ‡aNvËžãža´4š¦Ú|Öº>qôÍfh ÀZWƒÏWg±š–nŠ¿ È«8ÿLiâŸk³x @Z²ÚŠÕó?z©‚vw­McÏ€¼ºÿ?pðû @v~ ê[³.~e‚²È3¿‰LsO¢î¿L~·ãᯱö^¬6§Å†J±‘ˆ:ÍDFôÖ ùÒÈmÑ;Ý3ý[âß €wF&åÖ®a©mí‘BÊ&›3à ÅØÏÆÄØ„/5\õü—c³0ŽJtvó_ê\ýŽm]y*/ê„(ÿÕÖ?€­ÿ röíZ9ÑÜ+µ½ÃÀqÛB(Ù*ç2­P‚JÌhCž&âÏáä· ‰_%èdÌQ Ï’ËR™€-ùY”.“I˜¨¯‘ ÉI´J¬–¼á0J^€ê®A9^Ó.û«Š(—ï)SÖB“·2 &§}ñAê×Ö5 '›{äìÀ(šì‚‹÷º¿¨­|mÈ8/•¦¢±ißêÙàz¹U¾s²IŽbó bçÕy[ª áW…gõîãü.Ò ¦än9Ò¤VÞS¦ÀËM™'Í„øN}‡¼r¦?¯Kþóæƒñ]°­_Ú»HÀ”hyæÛÛóÍèÇÆ kë‘:Ô 5Ž9vÛ´LBø‡H†4H‘äé¨1([6Š´ZM•¾£uAù¶þâì7âÆô;ty ÌÛ¬C¼¦”½'¿ÃØÉoÜ”+{Ks¥ÿH%óYϵ¨¾šéêñ—/¶É«” ¾DB¤ÔÖ€Ýzvr­×‚¨#W}?~!ÔyÐÒÀ–h­ úç|cü3—k‰ý“3$‰iÅvƒ–ÿk1„ ö@(ºIˆ´Â-Ò¡j$»åûgåûç[äuœØ&T_'‰<…ëdá%_Iáž'TÈã»Ëœhˆ-Üs-JžùFɺjMTê?á×rÇß=×"GÑx C,ßðÌ–ì¨:5j–ÇjLC{*‹f+zy—rX°(€°Âkƒ#£¨ÿ©ßÐ#µšö— 1ÖÛ4Ä¢‘<õ]C¤´Í#Ó]ä7ÎIµVlü÷ÚEyþB‹œåóvìµ6Ysž‘¿ƒ¾÷m-tJï.Ζt¾ó²Ô¯+YqÓì—HmýoÔ?x•ÿ1Tþƒ¬õ ïËâ@΢ =0 ÏœCSÌ*+#ERÉÑ`muXÀêp³³¢®¾!©nÂûÏÿ.§äŸ1*òŸÇƾ#Ø+L”Q\eí„v­Ë@5/_n#įEêלX«­_ÃR“ Ñar#ÏÔ…_ÆØ#{ºoÔÉí‘GVÀÔäì°ÞÒ.î Ìày {/'Ù :‘$/¶öJæü×]Óè¿#6à yI±d1•‰JY‚¡*ìú¤6ì ·£ö_é\9ó‹ƒC)¦`Ì!Tý þ·Ò·â=8ùi&¿µòa_¸KÜ@±ª#Ò; ræö(‰­Î‘©o^B$ÿ¯uôyÒIÆÃzŠzm.‘¢,5ð‹'~6 &y©!ª4‚j4H”SHF=êHæHFK¿C !´WˆŒ¸ˆêX³ÆÇEV"VD+Û¦&ÊÀà”Œ¸RìR|‰Ã$è?IæÙHö•T9ÜU”%·oÊ—C›òä`Eždú€ðk©c lÅ©ïgT<|îTƒT“§aÈ-Œa&nßÖÈ šžj˜Ÿ=Ôµ˜€ÉODãc-¶0 ¶çßýêþön6G2ƽNÑîIuÿs¨…¡£D)R}~ˆ½]ýŠ2â KQÛðA§™ µÐŽJ²ê½^ ã6‚&€\ 7¦R{›HŸ“õ…gÿf’ßì-ʔLjé¿ÿBìÂZæ8GäF¶p÷Wò­Úù‡‰d©Åls¬±S~€ƒäO(wÜs«ãÔšàšpbo}k}€wÈìy+ÌlßЈ䒲9’ëx%óMÇš`4͆õeͨ÷ÿåæn¹‚š»Ö‰w½Íñº "-ÖbCþ.’äÃ;JœÚö9¤ÁTS?„ͤàýýûwË•ùò*Îl/âÍ~¥g„Ð@rýÏNŸòB^’~.R½ÆòßDîû›`bv"õkTƒ2©d9TBàe¯ ¬F5‡a}?¼@ÅCÿ1Uõc*â7Ç»?R%÷æ9‡”Ð 0G-0ûZ (ŽZÖV†€9® /;:ŠPZ¡D£–Â?µx»ÏQ(îó†w=R%Ë6|$~p¶IJ©®¶)Z3àEª%”” ÁÝ»½ØQá¿gW‰£Þ­ïtTßê }¾€þ²ÙkÊÛ¢ÌdÉMO‘,‚4Ì~Õί!‘çñ_yýJ¡}rŠÒÇ-0mêÜÈ #5MQv_’áÞÓÄ:®Ç©ugeÁÚKAGÙ­;+CÀL+ÃËWG«Ô¤yÿ{(€RÛ1(5ý#l˜±œøçúÓ;ŒÕKT×;DiàLbä·Pù.>‚¦ÍÂW Q/@}_EÉâ­YÒÊ\cûV†E+òe‘£?7=É){›Ï€zôû…j¿.lúêäw ¿7Ђü˜ù©Ãîï¨û•ðñ¿jQOK#øÔ£e$êzˆà¾ªsöç#` ÀéÛa¿rˆƒf¸'“Ü nÕxHŸGýJ+Ʊ©Z[õ¤>ß9(ÿrºÑ1ªçà=Ÿ‹) ÒR´ã¡ßU’(;ñäצ³¨„Þ!öü£ ~¿ìóÊÜŒÎ&h:ÑîD½×ðU͇ ê~uòs›-g‰™wü}.ÁèoÁ<ÒÑ;(ZÁ©£G¥@¿¬‘ùƒ¶¿CÀ€ÅñÉ÷*嫤¤vþqâžûÉhD]ÚÔÙ/H—I%{éÿMìÇZ<ÆÚu€Ž³C>Šy 4^?S•ä@|#½q:Ä^;¡|ÚtyŽá Ú á:AÚãç/µË¿ãì•QÖ÷¤3~°ó NG'%³µ_*ß¼$6Hqnºäf¦I¦¡d­z ŽÎ‹û™vàZТB8Ìk÷Ò7Æxi¶VÐW•ðÇð{©¤DlD__Z8¦…„ HûdkåÕ@žû6kËC@ÃîÞÔpÉ#5’Ž/Àã{+$ªxÖ‡€Úù»)jó6þœo&ŸÔö Iv~gé.Å)÷ /w»Ë}1~AM>e(Ô)ò,Ïÿw/É‹Ð+y${*HO”Š¼t©,Ìv‚’)C¦ež—Â6|Ó•WÆ Ð7vRc¢r‰­¼S3B† èHù*é÷’%N‰~ ªÑ&œ¢êy¿Ð;"§‘FQqvSÔÑÚò`CìDp³ÉÏ4K>Žvð¬/ͱ°ªåƒ¸¼#UÝß«žëg[º‰éo—ºœx~­\éØø"PÁ×{PÀ “@&’méŒsxÏiÓ¬‡)„ª…¸IŽázƒ0Í}ØÆÛxŽµŒ‡Ã8è=ºÏò†uGuëOHl…Ǩ¦¥,! »³ûegû ”å¤H>Ž£0…¬é¬ôTDIÁqT« ªÙÀš?0À£ó¨ªýI{LLM:I=FÆÆ‚ßJŒo-)OkPíŸ'æ÷žýuh¬´<¬š¦±ê¹1Ûœ¡/5þ±0äã<Ì ƒ‡çª[ ¥ŠsˆÇ EHR)ž/‘;oœúC×è0ÄX3'žÿ5êÙ«º¿¦ËÉw ÄøjB47·Iâ÷dBܔȧ§&‘,8K–0?Å$?ÊÁ!Rë$s8˜%ôª1#_@Ç´ ©0}ƒc2 3 s=—6x±5!¬V}[G2)A.ÄkòTÇ°ÄuŽRïbZ¶€Ý®´DÂF³d¡£e„Œd§K~vš£ÐPTÍ4ñ̘«¿(Æxd8¶|X%âãHŸÃ¨>5w3vü2ÔÕ±1:™Î†&Èq>-ØJûØ´:yO;>Ñiº©„)'ÀÆG@¸渚W嘙½|†!˜â7Ø£ÙDA»@~ÍÆp«oØ‚]ú4Õå>rËV)'n¨ÙOÀ•5•ÄÈœS#éÿëÉzys¶L¯Jè:kî<ÌããtnÂ/dIŒ—ص÷fʾ’lÙO cØÈBÕ‚×»¯wmÜ3ýÓK)_ì.‚€ªû›YãGë;ä…Ëíò}^Aû ©¦KvÀt&cÞ®s³ ÉþVê<²³Tn µq‰Ú±!úš¯!iVÒ_î|¨o‡úuh¤{É–ødGŸ|çd£<_Ý"Ç™gG‹¦”Χm ˜;Á]…8U0Óïi …½Ö2 YjJÁŒRš‘(;J²ðÈÄw C ³I.Ehj*ø©éÅ™ O}4 kÆ[Ò!øêÀ×M\w¯ì÷šå¬~3ïõ¨F/"í·BMžýJ Èl”F@ÐãÙ ¶¿ç&-t£±òy¨€µÎ½&ÁIŠ'„C7)ÅP%ÏÔÀG¯ªà$@1oû^ç ŸRÍ‹s(3ÀÔ1°†á â㑆îÙV,È«¿™Šzjg¶¶8ê৅N7wÉW‚r[ÿɶ~©a«T:+Rο€Nÿ+¶Fï ¿ýÁòÙ[–K†ÃL'ù‘Jû«-ܤ´]™}¥AÌÒ!xé\¯’lŠ/i%ÆÚÎÿ3¡€«PÑæà .ðŒÈ€H6mîŽsò.l"ª ¬€DSÅ9©¼2È4˜"™„Éf¦Í”V&Üp1Õù¢™ ÂÓ¨߉ÉGz×ÄJ`Ô¯âÓŒ=ÿ2öü+ÄžŸé–H¨J®œÍO7@^&íÏŸA0Ñä<[Ù|¶f%/pŽ@ ¬„Aø$«óûBMM,H>g„ñªCÚkèÞwSL¦‘ðÉlĪyéQâäÌsÂ=Ç™Ž³ê™~ªQ‚Ìa¯ÃÛ¦¥utļ©ç#®Ù ûa´”±½„ëGçZäŸ.¶Jævü?DãšæjãW‡¾¤D¾kk¡ÜYU({™ãŠÜ4N[àœk.²ü/tÞ4¡ÒA´ É0• ‰qÒ³÷æõCô¥˜»<ºÞ5/ÒËÇ“0';‡P K ç”ó(ÊM–ýs›×4:pfÁ”=¹½Hcn¥Š¡:\ªŠž©Ú¦&½ç{÷•cê—o¼S+uôzÒ†t*Šn¢3×MdR7¹E´é´Tä,ᆹ }’ c“'U„nÇ¿¢œè‚^Åhç´8QÕà(3­ÍªFëÌDq¿Þ `°G`èJ ÔÏ u惻ËeŒÈ›8µ=GûwÈ^§9ìÕ"ªŒÀ4‚ëÌß)LÕDyüË™&ÙƒÄóf›7å¡Èt4 .#à&¬‰À°V|Kã××~,g ú?&gÿ[dñ;B$Ë e4ýô´‚µ„Ö^9¡þ›H4ó[$Vz{»jK4¬o=Í:+àU'¨IèFÖÝLù07šµÐaö®:Îþ\uŽÖbdƒI““3¦‚¥ÏŠÌ– 2¸{ü®&ñ¯ëâpwY¶…N Ú\ùÏ·o•{·•HþmM™Í—¿•p·[{û NŸcÊàX[#ËX'k¼ÃZN·<kA/VÏî5í©YQ ± »ù•ùòÐŽbÉÖŒ{Q´ïªŠZÃÒ’óQéc¢H¥s/^h‘wš Ä„îÏ©¿õó¦ñQ©E=Þ†o@7Ùð4ÅóVÌ eHÁê'P’•&ùB7Q¤Ç«öûAœºÔŸAZëÑf\DÒ¿ØÞ+'°‡ƒø;±üÚQgnøg‰g@9«°?Ž—ÿa4"‡·áh™*ÿÅÕ(ƒ²&৘u4úÃÚˆr M°ÆùµÓ µ  ÅJvR¶t?êWU·kH]4¶´ÛpËHJ ó ÑHÇu„D9æO—iqˆ$êq¾lÂQ°‰Ã,€ÉÙMb›Ý\㪠êµJq’Ê%~:•$8n^{%BÊt„+ÿºîÇN+’¼fKBÚ€Yi¡Ÿš)ñ4¹ò_!}¯Ÿ Â8ƒSïüD8¨_u•ænÃ'â=û*HîS ÓUŒÝbk,‡ù¨Bsã$—ÒäPÖüŽ@”³(ˇß|–•%dCHß··Tâ Ñpéh”to^7TM¬¥UßOníï.²~áH4¢.×üöólƳŒ€ÚÈu‡éÀwàu^GH(ô­Ó’C°mÀ6˜‚Hœê…^‚Ù —HM2¤ùëgiDÚL÷’*†»‚¸vÐÅÌÑFð·ã”ÊM•|ÍÄ!¹‘©2S•¯›X÷NÊK«´^¥|´qð«Cc130F•I§Pý:èÇÓ‰|ü7žÚ[&¿uÏ.TêY’©þn'µÃQܲ™Íz—L4 j‘(î©umðÈÊ\z´¾a~|3)KO[Œ¡Hf–÷v˜\û›Ùt½0éJŒUZßIæ:µkÄÀ_¿R-ÕxŽwŽá¸0ÅT‡9u‡Òü#Hß}HÜ>øvýŒ ߇*!ø£ù†@jQ¡)Š[”w/Š‘›ëSœ†ô7ás¥ØÄ•¨z©©g¿ªõï…yIBæ~ ¿€»Ô& „ NiXÜMW&ÍQi{@ã p°M#Ý'­¨ÜëZû$‡R¸|%JúRâ¯iU=¯iˆ,”P³ÃÔ¬j_Õû£Tž„ÀkeÄÞ{ åëàs+ŒÁ¿ëñŽƒÓ]%üÚéÕ­íx®u#)bß·§LÝ· É?Ãɯ° Q÷³ÎkfžB1F‡)Šº^z©C«[O5Âœ8mŸ4ß0>™ÆuÐô šïFìáú®’µ×šÚêÕŽ%f•(O@<t¡Uê°kæÀ%U:äÐqà ¹·Â ´’`ê]b<{-=–{:çp?½¾þé6Uó;] »CÜùByéÐ=8ôznèýÝ ­ð]Õþ[©÷0Nœ÷Í–ïMañbÓ9M¥@PkÒaI»Œ½8&ësl àÍ'.6æÆFŠÄI+ê•æ¦ÊìèšÿÝ«M—ÂŒ4Û”I 6ý!$ëþó­ÒŸT§€•—;DzD”9µŸ¡ósGÎÝköà ÷æ®±Âêí¯µäïFòÁ›·ÉL:Jü纲ÂëEúpO5±Ì0:ŠPî)Ò½³û‹#àÝ]tñ1Eç/¶'¬m^`ª4ó^ÿ%ÙéNƼµ]0²g+½ÖLr‰døäûœpÁ×.·;¶v-(´¾í*ÒzÕŸóîæu€ )CU~;…|~‡?eæR=Lü]ìÔ¬¢¥¦íŠÃp]d÷,{_0¯Áï£_®÷N£0Ú°ÃŽ›j*ãaR#P&ãS&@mô;Iøó›‡wÉû).³ŸÌ†q~ %ƒøçA$ï'}îoÞµCv•@üñéð©T-@ºSê™Ñ Çãb× ¦¨vÉ0 Ñ/ÄÓz+©rýTAO‰Ÿª¿w# ?ˆ3œÖ»¦pÔÒÊjúàõ°·‡a6VxI("ÿ«ÏÃC›ó(ÚT*7 ùØÈ2¾+ìðŠWfN-uþ¬^AÀ€ ›)ÛV 5Ð%A$sµd(U÷ÔéÊOMG“N8ßm¤4Ö”·—Ȭn‘^Bä|±jÐÞ蔕áïð ïÅéO³ªÔì—¦#!Eì¬6CgÍ3¡é1ì6 xc6 i»ÏªˆÃþ¿=#Iʉ¾É#éFø­éˆ4fÿ†ÊBùjñþÑqy³®ÇÀI™öòx!þ:¶’”dùä;ä!ÊùnF‹ã'âï®Eÿ­JwdöîWÌ`£fÖ ì}F8Z.D¥ÈO·‰´°šõÎQoÔœmð}T ÎDp ,O>qï^¹µ"—¼–i1åâmÇÁ¼• ½yöÀ&yú†Íÿ ßipÜe¢é’Õÿϳs-}wµ÷°#` @Ø!¶¬-"W‚ ‡ w~”CñQ&@ÖçÊ3û7É£TœÑ”ëîì±æxü'ÉÍ8n>¹¿\Šaà4iŽ›ÎÎÌŽ©þý8»þ“™ü;·¾™FÅi=­ú M™œBRúÞCE¼Á‘19CÁ‹øhΞY#³`˜±ûï-H—ÃT÷»"?^Ëܸ\ljÚÀdÓÃ\a°ñÐ-w„vœ_0`ÃfÖƒ܆as!Çñ_!!€¹äZŸ‘†¯s¼O~RGÇ]%¹¢Ä¥?€¿}­Z‚cq d©«ÛB)ÿc{Ë噫D+æùmî&‘øµ~Bå›6tÊÛ-ÝÔl`2vÓøäAôù0ŒðùûaxqdYËÅ K‰ˆwDà5C¯LÀNbåžñ_ öËwÏ7I¿Všñ€S`&ªþ_½©JØUî8ýù)rCíüʘ5õÈ‹çZä§WÚä‡uÒ­•õG¿q:k^ÉvhEÀ€hë×É8Âeà§Icb­¥$$Hen†|è¦ÍrŠê—ºdˆðÀ¨eŠSaPîÝ”/’×`[Q–ÿîySi\ë©ù$œQ"c`ì–ÓÍò25ŽÕåR÷´RËÁñ4âë¯#±·£®#x+º‚µ•"À†ŽÄŸ†œ ¤õêJ¯ãÝã•ž¤%'È› ä!Jæ&#yéè‡ØD'Z ¯S̓Äúo'ÃaUòÂÑ\)¼c`XºF¼V3ÔuRÔGždÖÍzµInØÍ}êaÀ. êår›|ïb»4Á 8ÕÿœôÍ ÞžóµCn®Ãe^Á€ee‡Eo¦2¼ç­D¦/‘º«æ™/ÉJ—§Vʘ:ö É°& rꣅ`×F1‘KžÿÅ9ò¶ÿ\¢6aˆ'ˆ.—Ö¾ay Büæ•viè’!|%Šq}ïÁMò0¦-´´VÓƒj´ re—ßBÕÿ£3òêþ³0ãŒwZ9ž0Œ1Rk-:îkÀF̓1…´‰+Gš}@i\FbÀI³§›mŒ6M3{Û–"éBâl¡ìï÷È8êTŒžÍ2žxÍ{J³åƒ·TÉÖ‚¬°„ü©í½¶³_^»Ô*ÿJÊä·êƒÒ7:AYå |Kä8¿gSsàîí%dL]•ÒHÍ z¯Ö¾!9×Ò#ÿvª^¾_Ý*íƒ#2Ê÷zÕy †è™‡}DlØ«@À€U€f§l*\Á8ÍHÿñŽ9`ƒîu·QÖGkܼ¥X‘t¶õHC†: E¶¿Ê¨MOÉÞü,9¼­„2Ç¥Tø›G×¥JO7uÉ?¾^-Gjƒr¾kPº¯J—<†ÄÞÄ÷§ºd3¦€|2G®TBŸ‚ø«_™ŒWÑ.¼Yß!u„b6NŠþæØ¡tB¬GÀO ¯»?»×jñŸx¤ÿp:w­G%JT±£En´oᦠzý¢¬Ù_ž'£ øæéP‡À(PA+÷n)ƒ•ùR†<ÿ#0=݃òCÆüò¥6¹à˜Aˆ¹»&±P@ÆÁ¤®«ß!â³KhYÓ«êþTýÝ8÷µËÏø!ý‡Ñš&ÜIvhÿ5S¦À½QÌÅ5ý³/ E0``ìëè@@‰^"ÄÕ!°Q°¹ªjx•s^ßjVF G7Má«iŠÕa/œŒ@ ‘›lïßY"ÏcÿÖª.ñ‰Ð”iªæü´TŠRÕ0ÕÿúJÿŠq×਼Ôÿ壵RÓÓ?3ækˆÿ š-¡¢­ÎJ›—š=ddlB:¹Ç…Öù Æ?¡ò¯öɸþ¨v¨…qƒ$Ög ê$?B˜f”úgÒYk†À|Œ˜ÇÿÏÞ{É•œg‚{S]í½·ðƒÁã-Gôö(iw/’î¸R(BÚå­(éncwGjcWKñ¨cpV» Šw䎎šÑÐ 9†ã€Æ`h öÞ{ïîû²:{ªÝèr¯ªÞëL ú½ªz/_æ—Yùÿù[ëÞ©•ÈºêY3XráÿVë¸çb ÿ’ Bü: ÁÞ„xøý®aèá—¥.=UŽ tï!¸¾‡œ ‹Øf«†D~°®HÆõÔ­ni1·@Œ‘ ÿÓhÏÑŠ\)F¦Pòiœà Ì4÷È÷N×Cí1â¿26úMá†%|Ý ï€á)èë±s'c¶Qáx.€{b⥠óÿòj›¼ß2 W@ø'qߢ·‘åÏJ£¡Â6ÃÞ¡LYÔ@E1MÉP(AبñNþl¬ÜÝHömã_F$[džmX‡I©"§VQÔuÏÛì-ÅÐ/Hüã{òtÌSÐ{3×]s߸œnü´6ùäÞùý“;¥Io¸[·¢¹ÈÓñ›´366)­“ýÊ>ìD‡ 5]:ÔŸ>T"è㣨fȺÍ;gowËO.¶Ê¥®0\¨z‹y€=¸ @J3 Oé¹y?b==&ñïƒçÀµî!yñjŒ*{¤^ô®PÁ|6{Æ<ô=ýÜ[%_€ÇÁÉêÉ„÷Á?S/—;Gd×lv{È€1B€€5+Tæ¸* WëÿªÅžf€ž8Dla%Á…ØÿlS¿Ü˜Páy…^ ø| cpžñù9u£K A žÚ[¦¢ø%†ÐÝ@ÆD8€$;‡ âîˈ  \ÒÂ5ÏHQñ¬RXÛ?ÉÇ®‚ qAýÊÂä:ÝÐõ_€ÛÝ`¸©‡çs·x ¾Ÿã0 †.|œ=Z£Æª›«ƒr»þ+¨÷ÃŽaiB8_JÖn5ßV¸ ´…ýeœýy.¹¶í(–½¥9ÊÝÌ!ÝTUã8¼×”0àœß·…öë÷ãÍ »!À…ºU,æjMåŸ5+ôÝî íw ƒÐ)Ÿ‡Ž¸¾ø‰Ú´B ç°ó;½±—ZUò"7ˆcYŽ—®‘6‰±òki¶4ø_…•º²á3¶¬ ]/³s²2O%/¢!`(Ë<Æývß(Üð†å ¢íù*áà,™óx)¢Ž÷ül¢~Žá ìú_Æ®ÿmØ\3·â­ÆS1¼Ò«¬sâ]çN–]ˆlx ÏýµÊ##A8¾ŒI@æB•uUxÕfN Q…€a¢j8LcÖ"àÙíÑÚ^1k¿ ë»9‰ˆŒ»p†–÷,« þÊŠB0Ï>€¨ú'`@VäKÇj°3F#uChÿà.ÏS¢ëŸÃ p Õ´ÃòâœW¿Š\·œ€ÝC2vÆ¡.³Àùæ^i‘%‡»…ï -ú—ÐÆ%0e´ŸYPüÎÀvã'PãÔCm3 ‰ÇHIrxÔã©Î=€%³2•ñ§¡Þyzw‰ì„¡#³5Ò;%P³%¦¬@À0V jê XÄað5BÀÝÜê+DµûS͈E/‚Â,Á<Dey3]7™á—°»¤÷B]~¦Ü[0Æ¡'Üy–d§É!ˆ£?†0Á?¹Þ-ÓKŠ¤ùÓ5ÿ¯¡¤üx^º²ü¯Ês‡<Þ?%îã´\‚x¾F€þRZnæY=6Z›ûä0dçÛå*$4ã° £¶©4 _Åb cbå vüÇ`Üø Da<‚”Æ mLõ‹RÿÂÜaÇŸ¹ÛR ÿGt¹Ä\]¦N8R…qå˳Ýr´,K–aØ5=O*J³~à Â<6ßÀ.óÕúÙ]}Ž+Î_æSW (C»úöUºN‡`¯AaïçÃØ 0IÓz|jü].Z“E#¾FdØäîß÷Í¿Æî¿Ô3, ïß–›št¹kTz§æd„u±l´u'S€9FÆm0ýÔžb9Q•/uHË\”éB6ÊCø=虿AÀ0H§vƒ$ÄߣˆÀ|ÄÝ_>Œ0·)r©sXÎNÊv“ËÊ-íNF ƒ¾ë0`ûØ0N³ZQè¸Äx<>¡SnhÜ[Q0¬¹ %Ò ©†ÀŠM‹øP0„× DùþŠÿ¯c·ßÉˈ 8O=?ËF¸ðã<Œ:wBÔ¿ã|tü'j‘ÐÆ 'ìSNÕéÉ‹ðWpøŸUÞÏ(èžaÂ5J䮇9ä9Xh¿MŸlꃵ@$–Vî´Kàëý™£ÕR].%Ð%Ï\í”[0RF™ERï… spßÓâ¼8Ëe@?÷ Þã´Æþ ¸²Øy·%”Óó8>&N*s\RÑÜ­‡3áϬõç`¸·¬%?¾þ†8A0_ÚÇfÔ‹R$Eø‰Éuðòt0gHt?¢2“áC;‹¡ç÷$òi¾)¼ñ‡õoòœPƒ³ëR`:»‹QÒ;ÃDÉ@˜flŒ¸†á^7…õðjqõiEÞ¸¾`>¥Ô8;ù£Hu›©‚ñüþé/\k—¶Ñie«°Àjñ2N'a˜wúV,Æó°“L¶d_ÈŒ{ÔMS pª¡Wz!:÷Ïì;2ɱËòDãT=$mdÇ÷Ú6¾r†Ÿ£Ø½/!²žßc¾B?TD>uŽ# ÞóŸS“Æ.ו(Ÿ†qß'÷—Ë.ˆû á¡ÊÇ ÆfãÞšO ‘AÀ0‘ÁÝ<Õæe :÷i#]HC˜™ùæ݃Ó.à¢à½‹`5¯Ü솛à(6Ÿ .dð§ïu )‚2ì¥&&XÒªöC¿»(Sú¡ëngt@K41’&è é†èMSCÙ1Zñ3½ï¹«ÖL•¿Ñ ÔGTÅúbÀìÍM“Øñ?±·TŽU¨$üñ© ü}®¹Þ ` `ƒAÚ¶M䢛ñ÷§ NŸÀ;¨K$qáîÄ‚9çï…G@aZ’솾øm¤é}0^›@ y£õâ¼mÆ@˜SÀhZÊö³=Y°8ŒDAý°9hÇ3UPúP> }¡ë[\àʳÓÅ ©ƒU…tš<2t…~À© ŒË#°ì?)Æ.ØNÔdb×ïòMϺ֘š GÀ0Ó€»#’Mà8ÄÚSp銶Bñ;w”TC- â¸Æ 1á[¼¦íáïD†9Æ´'¡±„0ôÅW`ýþ*\Þí$ECRPU"ªªÌv!qŠe¡ŽÙVº|Òð3(ÀjóÄÌ…º¢ŒÚ!ÿO¬”{*ò”ÞŸöÁõ°à«15ˆ€a¶YFzb`¦i¥U¸"!¢g7hƒi%NküGw—‚çÊ¥¶~9·¼_Üè”^DêëB¨ÙÁÉiÜɉ`M؆½\ïTW‚L!øÂ+Ts•¥@p¨8S2 þðÉ2~¬|ùˆí^„!ß2Ü=b 1ãebœÓþ/ÖýÙ üObÇÿ0Ô54ð+#f??Ž—2@ð¥§æš; „¦„Äf<ÄÇõ+\ͱÍs¸–Bt;„]4¥Ñ\¸Ñ¦Z ñ²]¥ØiæÉ{Jåe¤–MÁîsŽ °j*P @«ü0d{¨8[^‚ Å¡{ žŒ~ìDœd?¢ò2fĉ•`|ãÏ&}`Þ’FåS°êÿô¡JÙ‹~ÚaXƼ(Ž ¶jQµã‹Á.lCl€pAÍEÌ”€àp€1ê–@F÷ ABL‚ÏØ.Ì †üÌÜ’äàH••…á‹3Ó”Kàé¦>Of»PÌ={¬Ä#áO \C÷ÿNL úÑÄ”_ЇGK2åI$eztW1âd(£M2ha)´7,í²ÃC va%Ä jó @àz045¯T´·xóh3︻LŠÊ3Jr`ÀˆÂÖÒþÕççÂaga¦ÊÎ7 © 'CÁ4qן…ä7¹°wuÚßÕÆ{ú ñ{,Äþ;Æ÷ˆûWäKhôü^3§ `€° ¢ak†” jFF`DGW@î¬#· è­H–³Y£²¡¯QúòàÏ>;€ ¦€ñÊIL” 0¨ôÕÒB³½µÒ?ÚK)¡Èv%«L–‰ûí½k=æKƒ€uÀ:l×ÕlñŠ¹îiÎyëqüë†ààÔ4RºÎª˜ìk‰ƒszŠžPýP]÷}0leòÓAb›À îPñ5bâ§%À•1 ⌵Öý~Ø%H6¸€-£-Œá!¹üË9ãù§Hñ£u·ã‹KØhqLõNDÀ0áUo}f¸žéçРzYøFÆge¯üt—ñ:¤{!ïm裸4[~†¼÷㌃ìüƒ5~f2ìÒ!þ·zûDÈ_PŒ¯È¨¢éøÃ7<_É †ö<‚€DcÅÜ28!­Œ} ²4ò¢à»¬*ñç1æ£ÕÑÓn7×€a¸y^@Ð%ŒtúƧeg°Ä, Ø릤8&/ÊDIÄ(ö&EMïGZbœ² ƒauá‘oÍ“ …@b)… b?ò샄ã0B,¿o‡qD>l£›%Š¡½Ì_ƒÀ` €Ì×Q‚v}Œ@zšrw®¸¡‡Ý –ñ3²€ôÄÁZ!ºÀШ1 ô_©uÐSHøcT?Æí?Rš#Oî*’“ÈÖWl„ ˆ³JËPº‹¬1ò7óäî³Ä|»Ýp äšÍBô ¬YŒ‚“eé‡`ãÀ˜, Bœ)wG€Ä³1î%üÜØ”4Îqw¬ êÝïÝð[üº˜uª…püÐøk&ãÅ$léóRâUÈÞß:R)#éQù¤Â&a™©çWº~üÍço-¿7ý\}ÜIóá–Dbì¶lÔêãããS«ol~âù¿idŠSEèCB †¾1Ø,õ¿áEÛNPÈ~ÓÞ=,Èß½À»ƒ éCïJ€i+·¸€ô#S_œ$€áøB÷>²£XNâU?3ÆjõSGIA“LÙ¸PœÒMÇ0‹‹‹ÑÍ6rÑ4ºëÀ7ÀoÆl-ØÍÃ%0Auh$fÊæP Pã–|¨B!·g} ŸŽÂÝôüöÐ.©AŸ$Z*ÎòdS ÿPç©šŠîU( ~™›î@À1 cìJ¢Z.\•+ƒpÇÓL€Z(ÌjqÇOk³°êO`·×#À~{U妛à.›aµò9ýßµ/ qðƒÚý³>,y¬€Â±ú1ÖC˜—wªä"ñ#*nZ¼FÞç›ÞÚ/±pj©1[2û£Ç]!´Ïpvm˜QœT€®L½ ‚6E`–Y3Ã@` B!ªõéÒ éŸœ—!,#0Èê†ëRU¹…f Bôl9õeËÏ õ‹„q‰f”Ç0¦·séª<Æç{h§¿+Xe©Ì³—‡ßrfb,l= ñI‹êÎÄÆÒÅÅ1+(¸ð¨–üù—aˆ¯»a±|»kH>DÎø+ƒS2f`î£K123ÇÌ,K~Ë0úš—+ƒò±ýå’-É–0ö×À”N1[%W!ƒÏGãFNY1r1R Â_oŽ=¹i²AªÊá¡’G ~K`TSaÜ™#SëM}Ô¼@Î`pC˜@çç=Žaï4zK&6_®”$LxÄUGƶœt©,š’ò·tDÆ¢{dZºÆfäÖèŒ4ÀÚ}ZïbT‹a?qíEZaÑÞ3:%åÙî°0\ϧ¡²¹Ð> ¤8=#²£(GJñ|ÆÛÿÈ_= øùìÌÔ$)¢Ñ¤Ÿ÷®¿Ü³– Cá46óPãõb.^…§ÅœŠP¸Ý±Aÿ1’‡ WtWVª”!4u˜Pþ^ŠŸ¢Aªr±¦¥&+ÂåÌ´o¡ˆji³w[·:w €m¨#E›)àv“™*’Åò%™€e{ïИt@¿ÝŠWÔ;†`ð×·!ènû¡*è…aUpn5ƒÂù=Zzôb7ÞØ;*5XD²ð%\erv^þßsòòÍn9^•/ì.‘êŠ% [2°hݹd {_AF*Ü&ƒ@Š»8¼ŒëåGrÅEpªvHñÎw Ë)_0Tµ½ÎÈ ŽÙLG/9pAÍÅn¿Œç®²l©…Ô¬¿×l„ñ&ѧôŒ·y¤öꮓZë ..Î6 €ž@\PYÈýfÀÚ9 º¯ª’<9>¿ côHcç4vH}÷¨4B20F`»Ž¼¦¡"°Û£{ä£< Éȇ­²>î5H{Ž5—Ä=+-E–bãäæФ4·É«·zäþª6ùì¡J9Tž'åèÐM.\†r¾ I½k6$…Øyů^qýRX“þçË“Ãx ûãýâ£ê£m^ÄŽÿz× ÔƒYï†}…‡úW‹M¯FW©ÏÏÄï!s> ¯ýŠÌd9€ü ;Js¥²lèôÓñ»Q¶3ô jw&Ò¨¢oÎ.G» `+ÈÈ ÄÓ¯„&!>^R’•Í@]EL!Þ‚OuôỆà*,ŽÏÁ"éO<‹:ŠÃÊÇgEª"ð@òt®õçËäL¸ MÁÇ–Úäc75T½ŒF8;„_ßì‚Ø°D\ú£È;ÿÄÞ2ø¬gF+€q#|/SãÆÂ@ Åð»xO)«ö»q¼Á›úëÆêc@útÓ,ÜRÏ!ÁåÎaYÄ|€.ȧûì{D\ýØïØÃÉM•ÃÔTf¼n›¹Ðégb3“”˜ $bñ`:ã°¦9©@Ž¦T[ÁÇ4|QM–’ #™e,S‚ (‡¿zèNd@k†A\ÃÀ‰¸‘d@IDAT„4NÌÉ-PFOúS½ nõ${~OKöÎ0DÊfbRªó,ßu'`ç’…€:q`$ÉuÐ* 36UM/Ú41=+÷Ö¢M™J5ŠñÃ¥+|v lOÒa{âÆ‚M5†âýjæ&%UÑ¿”sîûÕ¹€Æ†ù( ¥£î¿q‘aƒÒ¯Ô„ðÜÄ4Ò€3  °AÙŸ•";à¦WŒøyP+@Ÿ_å–Lò¥aŽQµ™¨ÒE‡§yæ)Á!à€“€õCJF ?.¾ s3evn^Æi3@ˆ Ë:¥LÀdD뛚—NH ‘=oØc0€ê¸(:§Ð}™›ÐÿØ}W (PD‘Vªi¸‹N"A‡Þw™Ø’S[Yøœ¨Æ`§zFåÓÐ<µ§¢Ð<©Ìuƒø&¢}á  ³Ið±NC2>¹ö«Q öÙ%jWÅ 0àÍø-êy`h<ã AÄû1R9“ßü,Ìû<$bª-tK]I®p#B#¾ èô“1¿´:Óþýß^=p í€B9­ÈaçdÄ#À‹K¨"x»ÎQ¨ºA`©~¥µ_ÚàMгb@Ø öQ¬ü$œÀ,ËÚ¬†nypG‰åÞ‰`Âò±ã)IO–A¸}3ð”7-¤úLÍÎÉ WÚäíæ>Ùû„߀JàI¼ŠTÛȸ8Ñ.! y)Œ›A´ü ™å„¹Ê_Ÿ‡‡$åÒ ³MÕ=‹gÇ`“‰>€˜g`¾dBZT ‚¿§8úü)†_vúÙØé“ V -˜AþíÆÂÀû—oÏa_iµc %²Û¢x~pðÉÑ¡t€»S7v§Ey™²¿®Dž€hr*Ƹfས~¹5ke²™üwúJÏ.pÙtG¿/É™iî—ÿn\% –ê݉sŒ4÷@ÚÐ "J°‘@œhÒ.£öýM½r±{H~u£C>³¯\Ž#þÃNXC3©N8M.ÖTE€àÎŽ±Ö0/hïÝ {¥_w¿2²ß²,º­ú½çÓPýCÝ:8&/Þì”.ÎEû­yV¨Ú|g=PéàCˆ}&cÖ’=îD9Z–#;aÏÂ~tú4â£Réò1 ÿëܽ³Ý‘ÿÄDŒüx·@ýòœ¬ðîìFç´ª¥…7¤4¾a0t0t»©5îñ]%j§Ò=4!·±ì|רܘF(b*„pÈn뀘ƒ·Ä ì!®´÷KU~†¥ Yþ$ÑíÅ®¾¾µOnCÜ7Ìí xÒ¨e.Âp3ffNZ /ÞW‘'Gª ¤†‚”*„£°í ­› 5ÀjÓ@Æ…“qñÝ'eäà÷Ý>ß0ûkþžæT,o£Ÿís-¼ÍEvÙw½G+s¥I— ¡Ó/„>??;]Üð¡.?%9 s>^e^Œ`kÍ£-DÀî€ÕŸ¼,„É^U“à‹!5)¶cÐ ªGa0W4"µù·¥^¸v àÐ9¯ Ù1ê ì$Ôïa1~xO™Ê `¥ ‰è0ùØIÇÀ8juòm6=@-)–êšœ•.Ha.õŽÉ.XŒàý0,¢›™Šx`ÚH¤­, ع¹±¨{,¶lùÚ¦¬^nu+×>Ö¯w«môë.¿/fàŸn0g{dv(*üHTsEu1FJÁÌž(ÉÇ”a·Ÿ©vúYÐç»È$b®˜²=°;°:JÛY° Â'ÔѹàEÀ„Tìª*’cØÁôA„ÙÑ7¬TÃÚåC®&&Ú ž¨ü}›Ä‚üã/AÝ‘Å‹DΪâa² M—TòI`¦Ü¢¶zàÊNŸÆ™=° 8)Ìc+üø®b9µÀHÒVõª[UØ÷TaБá|WX5Ûú. ‘ôç&üþ_C ˆi¥J‰b¦h³ÑÂï¦"mʃ‡ë˜Ç“.Úcä¹ÙMæs'"`'Žêº>y6(ƒDp÷ÌI@_Ý Xóî¨(„;ݤ 6 J#Dê±uDë[tŒ†íð€xóz‡ä!Âõ—V-É”.#¸É‘Ê|i„À+ ‹~l––Ù^4nê€_ÖwÊÛP Tç5Ëç÷•ÉÓ*¥ u3í-‰t¨û@æ%ÖÜVJH¢uš„ª] 8oé•· ûï†4m‰.r6, øÍäÁ(´¶,Wé÷ÍŽß¿A4F€þáeÕÕk„~Fà;Ì$0±p›ã®0–í»K³äÝî1i¤Åbý©ï­ôýʉÅy½¡SÀ©$ñÅ!5Õ­I‚ÑÔÑÊåóÿfû LðÒ߇Ñq 8OÃ}l¢s^°«lÀ®ò¾ÚB9„`B;‹²*´j~Í\ø¯°æOM¿4ÑvÔí[³,„¬‘KØí÷ŽMÊ»6½Lžs|LŒ5Ï Y£7ªLË>„è­„?ôý\Lñcè^a¹Ú0þÃLõ] +Å+'¹SbÇí)¦à:üïo€ˆV!³õYµÓ%fe°Ž>ˆègáõ*"ÁyˆÁ]ð'ÐŒ±*¨‡úã X”€@B­ˆ-Àœò=p+ëÃîr'’ Ñ0‹FX¡`fˆG2"LÚtÓzp=ü—ÂHἂµ¦Íúx׶þrª¦«`øn æÆmØÌ„¨Ú­ê+0ï(þ/G| Æä·{XÞPóÝêsŒ bÛþ é¸(ËÏ’‚Ô)‚z SØ JŠÖ˜®nwùNB€Tø3[QHhpr—?½¿B1m*¸Î&O[¡L) À4œ%#€ö®28grÑ>þäF·¼Ó6(» Zøâ‘yhg‰Š¸æ‚‘ =‚)\è)½PÊŠ ü)œQ:%‘/S÷I·UõçY÷Æç•«íï™Ó—›¨ÅäîÝ›™‚T¼JüO†Ö”í‹€5«d𜟟ÑÏ=à#™ä¦^»‹2TâÎAº·Ù J4w ÌËëЩ§AÏ}´*Ovf«XäVA[ŒÀ>Ÿ9\£°)ù‡woK#vï*ʾ÷‚ŠvQJœ†ádq–0vüùž1.xMæ8\³Œöã =È)?Ø2 × Ñ¸ïj›<º³ªb¤‹Î‘0q¨ßû¾ö @ŠYóÙF¾|} ÅבèÏ66!Äp³*ß8Œ7ßoê–ŸÂn£u|–qº-î5ÕsØÝÁ H°ªKóT0kždjµ Žaì˜ 0& w©Ð™ïEz[º¾8Œ06wÚ®`‡= 1ú¥ÖAùÅ…)}Ì-´n¶¨Ð¨Žn|¿óà>q'%Ék×Ûä—P FìGž ˜ÐåÿË{kåsØÑ“x¾ÛÔ#Ï¾× áE0Ki ¿7á¢4c÷1 ôë|Ð1$ÅZå‹ûËåÈ:XŒƒLîãoá83#›z–¦â2þ>;Ô×3 _+ÿ{ÐÇÿÃMòtò# Èc>{ŽLrNüðû˜ÄO¿ `iÇ’Š¹v‚ý”æ¦!FHºÊÌgÇ~DºÍÆ0Ò#°ÁóM€ @ññ#FŠ+/Ȇ^pXªãû¤kÜ‘ªõDú2ÒµNˆãé£ý$,ëws×l¦£ÙÏž>P.%«î.È“ ©a©ß/rvŸ‚…?íH7Œ'د_k0$ç‘ZX1\*”𠂸nÿ&ÀˆMÀes¹2¡@˜F̃å¹R#Aª9\Èé+-"É¢øßs½æü±H“=îú{aq½’¶~9G—ʶœ™UYŽ’llAl2.Áòÿ ž7ËðϪ†ß²øëqãw¾/ß`?iÊ5ØèÿƒÜ†›¥w€Àá¥W@>v–Å° ß™–(# 2f» è?¨[ô³g‘áì Æ4)Áe©¡ãìïA´Å\ÄH/Å®*^e½#J\^‚óëŠa0˜”Å j€ê`p™ëNQéžÓqŒmî…ã¸ôÛÀÃtÌjJ‹qaaèÙ×°Ë}¯w\ÓpÙFtGfÌ„zÒˆ-u¹¨JÙ{«*5ÓR¹ËÏõdj"QHøgà¢Ú5 Çõgåÿ5¸*‰qZÓ¶3ø¶ò™õH¶õÜþn!êß‚¯ÜV$@Úò™Ë’†yR[èIⓤMÉ–3Øë¶Gaî¾ñp Ä(/È’û«råæån[€®Ón…DDj Úž=w[jÏœ®oVª4D$êÌx.‚cØ©³)‰¹óùJô¾r!w]Ùˆ$øÉ#Õr´º@žÀnöùn˯ovËÚ=b§x/o‚†{–Q×ÄÜ¿ºÙ%ïƒxéz»|þp•<¸³TÊ¡ÓMƒÁçxߦÛÆ#?Ya(ü¦ÁÓRï¦ø|ÎÇ΂Ó;âŸ_]m•¼Ò®¼$€ÓªÈ£ömô™ÏOaÄ¿›]Ãr ñ%ž¿Þéñôðãþh»”Ì_N"Y–$†²[2ŒÑÖÓKp ` :Û¨Rª2øèŽbùY}¯4ÏÒ(Íf¶jÑ÷èÐ/@ ð³ MÊð¡Ýeêhåp’°ÇBŒO£Ê¸î©ª»AæâKæ ò 9 GÁƒ 4¯‚À½Bò ,ÐXOlV†¾ÑxzFx¶õ½£rðr›<ˆøî.…¤!O%ýaý=×Ó¨ÿ‚±¢’¶+ðï6 &‘Yñ ²=¾t¥EÎ6õÉ­þQ_òÌJôѪÂ~#™Óÿs¶^N!ãß8lK”­†U C½EØñÈuIŒc™Â׃p °lTÁOhJ*¡_>R&= 2mʱ"È­TðÍò¿‡ 8}«K ÝÉŠÐV!Ü.uöá(¾Ò&úæÓ]‘ŒÀS0ò«ÍO—‡À¸¼¢ó"Þ4C ³2õZi9ÞrDf‘»¡ß_„oú8<Zz†å¾ErŒS i„wá=J„o“ᤅ#œÿï݈¾×/M0P§¥7Þ áù$ÕHûŸA¸æ¦aØhø: !lCH«Bû a/r x†‡5Pç`,©Pâ^\L©¹2NðÔæÿß02 Á÷ŽMÉ+`„:Ñ/U ¥²ºLƒøÓ&ãiÖÃÓ`lÎË«Ãê‡[T?ãbæ"ó_-ÄÿÌ bBÿ´1 ?Kî6€àa¥À…è`j‹¤ôf¯Ô#Tí8e±v,$– "gÛ‡dBn!ÜqŽ(ËC0œèõᦽ@ ² –b¿  ¿¼·Û=ò>\ÇÀÌaׯFÛX‘jÌ, )¬âÏ"å0cGÊáÁû`êa E5Žã+.@¨c‹û=ÿô½V=~ÔSV%7~´W!Åë}¿‡Æ†Cãòz}»<uÌ8Ô ŽÑ÷:¬FÅÿú±ûGö?w‚TAÕ”Œ9fŠA@#àYqÔCÜ‘©ikËóå@±[z'§åÌÄÐaÒû×òõwcцN¾;dZŒÿàôuùWO‘rì´½òÖßé÷´% ëâ>$j©ÈK‡‹á(˜€nù1üЯtBÜB¯œÑÀ߬)Ø/.ÇÊ"v¬L2tFs¿@àšÏí/“ÇaAwÅ9æ- #°þÞ5mö&üD0&Œ±öéÑ —¿Ó þßÃ\Bä?Õcofk3h¢ùs0O»Ó“•T¨0'CŒø?šG+ìms väú@†ÎHK•c;J¤gt À zÃ/+ å">Kò_C¤[·¹!|ï.ì„¢½P-•@JI<§ÉþÒlyùr«¼ ‰À™îYbภ®Ñi¬v"±Ÿ„ÑÜß–Ë0,,T!즨G¤HÚ¨W ÷Gñ=ä‰F`è÷óóÀ¸EšéÑÃdÄ)EYOc¤6Û%jŠ<™ÿìÎÐDºvoŽc£ÝTL€Åp B…Ö€pì‘«Ó‹+"äÐ=#l5aÁ£[]3ŒÈ^C,÷<øÍ3[`1‚¡D{ ’J’14LÆî­RC—w¡¿ˆuóJ:ƒ+WÅ三‹<ú<iÁØÌ,H~ߘd£ß*{¡?à£UH%ùŸGµ7ŽRâ¸Ò< | ðò)0ˆç¡ñí*8Ó4TGv·úç˜1lô!èþ+ù¯ 6!ñ6 a̾˜b †°W[ת\ó2¥‘íöd À%pqhˆÆåÒžŠ ùDéÙ®DI€šƒúq†ÔR2¶dñÑ€ñÞšb©QÙs$VÝ£jÐPn „~žºýõá{¨AF`Ø6‚Xù4dÎ;®[ó´ Þ¬ {xmVÚ¡æ·0Ôo'ôþÏؤ\ [IRIV·³¶ùÙ1Ö»³ßQ#s³ÒÁÓ¬Ÿ ¶éLT5ÔxDÕpxclB7($8.œÝjóÈØ´œl„[Ý‚l–aD÷‚Jè2‚š('¡æpag­¬äCŸe5qcŸ€C÷ÂHs'B 3àKYSбõ$ˆ¥¢{ë×ùF`ÙoÊïÝ•ñ¿’xçDAsëÁø¨½ öÓŒ¨ÿãÝ›ò“KÍp«´&ŸÀGO ß{ ƒ×ûj d"Q2߇]æyøP ìIÆ 0Ü,½ “Û¾ŠjK‘ ¬rº •çªÌuǺd´{^zh½º°VoDïBŸÆ ;ÿqÝÿÓ+å?$&ÂåVò`vìRTÀ!,ì9pk|lo9Âç 6þ ¼«õga#0†MeûåN?T…ÔCOÚoÇÁÀìáãÿ¥ËÍòßÏÞ>HHÔ²9¿°Q5QûYvûÒ‘¶º2_ýŽÍî?j‡*¢ sŒ ¢(:ðá\S°k(€åðýu…R?]ò¼ ïtlbßzXÉÿüü-¨Î—e/,îÝð¶ÓÚ϶Òm° ^ nó!¨ËuË«P ÜÀ®–s”-@¨Ä¾ÞàèÍõzlmòž;ÿòÆÕyxõÁ≣ïÝG›ôeãfÆH æĵy*ºgç6ÅG¦Ö!àÀ®Ù¼¥ÑP&všûª ¥º¾[Úy®Ÿu¶&1j§×‹Eÿ¹‹-*.?ݹ“Nm€Ý–I†ÎGÀŸì´ÉA! à- ®4œB»àDÿ+ieØ#2ôþ>T_¯^¿…MöŒLȯ‘Ká%…¾ j>sà7¸ÞëV{œ¢)x•ºärMä °”qý³ÇÐE¢•Žaæç¡¿3%ä¤!0Pmy!âdJ ¢ÒõOÒœÎþ+å"vD-óúý37‘ç}Jþù{,(Ùar­¯9ª`éý/àÝp2¾ µÍÞ¿-7á28û K0˜] í øZHÈâ~:Í6¹;ÿ>Mþ9"þ¯·®K# ²?¡T—X É–ÕCÿ“¹P––$uåâ^zËûÍ["€Ífõk[>ÎÒ ÃXŠÒ6®<R7tä5` [±[š£c:'”EˆÇo#øË?Á¬çþ7 Ú©”Ø `n¼ö"âa9;‚þ÷Ç0p{9.öËÇ-àŽP*& Ü#Oj¾ Eß´)ž¶zßÇ( ]CˆÑ&ß~óª´C  f±R‘ø[ÿ¦ŽŠ/f1N³üLÏÎÊ"]M )°r ¨ŽaŒ ¤s|µ²E,$HoÛŠÄ,ýÌŠæâ¯;Èqâç¿×Ø#?8uU~óÄ.•/ "u»b^ƒåy’ ýïa:¾‘÷¯vlì.èKGISqH%yÒwÆJ¸µÈ›×ZåÅ+­ þ“¿/ý¶Ý5Ë2Šþ¶ÍÉU¸½fº]’jll7Šáj°c€p¶Ýž3«ùî¾aiè“.XJÛŠø2X Œœ×ÿï_"%/õèô ?€pÈÙ8·«ñ ŸFœ;!ј†z¬}hBâ¯ð“M®L+€6¹ Z>^!ül³ 6 „ò+°ögjß·»†=s8`IH´tróvÌs>OÍɈY‡yœ•‘æa6¿Å|³Mp `$¡ŸÁtùCªÙ+]r^íJœh§= ˜€0ôk v†Ïœi€žxZ¦A8NÖ–DmA{¦vÀñÐqó¥üø@-Œ2°’Ž(Ð*Âv_,,9&‘¡ ™ýÞ„ôãïßmNùaq0ñ÷tP¤Ñ _k’cý0tIyQžÄ(u‡¾ÂE´&ˆ_Q Oµæ>Ç0Æ0´„»½ÉÉiï’W.µI3Îù™“ˈd? ýÞïtË¿ytF>v¨ ©y“…úu;flê‘óˆ}0¿€DdÀ@ ÃjhCAü©© › ùx§¥OgæijlÞÿ€›)hCÈ3×;Uèë|¸ó¦À>Ä®­@¸é#M  M¡‰È'KÁ{=ˆ{å*t§—§d¶Žçõv‡ tcßz傲j¥ì@ä=ZÚÛ©Ðj»Þ†î!ùq?ˆ_ -Ÿh4DþÁÇ¡Ì»Eì€oôJ+$LõQ›?:ó¯1ö»z¿ÙÓH‡]”•*;* ¤ª,ßä°ß0ZÚb§H– tó„„c†m݃r‰gº‘ ` ñ6*sX<¯ Ϋµ£ªH@ö”çJF íì„Êo?8&ÝcÒ F`9˜†sø1l3 ÐÐH£ÖΫ§Wò2Ý’‹ùšï˜åßJèî¨Û¨î€$ò$$$YuÃ0øöžAy«¾Kn![žÓÂþ ÏG·Ã—¾„u*«ýcòÙ–~ybO¹©)’’,„^…ˆ5Rjf»kF:à×óþl8诈?ÁÜWØ„3ÛŒW°m¦ßº·!_CVÏÒ¼t)+ÊA€ 7ò Í:!ߺbT¾áÖ«æ春Δ@ Wgï°¼¨i ˆ#>æ°˜ÿâ²Ù}t©[ÄÚ9Œ«?>ß$ï —ÀŽÂlùÒ±yxw™ä¸S ˆ«·ÝþÚÁ¼u½M¾Èwcû¿óÿ „ª0Äé#ðCp6Ö¹‘9ÔÔ'ùYirÿ‘’k¤þB @5þ>Ѻë3úFø$!ñ†N»©sñÒ»¤v¦ø†÷¨ KÒ8<%ƒ°¶ƒûäy¨PŽA°¯,Wj¢—FWVﳨ÷ïÁ³üî $½iCì&¼ Qa'QÂé@ff6(ae8<Ýtì_#zGp ÌÔDÙSS*yP`GëØ>›ŽÝÇ0H[»²LݽÃæÛ;X„h·QÿšýîCDý]õû7Þ‰ÖŸ`ýœƒÄ¤º÷ÁŽ!iEvÁähCÞùRY ·Á4q%'Xb,ÈäEHgüv}»¼âÞsÌÛRs  •™’þÉY`ˆü͈â÷aS7CÔ f\€ Å<­›‘B$EjëÌôTxÀO@³0:†ðsÍå+pW7‡˜á×ðçZÇ 4Ï/*c/Ÿp‹C&5K ¼~}³KveËS{ËäÞÚ"©€î57-URã%)1b‚’ p×?ƒñêEŒ‚ó-½ò·o]ƒÞ¿_Æ!‘&æÿÆ=§ 5q¸Û'3ªö —á…òRÙþFŒcÌ@iJˆðЭv`}«K·:¥!‚i¸j¤¾C<444âûÕÑ}¥ccØD[ÄN±«oHÞ½Ñ-g;F°A؆QÿƒnÓ»–ásÏ¥¶ŒÕH[Ÿ\F4¾¢÷oÉî‚ 9µÀ±šBÙ#¬,W˜e'@c,f°SaZÁHŸð.jéÆ}¾æ!¥‚‹ß%þ·ovÊO·¡n‰³¼Ð"Ý9«æ³CQXÏæÓõöN!\íÊÚ÷+ô¥wxRF§çd(†LŠF;¤ŽeJÝòõ«írÏîr©*Í— 2Å7²²²2|»2ú¯r ýPGg g`<ùa}«\CÜû›ôûѽ o«H*ç@ÁæÀTƒ8·B*ðr´»ß»%µ9n©ËO—ª¼ Ù AŽ4¤AŒ™xHy€àΛÁˆ˜“ {dQûQW·’Út€€ŽCTÎdªèãÊÛ ¬ý øŸ»õ` ó, Âò*˜£³èÃ…Ž¹‘ôš1H4˜Á}Eì‚`ÛêÔû‡‘')¾Ï^n–T„¶v§¥DÌsÅ©Û¡_†°Ã(YÔFý1¹Ò܇\é³Û.áE°®­ve+õV¦@ܦ@¨‡ Öž@˜Þ¾¡qf”úŒT)€û`–+v‰âJŠ—äHTê^ÄÀŽ‘ýÆ‘Ø…Ùý`°ÙŒøþdÚºð~šú~úY/6XÛ’àÞ¡ý$Ê$ÿ|ùS¸ÛŸ¢ÛäØl#&¤ŒP+tü7`tZß=*ÍPa´Ñí¶(HZïéûcŠ…,K?þûdgEžäå¤K¦Ûå‘@YøT'Tß¿?¨í¶c€ÅE.±¦øƒÀ$¢Å1ãßù¶!i2» óÿZÒ3EÔb€ˆ{LÀeBU ‡Mƒm@:T™`È$Åñç Q9vÝ“`ÖúÁŒBO> I€(U *eˆ_‹Dþž†}ôW®}[üÒ($P }Ú(LàHÂF¦×±ÛgªåË=£Ò FF©ˆ -Ñ5úG`‡á¬waA^ë‘ûÚ¥87SÒ]©+Lgn8†ˆ 4mÔFý땳з"áÒÛ¨ý¶oª"Ú |$¦dP&a30F¬wlÙóÑÊçüŽtwIïòi´R>bË¢ÚàµùaÓ¹¢j€ˆ´1wû=PK4vÚXnÒ°™%[ ñ˜óBÝ?-M–Vwû[>Ú\`·HÆâ]¨aÜp ,…]JZ*Ó]{M< žë€*9õQ àˆaô¯\´ðç6t°¿ºÖ)mØn¹­óïæj_ðZkAUï½>Ôõð£ >Ö_[¤øŸºyQÄ~iŽ–û +n{$!ôpÛà^ãrÙ¯Âæa î|³ ø³ðJ`R©yµlâêKD;c=\6y7§`ü›…¤Vûj‹eWu‰$$²p·á3*€»¡c¾‹z¸kéì—ë­}Ò€à5“^»º¨oüvh`´ÑF¶‹Nd”;{fŒœ˜ž•QèíG FDþˆ!ìøiÌd?lz X VNÍ-}T¢v–ÑÖ¹í0¡îÞGºþ6 ‚ä%$*/Î7Ò\›Á›cuóæ_ÚìÃêÙlÀ‚m.wÿŒùºØ+ˆ?ˆÝ™Þ˜[·¹ßÁ@?ß "¿ÔØ- ]ƒÒãÃ!Ø0 Â.¡ž$Ë "ž‰D @ä©âXOôÕDs0Fv솉6t±¹WNC` ¡&%Ú±7¦Í~"à`Ù„ömä@ð;{‡ä؜5¦¶@ļ®{­°Ø]‚gB ©9 A@˜!6 [´Ø|í +ÜÃÌ¢vŒJ=¢/¦»RÀ$z6¾Ô±ý®q +Ks"S¶ ÜýOÏÎÊ{W›åj÷ˆtêÝÿ6é¿éfpÐ/Áøpî‰K,1à-÷ɘbk¨­iŸ•×.4JWÿ°Ì $³)#à¤l€†ØxŒùé ô²H÷û~C\G(Pæ0Å à7$ø†èû [t߀l °íx·}T®#™£ƒrÃ`Ê8ÉÐ0wŽ¯#?á™~ÿ ˆ³~{pRZ©³5Å `0¬ 0‡5¢ 魯 µk@I àìéá$´1"«»MÕyp÷CHûÔtâGî!ÿ†Ã¿fæ;ƒÀvC`ú¥ aªwUKa.RY3^ƒ)«8É ÀŒìê°:÷„»ÿ>ýihí‘·û¥g<îYÎí³é™AÀ à?óX+.NÌËå–¹t£MæT:fÿë1wØÇHìwdZÉÝS{¯œAÔ¿FøjÏÒïǃ€AÀ °ã¼ß>,É-²¯®LŠò2%¡ªMqŽ‘˜\OÎ%úõJRÒ^è–1&Ž1Å `0l†¤-æÔÐ;. -Ý2üÆà#°£ov 055e¶µÍÑÕ³Eüv$üa\öÓÃÓ2i,ÿW±1'ƒÀÆ BJØ„¸:elCŠ~·q}ÿ1g³‹rŒ ÀÚx3ìo[ϲ±M‰ >ÛÓÈ"g¸ù±2Ÿ +`‘èÄÎÿ†=…LŽîTI‹O1ðÙY¦NuFq vþË Às2‰=Žî©”q„míGøÖ3Kÿ &`ƒkÍGƒ€A€d`³p 3Ež‰Ìm 4Ëù¡)éF(`‡0²¡†ÍÔgØ–¸Aü?^’!í.‘ãûª¤0/ y¶%›uzEÀ¯mOsÃÀfÓÕó¹+%YÊ‹rÁÑÇÈŒ{æê»eadZú$àîÀ™o Û H e¥Ê#{Jå¾}•²«¦D¨B4e-0ˆô6´5`çÑ]üÄÄÄÚQ2ïî@€œ<ó}ñ±CâJJ×µNy»ÂØÜ”ùÀ °½ ñ¿'Ó%ÿüäyèhdK‚!þNH›×«ÖТ oŠÒíÌD)¤ÑÛ,ªÈÑ“ øøû¤0Û-˧`0›€Ç¶F¢„ú=™›&ÿÓ}µòäÉ=’›•nvþw'ØxKîreôå®Ñv”´0!>ѽ²äàÎEY€ ælƒœé›€:ÀØDÉ™f‚ãüÿfY¦œÜY$Ç÷WIN¦[LÔ¿»bu³aîŠPø¿\6F€¾ƒÎL®©)IR›€¸¸8é“á™v©G>ð>¸šb08tˆýïÍN•;@ü÷VJuY1øóaر٤È߶bï.ÚUà ¾:7 €÷°úvžœäa>÷è!YDä¯ÌÛÈÐïQxì[mæ*ƒ€AÀ.¸Iü³\òÏ ó¿ï@µT•æCìo¬ý}?x8fy´+ Çiu ºººôgæè#”Ð&€’€/=~XJó%þÝÛr ê€Ø¬‚ëc}æ2ƒ€A úH…«ß=òóÏîß!Oß¿O²àço\ý|·‘‘ÇLÙXµœœAâ›±ØØØôÕ͉O(›€ü,9¶·J’1%NÝSH¢\ à†æ"ƒ@Ô#†_ óÿüüÜU, 8X¶Ñùû=l“““ÆÀoÔ,¾Áív3aŨaüš’€”ä$)E° ¸¸éž”ɹ¹<<%]Ê&Àpþ£jî0D1ï#¸åÿû`ðWV”c¬ý¢¡¡!ÍØ~atŠ`911In–G0žeŒ©¹¤ XPYa®X[dos €dITŒFN{?ÂD *…MÀaíN‘ä‹­J0 Ùz®Û{pLë "ÀÿÑ,èüOÖÉãÇw¯„÷uÌÒ *ß@K¯$JîtÌ, *€ñ(ÁÕÖÍ`°’‚yô¤Š¼U&`LúMî[«iü6DÄÿˆý?~¸r•økÿàæl‚« Šîv°*ŽA€çŒL' %I\„,‚KÈ þi¨Þk”÷ûÇM¡Ž‹y´AÀw ü>Yœ© þ¨ó/ÌÍR®~´ù1%pv~•æ^KtÜiw`U&0·ËðÏìXÑŠÕ`ApꚀaà¢,NK¯ ìŒ6½p(ZçïZ%þ;«KŒ«_FvfÓ0ÔtGCPsdª°;°Šˆ¿à5´ú9 IP­(›€'+ÁÌú.y .‚Æ00$ðšJ !GÀ-þ1Døûmèü:R‡, yjçòmà !eî,,,Œ¹}û¶wïmË8 øÜý/C73ì=*æ$Zû;°:Pˆj¥(ììÝ»aÉöz;›á„±GŸ/BçÏØþ'Öz‚ü$ÄEdÇ=›jfœ{•5tÈës[œÚ™ ÀzÅ^îïïg7@‹¦í†<Á‚rT¶°®Qi“k° èRé±mô;PFP1Â¥q_j¢äÀà1)>Fꇧ¥îŽóª+6êEcî¼jIô1ÁðHK’*„ÃMÅîxrvA® LHŽd3`£Þ£Oé þL髲úí«0‰},>äœé§½ªwÄaw@³îîn㨱èÈBtüäCe„ßu³[ÞéŸ@Á%ü"¢ý7á!É8”#ÞA™+QŽ–gIY^º¤!;â{7:å’!uNÍI+ˆÁ ëÑÞ-‹ÆÚÕb¬eÙ3îyq±’‹quzŠ¯Î•£»Ê$±.G&å­KMr­{LÚ‘³}v^ÆË.cïñgŸÏ«–«¥®¢Øˆý-š¼ÓÓÓC´7ã¬ZyYô¤ðTë`uyîììœ lÛ÷)”–«8…9ò…ÇHaÎ-I<×(ov"NÀÒ"£1F%8àÚÅ…W:ÒW¥&ÈCµyòË•…*z,ü¥O¬‘Ë ráV—¼y»OZ¦æUìOZ¤èìWT‚EŠÁ–Ÿio³@øb‡|°"[À8ïª*’ô´T%ÍZX\Rª­k·;åÒ­N9u³GêGg¤Ò 2ÑÌئAç±:~ûd­<ýÀÉË‚Î-ò=¦„¤&à½xŸ‡þ×hw@ƒÏãòõë× `ñ„ÑÕ“ (B¡ûÔ¨ÝsÌ©kò˜€¾%ÉŠ&&€ –Ãlä8x¸ ]î©Ê“Ý•ùŠðçggHš+yÕ7º¼8O2ÓÓq8±o@Þ½Ö&/ßè‘k`fاeÇÓÃèà#wý1RÂÿ’ßÜ¿§DêÊò!½Ê’Üìtq»R%2† Ú¼,q¥&K-®9¾wH>¼Ñ!¯^k—cÌë9­—›( ;ÿ§Š2äѽ¥ÚµKòÐ/f÷4Äߺñª¹§¥¥… ¢9Ö=)<5Û•ð_Ÿ/_¾|Ù1iÃ3ü?…‹LrR¢#XP,Ñ¡±I™žo’ó“Òi›6nEì[omF²,Ë–ýURU’+¥Ù’Ÿ›¹Jø5 ´qà+=-EIÜ …È™ÞØ="·úÇäôm˜¢aþöy0%ºP”/F’0¥ƒ˜ç¸¤¦ CöTÈN¼ 0æî4H°ÖÆárå#Ï”¸ûì,7„dÉÉH‘Æ®a¹Õ3*ï÷K;ã`DƒJí¥ØÿñÂtyh·'±O ¼tá}1Å:û!X¥9x’>·î¡ÖlW`#H–oݺe¶h!cág TuÀc÷î–‘‰iY¼Ö)óƒS° €: T  IqRšš$uyi²·<[Žï£¸¿HÒ@Ô)½àÎo³B&€Ì wŠU¥yr»­W®Þî’ô†i¡àôœtÒûA1†Ø Çð}#°á”|¨wJR`ÛáN–C9 ü”ôIeI¾pžRÍs·qg{IDs2ã! r %B-}r­ c_ß! ýSÒ:9ƒh˜4E?Ý1Pg@çÿø¾R9q Zöí(÷ìü7ŸÒá ‡? Ræ tÑÖDß{ˆìÎèPG—Ë%°ÒlIHH¨ôî¤9·&¢aàç="éÈ(˜v¹UÞì‚:D2œ6Ô‡fŃðƒ+Ë’ö•+Q?qG—wÂï Å©ŒÀã¡]ò`W¿œ»Ú"çnuË5ÄAè]TQ§ C6%ü€ž#ÅmœäaœòÀðÕå¤Ê=uErdw¹T”äItüÜÕÇ­ˆú}m!Ç>ÌEêÙP Õ”ÈqdÐûðz«¼s½].uJ÷ôy¿¾]~~­K®‚ ÿKxì^àê—“&Ÿ:Z%»¿ê«!þ>Ïœ\xóæMøD} Iýá®Ä €"þnœûòÔÔTSZZZ¸q4Ï”äeÊ>~vn^ÎÜ”³È"ØE#ªU¦9TP`uÏÅ6ð"ŸÝW=oYžæH^ù9™+D€Ä"øBB@Õ KJr¢dagX #H>³¡cPšzG¤¾oB.MÌÉ´2‚ Q¾oQ_à ѧ˜¿61Nö庤 ®›åùRU”­Æ;ÖïÔߧBEQ( %w[)YÈÏÉj<ûrs¯\‡DàU¨½Ô·È6óï3Å0fÜY,÷ªQÏ7Ä?”£¼u]ÌO3½˜iºÃ½Ï·®(Š®°;@àu!ñ_B®ææüü|ý™9†IÚÄA„ÚÕ?*#Óó"c3Ò½i¨vI4:,¡¨A|*°ë?T‘+÷í¯”š²¥·§þÞªBF Í•¢^E°/E_K {¤»Â’ö©€j ýí›™“>CŽP2`Q°ªÑT/å6uIñ''H>‚÷”b¼w•æHui.vü¹˜kÙÊ¢?ÔD# Èpì)a(ÀØ"2fnfšägtKFó€´`ܯOÎÊ”o}ܨ2?>Kƒê°;UEø;Žy¾£ªXÙ¨øQ…¹4ÌÌÌœ/++“7nh‚¯!¨=2UØ™ÐÄ_‚2„!`S]]]dÐ4OU0P ÔŸ{ü¨¡fÝè’Ó+aƒ™^8ÐBëîlþ*þ½Èq~´¶PöÖcA,RF[ÔÛÆ@®B&'®„9™nø‘WÈøä´´vöK}sÜî„T–ãÃSr}bF&ƒèw¸úmÏáHV`Çÿuy²"þÚò|Hxr•j‡;qâï‹a_¨ûEF€»ï2 Ò}ð˜>Ö= ï\n”S×»¥ylZæÀô®Ç |Ê ‰ÿÑôT¥óèè©“˾›~FFF>LJJÚHþÆ„è‰vf4« >X~ûí·{>þñëïÌ1`}T6Š x숔äeHì$¢a §ü]ã°ëNa߉>‡áúôÄÑ9¸³\îÈhÜŽàFPò¹±0DsÅQüœ¤â¯Ó*{lžƒ£réf»ü·7®ËY„LŽˆWÄF¶ÉgׇK2å7‘‰²®²XáóD8҅툃´‰F¢Ù`kË åÄþn¹„`RçLêÕÖaÂ.É^ÊNÀ¯ƒÉ@ý‡àÑð['kyó’nQÍùžûÕÇ\ÜÛÛ{L€7`û¾ÙдD3K§OŸž±ý¨8¤ñXÀó!&=¼»DU0 |†Œ°æQ›Ý­£Xæ°È§áu$#Iî¯É—ÝØrX±{6D¯”4ÐH/ é¥I‰|!·¢±¹ æ.u7 uÁu°~ä[÷;zm yˆá°¯2WÙsdÀ-7‹ÇP4VEÜY]¢õÞš"9IÐY¸~ ªâk0)ôÿ“Eé*¶ÿÃGwzˆ?¤†øGnÀ°¥µµUÓšõÇÈ5,ˆ'Û`×õ@(Î n KKK3ÐÕ&‹¹5(ª`Apäέwh\Ægý Äâm ´™X7ãú ¸óí+D ñÙQ?]»xˆ;íhØÞ "J%Üi±°È–º¢L¹‰| ÍóàM7ëóÝ*Û¦ße@ü_ÀMŒÝ­Äß{hÈÐ8”!†i$˜á–tÄ¢(oí“&tspR®#ÏÄ´öñ¾Ùë<õÜŸë–vÁ¶¥J*KóØß ŸHž:uŠéæIg#p Âð=x<©‰bž»dXÍ“pìä~™‚q\"\ç@PÅ;N@ÞŠŽ¿Æ^»K²À§RöÖ•©…U[=G;ñ׽מ{ª‹äZÇ°œF|yS|C€Ü{®+A*‹s•×…owEÇUdÜPMQP†öïCüˆ†–n^8¯mHš`,Ø?¿à‰*¹Ž!tãÞÈíÿ‰CÊÚWMˆ¿–éè›`ZñÎ;ïèzÓÉêxnÛb÷™¥ÁײD#ñññ †ˆž9I±¥Ž@Ã@ZN§|Шrô,Ì Då…Xèæ§É‡*evütçcl~Þ ñ:.³]¡a"½J³[%»uP†¨0åî` «aõ_‹]0ì¬ôê¸{Cÿ–LjòOPz±£ªD*`0xl_ "J¶Ë›çåjçˆ\GTÉ~0Á“ ˜…G)âL…_>^#¿ñÀ~Õwª’l8í.Jï„T¹pp¿^#ˆ’1âo†¿UâÏÁŸæ"‚5|XTT%Í4ÍÐsA¿ÿp|©SDÞº&§@¨QÜŽ#rß¡Ú9:kWŠZø©:°sánFbù™r4c@Þš’_õÀvîxPmG¸üíªÈóˆÿ¡] Ìáø8'¢]TUPeµv À[¤W^¿Ò&ï †@?HË#[ýÄþRyêÄ>ñ7Q3ì þ/Rº¼I€¨i§¿ ±»€ýÕ €: -ÿìg?k}ä‘GüÅÂ\h G&€’ÏONÍHMþ e#°KIvIôëÎÁ¢Ÿ1«þPC@@cÀ0»`ÏðÎÈŒL˜ÐÁ[ÂœŸ–,yÜØìaâ¡ÊbtÊd$%rI>‚d§É¾¦^…m@]1¢X"U1#jòwÂ{L‰`ü÷îÀÀ%¤3Z ÀÆiúÃsÛ»3ŸÅ{P–ž{î¹éo}ë[$ûnT·œùG z‹\EQ¿Zðr¶—âR'.zñÈ>Ç4´u°iHkèàÌq U¯²áZ™ #-R‚â´Bâ^ëIK\i@I~»Œ!† í­+ñO´¥ºËiãäÝŸ—^zéV{{»&üšèkúã}©­ÎíÎh°õ€¨¢Àäää$zP_`ŽÑ…wvEXà™–—‘ý"Ð%\ˆ°4‚d*â²äÛ2»‡yÛ/Ö W¿ƒHß\žÝ1ç†"ÇÍ=íC²`ãrß¡ÂYü ÄÇ1a•5ØšZGàùçŸÇÝšàQÓ[ÿ’À^ëX2ÝÝݯ>ÜæN«à"G+yêG¹ËsâÎ_cȾeÂ=¬ Ͻe™R[Ïò©K]ˆy­`@‘]ŒìGÌû„úUª ‡SC}ÚÆP*àÉV©g9F H0wªåUú‚viš-M ¸Nb8(¤Åk×®-^¸páRÀ¨˜ !F€ŒN&BºîCŽúlåÖÅéjÊZ–á"R†D?EH*åDñÿÚþšwv@ ¯¯ïex•y3-ÞLQÄCÞŸ“/¥ˆ—†@9¦¢gŸ}öƒÆÆF­ÿ×´Eo8£¡‰AµÁ) AðæÒ” 33s!Ÿ !s³A „¨ÐÀ°p/ÏM“Z$»1¶€p `üWŽPÀ&ÙM1Dl§þþïÿžþÿŠžà¨wÿ†ˆôàx=_†>rÔ€Á}cÆ€¯x]kN E€±˜.v?2*Ɇ ÎÞ¹B&l!J@ô÷WåÃUÒ¥|âCR¯©Ä ýýýÏgdd¬ÒTå-¢æè¹ÕÉ€ àâ×¾öµ[àäȘbˆ ¨¨®»º0r«¾u;‚ð./5^vV˜øQ1CM#ˆÀ /¼ð$Fbò2C¦"vÿ¿„½wÿZ@F€´D3‘nbHŸï´_÷ÊÉóæâæáÛ9ÿòË/ÿ§"h*3@tÿ¹YéB5ÀîtfÜR€ô37)NÊ ³Uô?³ûb™[C‚@ww÷/]º4‡Ê4ñçq½ $ÏŠ–JœÆh\ɬ‘àýô: üÇܸ°°Ð¯/4Gƒ@$`h`Ô5%¹R‘íÚ6 @Ÿ Äþgzdö߃@¤€»øÿèèèð&þz©wÿzƒ馆ìùNg¼¥j`!X|ÿý÷ÿcÈ4‚D !>^jÊò‘ È-)`_°ûÏKDêß’,Ébìÿ¤DÇwÙt0ºyý§?ýéäüü<‰¾f´î_3Ñ݉ZçÄÕFsiÞR¨zµµµÍÿîïþî /s‹A äPÿ]Vœ'eù²;9N˜×É…½ËKM‚ñc1vÿ)·˜'¨úöÝï~÷;`VéºäÍ–8²8‘ÐåÍh®N 0¢.¼ôÒKÿF_hŽH"@ýwVFšT@~¬,Ëñ¡]àrS㤲4_EDŒ$öæÙXý?÷Ì3ÏŒŒ{Ó žk €÷¦ÒQ€9àÀi#¨2ðhooŸûÊW¾r ŒÀuG¦éŒ- `8²³4G\N¶ˆG_«’¤<ÇHˆn¡úÃ@¤`¦XЂÿ¶¢ûçÑÛЛˆT-}®S-²¡îFÛhñŽ`ÿùï}ï{ÿÎRtMåˆa¤7€²ŠwtHÜ)NK’ „ÿu§AüïdfÇDZ7—E†††¿ºxñâ,Z°žøsèuÿZ¹†Zôd§2ÞpqðÖ3óÃÃà ý×=844ô+ï‹Í¹A P å–ò¢Ù“*9q‹~VÂØqge!Äÿ‰&øO$&›y¦BáãŸÿüç_niiÑ›C}\/þw,bNf4צŠs4—G)ÀˆÿüŸüÉŸüߎ]Ó1[!šœ,ùŠsïŽ")IE†@K§•Ü˜e)ÎJ• ¸=šÝ¿ÓF×^ýyã7þ-íÁÐjoºÀs½û×{uÌÖ:™Ð0x3Þƒ=?===êÔ©é7n˜Á-sŒŒ…Ÿ†¸;‘/¹œFþ`í¾ÿE9é*b¬Iþ±¹¶Ý ÂÞ`W7Ùýk€´ƒE=ïô×é N¿ÈÍi)€æøæ[[[ç>ö±½<33Sï q5]±)‹—dÁJ>AÜã˜ü§ ™óaÈà?&ùM'©Í›½bø÷産+J¼rÜV»£Óö‘…L€fÈÝ­tþ /4Å Iá [€œÔDÉŽ[á–1}ðJ‚ "?ÙÿŒõ$çØvö¹sçþÓ§OOOLLà{3Þ i‹>zÞ9ì¯Ãö›ŽûÉ-« \•$¼RðBìUõJ-//OyñÅÛ·oß_à3S ƒ€AÀa +ì‡;vìøó®®®tm ¯É•×4ŽüŒ›Cíþ‡Sg3ÛE ’Ü×Û@I!pîŸøÄ›˜ØD˃€AÀ à VDÿÿ~llÌ{×Ïõ_K¶î_ëva´‡j¾¼ú€ªI@UÀŸþéŸþ…Ç ƒ€AÀx‰þÕ¦½Òk?ß{Ò M3œÑùMzáPgã {»‘ºƒŸ‘ â+ @looïÒ®]»ÎÕÕÕ}|ÃŻƒ€AÀ `+î÷'>úèOñDŸ/Šûõ‹ïÉP:¼-?ú©ÊFDQçÄ#û«‰>c2 s‘¦âE{SŠ‹‹“Ξ=û劊ŠßÃ{S ƒ€AÀ¦ÀÃëöáÇÿîÞšðkÝ?Ôý+ 0ŽšØ6LÀvQxO]-ÞYo  9Ã9ˆÌ?øàƒÿˆäç¼o4烀AÀ ` ÷Ÿ¿ÿ¿îïï×z½Îó¨Eÿ¤T o¯Gp»1z€µ-~ÉPÁóŸùÌgþ=Òk°ÌÑ `0ìƒÀ~ðƒ?xë­·fׯóz׿^ô¯i„}:DK·“ €7L©>´j@ÙÌÍÍÅ®¼^ƒ4àKÞ7›sƒ€AÀ `ˆn®_¿þW¿÷{¿w©³³“Ä^‹ÿ½õþd Èh©ptwÈ‚Ömw@3ÞGÅëX¨bnݺµP]]ý. ?aþ¦Jƒ€AÀ `1===ÏÝÿýÏø“È{êü½ÅÿZÌl«Ý?;¼]ö]}ž{~¾ú‚ÏhÌ™3gÆ`Dr©²²ò)ï ͹AÀ `0D¿Z D®Pë‹8Qô„™ƒÿèÜÓO?}úâÅ‹éu¯95 (@q\.Ÿ8qâˆå¢‰¿Þý¯®ãhæFÄÛ‰þõpé¯~¿­ûg®€ùTlyÎÏãaðéÚÚÚ?Ĺ)ƒ€AÀ aàëóÞ{ïý× é>::J"¯ÅþôõçK3Zô¯Ýþ¶-ñç ÀG†ÞRN J´@Or”‹ÇÿyccãŹ)ƒ€AÀ A`¬ý^JJÊ¿âÎ…ø{¯Û\»¹nsM7ÄÝ8Àˆæµ:€Es‘œ@|i’9ä‘^€kàO._¾üŸ=·›¿ƒ€AÀ n¨ódžìë ÷Ë5Û[ì¯×l2üÎèý× 1\ˆ×[2Tè£6 TGä’ŽùÅ/~цÉw ©„÷ºÏœ ƒ€ÅÐÚÿž{îùÄþóHóKï½ó÷&þzçϵœ/}ô¼Û¦ °vàµ=ÀÚO×¾[eèðÊ+¯ôÃ=ðìîÝ»Mœ€µ8™wƒ€AÀàçÿ<\ýþ¶µµuÑZ½wþYü“Ð*^¶Çÿ•Q1 À ^Íè£7ר?[ü÷Þ{ciii¯:t艘˜ šb0  põêÕÿòðÃÿ<³Hø5ñ'á×êZo½ÿz±¿!þ^cb/0¼NIà·š(«L Ob.\¸0ýÆoü䳟ýì„„„|¯ºÌ©AÀ `0‰û|ÿûßÿ—¿ÿû¿Å‹ø¯ûkÑ?mÖ‹þ·ZÓƒl¡ýn×;ZûµÜúkl´{ ÓÓE0 /¦¦[ >rן˜žžŸ››úôé”Â_Æg¦ ƒ@ÌÎÎÞþßù?}ûí·g¼ˆ¿6øÓ»ÿõÄ_‹ý½¥¸A¶ÄY·k"ç¬^…®7ŸÍ˜2š c@!¡¤¤$þ‡?üá¾Gyä?†®)¦&ƒ€AÀ °ý€uÿÏ°–þ-Üüé62ø£ØŸÒ½ó7Ä߇©bT[ƒD&@‹Ž¼úÜ»Å0À/UÞ|óÍ ¾ˆÈT÷ÅÅÅ¥{_dÎ ƒ€Aàî@ä¿|îܹÿðØcý¼©©iazzúnÄŸ„ßÿ»CzÇ·z‡{Çæƒ5hœ´$€Œ“Vh•€–ð=U yyyq™™™q¿úÕ¯>[SSóûkj4o ƒ€A`CàÖwþ+_ùÊÿ ‘ÿ,,ýIø7#þÜõóE©¯¡ÑŸ·È£.1… €ïóÀ[À»ô$ÓÇ;jBlꈬäùçŸo˜››û%BURà¾ãBóAÀ `0ÈÊ®ÿë´ö£+W®ÌAü¯‰¿·¾Ÿº~­ï×ÄŸ„ß?çÞÙúyÛ¶½\ãEIϵ$@K´€ÇUIÎã ãÜnwÜK/½ôÙêêêßÃg¦ ƒÀ Ø0ÕÿÁüÁÿŽÌ«sz7¯ÝüHèµ›ŸÞõó¨êüõfÌìúW0Ýê`$[!tç÷[I6š„1ˆ(+Ò€›o½ˆVµ‰‰‰…wVo>1 Û¥¥¥qýûøã?‹ðêóˆð§‰:wýšðë]¿fø™o?½önð‚ì©ÞÑYͶ»]ãÆ£¶ Ðn‚Ôÿs÷¯mô¹òÀçñYYY±III±ßþö·Ë¿ð…/ü»øøø|nŠAÀ `Ø6PÜóæÍ¿ùÒ—¾ôêððð²×®Ÿ ¼f4À£þ\KHô¹ûg1;>ÿÕ„ÌçÌ…«hìxä‹Ò¾È¨¸8jU€f”qàÊ5qP Ħ¦¦Æ>ûì³÷;vì/EL‚)ƒ€AÀÑ@·ÿSùý=¨ÍÃÈœ;yuîêù"±_ÿòÞõ{ïüq©!þÁߢ‰˜¿÷™ë=hü4@i€fHÌ5# ¥Z:ÀïÈ(ðWQQ[ZZ÷w÷wOïرã#`T3ƃ€AÀYŒŒŒœú›¿ù›ÿŠ2†xþã¿èMü5߈ðó;½ëç=|é¿>: ¬0ôF°0<ÊÑÐ8ò¨™q-öׄß[°FÀûU0.'''ö{ßûÇþ866Öx 8zژζÝÝÝÏ}ó›ßüñ /¼08)Kˆ‘¢wð$ê|iѾ&þ|ÏsÍðz} ¾&úúˆLñM¸ü½Ï\'KÍhF@ïô½¥dô{Í$aàK18Æ|÷»ß­{ꩧþÆ‚exoŠAÀ `° Ôñß¾}û™¯~õ«¯\ºti:þ%¯?‰¹ù{ÿõ„_3f×oÁÈk¢eAÕÛ²J'ú¥ »&ôšðó¨ýR àsÅ ¤pÜ‚|ýë_/üÜç>÷Y2)‡·å´26Ø™™™Æ÷ßÿû_ûÚ×®tuu-µµµiâ­wñš¨{»øi&@õ5f×oáÐk‚eá#¶eÕWµ—$ðšØ{3úœßi‰fb‘d(cóóócÿò/ÿr' ÿŽËåÚƒkM1 G€®| ?øÎw¾sêŸþ韦áÙ$Üñ£aš€kâ¯ü4ñ×;~ýžG}-ñ³]ŒÈ_#‚£&T!¨ÊT±-ú¥‰:1üŒÌÀzF`•‰€ç@ $k1O>ùdÒŸýÙŸ¬­­ý"\ Ëq)ƒ€A l`š!ß/ž{ño `S"ˆÙOb­‰¶fônžG|MìõnŸïùâ÷šøëz4Á×G\bJ¨ÐD*Tõ™zîD@c¬™M̵¸_3šøk@î-Ð÷ò£ÁX&:~üxÂýÑU ¸Ðãü†ñ"¸sÌ'ƒ@ð@¼£¾¾þd;½ô£ýhnÌ1ÈÒ·„(~ÞD#¯‰üz¢¯ ?‰?ïÓ/o‚ï}|'L «hâ´ú9±oœyîMÈ) Ъ}\ÏÐ×i)‚®C1.¤ÔÈ›-ø‡˜þñ|_eeåq¨0ñ,SS©AÀñPŸQþëçÏŸ¿ŒÀeí‹ÿ{gÓI…áj ¢Žƒ!ÁµX–þþ)ìܱe¡WJ‚£LÒ.†J{Þ‚·9sçVSM¦»ynRœsÏýìçv×{«è»Ûûe‹¾¬®Ü-üò}ÕŸ…ß~}_õ«­û”U²½Íñ÷É dazòÎéðæÝŠv”ÊZÈ}GÀ›ßuLÖGm#ÐÞP¿qw`?<4ˆÏÝ6ñ›+‡‡‡›{{{?Äwü¸ººú]Ô!Aˆwèã z~Šÿåÿ|||üÛÑÑÑ»8ÜWùY¤}µîÛö5á·èKè³ð»ûp¿šÂ?^•ëX>î(ô^0÷ÚFÀWúú,þÞ ä²r#à Eî{ïh¶¶¶–t‡ ~™°ÙÝÝ]>88ø|ÿ›¸Sðíæææ÷{±»SN–< °ôû¸]ÿëååå/¿Ç/îýqrr2<==½ŽØMÜ1èsúñ}üzÀål-زñRø³Ø—¢¯²Ü‡ûÖxJˆÿ-‡gùk!z–ÁäæŸÅÚnaŸ´!ðF ×U{åÝOî;ûšÌ v÷Mˆ¿ê6ñÂÅUÀ@ßLo.\Žo%\ÝÙÙyµ½½ý:¾ è˨û*î|±¶¶ö:¾›àëØT¼‰» _©- x~ôØÐÿ©#n×ÿ}uuõ6~?8öO|ï¯øþÛ³³³wqU}~~~Wø£x½7ñúmâê~BoÁÍÖ¢,+±¶•Ðw ¿„݇D?o ¼Q@øÌ,% Ð,Íé%ÎÅëZ¾Å< ¼D¿¶)pÌu½(m9†óâ.ßiìëýñSÆ4”b“ÐèNBœl}O6ºMušõõõŽøèâRÜQXV›••µÕ éßúýƒAÄ–|Ħb9|Õý,¾ý°Ñ¿.4Ž>í «X¼¡õe•óª£6Qß'1….é±ÏÃcœ—y>ö ¢çZ¼ÚçZ<ÛnÒº´qç]OK§Šª}}ýoˆõñÚ¹ ÿ&^GòGkó… ßÄkl$_Wä:†Ã¡üQÔ…Èëõ§|Wíîð•¯Ï¸¢©»Çi«¬}Ùì[ìËb-?‹¿„ÞokñÏe¹]îÛcF7ãñå“ž™@{}æ1®›€×ÃVâ-ßVâ.ß›‹}ÿ²LõÝN¾ûʾÆð˜ös>ŠÇåò•\~›{ÿ爐÷kÞçÓæ¾5æ@¾³ŸÔ&—Ù¯YÅÊÃ-ë#‹¾|Yä˘ںûÌcEq›œÇBà%¨‰dËyû5«XŽKÈ•d]&ëü´6÷a_ýËwʾcØ&À‰w†gŠ©åu´/[úŽuYojåšNw¬fs¬ô•WR]iRYWâ˜U‰c­<Çj¾bŽÛ¯åsYÍïÚ,ˆe®ï¼¬“Çs;G8ÉÎÑbM1Õ¼®¥ï|¶¥_æ5tWÌñ\§ôkyÅÊ”û*ËÈC`‘<$œµrÇlÅþlö]Ö7^kë>d\Ïyìà„;Ç‹7ÅÔkëœcömÕµýÒæ²I¾ÊœÜ‡ó]¶o½®öÄ!0/ú iW½·o+öms,û]幎|Òà„»€‹:åCª=úÄju<ô¤2×)ícÚ”}‡À<ÈâÛwÞ“Ú”eå=fYÏqì‚ऻà üD¯ïó¤o½'šÝ@àEè+Ø}ë½HˆýéOÇé/ŸúÔ§æøã?þã¹Ï|?dzzZ¿sÖ×sÏ=(,,t>gff:ï©©©½{÷Ê¥K— Î+11ѹ¶žç§ŸCמ÷}AAóswww÷œ¹)ÇäææJOOÏܱîyW¿s²sŒû½þ­-==]w½ÁÐÐÓ·Ùãô_†‡‡cõwšÛw÷;½®ûÒßÏîùIII±±1ç;> Ÿãf‹×ëéïî}øìŒ÷hn¦aŠêKû;Åx¦~vú¯¿3æiÆì|ú™ctí¸ÇÎ{ŸýÞ9Dÿ¡é=æŽgNœë3/sߥ¥¥M3Â|N 8¿ë94çsȽ„µé|×××7s€þHÓ?rrr¦YcÎ÷úë˹wGGÇÜwúÁ=~Þ—³LMM9×Ò÷ÉÉÉ鉉 ç5‹ƒ®§éþþ~ç˜`08ýó?ÿóÎg}¾BŸ+þÖu1ïÔ¿õ8žO§_ú·5C`)œ…´ÔAö»ï°q”¨»›n2÷Ýw_Üý÷ߟÈÆ™Á&žQÎ…Håð*ˆ/`#+á»M “§/6¿~ÓÏ9¾GÌhl<ãžÛîöööQí ΙvŸq~צŒºÃ`ÌüiÿÆ"ÆÄά«d¦£ ¸Dþ¥—^Š?xð`ZFFF9Ç^6„[yíᘛx¯ˆhl¤†€ïf„Ç`NÂ,œ@ûp&áRkkkï7¾ñq½+À(èFaÌ‚âóf €'Ø‘êuxgÎœ |þóŸOÎÏÏߎºõA ðïá§TÿßFf+@à8ÌÁ ¼~„)â(­çå—_žR¦€æ˜õô}׳C=€€1˜¤etÑ™GUñé±O>ùdü¾}ûÊQÛ†Ûbÿ4_'.ã:vˆ!`.§a¾Žiá%üiÎâÇ3Èl's¦c\¤<ún €G'NDW¥ÿ¡}(ð¥/})#++ë~Tù¿ËozwXÖsCÀˆRZaþoÿõرc ª!Ð~šÉ JgkÝ2` EÑ!Î|AøêYÿÔSOmGÊÿ0RþïÑGs¼‹¢‰²®~G€}è_Ðü}mmíK0D-L¡p‡mÚ‰(~Ÿ›­(îc¬wÍ™#UïÏÚòs‹‹‹¢ÿŒÙðc}uØø (@@™Be?ýýïÿ¬†/š™ &e]0` Eà¹yùÖ·¾wçw&•––¾õþŸÑ—­èÝÒ0 å 0Ž™àOp$üÒÇ>ö± ¾H~èjÜ÷å\ÇŽÙæÍÜËn±4Î|¨m»~Ü?üÃ?d¢÷ÇHûÿûÒ§Ú†€!`DçÑ üâ÷¾÷½Ú+ö47I‘1Q2MÆDÇD8óàªù¿öµ¯U$''5ÚÑÑ=ë…!`«C¦ ­ÀǾüå/?¯XŽá8Ë€p ºükÎ~²užyæ™pêû §\þ%ìHCÀ0<À0Nƒ¿}áÂ…oàÏ4iŒ@äçÌ€ÈÌÁî8ÌÄýýßÿ}¹Æ¿MWnŒLw쮆€!`lS0øÌg>ó=i"šÌ4°aÐÏ¿Ñ!šÿµý&æðVç¾›o¾9cË–-_ÂÆÿl˜îg—5 C Z¨§Ò“ú§zŽN™³àÆOÓAÚø[Çܬ•ðãØ—ðè£þÿgb°!`!à#ð3ª*~ˆÚ$Á³€a΂!8…ãc|8.jל‡€~'/?•õâý×ý¶]»vUã৹ø­†€!Ó°n¦\óÙ³gOZyyù‹ZjûìÙ³JüM@ óÊ0€Ãð¶*õWTT$Ïÿen÷ ụ]Ù0 O#ÐHÝ{(^ÖˆI@}\-€ûîéÁE[çMžqˆ¿†õ©ÔOBŒÛ«ªªÎp«Cá¹]Õ0 _ •’’ò{wß}w€Äg¯P€È´aœÖ9)5Œ÷ˆµK;˜šÔkÓnã5 uF ±··÷¾¿üË¿¬7mÀ:#;{9Ó¬®Jø‹5þÙgŸ-Ù¹sg=ßÝ´~·°+†€!3¨6àwÝuWu{{û¹£Gºf\×i °>@º 2€“_üç>÷¹Çqj9Â¥“ÖçòvCÀ0bLxâ‰'*öïßÿ}j ˆ0ÁuZ .áZ§ËÅäe 5¡ÏÃ?÷«¿ú«΂ý˜DÂm†@ø8åÊ•;¾þõ¯šI`}@6`õ8ºØiˆ_܇?üáTTþ?#¤å†Õ_ÒÎ4 CÀ¸ッƒ·}ò“Ÿ))é7I¤v¿€óæ° CN1 Œe~œ#þjïÿƒ?øƒòÒÒÒ+œ›¼Ìóí0CÀ0 5 €™õç{ì±–¶¶¶ã0z%ó XžÆ¬ ´yÄÿ/þâ/öæååç +»Œm†€!°`žxüñǧΟ?ÿ*™õRƬPc–Øñ甸üàUTðÓä>Ö CÀ0"€õTîÿ¹Ÿû¹BÞ8›4(½ðî-]¢æÝlLÏ]œâPûÇýùŸÿùÝôyacnmw1 CÀ¸”þ~›cÜôÁª 0ÇÀëÆoqKün?¿["ŽP¿xˆÿ=FümY†€!=`øøøøøÿñ;¿ó;jŽUÍ}EO'£°'f¸þ¤ÌIþJü ;Ù—••õÚõO±_ CÀ06̾ç=˜ÐÏÞzë-“þ—1Æ,Ò<âÿ7ó7ùùùŽ§Éâ§Ø/†€!`‘B&àž|°›G XzŒX#—ø;©}ÿäOþ¤°¬¬¬†CÝï>˾5 CÀˆ(ø<úÀ\¨®®>Gt€ë `{÷³bákׂâ.'Ãß 7Ü^QQq‘ÃÌ_âZ¬ìCÀ0¢Š}ýË_þr{ó¹çžÓþ©s îífP4f›5‰™÷9âÏŸŠMÂÓO?ý"þÒæf†€!`D3™™™/ýÑýQ®úoÑO—Ö¹{|4w}Ãúf&€ùPëâÐWÜ/ÿò/'üÙŸýÙ_à]ú¾ù‡Ø_†€!`@ @n€gëëëÿ–ÉÚÚZ·ËÆÌ"árE.0±üîÿ¡$ñ_üâŸHLLü­XÄÆn†€—@{»é÷ÿ÷¿N­5w+½3â2¡¦˜Ã]qGú»¿û»ÅÅů„àd CÀ0<ˆ‘{HÜÑØØxìøñãæ2‡Æ¼ËÆÝ|óÍqüàSî»ï¾8Gs Y(öÑ0 ¯"@dÀc÷ÜsÏw‡‡‡ƒ³áʸ‚ŸW‡µæ~Ǻ À]úغuk‡?üá/CüSÖŒ¬]À0 C j ˉèJRAN¹´Ï¥QÓÏìˆ ÂFÞ3Úî¥ Àqú#Óß8ý}0Ú:hý1 CÀX3Ù”oÿ¼ z\ÉúÖ|E_ –ÕÜ.çØ·o_jÿªûýÀãóiÝ÷8“SÒÙ7,_ùéE¹Ü;"ãü-Ó>0[Ÿ w–gÉ-[òäà–B‰‹sAOšuß3 à}ì¯ÿú¯¿”žž~â«_ýê×üÚ|ðÍ d%ÿÆ*àî<ú§áG?úѯð9y%àÙ±†Àz#  @ÿИ\è–ÿàÕ:åîOë}§¿^ @aJ¼l-H“I˜š83Ánü$ØïçwïÞ]à7uæÌ%üúRZsL@,›âO’ˆ8Á{qyÆž C ÒŒOLJçÀˆtŒ‰âÏž¤¼FOcߨt ŒÊÄÄTìí¶‘^\vŒO~ò“_˜5( tB÷÷˜yEÀl‡À!$)77÷;13ã6ШF`htBj‚Ò51!“ÚSÉ$#0ç þ͘6zGdzÊGƒ‹êUe»r¼ü"¦€]$|s³*=piÃÕ‡ûöïXdt2âÿK¿ôK‰ŸøÄ'þ+^ÿI¾a˜g˜€@ö¡þ?ÕÜ+ãjû÷L×—ÕQUûŸ›˜–ö¡qéì‘)ÕjX3"„@eeå? ªÆªW©¸:8(ý“ºÿ¸KÖo㟖º±I©ëÃÜ1H4€iü6Áž9>K­€ ©@¬žûòÜXVÚáXaÔ¸Gy$áïþîïn€ ؾR°ìxC L#ŽŒKkÏœë–)•þ}*„0Ö ÌNÇè¤{‡Dí‘FàøÀ»õÖ[¯öð+>w,0î$êXãz{{ãIñwsØC ¨/\΃ãr ûøˆ:ø¸‘â@úHxÔŽ³ã8ù¬‘F 99ùwð K¥¡Z€Hw+ì÷@AtT:ÄüÇå+_©¤<ä¾°#k70–‰€†Ã©W|; @5±ÿÃ㦥ÂßÐ=(cã“ä8ò7óÌe`‡ErüêSO=SZ¿3ó¤ÖWâŽ;>áuf·7æ!0‰4\ì—&’äÄJ~(}D>8õæ!b@FFÆß´i“愉-€ß]EŽô_VVÿ¹Ï}.Ÿ”¿nüÒ²; # ÎC£cRÝÖ/— Dü_ø@?}«€KŒ·«X†ñ°fDüÂ>ó™Ï¼oV à2‘îVXïïg`žô¯±žØx>V4íâ†À ˜„à÷ŽIÄ°‰D@äÇ]á¼yøL@'æ­{08j €7gѽ&/À_ONN†šÒ#‘Ÿ¡;yñxÿ§&%%ý’_'ÒÆåMœò¿¤Åm%;^þçÍq¬¦×0m8`ˆ½Çj ²s6Œ/~ñ‹7>|8” Øø^lÐcˆ#Æ3´¿n¦vC`ÙŒ¡ ¯iï—®ñi™P~U)aL¼2Ãs¹cPºÑLY>€e¯;0¼`.þ?ÕÀ]\3€+H†÷Ƹº_wÂt|ñõõõ Tüûãàk·4E@ÕÿC¨¿Ï¶öK»ªÁcÊÓÌÏ©ÎA´Ã¢ubjø‹® û!Ò¨ŸØ³Ï>«!J?ô¥ôėͯ €N–Nš3Ÿýìgó ýÛìË´AyQ-þƒô{©{H:´øOŒQÀA¤þ+ÃÒ50&ýTA´p@Ï.eßuే~Ø÷f?2®ôï0O<ñD"•ÿÌöï»GÔûRé¿ûãÈ”tÆ‚÷ÿUS†Ë£\†ïéÆ ›Hc®ÈþŒùùùŸîëë e\º±>…ãÆ~d\œéŸzÏñÄwþW÷K{7¢>¤ÞÆÎ!éÆñ?Æüÿæ¦`E]ph\ÚH ìÿHsöQŽãMŸúÔ§ò)§~JK”ð]ó+àLØöíÛãÿê¯þj³–â»™³yÿ×ø³m}ÒC" Øm" –DHa͈î½÷Þÿtûí·ûZ à7ÀUÓè»VüKغuëÓѲ ¬†€"0SügŒ\øÃr @Ï„*ÃcÂõÿÚqâPGUÀº®!§ ’2FÖ h@€*¿ÙÚÚêjüF+ˆý8(— ˆkooOKKû­hXLÖCÀE@}ý´øO'Îoq‚Óxø˜mŒ½q|JÚ†&LÌ ³+!êN(`þ¯ýÚ¯eбÐpÀ¨ëçZ:äW@Çÿ‰O|"‹IÌZ @v®!°Þ¨ Ø7"A2žÇ n2–4õ8@‰ˆè²|ë½ÔìzkDà駟¾ëÎ;ïômN?1®ä¯ïq·Ýv[£>zÏçßN7Öÿ¯mï“ÚžGñ¿î7ðاyb{IƒÐ@N€‰Xõ†ôØœÅJw‰øÏä5(}ñMSÎÆOÍeâFFF♼ûip6ï# ÒÿÐeqþ;Gü¿L¡ÐÃVÍÐ&—ƒ2Jyà”ä‰ øjŸ™cû×s>þ‘ÂÂÂPG@Ïázö“À§Ž)îÆoL¤Ýå~iïч€CÝðcÉñKÇÚKÌ{ËÀ¸4ŒBüUýËÄ_—%ãï ÈàÈXLEèôkDÍ 1:®Î Ö¢ ?üÃ?¬ª¬¬tµ®mÝ\Uü¸“¢ï:¦øüã%«BÄNÚ4äKãà›:ú¥oø!JÂNÆ@>xUÿw0ÞvœÞj&Œø;‹ *d=4ŽKc0…~oêì8N*価iêì—zLBÁž¡˜»×æ–H²»7oÞìj\šé •ßL:9Êþ&ìܹó6¯-´Xé¯únbàÕåùêNÙ™Ÿ&ûʳeki¶ä¤'K"&7¿ª€•ñ©CÕÝñS5w¬Kÿ³‹~ ‚`ÒÞ;,E9i’‘šäËÇA ÿ$k`h§GÁ3]òÒ¥  Q êž÷•JyA¦ó ø*++ëiLÊ_£ë}á]‰¿/ž\?1:)úrìÿÙÙÙVý0¢­© ¼¤/Çk;äžh‘ãýc’ß>(Ûê»eO^ŠÜ»£HönÊ“ÌTeâ„(Žhªû£cFÕ{û+ªn™¶Ä7¡`öãXs´¥( & ôïVU¿2¾þy±©[εôÈÉ–~9Û;&Õ|7mi$#bÏð˜|à–J)ËÏ’¤DÕ:[‹4jJžuô]8 €xr8Çá¼ñD¤ŽÝ>ªþ®kï‘·.å¥+òjïˆ4³)^¤NÓè˜Ôcï™$+Ü€ì,É’ $¡B¤Á$Ç wþµ¼ø—–þUwMÏ°´ñyFˆð… ±.ÓÑGB¤K”¾Y "RrB¼«m]—ËGì"jãïd­wÈY%þíCr‰5pž<ç0wŒ+w 0ƒShê“œÔy`_@JrÓ%591bý¶¿‹ÀG>ò‘Ì×_}˜oBµz€§`?0®äïHÿ:AýèGSgë9ëY‹Ûwï ‡ðÿ´¦Sþ©¿ƒMÞy~؈kžF%Ú'÷¡¾ƒ×^ åìÄ,P”“.é)IŽF †²ê.(!Pû LN7Ìã¸ê«ùìDà臼ļ÷â¢~ñqªòæ8ÕÁU¾^>µí7v ʹÖ>y¹¾G^Ǵֿ͙CügÆØÀó0Ö?*i5ÝR‘Œ‚hZÊ`‚““ü™ˆÞCSûÈ#ìƬÜQ]]í2êýâ]õàŽÎaÊÊÊâž|òÉ­î—öyÔæÙ7<*Ç®åÿ;Ý‚ä? ñWÆ9„yv6Âi鞘’÷MË[]²iè¾²¹g±l-Æ?€M1)!Aâã½IÔÓ»‰”·]8{c°v½¼ ƒšhT0‘¤èµ,jãWí…2{êÜzª®S^«é’]Ô}€ñë„)šÖ諯rn;¿¿ˆfLNµÈS\ãθ€ù,ÕFU\\|7´å Ý|Ü×B³¸Ñ][Óýü¸€KK dãðšP±“× µ{·t 8áWÞi’—{ˆôB%ŸÐ›é5À&8À{ïÍ5“òFs¿Ü]–%+reϦ\)͢ñà9ôŠ„¨8ô! žÆöÛÅÆNé»ÐaÛg‡*2ÝÒ†Ü& ?+M¼Âë©ÄïF¶Ôµ÷Ê…æ^y¿–3Øøë(w¬Q½ºî—hº*Ú |±Gdâ\»´Â ¼ÿ–Í ùh¼Éú.1hüœ™™ù mmmNW}åà7 n||<.55õf¬)ßwQÕþWZºåèå |¯ºC~Fœw{ÿr[?çŸÁ[ú¯Îñ^9Õ1$»ê»äŽ-ù²·2Oò2Sg¥Äå^12Ç馮Ò&“íÃD,ƒÈô8Bw(d_i‚ø·¡6ßY‘Ç_ÑOò4—…2w›»åÚN¹Ô="501jã¯e®ÇTÜ×E°Ì¦Ê0õyMYë>)¾AÞwS¥á‚9ÀÚÆ#@yà2ÊÊ»*)×9Eç fvãû½Ôý°šÜBßãêêê)))÷,5pû=¼(ñoíê‡øwÈ«uÝòT Ë€®é»á(Dàu¤¨sÊ  &iL/ÞÒ› 3¤ m@~Vª$'b'uWÂ5‰ðŒa€þªj»f„¢7ºÃ[[)"#š žZ)1šUâW5¿–tnÇ¡¯¿SÍ}ò ’ÿ…áI¹¢&.òXí\s^Zƒ ü!r{¥,;(·Lá!©Iæ¸àâ ó—=ôPò‘#GÔPww·ÑwÏ>Ð^gB'A?Çíß¿?Àl>[‹Jüûñä>…4ôí Äú#uòݪ7CG‚š–ç7G¦äT}ŸÜÔ: ”fÈÍ•9rcU¡(€tÍ4ZBuW˜‚éï!Ø;$-¨s «% šÏ¼­:¾Õ 9+VÃ0|É„ÂEË|*n¿ÿöžA9ÓÐ-ÇzäeBúÞ’~4\ʬ~­‡ ÍuTð"š€À™6‰cmkhìŒ ÌBCÚä—Éÿìg?ÛÇÍ\G@OÍë €;ññ׉yàRÝ/í}ãÐXçvÔ·ÇqøûÊ;ÍØü‘ü‘dÖIfSš—£“iiè“Ÿ‡äVœ¬îßQ »ÊsˆTe!s¹ÃDA „Úûõ]=Ù{¨p§Òáðx§F%ÖG@‰g5Z’€4H)Iñ½™ÄPÊDJË£s:ÁÚVUk÷ œ%ÏË—»å4ÚŠR:+¡Ö(†pˆ‚AÂ#_Ä|¦Ž-˜G»¡Â|_BaûeÇŽÛ¶lÙRW[[«[K$¶—u›w2ô=îöÛo·Àë¾L–wAÝ$k[{å(Ä[å§êíϦ¸nÄ?¤ÃŠË©dzõú6ȃ—:ä@i–ª*-D ¨F`£2 Ò'Ñ‹†}5C¸;¤žêv—0}Ô‘ì¨F Rã¨[ü'd,ö1irCä­à d©CÃÓ/•˜z ²R$;=…BA‰ŽF`£v_%è÷.ü7ÎAôãÕ_”+$í¹H9çV˜Û1‡ê‡ƒôÏà¢k« &à¥nêHŒua›$YÐf)ÉÏpL_¡èÙçð!——··´´ôe€P @øn¸WöwèСøªªª€›Ýâ*Tò× o]j—Wj»äg}á#þïÞZÕé"Ù /÷H7*ã66æ ¶öƒh!ªÈ(§žä©3DãÝóÖç“nÌZÀE‰~7’¾†}5ïÝ3ÒLQe_‚HTã³0¤‡E>\Ÿ±DÕUÀê ÌÒÏP«w!]—µôJQF’g§J 9! y×TÁi)‰aK¥Ó5Drª.汉ÿ"}8K‚ªS0&çXcW üªåYUÿ²Àǧæñ4¦µ´¦^)Îl“;wŠ”äY² eÁ·áxËÄÄ„oˆ¿Bâ@ÇáhrssämÞ­_XÛ8ÔYK à‰šyá2vÔòá’ü±nƯSPèu˜€ø<‰ ù®Í£²Œ‚ê(˜Eõ°'ëž?Ž_ÕûêÙ¯ùܵŽ½JûÕ0@ow Ë;ô¡ÇQ|(Xƒ#Ø‚ƒ/›ñ•h¦8Ðó#ýNÈä¡Ä8ÙŸ•,‹2dGq&Œ@ªäg¦P;"eŽXÿõ_Ñ"=ê´©á«W(Òsç¾HPu„8þ~Õàl(á™oî«É‚ÆûÆ$©:(Yc+Rjš€Â÷‘ì²÷655é B™¥=<èÞl^g\M ¾Ç)wÆ$mõæTx³×šäGíÜo_l“¯o’×\É_7Én³óe «|“Ü?#Ûàmy©rÛ¦l¹m[±l*œÉª¦„b%¦™ËÎØ€G‘L;ñünAÒ¯n(àvSG;Ž~˜ƒ!Þ=¼'lô¬-r?ežx«¶ÓcQêš’W ~™0™ÛRd[vŠÜTž#»Ê²¥˜”ÑYiÊä%HŽr+™_½¾cãg-k"õa9F­Š¹ÏÌ7õcØøÑô¨’æü£"ÓÀ¤}s ®œh–ÇÑ>Ý»·ŒÚšÃÃ9)ø ¤Å777;'÷réO8oÖk{PpÜIƒÁ8 7ì +bvñ9tÓl œï ªú}ýx36ÿ$Ý #»Iª6 ™ »y< ím“r’äCoÔ÷Ê}[ód/Ž‚› ³Ð$A$®ŸjÖ%ücØ_û ǪC<‰×÷Rº^µ¡ÚoFÚoQÀÜç>ÌádÖŽ€æËïç.ˆ´®¯ˆòÉ y£sDŠÎ´Ê®ÜTÙ¯Àn˜™¬‘)A¼žã 3S\W5Xš¢¹Zóô£^?ŠÄQmüd¯ÔŒ•á¶ñ¯}ÄZY“?ÅÔ4B”M'f¦÷ߺŘ€•¹ŠãqL8~ü¸jô¥Íe<ùàû…pT2ÝÝÝ€m3óbÿ†µù×ÕNmþ?¹Ô)¯(ñ×Øçÿùcž–z$Ȧ Ô¹¨ë{"ϵõËÊØ\ U%Ù’ŽS™F \ÝÔ]ÕÀMêÌ×Ñ'µ©©Æùë6aµë×BüáFÛ˜¯‰ßþžÙg»YZOá2¦˜DÖ\íð„œÃôs’ðÐíy²ÿ bæÕF®f ¡»º !í« §ÆîYû.à°y Ö|Hê¹öÆÚø¯îÝõÿVæ´izBÞé‡iè•Ì”FyÏÁ ' Æ’]»µüzàÀäçž{Î]LîûZ.Ñs½Ì¸œ—¨Ÿã¶oßÊ™EX?ß\í¤í8F½ƒ·ÿ+„àý3ŽQ½ÑZÚ–’Èl¹LöÝËäá߈¿¿sHúp.S_Žê4[²:•iñµÿjü¹VokĦiÿ\{¿œì–×°I÷ëÎë¾ü<ÉÑ>6‡Ð°Ùó¯ú]¼ƒV ‹°¼`Únï–]˜i¶böÙ\”éä‰ÐÊzZap˜è‘n¼ú5œ¯žc5Ï‹„hžfM8ɪ¿h@‡NuMÖë(cΤ€P‘û6‘,(ß …kövïÞŵ»x9Bg¸î³Q×õ2àbära½{÷&¹_Ú{xP›?„S ûü¯ÓmØdGfˆ¿ÅhnÚ=l§ç 1»BF¡cTd;Œº÷þª<ÙG-hR±ëØ1kœiì–籿 ¸•Pƒ!$Î1 á‹Þv˜2êG`!x5z §½âÊJ§åá-yrûÖ|Ç4 &@Ó Ãaõ-ü7ŽÀØ©¡óÂ8sì¹Æ¸5Á 0<-ò~>'ÀȪc ù¬ÿlVUU¥¥¥Õ ÍÑõ¿ËÆ]Ñ/ €#ùßvÛm–(ŒkG%õŒV›ÿWŽ6aó×ô¾3RXo»®—Vµî¦ŠË“ã2ÐIX¶ü½Wºä†â4©ÈÍp$þ l¦‡&¤³q™Œvæf]òþÅ&à{0ýô“,J ëԟ©Ú•“,9) RÍüVRhJ³ùqÜp´j¯–9ÓhA´Š 2§Ú¤߀§n®t4V@h™ .ó0r”£i>zòäÉP ô2ÏŽ¾Ã¼Î„raÂBô}Ö‚€Úü/SìäíKAùWª”½ìAâ ŒælkaóoÁ? •ðbös“ú¥…„=­H„m³etù4„ŽÀ>/…€2nÝú"žÿâ¨ÈûÒ1¨ƒhŒë _åš«¥9û»³žÑb¼ÊsÙÃúeyËÓ·h¡ + ´L —sÒ>~f®úßeôÝ“ Éë €ÎÙÜ$””ômmÝPµjñ·©ê§…}~ŒÃŸÖn÷èšÁgæ™mf¿l&‡€‚ö]û¾'Ÿç±ÙÇ9 ôCüq)y&¬¹¡þs‡øâcjäYÒB˜·ÊrÚåÐÖi§v€ú?X[;„™ç'''»4gíŒð¼Ìè$hsÞËËËdj²"@3˜¬Û¿*ù÷’}ìD-%} 9úw<¥û•©Ÿ$cqšuƒÍ.8DßOëvc3L€Öˆ?×æ$¿RÇG+ ´V«ø  ˆ_.àÒ U\):Nñ2 ºÈÉɉKMM͉XýÑ '>ºwPŽê÷ÕcÍN¨ŸCüý(=ùcÊl†€£Ý¢íx±kD¦ÉÏÑŽ£îÄ–æeâ¨Úkk«E !!¡ø*À¥A«½dDÏó: à9ÜœY /¢húèæ*ù×µõ8¡~ÿ Ç¢ŸRÕ/’üøbŠ!6Ÿ|´ç@u‡ôcâzÿmUR‚O@%–­­øøøŠžž‡æp—ø»{N½ä@g2 vœ3òW7­vV(*ù×µõÊëÕTôÃCþ‹64·hgì³!`¬ ¥FMhIl”ØØ+ùÍr÷îR)εB«”“Д÷ööêé¡Äµ—‹øy^g\Î+ ˜€¢ˆ#êñ(ñïì%NúJ»¼Dü7ȧ? ¶SÏ›ußXžÝZ˜€12¦^ìÜ4uÄ10?ËñXðûrQH-ž™™hkkÓc\&`Ñã£ý¯3sø37 œCdå”ø÷RØçÈ¥6ù'›Â>ñ7›ÿÊÁ´3 hA€ç·sÀ ¤Jž>Þ"Oír×nu 4Ÿ€ÕLQHàjNªs¼Ê¸’¿‚é|VÇ ì3Ƭry©Í¿1Øç$ùùê±Fâ‰)„ÂwÖ CÀû¨9 u|\^ê!u2y<‚¤~ú d:鑽?Âj¸ÛÕ¯ëÀ:ÞÉ« € N‚¶ÀÈÈH ...wæOûw%(ñ¿ÔÔ%G.·Ëà04WÒw%±c C ªPv^}Þ"Çé­Sä±C•RfÉ‚V0sqÆá.°‚3£ïP¯3Š¨ÃÀPÕ-Þ­p©Ú¿•ô¾N’ Šü3…rflþ+¼nÑ€ë€c`6I½JrRe_ežc°*‚Ë›¾ìììÐXJW]ÞÉQv”…4Ð××GÉOÓ¬d}¹…}Ž×´Ë7Ï´ÉKÄ ø"ÃßJP°c C& yŸòÄQ@èƒ<ó‰$ *&DÐ -½²²²L°4Lr„«† ƒAÁ Ð2.v%þ*ù¿s¹Mþ_ û¼ŠZ°ß)ƒê¹PÖeŽØ3 PÚ&Æåy ÛNâðÛB¾€÷ÞT)%8&,ÈÓbmè Ãð¹  @)ø"/kæM@EEż¿Ã0ï¾¹¤Võ»ÔÜEaŸvùÖÙ6‡øw9Äß7C´†ÀheÌ–ñ1y¹kŠ‚I„ RLè™[«M€% Z<4¡™”òÍ„æˆþI½N}ØÀ³¬t¾›¤—:å«Á!µù«ðoÍ0 …`Ó¨™˜¢Šà˜ìlí—»GÇ‘lÓp¡¢ì¼oL~ádéééfpWèUï©8õd`¶Ú ãj¾Wc†À‚d°£¤'JrÒŒSà‚Åà—8†ÒMOÓÐxz*Í°ðôÅÇÅÉ–’9¸)W+ÉÂxe^=½f¨}kë†@A ;3’åÞÝ¥’žbƒBÅàn¢žßH}Ãà˜áùÉYcëö‘çØ)ô±£,GîÙ–/‰¾Ñ^­Fv!CÀA .^nÉL’;+2¥ª$Û …@£¡5¾ÙD½ÎÌ}Ó\µJCþŒƒ P'žmÅYrGAªl1& ûh¡䲫îÎI‘h ÓS“œœ¡¿Çúç´´4ß0^uœ#ü,FçsJJŠ×™™°>Wú —ä¥Ë¡²,9Ú5,u1Çž°Bn7<‡@b Nv$Æɶ<†Ò ÿ[x½J7¯_ˆfÏÌP¦àšÆúªÈÉH•;v–Ⱦ¬$©ÐHµX3 C`´ÛïÙ”íHÿZH}ˆ¬ÍG @"ßøbóô 'CàüY²¿®A@ë}We˽UùÒ9:%T›žš¼æ8ûÂ0b$‚*ÒÜßÁþ°£<Ïâþc` ø†½3'À¥W+å’‡žƒ› dwnŠlC  ßY3 XG ›ä¾ÒLÙR˜%¹™©¶7,²$&''}³iz™˜7 øÌû{‘¹‹ù¯5‰Õ&ðérCF¢¨ÍÏš!`Ä6CUž/‡pü+ÈI“”dÓ¨.¶"f¢çýêYÚã'€Q²ykrá?Ô ;ßÊ|é—·:¤alRÈhÍÌKØ6ïUŽ.do ù¸Ê‹Ùiш{B9‚ÁÎìd9XUàÄýÛT/>Q8O‡ÒOCå€0ÀÐIY|öì{²½Õ&A˜+°L£é0ÍÑ®ÔZI4Ü™Øq³yÏ"”+›ЙðÅi|—‚„—ŠƒW2ß'°áÃÎ4ÎâÜ JÁó¡.üàø” Qfˆ÷^=£Ò9>)Cü61¡÷ƒYtùE½ŽóäñÁüIfAõÐs¶ ýÿ®¼9´­È!þæä¡ù[cWýÀ(4¾IΰÆ9]Öé M´Sžìªé’z ~ti=PkÞ@@§J‰?t·25Qvå¤Êž¢LÉ#ßC:BÉžÒˆúHås™K™ï$^ññ€ù:¥åSÌý$×G4J!˜1ˆýï؇Ç&¤×Œ€¾za»Y/Ý£”Œå÷~  è5f˜‘Y]†Àe6¼lLõ23xSV k'Ã)ûë£BwáœG]ѾXÕ~a$//Ï€.ù ˆÅVêìÇ!ðlïˆté®”ÅZT#àÐýiI#F;3=IgȃØnï«*”BT¹)h”Ø'*±ç}µ;•Z…Æ©9 q™˜eFÆ¥­oDšF¤µDšûG¥¦oX.óÝ¿£1U&BÏs—ÓÜššíÉj;Õ“â½Î©â¦ˆõqëg&Á,´‚ê#d-vð à§ü̵ü!9„ûÜ»«HNµI}×ôN[^€ÂÅ÷ Æ!bC×%éþ^<¶ßG±–C¹RE–ÇdæSUûŽ|ＯøóN %.ÿ1€Øg+@pUÊ«äÞ¬˜ò¬ 3å©ÝÅòÀö)ÍJEÕ?#ñ‡«'*ºFe>Þu ˜¹cvJ¢”Ñ=ø”ŒMâG€¶ {hLz‡¤®kP.ûåíÖ^y£cPF0!8ëKÅÏ™ ‡«ÛvÝ%ØùÄŽÙJÊߜ̋û_/?þìu@çD·¤@FF†Ʋák,‘13-In¬Ì•nl»/ŒÉè†÷Ân¸(ª>ç%òn¢˜Òþ>*;î£J[en†$áØ7Ç/z‘ðþ jã$85;¤;·J”ÖTIf²ìÌÏ›è¯fŸ¼Ò9(u¼jÐ œé’+h &]¿9¯ÄðöÕ®>ƒ@xoOO 8O `Þ,åïŠVF¤¹uözû†h’ 8ézµßG /ñyÒÌÆ|CsŸœVû­#v.~’ý>zÔåª*Ï„¨ e;Rÿc»Jån²8n+Èt<ü£yR§Ã¼´dçU06™#ÁQ¹Ä4ì“4%m}ÒÃÙ‰a΄΀œ±‡Z»²®­€¡ùÛ—Ÿ*›‹³’ –EÀ7 @\œZ,­­Õ”çgÉîòy˜ :XÛ#5˜£ïj.hç¬i¡+D>Nn…ØßA¤Æûö•Ë.TìêݯóÍÄ¡Ák$‚š+ŠpR¼es¾DHßû÷–ɨhw ýgagW»—›š â0`µàÓIèbQ éH£³é.7ßl¯Q8[ÿƒ)ñrcaªØR$ÉøX‹]ü2ûÓ¬qkD€:Ý]–)­5“r&ÀÂ×êrNWs Òo›ñþÜ4¹Œ·ËŽâ,Âú’%ƒ¼ì~¡‰šg  Ûÿé–^y­6(Ç»åÑ'sÒ¿âå2ËÁÎŽY0a7ö{Ë–|Çñ/Îj¬ ?Žîèèè]ñIQz‚—€y{"&/%*–G2ªÀ<Ô´7ôfk¿ÔLLȈmÆá››Y? MÍ|€d,‹3ås·cç¿‘¸l‡ðÏ[åáëJ¸¯<ÅX»Ǥ¹—¨Tÿ/£úÿ÷+ÒD1Uýƒe ã,o"0ïŬ´`GYž¤ð¼ûG™F쮺taaaîU_yöOßÍ 'G©gç!*:®›AZrªÁÙUÝ.  :7¥yŒ X¿ R,•ªOS‰‘ǫ̀õK þí,–ÇwË.¤þüô'&[òzs³ vøÿK—ÛåÕún9‡Ô?JÄétçðî?ÄÿE{^k˜õ¬‡r®ÅŽì,œ€ä#¥ï"Há«Bùvþþ‘ lû}ò}Âú~r9(G™ë ¤æ)ü@ð [ýBÔÐÔd’–d~º<¼½HÞ¿¿Bª ü©aªJ§LY.ðñ½e2Lh`Ú¹V ÖtJU.§}KRŠãîžÒL)ÎÍŸh¥fVý»ÞøCg¹Þ¨Øõæ!0Ɔy–Jn'H |”|±hþW⟃]úYˆÉ/ßZ%{‰í_Ê;}ˆQø‡Òå ÌšÈçÿk¨ûÿ"yÕ¯ìѤ×Ô¸FSQ×ÙGn„§w•`ç/”ýZîXý% ÒáÔÈëµ31_}ðàf©Ä,Ÿ™,ß8Õ$Ý06¾d°šÒµéxýû–ÑYÓª´“g0À–ÂuPÑK‚—×/¶ÊÒw8ÒŒ9¢ÉAm};žþÿ â¿ÇÄ_']¥~ÍÙÿÝ3MNLÿy<æ›`F0÷L+Y^+e†‰À4ilþ³þ§ö—Ë6êä¦&#™Æ¯ùò×]¸!?ê02ŠoÛ\(ùÔcпÿñT£ôâà8ã°Ö†Ü,ÒáÎë1y¼Ã¼ÞµgȉýO6-ÀºÎŠù¬+œv±hF`dt\š‚}rŽ@­ææu‰æ¯gßTžm›‰é§*%`š|Æ«$C‡Ô‘oí–‹í½òÊ¥6yµx=itÛ‚È*5®v€zlý ±›ú·â(yi_3ö)ã”A&¿HùK(°­ CžÙW.0µoiúà|\%ÇjÇ<»F¢â ì›Ðn\ìƉ“| ™8Z°¾3c>닧]-J˜f3éÇö¾±K.i*`õ5Ï0H% r3ÞÔê—M6ºµz©Gbº•.«6§‡ yÕ¨øß!´ïGdÌû19ü5Îß!ú¡~!ÌϲûË9mž‚º¿<=EoÉ'¦¿Ø‰’¨¿hÀMÍ·b‚hèÂáqB‚£=Ž¹C£ý²´X³µDlœ®ë"r'[rp†Ô|Ö «0ÀÕˆØßs !)6wöÉ ÕíROàXl¢n(D’%'ýÎÂ,'1—pp ¿Æó×Q=ïG8ø}§ºUNãà7ŒÓߘ¾u°ókÍã¤þRbøwgÊGoØDß’ò$¯*¦?œ§Ã¼ÿ@%㱕7Éw/¶Ëf‡ ç7ìÚÓÒÀ|ÿøJ§ì«Ì“<²*à—¬”c ÜÈ€˜äÕ QCÂZ þç±%!î¿u<¥¹µñBÕR<¦úwÒ÷BÔÁïu$ýoŸ‡ðó¹SÎ8ó»&U¿»¨¸N♂jÿ½„õ=´­Ho+”-Ô@Pu¨RÁ=%ÒïÊód ÉypWI‡’eµý£Ú2jŽýÕû­›dM§4m3Ïo>Ùêûà¡yr¢hÆDÑdDKWTjÃŽXø…^ZQã3Í·úŠ­ })~ÊsÒ¢B…½\ôÇP÷;‰|ˆã?… çT[ŸœÀɯâïHº5XÃ|*Áÿ9HÑ{Š2ä‰]EÔA(ÄÆNø©£YRZ¨æœýÄÊÿ"™Ûð 8…VdÜæ|– v”× C£ ß&j+ì¨(p’y°öÉ Ð7¬”1k_¾»Â´ÆýŽH‰SŽHýª„b ÄÂË¡×Ô´šQÎ ›§þ^¼À›ˆØxår»|›¾ç±ù7aûwûÖ*’;K4È”>Ü &»ˆã¿ß-{¼‰æEðJSgÄL·Á¸<ÔÒ#˜¼Î÷£a>Øâ‡aNvËžãža´4š¦Ú|Öº>qôÍfh ÀZWƒÏWg±š–nŠ¿ È«8ÿLiâŸk³x @Z²ÚŠÕó?z©‚vw­McÏ€¼ºÿ?pðû @v~ ê[³.~e‚²È3¿‰LsO¢î¿L~·ãᯱö^¬6§Å†J±‘ˆ:ÍDFôÖ ùÒÈmÑ;Ý3ý[âß €wF&åÖ®a©mí‘BÊ&›3à ÅØÏÆÄØ„/5\õü—c³0ŽJtvó_ê\ýŽm]y*/ê„(ÿÕÖ?€­ÿ röíZ9ÑÜ+µ½ÃÀqÛB(Ù*ç2­P‚JÌhCž&âÏáä· ‰_%èdÌQ Ï’ËR™€-ùY”.“I˜¨¯‘ ÉI´J¬–¼á0J^€ê®A9^Ó.û«Š(—ï)SÖB“·2 &§}ñAê×Ö5 '›{äìÀ(šì‚‹÷º¿¨­|mÈ8/•¦¢±ißêÙàz¹U¾s²IŽbó bçÕy[ª áW…gõîãü.Ò ¦än9Ò¤VÞS¦ÀËM™'Í„øN}‡¼r¦?¯Kþóæƒñ]°­_Ú»HÀ”hyæÛÛóÍèÇÆ kë‘:Ô 5Ž9vÛ´LBø‡H†4H‘äé¨1([6Š´ZM•¾£uAù¶þâì7âÆô;ty ÌÛ¬C¼¦”½'¿ÃØÉoÜ”+{Ks¥ÿH%óYϵ¨¾šéêñ—/¶É«” ¾DB¤ÔÖ€Ýzvr­×‚¨#W}?~!ÔyÐÒÀ–h­ úç|cü3—k‰ý“3$‰iÅvƒ–ÿk1„ ö@(ºIˆ´Â-Ò¡j$»åûgåûç[äuœØ&T_'‰<…ëdá%_Iáž'TÈã»Ëœhˆ-Üs-JžùFɺjMTê?á×rÇß=×"GÑx C,ßðÌ–ì¨:5j–ÇjLC{*‹f+zy—rX°(€°Âkƒ#£¨ÿ©ßÐ#µšö— 1ÖÛ4Ä¢‘<õ]C¤´Í#Ó]ä7ÎIµVlü÷ÚEyþB‹œåóvìµ6Ysž‘¿ƒ¾÷m-tJï.Ζt¾ó²Ô¯+YqÓì—HmýoÔ?x•ÿ1Tþƒ¬õ ïËâ@΢ =0 ÏœCSÌ*+#ERÉÑ`muXÀêp³³¢®¾!©nÂûÏÿ.§äŸ1*òŸÇƾ#Ø+L”Q\eí„v­Ë@5/_n#įEêלX«­_ÃR“ Ñar#ÏÔ…_ÆØ#{ºoÔÉí‘GVÀÔäì°ÞÒ.î Ìày {/'Ù :‘$/¶öJæü×]Óè¿#6à yI±d1•‰JY‚¡*ìú¤6ì ·£ö_é\9ó‹ƒC)¦`Ì!Tý þ·Ò·â=8ùi&¿µòa_¸KÜ@±ª#Ò; ræö(‰­Î‘©o^B$ÿ¯uôyÒIÆÃzŠzm.‘¢,5ð‹'~6 &y©!ª4‚j4H”SHF=êHæHFK¿C !´WˆŒ¸ˆêX³ÆÇEV"VD+Û¦&ÊÀà”Œ¸RìR|‰Ã$è?IæÙHö•T9ÜU”%·oÊ—C›òä`Eždú€ðk©c lÅ©ïgT<|îTƒT“§aÈ-Œa&nßÖÈ šžj˜Ÿ=Ôµ˜€ÉODãc-¶0 ¶çßýêþön6G2ƽNÑîIuÿs¨…¡£D)R}~ˆ½]ýŠ2â KQÛðA§™ µÐŽJ²ê½^ ã6‚&€\ 7¦R{›HŸ“õ…gÿf’ßì-ʔLjé¿ÿBìÂZæ8GäF¶p÷Wò­Úù‡‰d©Åls¬±S~€ƒäO(wÜs«ãÔšàšpbo}k}€wÈìy+ÌlßЈ䒲9’ëx%óMÇš`4͆õeͨ÷ÿåæn¹‚š»Ö‰w½Íñº "-ÖbCþ.’äÃ;JœÚö9¤ÁTS?„ͤàýýûwË•ùò*Îl/âÍ~¥g„Ð@rýÏNŸòB^’~.R½ÆòßDîû›`bv"õkTƒ2©d9TBàe¯ ¬F5‡a}?¼@ÅCÿ1Uõc*â7Ç»?R%÷æ9‡”Ð 0G-0ûZ (ŽZÖV†€9® /;:ŠPZ¡D£–Â?µx»ÏQ(îó†w=R%Ë6|$~p¶IJ©®¶)Z3àEª%”” ÁÝ»½ØQá¿gW‰£Þ­ïtTßê }¾€þ²ÙkÊÛ¢ÌdÉMO‘,‚4Ì~Õί!‘çñ_yýJ¡}rŠÒÇ-0mêÜÈ #5MQv_’áÞÓÄ:®Ç©ugeÁÚKAGÙ­;+CÀL+ÃËWG«Ô¤yÿ{(€RÛ1(5ý#l˜±œøçúÓ;ŒÕKT×;DiàLbä·Pù.>‚¦ÍÂW Q/@}_EÉâ­YÒÊ\cûV†E+òe‘£?7=É){›Ï€zôû…j¿.lúêäw ¿7Ђü˜ù©Ãîï¨û•ðñ¿jQOK#øÔ£e$êzˆà¾ªsöç#` ÀéÛa¿rˆƒf¸'“Ü nÕxHŸGýJ+Ʊ©Z[õ¤>ß9(ÿrºÑ1ªçà=Ÿ‹) ÒR´ã¡ßU’(;ñäצ³¨„Þ!öü£ ~¿ìóÊÜŒÎ&h:ÑîD½×ðU͇ ê~uòs›-g‰™wü}.ÁèoÁ<ÒÑ;(ZÁ©£G¥@¿¬‘ùƒ¶¿CÀ€ÅñÉ÷*嫤¤vþqâžûÉhD]ÚÔÙ/H—I%{éÿMìÇZ<ÆÚu€Ž³C>Šy 4^?S•ä@|#½q:Ä^;¡|ÚtyŽá Ú á:AÚãç/µË¿ãì•QÖ÷¤3~°ó NG'%³µ_*ß¼$6Hqnºäf¦I¦¡d­z ŽÎ‹û™vàZТB8Ìk÷Ò7Æxi¶VÐW•ðÇð{©¤DlD__Z8¦…„ HûdkåÕ@žû6kËC@ÃîÞÔpÉ#5’Ž/Àã{+$ªxÖ‡€Úù»)jó6þœo&ŸÔö Iv~gé.Å)÷ /w»Ë}1~AM>e(Ô)ò,Ïÿw/É‹Ð+y${*HO”Š¼t©,Ìv‚’)C¦ež—Â6|Ó•WÆ Ð7vRc¢r‰­¼S3B† èHù*é÷’%N‰~ ªÑ&œ¢êy¿Ð;"§‘FQqvSÔÑÚò`CìDp³ÉÏ4K>Žvð¬/ͱ°ªåƒ¸¼#UÝß«žëg[º‰éo—ºœx~­\éØø"PÁ×{PÀ “@&’méŒsxÏiÓ¬‡)„ª…¸IŽázƒ0Í}ØÆÛxŽµŒ‡Ã8è=ºÏò†uGuëOHl…Ǩ¦¥,! »³ûegû ”å¤H>Ž£0…¬é¬ôTDIÁqT« ªÙÀš?0À£ó¨ªýI{LLM:I=FÆÆ‚ßJŒo-)OkPíŸ'æ÷žýuh¬´<¬š¦±ê¹1Ûœ¡/5þ±0äã<Ì ƒ‡çª[ ¥ŠsˆÇ EHR)ž/‘;oœúC×è0ÄX3'žÿ5êÙ«º¿¦ËÉw ÄøjB47·Iâ÷dBܔȧ§&‘,8K–0?Å$?ÊÁ!Rë$s8˜%ôª1#_@Ç´ ©0}ƒc2 3 s=—6x±5!¬V}[G2)A.ÄkòTÇ°ÄuŽRïbZ¶€Ý®´DÂF³d¡£e„Œd§K~vš£ÐPTÍ4ñ̘«¿(Æxd8¶|X%âãHŸÃ¨>5w3vü2ÔÕ±1:™Î†&Èq>-ØJûØ´:yO;>Ñiº©„)'ÀÆG@¸渚W嘙½|†!˜â7Ø£ÙDA»@~ÍÆp«oØ‚]ú4Õå>rËV)'n¨ÙOÀ•5•ÄÈœS#éÿëÉzys¶L¯Jè:kî<ÌããtnÂ/dIŒ—ص÷fʾ’lÙO cØÈBÕ‚×»¯wmÜ3ýÓK)_ì.‚€ªû›YãGë;ä…Ëíò}^Aû ©¦KvÀt&cÞ®s³ ÉþVê<²³Tn µq‰Ú±!úš¯!iVÒ_î|¨o‡úuh¤{É–ødGŸ|çd£<_Ý"Ç™gG‹¦”Χm ˜;Á]…8U0Óïi …½Ö2 YjJÁŒRš‘(;J²ðÈÄw C ³I.Ehj*ø©éÅ™ O}4 kÆ[Ò!øêÀ×M\w¯ì÷šå¬~3ïõ¨F/"í·BMžýJ Èl”F@ÐãÙ ¶¿ç&-t£±òy¨€µÎ½&ÁIŠ'„C7)ÅP%ÏÔÀG¯ªà$@1oû^ç ŸRÍ‹s(3ÀÔ1°†á â㑆îÙV,È«¿™Šzjg¶¶8ê৅N7wÉW‚r[ÿɶ~©a«T:+Rο€Nÿ+¶Fï ¿ýÁòÙ[–K†ÃL'ù‘Jû«-ܤ´]™}¥AÌÒ!xé\¯’lŠ/i%ÆÚÎÿ3¡€«PÑæà .ðŒÈ€H6mîŽsò.l"ª ¬€DSÅ9©¼2È4˜"™„Éf¦Í”V&Üp1Õù¢™ ÂÓ¨߉ÉGz×ÄJ`Ô¯âÓŒ=ÿ2öü+ÄžŸé–H¨J®œÍO7@^&íÏŸA0Ñä<[Ù|¶f%/pŽ@ ¬„Aø$«óûBMM,H>g„ñªCÚkèÞwSL¦‘ðÉlĪyéQâäÌsÂ=Ç™Ž³ê™~ªQ‚Ìa¯ÃÛ¦¥utļ©ç#®Ù ûa´”±½„ëGçZäŸ.¶Jævü?DãšæjãW‡¾¤D¾kk¡ÜYU({™ãŠÜ4N[àœk.²ü/tÞ4¡ÒA´ É0• ‰qÒ³÷æõCô¥˜»<ºÞ5/ÒËÇ“0';‡P K ç”ó(ÊM–ýs›×4:pfÁ”=¹½Hcn¥Š¡:\ªŠž©Ú¦&½ç{÷•cê—o¼S+uôzÒ†t*Šn¢3×MdR7¹E´é´Tä,ᆹ }’ c“'U„nÇ¿¢œè‚^Åhç´8QÕà(3­ÍªFëÌDq¿Þ `°G`èJ ÔÏ u惻ËeŒÈ›8µ=GûwÈ^§9ìÕ"ªŒÀ4‚ëÌß)LÕDyüË™&ÙƒÄóf›7å¡Èt4 .#à&¬‰À°V|Kã××~,g ú?&gÿ[dñ;B$Ë e4ýô´‚µ„Ö^9¡þ›H4ó[$Vz{»jK4¬o=Í:+àU'¨IèFÖÝLù07šµÐaö®:Îþ\uŽÖbdƒI““3¦‚¥ÏŠÌ– 2¸{ü®&ñ¯ëâpwY¶…N Ú\ùÏ·o•{·•HþmM™Í—¿•p·[{û NŸcÊàX[#ËX'k¼ÃZN·<kA/VÏî5í©YQ ± »ù•ùòÐŽbÉÖŒ{Q´ïªŠZÃÒ’óQéc¢H¥s/^h‘wš Ä„îÏ©¿õó¦ñQ©E=Þ†o@7Ùð4ÅóVÌ eHÁê'P’•&ùB7Q¤Ç«öûAœºÔŸAZëÑf\DÒ¿ØÞ+'°‡ƒø;±üÚQgnøg‰g@9«°?Ž—ÿa4"‡·áh™*ÿÅÕ(ƒ²&৘u4úÃÚˆr M°ÆùµÓ µ  ÅJvR¶t?êWU·kH]4¶´ÛpËHJ ó ÑHÇu„D9æO—iqˆ$êq¾lÂQ°‰Ã,€ÉÙMb›Ý\㪠êµJq’Ê%~:•$8n^{%BÊt„+ÿºîÇN+’¼fKBÚ€Yi¡Ÿš)ñ4¹ò_!}¯Ÿ Â8ƒSïüD8¨_u•ænÃ'â=û*HîS ÓUŒÝbk,‡ù¨Bsã$—ÒäPÖüŽ@”³(ˇß|–•%dCHß··Tâ Ñpéh”to^7TM¬¥UßOníï.²~áH4¢.×üöólƳŒ€ÚÈu‡éÀwàu^GH(ô­Ó’C°mÀ6˜‚Hœê…^‚Ù —HM2¤ùëgiDÚL÷’*†»‚¸vÐÅÌÑFð·ã”ÊM•|ÍÄ!¹‘©2S•¯›X÷NÊK«´^¥|´qð«Cc130F•I§Pý:èÇÓ‰|ü7žÚ[&¿uÏ.TêY’©þn'µÃQܲ™Íz—L4 j‘(î©umðÈÊ\z´¾a~|3)KO[Œ¡Hf–÷v˜\û›Ùt½0éJŒUZßIæ:µkÄÀ_¿R-ÕxŽwŽá¸0ÅT‡9u‡Òü#Hß}HÜ>øvýŒ ߇*!ø£ù†@jQ¡)Š[”w/Š‘›ëSœ†ô7ás¥ØÄ•¨z©©g¿ªõï…yIBæ~ ¿€»Ô& „ NiXÜMW&ÍQi{@ã p°M#Ý'­¨ÜëZû$‡R¸|%JúRâ¯iU=¯iˆ,”P³ÃÔ¬j_Õû£Tž„ÀkeÄÞ{ åëàs+ŒÁ¿ëñŽƒÓ]%üÚéÕ­íx®u#)bß·§LÝ· É?Ãɯ° Q÷³ÎkfžB1F‡)Šº^z©C«[O5Âœ8mŸ4ß0>™ÆuÐô šïFìáú®’µ×šÚêÕŽ%f•(O@<t¡Uê°kæÀ%U:äÐqà ¹·Â ´’`ê]b<{-=–{:çp?½¾þé6Uó;] »CÜùByéÐ=8ôznèýÝ ­ð]Õþ[©÷0Nœ÷Í–ïMañbÓ9M¥@PkÒaI»Œ½8&ësl àÍ'.6æÆFŠÄI+ê•æ¦ÊìèšÿÝ«M—ÂŒ4Û”I 6ý!$ëþó­ÒŸT§€•—;DzD”9µŸ¡ósGÎÝköà ÷æ®±Âêí¯µäïFòÁ›·ÉL:Jü纲ÂëEúpO5±Ì0:ŠPî)Ò½³û‹#àÝ]tñ1Eç/¶'¬m^`ª4ó^ÿ%ÙéNƼµ]0²g+½ÖLr‰døäûœpÁ×.·;¶v-(´¾í*ÒzÕŸóîæu€ )CU~;…|~‡?eæR=Lü]ìÔ¬¢¥¦íŠÃp]d÷,{_0¯Áï£_®÷N£0Ú°ÃŽ›j*ãaR#P&ãS&@mô;Iøó›‡wÉû).³ŸÌ†q~ %ƒøçA$ï'}îoÞµCv•@üñéð©T-@ºSê™Ñ Çãb× ¦¨vÉ0 Ñ/ÄÓz+©rýTAO‰Ÿª¿w# ?ˆ3œÖ»¦pÔÒÊjúàõ°·‡a6VxI("ÿ«ÏÃC›ó(ÚT*7 ùØÈ2¾+ìðŠWfN-uþ¬^AÀ€ ›)ÛV 5Ð%A$sµd(U÷ÔéÊOMG“N8ßm¤4Ö”·—Ȭn‘^Bä|±jÐÞ蔕áïð ïÅéO³ªÔì—¦#!Eì¬6CgÍ3¡é1ì6 xc6 i»ÏªˆÃþ¿=#Iʉ¾É#éFø­éˆ4fÿ†ÊBùjñþÑqy³®ÇÀI™öòx!þ:¶’”dùä;ä!ÊùnF‹ã'âï®Eÿ­JwdöîWÌ`£fÖ ì}F8Z.D¥ÈO·‰´°šõÎQoÔœmð}T ÎDp ,O>qï^¹µ"—¼–i1åâmÇÁ¼• ½yöÀ&yú†Íÿ ßipÜe¢é’Õÿϳs-}wµ÷°#` @Ø!¶¬-"W‚ ‡ w~”CñQ&@ÖçÊ3û7É£TœÑ”ëîì±æxü'ÉÍ8n>¹¿\Šaà4iŽ›ÎÎÌŽ©þý8»þ“™ü;·¾™FÅi=­ú M™œBRúÞCE¼Á‘19CÁ‹øhΞY#³`˜±ûï-H—ÃT÷»"?^Ëܸ\ljÚÀdÓÃ\a°ñÐ-w„vœ_0`ÃfÖƒ܆as!Çñ_!!€¹äZŸ‘†¯s¼O~RGÇ]%¹¢Ä¥?€¿}­Z‚cq d©«ÛB)ÿc{Ë噫D+æùmî&‘øµ~Bå›6tÊÛ-ÝÔl`2vÓøäAôù0ŒðùûaxqdYËÅ K‰ˆwDà5C¯LÀNbåžñ_ öËwÏ7I¿Všñ€S`&ªþ_½©JØUî8ýù)rCíüʘ5õÈ‹çZä§WÚä‡uÒ­•õG¿q:k^ÉvhEÀ€hë×É8Âeà§Icb­¥$$Hen†|è¦ÍrŠê—ºdˆðÀ¨eŠSaPîÝ”/’×`[Q–ÿîySi\ë©ù$œQ"c`ì–ÓÍò25ŽÕåR÷´RËÁñ4âë¯#±·£®#x+º‚µ•"À†ŽÄŸ†œ ¤õêJ¯ãÝã•ž¤%'È› ä!Jæ&#yéè‡ØD'Z ¯S̓Äúo'ÃaUòÂÑ\)¼c`XºF¼V3ÔuRÔGždÖÍzµInØÍ}êaÀ. êår›|ïb»4Á 8ÕÿœôÍ ÞžóµCn®Ãe^Á€ee‡Eo¦2¼ç­D¦/‘º«æ™/ÉJ—§Vʘ:ö É°& rꣅ`×F1‘KžÿÅ9ò¶ÿ\¢6aˆ'ˆ.—Ö¾ay Büæ•viè’!|%Šq}ïÁMò0¦-´´VÓƒj´ re—ßBÕÿ£3òêþ³0ãŒwZ9ž0Œ1Rk-:îkÀF̓1…´‰+Gš}@i\FbÀI³§›mŒ6M3{Û–"éBâl¡ìï÷È8êTŒžÍ2žxÍ{J³åƒ·TÉÖ‚¬°„ü©í½¶³_^»Ô*ÿJÊä·êƒÒ7:AYå |Kä8¿gSsàîí%dL]•ÒHÍ z¯Ö¾!9×Ò#ÿvª^¾_Ý*íƒ#2Ê÷zÕy †è™‡}DlØ«@À€U€f§l*\Á8ÍHÿñŽ9`ƒîu·QÖGkܼ¥X‘t¶õHC†: E¶¿Ê¨MOÉÞü,9¼­„2Ç¥Tø›G×¥JO7uÉ?¾^-Gjƒr¾kPº¯J—<†ÄÞÄ÷§ºd3¦€|2G®TBŸ‚ø«_™ŒWÑ.¼Yß!u„b6NŠþæØ¡tB¬GÀO ¯»?»×jñŸx¤ÿp:w­G%JT±£En´oᦠzý¢¬Ù_ž'£ øæéP‡À(PA+÷n)ƒ•ùR†<ÿ#0=݃òCÆüò¥6¹à˜Aˆ¹»&±P@ÆÁ¤®«ß!â³KhYÓ«êþTýÝ8÷µËÏø!ý‡Ñš&ÜIvhÿ5S¦À½QÌÅ5ý³/ E0``ìëè@@‰^"ÄÕ!°Q°¹ªjx•s^ßjVF G7Má«iŠÕa/œŒ@ ‘›lïßY"ÏcÿÖª.ñ‰Ð”iªæü´TŠRÕ0ÕÿúJÿŠq×਼Ôÿ壵RÓÓ?3ækˆÿ š-¡¢­ÎJ›—š=ddlB:¹Ç…Öù Æ?¡ò¯öɸþ¨v¨…qƒ$Ög ê$?B˜f”úgÒYk†À|Œ˜ÇÿÏÞ{É•œg‚{S]í½·ðƒÁã-Gôö(iw/’î¸R(BÚå­(éncwGjcWKñ¨cpV» Šw䎎šÑÐ 9†ã€Æ`h öÞ{ïîû²:{ªÝèr¯ªÞëL ú½ªz/_æ—Yùÿù[ëÞ©•ÈºêY3XráÿVë¸çb ÿ’ Bü: ÁÞ„xøý®aèá—¥.=UŽ tï!¸¾‡œ ‹Øf«†D~°®HÆõÔ­ni1·@Œ‘ ÿÓhÏÑŠ\)F¦Pòiœà Ì4÷È÷N×Cí1â¿26úMá†%|Ý ï€á)èë±s'c¶Qáx.€{b⥠óÿòj›¼ß2 W@ø'qߢ·‘åÏJ£¡Â6ÃÞ¡LYÔ@E1MÉP(AبñNþl¬ÜÝHömã_F$[džmX‡I©"§VQÔuÏÛì-ÅÐ/Hüã{òtÌSÐ{3×]s߸œnü´6ùäÞùý“;¥Io¸[·¢¹ÈÓñ›´366)­“ýÊ>ìD‡ 5]:ÔŸ>T"è㣨fȺÍ;gowËO.¶Ê¥®0\¨z‹y€=¸ @J3 Oé¹y?b==&ñïƒçÀµî!yñjŒ*{¤^ô®PÁ|6{Æ<ô=ýÜ[%_€ÇÁÉêÉ„÷Á?S/—;Gd×lv{È€1B€€5+Tæ¸* WëÿªÅžf€ž8Dla%Á…ØÿlS¿Ü˜Páy…^ ø| cpžñù9u£K A žÚ[¦¢ø%†ÐÝ@ÆD8€$;‡ âîˈ  \ÒÂ5ÏHQñ¬RXÛ?ÉÇ®‚ qAýÊÂä:ÝÐõ_€ÛÝ`¸©‡çs·x ¾Ÿã0 †.|œ=Z£Æª›«ƒr»þ+¨÷ÃŽaiB8_JÖn5ßV¸ ´…ýeœýy.¹¶í(–½¥9ÊÝÌ!ÝTUã8¼×”0àœß·…öë÷ãÍ »!À…ºU,æjMåŸ5+ôÝî íw ƒÐ)Ÿ‡Ž¸¾ø‰Ú´B ç°ó;½±—ZUò"7ˆcYŽ—®‘6‰±òki¶4ø_…•º²á3¶¬ ]/³s²2O%/¢!`(Ë<Æývß(Üð†å ¢íù*áà,™óx)¢Ž÷ül¢~Žá ìú_Æ®ÿmØ\3·â­ÆS1¼Ò«¬sâ]çN–]ˆlx ÏýµÊ##A8¾ŒI@æB•uUxÕfN Q…€a¢j8LcÖ"àÙíÑÚ^1k¿ ë»9‰ˆŒ»p†–÷,« þÊŠB0Ï>€¨ú'`@VäKÇj°3F#uChÿà.ÏS¢ëŸÃ p Õ´ÃòâœW¿Š\·œ€ÝC2vÆ¡.³Àùæ^i‘%‡»…ï -ú—ÐÆ%0e´ŸYPüÎÀvã'PãÔCm3 ‰ÇHIrxÔã©Î=€%³2•ñ§¡Þyzw‰ì„¡#³5Ò;%P³%¦¬@À0V jê XÄað5BÀÝÜê+DµûS͈E/‚Â,Á<Dey3]7™á—°»¤÷B]~¦Ü[0Æ¡'Üy–d§É!ˆ£?†0Á?¹Þ-ÓKŠ¤ùÓ5ÿ¯¡¤üx^º²ü¯Ês‡<Þ?%îã´\‚x¾F€þRZnæY=6Z›ûä0dçÛå*$4ã° £¶©4 _Åb cbå vüÇ`Üø Da<‚”Æ mLõ‹RÿÂÜaÇŸ¹ÛR ÿGt¹Ä\]¦N8R…qå˳Ýr´,K–aØ5=O*J³~à Â<6ßÀ.óÕúÙ]}Ž+Î_æSW (C»úöUºN‡`¯AaïçÃØ 0IÓz|jü].Z“E#¾FdØäîß÷Í¿Æî¿Ô3, ïß–›št¹kTz§æd„u±l´u'S€9FÆm0ýÔžb9Q•/uHË\”éB6ÊCø=虿AÀ0H§vƒ$ÄߣˆÀ|ÄÝ_>Œ0·)r©sXÎNÊv“ËÊ-íNF ƒ¾ë0`ûØ0N³ZQè¸Äx<>¡SnhÜ[Q0¬¹ %Ò ©†ÀŠM‹øP0„× DùþŠÿ¯c·ßÉˈ 8O=?ËF¸ðã<Œ:wBÔ¿ã|tü'j‘ÐÆ 'ìSNÕéÉ‹ðWpøŸUÞÏ(èžaÂ5J䮇9ä9Xh¿MŸlꃵ@$–Vî´Kàëý™£ÕR].%Ð%Ï\í”[0RF™ERï… spßÓâ¼8Ëe@?÷ Þã´Æþ ¸²Øy·%”Óó8>&N*s\RÑÜ­‡3áϬõç`¸·¬%?¾þ†8A0_ÚÇfÔ‹R$Eø‰Éuðòt0gHt?¢2“áC;‹¡ç÷$òi¾)¼ñ‡õoòœPƒ³ëR`:»‹QÒ;ÃDÉ@˜flŒ¸†á^7…õðjqõiEÞ¸¾`>¥Ô8;ù£Hu›©‚ñüþé/\k—¶Ñie«°Àjñ2N'a˜wúV,Æó°“L¶d_ÈŒ{ÔMS pª¡Wz!:÷Ïì;2ɱËòDãT=$mdÇ÷Ú6¾r†Ÿ£Ø½/!²žßc¾B?TD>uŽ# ÞóŸS“Æ.ו(Ÿ†qß'÷—Ë.ˆû á¡ÊÇ ÆfãÞšO ‘AÀ0‘ÁÝ<Õæe :÷i#]HC˜™ùæ݃Ó.à¢à½‹`5¯Ü솛à(6Ÿ .dð§ïu )‚2ì¥&&XÒªöC¿»(Sú¡ëngt@K41’&è é†èMSCÙ1Zñ3½ï¹«ÖL•¿Ñ ÔGTÅúbÀìÍM“Øñ?±·TŽU¨$üñ© ü}®¹Þ ` `ƒAÚ¶M䢛ñ÷§ NŸÀ;¨K$qáîÄ‚9çï…G@aZ’솾øm¤é}0^›@ y£õâ¼mÆ@˜SÀhZÊö³=Y°8ŒDAý°9hÇ3UPúP> }¡ë[\àʳÓÅ ©ƒU…tš<2t…~À© ŒË#°ì?)Æ.ØNÔdb×ïòMϺ֘š GÀ0Ó€»#’Mà8ÄÚSp銶Bñ;w”TC- â¸Æ 1á[¼¦íáïD†9Æ´'¡±„0ôÅW`ýþ*\Þí$ECRPU"ªªÌv!qŠe¡ŽÙVº|Òð3(ÀjóÄÌ…º¢ŒÚ!ÿO¬”{*ò”ÞŸöÁõ°à«15ˆ€a¶YFzb`¦i¥U¸"!¢g7hƒi%NküGw—‚çÊ¥¶~9·¼_Üè”^DêëB¨ÙÁÉiÜɉ`M؆½\ïTW‚L!øÂ+Ts•¥@p¨8S2 þðÉ2~¬|ùˆí^„!ß2Ü=b 1ãebœÓþ/ÖýÙ üObÇÿ0Ô54ð+#f??Ž—2@ð¥§æš; „¦„Äf<ÄÇõ+\ͱÍs¸–Bt;„]4¥Ñ\¸Ñ¦Z ñ²]¥ØiæÉ{Jåe¤–MÁîsŽ °j*P @«ü0d{¨8[^‚ Å¡{ žŒ~ìDœd?¢ò2fĉ•`|ãÏ&}`Þ’FåS°êÿô¡JÙ‹~ÚaXƼ(Ž ¶jQµã‹Á.lCl€pAÍEÌ”€àp€1ê–@F÷ ABL‚ÏØ.Ì †üÌÜ’äàH••…á‹3Ó”Kàé¦>Of»PÌ={¬Ä#áO \C÷ÿNL úÑÄ”_ЇGK2åI$eztW1âd(£M2ha)´7,í²ÃC va%Ä jó @àz045¯T´·xóh3︻LŠÊ3Jr`ÀˆÂÖÒþÕççÂaga¦ÊÎ7 © 'CÁ4qן…ä7¹°wuÚßÕÆ{ú ñ{,Äþ;Æ÷ˆûWäKhôü^3§ `€° ¢ak†” jFF`DGW@î¬#· è­H–³Y£²¡¯QúòàÏ>;€ ¦€ñÊIL” 0¨ôÕÒB³½µÒ?ÚK)¡Èv%«L–‰ûí½k=æKƒ€uÀ:l×ÕlñŠ¹îiÎyëqüë†ààÔ4RºÎª˜ìk‰ƒszŠžPýP]÷}0leòÓAb›À îPñ5bâ§%À•1 ⌵Öý~Ø%H6¸€-£-Œá!¹üË9ãù§Hñ£u·ã‹KØhqLõNDÀ0áUo}f¸žéçРzYøFÆge¯üt—ñ:¤{!ïm裸4[~†¼÷㌃ìüƒ5~f2ìÒ!þ·zûDÈ_PŒ¯È¨¢éøÃ7<_É †ö<‚€DcÅÜ28!­Œ} ²4ò¢à»¬*ñç1æ£ÕÑÓn7×€a¸y^@Ð%ŒtúƧeg°Ä, Ø릤8&/ÊDIÄ(ö&EMïGZbœ² ƒauá‘oÍ“ …@b)… b?ò샄ã0B,¿o‡qD>l£›%Š¡½Ì_ƒÀ` €Ì×Q‚v}Œ@zšrw®¸¡‡Ý –ñ3²€ôÄÁZ!ºÀШ1 ô_©uÐSHøcT?Æí?Rš#Oî*’“ÈÖWl„ ˆ³JËPº‹¬1ò7óäî³Ä|»Ýp äšÍBô ¬YŒ‚“eé‡`ãÀ˜, Bœ)wG€Ä³1î%üÜØ”4Îqw¬ êÝïÝð[üº˜uª…püÐøk&ãÅ$léóRâUÈÞß:R)#éQù¤Â&a™©çWº~üÍço-¿7ý\}ÜIóá–Dbì¶lÔêãããS«ol~âù¿idŠSEèCB †¾1Ø,õ¿áEÛNPÈ~ÓÞ=,Èß½À»ƒ éCïJ€i+·¸€ô#S_œ$€áøB÷>²£XNâU?3ÆjõSGIA“LÙ¸PœÒMÇ0‹‹‹ÑÍ6rÑ4ºëÀ7ÀoÆl-ØÍÃ%0Auh$fÊæP Pã–|¨B!·g} ŸŽÂÝôüöÐ.©AŸ$Z*ÎòdS ÿPç©šŠîU( ~™›î@À1 cìJ¢Z.\•+ƒpÇÓL€Z(ÌjqÇOk³°êO`·×#À~{U妛à.›aµò9ýßµ/ qðƒÚý³>,y¬€Â±ú1ÖC˜—wªä"ñ#*nZ¼FÞç›ÞÚ/±pj©1[2û£Ç]!´Ïpvm˜QœT€®L½ ‚6E`–Y3Ã@` B!ªõéÒ éŸœ—!,#0Èê†ëRU¹…f Bôl9õeËÏ õ‹„q‰f”Ç0¦·séª<Æç{h§¿+Xe©Ì³—‡ßrfb,l= ñI‹êÎÄÆÒÅÅ1+(¸ð¨–üù—aˆ¯»a±|»kH>DÎø+ƒS2f`î£K123ÇÌ,K~Ë0úš—+ƒò±ýå’-É–0ö×À”N1[%W!ƒÏGãFNY1r1R Â_oŽ=¹i²AªÊá¡’G ~K`TSaÜ™#SëM}Ô¼@Î`pC˜@çç=Žaï4zK&6_®”$LxÄUGƶœt©,š’ò·tDÆ¢{dZºÆfäÖèŒ4ÀÚ}ZïbT‹a?qíEZaÑÞ3:%åÙî°0\ϧ¡²¹Ð> ¤8=#²£(GJñ|ÆÛÿÈ_= øùìÌÔ$)¢Ñ¤Ÿ÷®¿Ü³– Cá46óPãõb.^…§ÅœŠP¸Ý±Aÿ1’‡ WtWVª”!4u˜Pþ^ŠŸ¢Aªr±¦¥&+ÂåÌ´o¡ˆji³w[·:w €m¨#E›)àv“™*’Åò%™€e{ïИt@¿ÝŠWÔ;†`ð×·!ènû¡*è…aUpn5ƒÂù=Zzôb7ÞØ;*5XD²ð%\erv^þßsòòÍn9^•/ì.‘êŠ% [2°hݹd {_AF*Ü&ƒ@Š»8¼ŒëåGrÅEpªvHñÎw Ë)_0Tµ½ÎÈ ŽÙLG/9pAÍÅn¿Œç®²l©…Ô¬¿×l„ñ&ѧôŒ·y¤öꮓZë ..Î6 €ž@\PYÈýfÀÚ9 º¯ª’<9>¿ côHcç4vH}÷¨4B20F`»Ž¼¦¡"°Û£{ä£< Éȇ­²>î5H{Ž5—Ä=+-E–bãäæФ4·É«·zäþª6ùì¡J9Tž'åèÐM.\†r¾ I½k6$…Øyů^qýRX“þçË“Ãx ûãýâ£ê£m^ÄŽÿz× ÔƒYï†}…‡úW‹M¯FW©ÏÏÄï!s> ¯ýŠÌd9€ü ;Js¥²lèôÓñ»Q¶3ô jw&Ò¨¢oÎ.G» `+ÈÈ ÄÓ¯„&!>^R’•Í@]EL!Þ‚OuôỆà*,ŽÏÁ"éO<‹:ŠÃÊÇgEª"ð@òt®õçËäL¸ MÁÇ–Úäc75T½ŒF8;„_ßì‚Ø°D\ú£È;ÿÄÞ2ø¬gF+€q#|/SãÆÂ@ Åð»xO)«ö»q¼Á›úëÆêc@útÓ,ÜRÏ!ÁåÎaYÄ|€.ȧûì{D\ýØïØÃÉM•ÃÔTf¼n›¹Ðégb3“”˜ $bñ`:ã°¦9©@Ž¦T[ÁÇ4|QM–’ #™e,S‚ (‡¿zèNd@k†A\ÃÀ‰¸‘d@IDAT„4NÌÉ-PFOúS½ nõ${~OKöÎ0DÊfbRªó,ßu'`ç’…€:q`$ÉuÐ* 36UM/Ú41=+÷Ö¢M™J5ŠñÃ¥+|v lOÒa{âÆ‚M5†âýjæ&%UÑ¿”sîûÕ¹€Æ†ù( ¥£î¿q‘aƒÒ¯Ô„ðÜÄ4Ò€3  °AÙŸ•";à¦WŒøyP+@Ÿ_å–Lò¥aŽQµ™¨ÒE‡§yæ)Á!à€“€õCJF ?.¾ s3evn^Æi3@ˆ Ë:¥LÀdD뛚—NH ‘=oØc0€ê¸(:§Ð}™›ÐÿØ}W (PD‘Vªi¸‹N"A‡Þw™Ø’S[Yøœ¨Æ`§zFåÓÐ<µ§¢Ð<©Ìuƒø&¢}á  ³Ið±NC2>¹ö«Q öÙ%jWÅ 0àÍø-êy`h<ã AÄû1R9“ßü,Ìû<$bª-tK]I®p#B#¾ èô“1¿´:Óþýß^=p í€B9­ÈaçdÄ#À‹K¨"x»ÎQ¨ºA`©~¥µ_ÚàMгb@Ø öQ¬ü$œÀ,ËÚ¬†nypG‰åÞ‰`Âò±ã)IO–A¸}3ð”7-¤úLÍÎÉ WÚäíæ>Ùû„߀JàI¼ŠTÛȸ8Ñ.! y)Œ›A´ü ™å„¹Ê_Ÿ‡‡$åÒ ³MÕ=‹gÇ`“‰>€˜g`¾dBZT ‚¿§8úü)†_vúÙØé“ V -˜AþíÆÂÀû—oÏa_iµc %²Û¢x~pðÉÑ¡t€»S7v§Ey™²¿®Dž€hr*Ƹfས~¹5ke²™üwúJÏ.pÙtG¿/É™iî—ÿn\% –ê݉sŒ4÷@ÚÐ "J°‘@œhÒ.£öýM½r±{H~u£C>³¯\Ž#þÃNXC3©N8M.ÖTE€àÎŽ±Ö0/hïÝ {¥_w¿2²ß²,º­ú½çÓPýCÝ:8&/Þì”.ÎEû­yV¨Ú|g=PéàCˆ}&cÖ’=îD9Z–#;aÏÂ~tú4â£Réò1 ÿëܽ³Ý‘ÿÄDŒüx·@ýòœ¬ðîìFç´ª¥…7¤4¾a0t0t»©5îñ]%j§Ò=4!·±ì|רܘF(b*„pÈn뀘ƒ·Ä ì!®´÷KU~†¥ Yþ$ÑíÅ®¾¾µOnCÜ7Ìí xÒ¨e.Âp3ffNZ /ÞW‘'Gª ¤†‚”*„£°í ­› 5ÀjÓ@Æ…“qñÝ'eäà÷Ý>ß0ûkþžæT,o£Ÿís-¼ÍEvÙw½G+s¥I— ¡Ó/„>??;]Üð¡.?%9 s>^e^Œ`kÍ£-DÀî€ÕŸ¼,„É^U“à‹!5)¶cÐ ªGa0W4"µù·¥^¸v àÐ9¯ Ù1ê ì$Ôïa1~xO™Ê `¥ ‰è0ùØIÇÀ8juòm6=@-)–êšœ•.Ha.õŽÉ.XŒàý0,¢›™Šx`ÚH¤­, ع¹±¨{,¶lùÚ¦¬^nu+×>Ö¯w«môë.¿/fàŸn0g{dv(*üHTsEu1FJÁÌž(ÉÇ”a·Ÿ©vúYÐç»È$b®˜²=°;°:JÛY° Â'ÔѹàEÀ„Tìª*’cØÁôA„ÙÑ7¬TÃÚåC®&&Ú ž¨ü}›Ä‚üã/AÝ‘Å‹DΪâa² M—TòI`¦Ü¢¶zàÊNŸÆ™=° 8)Ìc+üø®b9µÀHÒVõª[UØ÷TaБá|WX5Ûú. ‘ôç&üþ_C ˆi¥J‰b¦h³ÑÂï¦"mʃ‡ë˜Ç“.Úcä¹ÙMæs'"`'Žêº>y6(ƒDp÷ÌI@_Ý Xóî¨(„;ݤ 6 J#Dê±uDë[tŒ†íð€xóz‡ä!Âõ—V-É”.#¸É‘Ê|i„À+ ‹~l––Ù^4nê€_ÖwÊÛP Tç5Ëç÷•ÉÓ*¥ u3í-‰t¨û@æ%ÖÜVJH¢uš„ª] 8oé•· ûï†4m‰.r6, øÍäÁ(´¶,Wé÷ÍŽß¿A4F€þáeÕÕk„~Fà;Ì$0±p›ã®0–í»K³äÝî1i¤Åbý©ï­ôýʉÅy½¡SÀ©$ñÅ!5Õ­I‚ÑÔÑÊåóÿfû LðÒ߇Ñq 8OÃ}l¢s^°«lÀ®ò¾ÚB9„`B;‹²*´j~Í\ø¯°æOM¿4ÑvÔí[³,„¬‘KØí÷ŽMÊ»6½Lžs|LŒ5Ï Y£7ªLË>„è­„?ôý\Lñcè^a¹Ú0þÃLõ] +Å+'¹SbÇí)¦à:üïo€ˆV!³õYµÓ%fe°Ž>ˆègáõ*"ÁyˆÁ]ð'ÐŒ±*¨‡úã X”€@B­ˆ-Àœò=p+ëÃîr'’ Ñ0‹FX¡`fˆG2"LÚtÓzp=ü—ÂHἂµ¦Íúx׶þrª¦«`øn æÆmØÌ„¨Ú­ê+0ï(þ/G| Æä·{XÞPóÝêsŒ bÛþ é¸(ËÏ’‚Ô)‚z SØ JŠÖ˜®nwùNB€Tø3[QHhpr—?½¿B1m*¸Î&O[¡L) À4œ%#€ö®28grÑ>þäF·¼Ó6(» Zøâ‘yhg‰Š¸æ‚‘ =‚)\è)½PÊŠ ü)œQ:%‘/S÷I·UõçY÷Æç•«íï™Ó—›¨ÅäîÝ›™‚T¼JüO†Ö”í‹€5«d𜟟ÑÏ=à#™ä¦^»‹2TâÎAº·Ù J4w ÌËëЩ§AÏ}´*Ovf«XäVA[ŒÀ>Ÿ9\£°)ù‡woK#vï*ʾ÷‚ŠvQJœ†ádq–0vüùž1.xMæ8\³Œöã =È)?Ø2 × Ñ¸ïj›<º³ªb¤‹Î‘0q¨ßû¾ö @ŠYóÙF¾|} ÅבèÏ66!Äp³*ß8Œ7ßoê–ŸÂn£u|–qº-î5ÕsØÝÁ H°ªKóT0kždjµ Žaì˜ 0& w©Ð™ïEz[º¾8Œ06wÚ®`‡= 1ú¥ÖAùÅ…)}Ì-´n¶¨Ð¨Žn|¿óà>q'%Ék×Ûä—P FìGž ˜ÐåÿË{kåsØÑ“x¾ÛÔ#Ï¾× áE0Ki ¿7á¢4c÷1 ôë|Ð1$ÅZå‹ûËåÈ:XŒƒLîãoá83#›z–¦â2þ>;Ô×3 _+ÿ{ÐÇÿÃMòtò# Èc>{ŽLrNüðû˜ÄO¿ `iÇ’Š¹v‚ý”æ¦!FHºÊÌgÇ~DºÍÆ0Ò#°ÁóM€ @ññ#FŠ+/Ȇ^pXªãû¤kÜ‘ªõDú2ÒµNˆãé£ý$,ëws×l¦£ÙÏž>P.%«î.È“ ©a©ß/rvŸ‚…?íH7Œ'د_k0$ç‘ZX1\*”𠂸nÿ&ÀˆMÀes¹2¡@˜F̃å¹R#Aª9\Èé+-"É¢øßs½æü±H“=îú{aq½’¶~9G—ʶœ™UYŽ’llAl2.Áòÿ ž7ËðϪ†ß²øëqãw¾/ß`?iÊ5ØèÿƒÜ†›¥w€Àá¥W@>v–Å° ß™–(# 2f» è?¨[ô³g‘áì Æ4)Áe©¡ãìïA´Å\ÄH/Å®*^e½#J\^‚óëŠa0˜”Å j€ê`p™ëNQéžÓqŒmî…ã¸ôÛÀÃtÌjJ‹qaaèÙ×°Ë}¯w\ÓpÙFtGfÌ„zÒˆ-u¹¨JÙ{«*5ÓR¹ËÏõdj"QHøgà¢Ú5 Çõgåÿ5¸*‰qZÓ¶3ø¶ò™õH¶õÜþn!êß‚¯ÜV$@Úò™Ë’†yR[èIⓤMÉ–3Øë¶Gaî¾ñp Ä(/È’û«råæån[€®Ón…DDj Úž=w[jÏœ®oVª4D$êÌx.‚cØ©³)‰¹óùJô¾r!w]Ùˆ$øÉ#Õr´º@žÀnöùn˯ovËÚ=b§x/o‚†{–Q×ÄÜ¿ºÙ%ïƒxéz»|þp•<¸³TÊ¡ÓMƒÁçxߦÛÆ#?Ya(ü¦ÁÓRï¦ø|ÎÇ΂Ó;âŸ_]m•¼Ò®¼$€ÓªÈ£ömô™ÏOaÄ¿›]Ãr ñ%ž¿Þéñôðãþh»”Ì_N"Y–$†²[2ŒÑÖÓKp ` :Û¨Rª2øèŽbùY}¯4ÏÒ(Íf¶jÑ÷èÐ/@ ð³ MÊð¡Ýeêhåp’°ÇBŒO£Ê¸î©ª»AæâKæ ò 9 GÁƒ 4¯‚À½Bò ,ÐXOlV†¾ÑxzFx¶õ½£rðr›<ˆøî.…¤!O%ýaý=×Ó¨ÿ‚±¢’¶+ðï6 &‘Yñ ²=¾t¥EÎ6õÉ­þQ_òÌJôѪÂ~#™Óÿs¶^N!ãß8lK”­†U C½EØñÈuIŒc™Â׃p °lTÁOhJ*¡_>R&= 2mʱ"È­TðÍò¿‡ 8}«K ÝÉŠÐV!Ü.uöá(¾Ò&úæÓ]‘ŒÀS0ò«ÍO—‡À¸¼¢ó"Þ4C ³2õZi9ÞrDf‘»¡ß_„oú8<Zz†å¾ErŒS i„wá=J„o“ᤅ#œÿï݈¾×/M0P§¥7Þ áù$ÕHûŸA¸æ¦aØhø: !lCH«Bû a/r x†‡5Pç`,©Pâ^\L©¹2NðÔæÿß02 Á÷ŽMÉ+`„:Ñ/U ¥²ºLƒøÓ&ãiÖÃÓ`lÎË«Ãê‡[T?ãbæ"ó_-ÄÿÌ bBÿ´1 ?Kî6€àa¥À…è`j‹¤ôf¯Ô#Tí8e±v,$– "gÛ‡dBn!ÜqŽ(ËC0œèõᦽ@ ² –b¿  ¿¼·Û=ò>\ÇÀÌaׯFÛX‘jÌ, )¬âÏ"å0cGÊáÁû`êa E5Žã+.@¨c‹û=ÿô½V=~ÔSV%7~´W!Åë}¿‡Æ†Cãòz}»<uÌ8Ô ŽÑ÷:¬FÅÿú±ûGö?w‚TAÕ”Œ9fŠA@#àYqÔCÜ‘©ikËóå@±[z'§åÌÄÐaÒû×òõwcцN¾;dZŒÿàôuùWO‘rì´½òÖßé÷´% ëâ>$j©ÈK‡‹á(˜€nù1üЯtBÜB¯œÑÀ߬)Ø/.ÇÊ"v¬L2tFs¿@àšÏí/“ÇaAwÅ9æ- #°þÞ5mö&üD0&Œ±öéÑ —¿Ó þßÃ\Bä?Õcofk3h¢ùs0O»Ó“•T¨0'CŒø?šG+ìms väú@†ÎHK•c;J¤gt À zÃ/+ å">Kò_C¤[·¹!|ï.ì„¢½P-•@JI<§ÉþÒlyùr«¼ ‰À™îYbภ®Ñi¬v"±Ÿ„ÑÜß–Ë0,,T!즨G¤HÚ¨W ÷Gñ=ä‰F`è÷óóÀ¸EšéÑÃdÄ)EYOc¤6Û%jŠ<™ÿìÎÐDºvoŽc£ÝTL€Åp B…Ö€pì‘«Ó‹+"äÐ=#l5aÁ£[]3ŒÈ^C,÷<øÍ3[`1‚¡D{ ’J’14LÆî­RC—w¡¿ˆuóJ:ƒ+WÅ三‹<ú<iÁØÌ,H~ߘd£ß*{¡?à£UH%ùŸGµ7ŽRâ¸Ò< | ðò)0ˆç¡ñí*8Ó4TGv·úç˜1lô!èþ+ù¯ 6!ñ6 a̾˜b †°W[ת\ó2¥‘íöd À%pqhˆÆåÒžŠ ùDéÙ®DI€šƒúq†ÔR2¶dñÑ€ñÞšb©QÙs$VÝ£jÐPn „~žºýõá{¨AF`Ø6‚Xù4dÎ;®[ó´ Þ¬ {xmVÚ¡æ·0Ôo'ôþÏؤ\ [IRIV·³¶ùÙ1Ö»³ßQ#s³ÒÁÓ¬Ÿ ¶éLT5ÔxDÕpxclB7($8.œÝjóÈØ´œl„[Ý‚l–aD÷‚Jè2‚š('¡æpag­¬äCŸe5qcŸ€C÷ÂHs'B 3àKYSбõ$ˆ¥¢{ë×ùF`ÙoÊïÝ•ñ¿’xçDAsëÁø¨½ öÓŒ¨ÿãÝ›ò“KÍp«´&ŸÀGO ß{ ƒ×ûj d"Q2߇]æyøP ìIÆ 0Ü,½ “Û¾ŠjK‘ ¬rº •çªÌuǺd´{^zh½º°VoDïBŸÆ ;ÿqÝÿÓ+å?$&ÂåVò`vìRTÀ!,ì9pk|lo9Âç 6þ ¼«õga#0†MeûåN?T…ÔCOÚoÇÁÀìáãÿ¥ËÍòßÏÞ>HHÔ²9¿°Q5QûYvûÒ‘¶º2_ýŽÍî?j‡*¢ sŒ ¢(:ðá\S°k(€åðýu…R?]ò¼ ïtlbßzXÉÿüü-¨Î—e/,îÝð¶ÓÚ϶Òm° ^ nó!¨ËuË«P ÜÀ®–s”-@¨Ä¾ÞàèÍõzlmòž;ÿòÆÕyxõÁ≣ïÝG›ôeãfÆH æĵy*ºgç6ÅG¦Ö!àÀ®Ù¼¥ÑP&všûª ¥º¾[Úy®Ÿu¶&1j§×‹Eÿ¹‹-*.?ݹ“Nm€Ý–I†ÎGÀŸì´ÉA! à- ®4œB»àDÿ+ieØ#2ôþ>T_¯^¿…MöŒLȯ‘Ká%…¾ j>sà7¸ÞëV{œ¢)x•ºärMä °”qý³ÇÐE¢•Žaæç¡¿3%ä¤!0Pmy!âdJ ¢ÒõOÒœÎþ+å"vD-óúý37‘ç}Jþù{,(Ùar­¯9ª`éý/àÝp2¾ µÍÞ¿-7á28û K0˜] í øZHÈâ~:Í6¹;ÿ>Mþ9"þ¯·®K# ²?¡T—X É–ÕCÿ“¹P––$uåâ^zËûÍ["€Ífõk[>ÎÒ ÃXŠÒ6®<R7tä5` [±[š£c:'”EˆÇo#øË?Á¬çþ7 Ú©”Ø `n¼ö"âa9;‚þ÷Ç0p{9.öËÇ-àŽP*& Ü#Oj¾ Eß´)ž¶zßÇ( ]CˆÑ&ß~óª´C  f±R‘ø[ÿ¦ŽŠ/f1N³üLÏÎÊ"]M )°r ¨ŽaŒ ¤s|µ²E,$HoÛŠÄ,ýÌŠæâ¯;Èqâç¿×Ø#?8uU~óÄ.•/ "u»b^ƒåy’ ýïa:¾‘÷¯vlì.èKGISqH%yÒwÆJ¸µÈ›×ZåÅ+­ þ“¿/ý¶Ý5Ë2Šþ¶ÍÉU¸½fº]’jll7Šáj°c€p¶Ýž3«ùî¾aiè“.XJÛŠø2X Œœ×ÿï_"%/õèô ?€pÈÙ8·«ñ ŸFœ;!ј†z¬}hBâ¯ð“M®L+€6¹ Z>^!ül³ 6 „ò+°ögjß·»†=s8`IH´tróvÌs>OÍɈY‡yœ•‘æa6¿Å|³Mp `$¡ŸÁtùCªÙ+]r^íJœh§= ˜€0ôk v†Ïœi€žxZ¦A8NÖ–DmA{¦vÀñÐqó¥üø@-Œ2°’Ž(Ð*Âv_,,9&‘¡ ™ýÞ„ôãïßmNùaq0ñ÷tP¤Ñ _k’cý0tIyQžÄ(u‡¾ÂE´&ˆ_Q Oµæ>Ç0Æ0´„»½ÉÉiï’W.µI3Îù™“ˈd? ýÞïtË¿ytF>v¨ ©y“…úu;flê‘óˆ}0¿€DdÀ@ ÃjhCAü©© › ùx§¥OgæijlÞÿ€›)hCÈ3×;Uèë|¸ó¦À>Ä®­@¸é#M  M¡‰È'KÁ{=ˆ{å*t§—§d¶Žçõv‡ tcßz傲j¥ì@ä=ZÚÛ©Ðj»Þ†î!ùq?ˆ_ -Ÿh4DþÁÇ¡Ì»Eì€oôJ+$LõQ›?:ó¯1ö»z¿ÙÓH‡]”•*;* ¤ª,ßä°ß0ZÚb§H– tó„„c†m݃r‰gº‘ ` ñ6*sX<¯ Ϋµ£ªH@ö”çJF íì„Êo?8&ÝcÒ F`9˜†sø1l3 ÐÐH£ÖΫ§Wò2Ý’‹ùšï˜åßJèî¨Û¨î€$ò$$$YuÃ0øöžAy«¾Kn![žÓÂþ ÏG·Ã—¾„u*«ýcòÙ–~ybO¹©)’’,„^…ˆ5Rjf»kF:à×óþl8诈?ÁÜWØ„3ÛŒW°m¦ßº·!_CVÏÒ¼t)+ÊA€ 7ò Í:!ߺbT¾áÖ«æ春Δ@ Wgï°¼¨i ˆ#>æ°˜ÿâ²Ù}t©[ÄÚ9Œ«?>ß$ï —ÀŽÂlùÒ±yxw™ä¸S ˆ«·ÝþÚÁ¼u½M¾Èwcû¿óÿ „ª0Äé#ðCp6Ö¹‘9ÔÔ'ùYirÿ‘’k¤þB @5þ>Ѻë3úFø$!ñ†N»©sñÒ»¤v¦ø†÷¨ KÒ8<%ƒ°¶ƒûäy¨PŽA°¯,Wj¢—FWVﳨ÷ïÁ³üî $½iCì&¼ Qa'QÂé@ff6(ae8<Ýtì_#zGp ÌÔDÙSS*yP`GëØ>›ŽÝÇ0H[»²LݽÃæÛ;X„h·QÿšýîCDý]õû7Þ‰ÖŸ`ýœƒÄ¤º÷ÁŽ!iEvÁähCÞùRY ·Á4q%'Xb,ÈäEHgüv}»¼âÞsÌÛRs  •™’þÉY`ˆü͈â÷aS7CÔ f\€ Å<­›‘B$EjëÌôTxÀO@³0:†ðsÍå+pW7‡˜á×ðçZÇ 4Ï/*c/Ÿp‹C&5K ¼~}³KveËS{ËäÞÚ"©€î57-URã%)1b‚’ p×?ƒñêEŒ‚ó-½ò·o]ƒÞ¿_Æ!‘&æÿÆ=§ 5q¸Û'3ªö —á…òRÙþFŒcÌ@iJˆðЭv`}«K·:¥!‚i¸j¤¾C<444âûÕÑ}¥ccØD[ÄN±«oHÞ½Ñ-g;F°A؆QÿƒnÓ»–ásÏ¥¶ŒÕH[Ÿ\F4¾¢÷oÉî‚ 9µÀ±šBÙ#¬,W˜e'@c,f°SaZÁHŸð.jéÆ}¾æ!¥‚‹ß%þ·ovÊO·¡n‰³¼Ð"Ý9«æ³CQXÏæÓõöN!\íÊÚ÷+ô¥wxRF§çd(†LŠF;¤ŽeJÝòõ«írÏîr©*Í— 2Å7²²²2|»2ú¯r ýPGg g`<ùa}«\CÜû›ôûѽ o«H*ç@ÁæÀTƒ8·B*ðr´»ß»%µ9n©ËO—ª¼ Ù AŽ4¤AŒ™xHy€àΛÁˆ˜“ {dQûQW·’Út€€ŽCTÎdªèãÊÛ ¬ý øŸ»õ` ó, Âò*˜£³èÃ…Ž¹‘ôš1H4˜Á}Eì‚`ÛêÔû‡‘')¾Ï^n–T„¶v§¥DÌsÅ©Û¡_†°Ã(YÔFý1¹Ò܇\é³Û.áE°®­ve+õV¦@ܦ@¨‡ Öž@˜Þ¾¡qf”úŒT)€û`–+v‰âJŠ—äHTê^ÄÀŽ‘ýÆ‘Ø…Ùý`°ÙŒøþdÚºð~šú~úY/6XÛ’àÞ¡ý$Ê$ÿ|ùS¸ÛŸ¢ÛäØl#&¤ŒP+tü7`tZß=*ÍPa´Ñí¶(HZïéûcŠ…,K?þûdgEžäå¤K¦Ûå‘@YøT'Tß¿?¨í¶c€ÅE.±¦øƒÀ$¢Å1ãßù¶!i2» óÿZÒ3EÔb€ˆ{LÀeBU ‡Mƒm@:T™`È$Åñç Q9vÝ“`ÖúÁŒBO> I€(U *eˆ_‹Dþž†}ôW®}[üÒ($P }Ú(LàHÂF¦×±ÛgªåË=£Ò FF©ˆ -Ñ5úG`‡á¬waA^ë‘ûÚ¥87SÒ]©+Lgn8†ˆ 4mÔFý땳з"áÒÛ¨ý¶oª"Ú |$¦dP&a30F¬wlÙóÑÊçüŽtwIïòi´R>bË¢ÚàµùaÓ¹¢j€ˆ´1wû=PK4vÚXnÒ°™%[ ñ˜óBÝ?-M–Vwû[>Ú\`·HÆâ]¨aÜp ,…]JZ*Ó]{M< žë€*9õQ àˆaô¯\´ðç6t°¿ºÖ)mØn¹­óïæj_ðZkAUï½>Ôõð£ >Ö_[¤øŸºyQÄ~iŽ–û +n{$!ôpÛà^ãrÙ¯Âæa î|³ ø³ðJ`R©yµlâêKD;c=\6y7§`ü›…¤Vûj‹eWu‰$$²p·á3*€»¡c¾‹z¸kéì—ë­}Ò€à5“^»º¨oüvh`´ÑF¶‹Nd”;{fŒœ˜ž•QèíG FDþˆ!ìøiÌd?lz X VNÍ-}T¢v–ÑÖ¹í0¡îÞGºþ6 ‚ä%$*/Î7Ò\›Á›cuóæ_ÚìÃêÙlÀ‚m.wÿŒùºØ+ˆ?ˆÝ™Þ˜[·¹ßÁ@?ß "¿ÔØ- ]ƒÒãÃ!Ø0 Â.¡ž$Ë "ž‰D @ä©âXOôÕDs0Fv솉6t±¹WNC` ¡&%Ú±7¦Í~"à`Ù„ömä@ð;{‡ä؜5¦¶@ļ®{­°Ø]‚gB ©9 A@˜!6 [´Ø|í +ÜÃÌ¢vŒJ=¢/¦»RÀ$z6¾Ô±ý®q +Ks"S¶ ÜýOÏÎÊ{W›åj÷ˆtêÝÿ6é¿éfpÐ/Áøpî‰K,1à-÷ɘbk¨­iŸ•×.4JWÿ°Ì $³)#à¤l€†ØxŒùé ô²H÷û~C\G(Pæ0Å à7$ø†èû [t߀l °íx·}T®#™£ƒrÃ`Ê8ÉÐ0wŽ¯#?á™~ÿ ˆ³~{pRZ©³5Å `0¬ 0‡5¢ 魯 µk@I àìéá$´1"«»MÕyp÷CHûÔtâGî!ÿ†Ã¿fæ;ƒÀvC`ú¥ aªwUKa.RY3^ƒ)«8É ÀŒìê°:÷„»ÿ>ýihí‘·û¥g<îYÎí³é™AÀ à?óX+.NÌËå–¹t£MæT:fÿë1wØÇHìwdZÉÝS{¯œAÔ¿FøjÏÒïǃ€AÀ °ã¼ß>,É-²¯®LŠò2%¡ªMqŽ‘˜\OÎ%úõJRÒ^è–1&Ž1Å `0l†¤-æÔÐ;. -Ý2üÆà#°£ov 055e¶µÍÑÕ³Eüv$üa\öÓÃÓ2i,ÿW±1'ƒÀÆ BJØ„¸:elCŠ~·q}ÿ1g³‹rŒ ÀÚx3ìo[ϲ±M‰ >ÛÓÈ"g¸ù±2Ÿ +`‘èÄÎÿ†=…LŽîTI‹O1ðÙY¦NuFq vþË Às2‰=Žî©”q„míGøÖ3Kÿ &`ƒkÍGƒ€A€d`³p 3Ež‰Ìm 4Ëù¡)éF(`‡0²¡†ÍÔgØ–¸Aü?^’!í.‘ãûª¤0/ y¶%›uzEÀ¯mOsÃÀfÓÕó¹+%YÊ‹rÁÑÇÈŒ{æê»eadZú$àîÀ™o Û H e¥Ê#{Jå¾}•²«¦D¨B4e-0ˆô6´5`çÑ]üÄÄÄÚQ2ïî@€œ<ó}ñ±CâJJ×µNy»ÂØÜ”ùÀ °½ ñ¿'Ó%ÿüäyèhdK‚!þNH›×«ÖТ oŠÒíÌD)¤ÑÛ,ªÈÑ“ øøû¤0Û-˧`0›€Ç¶F¢„ú=™›&ÿÓ}µòäÉ=’›•nvþw'ØxKîreôå®Ñv”´0!>ѽ²äàÎEY€ ælƒœé›€:ÀØDÉ™f‚ãüÿfY¦œÜY$Ç÷WIN¦[LÔ¿»bu³aîŠPø¿\6F€¾ƒÎL®©)IR›€¸¸8é“á™v©G>ð>¸šb08tˆýïÍN•;@ü÷VJuY1øóaر٤È߶bï.ÚUà ¾:7 €÷°úvžœäa>÷è!YDä¯ÌÛÈÐïQxì[mæ*ƒ€AÀ.¸Iü³\òÏ ó¿ï@µT•æCìo¬ý}?x8fy´+ Çiu ºººôgæè#”Ð&€’€/=~XJó%þÝÛr ê€Ø¬‚ëc}æ2ƒ€A úH…«ß=òóÏîß!Oß¿O²àço\ý|·‘‘ÇLÙXµœœAâ›±ØØØôÕ͉O(›€ü,9¶·J’1%NÝSH¢\ à†æ"ƒ@Ô#†_ óÿüüÜU, 8X¶Ñùû=l“““ÆÀoÔ,¾Áív3aŨaüš’€”ä$)E° ¸¸éž”ɹ¹<<%]Ê&Àpþ£jî0D1ï#¸åÿû`ðWV”c¬ý¢¡¡!ÍØ~atŠ`911In–G0žeŒ©¹¤ XPYa®X[dos €dITŒFN{?ÂD *…MÀaíN‘ä‹­J0 Ùz®Û{pLë "ÀÿÑ,èüOÖÉãÇw¯„÷uÌÒ *ß@K¯$JîtÌ, *€ñ(ÁÕÖÍ`°’‚yô¤Š¼U&`LúMî[«iü6DÄÿˆý?~¸r•økÿàæl‚« Šîv°*ŽA€çŒL' %I\„,‚KÈ þi¨Þk”÷ûÇM¡Ž‹y´AÀw ü>Yœ© þ¨ó/ÌÍR®~´ù1%pv~•æ^KtÜiw`U&0·ËðÏìXÑŠÕ`ApꚀaà¢,NK¯ ìŒ6½p(ZçïZ%þ;«KŒ«_FvfÓ0ÔtGCPsdª°;°Šˆ¿à5´ú9 IP­(›€'+ÁÌú.y .‚Æ00$ðšJ !GÀ-þ1Døûmèü:R‡, yjçòmà !eî,,,Œ¹}û¶wïmË8 øÜý/C73ì=*æ$Zû;°:Pˆj¥(ììÝ»aÉöz;›á„±GŸ/BçÏØþ'Öz‚ü$ÄEdÇ=›jfœ{•5tÈës[œÚ™ ÀzÅ^îïïg7@‹¦í†<Á‚rT¶°®Qi“k° èRé±mô;PFP1Â¥q_j¢äÀà1)>Fꇧ¥îŽóª+6êEcî¼jIô1ÁðHK’*„ÃMÅîxrvA® LHŽd3`£Þ£Oé þL髲úí«0‰},>äœé§½ªwÄaw@³îîn㨱èÈBtüäCe„ßu³[ÞéŸ@Á%ü"¢ý7á!É8”#ÞA™+QŽ–gIY^º¤!;â{7:å’!uNÍI+ˆÁ ëÑÞ-‹ÆÚÕb¬eÙ3îyq±’‹quzŠ¯Î•£»Ê$±.G&å­KMr­{LÚ‘³}v^ÆË.cïñgŸÏ«–«¥®¢Øˆý-š¼ÓÓÓC´7ã¬ZyYô¤ðTë`uyîììœ lÛ÷)”–«8…9ò…ÇHaÎ-I<×(ov"NÀÒ"£1F%8àÚÅ…W:ÒW¥&ÈCµyòË•…*z,ü¥O¬‘Ë ráV—¼y»OZ¦æUìOZ¤èìWT‚EŠÁ–Ÿio³@øb‡|°"[À8ïª*’ô´T%ÍZX\Rª­k·;åÒ­N9u³GêGg¤Ò 2ÑÌئAç±:~ûd­<ýÀÉË‚Î-ò=¦„¤&à½xŸ‡þ×hw@ƒÏãòõë× `ñ„ÑÕ“ (B¡ûÔ¨ÝsÌ©kò˜€¾%ÉŠ&&€ –Ãlä8x¸ ]î©Ê“Ý•ùŠðçggHš+yÕ7º¼8O2ÓÓq8±o@Þ½Ö&/ßè‘k`fاeÇÓÃèà#wý1RÂÿ’ßÜ¿§DêÊò!½Ê’Üìtq»R%2† Ú¼,q¥&K-®9¾wH>¼Ñ!¯^k—cÌë9­—›( ;ÿ§Š2äѽ¥ÚµKòÐ/f÷4Äߺñª¹§¥¥… ¢9Ö=)<5Û•ð_Ÿ/_¾|Ù1iÃ3ü?…‹LrR¢#XP,Ñ¡±I™žo’ó“Òi›6nEì[omF²,Ë–ýURU’+¥Ù’Ÿ›¹Jø5 ´qà+=-EIÜ …È™ÞØ="·úÇäôm˜¢aþöy0%ºP”/F’0¥ƒ˜ç¸¤¦ CöTÈN¼ 0æî4H°ÖÆárå#Ï”¸ûì,7„dÉÉH‘Æ®a¹Õ3*ï÷K;ã`DƒJí¥ØÿñÂtyh·'±O ¼tá}1Å:û!X¥9x’>·î¡ÖlW`#H–oݺe¶h!cág TuÀc÷î–‘‰iY¼Ö)óƒS° €: T  IqRšš$uyi²·<[Žï£¸¿HÒ@Ô)½àÎo³B&€Ì wŠU¥yr»­W®Þî’ô†i¡àôœtÒûA1†Ø Çð}#°á”|¨wJR`ÛáN–C9 ü”ôIeI¾pžRÍs·qg{IDs2ã! r %B-}r­ c_ß! ýSÒ:9ƒh˜4E?Ý1Pg@çÿø¾R9q Zöí(÷ìü7ŸÒá ‡? Ræ tÑÖDß{ˆìÎèPG—Ë%°ÒlIHH¨ôî¤9·&¢aàç="éÈ(˜v¹UÞì‚:D2œ6Ô‡fŃðƒ+Ë’ö•+Q?qG—wÂï Å©ŒÀã¡]ò`W¿œ»Ú"çnuË5ÄAè]TQ§ C6%ü€ž#ÅmœäaœòÀðÕå¤Ê=uErdw¹T”äItüÜÕÇ­ˆú}m!Ç>ÌEêÙP Õ”ÈqdÐûðz«¼s½].uJ÷ôy¿¾]~~­K®‚ ÿKxì^àê—“&Ÿ:Z%»¿ê«!þ>Ïœ\xóæMøD} Iýá®Ä €"þnœûòÔÔTSZZZ¸q4Ï”äeÊ>~vn^ÎÜ”³È"ØE#ªU¦9TP`uÏÅ6ð"ŸÝW=oYžæH^ù9™+D€Ä"øBB@Õ KJr¢dagX #H>³¡cPšzG¤¾oB.MÌÉ´2‚ Q¾oQ_à ѧ˜¿61Nö庤 ®›åùRU”­Æ;ÖïÔߧBEQ( %w[)YÈÏÉj<ûrs¯\‡DàU¨½Ô·È6óï3Å0fÜY,÷ªQÏ7Ä?”£¼u]ÌO3½˜iºÃ½Ï·®(Š®°;@àu!ñ_B®ææüü|ý™9†IÚÄA„ÚÕ?*#Óó"c3Ò½i¨vI4:,¡¨A|*°ë?T‘+÷í¯”š²¥·§þÞªBF Í•¢^E°/E_K {¤»Â’ö©€j ýí›™“>CŽP2`Q°ªÑT/å6uIñ''H>‚÷”b¼w•æHui.vü¹˜kÙÊ¢?ÔD# Èpì)a(ÀØ"2fnfšägtKFó€´`ܯOÎÊ”o}ܨ2?>Kƒê°;UEø;Žy¾£ªXÙ¨øQ…¹4ÌÌÌœ/++“7nh‚¯!¨=2UØ™ÐÄ_‚2„!`S]]]dÐ4OU0P ÔŸ{ü¨¡fÝè’Ó+aƒ™^8ÐBëîlþ*þ½Èq~´¶PöÖcA,RF[ÔÛÆ@®B&'®„9™nø‘WÈøä´´vöK}sÜî„T–ãÃSr}bF&ƒèw¸úmÏáHV`Çÿuy²"þÚò|Hxr•j‡;qâï‹a_¨ûEF€»ï2 Ò}ð˜>Ö= ï\n”S×»¥ylZæÀô®Ç |Ê ‰ÿÑôT¥óèè©“˾›~FFF>LJJÚHþÆ„è‰vf4« >X~ûí·{>þñëïÌ1`}T6Š x숔äeHì$¢a §ü]ã°ëNa߉>‡áúôÄÑ9¸³\îÈhÜŽàFPò¹±0DsÅQüœ¤â¯Ó*{lžƒ£réf»ü·7®ËY„LŽˆWÄF¶ÉgׇK2å7‘‰²®²XáóD8҅툃´‰F¢Ù`kË åÄþn¹„`RçLêÕÖaÂ.É^ÊNÀ¯ƒÉ@ý‡àÑð['kyó’nQÍùžûÕÇ\ÜÛÛ{L€7`û¾ÙдD3K§OŸž±ý¨8¤ñXÀó!&=¼»DU0 |†Œ°æQ›Ý­£Xæ°È§áu$#Iî¯É—ÝØrX±{6D¯”4ÐH/ é¥I‰|!·¢±¹ æ.u7 uÁu°~ä[÷;zm yˆá°¯2WÙsdÀ-7‹ÇP4VEÜY]¢õÞš"9IÐY¸~ ªâk0)ôÿ“Eé*¶ÿÃGwzˆ?¤†øGnÀ°¥µµUÓšõÇÈ5,ˆ'Û`×õ@(Î n KKK3ÐÕ&‹¹5(ª`Apäέwh\Ægý Äâm ´™X7ãú ¸óí+D ñÙQ?]»xˆ;íhØÞ "J%Üi±°È–º¢L¹‰| ÍóàM7ëóÝ*Û¦ße@ü_ÀMŒÝ­Äß{hÈÐ8”!†i$˜á–tÄ¢(oí“&tspR®#ÏÄ´öñ¾Ùë<õÜŸë–vÁ¶¥J*KóØß ŸHž:uŠéæIg#p Âð=x<©‰bž»dXÍ“pìä~™‚q\"\ç@PÅ;N@ÞŠŽ¿Æ^»K²À§RöÖ•©…U[=G;ñ׽מ{ª‹äZÇ°œF|yS|C€Ü{®+A*‹s•×…owEÇUdÜPMQP†öïCüˆ†–n^8¯mHš`,Ø?¿à‰*¹Ž!tãÞÈíÿ‰CÊÚWMˆ¿–éè›`ZñÎ;ïèzÓÉêxnÛb÷™¥ÁײD#ñññ †ˆž9I±¥Ž@Ã@ZN§|Шrô,Ì Då…Xèæ§É‡*evütçcl~Þ ñ:.³]¡a"½J³[%»uP†¨0åî` «aõ_‹]0ì¬ôê¸{Cÿ–LjòOPz±£ªD*`0xl_ "J¶Ë›çåjçˆ\GTÉ~0Á“ ˜…G)âL…_>^#¿ñÀ~Õwª’l8í.Jï„T¹pp¿^#ˆ’1âo†¿UâÏÁŸæ"‚5|XTT%Í4ÍÐsA¿ÿp|©SDÞº&§@¨QÜŽ#rß¡Ú9:kWŠZø©:°sánFbù™r4c@Þš’_õÀvîxPmG¸üíªÈóˆÿ¡] Ìáø8'¢]TUPeµv À[¤W^¿Ò&ï †@?HË#[ýÄþRyêÄ>ñ7Q3ì þ/Rº¼I€¨i§¿ ±»€ýÕ €: -ÿìg?k}ä‘GüÅÂ\h G&€’ÏONÍHMþ e#°KIvIôëÎÁ¢Ÿ1«þPC@@cÀ0»`ÏðÎÈŒL˜ÐÁ[ÂœŸ–,yÜØìaâ¡ÊbtÊd$%rI>‚d§É¾¦^…m@]1¢X"U1#jòwÂ{L‰`ü÷îÀÀ%¤3Z ÀÆiúÃsÛ»3ŸÅ{P–ž{î¹éo}ë[$ûnT·œùG z‹\EQ¿Zðr¶—âR'.zñÈ>Ç4´u°iHkèàÌq U¯²áZ™ #-R‚â´Bâ^ëIK\i@I~»Œ!† í­+ñO´¥ºËiãäÝŸ—^zéV{{»&üšèkúã}©­ÎíÎh°õ€¨¢Àäää$zP_`ŽÑ…wvEXà™–—‘ý"Ð%\ˆ°4‚d*â²äÛ2»‡yÛ/Ö W¿ƒHß\žÝ1ç†"ÇÍ=íC²`ãrß¡ÂYü ÄÇ1a•5ØšZGàùçŸÇÝšàQÓ[ÿ’À^ëX2ÝÝݯ>ÜæN«à"G+yêG¹ËsâÎ_cȾeÂ=¬ Ͻe™R[Ïò©K]ˆy­`@‘]ŒìGÌû„úUª ‡SC}ÚÆP*àÉV©g9F H0wªåUú‚viš-M ¸Nb8(¤Åk×®-^¸páRÀ¨˜ !F€ŒN&BºîCŽúlåÖÅéjÊZ–á"R†D?EH*åDñÿÚþšwv@ ¯¯ïex•y3-ÞLQÄCÞŸ“/¥ˆ—†@9¦¢gŸ}öƒÆÆF­ÿ×´Eo8£¡‰AµÁ) AðæÒ” 33s!Ÿ !s³A „¨ÐÀ°p/ÏM“Z$»1¶€p `üWŽPÀ&ÙM1Dl§þþïÿžþÿŠžà¨wÿ†ˆôàx=_†>rÔ€Á}cÆ€¯x]kN E€±˜.v?2*Ɇ ÎÞ¹B&l!J@ô÷WåÃUÒ¥|âCR¯©Ä ýýýÏgdd¬ÒTå-¢æè¹ÕÉ€ àâ×¾öµ[àäȘbˆ ¨¨®»º0r«¾u;‚ð./5^vV˜øQ1CM#ˆÀ /¼ð$Fbò2C¦"vÿ¿„½wÿZ@F€´D3‘nbHŸï´_÷ÊÉóæâæáÛ9ÿòË/ÿ§"h*3@tÿ¹YéB5ÀîtfÜR€ô37)NÊ ³Uô?³ûb™[C‚@ww÷/]º4‡Ê4ñçq½ $ÏŠ–JœÆh\ɬ‘àýô: üÇܸ°°Ð¯/4Gƒ@$`h`Ô5%¹R‘íÚ6 @Ÿ Äþgzdö߃@¤€»øÿèèèð&þz©wÿzƒ馆ìùNg¼¥j`!X|ÿý÷ÿcÈ4‚D !>^jÊò‘ È-)`_°ûÏKDêß’,Ébìÿ¤DÇwÙt0ºyý§?ýéäüü<‰¾f´î_3Ñ݉ZçÄÕFsiÞR¨zµµµÍÿîïþî /s‹A äPÿ]Vœ'eù²;9N˜×É…½ËKM‚ñc1vÿ)·˜'¨úöÝï~÷;`VéºäÍ–8²8‘ÐåÍh®N 0¢.¼ôÒKÿF_hŽH"@ýwVFšT@~¬,Ëñ¡]àrS㤲4_EDŒ$öæÙXý?÷Ì3ÏŒŒ{Ó žk €÷¦ÒQ€9àÀi#¨2ðhooŸûÊW¾r ŒÀuG¦éŒ- `8²³4G\N¶ˆG_«’¤<ÇHˆn¡úÃ@¤`¦XЂÿ¶¢ûçÑÛЛˆT-}®S-²¡îFÛhñŽ`ÿùï}ï{ÿÎRtMåˆa¤7€²ŠwtHÜ)NK’ „ÿu§AüïdfÇDZ7—E†††¿ºxñâ,Z°žøsèuÿZ¹†Zôd§2ÞpqðÖ3óÃÃà ý×=844ô+ï‹Í¹A P å–ò¢Ù“*9q‹~VÂØqge!Äÿ‰&øO$&›y¦BáãŸÿüç_niiÑ›C}\/þw,bNf4צŠs4—G)ÀˆÿüŸüÉŸüߎ]Ó1[!šœ,ùŠsïŽ")IE†@K§•Ü˜e)ÎJ• ¸=šÝ¿ÓF×^ýyã7þ-íÁÐjoºÀs½û×{uÌÖ:™Ð0x3Þƒ=?===êÔ©é7n˜Á-sŒŒ…Ÿ†¸;‘/¹œFþ`í¾ÿE9é*b¬Iþ±¹¶Ý ÂÞ`W7Ùýk€´ƒE=ïô×é N¿ÈÍi)€æøæ[[[ç>ö±½<33Sï q5]±)‹—dÁJ>AÜã˜ü§ ™óaÈà?&ùM'©Í›½bø÷産+J¼rÜV»£Óö‘…L€fÈÝ­tþ /4Å Iá [€œÔDÉŽ[á–1}ðJ‚ "?ÙÿŒõ$çØvö¹sçþÓ§OOOLLà{3Þ i‹>zÞ9ì¯Ãö›ŽûÉ-« \•$¼RðBìUõJ-//OyñÅÛ·oß_à3S ƒ€AÀa +ì‡;vìøó®®®tm ¯É•×4ŽüŒ›Cíþ‡Sg3ÛE ’Ü×Û@I!pîŸøÄ›˜ØD˃€AÀ à VDÿÿ~llÌ{×Ïõ_K¶î_ëva´‡j¾¼ú€ªI@UÀŸþéŸþ…Ç ƒ€AÀx‰þÕ¦½Òk?ß{Ò M3œÑùMzáPgã {»‘ºƒŸ‘ â+ @looïÒ®]»ÎÕÕÕ}|ÃŻƒ€AÀ `+î÷'>úèOñDŸ/Šûõ‹ïÉP:¼-?ú©ÊFDQçÄ#û«‰>c2 s‘¦âE{SŠ‹‹“Ξ=û劊ŠßÃ{S ƒ€AÀ¦ÀÃëöáÇÿîÞšðkÝ?Ôý+ 0ŽšØ6LÀvQxO]-ÞYo  9Ã9ˆÌ?øàƒÿˆäç¼o4烀AÀ ` ÷Ÿ¿ÿ¿îïï×z½Îó¨Eÿ¤T o¯Gp»1z€µ-~ÉPÁóŸùÌgþ=Òk°ÌÑ `0ìƒÀ~ðƒ?xë­·fׯóz׿^ô¯i„}:DK·“ €7L©>´j@ÙÌÍÍÅ®¼^ƒ4àKÞ7›sƒ€AÀ `ˆn®_¿þW¿÷{¿w©³³“Ä^‹ÿ½õþd Èh©ptwÈ‚Ömw@3ÞGÅëX¨bnݺµP]]ý. ?aþ¦Jƒ€AÀ `1===ÏÝÿýÏø“È{êü½ÅÿZÌl«Ý?;¼]ö]}ž{~¾ú‚ÏhÌ™3gÆ`Dr©²²ò)ï ͹AÀ `0D¿Z D®Pë‹8Qô„™ƒÿèÜÓO?}úâÅ‹éu¯95 (@q\.Ÿ8qâˆå¢‰¿Þý¯®ãhæFÄÛ‰þõpé¯~¿­ûg®€ùTlyÎÏãaðéÚÚÚ?Ĺ)ƒ€AÀ aàëóÞ{ïý× é>::J"¯ÅþôõçK3Zô¯Ýþ¶-ñç ÀG†ÞRN J´@Or”‹ÇÿyccãŹ)ƒ€AÀ A`¬ý^JJÊ¿âÎ…ø{¯Û\»¹nsM7ÄÝ8Àˆæµ:€Es‘œ@|i’9ä‘^€kàO._¾üŸ=·›¿ƒ€AÀ n¨ódžìë ÷Ë5Û[ì¯×l2üÎèý× 1\ˆ×[2Tè£6 TGä’ŽùÅ/~цÉw ©„÷ºÏœ ƒ€ÅÐÚÿž{îùÄþóHóKï½ó÷&þzçϵœ/}ô¼Û¦ °vàµ=ÀÚO×¾[eèðÊ+¯ôÃ=ðìîÝ»Mœ€µ8™wƒ€AÀàçÿ<\ýþ¶µµuÑZ½wþYü“Ð*^¶Çÿ•Q1 À ^Íè£7ר?[ü÷Þ{ciii¯:t艘˜ šb0  põêÕÿòðÃÿ<³Hø5ñ'á×êZo½ÿz±¿!þ^cb/0¼NIà·š(«L Ob.\¸0ýÆoü䳟ýì„„„|¯ºÌ©AÀ `0‰û|ÿûßÿ—¿ÿû¿Å‹ø¯ûkÑ?mÖ‹þ·ZÓƒl¡ýn×;ZûµÜúkl´{ ÓÓE0 /¦¦[ >rן˜žžŸ››úôé”Â_Æg¦ ƒ@ÌÎÎÞþßù?}ûí·g¼ˆ¿6øÓ»ÿõÄ_‹ý½¥¸A¶ÄY·k"ç¬^…®7ŸÍ˜2š c@!¡¤¤$þ‡?üá¾Gyä?†®)¦&ƒ€AÀ °ý€uÿÏ°–þ-Üüé62ø£ØŸÒ½ó7Ä߇©bT[ƒD&@‹Ž¼úÜ»Å0À/UÞ|óÍ ¾ˆÈT÷ÅÅÅ¥{_dÎ ƒ€Aàî@ä¿|îܹÿðØcý¼©©iazzúnÄŸ„ßÿ»CzÇ·z‡{Çæƒ5hœ´$€Œ“Vh•€–ð=U yyyq™™™q¿úÕ¯>[SSóûkj4o ƒ€A`CàÖwþ+_ùÊÿ ‘ÿ,,ýIø7#þÜõóE©¯¡ÑŸ·È£.1… €ïóÀ[À»ô$ÓÇ;jBlꈬäùçŸo˜››û%BURà¾ãBóAÀ `0ÈÊ®ÿë´ö£+W®ÌAü¯‰¿·¾Ÿº~­ï×ÄŸ„ß?çÞÙúyÛ¶½\ãEIϵ$@K´€ÇUIÎã ãÜnwÜK/½ôÙêêêßÃg¦ ƒÀ Ø0ÕÿÁüÁÿŽÌ«sz7¯ÝüHèµ›ŸÞõó¨êüõfÌìúW0Ýê`$[!tç÷[I6š„1ˆ(+Ò€›o½ˆVµ‰‰‰…wVo>1 Û¥¥¥qýûøã?‹ðêóˆð§‰:wýšðë]¿fø™o?½önð‚ì©ÞÑYͶ»]ãÆ£¶ Ðn‚Ôÿs÷¯mô¹òÀçñYYY±III±ßþö·Ë¿ð…/ü»øøø|nŠAÀ `Ø6PÜóæÍ¿ùÒ—¾ôêððð²×®Ÿ ¼f4À£þ\KHô¹ûg1;>ÿÕ„ÌçÌ…«hìxä‹Ò¾È¨¸8jU€f”qàÊ5qP Ħ¦¦Æ>ûì³÷;vì/EL‚)ƒ€AÀÑ@·ÿSùý=¨ÍÃÈœ;yuîêù"±_ÿòÞõ{ïüq©!þÁߢ‰˜¿÷™ë=hü4@i€fHÌ5# ¥Z:ÀïÈ(ðWQQ[ZZ÷w÷wOïرã#`T3ƃ€AÀYŒŒŒœú›¿ù›ÿŠ2†xþã¿èMü5߈ðó;½ëç=|é¿>: ¬0ôF°0<ÊÑÐ8ò¨™q-öׄß[°FÀûU0.'''ö{ßûÇþ866Öx 8zژζÝÝÝÏ}ó›ßüñ /¼08)Kˆ‘¢wð$ê|iѾ&þ|ÏsÍðz} ¾&úúˆLñM¸ü½Ï\'KÍhF@ïô½¥dô{Í$aàK18Æ|÷»ß­{ꩧþÆ‚exoŠAÀ `° Ôñß¾}û™¯~õ«¯\ºti:þ%¯?‰¹ù{ÿõ„_3f×oÁÈk¢eAÕÛ²J'ú¥ »&ôšðó¨ýR àsÅ ¤pÜ‚|ýë_/üÜç>÷Y2)‡·å´26Ø™™™Æ÷ßÿû_ûÚ×®tuu-µµµiâ­wñš¨{»øi&@õ5f×oáÐk‚eá#¶eÕWµ—$ðšØ{3úœßi‰fb‘d(cóóócÿò/ÿr' ÿŽËåÚƒkM1 G€®| ?øÎw¾sêŸþ韦áÙ$Üñ£aš€kâ¯ü4ñ×;~ýžG}-ñ³]ŒÈ_#‚£&T!¨ÊT±-ú¥‰:1üŒÌÀzF`•‰€ç@ $k1O>ùdÒŸýÙŸ¬­­ý"\ Ëq)ƒ€A l`š!ß/ž{ño `S"ˆÙOb­‰¶fônžG|MìõnŸïùâ÷šøëz4Á×G\bJ¨ÐD*Tõ™zîD@c¬™M̵¸_3šøk@î-Ð÷ò£ÁX&:~üxÂýÑU ¸Ðãü†ñ"¸sÌ'ƒ@ð@¼£¾¾þd;½ô£ýhnÌ1ÈÒ·„(~ÞD#¯‰üz¢¯ ?‰?ïÓ/o‚ï}|'L «hâ´ú9±oœyîMÈ) Ъ}\ÏÐ×i)‚®C1.¤ÔÈ›-ø‡˜þñ|_eeåq¨0ñ,SS©AÀñPŸQþëçÏŸ¿ŒÀeí‹ÿ{gÓI…áj ¢Žƒ!ÁµX–þþ)ìܱe¡WJ‚£LÒ.†J{Þ‚·9sçVSM¦»ynRœsÏýìçv×{«è»Ûûe‹¾¬®Ü-üò}ÕŸ…ß~}_õ«­û”U²½Íñ÷É dazòÎéðæÝŠv”ÊZÈ}GÀ›ßuLÖGm#ÐÞP¿qw`?<4ˆÏÝ6ñ›+‡‡‡›{{{?Äwü¸ººú]Ô!Aˆwèã z~Šÿåÿ|||üÛÑÑÑ»8ÜWùY¤}µîÛö5á·èKè³ð»ûp¿šÂ?^•ëX>î(ô^0÷ÚFÀWúú,þÞ ä²r#à Eî{ïh¶¶¶–t‡ ~™°ÙÝÝ]>88ø|ÿ›¸Sðíæææ÷{±»SN–< °ôû¸]ÿëååå/¿Ç/îýqrr2<==½ŽØMÜ1èsúñ}üzÀål-زñRø³Ø—¢¯²Ü‡ûÖxJˆÿ-‡gùk!z–ÁäæŸÅÚnaŸ´!ðF ×U{åÝOî;ûšÌ v÷Mˆ¿ê6ñÂÅUÀ@ßLo.\Žo%\ÝÙÙyµ½½ý:¾ è˨û*î|±¶¶ö:¾›àëØT¼‰» _©- x~ôØÐÿ©#n×ÿ}uuõ6~?8öO|ï¯øþÛ³³³wqU}~~~Wø£x½7ñúmâê~BoÁÍÖ¢,+±¶•Ðw ¿„݇D?o ¼Q@øÌ,% Ð,Íé%ÎÅëZ¾Å< ¼D¿¶)pÌu½(m9†óâ.ßiìëýñSÆ4”b“ÐèNBœl}O6ºMušõõõŽøèâRÜQXV›••µÕ éßúýƒAÄ–|Ħb9|Õý,¾ý°Ñ¿.4Ž>í «X¼¡õe•óª£6Qß'1….é±ÏÃcœ—y>ö ¢çZ¼ÚçZ<ÛnÒº´qç]OK§Šª}}ýoˆõñÚ¹ ÿ&^GòGkó… ßÄkl$_Wä:†Ã¡üQÔ…Èëõ§|Wíîð•¯Ï¸¢©»Çi«¬}Ùì[ìËb-?‹¿„ÞokñÏe¹]îÛcF7ãñå“ž™@{}æ1®›€×ÃVâ-ßVâ.ß›‹}ÿ²LõÝN¾ûʾÆð˜ös>ŠÇåò•\~›{ÿ爐÷kÞçÓæ¾5æ@¾³ŸÔ&—Ù¯YÅÊÃ-ë#‹¾|Yä˘ںûÌcEq›œÇBà%¨‰dËyû5«XŽKÈ•d]&ëü´6÷a_ýËwʾcØ&À‰w†gŠ©åu´/[úŽuYojåšNw¬fs¬ô•WR]iRYWâ˜U‰c­<Çj¾bŽÛ¯åsYÍïÚ,ˆe®ï¼¬“Çs;G8ÉÎÑbM1Õ¼®¥ï|¶¥_æ5tWÌñ\§ôkyÅÊ”û*ËÈC`‘<$œµrÇlÅþlö]Ö7^kë>d\Ïyìà„;Ç‹7ÅÔkëœcömÕµýÒæ²I¾ÊœÜ‡ó]¶o½®öÄ!0/ú iW½·o+öms,û]幎|Òà„»€‹:åCª=úÄju<ô¤2×)ícÚ”}‡À<ÈâÛwÞ“Ú”eå=fYÏqì‚ऻà üD¯ïó¤o½'šÝ@àEè+Ø}ë½HˆÏÉsb¼<'ÆÆÈ1Fš}zßoߥ×÷ûÕíÓܾÝ=Ó-õr—ï™9}êžµê[§êÔÿ_ÿúW,€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€@=HÕsâI; P]V«³VÛ·"a¿ð ¿°bŸw|ðƒ\H¤RÅ[é9É®[Ýg]Ï[qáv(kžñÅ/~qÍg>ôÐC+®ûò—¿¼ìü»îºk霯~õ«ËŽ=ztéØSO=Ýpà KûŽ;÷]}õÕq߉'R—_~ùÒñ3gÎÄã—\rIÜ×ÛÛ›:xð` ÷÷÷§8éýû÷ÇðÐÐP¼&N§öìÙ÷ŽŽ¦vïÞÆÆÆR===a||<ÕÝÝéOjrr2ÕÕÕ’íâß'Þkq»Îf³©öövŸÏÉår©¶¶¶¥ßhI®O …TKKKü½öñôôôtª¹¹9îwØ×,þŽÇgffRMMMq¿Â>î,›C@e2ÕØØ8«»¹P.ˆqÜŠù|²Où”'«þV^åk¼&9ßÛ|>Z[[}MHÂzG‚Þ‘…d«wÈ×½GÉõþ¹,œÉdBggç‚ÞË ÷si»xžÏ÷»ô./èÝz·ô®½ë ###ñ¸ÊÀ‚ÊDØ·o_|žÊJPY‰aŸ rTŽâo•¯ òÃ*{ñz•½¥sU>ƒÊgü­²ûÊoܧ2÷©Œ/]“œ¤º!U',;¦ú$9%nUŸ,;^zPuUéÏ¥°ê©xÍZõðÒ‰›(­Ó“Û­V·Ÿ¯.?_}œÜSÛôœûJÎ'@ "ÐP©ˆl ¨M‹û²zÆ À’š¥Õ(M«AšV¸Acµ÷›Ô˜nÖï5î;Ô¨òÚ¦ý–è¼vÌÏÏïòùZ›%H6y«ÕXËbØ[¯>–„[nU¼|n«îéýÞgÉÐk|¦¶,€ P[ JNNëôâ6¯o÷Më[×6YgöþdM~ûºi}{fõÍ) OhFkvvv6§ïTVá)ÿÖê{úÜ)ræ¤\š“bi~```^Š”Di¬ŒXEé° x¡P<@`s ,k˜oî­¹ Pk,Ð' •D_üRoT³z¢½G ¡=jí™››Û×ÐÐp‘XÔz‰îqDš«îª5>¤€ °A#ú.žÐwñ¸®;+CŸ ý é;:¦ïè°ã²~ÉÊj$+ +$æ“o±Ÿ•|Q˜  p!(.Dˆã¨±.øùŸÿùØ ‘4&”t÷ʻ݂½í·k=¢Õöà/Ôz›Vïc @`û<£GýOIpLëi)ÜÏhÈË°öç4cVC/–þ®ëo‹¬ ¶/x*’ €ŠÌ"-!°–ß 1ª]£zD‡Õ[ÿ2=ý­WlI,¸) @ÛB@Š'dðÇzØßhHÝ7ä/ÃÎ#<û>°•€Û‰b@A”†ÀZ € r‘4Ô3X†¥á7ƒÔ¢é¾÷õhµ{÷ûµ¾U«³@€ 8©þ|ü÷‰‰‰ÐL™ÅöE(ó3Àp‚ ‘ä8* € Ì¢5,•W üQØ÷yòÜ.ç@7hZ¬Wiÿ?ÕÇù†5®g7 @x.¾,kß•µÀŸëâgµÚR ¶E} $÷D)` %°$PThüˆê™ÀRùL~ ûvÈw™Ö;´zø×je @ÛIÀ €/jXáÊ·Àÿjkkë—•Àœ#€B`;³gA`ã–Œ_Ê€À&X*úxÆð 7Üzýë_¸µµõûô¬ŸÕêéôX @€@EPgŲøh6›ý¯ÿøÇGÕiáø•úˆ¿+*ÒDuH`Ià¨Ã´“dì4eåϽüŠÐBûì‰ÿZÞéHò|@€ °A¶øM Qü QüúÖ¾%C6–Ó!ð| ,@žï͸¸ ¥2WÖˉ¦æyPcëþÝáðï € @ J`P%E4ë‚À’0R©%‘Ø~ËÊX"ôÿàþ`‹¦Úy¹¢ã^~åg @õ@ Z(¡ŸÓú÷²XÐp† ÔCΓƊ °L8©ˆ T?eå*úzè¡Fé¿]ÉûÖ;«?™¤€  ,+CúŸ|òÉÔ¾ð…}ÂñãZ¦>±j@€ 𜠌iŠÁŸøÂg>ó™ü*C|c”Ï/Ö3eÂK=ƒ íØeåFŽm‚Ư¥lâíµ×¾ZŽü>‘J¥®ÜÀý8€ @`u¬!ïÕ'=D@m¬ÕÿÕö­~7öB Î ,dêœɇÀ…,+/¥½ýš÷ö—%ø¿ýB7à8 @€Às"PP{ë}jo=öÅ/~qZÊ€y)Êo„" œ¿!PF`E©);ÎOÔ;eÄ‚¿œù¹ÇÿE‚óY­·Õ;$Ò@€¶‹€ÿFŠ€Ÿ}øá‡o¼ñF|lxžSV75‘*çO`EÙиþ´„þI{CCCÿÖ#zžÿc¸ @€Às$ðÄÌÌÌýÁüÁ¾^ ;,]°(¥A"°BÈ êœÀŠ2aÁÿöÛoo>tèУÒ6¤Îù|@€ Piì4ð-¿÷{¿÷ß±UÞ2ÀXêžÀ a§î‰ ^ ¬( üï¼óÎÖýû÷ÿŒ¼ù×ë›Aº!@¨“R¼õ/þâ/þhpppE@µdñÜN+„ží|8Ï‚@XQ,øß{ï½ÝÝÝ¿(ÁÿÝG¢@€ °~9)ÞùÄO|þÙgŸG°~pœYûV?µŸdRH`Å»oÁÿÖ[om¼òÊ+?"Áÿ'á@€ PÕf¤x£†üÍ´–ûpâPÕYLä7J`…´Ñp>ªŒÀŠwÞ‚¿ÌüSwÜqÇ?‘s¿ÿKéIWYšˆ. @€ÀNe³ÙÞö¶·=µÆ¬¾EÀüØ][VCµ•ÖM”+•@C¥FŒxA`ƒÊ…÷ú§ßò–·ìzík_û§êõT÷ã}ß TN‡ @õ@@CC÷Ê)ôk–€ô¡C‡þ¢­­-<õÔSåI/oo–ç7*ž/qÅg¼òw8¥^_â^ÿ7©×ÿw.p=‡!@€ °D@Öç …Â+~õWõŒÚ•ó‹Ê{ÿË/]O•L€ÑJÎâv!« ÿéG}´k±×ÿݺÇ!@€ PJ@Ö]²ø‰»îº+…5@)µ@ \€ª…4‘†Ú'PþÞÒë_ûyN !@€À¶5À™ñññ;>ñ‰O` °íôyàVÀ`+¨rÏ­$°šðŸ~ÛÛÞ¶ë{¿÷{=ÖŸ^ÿ­¤Ï½!@€@5À®ÖÖÖŸ¸óÎ;ÃáÇÿßu”ù5šÔraªF“I²j€@ù»J¯ d*I€ @ÕBÀÖò ðJù8‹o€jÉ5âYN €r"ü®D« ÿôúWbN'@€ P£l `ß²˜—5Àÿ‡5@ft'«\°ªñä’¼*#Pþ~ÆßÒ¸¦ß÷¾÷ÝÓÒÒòÇU–¢ @€ Pl pòäÉþûÿï3XÔ@†ÖQ°¨£Ì®²¤®þzè¡ÔÃ?œþà?ø!i_«²ô]@€ !`k€žžž÷¼â¯ø’¦øò—¿ìiW´_k$¹$£†”¿¤5”4’R¥ÊßÉøÛ½þ<ð@óÑ£Gÿ»Òõª4mD€ @ ÆÌÏÏ¿çG~äGþÕèèèü¿øE+¼–.å¿K†À¶À`[qó° XSøôÑG/¹òÊ+ŸÑõW]à† @€À¶5ÀkÔQuÛE]ôŸ¯¸âŠYøÙ¥íÚÒð¶Å‹A`5(V£Â¾ P^1úwêïxGƒ<­>ÔÞÞþúݲ㙀 @8)®9räÈ_ýõÿ®³³3¿Ê€Ø¶=ß=8í P.tmÇ3yÊ ”¾‡1l“ÿn¸!ý†7¼á_§Óé,¿€ß€ @¨Dù|þY¯þÅg>ó™yÅ!•˜Iu',ê8ó+ éåšÐ%áÿÿãÜ~Çw|UÚÔWW@<‰ @€ÖE@ΪÿÙë^÷ºFMøg%S®èðZ×Í8 ›LÀ&åvë&PZ ú¢¨ °Éÿ/ÿò/ß°ÿþcÚw`ÝwãD@€ TubÝ!çÕ÷ȇÕ½$ 2  ¨Ì|©¥X•WdþÒ4©—¼ä%Mš"å¿Jø¿¿–LZ @€ ° wý'¯}íkŸ‘àë(V#ľ­&€`« ×÷ýWþ=Þÿ®»îj~øᇿ"áÿ¥õˆÔC€ Ô†††ïÓ4™¾¾¾¿F PO9_iEPùP‹±XSøûÛßÞv÷ÝwC‰¾ºNš @€ p>ê»OJ€v)þGWWWêĉ姗·¥Ëóω €ç„‹.@ ¼Âòïèé_¦ÿÝ×]wݳú}ÑîÁa@€ Ô,)^.%Àå§Nú’¹† ¼]]³u˜-|ùË_öt€ÉZÊiKi~NÒÏé*.‚ÀJ‰Àï#I8 ÿùÈG.–ðjå%ì @€d ð]sssK`gÙnK'k)œ¤]º06D€!ÂÅÉk(­Œ’pþê§~ªçðáÃÏèºæ5®e7 @€Ꞁ”7i8Àõ'Ožü}Y¬Å#ik¯uœý8/çÅÃÁu(­„’pþ5Ý_û7ÞxL•Y×:îÃ)€ @¨kj7ßpçwîùÆ7¾ñßžzꩵX$m³k@°&¬ƒ@iå“„íð/õêW¿ºåŽ;îxJ•Øu܇S @€ Pûù¥>øàÂÓO?ý—(x%6›>6›hýÜ/øâ$œò˜¥]»v5Ýwß}­ý—ÔR @€ Í!ÐØØøÏ}îs?üÐCY^s[;YK´ÁK÷†Ày `p^<\ƒ@ie“„£ð/@ã{ßûÞ?‘æòèײ€ @¸†††ï~àþþ[ßúÖ·Ïc p»pË `°œ¿.L ø}fö6õ¾°áøÀç%ü¿â·á @€ @à|ÚÚÚþÓã?þ²óX$íñó݆cX"€À ë P^ÁDÁ_×¥Þýîw7üú¯ÿúoiþÒXÇ}8€ @X xÛ½÷Þû)FÖ˜ ¼¾Ž»rJ½@P¯9¿ñt—W,Ë„ÿüãVåô£¿-W@€ @ç# áÿG¯»îºÓÕÕ•A p>R»"Äq8¯ðÿ±}ì]MMM @€ °5:;;ÿùE]ôÉÁÁÁ™5|”·Ù·&"ܵª  ¨êì۶ȗV&K=ÿ‹¤žÿ:::þ`Ûbƒ @€ PŸöïßÿ†3gÎ<644´ÐÛÛk ZËÛêõI‡T¯‹ €uaªë“Ê+”¨°ðÿþ÷¿¿ãÈ‘#O‹Nc]"ñ€ @Ø{^ö²—yòÉ'¿ô•¯|¥ô‰åmöÒc„!°DÀ «(¯H¢ðôèQ{üo|ä‘GþFÿ¬r» @€ -  ö÷Ír øìØØØ×¥°@²”·Ý“ýl!°DÀ eÊ+(üëœÔk^óš†O}êSÉãÿ=e×ð€ @Øb ßûÒ—¾ô?ær¹ñ2%À?™ÛW;Õžƒ[ÿráßOñ¾´¦ûKKøÿyüÿàÖ<š»B€ @"ÐÞÞþV9âþd>ŸŸÃ)à…hqðËUÑü»óœË!@€ @`ë tÜsÏ=zã7Z¦[²Ö] 'O/íØKö±­cXÔq毑ôÒJb©"±Ó¿·¼å-m7ÝtÓ7u]óײ€ @Ø&òpðÎ;ïÜ}êÔ©?yâ‰'Jý”Æ ´}_ºŸpÀ 3ýö+ª\ÜþhñD@€ @à|4D÷n¾ùæÏ.,,dq x>RÀwÀÊ…ÿd_þ{ì±ï‘ðÿ(¨ @€ Ê$på•W>­é›Wñ D¸´ÍŸìc[gPÔY†¯3¹±rиÿÔÿøw577ÿî:¯ã4@€ @`g´½þõ¯ÿÜK^òœî ÿªx* €ªÈ¦-d©&Ðádõ»ÑpË-·ü?[útn@€ l 9|ýoüÆoÜQæ iß'Ï(mÿ'ûØÖ u’Ñk$³´ð'CܪÒH?þøãoQ%rtkÙ @€ TîîîÿòÝßýÝ-W_}ub Ä°´íŸìc[gPÔY†—$·´HÂQø¿ÿþûÓïyÏ{º[[[»ä|‚€ @€@åhúþïÿþÿxë­·& €ØÆ/‹vÒþ/ÛÍÏZ'€ ÖsxýéK*Ô¥—^Ú ç!˜þ¯ŸgB€ @ b444|÷¿ý·ÿöNùôò¬ok)’öÅÄ›ˆl=Æ­O¨@¥…ÝádM»’øä'?ùˆLÿo­Àx%@ÛF@S)…Ù¹…07?Ʀ áÔÀDÈÏÌé÷B˜×±¸ÄÍbxÛbƃÖ$ÒçL«¾a¡£¥1ìjk mÍaw{hoiò!@uC ££ãKß÷}ßwàk_ûZöرcI è–Ã|¼êæMXžPËyÔï¤ð;­/­2ýO½÷½ïíiiiùt=€ €ÎGÀ2þÌì\(Hè?;<>ÿÕÓᩱ|蛙ߜyŸ(Îw#Žm”:¹ÒášÆ†pÿþöpëÅá¢]­Q Ð.…@ñ“·}ÑáI€v˜@Ó›Þô¦Ï}þ󟣎ʼÖrá¿ü÷G™Ço5†l5á긿 ~Ú¦ÿ·Ýv¦ÿÕ‘gÄØbî™Uïÿ´„ý¯j6¼JèŸFðßbúÏñö±?K– ó¡07²Ê4+pŠVtw=Gª\T1 ¸ÿw~çw¾KV¾åÃÜþO–Òp²mð˜–ú!PZ¸NÖhúÿÙÏ~ö­?X?8H) µ ÌÉüB¦ÿ“¹Bèχ¿>;¾•› #sóaJf'£À¹ö=8²ÍüU[H‡6möÉÞ¿E]ÍéT8²¿+tµ5?zŒØæLáq€ÀNuïÃííí¿ñ•¯|evddd§£Ãów˜;œÛøø5…ÿÛo¿½áñw«rø×Û@ ¢ ,hx䬄}[Lk(Àô\ó©Cè¯è|s䤻 9+jdךømû@õH éµ¯}í箿þúR‡€åJe…òcü®!(j(37˜”¤÷?å9B¯¹æšÿ±Áë9€@M˜—´8U˜'r3ü%L¦ÂŒSmAa²òò?Í°†¹0!¥ÍP~6ŒkÍf4`V 9¹m ã*/㈠°Õ<@¾îc(ÀV“®üû£¨ü<ÚŒ–jôÁß÷M½þõ¯oøÌg>óyL¾v3Ä= Ô +&sÓa(S#RL©Gy\RÉ¿²³X~Vyׯ±ÿ'³3aHy—•ÀJ€iíCþ¯ìì#v€ÀÖÐ0€/Þ{ï½ÍzB"”n·îÁܹ¢ ¨¨ìؒȬ&ü{Ÿó>-Ï ­­­¿½%O榀ª”€…DOõçiÿ2y ÿÓ³aɱjrÓ}üyýÉH×x€â0Žù8¤ÃC;X Ô)¦·¿ýí?ë@¥ß²@©œ Ym_rŒm @P™¸Î$$…ÙÛ¸¾úÕ¯nÐÏèwÓ:ïÁi€jž€ÿ¹èý. OæÉál8-'€3}ÿÕ<„jN òoVë „ÿsöÛ ã²˜ÈBvz&زƒ€@½ÃïŸzÿûß¿ë®»îZ’ Ä" 'Xü›¥F  ¨ÑŒ]LVyáM~§äø/ýK¿ôK]ÍÍÍï­m¤€ÀƸ£ßJ€YõgåùoDc…¹³àèƒ,UA «Xö)»òÊ·‚9æ”—žÎ‘,¬Šì#’€Àxñ‹_üYɶHÿÒí>™[W• [‡ÒBípº««+}Ûm·aú¿õìy PE,º÷ßsÇÛi\t(á\¿sr,W4G PùYš|öB˜–Õ†óqJŠé ÷*?÷ˆ! °µäûëßþíß¾‚¡[˹RRsæùÇË­Ÿò% ÿ*ìizy}]ù ü† Pßäå_½ÄíÐÎÿžš 'åI~DNã$ÈêyEôÕËJ¡3¬<˜(„Œòs^¿Y Ô;K.¹ä?ɘeÁDcZº­w<5~5½1q¥…9†]ØUèÿsí'BØËög4…\ÑqÜBÈh(@F2cœþ/Þ ÀƨîÄÙΣb>Ù@^ù™SïÿŒ”8¶ò w"Ox& PI<ا?ýéWÚ'˜âU*/”FÓûYjŒ €ËÐÅä$…µt ö#<ÒðØcÝ©BMm&TAx$Úü$“ë„“ºÝ¸ÖYK p·ùRç—Æÿgä°WÎÏŽgÃØTAŠ¹0'E€ý<°@¨g{öìùüµ×^[>#@”J¸$òDÉ.‚ÕL@5çÞêq//¤Éoçuº§§§a÷îÝ¿»ú¥ì… Pß,ºçÒ^ãs³!«pF;G´".VÛ»áL+Zp *?2…8´ÃÂÿœÈÿÕ–ŸÄØÝ¿ú«¿úVuF9A÷O„ÿd»ä–;MÀNçÀÖ=?)¸Þ:ŸSšò¯á£ýèÛîܺÇrg@ÕK`ARáìÜ\ÈÈ@¦0rRÄžÿ˜$TÕ—³ aZs7f”‰“²ðP€i)œÇø¨¾Ü$Æ€ÀæhkkûĽ÷ÞÛªáÁK2Ã*Oñ1–!€ F2r1«NïK:t(ýàƒ¶¶´´üzm%™Ô@Ø6 ÷ Srøwn4NæÃp^£}ÆEÙµ*vsžÍ]¶€€»øµŽ¨·ÿLa>œÉÎ…±Ü\´È*[ðdn @ ª¼ùÍoþðÕW_]î ÊU•"».(Ö…©êNJ ìÒö¯xEúá‡þXÕ¥„CØQV´Y¸Öh 9ã'§gBA ïL‡À6dŦ?"¯ÌÍ(_3sÞ¡Þû˜‰äç¦Ã憀@Uhjjzç'>ñ‰ýGVÃJÄjïÕöUezë=Ò(jç X­PF€{ÿ}ôÑ]šöïŸÖNrI  Í#`Ó †ž'ÞsÆÊY\ßÔt×ïY™Çéÿ6ïqÜi»HÆŸÕ³&µÍ(³੽zºÇEÓŽíŠ Ï P±n¼ñÆßÔLa¥£¡¯&cTl:ˆØ…  ¸0£j;£´°:œ~ñ‹_ÜðÒ—¾ôCÕ–â @`»ØüßÎÿ¬ÈHp.3Žkîøþ™Ù‹óÆÓ[¼]y±¹ÏYðD¡_ù;f+åïDnZN§ãTäêæÒæn€@õPGáýÿò_þ˽²(—%J…2 ”F•†QTiÆ•E»¼0.\õþ§ÞùÎwvÈ´çË®á' ,HÓ­ÐPñ0¥µ 1 ‰HŠUý®8û”°rrê`EϬ5,€ °Dà%/yɯ•YøX"W,G º  ¨îü+}iu8öþßsÏ=?[~"¿!@à;f56||JNÿ&saT¦ÿCÏHX²¨ÞcLſêZC 0.ß}¹0 µ ëæv¬ÖÜ$Þ€ÀVÀC¿ôK¿ÔíDÝßrb©l‘<ÒûXª˜ €*μŨ—¤ ÆBûÆ7¾±Mžÿ¬ú“I lËøõ çÝ;ì¡úÝë} }Ü:èÛ|gO瘗¢gJJ€¬V+}äöq›cÁã T69ÿÅ+®¸"™ ‘ù¢²#OìÖE ÉÔuÌIM ´`Fáÿ{¾ç{Þô¦7½§¢cMä Tâô3a<;}LÇ^ÿ ˆQØò•ŸsZ§¤äËÏÈ€fxPxNVs ØÆܨ6üÖŸþéŸî:pà@”'”®dë$&ɶV’]Wé@PÝÙ]^ø%€·é»îº«©¹¹ù§«;‰Ä€ÀÖpoðP¦Îg5ÀŒÿmý3yÂö(H0¨žÿc…pv<g{ðÌÑ…ÏöfOƒ*šÀk^󚟸í¶Û+€Rù¢¢ãMäÖGÀú8UúYIÁt<£–îþûïoøáþá7Vzĉ $`¹ÏSº'8?=…¬ƆÏxê¿hŽ‰øNæÏæ=»hWoÿ”„þ¬†yÌHécá^ûÿ74w‚ªŸ€†ÿÔË^ö²F¥$éý/•5ö’l‹¿ø[5PTMV­ˆhy¡ó臘UpÓ[q; @`‰€MÿÝ œ›ž “ùpj,zåpJbœ?ù‰UU$ä[©3¢¼>W˜ CùÙÑ0€©ütÌ{ÏÁ@ß!ð/þÅ¿øw(jO"_XÖ(—?¾s¡ª!€ j²j͈–Æ–Æ®áSŸúÔmº¢sÍ«8@ Î Xæ³`fn.z„•@xNÂÿ`A–Ú–¬êTM$Aúœâ¬g4öTCr²øÈkë©mÂ@ß!ÐÕÕõñ\.W.ü—Ê>…ÀwUM@ÕdÕ²ˆ–6ÿN hºP(¤<ø©eWð€Ê,Dð‚„ÀÂÌ|ÈJœPÏƦáx‡/cU?g”Œ¹T:̨ÍêÙ²RöØ µ‘¿¤ØT»üñ›Ý±¨»&rF"ƒ$ÛM} 7Û(¶‡óV=Å…/)€1|íµ×¦ÿÃøÓéôõ[õPî @ Øù»{€ÇÕë?&ïÿùÙðl~.œ’2`Âé®…l^–†iý:«|RþŽÉâc$““¹é¢€egò€>üɶ¶¶Rá¿TöH%²Hò›m…@Pá´JôÊ YR½M_zé¥i)~f•ëØ@Ëx ¸¢›dõŸYHŃðe jçGüb¦Â¬2xZ–9%@Ôõ鵓ϤØêP|ч?üá½ûöí+UøÞ‰ü±)Ïá&ÛKÀöòÞ̧•¼¤P¦ï¾ûîfÍßùO6óAÜ €@-°Ðgða9ÿ•@VR¡{ˆm&ÎR£¤àñèŽB´PÞkêG[XTœõ¡FÓM²  ÀrHéRþ»ôá #€ Â2dƒÑ)U¤î½÷Þô»Þõ®û6xN‡ P—ìøÍSÿH™’Gx÷‹DÞ4ÜÌZ³ ò’÷G5äcpÒ €)4àb–;ûY @ H@3‹½ç²Ë.+U$òc©®*"d`E¹®£šh×J œÃÎÇt>ŸO÷ôô|¤® ‘x@ë àÞó·¸ÉüLÈf´ÿ[ d©aÊ`eòŒ2?«)'e’×;` €y+üR°@€@)ô¯üʯ¼ØÚ¹š,Rz.á* €  2é4þ;¯vËD„ë!Ô wö`ao"7¦äüÍsÂ{ýéú¯‡w`)În­y™ÿg 3Q à¡!ž&’€VÐtãÍpÙå—_n2Y¹dåì©H(*2[ÖŒTRÀ’múmo{[«Ìÿ_¶æ€ HÀ‚gÈkê·¾ñl852äü/ÀW¿oˆdýq9<;– çƲr 9æ4„ýD°@€ÀJ×^{í\uÕUÈ#å[_ä},J@…fÌb´’“,ïNÂéÛo¿½áÁ|qe'ØA¨ þç=ÕŸÿ©çÒSÿ©÷W#´ ðUF.mg,œçRé˜ÒP¬œÚ! Eɺ±áY€ª@KKË?³²âê5‘KõDnq˜¥‚  ¨àÌY%jIÁŠ…M0½{÷î·®r» @ „€º ûy yS…Ù0”™g' aHႧ~ÓTq) …E…ášæ`Ëåû¤Ìþû= 䔧œ y)†<À #@XA éCúÐ^í-U”Ê(+.`Ge@PYùq¾ØD¡_'xë|óô©æææï;ßEƒ Éy’å¬(¸×_B¿MÿOÍ„^y}Ϩ8ž€@}½*‹ € ûgr¢÷ÁÊ!Oèw…Qõõ:Z@`ýn¹å–ûî¹çž(èªRÅ7A°~”;r& €Á¾¡‡&…Ê%ª»»;õáøІîÄÉ€ꔀŒº£‡wÿ/Hà³ç÷¬À‚;ë” É.°ˆœÞ‡¼Öi þîýÎÑðŠ@X•À®]»Þ}úôéDF)ß®z ;+‡ €ÊÉ‹ò˜¸0•.ÉooÓwÞygƒæá| ô€ °:Oý—ÉO‡‘É|œï}¸0N΄Ðg!/ö£X\-ï-æý  @žY}r8®!ãÙ||W<[„_ @XN N¿à¡‡jÑÞR+€ä¤D!üf[aPTX†¬¤ 9¿bøßøFª££ãÇÖ8ŸÝ€ PB hPôP˜UO¯»1Ï–œC°> ØûÀÞé„´„~À@}¾ ¤X?ú¡ºéºë®[’Mte"¯”ÞÄûX*Œ € ˲蔤$ìmú]ïzW»æ⼸ì|~B€À*Ü“;¥¹ÞG3ù0¦ñÿ{{_å!Á¿o<3…0¥ž^‹w,(H…u^MÈIä°ÞqÍ0[œ@€ ° ÖÖÖG§Œ“:¥T~) ¯r5»v’ €¤¿¾g— ÿ1ìéÿ.ºè¢¶¾Ë9 €@}ðtnî͵iwF^Þ§<Í›öE ÿa­o‹ÅC#Cä r>Îáé"çõÎÄw¤¾‹©‡ °ô?øAO¸BVY¼%ÀZävx? €΀ <>)8Ë VWWWƒ¦ÿ{ý®å0 º'0§žþi s9M÷çžÝ£¹pjBÃ4ÀÂüœøHÄ[VÃj¿ë‹AT͇ÜÜlÊM‡³ãù0¤¡"VÌÉr„Éê¾ °Ûo¿ýÞ;A‡Wûr&WùKh¬ ¸•"¤”o}4uøðá´¦ÿ;,@8?ËuIï¿=ºÛ@¿† æ4@Q²ÓY>‘¥~ økk€ÚLÊ:dD>öä›4@zGRzARÉ'¹~1‘r@å4-ù;wîóÚïNe¯¥£ë\qò…„J[°¨´Yœdëæ›oN_{íµ¯[~¿ X ¸ø3Z=>œ¥ DÓÍï.¡.'¡?7#oZ'eë]б¸õ5˜ñM’_‚ù˜õúå5LDCEl9âúÁV$®/XjÀÒw`¶8óCÌs…­8d.L@É_ð†7¼¡Yg&òJéÖ7ðo– #€ Â2¤$:¥f©0={ÖÓÿýDÉy! pÛξò2 ÷:½}oð&œ^ñÜ„wƒ~bJ&ÿZG³3áTn>œ”§÷½uŸ…ÛA)3ªÎJQôLf: hÍh8@6¯#<\ypûòbŸdA?¯üõ¡œ,„œß9)P oc&ð¨ª'ðÎw¾óE×\seÊ%ye•D•Ê5«f×v@°´×ÿ¬¤”$‡Ó÷ÜsO“´m{Ö+΄J ¸7Ï=ÿžçÛ ¾œ¦û*¨ñ·Ôóc“_ ‡¥®ZÑùŸò:Îí./«¼Tæ–Ú(VmâˆøæX,ì~'r*ÿ“ª ZÝû-\'lΓ¸Ëp݇©.˜‘µ‡ë}¦$ø{êG[~X0£:£èÿœßá,ãñU@àÀw^~ùåå €D†©‚Ô_ñPYyžþŽUN PܾùÍo>TYQ&6¨üG&s±¡ç)áÎŒä¢2`_gsØÕÞÚ[þîöÐÜØRZú[=Ù»"¦jëGÁd²†'óaRæÿ…T:L§$êÑ®_Á«¾wH Ô;1± ©…´|DÈ€ÂIÕRº‡Î¶Äµ¾)Usê-ÐÏJ°Ÿµ’'[™(øÏ„³#YØ!¨ò^;[›Â5‡zBwGKü´ê»ÆD5g=qßbmmmo’€ë1åJ?ÙÅŠ/®ITЂ ‚2c•¨” ÿé—¿üåé+¯¼ò%«œÇ.@`Ü“wïÁ‰œæƒÏ‡ÿyr)º†ž&õþœW0ŽìéGöu†.)*Ü!`÷¹!HgPB·2·ÖÜà÷øíŒòöÔèT8'…O¿Æùæçeê‹4W™WA±ò4‘ƒ“ÓÓ¡Mx…¯ Ì¹@T,]x¸—}¯}£™0®þYPX¦ÿƒYíÏÏ…¬”‚§r…0©ï„•»Îïa]³0?öµ7…ë.î ·JèïÐw £µ9´ÊB,iœ] †@]¸õÖ[_$+€YÇÓ|§3³®8TKbQTNN•~S^±¾ãïhÓ~+X u°É¿ÀÙÓ¿€£RôJü{5ìÇÔ@<«Õ*ê^õþ4N/„KÕËŸ™ ÝR¸çßV¾‡Ç‚6ê÷¼„µ—,lÀR‰ä´MkåŒ,Æ= `Ìo:*1Ç*&N‹_ÞY)‰r²ÉF‡pLX1ù³FDŠ:=÷ø[¿W4õw¿=üÛß‹…ÿõøɆ!YSÿMÍ’×ùY){–Ü<úFºnf˜’rÀþaì+ÀÊ–& ñôŽP÷¯‘ì®[»wï¾oß¾}"åò‹™$% –J € raí8,"yØL¿æ5¯¹jíS9”°é÷¸~7Ýûÿ­Þñ0,sϳ™Bþ3jÈÍ[!ë^a}ŸFõi,¤CVúÆòj¦Â.)²êEÞ% €Î¶¦°W~<$ ]û[Õ ŒÃ0 -E¿ãa þžºÍŠŸ¬„ÿQ5ø‡´`z1Ïw<’D 2 øýÒ0«úcT‚c³ÊöA½;V$Y™hA᯲²®˜7ö÷16zŒ¿…vó·Gÿ³ò5b%€ü€œÓ:¦ú}Ä«|XŽÚÂ$IÊãq¦ÓÁÃ@öë;°÷ÜXèio G.²º8De°ýB0,Æ!´´´¼áøñãï‹hµ¬í’ £0‚…½$(*+C’ÂâX%ḽþúëÓ|yeE—Ø@ r ØÙSŸL¿Ç5æóÙÉð_Ÿg$zžïSî öç(ñ¿øiêÓ6›OËT'Ô;Ô=Z{e pMgSØÝÚŽìn ×Ë;´-ìnCÒö °À°€Jz<Î?Îé-Ňôi¨‡‡{ô«Ñ•>1ï3½’"N\vž@|-$J2<'e¡…ËËTîíLrN=Å®\?°T÷ö;,ô{¿“ƒÅ!_ãÿdßDS}675Ń-€†dá%c/õüKøÒtè€þ*gò2û—ò'¯!#ª;th˜¬ÀZš¢£XsÝÏ H1ÚñÆ7¾±ùcûXâ0) ÞzUéŠKixq›í&€`»‰¯ïyIaI¶éÞÞÞtggçC뻜³ P¿ÜPwƒ0«ñÞ£jÀÈ `H=ÿ}êÅ;¡Æà°}Kí¾äs´ˆËý;cþ£’7mÈCxýÒgçÕÀl“2`Ÿz•àpm–©/?üð¡Ç{ìû,SÊ“5àß|y;¼E°Ã°øøÒÖDiI©Ç§o¬Œè T&â4¹húióÏÿùÌP8«mŸÌ>OÊáÓ€n3þþ¤´ú3´êç¨hæËtp>ŽåæCG!l=0Q“À†p…z÷ËC´§‹ºlWTtÅaÍÅF!þvì%™UcßSÿyˆ§ÿ›PÄ€ò1{Á¼ß±(óàŠ!P¬Æ4*¨WåÝþv7%k’)÷Pòí\FűýR¾ZwoÿØ”,}fã¬.½êñ·¯Óòïâé>Ç>%E€¼X£mqYÜ&?×JŽêþ‚Î9#E°ˆ Ë/@lj‘pJÃÉ.“õ×-W¤‚ëûÖ–ÆX÷3,d-ì¯'šªüe²X>þ7ó7Kò‹ÒŸ„]êVmuÕ£JI+ €Jɉ•ñH LÜÊக§°H¸gh^6÷ OjŠ'5Ÿ–篸Zñ6ûwc~Iø÷…åÀä÷Òv!ŒKYð­iOÿ§1nêMjËΆý2ý|™Æ–”…Á%Ým±!8Û&G‚l ‡ÀéüØ(ôÖÏbÙ6öàñÿžþÏþÜŸHra)o·-:<¨ L©>–àØ$Ež-~<•œÍÌ[çåNïú½íÉÔX\õÇNú\®ã”®Ê÷öjª¾ )øžÊ„Ðp/•õcRôŽèü¼¾™9yóWxV®^½]÷ϵ¥‡²P½‘Þ…ÎQ)—¥Tp}~õÅÓ²úÒp} ì0z¦¢_7bN¬MÝÝݯ›ý‚RWî 6\Å©BPY™—|>¼] kZÔË_þò›++ªÄ•C Îõ®!;~ëËjèT”p>¬¼ñÙ…àÆ|þ-ño¤!¨$úô|l=ªYÛQ­v0 q¥©èB*:[&å 1ì“£)=pƒ°S½Cvè^ÃæÆ4ŽÃ¶éuq/¡µÙ ؘòcRæ»Ó6ûun0ï·)Ê<¦’,¾#ÒùEñ9ýΫñlöãéàŠ/Rò‰®¤È×N\\Ž=Fß^÷­x±OOë9¦zÝÖöìJ Þ •ïsêõÔvR•ü°ÎíWžÅi—.÷Ï3«¡1¦ê}êM…¯ögBgc*\»§]Ž; ¸úà®ÐÝÞg hìhÅqØ6¼2œÕV Œg% ä$4µ£òÏœ—1?·!2<¢z ÈêG28£×¦Yöß“R$Zðô»c³ïà yY¶”€ø‚”.öé26•Wý.[ÊÕgä”ïÌx>Œ«WþtN>ʨQ)~=4@4,埲mù²bÇòÃçýåz#5' ¢žÎ+ë5;@vvJ–Esa¯Þ…Ù§Œm—¸K34§‹¾aÎ{OB v ¤ßþö··?úè£3Jb”a·å)ö1¾ÆåT¶ñ7 €m„½ŽG%"F²&4§N ­­­(ÖSê‹À\4ë/Nù6!aTc¾=Õß±©™Ð§†ã™b·ÊóýÔ”\ï1¡'|o÷,«¹Ù-á"•Ö¶ÆÆТÕ׋¦Zâ°?Ü£<< :Œ²í°þ3…”ÉlîⶺÙÛD^½u Y½žÎ‹¦Æ沮黹X«Œ&6>Ó*íTÒ=Ñ~·X6Ÿ@¢¼sùµ©¿ÇùÛ¹Ÿ™»·ßuû¸êx+ôŽÉ˘ÊõÓrî×'á~Þ[]ø5[‘=‹÷T¼RzÀn)ÎMI9¡ÇÚÊhJŠ 7ÚÚš›ŠÎ`]Å3Fdó_îXî¼óÎʨuf.^¼- oE)âÏú  X?«­:3)Éý“‚’lÓ===i-—%'°…4®S ÄõŸTÌcAÿîøp”ðÿŒæmRïÌDú¶ð;ã§ÝCi“Wco\Áã2 µÇùž‰|œwz—Díëj —ì鈾öî*ú hÔ+ð½yo²³cFc~=VÛ†l¦;1úe<%. ["l^¸S¥(zŽŸ‚oPÎD-˜RYö»†|·yyå!;.·®Ó-ìOhêVûï87’ÑPžÙ0&Sû³2óŸ’#¾“RœÕoÇšÔù®æc%·›§Uï¤g.ÌÏi*Á…pRq˜Pœ{z'¢ˆý]­á†K÷„nYyè—¢ä]•";kœÀ®=zôè7¿úÕ¯&rL’bÿvIM¶É~¶;@À@_ã‘.^’³ôûU¯z•lY RnŒÛË»ÇüŸ•gæÿyv2<)¡Ï=CvøWlna«ÐRÀâíídn@‘Ë©±ú¤z‡ÚUz/–è.½I³¼PCºÛ›b¯Gµ.4ÆFbJÅ=)è¥i#ü\¸×Pã…Õ(·@{ÿ?#K+ƒÆ¬ð²…¯Cñü­5¶öÉè‘r±AR¿Ç¡³lW£®Ë bì²k¥î™á©ØãÿwgÇÃY ½“1ñqÕ«öÇ0!%_n±<’r½yÑ9ÿëü³²8’³ÁÝi9̆~Õ5/P=±üÄi`[ä0ÖÎ`©ÜÏÏ“£5I ««ëf9ü¿•8—€ÒÕéõo¾Ä&±Ã €΀ÅÇ'Ÿ‰dëÝÇ!Rì^< ꞀÇw[ÀËi”§ÿ^ Ú}2 UãqTóI÷Òì¥I5d'õtµÿ‚µv3K<$¥@Ÿ±9Å»³e*6ríHlO×\h’S1;tQ2<ÓÑç–yn›ÏJ8ÈkPÓE]Ú7zZÒáà®–pí®èP̽Fû{:¢#)÷é4–ç@ÀcˆózFd"<ªwaTá3ÜFôÎLoûûðÀ%•GÀï”ʳ=ÌŸPêÞÿ)…§%ôy.{~Ga·þls-i3;mõØþ>™økhŘÊëÓ}“a\Cw‘e‘4‹ßTäìofLÊ‹……Á°O–^×]Ü%K€ThoiŠ³Á¸^§Z¯”Ì#[M ±±ñ¦5fØêGsÿ @°X[|j"øû1I8uèСô®]»nØâgs{T<÷ºEçn:nOæþ}ZÿAã¼Ýó: ÿŒE]€§›Vø˜z®NÍφvEm\=]=êñŸV\÷h† +ê)çåÀÃì,P=‹î\D¸X;?-ð{ñ_‡=e˜µå¦g¢uˆÙçR²‰§ñ#à÷Fe0Z¨î™P½³[BžË¬ë¢)øäðÝk–µ Dç~:ì­¸Å!:3²âR=®^þaõüÙ±Ÿ-¹¤\šYÏJ žדQìWX—VÖ²ŸaEpDik”Ñ^¥cJïÈþÎæè‡Äõwk³¬¼æ‹/ õyee!±Ù:wÝuWã׿þõi=ÁUdéê‡úw¥•hÇ«®;›Ý«µJ JÊZ´ŽŽŽ—ìl4y:v–€Íþm"já®o4ž>7†Õx<­ט̾3j„%£þ+í³2§ž+D3ôá™T(H€hͨwhp*tIø—™ë œzXÀî65C[T ´D…@24`gs ²žnaÂÓƒY‹=ŠbÁ¢W¾ Niº°A½+cêeœ‰½†´3*+÷ª)6v(ÅQ›¢{¶;˜´×÷yy|·&;kç§Ë¦Ë©sNÈb˦þ“ržç¡[Y•ÙÞq ÿªÇGUž• ýˆÎµ2wD¼õ_‹*Î /¾E‡f™K…>Õ9yi*öŽdC·¦£µß—+/îûv…èÀ– Yû}áHí¸ûî»w}êSŸÒÄ™KÂ’¸DøO¶É~¶ÛLÀ6_ãq‰" þ}Z Ÿ>}:ÕÜÜ|××±uAÀÈ9ûÕ|ÐÇ3áOŽÊ ³ÆÖ«i‡j&º‹©²X”ÆgA®»gÔ#-£ápZéù–¦°jWÿ‘¶L¸¨µ!ìl ·\ÒvË‹ôÞ®6µ£@#ÕXãhPY©ÛÑØ­Mˆ-ôÛ„‡eÕø~v`"|C¦ÄÃêIì• …•æÃŽÆš‡W½g³Šô€¬x¤n »T'õ^y’S+í˜õ}õ\M”tVÚz:¿“*›£òî߯¡n2ÛRÅl=ÌbXeÙCuf¶ª¦Ztý¢õœ6S¹Tè(̇¼´#ú>],K€6Y´è½iÓpûzAa´úûÂÞÚ"pã7^±oß¾AùXM¾©­ÄVijPTNÆ%…Ä1J©[n¹E ãT[åD“˜@`û¸çß½Hõ¸d4½ŸzÊm.: aï´Œ£j8{þÕúŠK²Ý¾8®ÿI) Åø h3 ÁµG €&©ÜàuÏРÒ6£Æ£g›n‘ƒ@÷µËÀ Ç9“òôqæ€ÒÚbý¨ª3í,lA\lú;§©·¼µ ±ßó²æE þ#êñ÷vXCB†Õð[OV=ïFUeMDÖ…¬X^Ýe§o—>®ìQ½o~›£O•MY¸|zØŽ‡ñ$e´žL¾]6É0‰)±r9µÕ„§QôL bwN½ýø{e^q,öö‹³­u"nÿ)r¯¦Íuö˜Ò0-%慨[RBú]VÞÕš»ÚçcÞ,•QÚ$uŒµJ`÷îÝ×]uÕU»¨ðË^¾V_!¯±ÌB°óZþXVHî»ï>f@Ý°7&¡p<QõÌ`81–jT>«eŸA7—}FÊ‹S…a‹quœµj†€q¥ñäB::rƒÑ^¯;%T\ÜÑ.énC®8°+ìél½{wµESÒZPì=œ[šlL–ž&,£|·Ó0¶™ÿ„xeÕØÉÉû¿Þ‡!ïÇœ„Š~[TÓ»Qa¯*Ñù÷L»¾é–’éoO…>™°ïíhGöuE]W[“¼æh±ÓÑÖ"ë¢B ^œº¼Zç2êÞþÞÑ©0U˜‰ýOiXNFC',ôOÌØ—‚**ì:<=§Šêâ²Ðï ¯Ç“(—ncô5ÜKCNÊ1 ª¤8U`Ûñáp\Nkìé·\±_þ^š¢5@›”»õ¤ *EE¸ö ÈwÙm---ŸSJKešÕî㥅µsØ·PlÔçqËä«·´}ùË_~ðyÜK!P•Ü“äñÝѼ[‚Þ L¼äÂÿ‘Çhíï]&üWé·CitÌÏ*-ýj 7iûM5;Õ3tÆÅŽIѱWcHmflëŸÛ%!ÃKƒ¾©)õ8úÛê^Çj_Šãh• %ÒT„fÑY˜ÆÔJ`°ÓǬL‰íøñô¢@qJ¦Ä½îa” ñI™ÛDA=pY½¾‡FXoXípˆÿŽpï®­w†UF«G7#åÒA)4µgSt èrh«ï[wÀƆ¢U÷»ˆ.•Sª½Èº.ŽøÇeÕõµ…ÏÂak­‰\tðwRcá¿Ö?)§œ´ªŒªLZ™bK —Ñ(üûµ²()N×À|:NK;¦töŒÉ‰”’Mª¯_ 6¶ hò;âi$´,½ÅŸü…@MÐÐå»;æ´Äêo1Qåá*üÕ—m(*#Ï’B±l{óÍ7§>ü‚ʈ"±€Àö°ÙF‚{”úÔ“tBcþ‡¬PÏ’…ÿŒŒ±ç_ ­â·e{âµUOqûwFÆê3úNfå,++ïâûÕu½+¯ÙtlÏðTt˜Õ#ázv6´JÈèT/c‡F™Ûi`5š“Zè·•Gô ®<·Ù°Íªóê9,ûp¯±8¥oYwût¸x·f‘"ÀCºšô^ø}`@-uËÞË/¿<}îܹR¹&I¢÷¹H¶É~¶ÛHÀ6Â^磒/Aª§§'ÕÕÕuó:¯ã4T=Üëfh26&Ÿ:7þljÑ0(ÒcþÔˆ\nöï+ª}qCXiˆb)44àÛ2!š-„–t!<%¿ô/“Éñuû:B·,®¼¨3’I©ç™ö°ûp²šLJ-ü[Écaßcª=VØë)<¢ù°zûÏ(íYõðZÐWÞO뚌°±šÔuSZei&ÌnéUX Tû‹Aü+†@ñýò{ö´ÚVõfwhøÉ×õŽ6IkSÙkÕÚ)î°ÊiGsZÖ;Íá fõ°©÷ž¶8DÀán9ùô÷§\n+&니{ûÝÓï²;.ÏþžuÃBÿ³šÕä¸ÿI•Ï³b”UY¢nP«Ëëøªe´F˪Ӫ iPÊÜ'õž´ë}ÉŠKFõØ>Yu½ôŠ½Ñ„߇®v)ƒô°@ Ö¼úÕ¯nù«¿ú«ò©k-™U›;—uÉw¿t»,<55•jkk{éÎE‘'C`ûXÔ´—ÑäÛ=I#j\Ëôû¸Æ‹ž• é9 €Ëºm_ܶïIEó÷Q=ÐÓaEéVp»¤ûWªM¹«¥!äÔ öôR¶˜; to\Cƒz”<-™D ÷.&•ÉöÅ}í'YhˆíýIœ…ÙÒÃÊÏð0!ïàÎs¯îIô8b WÇ&¤P)ÍçÜ{h)?Ê Þ.®‹»¬ Ž@` û½sÙ”p§ ©¸,¾‹W© ô¾î’À[;ìh™¾¿Ñ\ €–¦ÆТrk¥÷¹¼:\\7!¢›t —WÿÓ&–ÝY[hIàÏkHθÊë°ü´Ø1¢{ûMª «<{(ÓPdbNº°´ÜnR¼ªâ6b` ú®íQÖ£oÙŒxŒ‰Û¤”Fä)_c}­¼Ç *r•H®“À+_ùʽ:5³xzÒ$)ݺr`Ù!(vüâcK B“ØÐÔ³Ï>+±Æ“l!P«æÔ ‰ãFe2*[{b(ôK<¡à›~»êÖR½,1©IzÕS.SÒ3Š[Æ4ÍTƒ”#jp˜ »ÕËx¹¬:ÔˆÜ-GûvµÇÞEû °iéN/EÁ_ñWz:0OÛçÞ~ þ6ï÷¬yõ$«a<.³ê¬Ž¨qœ“1ªsΩ'1/ Sj@ÿÅ%|’mE©;vš:ÏßR~çd¥¥·(Üê÷â{8,s”SêñmSŸ×ˆz}n•RnÏД¬4$@ë>Y´4¥C¶Ý*¿­Rôh Е×f…Ý+l0*$îäâzÙeÕÊÙI)銳mH!;šÂÿ„,N””gU_ŸR½äòšqyõb.±Þv`gÓâèìÈ¢ôLj궓ªçlÑsvS¥?®—­ ³âγoœœ £*»ÿ»w2œPù·NËÉbrn6LÆòªø%7XÕ嬖ªåzG¬¼>kªëöH¹Ù0˜ îk÷¶‡KövF_F`«‘°@ &h&€‹<˜^T$òMM¤­ rr±¼ÚO½èE/Úù.¼ÊáCLj@4W/’=½»çß¿§ØroÉ°“5@¿cö_^DjÈy’d¡xt±Çq^=Y »Å­JenÜ(scû° áñ¹‰@›~Û´Ô=ŠîYÜŠÅr…o§î1ôšý4^?'OØÒ‘U^ŸÓTŽ6QoXtfsaå÷I5Œ­ˆË’á€×­‰wñaü…Àæaw|e Vj&¯® FZ«|¿‡]òg’WymS¹ßëŒÊ„Dåé”ÓÀLÇL2ÐÖÜ{…]n[l 2×-*Ã6õŸU» ­=úO«»^.N»©úYÖ:ç4ó†g'ôªt¸~îU¹µsÄbO¿9&‰v˜%!àúÛ–MRŒ‰o³òqêÀ¾±\t¢è©^£oÕá®Ë·ª®NâÃ[M ½½ý2û2Ós’Õ,'†·,ÛHÀ6Â^ãQå…aé÷ _ø–5®a7ªž€{†m~F½Jî¶Ù¿{þGÕKò”Fýj\FCR> żŽLD HmÆšÕdÚ™þ©Ð¦^Ã}Sa¿æ(ß-AâÆ‹»Â¾®–°WÊK÷ïŠfÆ­Úß’Þ¢…ÿ¢à/oßš²1zWÿI™>g<¸z OKx°C?+wrŠ¿Í†‡%ü{Z0Ïî`Ga+–Uv­8‡¨%/¬ƒ ûŠ‹KîI½ÿ…ÌLh”0<;:4­i‹¾ø=êöm‘ûŽ‹4$àЮV)šÂ%²ð0®¶æ°_Îm"îá& Ë7}±ÂÎcûÝÛïÙW,ìË*ëé>õúËBgLõr¿„~Oáק2=¤­ôþÓ\’ôM\-Ü0ò‘¿)ž‘be@ï‚&Î-ô‡½²¹ñЮhµÕ®¼ïÔï–4ÍóZÈözNCkkëUòë”È4ɶž‘TTÚ©a*';’OzRHR×_}WåD˜@`óÌIà³;÷0YXUïð€zÄþAN¤F$ø…ÿ¤EY¾Ý¼xT×Ä!¢Hx¤Â€ß6+mN͇ƒêPܯ†úA9 ÜÍŠ‹óï횉=ŒÜyø^Dý(þß0÷X:q«°ùÙêÀ[+u¬Ðq¯ü:ŒJ™sVãþŸ•s?IA£ºpJžÓu³R¸çÐ÷YLÜqIÒ¼ÆavC RÄWuõ÷5'áï¤ßyÆ“ªçfÔÓ«w¿Cû:Uo€mËž–™Ð*G±Tè­ylŽoW^PtçÛxOq»‘ä£èrgËⶠ…\nÑk\ÎWeò?¬rûmyöïS½2¢úú¸âÓê¡9¾..Å›•=~ñXÙÞúþ)&úïá\ýb9 &)©={ö¤.¹ä’ë¼ŽÓ P5ÜS<*ÏÑ95v<æÿɳ£ÑÛÿ ÷8¹JŸ„¥Æ¥¿þD°¬BÀBxJ^¥çÔ¨Liš- j”{u£}XÈ¥T±‚¥]&ÄîE´£ÀV…ݳè9¨í¥¼è+`•Û¯±ËŽÁÜ[蹿'uo þSF&²/<›÷Û´ù”̆'¥ °Ã¿ESáQÅÏñ‹…¡d!Ÿlk•€^ûbÝ&!Zå5Jà*.z%h7jêÏmåB t«Nìnm ½ê‘o•ÿ—ß]í-± Û }zm•sA+ֻؓ¿Mü­°óT~üÝûß7– Y•×>•[;aW<ìˆÓCt&Ï ®Ñ¦Aáb½ìíúŸ»ÞøÕúyqX›”(“ªç9qÝ#ß(-#ª››ÃU»ÃÞ®6ÕÑ ò Е¶µÎ„ôÕ)®÷—Ý•DRQ”†k/ÑU”";“Y¥Á1(-ñ˜ghìÌÅ;=ž ­#`áqp<F¢S©Lø“gGóÕ =§ck‹J7XÎK`±!njCjˆ¨u~Z{‡5/¹‰ýªáŸ=n•‰éer8µ[Ç=ÖTÍK5Q °^ÙÁ›U ÇÛ«øI `oþOõ‡1yò?-ç“ÚæÕÀÒò]Ã#‹y»†Áÿ¼ ä jˆ€ —¸Y ëg.Y¥@;-+¨&ÈNMÙ*Ýn 8Ôš©pÍÞŽp¸§]N?[•vÉi`£¬š5,@ʼub[ÛXyg‡œüO¨Üº·P=Ñ_;7†e…0,ót›¨O«¬Ìè<]ã’SWYVݹÊyìZ"à÷@ÊÏ^Õ…Sùº¤í™žŸ £ò­pHC·<ijBØK³êêh °t1T)%_ð‚¤{{{áDÎ)•¦Ù¡ìD°CàK›ïZ* ÝÝÝ©ÎÎÎKKÎ#ª&àž÷:MÙœœc:(ÓA 8{˜…ÿ˜J¾ Íl7ìçTƒÌ©Qy\œä(PyÑ"ÀNÇ<Ä¢µ)¯Þ{™«Ù.'cv<Ö¡1Æv4æžÄhZ¬'½‰Eó`ÝW‚ÀŒòÈ[[n¸·ÐƒƒyNë!YtôKð÷Ô}½þŸÔƒs1 óÑ Þ¥ïÙÁÕJÀ=OîuÊ©!:*{G7>Oj*¸¯È)œ½¿÷ªÁéeRbµ&w‡ã½Ø@y™Ö6¿·)9Vœ M…ùpy6þàÅfÄ–á±Åî]œ/™(ÀÁmîoÀ°7ö'pZJœ¿ïËD¯à'd.ìü³'7^ÝžõŸ¥±ý1";Ì„ÇC Š¸ü,-š)E?óQ±'Ež{MÓšJP-†*‹]êå¿^½¬»%ø[è_ÔÝ-·Ž¬êÞŒ¦âœ(¨žg5ÕêßiöÏÈѯ1:ºÞ³pxšºè£ F¡4K"°ÙÄ]òèûáÙTœUa¾ª[í»ÅC5dÕẹeñÝH,´6;*Ü›MàÊ+¯ìÖ=GµZÎIdò0•Ífƒ_ÇýP¬ÒžR^–~[ÐÔÔtÃ>›[C`Ë ¸yRSIåÝÓ¤^ãã™0dÿê-S£ÓóHÛ<ËÖÐP^}v¸˜–Ð{¤l>>§¼iÓØa5.wI àqÁ»4{€MN=öÔ:™ åݤ̅íÙÿÄP6LhÛ'!ÂNý&tãQÝc0æ¡ã¯ ü,òÓ0X °i’2<»X†§ÕRPÿ~(hÛ+¾UeÖ£…ÿ)<†|OWk0©é8§¤$p>î2,Ë>™ûh;.åÝ°Êý°ÊðwÊï¦E›m€€³  üÍ*_‡õ½\PW¯êÚš&·[ßÌC{:•¿©8Ä£ Ç€ Ë©;IàÒK/½øСC'Î;—DÃrÎj‹÷»"bÙ&(¶ ôS^ R*4ù§o< ª˜€ÍOÏÈtÜÓJ=Ý;þßgGâ\Ò'ejêžcO‰D¿Ål< Þ'ÔÈœÒÚ˜K…oggC÷`.ìkN‡öŒ‡Ýmò:®yÇåÚ9sZJ›“£¹0©žÂ“:wR’ˆç®àïž~+”‹yÈ÷{‹s’Û×-’2¬r§¢ΪLÛXgLN¿-rù äįCÎ/R9¾¬»¨RÝ; k)ÔÞ|Qé:%¡¿OezZ¥<ëƒuA¦ ›ÄÎ,ÿ?{ïùäH–]y¾€Ö-Rg–®VÕÍæ‡c»cc6³_öŸÝc»¶;³´Y²É!»ÙŠU]:Uh…hû;ðHdfdd(àz&ÂÏÏþ®:WuLá§(k2 Û Ž¤°YÌÄÝß<@Ä¥PÎÄó m-†@È( «+++j°o6ZpFX¦!øoÜ:è~ýÅ_Xݼ}äRÞF8QœXâ÷±`ì1}ŠåÿâME|ä…/<ŽÏsoI_}"NêFïâç¢è‡yüóc(ê÷5ísÒ?â–Špñ‚0Yû¿$6õ¥·öó{àâï/ëÿpt°ö§ÚCÀ¸U^õ/Éì ªÕ"/*ÜwÈéáÜCÖÖâä r¢Û‚§ã9qþUºüôce ñ^:ºˆú¬Vg}×Ñ[F„€ª[Ôiœ1v%Àu'/9‘­*KÕ&4ÀO©ãˆ‘Œ¨¦ì¶—A2óGð™òNéß.¡}6øh imB怾ÂmÔÜÝ»w­n®šï¿GNøCÜLwjßõ‚äs¾oÉ¢ÁÄF“[F…àceRX@×]—SbO¿AØÏÁ·È?k ‡Èrø’¬ q÷§ÞTd_w:÷ì˨ÄîkL/^€×ã+´gÆÇ‘ïÑ'µ —¨|HÀc®R¬JñWÒÀô[¿ÖÁgúbËÈèÖ‘ª·8ŠóC…çð74Üj1í~öpÁåà{H¢ðÊSŒ¼Ö¬ç#@(órïÉ6^¾éû~þI¶w(˜9˜Ï½IÐú;ÅÙ¾{÷î%Ï=Ëv!FÀ§¢Ãº|Œà¸uXuÆýv³âþ@Nkþ­£P²¿î¬Cü@[´î$3¨‡mòV|Œ©âL#-ÿ¦®R_5>ZšÕ¿{’ý5 0 гäk4=ìͯ÷PÖ=o+Éœ;]7»gJÿ“ý +Ô“Þ“ëŒËJ¸@}ÆáoØÆ@¤É Yÿ“ñ˜Wô„õQ¬\Ó@,»S­VÙF`ôoO78#~zS ¿ÞÕøƒý~ i†<ùl1Æ&ÖŠ±‹Šûß.UÝKâÇ7I§ Ì>¿g˜6á?”õ)ááXÖA?ú°–‡€/ôKpè~µ¿†€!~d=>ìúë¼ê»Ö‡Ã_qo”PÙÄ×’d`>$T+AÖÊõõý*YuP ä ý€ N¬G,u”¶aB Þ©×ëj˜ÁGÅ j°ÏF§Tš)Fzß-ƒNì ¾Ï,.’Ð×C`Lå¿Ûô³#Ïÿ»§îï_¹&)_2aÙD¸ôé¥Æäy¦¯˜½÷o`! ^ÇÁzú±'6Æ ÿz]o:q¶oügêKÜ«;ekøâÜu”ìG ç@)0OÆ–ŸÞ™õY2d}ð!›ÒO}› (î—J¥`&ü*e ÄÓS-FS×o6ü SøõÚÚÚ Ä³£)šÝÕ¸"ûSjå‹IÑAÖi>â³ÇÄE9¦Ííÿj˜ŽähF»ÝÔÖŸëÐ/J=Ê@Jtò¸v ðµTñ¸;ÛpU HÁr ³Èý±Å´Åì$€*•5ÐÔ)F_ ov„™b±h €Ñ׋•à´°Fì׈où˜ÿ?½8pJ;õ}©î‰C5ÿm1 CÀ0 k" /»S”í%[×ɦS%£ÃÜvÅ%"7—KºÖfÝé[ㄈв\h;íÖÀ£9òìÙ3É:oÊ;·~/»àå0Àå±ô‘gƒ¼™3‰DbnÐ7´ë7E@éþö`úÛÿ³½ŠûoOKîÒNí¡áS–Þ-‚õMïh熀!`S†€<:ø¬“Í¡ `¾Ñv Þ±»xÝÝ/$Ýl6鉨KŸÆ]"•À”dV>|ùío/h˜Z÷oÛ$1@hHkS èsnófã×!¾3 éÁefáœsl—!0r4JËòßÄå¿RÇÍ€­RÍm“/~¯qâ^²¿,k… ÿ#¯++€!`†Àä ‚Ç<Nðy×î¢ È ðK ŸŒG\!ƒ" Åà”L#œœªÛ'!¬”_úþ±}žI)¸)F_“ovÿÜ™K£/š•ÀxŽÜË5˜ˆ+Äû×Ýo¾ßsÿ¶[sûÿ_“¦h‡ßÏdÿ·O·=†€!`†€!p-ÐWWáܧÍSW‚ `o€ÈÌŽ[^/¹–óî‹'3.—J¸4ä€â&™×ºdÜ»wïƹDÐ ƒupU}¬ÿýÛÁﶦ°×¼ìYÇ€9síš×°Ó  DÅó·q;¬Ãî_ª4Ü~¹á^5Üïˆù?`¿ˆŠºK°HQ좆€!`†Àt" w1O¾…;À['(–xWð˜%;@e|ŒÔ€q<NñèeÄ€ÓÙTÂðÔ„$)‡ä›3çœré7›8žÌ v™`PÈ^íºýb¦V«ÍÄb±;W»„m þÿz 7ÿ½c÷ÝÖ‘'üÛDpxá9ãÛ~üÆð`=ØrÙÕ CÀ0 iC@,;M<îÊÈU»ýÊðeü÷›‡®˜I¸» yÿŒWˆÀˆ§­…„ãy²}% ýrOß϶9,L0,¤/wß!¶··.wŠe é‡^åÿëÍ’û¯¸þoÀFüo€ ”š|ˆ¤ÈCÀ0 CÀ0zßž¶ÝÄ€íšsÙFǧ<"+ÏR6áþöÃSÏ JĽ 5™kÀ5b—?²ÙþýGXƒìGcÈÛ¦2à½Û¾¿CœíƒPîZý³Ñ”Òî:õh~qÒn»6Vå>Ä@nÿ{¤ú{^=q_!üWøÍ ÿæ½5õíÅ0 CÀ.dtÛ„ß% X”B.…â§P½6¡ÀLdÆ<†[=S72›=zä~üñÇ‹@Þ ¾Ûz˜` ¿ï–¸ËDÞwŒýn þíÃ.¼Óÿî„?ìºuØþ7ÊM·I¼a·¹!šì?ŒÚ°{†€!`o" wpǵ:3¼—Ù†!p¿Ùqùgn›÷öÙŒûùãEO ˜„Ð+,Mà› Ú÷!J¥Šù|>ká¿­m®-ÃDÀÃDûÝ÷Rã?ûär¹ c¼û ûÅ0Ìÿ²ü—kM·Mš¿ÍêûývÙý²¡…-Üþee°a{Àa—7 CÀ0.B€÷µÞÙ맄ÿ¶[„—'³‡âo€:ÛWŠgi“q2Ø,ó"4í·[DN³TïrÖên×›^Ê7Eðú翳#à.sý«Ú™†À- Ð<Áºà_ÇÊ¿UªºçÄþoãþOŒáÂÉß ÿ·p/»„!`†€!`Ü6J€ Ÿ4/h)¢HúÛxì½Ü/» a|‹…´8¦\œ,Ê!$ÀC` ÈâÜB .htÁ:øÍÖCDÀC›[õ7üóîì;!Ñó~´}†À0¡‚ðÿt»äŽˆõÿ×çûî”ß÷¿ëcþÍíua÷0 CÀ0.ïfÞÑœðuýÔ½háŇ@ Åý|&î~qoÖ ÿéT܇$"6ݼ<¶väu@‹Çã&ì_¼žc €‚{ÉKJ sÌÌÎÎÛ—¼„fÜSÿDBrûo ìKø?€@hëÁŸøl38ä7 Ôº9ÖvCÀ0 C` ð.1ï&ïóÞع!¼Ãë„í=¨6½'DÓ.E(€¼ ï¶ƒ@“€Ô¼¿‘õoâ¶vÍ÷ ` €÷4àŸÏíeX½ x»üÛœ Üïë_®#ì+ÞËÿJ€oj>æ¿Æ¤BÿübZ€·´=†€!`†@HRÿ´Óöa{Ïá8Æ`vóØ—n>›tŸÜs³¹”‹Ç¢FM ’z›´b èk>Wî™´g‡ç1A3\µ¤Ž1c!᪔i)Më€Øþ·}ÌÅý¿ÏJîÏ(JìßD9àü§¥9Øs†€!`Œ3(Ÿ—|J§3®'@ ¯€¼ͦáH¹D<êÒ(öµŽšh6εÚ²£ÈÕëu/ßô ´´þ}¡-ÿ¤Ìá¨Ù 3øÒ˜@8*eJ!y¾á_£uâªõ©þÄö@„L¶°Èòo‹!`†€!`ŒDï¡è¸Ò–ïÛkD\¾Ör;¼ï£ñˆ‹09Ë0~Oi%+„—ô{¼«˜’ƒl²ù.t°ßõ—ìøƒí`íŠÅbâ×°C # ˜ÿqþë»Ç>Þÿ¿ßqØ®Àöâ¾e‚pÈïÞíß”7ÆÚ.`†€!` ä*¼øäüÿ}ãÔí¡Øß­Ãpºã–r ÷ÑrÎ}ñ$â²f’qÂL4~Mîñ(Öjµ3grŸt¼žÌzùèêë]aÆ£«”i¹³äy±ý{¿æ‰;D °_®»—G ÷/¥†üÅößUÇšRvZÚ…=§!`†À" ÷=µ…;ÀžÞì¼÷®‚GÀ|&`ë¿s ød0bÀ l#z¤H$2×h4‚»²O°öÛzȘ`È€¿çv¾Cär°²Øb ¹ýVê®Î$`}¯ì¾Ù,¹]”•–;âå_á£|Â~1ù€5a—6 CÀ0†ƒ€ÔúÍvo€ˆÛ©Ÿ¸ÞõϪnqýÐQ=`’0¥4fÀ)jzT8ævvv.ººä›p^„Ð~3À@½É%WVV\,3€›€hçž‹€R ÜŸàXi4ÝA¹áöpû—åÿ%Âÿ—šàößãû?÷¶Ó0 CÀ0ÆÄ­m4ýiËÍ·Iš@-Ìä˜m'\€8û"š'€‡Çþ\{÷îͼxñBgŸ;¯y);í–0À-yƒËôw†¬ÿ‘d2i7ÔN=ÅõíÃú»Kš¿]Xþóý®{AÌÿ&)6Û¿ú\ÿÏ¿Œí5 CÀ0 ±F @§íšÈcMÞý|ÝÅýqϽ<¬º{s÷óGK.—–" 1`^€þéêX?¼~ÈÞ\ €þ¤íþï*Qðݼ†P?¦ÈW¹E*•Ò ½Ê9v¬!pIeýoó†/Cô³sTu[¥šûóNÕýËQÝ•ðØÆ3@AÊl‹!`†€!`L8šày½ÎËï´í–™öjnŸp ž¬ Àú@ò”i)âY ¡M82öxƒEÀšÑ`ñ½ÔÕMp)˜†rÐY‡ e†ÕËP ŸŽ›´ˆ÷¯ ø×ßÙϳݲۑû?ßþ«¼èYÙb†€!`S†€”šTxî}æÈûn‹ / .×á(¤]Œ±hÔóH!`‹!p 7W£y×þ«\ÞŽ½&h^´Až‚¥ó$ÆÓtmô«–{ºuèJ¸úÿñùûïO½ðÿ-Z~¥úë ÿ¦˜¦vaÏj†€!`x¼ç_ÛíCôU ^€fÇ·Ê®Þ긅LÜ}ñ`ÎÅI˜NÆ ˆã`NªÖr®†@§Ó‘ |®v²=L0X/uÑ~­W°=Cü¿3€Kág]€€Þçrák#à7ˆï—ð/rŸÝJÓ}Iª¿—¸ú•øÍCÀ0 CÀ˜vºž€ëÌfð˜EøyÜt“Ž{ A`C‚(Ä LÚ6N€io3—~É6¶„ S ¿>a_wîß>+ ^"^µÅ¸6'äù݃ðï¸ÚpÛÄûÿîénÿM÷]I1ÿmWç%ï³®˜áÿÚÛ‰†€!`†ÀD!@V€SÜwš÷Wÿ#RÎn”\ £ÁB>é>½7ïŠÙ”÷0bÀ‰ªù>L"‘xóúçÊ?od߇€)‡íµ¯l׆ÎNÉô"ü;8®¹ÍƒŠ{±_qÿßó#÷'¬ÿ%^â›|¼Üo¿µCÀ0 CÀðá§x 2‡¨Ï¸YRv¶*Þ€ðd>ãVŠ— @Ó¥ ´Äp¶¾t:¹èw~“BÀf¥ïé66Àm¢y ×Rœ ‹yÜ–Óv 1ý·p׫·N\­qâÙþ7Hç³Óÿî|Û¼Ðk(tÜ«¥ûÕ^Û2 CÀ0 éD $Àˆ§³\ö©{ÕÿÍõe/cÇÝ"¦¸E0¯y© #øÓ{Æ°rM0§õ4 õŠ÷/Uêîåî±;$ÞÿŸ¾ßu¿Û:ö¬¾_‹@¿W°šÐ?­íÄžÛ0 CÀx/2.XÂÄÿmƒ<÷á:E)°˜M¸OV î(²©¸Ë@˜L˜8ñ^L§ø€X,öš¬óúÍ&¦o€2è¯Öcðå¯Ö9Ìàò Ù‘Œšþ±îËí_³‡‰@IDAT„‡(öHó·ÁçwGü;nÏ ÿ eC¬5CÀ0 CÀ¸îd¡Íüb/€¼ åýxÔpU<sIW%E`ž€¡ ) p °€ AÚû8Îd©#$n €pTDÐ!ü:‰X@8êe,Jq‚fþ°\wu„ÿõý²ûËÆlÿ |îˆß*ÿz‰w—`=f…4 CÀ0 "Ðaþ@xª+œº- ›Ì)ö«nîå›Åàñê¬Pv€^¦ae…ôÖprNHK8}Å2@ë€ÕKë%¬EjÁÒ»}Xñnÿßãòÿþ°ï~ Vo…À OùgrX«ÏÊe†€!`„ÜþµÈ Q›q¹\C²+á°Š'@.•pùtÂ{È#ÀÒ†·*GU² BL10¢J1As4À_Øà<ßÊ—1šbÚ]Ç÷;²ò T=û¶û]³ÍN“úÇ¡þ¬Œ†€!`†@ØÀÀí0¯hKXåKrá:yØb\„@*•zSîyóûE§Ûo@Àõ.iõr NË%än'^iÞµŽxÿ;vêl/æiiöœ†€!`†À``NáŸ9uÉ(ñÿ|bÌ;äú÷ª¹ÿý±½:ýiMøAMöWHŠcEÆ`íàJ ð{/`)â|_䓼ÒEì`CÀ0 CÀ0.F@iªâÌ5R»'•ÐÇýËøpñyöëô"pŽÀô‚’'7KsH*"(ŒîDX@€‡­ß€„~ÅßÉò¿MºG¹¸?«žº¿´œ#qy¼F;Â0 CÀ0ÞBà•dŸ€é?Ë\c5w³dH‘0æÝØÿWǾuÛ1µD£¸Š(M„-¡AÀ튋ÿÙoæ0ÜJ÷»Å£Q·X̺B¦íêÄÿ8Ÿq™xÃó<‡àHažÄÇâôƽ®­ü†€!`†À(Ëpá‹ÿ½BÊ}vgŽ,I7‹ ‹ºŒgÙQÐîZÈxœ÷7‘þíЖ}R f €áÕìeúL£ÑP‰Œpxõ2öw’Ö]ñwx¸d"êŠhæëäéÍâžã7ãû*¶0 CÀ0FŠ€,ÿKrç˜[d™kˆý?“ŠŸ¥þ»Ì$w¤`7ÉdÒšÇÈÐ?ÿƦ8—aî=¯S˜`˜50æ÷’Œ/€žE´ñŸÝ)ºe´óõ·XnAØq»$ìz_™À˜W·ß0 CÀ~’1ãïÿW³I·„‘ឆK³—#ü0™ˆYê¿áÕÆXÞ‰4€ÀX– m €ÑÖj ük_ m¥ŒãÝ=ó?Ì<™dÜ-Ïe]<u󼤳(jxÌÐDÿq¬Y+³!`†€!0B¤˜‰¸2Ür&áVr 7—M¸<ÛY<Äþo‹!pZ#¹ üf €€~‰[šÀ%@²C^G@Z$…äx!·Û7Ÿ»Oóq·Û8 ãÖÉß+:S¼Ž›}3 CÀ0 óˆc>Hñ™E°VHòIÁ9”è¹þ“úïüÓl¯!p†€)Π͆)BSÝ‚ˆmª)BV/ãPq¤pÅ‹EÓ.‰ÀC\ôJÕ¦Û,7ÝîÉ©Ûl¶]»ƒ+Š[ CÀ0 CÀx7]ѾÀyæ«>Y-¸;ó97ŸO¹Ä ?4À»´_º ì‘¶„S„¨2‚¢ ÈY ÷ [_ Ïà¢þÅ,ržÙLÜÕNÚ.ÅKZþWm{U_ O;Ø0 CÀ˜V$$˜?ÌAþ—w= s„ÊØ £ƒ ÿÓÚ2®öܦ¸^Ã8ÚÃ@ùê÷0ÀÕ1³3@@/d…ãIÙº\Ì`ñ?ui^Ô+»Uw·éH èܾ!e†€!`†À;@´g21ÇœâS ˆû<—ö–¥ýKÅcÎs½ó|ûÁx…@"‘èç0½Ñ+hF¶e €‘A¾â”TnêñÑËî<îH 'Vo¡ñ¹y÷?ÇØ[ eµf ä÷.€…Œ{][ù CÀ0 [G@3Qˆÿ²Ì%VQHø¿3›rsÿ…lÊEåUÈÇCà2DY.sœ3<L0<¬/u§f³É I]ê`;Èxòð( @¤€bîý€LmÆtN\µ«xÇÙ¶Û0 CÀ0¦‰öiþdùÌiAÌÿ‚ïÂ(ó ³þOk˸ÞsC(æiŒ®ß@Î2À@`½ÖEÕ1fPœ"¼™Àµ ´“ôrÎe’.Œ¹f«í>‡¸gŽ¸½¿ìWݳݚ«ŠL–0@ÌÖ†€!`†€! 9-ËçóˆU<>€Pø'÷çÝl6é žøßl1.‹ÞÍË©5œË‚6àãL0`€¯zye@`WÎŽ yÄ í‘¦^d=E<'W #@·¾t€'>Ú$“_;ݾ†€!`†ÀÔ!ЕÏdýϵ‹aLÀPÄ K+õžÜ&üO]«¸é3'}SðóûMoaç_S\°A.‹… è)¸¾FWÉøJ ¸!`Mþn¥á–cU7sqÏg:®u&ÿŸmL2öˆ†€!`†€!ð^N›q÷Q÷y>éV²q7ŸKº>6€ÁÁ;uW–Ò5„Áw¹èæki·wÜpK‰#×ÁëøĹ½ÊÏ<³¦{`CÀ0 CÀ`Î0ûÿ*ÂþgKY·˜M¸•ÙŒ›Í¥½1Áˆÿ l}K˜ðK@^õ2¦¸*b>>ŸÏøvùiB@#k”—ym~»s\ù–’QdþS·ÓŒ¸ƒö©;!3€qLS«°g5 CÀ0ÞF Á.}äú?‡Ëÿœ¸„#TH¡Åþ¿—í¹± Ê–P!` €ÑWÇk"™´ðÿÑWÉd•  áâ¬ïÎgÝ_ß+ºm¸*/ÝníÄ•át§íÉzh{CÀ0 CÀ¸½íUý nþ÷r ÷ñ‚[€ý¾ö†„·Ã¸/wi;Êh·Û¯É:ï@DÇX<ê;À¹íݦ¸mDox½B¡pÃ+Øé†ÀëHkŸ@ƒ¯—w8¾Õbš>—U œq57ñÿuÌì›!`†€!0Mˆ|*ƒV€ç¯€§à"‚ÿ|> óÂϦ {ÖÛE€ùçe·{S»Ú…˜àBx†ÿ#®ÙÖI†ûÄßQJŠ½È—!”Šu1s÷ë'.À vœ˜ÞuâÛ=à˜!pnŸ|cç_oý ßùFzçÝ"¼çç[/§]Ð0®‰£À2Ú‡™¸[N*`¥ŽC lâÛ5¡µÓ "` €pTÌÙT)—Ëm‡£hVŠIA@ €¹\Ê%ÀÝgn¿Þr™Æ©;êDܾÈ;ƒ–&&M{C`€œuÃÞ†VWÇÙoì{k»ÇMÊ' ¸Ö;^Ig¿«l½?EçêÞï8O?ÙbáAÀ÷ß7OÆ OçÒîálÚ=ZÈyëñ™7<Õ5Ž%1€ðÕš)†_'ý³¢þm_’DBô+¶·€[<õý ™ò(æpókv:.ÑäÇ`¾û·¶+†Àû8ËÆñêµlÉú¦mo…ãÏÙþÞ5µçõ}§gßuˆÿ58 wNÿê¬ë÷ÊÐýNðÞÒý~ê†Çú5×Ôš_ü‘Êüœëx{ç«ŸûKzAûN°MCÀ¸eô]…j^0K¨`ë¿,ÿâ2áÿ–Á¶Ë!@À!¨„¾"Ìd³Y›õb›·‡€^âþe.á­þ“¥œK¡ñzXsÏ·y ÈÏ‘Û»·]É0Þ…Ò±ä ßé €·ŽVÉhÔÅé·q¾§ùÄØN@Ò•`;Âv’ɹÖÚ¯c´­5‡øm wݵ¾÷ ÚoE¼n¯b´ÙÐúo ¥ m³n24hûea‹ï:¦© "~ß©«³­}5~kô§ë¼öl~‡vö=¤–`­ßýv°Ãÿj C`ÐÍÔÓ7V i¿›Šº°JÚ`ÈÿâŒ?¶·ˆ€ ì·æM/e €›"x½óßÙ , àõµ³.‡€<b§QbûÚnm.ç|—ÜŸÛ I|w:ðæ,ýr׶£ CàªÐ×ÔÝú?¾;ƒ Ÿ¤&‘âÓHô”uü³¬3=Ë\6Ž…ŽßÖ“âå÷çx%ÛÊüÁ …€”¯¼úKéoðÎ/ÄK¨—°/Ï “6ú*ƒ„ö7Y×Zm¿¯rÒv-ÆŒ:ûÊhtü û:œ#¥A[ÊDŸa$x>n ›õ/”é,Ô@oÅ~ œw¾%û/`Û†€!p}ºcBžA¢È3›ˆ¸•bÊÝ]ÌÃw1Ƴþ_];óð ‹°l™ ,5Ñ+‡åÊ Y…L`q4ç–'€2h¢?{Üp‹ñ÷ÙÉŒÛbξÿæ$}1°G2FŠý®‰3ù^ˆÇöàQ—'ÿ¶„w ø²òë“Cð—`ŸBøO31õ¶%ôÇQÞZkŸ~¥^Ö^v_¡-Æ”Jó¤·n¹ ÙF¤(8h´º·WkúíýZËáUPá÷möK!àó’j}V0ÝŸEăzHÿP~ãícô³-†€!ð~rŒ'ä’î×w n ’à•Ù¬+fSžøOé‚m1nhTo/[„€)ÂT”Å!« -Ž2¤1/(dX6äþ§8c{åOh¥Ûc  °šöœ ²]r> ïÚ•µ+‘þ·Ê¤û©·ÌfÜÇÄáfé—ú}Yä¤/å_~ý뮃Ǻx~uѯgÅ .õÖúõ#¤ Å¿ÃÇ[ôÛ¸þsŽBZîZw(É4ŗ†’`¡_žGúz.íó |O´:®Î…ëíˆëDÚîôظOWáÐ…Õƒ/Á=O¾J)ÐÝÝ+uïI/zàÞ‘¶2¦²þ§ñÊéýËôÉ8iÿP6jŽ`‹!`L.¦YÝ uCV'“X 1^òš`ç x¼ˆÀAF€ñ¯0íÕý„úµYõ$Â`Ïd u² +!¬*V1™À?â–!ÚZ.$Ý}ð¯VŠn ÜEåáÆ'Ë¿„d…ëøþÚú5/×ä\/ í¿åýWyã¾ê‘N)GŒç£¨~,Q(‚ÿóœ(,´í³ð| XÂÒ¯µÿc¼´}€r ">»x4P&ÔŒAŒCR$ã5 ¯q­Sö±_ă¾ò¦ð*êYq{=û®l1 ùšÞQèaBËŒ9wP:Îá Æýÿ–†Ù8CÀ8Π͆)FWçNIHhØÑÕÉÔÜYnÂ"” 1‹°ñáZÁÍ!|¼8jºô1¦7&æØÞ¦{PC``H …•ŒÕymg{·ÿ_Þ™u¿à3OÌÿã…¬Ëcñ—E\Ä~š„³y¶¨ÏË«­`Ïð×òDè.Xã)¯–î“víô]½G7„ Øö²:_tœ¼4ˆT°‰Ð/2Á#)PìW›n¿Òte’ÏŽj(º!/à+)sü)¿7:'(¸’.¢µ–³"}ûüöÇ04¸¤ù,¢XÂiUžGK\ÿ“.ËXôª#V†€!0©˜`ô5Û7SqÎ<F_!ÓR‚®€AJ1øD:&k[WÀ5,IfÒ/Ú3].€iÄžÓ¸.=ùÓ  ~»»C2r—ŸL±lþoåPL{Kÿ]âý×°ºp¿-byK£xí…pÝò ù¼@7Ñ-{ï üêâ§J"5lµ£~üQ¶CÊ| O )tL>,øÈBžI„–Y~¹`“ߤLh¢h²†š2Á®ráL1ЇŠ¤l­ÿ Û6&<:»eÞ÷K¤þËõÆž$ãO |œ¸¶)æ0RøϽ¹)Î…eè;Ϧ"p˜ÀÐáŸÞjâžM%ÜÒþà–ühþØýÀÜr;¸Ú>ÅÀ[Ù ÛôBeOn\®à/«´õ4ʵùTŒÛ˜ûÕrÞ=$ÅÖ 7?!϶„þ9\ãç þÉŸRþ½.q§I8DÏëI ø“±S—<ûç2ÝPe ø ¡ÊHPGð—B Á˜´Smx¯…l–ê®Ú:q[å†ÛÄ3à˜ã¾Ç{@!§œïÓ ¨Zt³ix‰=Ãí" b¿$ÀŒK¿\͹5”s®€õ_©ÿÄKb‹!`L>¦Y§RŒÊ¶CB È#„HÆ/â–¼Pá?]e¶ÜácÂÿjÃn3öHФ¿D°0Ëú/‚­bAŸ~õ.þŸ2Ñ^%îÿóµ9ou“½,nLù?•‹<$ºOXR | 0”Z|À_¤P&e8€LPÊ­LW¼2 ¨"×̸}öo¢hoÑnq6áÝë¼Êä`‹!0^Ibÿ_Äûh¹ö®ÿ²þ' ´Å0¦ëí!«g<”²ÙC`hˆH,Š"N€b/d¼‹í—GuÀÐJb72Æ@2 Š(È*Õ—D~·†ÀŸÃú¿„Uí1äZ³R,åÝ=\ÿeõOsŒ¬þ:^ò¯-]Π`ãl;ÐŽôR’IiÒîÄ]Bc–ÔG?‡î|™ñ«DHÀBMÏ*Ê€ J…²­  ¨à O¿œÕ_ßMõÛ«ô´•!0Þȶ¿Â€3'ò?¸H–DBʘ$"`Íl1ˆ€¨÷:—6ÀuPÌ9ê3ñ8³F[ !"àÅ™\+þøÞbÞ§Ìï»ßm—]Öí*¥ç²Å0@ £~Ñë>¥ñì‹ðiüû»sî>“ë‡s÷ÛbŸg’­P€ý)Hégx^y DPœhI€³¼û—ÁþÁ\Ö§ TFŸaeÀvYa¬! |~Pu‡õ¦ûj¯ì6+uï!ðô¸ãÚ(¼›¯?*U Aåö×±¿£ý1Ægbþ_ϸÕTÄÝÍÇÜC”’÷ù¤ ÿ³4íc^¿V|CàŠ˜àŠ€ÝòáoM3Òiü¯m1†Œ€B"XÒ¸+çÒ²¦Å]žÉö2–‚æÉõ!—Çng„/JàWɺC·lf]K>B)„ZI údÓXCø¿Clí],ÑwÙ]÷Z ®o ú¡{Ðð(À·MôŠ͵ä;|díO ìˆ3 ‰b³ƒb KÝ”à 8EÈ’þô¸¥´‚O"ØÆ@‰D"èuºnp£>@ïv¶2Æ8%—ëÿ<ýAG¤ôO%ð¦ÁîÔM,:¶f9Ì/ÍÅ$dudÂfÈ*Ä!«)*ŽÒ‰H¡ Üg?šOãb;ãžB®u\m¹ª&ÃpØbL-¾ðô=kq ô¸kýkÿ#Üý•Òï3¬j Xü lù®~$×õ@®œZüøà>œ‚ë'pfÁü$yê2Ô‹—ý Âß(*—èYezßcÔ¤<®=G(°W`ȪÅ!«&*¦YLKqd“V”&˜.ÌšÔZ.["­“çªl˜g~²Ó‚Œ=çT# öN³Wì~_–ü… !2h­bAûŒô~Šû¿"@Öÿ,û•Û^V[Fƒ@`Í”ÏEWÿB]¨ÃÚŒmB2T;RÒ¨®’Ô•”¯-¦x û2fÍ™vœgûí|™ñKIæaÿ/¢´‰æ›Í~ÌžÒŠk×DÀ×î–O †jâH βÅbžAì/`%øò²µÙ†«°¸[eïŒ#ݶkùƒÍŽGTEvÛA#pÖ´ÙðQX´þ{xÅ(­ß¿»7ç>‚0S,ÿŸ£È)Æws}$÷÷Ǩº¸výË! :Qú?t4^ø‰¡È—¨³X @ÔyÍ»ê>ø—={;;lmŒ 4^4`«ÿ¥#n%uÉòóDiH OJAþ÷–âk\ÍÊi7BÀ7‚ïÖOf,îå:ºõKÛ Ë!  xäˆÁÌ 7y¤šzgÆñ[I;µhbÜÛôßí!0ö¼jÐ ó—™¹³‹Óî èfè²òßÇ}öÉ\Ú-¢¸#w~ë¦ô³8ÿ06Õj›qK$' €ø¯Õ кÝQì?½ªþî¶qa¬N+ÓeèS\¥ÙÎcýÏ3NyE%JÌJKñþØb ‘¯Ú.L®ú0€ÕÇ4GþRO/¥ÞR(ÀÏ Ü­¸Î!鵘)·,Pv›Æ„?3Ò_/Æ_ÌþIú@EØ£BÒÍ׿‚Ûì'û)ÆÿãEH´üs0hË…<  ³ét¸šˆ~ þMü=ÈLËýíV›î»ƒŠ;ªŸ¸ï÷ŽÝ3ÒîæTkâÞ$-@¿ \c¥1®†€^æØ”VI•ñÙb…% L¼˜’x*IɯqËC`´•nÅ–P!` €ÑWG0û5Dl¦&}L} ”§¼˜M¹1²«³÷!nƒÅrÓ=«ž¸§¶kù‰²çSßP&€ =Cr©X¿\þWP‚ýÍýyˆþÒîýà„ÅÈÝ?ËZÇÈ€Ö ›™ &ë9”°I€ Âýw»Çnò¿ïøÿû³}·ÑéA¥éþ[ e \>^hT¬#Oö4S†€W̸e¼–>\.¸E„ÿÅbÖ§ÿ“ÀÜÿ§¬=Œðq‘múåM]GXÁ­û+$ØgëÁ#ðÎÆo €Áƒow¸L$Ø(=Pgë§&Ó9BRL”[\â$˜-«5Û—¸´b„¾FK¹_¡^9äçH§6/Æìûÿ²ö++Æ<ZibÇ5yÖñ¶„E(Iè—å¿iÉQ½é­ýÏ«îåQݽ8ª¹­rÝ à˜ì&¥þÓcøÙP¯N­jÃW±V¢Ë! ¶KƒÖj™?YÚu>A @Æ.qûH©¯Œ?&ü_N;êv€à¼?‡Îí\Ô®r#Lp#ø®|rÿ´¢ûʲ A"à'ŽK³Y÷97›#]ÖŸ·*n kÚÁÉŒ{Á$Ã貞ÚbŒj³Ji©†.ö7^ ¸ö‹¿Ö,da÷/úI³ÒüØ'Á?ÇZq³¢Ê´%\hRº¿*¤¥ÏË>ÍßS¬ý_n“É·ÿݲ۩4\‰ß7°ú7Úòdâœ@ðéÃÙÒ¿}¶Ó6 1@@cÓŒ›eõ ^LK¸ÿ?,¦Ü<æóÝÔæú?Õ8aE4~³ðU¨)ÂW'6³ _Le‰Ôe)È@¤‰CÁ_–„Pƒc|šš'ë@›/OeׇV“ÕG‹r`GPt)5Ü=Èý”ÚïS_Ü)Ã@V3Üeu¬ÅÌzÌÂô'Ð?ÊCI1ÿ5¬þ;ÄûKèÿv¯ìþçúÛ«¶Ü(vüeïWF?dyåOð4A‹¾ÛÚGhÙŒS šsâ¿y”â-)àÕ”ç“ ë… cãX¯ã]fó_ý™ |ub%2ƒ“ˆ.ƒÙô©'¼ !` —Ù ˆ´ŽOÝ–çu1é?<f%y mJ¸c»÷5‰À_db¬8þå|ÊÍ21^Ååÿ‹µY˜þã¸ýÃyѳú'8Vd˜¶„Üü%ð·XhLBèßgý‡Í’ß~ŠÛÿúqo€–«žÀößm½ ê4h#á{>+‘!puh׌WEÆ­û„-=œM{"ß$„¥1¥»d¿i®Žªqc‚÷Ʋ ܦ¸í*†ÀD" ‹g+hŠôA'ÄÕ~@Îó4Û¹ýªû–øÙ-(è6¬&{¨±F@ÍÓ·ÑîShR¤MLf ¥ôûkˆý>[)ºy””-‚? ýÊ /¹_¶„Ukƒ1IÖþ2þ7J„(•Ü&ßÿiãÈã_ç÷*yˆ·äÔSì¾YŸo~ß³Z‰ +!óÿ,Šû' eZ+¸eL³(4“ìÓ˜f-þJhÚÁ·ƒ€iZoÇ[»Š)n J»!0™x M™rL³„äÈd¡O“ßN5£Ðð¬Ù´Å.ÁüâõF¨ ¯Œ^RfÅ iI°™ßJ.å­ýòj¹'/ö-ô¹û·ìv·Ë A^µÜÂóè„Ô~G¤õÛÉ¿„°¿qü5ݺbýù­#ÅOÐ,$ü«1 mÑ_o‹çß:8f˜e;¿$¶wLèkBÚøJK…ê)„I®ÿ ãóÙJøm¨]`Lá´bàëõ/j €ëc7ˆ3­ƒ U»æPÃTîàûʃ΄B®·÷·ËXÖNÜñ€ß• º-†ÀÈšŸÖ´E¦».K¬Üý‹´ßÏón…ÿUþÏW .UlíEö%QpÅÑØ <²Ú»ðÆÍvÇÕq÷WÒ³ƒ qý „þ†ûÃvɳüo”ªn–ÿr«gõ©Ÿbü}› V_#ù»ðV·÷c0.ö7ª j_ÿþÛ»«]i@²Óžž0Þ=ÎÄÝÝlÂÝϺ»‹¬ÿ OèkÂÿ46ŒÐ¡T» SPzìþ*ï©0¬²¡2íÃA€&“ä}¼„ÛÿƒÙã^Òó÷(•oÆ7œ‚Ø] ·°4€oc2ê=¦m Ø[~´øÛݯ€€bs¸ÿ+`u.ë~qÖ­ár[%÷»ظQ¸Žx¶µXÓîâ`ƒíKr—' \ŠÌ}‰y…§‚ÏZ6åþæÞœ[Ƶÿ,Ø“;ÇÄx!ô‚ qʱS5·pÕþ‚òQíÄ}…‹ÿ1ý_ïWÜ?¼„Ý¿ÞtÛŒ;%¬þ )4îô„n\9zw„ò[(Ì{/´ÅÞ'ýNq»žñ™% äaÿ÷Ü”ORh”ÈTP&”á_·ŽÜßoÖ¯²©¨Èþ=Qá{ojo a/ŠL)æqÞÍYÿc^ɉöÆñöÕ–pxX_öN¦¸,Rvœ!0åhþŪ%&íJ€.Õ LYŠ±ÖÄ#ǧì1ò3ÙZڶŸm4™¥mÑæ$òI —õ_VV¹û/¢¨º‡¥_©ý`ýÈGÿ4¿Ëå_ú)›ßvÜìz)DÚ'+¹Øû•Þ¯Ô@؇Õ§ Áÿ‰ý»ÿ!Þ ðúŸÀµÙWhÿxÓ¿}³²]|ö«Æ¤"ÐÌh‹—gcË¿— ŽÂ—A÷§aåð*ùRÉ9¬þwú?Y*øìCžº–O{åF×ÿÏš’G *ûd1øo=k™g;à÷¶®+—–àGñ|ÃÄÒîu#Vh{Ÿ¥iO´»5<–ŠiWÄ JŠzk:7‚ÖN6&SLlÕÚƒƒA@T Ã…¼w£^Éí¹Ü®#LÊ·[÷ö3{›~ ¦¦ìª¾-ñG‚Q ta:ðƒÿ¯î̺Uâú¶6ëÝý³L|çÙŸÀ:¥Á*Î_3ak!l7æ)–ã‡U/ÿ~ãÐý3îþ{Åß약żÅqMê^MáTƒP`ù÷¤šåý8¬Z¦<¾-ꦔe†¶X@¨ÿ9D“eñŸÏ¹¿~°ÐMņ"JÊR-:M„†÷g³î'(^’½ ÊÎyö- G"4TH×óî-þ,ý±Ö{…mt›ƒ\`è EÚÊ]˜ÿWWð|Z¦måñЋCˆbÖk,!AÀ°TDP SHØÚ0.€øX»daPZÀ»­)üö9®­[g<Lbm1nŠ@¯iö§‘åh{"VS»Ë p=`Âûh.ã–ø¾‚õu唄­ /øßôþvþ­#à þˆó—œ[Að—õ_qþrñÙßóCþpû÷îþ–«ˆá_¥à6<Ûà‡þ±¦ûÖ‹~vAÉçY¼ND„š#3Š\®—P:)Üä> €5Úåû¤ŒR{T› –8‚›¼SN¡’µÿ1íW™(2l-žµÊ§¤´‡RvùEÏl÷vÙÊð¾‰h”ñ@>éÛ¡ÿ.ù_1¸ ‘"`ØHáûæ¦xÛc ‹B A,‰3yí¸Ç¬)ûùAÍ=«¶Ý÷˜óN=³µ÷Àh?½ ?2—j¡Í)–uê,¹õÿòî¬g÷W¼ÿ¬­Š}•«¿.…©èx[‡€ªT.ðr÷/#üÿ.þÏ°~o×Ýp…?"£È>DûXÿeñ¯« ༶ »jÕ 5¦ié5É"Bÿ‡´ÅYÜ®?%Üäó•¢[Àêúáb·”S(H%䟗eBí³@[–b`åé,)Û”Þð»Ý²ûÇgûnlþ´CšCÈ¥,9»7çy%H·$öטÿQDýÏ“û‹9OÐ+Å|Œ>£æb‹!`ç!` €óP±}†€!p!^ÀBèO`i( €-4Ó®Üh» V.6°phöp^Í~4ÞF ;w•<¬ik²ú#t­a]]&¾õ3âªÃC!!KÖVýÎÑ6é}Ê‘ïñ23$̶ùH 뾘ü€ÝÿËíc÷‹ÿ?Ê_B) 2@¯D¤ä^ø £¶¥E–9„÷e„w) >Dõs³õJ9)%”Ú­Ž{×¢ö*¯)R(TÅ} ã·Q„$ùþ’‡I¼!Zò”ðJU|÷åÞuÛ?Á$i9ÆFµÅYÜÿð€Ê¡|2ëÿWúø>š^!«;S„¬B¬8†À8! P‘ ÉX[Åý-u?;‰ºíæ©ûžtX~ª8ÅÀl6Nge>’%7IR^k«ÝEÀW|õCÈ­~ºRðnþ÷ŠýÉÒ*kíð"akøbw Pê; ± >{•ºgïß„ÐïkbûK(þ²}„Ë‹ËÕp‰×ñgŠÃ èàú[«-jÜâ¿Üó“ëÚ× œœCé´‚»ÿkݶ¨Ê»®µÛˆžhdGE‚säY¥‚O—‹n‘{Ô‰H£ð’7ÄðÔ.@YÄéÇU›N«‚¦p¡âI™¢½|„à‡¶xáŽ÷°ÞÅ"è0Úb„ ?¢†¬LS]SLuõÛÃ7C@¡‹=Â!YíîÃ@¬ |”Yó:~¹ïÚb¼ÀSDk¤ä-/ðÏáR}«Öþ`Ù§R»‹@ŒêJé—B1 øk{Yë½å°nuÿÖþJ³åcûûbßm×Ü_ö«îl”¼Û{—ÿ&)ÿH"B:ÂÝßáúî}Ü% ±þ#¯Ø®ÃRdj”EB¾²MÈò¿JŠRü©-jŸx'|¦ •ÿš‹NÕÙÞë…ñTí{‚ ˆÊ“%Ú¼B'Ž8ækLJX]ófvÚø#@ƒ‰cå—ë¿RNª}&¥õÂ? ¨´ÅñÇžÀ0.ƒ€).ƒ’cç"àžlVk&ÄŸ‘Žm¹Ð`2{èþX=qÇÝàÕsϵSŽ@WRì‚ ˆI«Hþ~¶uóLh?ÅÊúábÞ+žëŸGÐÊ d’r@Ç^_ÜšrÜøøJo'Vûc¬úÏ+ð‚´Ü÷Äø·Wq‡ú}»{ìcÿwù]<>vHÂJ`ÍU¥ª-zË:k•·’<ÂÕO•]E”øåê¬Û_…€uÜO ðqV}¸vÐþN½ÂêŠÐiËî*ëD±RÄbþ~Gšpí!†ƒÀÙ¨;œÛÙ]Þ‡€)Þ‡ýnïE@V1V¯-äQ$Ý:Ö¿ŸA`µSe‚ºßvG6f/~òoï÷:ÉôˆÕÒSbñ¹ÚÿöxÑçR_ͧ}>uÅU‹TM1Ø|ºÂÐ$ƒ2~Ϧ”~ú”òŸá毴~¿}qà¾Äͺ¯öŽ}jÐZ@ê\j[’>ôë ãÁ°‡Cº§ÖÒYÚÛ#}¥”T–‰¿‚ÜO\£Œ’%^Òx¢Œ¢-&ã·‚Â! y⽊àYò‰u÷‚ì/àSøü•eÍÕ_Ù¾;¾ZQ–*4e^ü wШˆ#õîíò¢ŒûCZù C`X˜`XHÛ} G@)¸ª*€„»<¹û&½{·\˜lk£‰·-S‰€\¬•RM‚T–‰¬bý•G]iþán-R5YþÓ´#µeÂÕLÔuEð'Á_ÿý#Yü±üïAô÷ò¨êÄ\/ËÿúQÃU!øóçM BIdùGÇä ŒU‹úó(£îB6©¶(÷ûUxM ì“‚3x„a׈úJ& TcJÑA°J?i¢X©À¥aŸêE™Wim™`ÒÔµÈv‹í*j‚qTä¼fm1 CàÒ˜àÒPÙ†€!pÌS½k¬\óLT×f `R’?¨»Š€æLO pÑEì·ÉD@ÊC^îI¨bâzwæ_ã/ ëÏW înÖ²ÄvIþ&†q~* òuÒõ)E]—ÿg]b¿ Øü¿Ü>ò®ÿ?°Oé*BiÑßÇù’³ÖÁö(€É!÷}y–¨-~ˆâIá'R:ýtmÖ ØwØ÷`>ã9RWÀðH ¡r«8ò'ÁÇ(^þ²säùVök-÷ŒÐ,ª®Ìm& µv{eÈSñÜÿ×2q÷ÑJÞ-â-µ@;Ðû¶«W G;½½'¶+MÖ@CV¡¦Y…Xq qE@TµupñÍa5[&Ÿµ3ñ²‹Öû5üû™é¸>¡•ûÚ ü‹e]Äj÷} µ¤û ®Ìÿå“UÏáÓ©%ç,Bs›'\çž( s á¡Sÿøq×ýˆÀÿ´Tw¿#Þ¿Œr@ieP7ïHûÇx0òE…ñâÏD]š1JY%>ÇÅÿç¸ü+Æÿ×|üJÊYTCÖ…¤xVôQÊ7yXIѲ„B­îë(^¤˜Ù#ìJë5Zk A5t b¯Ž@·òDú—¡QÊKåÁbÁ-Òf瀙W‡ÕÎ6~XöMí~ïFÀïÆÆ~1 +  ÑÝç¨FØ[u÷ß–1ƒËeØ„ÿ+€91‡Â¬Î?¹ûç£]7ëÇóY·†à>)¬D´¦Öºâa'÷›?ˆòΫߪ/K°Tʹírý$î\ €gÄ¡¯cýß®ÔÝ¿û´~êç¾£Kz¾ynt…¾é¦ä#y¤hcyâ¥Wž (Ôïáî/Åÿç8Fam‹OD€çȲLLða‚O@¸E}TQèsÀØÛ À¸ŠvòH ¢ùŸC¹þ.ˆÚì )ØEü'Eﶆ€!pULpUÄìxCÀ8B¡¿F °mr€µ~èÓ€íò]éª<À¹gÚΉCÀËRúœzηŠ÷1„Ubùÿϯº{|—࿈ड़çò±%<¨újõu,Ì{Õ†û©üö±,µWv¿ÇÝ¿ÜÀÒŒÅYÇTQ4a¡÷g/ŒèìÖ§n/wÿ`¡LR@}Nû[EX~€°üWXûã ê2¼Ê4‘£=Æh‹#,yPâ÷®%ôÉ@)X?\QaÂíÂÁ0‹{øCêç™þq½äŽðØè>Pï©LX|/¶¡;€:[¤ž?/¦ÜC>.å}ºÝ9B|ì¿ÕièªÌ dŒ¦‡Z²2c€@×Z1J€Š”0+ @…ɸ÷eP“s[&^k^ ¿V׈gú¿‹ð/áKV×»(ÄZ-«¥Í_ÃÓº²3lý(n$üKÐ?@°”µ ëÿW0üÿóìþþ§üîPúb…>•»¿dL/gö„Í>V ÆËB.‹~K©¬üžl’øþÏpý¡ž”RDÉYaÜ,©AF‚<åW†‚,ž ðfPJF¥[ÌÄÊ®†'€¼úÔ!#¬»õ•èõ§¤Ú0u\DÁ“ƒP¬ÿI¼U"ô;?¯Œª0_Gí6‚§÷-Mîú±Òc€<%øá\†üÁ¯†ðÐ츺BLò‹z¼BÒø¯xY\‹LT?%ŸúÏ Y[Í'½À%á_ ì6y½Äoz•6}Tÿ|Œ?ýWëg¸úo×Ü.‚ÿ7ŽÜû_Êêà¯ãý¢ ”2J™ß‡P†^‘hZIQ—Àš/˸˜ü7ý+8'îz²Ë¿Rüei—IP¤GYü.×ÿ«ò«/)m¦lRxˆ~ƒzÛ!TcŽ>~ >{гëßØÎ’œ–âC¥hàRVŸ¡ÂndÜ8dLyüqª)ª]Ó˜2¼ð€Õÿ%ŒÔ‡L:ŸïWÝ—eÒƒ¡ØÁ=8ÎféS†ÏT=.•=ƒP¶H¸¿‚Ý ìoa,ÿ—\ŽÖ dJhK8Ü,â>¥õÛ†Eþ«­îä ÷Ï/Ý°öÓ¯×jÞ# ÁÁ­ž íµ7AèƨªSe Ê£A†9f®‰ÅôÿÅÓßÞ_pK¸ù Ùß"mQY&$H© Ž»ð¯$è•‚5—ˆx%ÛÇK8ÊÞ«AþåÅÊXš~ëÔU°f—-!Fa_õ«ŒÆOÅýKÉãÛ®Õaˆ+Ίf„S„»~¬t†@è;¸ÈÿZ¸›–ëMwÄdÓ»#ø¿Äµ;Cfé¡+à p5•g)_AàZÅâ*–ÿ".×b_—[¶Í[oò-œ.7t¶‘ IWƒÅ«±„ý]Âw$<Êâ/—òý:<(¼Ð0â“‘W¤oH]O’í*9ÅÃ$æÛÜ,$ikÄIËê/²ÉyÚà,m0 ž…ê{ë<¾÷Ÿ<¤x“rD$³Ž ¨©¾½Ç„Æcë…oƽ÷ëIcGkyàtøÈ©ZŠ[ CÀ¸*¦¸*bv¼!`œ! á_Ärÿ/áþÿíFÉ O"ª§Ä{“S 8;Í6& _Å\‘#ä©FàðÖ×¼ûO,û¸ëUÈÖ$˜L‚ÅuªNœ%òÆïàâ_B¸ÿ’4~[ûòøz§kõßÀm|cZ(Ú±œ¿&3ΨÒG´ üxRQ”Ê¥¶õsâß?€gBJ§_ÞŸƒ/á–2)ø&ÒÞâ/ï“IþƒZú—<þ¯Õ­BæèÔío ,áÑqê…FÕõjòc_H×ôÕNÛý±£WÂQÊO¨KÕµxR|Æ¿"¤@[± ©BÀSUÝö°†Àí" c’·L\Áúÿt¿â¾;¨¹çeò¥‰úíÞÓ®F¨d„²HôÔ§Wᚘþ?†líX2†õ0¢{[eRW”ÒNDuJè×çŸ_컯÷*w6ÜwôáZ»}¦º“Ô,¢¿0IŠ 1Ѹ¢RÅȉ'÷h úŸáæ¯ööï`ùŸ'Îß»M÷R¥ùG¸- C| ƒJu˜A0_ƒ”U¼;Äð)wšRË*hKè©E˜ ´Õ©vNm´gÜ÷xå”àÔ™ƒPžv)Zò¦ê¦ íXÁ ãRÏuÌ ¦KMX9 1D ƒ_e2¢ÏqÃG°†B VÁõß»šú Œ&1¶L$AÕz9‚XU¬±wpùÿ€”kÄ”W=ÑZ¡ÄČѴU,‡RÔÕqWZ?‘ü½€äïÂ]„þ§°üKø—°Ø Ï*«Ÿ¯0êmä‹C^•Bm©ˆ€›¦­)ú*í,0¤x¥ÄS¼A¿#ð*ÞCNTmÂIϯðõGÅ´›uØäùØ¥®=™£Ÿ–÷ê9Õýª¦m+@ I¨âP—ˆœ^×q%<|Û¦“f u1%N€”­ÃŠ€‘†¯fL¾:±cƒ€âþ·÷ËnaâÂÄ3ˆÿ¾®µÝ!ÂFËÇÿÍ£XA¯‹@OøW@j‚¿/ÖŠžôO±ÿÞ áš¹¨^Ü›Ÿ'ù¹Œ°'á~»\s¿ùqϳÃ¥ÿ÷¸þW°‹³£©ØbŽõ$gqþ½û«ŽG±è¾þÓ+«d<âž ô¯àeòˆ”’ûhɳúË@m.ЛÆêþÓ*Óê¹……”"÷’§ŠGÀ:®ä_2VÿÓú¡«*”"HëÌ£¨j»ç; ·¨¤ç­ŽÛ…†ãñqÇڕPØ=Z=us… Š×wœk» CÀx¦x0¶Û0.F@‚E‡øà$a"þ;Fˆ8f’ò )BEÝ%X_|-ûuLèU¯âQeaL‹-¢µe¬ŽÊ³WŒ¶Ì‘¶  Ç©*~_DŠûüv¹é^ÀϱÛÿ ÁçýÕàïP<½Bäîïcý‡VÚ÷ßHj)|z;”Ly,Ø‹Ä÷+½ß]Hþ"ø+­ß" ¥ýÓ±Ö⺸*ìAž …™£¼sª£ô€YöÉK«u:ãÃ=,àýmq”GTéžU…uЗ•JµNê|zÚM 8ÊòÙ½ C`¼0ÀxÕ—•Öb—Kq Ábû°â~Ä¢´^ª»#„‰n|©Šˆ"¡(²b @HØÊc心&÷ë{þ­a•éZ,°$âÞvÍ·Pk x¡‹ÿ:V_)æ¾ÁKçúéÜßöRûíð{aÐ÷R þªH­GµôRFð_% ´£$–ì5Ú×Çó9K¤÷[-Òœ[òÇ@IDATÆð0¡½ÝŸËº ¬bÞMø»ò<&àY€ðwæÜð’B@ŠÛ]ÚÇ5·CHz–^;xû2¶gä¨OÂÓhõS…ÃãÄ-¢Ð÷ŽH=}z@ú‰-†€!`\S\%;Æ0ÎÐܼ•¿… !ÀúAÅýiãÈm×H#Æ>ìÿËA¶L6ªbƒÈàsX£î3]Ë'I»†{6–Ù9âcAžøÉF"4O'+~CéÞè‡[XúÿrßmAöëî7þ ÜýþyéPê¶LÄð »yoÜðƒÌ©Ï*‘Ã_©ý>$Žý}¼èD0ùÓµY¯dŠÓ¾ø?wÁ,ÿç5Ä®\ß%üÅI%­”â‚x‰Èaµ…"@™8Ûúëy†`ß«÷é ÿônխЯÒ'*x¨ý‹E[ CÀ¸ ¦¸ JvŒ!`ô!I,áÕ†ÈÿZX"ˆù‡T¬„Ð!1“ýû š‚MM>Saó¸üÌë²Üšëÿà+_¿DÅï×éƒþ· S¼¿b½ Î_VÞírÃÒ_Oøý”cýIª8-½U÷Ëþ¾’mzh¬þ¸ùçfDî÷««ÿ YÏô¿@;“5[®íÒ_(4À–÷# ¡_œZžóOÉ=;¨Â.2—vq̧ѷ _Jûó½~R£ÏQOY˜:+xq(#€ø.Rð¯œ2£ºõkçÚCÀ0Þ@Àob_ CàbänX–õh÷Èíbe|ëÿ·•–;@¸ØãÓ]úgõ_Ï~o$RÌb¡ýd1ç­ÿ.$”iRjËà®M$œr÷ßFèºWöVÝzyà~@¨ÛGðŽÛ^…æxá_ÝRõ¢uXªGéB}y(!#q¼I>A8ý‚¿5¼JþÝÃE·„Õ_Üžäßåî3kç•—ª;¾Ixž,äé³ ·y\£]œ®sä6hC_*RÓ®6b’ä•ðüÁtúÊ>)£Í.oÃKúù‡n~’Væ >áé؃GÄî`×GÀ×ÇÎÎ4¦ MŠc¥ýCÈ8V>q&[X%N<"šÍÛ25ȲˆPVD (b™M²ár+AýOv¥p“;·¬ÿ"Û‚ØOÖYý¿Dp„À&ß•ã”:ò.Þ^¨“ `xèËøw*ÙßEi;"§[Ì&Ü]BIîͦ½å Â? ýyÚ—O))iÖ–+# ØÔ²Jω/¯)Uä!RÇ«+I%QœW¾…0` ìt› úõ1%ÞÁ 2cˆ“Gcƒïâ.ƒ]Þ0ÆSŒÚCA@“ 1k¢!×ÿmRÿmÃ"^"&QyŠ¡‘J9ì&!A 'MÌ H$b1Ü´cXiãݘìqÒŠ¡>(·_1º—›-÷#d`RÀ½¤/~ ç~}ÿi-€¤¸Ž¯'ƒd  Íò)âæŸñ ¤¸»‡Õ_îý?%uݧÄ7‹äo%å¾®ãõ8¶Ü )[äþŸ#Ôâ XË[' Æë(Œ’µÙ\ñ ¼¹øÍ–°!×ÞôóM¼|f bO … xÌ;&lõeå1‡€)ÂW'V"C ”(Þ¸…•¨A¼èùÄ¿\/¹ r¿ÀQQਟÛëOß$?”Ob…º5$!¼¥’QÜ´Ón ò¿4B…‰ ·†ðkRÚ¶CYû‰ï_Ç}ûÿùn7îº[G÷­wßîÆrŸpœò3à-Üü_«QöOî-%€ŠÀ‡(~·Fê>ex‚ðÿŸ>\òîþ÷‹Yw§˜ñBœ 7Ýkñ2öå*È‹"›q³`ÿëûóî“¥<}÷À=Cy¤v¥ö$’ªÉÿ1à¯ï€õµâJ(㿧¨RW?yØpsùÞ1¯Ð1–Wƒ]þªØ(rUÄ|¼) °]Þ˜û¯˜ã&Lâ"+‘:ê€O™Ò–&õÁ¬~RØžãýHÀ'ŠI1 –„ PÂRçûϵ#Þ‹€úœz–âüëô»&ýoíÅ‚ü"úÛÄ}[®ÿ»xå(à zUA¬·]yÅ?«w÷Çúœ ½ˆä/M›‘«¿ÜÐïÏf<‡ÄBé<ŸÀÝÿ½ Ù×B@ÍC ‚e!“ô©•ÆU^&jOx™£DRZ¾ȃ:‰q¡ÉµËŒûð*Õgƒ:k¢௔€Veƒß®{MúÞ×¼‚v«˜àVá´‹“‹€Ü ÷J±@b)z†õÿ)ä{ìoD^“ûøöd^ÙÃ&š’õ¥ˆáÁòŸI˜ûiÓM×ò¸©3¡oпvò¿Ü*¹úÞ_põÿz·LèMË[l+SAðüøYÍ+bnZŠž¯)ŸÚ ›j#âˆx€§È¯–  ŸÒï¿\ÿW±ú§ø½Ëð<È Ë`§¿q¤à\Ëø„\ü¢Lj¸ÿöíV73mëˆcê= ÄÞ®¹žÞ¼*Ôd}•Õ_ñþbùÿ7r÷ÿýÖ‘ûŸ|”ò¯#‹?{’?/ü÷)n^Œë_Aí£·È€¬ÄYü³„‹Èâÿ €„•_Üs÷çr¸û‹KB©ýºÏ`â€ààÖÂX\Àî¹>•R&Û€OâÈåÈì¡>.+³'ÏKƒ+Ž]ù èû’AbÒƇx”x'2Nˆµ£ú²Å0 0ÀàØO†€!Ð5àÉYþ÷pA>ÄYgòqûoóék*êblŠú—ü)ryÉo¶\u#¹ù—±îËúÿô âv*Äøãê/«ÿ“üÝJÃ5àâPœ¿èjb^Ýp”}Qe µƒHþŠ¸$çY?XÈx¢ÈG³YO>7id‘ô~²úËC@dtÖ|‡»ö¤€XŽn²FXÆ'ó9Ú™^p1æ‡["»Û{ ³4érUz'çQd𤑲^JyxØxü^íC`*0ÀTV»=´!pydiÐd¢†%òéö‘{¾Wq? À:éÝ{»RÈå/hGŽ7’ñøhbçO’Y¨\ ÑͧhÓÓ™w­:–Û¿Rúý°wŒ°ßp÷ý®û#}nŸÉý3”ÊÑ^£/B»Ñ]¤q ؾmô%‹!Ð?D˜ü÷ò;XýÿöÉ’[åûBÿß“XŸ¸ Kø Ù“øòLËu×n"òÌ"@~qgÎ×Ý·ŒõOkÞ EmӤɶÂïöy7‹×F¹ÑÄ›cÆ=¡þâô+q³H `‹!`o"` €7±ï†€!p†€æóþÛĶ°HC %aäˆ GC?Ú2µt§•âš—¥©ƒµ‰kµº~²´¢ íài£Üì"ú{ßÆ.¾»¤üjaÙ;•«…\/´¸w¿ö/Ï bIà5_îürùWœ¿„ý;þ÷Š"üKû´~³(tœ-£G@ÝVäŠõg¨÷Š¼„ž êǪhôõóî¨æf\DéxS¼›•°Í8¢÷vÄß ýbL9¦˜ò`o\„€'"#ßx¡Dñ…[$OIµ…0RéÅw½.ºŠý6Qôd6M=1H»M±ÏË%ý!¢Ë[?QO<°‡ .¹üÿ°{ìSü}¿_q¿}¹ïm²Ànãö/—ÿ6‚õ©,åÿβkÑŠm¹ûÏã柅èo™´~?%ž\–þ' Y÷!¹æEòw×ÿ,Ç$x³LzôFúGU'wqµÃ#ÆøMBM´þ×—îÏÛ%Ÿ°Jè×išÛH ëÍ}¤îˆ×þ[ŒÅQ–*5J|ê²é¤Ky/€°>€•Ë0F…€)F…¼Ý×¼áäˆ8䃲r7ÜïP2iÜg²aËô" Úׄ“a,ÓRˆ,ŒØS/ò£ ïm²¶Êª/ϱü¿ ËÆ·Ýÿýãž;$Ŧb¯eÉóz«ˆ@ º¿Ö”Qº‰)å”Â¬û_ãîŸOºÄ’?â#7ÿÂH×Ù_žï…ÇŠùoÑ•aâÛÝ#ï}òûC÷/›‡>þ¿ŠpÙ­j«°!TÇÕo`‹¢zâö[§î3†G„I!Ç'EŸ´Áøê°Ú†À¤#` €I¯a{>CàÈÀÐ Ö_ €cb“«×0Õ½IéÅ–éE@£÷‘àßlñAXÀjË»:>¬ì$té³±æXþ_”ªžé¿LˆM«ÿ™wÍ™ìu¶ñî ôÕy÷Êþ Òd!ð[Œ'}ê¾æ³nwÿ{³iww¹ÿ±ü'DÌÝ s¥‹Ké¤, Ö{ŒíeÜÇ7ñîúf§ì=O”mB.å54{¯ºsЯGݯô¨“0ãH‡*©R=U^ɪ³2ïjedÉg’¾»ZM~3°'4®Š€)®Š˜oL ²þË=t¡ä›õ}·Uª»:Öö—ùt—`=% Øcvf”þ§í„BDhrÿ.¤’£vd õ# á¿›Þ¯í~«õ?=Ûó±þ¿y¾ç6±ÜÕp¹–ÕÕc(3ùk0Ž¸¿©XXeÆÂü(¢±‡ú»6ë–6¾¸;ëAø—ƒM^arõ÷©!-¼¿ Œt[¤®‡ˆ›Œë{¤uýͳ}H]+(žî+É‘ÚUnÿb–Wuûlajƒ#E/d7ï à¸-Æ•êl«Üôd½RØç˜/dßCBö VCÀ ¦ ìvSC ÜH¾×GŠ<LÄN®Ôšž™ÃýVºA#à m‚v!ë¿>Š'Ö¼ô5™aÐå£ë+§º¬t¬ü²¾>?¬¸ ÂjduÝÆ@ÖÁÀ#¬D›(;ÄãæÝêM6L ¢ UQ˜wžJIÄDS ¢,“Î&Û¶¼@—ðïk,­[GÞúú§’ûò¿}‘jj².áÿíSG³'uw¤ÉsøÍ#ØçY?ZÊ»9¬þ÷þ±Rt³é8iäR„Ä| 9þGSmýwUª?Š¤³‚Ðÿ«¿Üý•Yâ/ÄûïÓg¿Ú9Æj\÷™&šŒíjƒ^ñdÓõ~(ÿM݉“E¡Û¼¯¥õyo þ) ¹˜o†¿'»„¡yµM6Ì—:S\+;Ò˜d%Òä¡‚[÷.V¡?ºËÄbƒÉ:?¹˜0ìAÏGÀ ˆX ‘ê¸ ïàBŸ‰¸Ú¬áçŸ1µ{…‡ÂiZxJlaéÿ»ï·°¼ÖÜWÛGî(êR¸Éê*&½°,Rô!Pxa>…„p‰xþˆó¿SH¹ÿøá ±þHÿ’Äûg|œ¿ˆþ¢25vÿ‡åI¦¶ªÂž&ǹ*Æÿü°ë¶iÙ/CòW ¥7ŠÈ&åÙ…‡€ê.H19µ¨ãƒSÑøGÖ¥ˆE©Sæýý³‡un¤ ,yí¨zm1 C@˜ÀÚ!`¼†€Ÿ÷˪ËÄ°ÎıŽ»ò1ìÂG6ø‘©†-†@Í;Ùjá6,·b}D0æwÚd󬕨O‰t­Š0&O‰-ïò_sl+ÞÚ{Õ@ÚÕ•¶ÏNÞÆ9:ŽÉ?ÆGqüy¬þ)¬ˆôÍe`÷O»5ÈþV°øçQ (æ_ÇÚ2ZÔÎT•"åÔ¸-‹°Üü÷ªJኋ?J§ÂNï¿CÛ“»?q^Ý“TtþG[7º{÷Ý\C™Sjžº"ʆˆYiʾ‘Tã[LÑž×N6 › ` €› g牂>‚Ê6ÄP%&‹ÛL·š·ƒà8˜aš`"kþê…ÕšIåí凃2'î—õ9âŒÙ‹<¨TT¶tS$ÊýzÏ¿‘îï_×}ÜIÖW/8ƒÓ(±:ë×ÔÛ²â/Âà_@°_Í%ݯîÌbé#üç܇¸þKà_"æ?ƒb †Ðè­þVÑ#E@â]ƒÌJy@˜É»eÈþZxo¹¯ 3)±ýt¯ì¹' Å×áÉÔîFÙöFŠÚÝœ~{ÂãlKËxœ¨G¼÷ÞÎaÙ2„æÐW£aò0š èíQ qDÀãXkVfC`€h"Ùb"©Øÿ¬GGä#?@ {ɧ+÷ë[ @vìXG˜ØÅ¢ÊÝM†K1ÄSfiÊò/. ²i<Ç{WìÜíŸú Ô43~«?Ôwq÷ÿl¥€µ’¿ùœû`±à½$øÏôÇà|ëÃGÀÆtB ÏŠ÷—§ÉAaŸ´’;·JÙôpMÈûä˜ïRΉàï4°ö›ð?üJЕ¹g—,yë-bý߃O zB_µë«ß.kŒ¦³ ³âƒD@ŒÁÅ*c!’õÿr(M"D`f‹!ð6L'ù¯ö„Ž¦¥Š$þ4 K|!Ò¼ºz3ÅY‹,Q„l2Òy}Ú°»Õ9÷SàA÷þÊ‘8.‘:,CÝ=†ÍUnþ|÷? Ûÿ…ÈÝßêõíÞ0ì=ªÎcuY¡Z´­—¸ø+¬DñþÞ<„p²å™ý+¹Ê:¸n“‡]UC½_Sí‚æ˜qø%¾²r(„Wà[ݵ.ìf†@X0@XkÆÊe Éø²TÊ…´ÂÄá)DBÏ xŽÅ²âcE5ДÓC ‡“IdYbN!CèØÇsäe©†RõcËS2f3Nõš&ØÈ +MY6¼ Ÿóo]+¸¶_sïà;å;øqü˜ýãÿë;snËÿ§«E÷Á?R@ ¯YýEôg5Úkÿ#\© ¥˜•Àÿ ×þ=¬ûÿt×}˶,ÿßíU\…¶Vãºß!étQNì¯À¾¶0ÂDZ[ß&Tv™wö: !qw¨ÂŸÜœµ÷þõ'u)­åI¢ÏAµé‰þ¶ñÖZGùöž Yþ·P4øýTq8›¿¶m™pºïi‹*Ëà ¢c²”ûj7êÇÖ &¼ Øã—@À—É1¦Mj¸oWÍ.ù_¹éž—[nE@µc¹Ý§¡ \ùƒ™$mG’l‹¶òŒc@˜|(r„I ÁaW¾þ„œ Fý;X×%pK þb¶ ø¶ÞÖùx÷Ü@HXÁöUž¿;ïç 6´í¿÷vêz”!ŽW¨› Bÿšbú©Ÿb*á/dÝ<¤~²ôß/v­þsÙÖ…p¨8Ó^ƒW©ˆÁ«.&ŸI­oðЯ„˜ýÿB{:dûǃ*¡8½ÌTY7Î_8˜2ÙUCŠ^^ÙRE öXÈ%ü{=ÁX¬O<†ÐÚDH+ÏŠe S g»‹!zd!¨+Z†üï˜Iä& €?£8³´fŸ~ Ö¡+à0Pû ƽ€òâ°Úú™aþïßt¦\‘õkz7û68=ZÈy×{¥iÛd’®}.ª¾Õ›•_urtK¿æO°öz;¾ økI¢€{ÿsî—k³nÁÿ“•¢[D!D1íñ6xKáUËáïb=ɧö;dlÞ Üæ7¸û¯³þ¡ÿ÷›GxjµiGÝþæIþTåoIy¾a ¢xvÍ° Ыâmá…¬ÿ¼¿ïÏ¥½@š~A£é ëÜa©²i(Jäþ€·ixäÐ?£)B_EV@C`8(>°Ž§øÿ .ƒ „’:·¡-†À{`>)ysŸö#†û…lÊ[%CÞuyŸ^OÉaòè `Ï"€“~‘¸{q$HЮp;)ôE?÷Ú“‹ï›ÄsÝGVþ8 >YB DØ—EñB°WZ¿'s¿¾õÿÞlÆ—CeÉ`í£ P¬¿®cËhWˆwõG‰vüáâ¿~\#5kÝ=…Ÿe‚·}¶U„…ô4?¬©@“ñF[#»{WÐbU£I””ë@êÝ®8?R‰¸õñ‘ÕÏtÞ˜ù¥([B„€)BTVC`”Èz´Güè‹Ý#÷7nåŠÞEéZÿ»“ŠQ–Ïîbä'ÎÒDêø—ä*M„Xç~½S"£Ä‰[Âú½”OOm¾x¡“DÀN`y{²wEÜð+¶ûf»ä¾Ü:r[Äoÿ éÚ¶ñ¡¢Ü¸•®Í q)"½~)üùhr¿ŒŸGé2§0 |y<œ%£€°¯}¤òË  ÈpŒ²4D9OaRh1áßÃ0Ò?ªú:ýF‚Û6ÿ6ÜÿÏÞ{vI’déyžZkQYº»«ÕˆžÙÙÁîbp÷€$xxxÉ¿ÁÆ/üN$Á€ØÅîÌìèi]Z¥Ö:“Ïs=<*«ºº;«223"óZU¤{Dx¸›½fænï•sŒ_1Vþ—ÚÈÿß+,Ú1¨dtÊn|±=×–äÅÏÆÄ67»<Ã{äÿ„ûñ,–YZù9<Éô‘ä\z&/š4 )hš®ÈŠ$ç‹€Ú&¦2xЋ… ®j<ã|k˜Woj`ŽM‘7 $KÄ“XÜÜ-F{wŠA4ÌÁc+rÒÔ 9Ê¿£^RìM·÷Û½Ŧ7hþ ðí®ÁÛÚIé†0N®)9N\?¶B0ò§­‚€Mrå[ÝæspÓ"À9+ù—Üw!0¨Ÿê¥é7û¦õSË/ÑïB8ð‚TWÎm3 á·_î¬lq勵ƒÅT~ΗHÉV+îË»ÿŠøgÇ6C76q|vóbœl1vVG +‹"ÝMJ+ HM܉YµDàÔHÀ©A›'Nš‰Ä>‹OMI×6‰$½¼Ž‰ ¦Y|~‰/ò<‹Ñ%]‚ÐÅŸæmLÖ¬¹Ms‘É"MÙ B€_Ï_2bX2ùR™Ï.@w!hFþßÄÄx™…è2 ÐeÈÚc,æÔJÕ~sÉàÊæžÚzR³æeœj®BlÆçV1u>(~º=Ž¹º ±,>sùY®@ÄÒ ͽêÛoÿSþ&þÖ€¬m¾ý'ùÍ™#PÞƒKc*ï½jþä?Ï=÷)¾Ù IJg›»Dµ¸{L0³qrP?X(>˜*FúËÉqŒ}ž®ið~¬¶ß×cæÁßß›ÇÜ­?þ~ýlµØ ÞÊ1ôñWXFìUæÍ+êþœ MÓŸ-UÇão–×Ïúžñ3—#«È1Cn˜u˜{p?ADW¤"=]5a@Z´T7weó.Ödý“€&ë¬N"ð}¸ ¬Š»å3¾Œê[’LûÑ°º¨ÜÙÛ¿æýú[ÄÄt“ÓU4²æ”^â˜^_Bü×,°Mò_¡›Û#€Éñ¹ÃØ2ÂýòöND¶7}Aë p¦–© ”ñ²$­Ž@y?®¹Y¡õ×Üת%ü®Ÿgee#¬s~ˆPl›yÁ »¼‘;˜ )Ö¤‘%çg#Ñ<Ës)TšåÜ –V&¦–ÜfÌ @üM1ªU`;B§n\ª5„VD”n÷/*ÝÆ}º i!p–½Øò×jô ©å9ï¤à¼{ ¯Ÿ¼>œ}`»ÝA£/ÁßciP£Io¡õ_c±éwšô«éßbÿ?£ÿ®BöW04â´Yµþ+ìKü·8熅,‰@£pÅÈË f¿~¼„&Ï?Ó×}r°§¸39\L“Ÿº\h6úây¾Dàlðöé}ÖÀ‹ÛÅCƹiÿð "ü/rOþjnÁ$ !¬÷l5´ ü˜'®euÿŽÛxí^ûóWLî_Ô~sô{Ê9‰~ö÷¯;Q~Ö06–n÷Y Ìo+dfYÝ)ú»;â5ÜÛ€aÓˆš]„ÏGH-ª ÷ý¼L_Ú[ÛVn•` )Ú˜•Hc#€cC•&ç€ë;}úHöõã7}ß‹ËMÞkÞo¾ß5—÷ *õlÍ>âÿGÛøÍ¿ß¡ ¶Èf¤qýM78g–DàÔ4 9Z‡ðü† g=ÿ[cðÍ õ׆ûŠ‰þÞb’Åf¤>µÈŸ\•1®`nm»øôùJñœ{ò¼?_ü’}c¬!!.¤ÿ ²z©¶'©£üÜ[þÄ-­ï¹Ç¿ÄÛã@þ¼öÃÚ—þ®ö½»/ )ø"¾;rPíg¹i^Ö¿dmðÙÎAÜk{ç6Š.Æa}9J„À>^·‡zpÓê ­[“ƒAüÇÎŽ“¹Åx#œ£‡m×aG©ŒáмMÏš%‰À+¤à@òm"pž”æw¥†?¢E³˜ô³ˆØI7xŸ„ßíúÖ6š5ü˜ñcÒ·Éç+hUŸägÍHþHúçØJ´°ð\ŠµÚ‘Ç4çÕa¬îγÕyí‹@,CÙi:;ÖŸ¸Ÿì_ülƒ±ym¤?´OhÆz"Ͻ˜­¢laË!wPþlAø·¸ÿ†e~þºX=B(û¤ë¬Y„ëŒóH+O$n­ß¯ÙqßIR³ 0dû|Ö‹PAg‚.¶’<ÓEV©7•7ø¾ú)‡Eñt> ûüAfV ¾7¡boð'V?¨ý¾>c=q–¦D@%ÀB%ð7—(ƒhëïÉ}¡èïd}Á¾1)º»´`ÁØ5… VZú¹qt!0kI–Z8¦J·Æƒ,2›ÔÆ^S‚‘•J.1)¸ÄŸMo.*ò/¡ß'j¿ JµE.õÝ_åÁ+Ẹ¤i‰÷‹|ý«—yzïò`ßB0°†Iÿ6ï%¶K¼7ÛRõÀo®&gm.,ËR’‡{øB/|¾[Œazª«ÊýùÕâæØ@ñïLÃh $2Uj¼ËS¶µ5ûšFUsÿgËëaîÿ ¢ÿŸîÍaî¿I ¿íâ>ÖX¦ô[S@À=Ù΃0ua[M‰ã6¬\æàïÙÖÎç|† õBÄÑÐN1‡Œ­1ÔQãónö múvsýSÀÁÿüÕP(¤Ÿöø1fÇÏ!u;¼7¥çÏœÍ݃â1[£ÊòyD-´^rIëâÉyã6Kó!`_ùŠb¯³>àµÉË4ëÛE?ëŠÞöíbdq+H}ù^¤J½Œ›QÆS€Q\¦‡{Ã*`‚l.CŒ·¾î®bK…½dmŒ½Œ¸Y&B MÔY•Ë€D?¿>‡ýÏc·ú÷£á‡ ™¶o“í*ým5üh•ôé_fáõ5&Ô+,Æžó¾Ëk“ÛæxÛÀ§vµÔÞ ÁÿêA9°ÍV69AL¨Öân)à2úh_WÑ AYEð岇@mmuNÑä-Ëê]$ÉÞ³½Ï_E¢¼T ¬öA­ÁUïòZàÞý„ì*’gÝ_4“Rìöm ×,9¶„álMReð¶拤~Œ9Ô×Õ^ 3¦‰înŒlƒ1C´NŽs_á@eàyÊçO©ù×¢Á q¶¯a‚ {;w"P§fcÅ´³Ýç83ò RÐìËRÒÊr?ÿ¶®,w¹/·Ó÷mmE7æWíôùð6¤AÆÐÌ`wX¼8¶œÆ"ÚîÝ/:¹oWÁËqz€` a'ªÇ p*ø>®Xî×vs“$g„@ Îè¼ÌåFÀä„Ü­w÷ ø>0Õò«ERëoÚ>ƒ÷±_Ò¯Ù„?,ðå_…ô<êÁ{Ö9n^3¶;°©Y–aáåÉù+DñbY.Ußך}t<øÑI†„+AKµj‹ý£oâÛcü©~£ø‹ iŒó ›’ržqÞƒvÉÀ€7FyõaéR[YýìWÈCÓ@@ò¯y¿îVËlïίÅ}ùþÂcx5¢ýÅgs6¸79và:wªùó}ó¾]ÍS÷cÜC–8ÏP'd‚ß±Ÿ@ãÊ\$(Û¨dŸý >€°÷AÂFzºÃ4»—ã{8Þ,M³;©‹–eµJ"ælŒKsÉ]ÝÍ õf0Pà{]uœ£›<¿žbé°¦…Ì"ô0¶ÁRÎÒnëX ç ¼@­ÁÇmÿ÷á“ߟ*¥KÐ};mŠt€ ][ ðÅcH!bÆZG±²µ_ õn0;‹ÑÕÒÚaÔ )æa-àVÁ€–fÐ… 3¬Pt¨Y0Fb¸ÇÕòO"œ&)8Mtó܉@ J»À¢ÈÀ}ÿ-Èü<~¢î/(j-¿ *•..×°éŸcaµÍo¶]”ùb!¶ÆSxò&¯UYµ…[‚}Ù(i.ÜbõVm5.?¬/䪷%bµß•oø{d VíSð8>ð³xÏÖU`u »o\8ãû·s«Å§X¶ÜFsºÃ78à_½s€FS³RÉ‹&Å'¹Ð×,|o·+eçÒ>\Z/þýÏ"Èß׋øû#ÄÒt^–Ö d%Hß\½:ÝŽ^E¢Ãœ­óå¸ï@+Ë?Mü'!SÌ‹]*F!XÓÌ•[£¹Ý}údk ~Øü^+O{t ÅeâÚ/öê÷ >çÊ%ðìÁ…Ar_8\G`m:¹Ï‰s ;Úož.!ð@ÇóÌX¥€³ÄÜåd'½WD]óÏ©#`Ç×ñ¦~Éöîò‘ÄáBž¾½&õv¬ÝÄèÂ%esnn×ÓÆû»ŠaâÜš aÀª‰‘¾ ÿf0£€Bövb x‹÷JG©ï³$‰À© €S5OzÙð1©¤ÿ$ù¾ê¤Ÿ”Z~µûjTôë7 ŽQûçñU°€à9ÁûÔò?Æltží ¦x·­Ó§cy¡ò‹Y./õî¯ï€E¹_š[–þ½Ýønºü70XøûÖ¶çòUýÎ_;¬äî—î$Œgö åö&ìRj–ojË3Ɖ=IííK‡ø¦ö¹óÄTº¬,!{‚ Lò` µ)Í È+F Ž…"Ú"WŠYSFÀ¡k°Uç‚Äwƒûõ6¤çãò)cô11,qÿV0¹ÿ"÷qµæõR¥Í«ð;GïåœBóè4ú= õ0Ýgè3C4öi‚dê.óÎØ`˜÷O@¤œ¦sG8 É¾Á»C«ªü­jH•sRýâ/Ôøû_ÍÈdÉ­&þ«hù·X >ÃLÔ´9‹h‰î±2ÀÙãµ¢(C¬X@-àb§Ÿ¨&ýšø£+Á$Z­oüÜ“[j›òMþMJÚ'ÒwBx•šéí,’"ê7 ªa^S˜aöâk©–® f4ðd’…0¯çþ×ý~ÃZ…1¬ïï§è`L³mßi+v¹žÅ8UÀïý­{¼µ6ß?f«å@lùÃ^O ØiHjÞ¯ï#.X\úÏ }òÛƒ¤ì†¶Óe4¡õÛÁ´m 3Pµþ¦4[Å R‹€94DNR“ôÄ\ÐHÄç¶øRµÃ9Ÿð€TP/åy›÷Ê:&—yÇaࢦµ´Z~ƒ‚Iì§Xp›¢©Ÿß’|µÿjR4 –HL£=Q£è{5.«ÌéÙ SKÏoð'O¯ `r£5‹)Ì$BÿE[j;WXä/0ÆwË »œZ¶ø¹~Â+Œ{Λ0‰V"`©/ÎØ©ï—_Õÿò¹! öY ®0G:q‡q±÷÷‰¬¾YÜé/~Àµ t6fdXN“øÔë–;ǪZj ZVÛKpuÇúœÀ~¦óÓäÿ³+›Esç‡ðǾãÀ˜Çñ§Ž¥9ãÌÛ^ˆ¿é/M­6Äœþáä &ÿ=Å$ãü&æþ¦öQ;Êü.­wJBT?ÑîÔ§¯M÷[ï)~>›ÂGì´àæRìq¯Z [VK`*ÖõânýdõOs§¥(û·TlعX’1_ŽösŸvóÁæ^mìظ¿{9xˆÐÍÌdÌhÐ``á’Aûy–uû c\u+ÄfîHÐ÷Zè>P Åœ’9°ZzeåOœ:ÄyVFÀÅŠDHþõ ;˜÷»@ÔôS‚袑Ñt¤Mw ’ø¿ýñQ±ÂÖgi˜ ÍÔŠãt^sl|^ùzM1åà}$½YÝcÝdŒš~žk}X·t3Øûy¸éÁf  ¡@gq k˜a,a„…ÛŸ õ÷C Ì2àØCÂñY¯>?JŽ €#`äîåD@²ãc*¶åë“RéúX°¸ð3xŸþüš%LÝŸƒì˜i“þ¯ð [€åÊB2L᪅a< kËÆoy(^Nô³Õ¯EÀq¨/½ÛY–ä†öEQ/„¿­¡‘–%þ•Àý!4&úËñ½éóŒ¢/á—8Täáµ×|͇ʩœÎ­[K@Ë “ ¼p+@Рu¢´Åoö¸–²uÚàÜQp°ÃËæìÑÏ[–j§¶\‹ øïo|íâKºoÜ ,¦ FÑÆúû+ÃÛ\Ê`g¦Ÿâ’¡õq›%ø.ªQWM…[jö ô÷tø±+xʽý1÷z­\¶Ûqëv€Å`ó ß1ؼˆ_WcÇ·Îcµ“ÝšñCîÇ™ÃWÐú;¶¯ ÷Ç|…ÐLAþMïÇ¡1ùiS—rÞ©…-Ó ötF:Ï«}aAd€Âq,ã è½£nAQáÔÔ­ËÊ5½¼Œ°Âë©ÚK-p¦fþL¶ÞßBpñb ŸcÎUŸ-º®õvc·Æï}>iùæ\;j P è©cÞÅEbN¹—åìÿýŸÝóJ߇@ ¾¡üþB# 6bw߀fh8ò̃F“þ•šSç´›¦>Zbkþg@Ë~ Ï µžF@~ŒÉš¦n«¨/7Ù–¥Z òdªJ¬"«7¹M¾‡Œ/AšÙN@~0>€™?C4k·Æ‰Qxí¡æÁ}húM¹ÔÅ<‚ýAŒë¦Â CÏñ¦EòáïÜ*|°:.°<¿))Ç!)ε}Zè.ðœy²„ö~·—‡‹k|¾‘Ú*BÜט;ø~ùÓ@&oqiP¯^mÇ ¬Âxaο}Üo¾œ]-þæ éïcqc€@# <3‚­4­ŸÊsgIŽ YЄß×3Æä\sä°ÿí“¥Hgg»Z³0ΫÖC8¢Äર˜ŸGN~t7©o;…UãÌß~hc­óZþIÌü„5‹Ùùlæ‹nwúD©vòµ`á6TLa©£Ò‚ISþ9C¦ûüæ#NÜàêÍ«ï´`k³ÊoŒ@µ’ôGªÚê F Å1o7xu“Y ´~Ô*‚ŸuΟѾÕ2CóDëÝcŒ·Ê Å`‚º "DÓ]Àý¾˜Síñ Ó] ËÙ!€"¡ZŸÝEóJ߉@ ¾žüò¢!˱Ú7š÷KøõïׇݨÏhøŸ²Ô—žâ4ûk,ªí g[hùõq3pß.'MH·tàÁås-"Bxq±‹c¶çÔ`Ü8`¿®ÿ]« Cn#˜†0üÙµ±ˆ .á¿‚Ö°—‘Ëgµ7å^¼}ë?qŽ8—ÁË3j’|ØÍ)©Ÿ€áV•´Ð=ÀùbàËÏg{ãý—,ú‰wY,"03~€²Cæ‹Ö–r*Oä¥jðÝh "vw3 Ã,ø$h7¼0dLºK­X¨)ªAçÏ?‰@9ÒÊ{³î)›Ü÷Ícÿ5&ÿ ¦ÿçÏ^¸A®)˜w‡Õ@ªÇ—,§ÄKÕßTdf´1~å9=oôscu¼iüÏoL Àê-~|} m9~µÒ‰ßuîúEšwÇ9¨’–H˜f/aÅ3MÊBÝà~AF‚×ó^œlkµmÞ&eÍNû½|ŠÔÎ^ZŠi!`YcÀl†v3À9e,¥ò™PÖ bJàÀGóB¦~ž% ¢}9¯ \«  ¡ñs-ÜâxßÃû¬zºx~šZÐ}Ÿ Ñ_&X^+ÿ& \´Íö…£ÁûÔð«Ùל_ßýy‚÷i¢lŠ>™mâS¶Ltþ|øÉX¹ÎÕ:ª©\ᢖžíR˜h’–%h,Œ)×7Œ-Í5uœ€(üwï_)>¾2\\EÓÿc4ÿúÜ—Ä¿Ôú»hi–âß…V/&—š`ºèw!¶…¶U«¤_k€EæÝÃ¥µâ·Ã*À|á÷´iú%Q’‚p¬íûü€×Ö„Ÿò›¯±Ôù-ÑÙÿîñR?üëë£Å'¸\!‡´ZU-$4»îmÃ-Àßf¹Thº/ù×üü>ãežûÿ=ÆÌßa‚>›×‚Òéš"IÐ=ŘÞâÕü—ƒÍ±W+1&«7߶åxÍ™ãùÀ–ü~=ùûiüÞ(nóúë÷¦#Èß8¦É¦öÓeÇz5›o;qKîýêýi`ìýj cyüâÁBñ¬‚´œ»Ð´tï5Aå«õÖ‘éh­0"!“™Lµg<_fqèâF?À=¡“‚ñ~XŽÁ]c MÇâ4BâæÞχ)„Æ>oÒ9u¨„Çü®#]×5ò Ü($tž4ÈÌ„Õò›®ÏèÍKh¶ÙyxmƒûsFGã¿Jà¿'ôÛ€D,ðP˜ew©úâw²‰ªÙ­>Êm"p"_üW[1Ì"E‚ÿ¾þys‚HàÝS›@IDAT½ÅŸÝ Í¡ið$Ë­D`+úuf…Lƒ˜¤(dáåKbd¾õÌ­FÔuIš9 ÎcŽ=ËU‹[רzB¥òÍvÉg`N…Ÿa  ÀoMŽÁG¹†Aß!`â‹<®¹µ>Íd9 Ê? A@!Ò÷ü-¶s˜ú?XZÓþÏ f¹÷k9¢ €‚ßh‚&«qUcþ1']!Ç(Â9<Âø2&Ç5’ýËÉþO¯ŽÆ6½ß8cÐ9^šüû - K lÿ'àa€Àûôƒ)>7˜¿«ô—ÖB/ú¡å›œ 8mÊGAÌUFNXjzÉ]È}ópí`~ì` жWôuÔ³(X  €šChŸ¯ƒ¦Ã}Œç®[-s"vÏ®©Ñb|¤*{,‰@«#€VïÁ¬ÿKüîëg±ˆ˜gQ1Gþpý>ïÕÙ…Þ&wýž !2`ŸiÉ4íW{¨Iÿ ID”Ú楓ç›Dà4pÌ1;Û;ÂŒ]Íÿ‡S#Å¿ùèjü»>2&Ã’ÖJ»~Õ8ÍsÊÙËŒøwôÆ¥®OD{˜g?Ç:GB`ìÉû!ûóçÔÌ”+<¶|W×ÌÖÌ´Ùí0‡wö÷Šß=_->åe*ÄßÏ­`iÐ]üÓ㿺5A.iÌ;ÛGâüj}ôó¬Ö§Ùö<÷Ù!àHÑœÿ9D_þOŸ­ÿåþ|Ä‹øþþOLég Æ”÷z­LS'-ŽQ®ÛÙÖÖ-ùûhz¨øoߟ ¢û‚€4ÿÎ_Ó—9.cñ¦ëÃÉz09´UüúÑB1À¯2¶±·-„Ìoçù%è2Š“´Ù ¥Ú©m«·µoÜÇt¼ƒÎöAž+Ý< $ØË|Ô e/†tèÂR`¤7žÅ#ý¤ÚÅõÎ8?½3“€ž¹¹¤àbôc¶¢†À3ȾZ„ü‰ Þg4òë»Å"†u Y`ø0PãZû敆ßfINÇ«»jÅ4/4:ø»ÇR+þÑŒÍ>Ö×CŠ#|/Y­„æ!"ˆ -'á>Dþ£ú£)í¥ÍÝø_nŸcW‰]dÝà¸ÓÕ9Bо’Ø)Ô;d¾ÏÍÝß /w_Íõ`7p^F(hÚ(M‘ÅÕejc+!Åéõyž¹Ñ袥Æ_+-¼ôõ7 ÅçJÝ»¾&ÀŸ¾æÆœ05¥ñ\bìT7üúzÓšÕl4ÖÍDíá0ZÄ;¤ö3;Æ{l5ù×ÇHø½Œ³ËJü+t…[+ - ´Ä1ÂU,¼8Ç ÒX“ðU?Ém"Дѭ8m„K‰IóÿmˆKŒÂßò°Ô ê3­&°ë_jW¿ W»$NCçO Ne(ÎçXÙÕ¶åÆÏá}”ý°ÒH­ãf š + œÀºbkìÀ -OÄ`á§`"^žÎÓg9wâ6Îp«[ˆZûq‰¸Zw<$°«1 žÑ׿Eà³Dl‰I¿ª?Ê¡v¾Ug¾uŸ–çò9âø0âxo'fíÄšüßD˜t‡ù{m·q.ºÃõ¥ºlTä’ÿz…&=´Â¹ŠðM ]ü®Bø’ÔÍo4ÕÀª¶¯Œ´=ß*B5®»Œ *Æ)»c\¶ÿK-Àt£«•çKÎ œòyÝSA`ž~Y¸ËWšïäYsGÀ•Gm‰ë†—¦…· &ì=R„Í)ÜÀuZh*Y†n´“?Ñb¶jãÍ~} ò5ÿDovm°xŒ‹Ï(ÚÂ5ÈÝS,ø<âv„n|=Qm•â £'>,¶!‚~2^€nB¦wÒ4Û4p3Cëá‚q× ’7Lºƒ¨˜¢¾Èr~8sŒæ¿A¿+šÅ—Å ‘hû?c<,øñþü:©þøÇ1uµý]5NV{Îäs(ù‚Œè²cDÆÐññÿdf4bvÜ.vbòTæp²ë_¼_;§œãטs³›Û‘¡‡¾Ó…‡YÍ󻜷úÅk~¶¨Ùˆ›E9ì|VijÄÏ*Åuíûf«vÖ'x[Rð¶ÈåJp¤zyã>Fîž,h«±(‹€˜&ì'˜ÁþÛfŠ«hߟ*£†«‰öu‹1ÔNá0Ž[À»¹;“Ãáãý%dïpx üû‡ ÅPöIÔ6ñ½ Ã6rFÏèBðÒÿ‡çË‘Ua†”dZÌ öÿŒŒ f¸>Jæ|¸µ‡ìu 1Ëù! Gòÿt™ô­qþéá|DòWxó Íýùn­Ý6î^®Ýu)?ôeö’ê;ok¤ ]K^7˜¯ÿöƒ™âì\)~tm,Æ‹1%*áVY^€ÁuuD¢ÐfÁÉ"™xŒå°_ÅjHø^^~zJø,©:¶Gߧû AÏÙ|Býó4Ñ<ß9#PݽϹyùDà;P³<ˆ–Ùhá 3/¶ÄSÂy™£„…LŒÌŒ êrÕ̯¢õÕ¿áÉ̲„ìÆø ª³yÅÿáE|ô4/íG~xÈ$\¢פm!DЬüñJo¤TnÐ ‘“œì£‰4`™YLÃè*Æë›ÕÀrY5ÑøSú£ö>ú“®ÜFó¿‹Ömÿ£•­0ùñ„0à1ñ!ž`ò¿ iŒ/*zú)¢É7¨~vuÕçÎÙ~Æ…‚£kXì\åe†‰ÌÙ«ñÑ Ë^èÓˆi7‚”2J'÷C-oÚè1Ã}§šÇÕöBÑK.:9‘›¬‡SÐd’Õ9)å¢ü¤gÉß'G€çĦ “ÂL_ÿm³ÄÿŸ]Ã`8ÌÎ3Rø7Q×"@ÁˆÁÔÞ#C€.  ’hà0Sþݽù0_"H ÑÞc¥! ¬,â¶À§œ«^ ö¦[†<š-`ß­ã‹Ü)B3J6M¹ß'p än4,t0z9‘ÝùN¡@¬#z¢=¶ÐèÛ¿ŒI¸QüWÐö5»Zÿ'ý/ ©ûÇ3~¿†h«ò͵o#Ð4ÛÐúéë·ªB0ÔF}œ—cýTúü_‘RòCÓúaðg×ÆqèÆ]¤+"‡ŸôŠoUÍý‘‚³>æ’>3ž|„ ” Bï®kút@ØŸJ ²$‰@"44Î<Ùù#À¢!K"ФH&pG/†!´w –F ¿ÅÂw ósM‡s­ûÍŽsùßù²ÀÈÔaj…¬~}µ7ò®ßÅ÷[ìvù|ú¯%@y'xå~\¢F(Øøíäßôq‹8 ¨QöÛvÎÝ–w Â÷g®" 0È›šiÉžÇhÐMŸ¯ ,Ô£6p€Çdùvê=ÃŽò½=¬8v!ÝËcž¯nòÚ*~‰«Ç3¶_Cúÿiv• ûůÚ¶ÿ@GûªðÔF@õÕÛlÖ9_ ÔiŠ?Sú} ùÿ‹[“a±ó.®) §$³9wßaçŽV8Æâ˜[³:,Ð×!¿q@D©¶o~þüE"4XÚÅ´nŽÚd-D 9D 8mXÃJ$ ¦Òdø&Äÿ¦AÄŒÎgI ¾¿ÄHâ-qFó*GØÄoøgXQÌa ~wa Œ×ƒ$>Ç`ÂåG|ÝU*ŠQ¹´ABõCF¬P<ˆîàf`ÄyÉé‚MÑÇÈÚ 5À4[j3MÛhi³¨Ùd7„Ù·%êΦ~Û1P¸©‚›-…0·O°ì0½ß"šà/î¸ÃÀïtˆŽ]G6ê3êå8SãßËX»Š¥ÎgFÂ]çÒtèO€&ÿÎÝ,'CÀHëfpŽ™®3=žùëD ÙÈ4€ÍÖ#)h¾É j…y²³ä¯Æ!à˜$8¥Q秆{Â|üCÿýå;“Å YýݳW†û‹Iˆ˜ÛwƆÐ?Wü ñS´ˆÿùAD08#Š[^‹3ß½ò¹]¶`auw§ø=¤”Lo‘¦LbïµÕöu“ôÝG¸"Hõ¿F/`š: `E {À`ñ8¿±.³ 0EïLÆ@oKz-/áÂ1GPG#úÿáùJô£–²(ØÄä_ÑáIÑ]ãkƒûy‘“+H6-rnŒ–"?¹:Zü÷?¼F”|þécƒSV‚¨“^î²ÿžYA€R Dʵds¡Š1×ÑŸ—àl"Ф@tÂ+UH €WÉ·‰@"4²À©Ý#ÿ¼Zƒ†iN.©”fy3Ô¾ò ókð•x?…œ©9Ö|¤§;|Êw t;¡4~6‡âN•ÖÍ Íù‚½o•ÙÖ°Øê,ÖûöŠ~ê0‚ÀHõítò éÛøls¯báåZ/ 47€`ÙÖR( *Oßê£@˜„N,*³~?³?tËÐEC?ÿµíÝb­þ:äþ)³þgŒç°Äwúû?à¥ËJ…¿BšÀ•žÂ_/£õF§sµ;Rû«Cw ¬=ôùïKw†"ß!ÞXÖh]®PqöVŸ …(O–´4iÐ|Ý—€æ듬Q"\@z €â÷ÿÚƒþ©ùï‰ X¹Ð}Ûî¹Np•U˜7ŽpÅñ2€eM;s"Ôiõwƒªž§Iã!ÇÃé,JÀY¢×JK‹€„ï6~ÿ?Áœøú(¦ÿC#Û'™8ÙлbÖÇiúÁô]„+³h•Õ®«]îx´T|¶ Ù< ·ØLOfÄâûØEí{ù‘"WT˜àkåÐ`u[ñ­ä1<Çw‘©@ÄBž;¢~·ès5ÈÃX&\í‹øZ€Dú8VÊß袅»åå+—Ÿ5Û_ñPS¯À n¦eÔ´á‹[ñ± ì÷B’EÈþ3´ÿ_…‰?qvv‹qÎå–Ð{Å¡£zz£¹jÚÑðw·Çûc®þõ{Óe†ÆÕ}iÿZ¥,C@8ªŒb¥P …­öþ0ÄN®Ûéä£ç¼_«i4M_8س]¬Az 9€0`£ٳn!¡„BZ (ØкA«÷R¸PtßÔˆÊÚj–|TÏ|¼/›uôoYËêoYëÚßr¥&ßc*­¾ŸÁã½AûJ²¯›¼þü‡¶ƒH£h€Äâ0è߯¶mÿ¶‚€íиÊçO°Ìÿ¬V° ØáZP˜n/Š²DµËº—œÒ߸ì!1ÚJÓ~úäÖH_ñ!ÑýÒLq±ÔC¿ˆ¹8gi<Ži]¡´†1 ¦s »½´$©ŒÆ_4Ϙ$g†@ZœÔǾP Ž U˜$‰À @à?ÉØÄÿ:æÃÓø8=RüðêX˜Kú²49šiÅ~zc²Ø‚`Þž ÜŸ,oÿÏgO‹ß“JÎhã摗Іºr÷FE&X±ÁöŠ¢ÔÎÁF×€}ˆí,ñÖ Â {~ÿ¬ÔîkÞßÁ7^@‡DßìÌi¬Œ' µÀ$n ’ÎQ餅 º Ø&f()dèí(Ý<¿ÄI«~V#«Æ(ë$ÁªÕ.d¶Ub¯vUÄ!¶3 ¸'±—œKê}.}ɽþûFð7èâí\ã³9H¾X?ÓyMÿÙßÙD³Ïov96"þsî-‚ë…ë׬gh{dD©Õ²ªlíÓSÛ”’ „/]ÅqÍ™@@÷—·&Š¿ù`&üÿg°ÞнD‡Œ7"§Vç xb]CÝ]á:2Æ8Ÿ0Ž)7ö‰ß€Èq\Ë°ùÙ¤D HÎœ9äß}Á$ßYDàb 1Å•æþÓä[¯„Ob–ÓA@+€a4êÙ}„iüôÓÿ=ÖÃdÿt„¨Jß}½uy1©j#×ïAd¼€ùä«Ò¤—þ—­CÜ­Û"¤§Ÿ÷\ÁU@Ò?n FZ HRµÐ]!€€>¾³­­Ó}À1¥DXP¯p lUÍz{Ù9¤n0”<¸ÔîïAÒÕòoKâk/ƒõé×/Ù_•øc²¿°¾C ¿}4ù{Åsúö?á»ç£ðcŸÏ=¹ã"4¾JÆ`eÅÀbŪʕŸœÙß°¦àò`= æ3Œk~³s(p1fCØf9] Žg]¢Œ/Ç1ãÂï³YD uH€æë»4YŸì³øÊ’$-Ž€¤‡ÿm°>5[ïŒõ±P­¶°mñV6uõ唊S%Ìpë„\üüæx1Švý!Öÿôh1Èë:dvƒW”F‘=YK­DAÞ;$‚ÉÄwµdßÜó·aàË|¹Éõ%Õ›hÙñŒº‡94y%£}-G¨õˆé44\øNÁ‚•¹ºâ …•LUUˆmíOÉÏËHû‡ÔGí½¤]¿§u3_lÑøëãïwZQ¨Ù }}…+·C{ŒïK ~y¬þJe¾ÇÅ>g·ÚÇV1ŠYêÅ}4»ß]ª}÷Q ûÖ¶"¬Pwc¨§¸E`Χ‡‹óñUâFô‡Ï¿~ÿ¡}þ¾ª7¬R—ûDŽã.î‹=d ‹Æ(nÛÌc3±—¤l}"$ D  3O•$‰@ ÀºU¦y¶ÝLM7F@1ýº]Ó&¯8»q"‘k‡„J2Œð.5¯ûM´¾jÎ@oʺˆá6Õ:S:*­•ˆGo ¬W}ÊöÈ1ñi  Ú rßâ6µý8†}¥nxﮧ¯®èiƒì{@|á¼âÚnkïýÞýê—î-q­Z=¬CUü¼ J梗˜ýh™M÷ç8¸ŠphŒ(ôZèK¡¶4aõ/d•)1|Ùé o´~ñCèÕñv!ÈF%‰@"p¶¤àlñΫ%‰ÀEF X‹YV³}h± S‹;D×·xˆ8PÑ‹Œ@Ó¶MøaH^ŸÚ]¤3úØ/` ðw_?/þþÁ•Ì«&‰@"pAHÀéÈlF"4’,Ø£‹Øq…¦ÿãªÔmI0η‚ÞñGÿoÓë™îîÖø`ñ3¢×?ZÚ(–7÷Š"گᗿJTû°†Wr?<ߺãê/z+øÒß8üxi¨§;òöx¿o²£lƒÄæ¯VÙl FøÿÑÌHŒ !ùWó\’Í&«ÿ%¬NÜRk\1h¿Ù3bd_„ñx û3›œ$͉@ š³_²Vo‹@¬ÞöÇù»Dà„¨yÅ»Ÿüìï¢a¼Jà¿wFŠ1|IéÍ8áòç@ òŽÞïùÎtñáôHñÕÜ*Ñî‹GX˜%àó…uº’þ„¶þž±õ=_¿×V¿ŸêA:ó® ÷ãä~vc¼ø~t3â@höŸÿ^Ûóçò¡CTßÿºÀ4Ƭb8ç ¥ÕÇcÙŠü›$‰À¹#€s@"\4ÈÚGsºêËŠ Rô·á` ›fhý`hr$]ø„··w3˜†ÿëfŠyþúÑBŒ[$0àãõ­be‡À€v!ʳ´hþí.³n ö–Ñþÿö½©âÒýÝ,&™“~"Ò| 4ç²TÑùØÉ3€/û0K"$‰@ãH@ã1Í3&‰ÀeE ¦)Ö§x ’q €qÒÿ©ÑÊÅls I .SCíÅψ¿¶½–Æ7ŠÞÕ­b™ø+‡»˜ÓƒvbvdsvdU+ÝpxÙM’HƒpNáŽóLÿv}¼Ág”9™ä¿¬¹¶Zætc1e•”›6WßdmDàâ €‹Ó—Ù’D 8obÅŠ¹?Äèâä3Ș©Å²4/öŽÄ£ñáagD‰ÿpzˆ´d Ø.¶ñ#ßB«¼I.=ÝÊKA@öisõ¨Ä¿V#´Èšö“öñÉÁâ&iÿ4ÿBÐ×E´ú:{¯¹z¯^:Æ Þ2_ôQÕ±õ£r'8cr ž1ày¹SF § pžþ¬È›ôY#ž×jØ) uÁÆ®`R~³0£ÿ7ÿ(‘0öcÞÛÕU|‚¦x­ñc‚JBzŸ.s;Å=2l åì¤ùwjXÓü«6Vg Î].þ§^wœI÷75܉¹3;¯‡„½¢°´ùÕRo¬¾ü¦ºÉ²›%HDàD¤àDðåD x€A«Ú!š÷¢i4Õ\OgÇËÁ¬^ž{M„€#Â퇴ó¤rŠÀ€“«$š<Äqo¿-Ò&i¢Î;R d/7˜{ºßÜ å_©ý×5'¹ÿ°šq—‰Xiÿ“YD H@ iž1H.¡¤*}Ž :ÖÝUŒA qPÐm¹\ɶԈP€Ó/$Rü¯ãGÞ]|1»ñ–¶v‹µ]Ýô dç–8œ÷ߘ‡E1F¿}¢¶Ÿ?¾2Z\Ãü ¿qÙUçÝIß}o•y»ü~œòˆD HN‚@ N‚^þ6HMSùo|øaˆã•þ®bš×(¤Ñd½iÐRcDòa‹Å?wªøxf¤øÅýÞâë…õ¢ke£ R`±µKf[–¬ò|ûWÓK¸ÅTOwñ7·§ŠÛcõÿñ¡ÄiÝ‘¥5H!@kôSÖ2HZ´nßeÍD Y H\DÐèÕƒ˜÷cþßEîñN>K~Ø,ôfõÐã°èL‘;þYìÏݽƒbi{¯Ø‡tH<“\¾¸:Zî/ülœwÛ짙áÞâ*i8Ljšæßy˜¥E ?+¡N‹T9«™$‰@«!€V뱬ïw#à‚0K"p–ĘCÇ"âÿ ÑƧ0À »F>’~œe‡4îZoÄ£rù1æäÿó'‡Å3Rþ»O‹Xh°ÁëP°Ð4üãœI¢HZ-6~0>X¼GÄÿ÷'‡Š¿xg @dâèD—¥uP æKášÝ[šÙÙ¶NS²¦‰@"4-)hڮɊ%‰@K P ÈyÇ!Œ5 €*—¤°%ºñu•”:á󰽘D°óÁôp1B`¹ß=YŒþf‹x‡ÄÈ~~„§úY›r^]`?‰¶ÿ±ALÿ‹«dà0‹C9ÿNµ yòS@@yZXĽõ.§LÞ‹oŠXß䤠É;(«—$-€‹Ébdqˆà¼:"U Ô=«ø½ÈíŒ×AròÎÄPñçW·Âà×{ËÅúÚJÏR-Séü½˜žè;Òv˜>Fèv €¯ ×!ÿ}XlHþS&s"”ÏüÇöj¼Ôþ×öϼyÁD H.)¸œMLÓFà0|ÃõÿŸÆym¤)Ç’ž6îgs~ûQRÙ…_ù}û/ 8C”ù?>_.îpco¯Ð %gÓ‚mŸ vuïìψÿ?¿=QüíG3‘Â1Ò8æä;£ÎhìeÔüGlòTb·YD H…@ …dž'H./’ Æuv’ƒ¿-4Èrq0( -¦•3ÐÜÜÆ6V]Å2·‰`pÀ:UIzŠv¤{²tGà¿q3Zh˜¾ÑØ YZçÌ>„—Ôš;¼¶kÛZ¢ÍÖiHÖ4HA -ÒQYÍD hR‚kíJÒßÙäP³äΔ4i‡¬Z’Ë)üËû šíìÿ›÷¦‹ÇKëÅ—ókÅogW 0Й6¥?IBO†ô+¿Žˆp%ª]]íoãfÿÿõ3aögjòßÖdi¶÷ö‹¥õíbek§xÈ\úzq­xJ°Íͨ1—¢;d¿¶N¯fMD ™H@3÷NÖí-¨ëßÞâ·ù“Dàmðñ2Ø™ø 1(Qô_–‹…@;är”@€#hœ½ÛüäêH1Ù×R /!³ëÝï -àa‰• 7¦±ÂøÉõñâÖhez™öO–ÖAÀ.Õrfkš…âéÚfñ·šyö·uˆî¬æ“GgID 8))8)‚ùûD H$¼L9Ö 1éACi²,èn˜‰q® „µÇcHËU|ÑuXÆ`'ÈKE\.&gÖª#¼¯ÁÚÍ¡Þb’Xÿ1„1¦j4åf ÜάGÞúB¦øÛÃJfíÿ=ˆÿvñùìjlï.¬K›»Åúö~‘ó^úÖxçD x)x*ùY"$ÇEÀÅ)æþmÿ®b¸¯§ÂG<³ÀÖ=n„¾þÙ­Ébu{·Ð_yn}7L—ÿ4»\Ì¢Á<¬´h@+@¨2ÜÓQüË›ÅfF‹÷&‹wq©Í·ä‰ ÀùOaî í_…ø¯!(ûýã…âÞÂZqoi£ø÷Š…Ííbms§XåeL’k‡|²$‰@"44Ï<["\R4=Öï¿ A@g{š"_†aÐIºaȧۉ^rÏ÷»EïA á-¼Ž(¯/$o£òr~u`a£ÕÅô@Oqc¤moÄbè íã/gl váýÔþoìb!³µþþÏV6‹G‹Åwñû_àóâúþ+Í‘û§T§1gIDà)8Fî&‰@"plª d5bÒIäÿ.^f0?y*®ŽdË(7餣Íüpsô¿ÀàÊâzñdy³X…ÄlóÚD )+BÓ²­=‡ŠËÑRq3ÿkÿ«¤b¼3=TÜ™.ÆÈ ÀMžxŠ·I²åèpiÕ †¶EMþ¤~²¿Ž¥ŒÁý>Ÿ[)–Ñòù|…šÅûëÿ}É¿í¯nž‚%HD á¤ áæ DàÒ ÀZÕŹšÿn´Àݺ ¡ì1‹Ø\¾^ì‘`ÿÚ÷í]mÅmLÑ ye~µøõã¥â)~̺l×Ì™‹±ÈñF#"ñAðÁ1°ýÒAËÇWF‹gF¶uàûqòmÒ^5å–"Z.­O$Ìø!õšôñ|¹PãÿG|ýÿÃÝY‚þí ü[øïqÝ©ÆQÉGõYnD HŠ@  gž,H.% DÀÂÕE»¾ÿ‰ürE=¡êí" dOq…èô7Ö{‹Ùµ6üÑljÃÎÿäÿo8.˜\šýøol¯cö—8Kþµ¾h5‘ŠÃ@¹Æîþ~D¿ßçÍ6A# Š·§Õ]´M!¢BÅ„ÞWvt!hlæR‘þ=4ÿkÀLí'Ù¿GšÌg«˜ü/oÏ׶ø|¯X!à†Z{‘öµ\g6sGdÝD øRðàäW-ˆ€««,‰ÀY àXc‘«rEù„¤O$ûš%§à,:¡9®¡Ò²Ô’³RþÍ{WŠÛ£Åož,³˜ìkÚ{‹£[ÿGöSðõ9Zÿ?<].Ö·‹ÏØ7ÕßòÎ~ñë˜]0ØõÜ+£8‰ªâçYD HN œ´yâD ¸ÐÔ©êã:Û ýhë|©•”ü·žnòB÷Ö©7®´þ舔tš©K^ŸC|úL ¹ÓF–€Cˆ$‡s”ìœzÍZô°`5àý3Í߸ÿÆû‹+¤ZT( ù?B›º‘q« =Z÷‡%´âOцÏ3Fþô¬FŽ‰ŒÙ#8v€v÷AŽoŽm£ýÝÄ“ »Ho7çè+¸Ý4ÍÒZÁöÁç#~iýæ×zÑ®¯lüúÑb´ñó…Õb ¡€‡ô\`Bÿ6MCšzeåD h,)h,žy¶sG –ç^‹¬Àe@ kmmšëa¦,é“Û¿kvrºê ÛØ…Éúä@©¥½¹2–½Å|h?÷Jâ“cã{z„¹ÅÿA,jî[a Ò{l …jÓ¸ ­¡w‰m´â»£ß›öNíø}‚EÞ%^Ä ÚðDÀ7^„Úó4äpꢧæú°EÉN @:ÀcœÌìÁâDþ|žeAÆ–mÛ?ÄÝe+ûÍBþÿ€å‹Úþ¯<ÂÊÁ¶mÒ~{Íø¡,‰@"$g‰@ Îí¼V"\0CÓÛƒ KV”ve Væç¼6¿`8·Ns$g·&4Õî,_ÏéMïïž,+aÞ áic äy}§ÊãuPL0©þÅ͉â]ðüpz”Ø ýE?î­ä^s€jÜ@wÂûÂÿ¿ÿéqñR|AÀ×øÅoÊ·Ã- ˆXe@†´óê!MÞï8v¬¿÷¢¶ˆƒ0BêÉqÜMt7:¯¢b‹Øs¸¸Ø¾_=˜->ÅÌÿñÊVñ_.†°CáÀæÞ^Xì©õ¯ê›cÿ¼º-¯›$‰@ €‰@"¼)”#EB¢¹r˜þ³¸Íõíp.Ù®¦énSd°º©Áž0ù€¸Âß(¸äyý¨¨Í+-i: ‹ýh¹'Ñ|Oö#øÀcAW‹V(ä=´÷jÉMy7‡†ü)äøñÒfñÀˆó´ä{ªÅ«RñÖP¶vH%¹Î¹x¿J¼€ ,z;ÂÜÞ#Î ÓúyÍ]÷äo™úÐois!þl›í"¾Á î qt­áë–•¼,‰@Ã82OvÎH‹†@ .Zf{DàôpE\+®sMh@Suµiþ‹ß\øV]¶­Ý¯—ú)?˜)† âvå~?ÁëºBƒºæ0y1<Š´Cˆ‡±–˜ÁÜÿÑþoŽ üo0RൌöŸ^VÐ3Kž{Iÿ¯Ìÿ÷W³‘Ï ZH¿/õCDaÂ>çÚæø%~ûÒíýF˾-ÇÐ ¾ç ôçõ ð· ñÿSÿKëÅðñÿwwç‹\öxPOã\D”B«¡áuÊ&‰@"œ œ ¿üu"\räo¥éé÷ï{_Y^€)Ð,åßò˜p¡¸h ÑžNÈldv˜àuZ|81HZÀíb-êÞ©)§ÏáÊë´Â_0Ó•F³ÿwÁê©û‰ø¦ÿÞf"šÈKüô¯™ÿŸ­Ï0‡×<>áñÝ>ÇT~þßÛ Ú\MIø¿×¢`tÛl¥9þi`¥Ⲓþ5®g{æî÷tu£X¬e-°}¶kâ¿K½jœd0½!œF£ZaügD 8#RpF@çeDà‚!à‚•—kU5“¥@  •R”e¯H¶ V‘—°ƒÀ¢äWæÝ­¢åý>ܺ…Œô“Óõ?»1AÛ>{nPÀõbmjpIÞe.²Íª´ãJƒßÿÇXMü7Ì3#}D¿ï ›V€IÂ< 1Ö$þÐúÿ¯¿¾ iÞ*žóÙŸI‘÷Õú¿Q)o2þv7’{¤Óëél#®DM€ôFç:ÞÁûyçèÚþOŸ–) ÿl©øLJó‘¾ð Íh`†‚UêἎ;¡. –ãéªïý9î/ 'ðoŒÕ‹3ä^"$‰À·#€oÇ&¿IDà@ú9ª"ý®[»þ=ÆÉ/Ä! ÓìyO"Úï]µ…,þ]ÿ#;!×ûae×ûj{K‹]*ZIIk'æÐ=ĈÃà*VjPÍÐIÛö)A{jüéBtöÛ4‚ æß}¤Ò0àßÔPo1‘ïq¦Çf v¡ã\MÿâÆNa:<5äO׶Ão>ÌþŦƑß&çÊ6ógx›»äZ,ž_"ÔŠa™…ϱ`˜·-¸Ü[€ø#È0ðߺ,:%|ýíœêuœJ­:ûþT·†²“qðJ=m ojŸ¹›%HDàd¤àdøå¯Dà2#P[¼ºv•«†ÂÊ…jõºÄظƗð«I|¶²¾Ë’£‡h¿× ~®Óhã˜È¢ù$jþ ~ß’ÀQÌÀ ü¦0À¨ð­\dLõÅÙÆœúrÚKx–†,îà;„ˆ6¶v3ß¼‹l7¤³×0ý{d Ìÿoãó¯ÿ¿éî5;,Žsµÿýû§‡ åµâøÉ/®ï›áîÀë„cX € ‚ð-b’ï<2} :š)<9I±¶°ÌQ㯠Ãú=eΚ¹à÷-\B ñ÷ωi ðaÞíñ²Õö¸¨õy®Ô2À|¿ª¥}m¶ƒ]¬lß×Uèå„ø•'É¿‰@"$"€ Ú‚âb5*[ÓtÄ"¶¬•kàH[Æ5¬bQÜt5>ó ©áßÃ%§úŽæR,7Ñ´Ökß÷Ä5Jš]°™¢Ÿÿò½éâ6îZHtPNP³Íÿïчÿˆæÿ>>òŸùÿáÒfŒqc<„ßGš¡(a³øE„ +¼6w÷ î{œ¾ƒ¤`xÌk”‹ÝH)¨?ÿ¯ ì÷ÿþGé~ûl­;ßIüÙî Ð?Ò¾MGØÇñâÇìÚƒÌßiz#yþòæxñÖfÈøøêxþß>œ+~Éë1 /æÖŠ6<b¤è+”%HD !¤ !0æIDà2#àÒ4—§/F€kþm´†Ï"UØ„ˆb¼ÖÕ$í…?t‰š>¿.óÛøÝãb»î l¤sM‚[€ÄA{Ñ·"Ø’mBÓMt{-tuвaiP· :þ¹èƒ©"ÿ4µòÚEPÄ¡qô ¢nî·U“~©ù 5wœkB¯ùzŒhIkûR‹Iù.¤¼Ôà;nÚ7•(íÅ<ºW«}æ™Zÿ ê·D=uY¸‹ðBÍÿÌÿæþÔí»m³ò‡jûOÐj_vàê£ößXãý]àQòÿ¦|€€âÀç+ëáúÓÛ¹C¼D~XŸõ£MËýD H·@ oZþ¤‰8²°lâZfÕ.±¬Ž–è«w?"wC0|©I¼©ÌKâZ8¯—{+$Ëmlžßt¶o¦¿&°ÚfÕ×ñþp¦#¢êkBÜ ⣕ uCøÇú{ÙkÍçMÚ4@[g!c[uSk¬•‹2¨^eôŒÍü¯èq”Ø7!cD† ü§¥GiRÐ|[‰ÿ-«˜ú?^Ù*>‹Ày[Å*ÁôdUcúÅÎÉÚàù4ùÛp eüˆo?· »…µ€q $ÿè÷%Äߌ„ô?EPçõýüë%†!W®7¦þM¹ójŸVc•ëYît2Þõí¿ŽÖÁÎ4Ùî`Ý3J?te´¸1V{43†íSÞP^ð5­Îï!YD HÞ¼5tùÃD ¸´Y›º&U[Vÿï/'2b¡ÆÞÀ]søûÿ†`h_“·\r»çÂ^hh}#PlbÁïŸØá3 _<æ7Ï!(’5Ÿj†~k"‚é™&® M¢²ÕŠí"Â=ï!B?¿:éâ~¹µØ† ½(ŶT„Ñ}Hb/fþ?„¾79TüèÊHq!Àþàáûßä]ë8ŸyÛÅg³ËÅß#¤Rhe0À*Ý‹ñ}òN2=EÚÐþ_C+c°{d½|Kœ-êd]ÿá.9Ì«?<_)þîÑbdX—øÐ9§.ŠýTõU4âåóÖß½Ú§þ<ú¶œÍÝmE/–;×èÓ¿}oª¸åË­ñ!,z&ÂÊCaî>ºÆèòØ10ü‰W)F©ÕÉM½NõäN"$‰À[ €·-’$—Ú¢´CEþ•RKÁÊ諼²½‘ïµïRý#h½Döx‰0H $Çs˜‹\!Ëìê@˜.Gj@µ‹M!þH ë»ÖÝÔv=h<‡L¡õÞ†€u#ÌТ¡$=õÃ/ðNäO_p10CB™Œ•Ð <Ï|km´t‰–kÓ \ ³^×'ïJç€áøÔúkuÄæµô\Mú.óO7cq¬lmG̉Ǹ(Ì’Êï1Bµ'X„r——î'QB8ÇÞÑzWÓöÛªo%,µfþ}Äu@ñ_ õõCôë Zÿkÿë¤v4¦AÿŒåá˹ðjyé’¾9ZŸWÎ÷‰@"$oŒ@ Þ²üA"$/°¹€Þ‡¸u-kâK¸p• l@„–‰â½ˆ¦q+£ŠoBŒ+µhE^@Xìè¬øÀ 6PÞüÚÈêÝÃiÈ¢)õþìödq}l°c­µ‚D_¿÷룃Å_Ýž.&~øl©xŒ_v©×atžVÝ·]Ñ6ú‹ÕG74ÿó[“ÅUÈ¡Ö­BöÖ‰Žÿùì. ÓŒÏ]ÜÈ{Y«¿ã·ñä½EÁƒZÿò^£ÀMY$þ~np¿‡XÞ(˜øüùrñuÍÜÿÓò‡5éõÖyéà¿z]«:9guî×n=®º¼R^hõ<9XŒa¥ó©<ïà㯋ǬÁÀüçý‡ß?]Œ kïMWGÉHNp±8ü§m–CäJ’ƒ¾ 1Ò¯[bÔ):€à©sEÃZ­ußrE,iRšß.4Å€Ó,\ ]:Z¡µv©ó9ÿÑÂ)]û»°rú®tsù NðUøûƒ¡)ò‚¸ž±·co¨õ_ƒø?D(aj¿_ÜŸ/þñÑBÌ™Gd'ØÂ2@¯®Àòþvk‹:Ðoë4åîí,nÙ-ÿ'×Æ‹ŸÜK—É¡RÀSÊ Z£Ÿß‘üU"$Í@ š¿²†‰@"Ðt¸r®‘|6\ߥ  üÆeùe[æÊôOÖ´X­ÿ>dãPRÌŽ’ŽÚ§ß»1ˆ¥§YF¨pµǾn’G£ê+Ðô¸•ŠÕ5Ø~Ð’_cÜÂZBííâB“ V´¨µšõí]PkÍéÃúÁ6ÏÐæQ‚ãÐ9x+ô¡Í~o3Î#’þ:Út\8$Õ§]4–÷UÝWœYÆÛX mþA¤ÜTëoöß=^Œ ÷¹€€sr[A½’þšÞx“yãO¢xocüb‘3ŒG7Âœ©áÞËט“Ÿ\+&èפtaÛÇ8ïÂ' 5þ5ør“$‰À9#€s|"´"õ•pµ]È€Ä׈ەn+¶ê¤u¶íjþçÑد@f÷!¨$KÖ¢¯ï›£•A3,é„Fséî.ÁâÖ‹1ïÃgÜ q·Ñ¢w@*[© À’#Ó þ”`€½´ó.šÛ_o.‘—l¯•šõÝuu(À'{1Ç‚CŸðwÆŠ+£ýA";^ãþÝ'<ûoÕ°k:¿Š æîü:¯µb–ñĺò¡?¥j9}7Î#ÿ)tðàOÁÑß}ý¼øsÿgd%ø#þ´ÀÙ@·‰k‚sÓ@1¦¢~®c–êvWâxa«1Š™ÿ‡šû#Ìù«w¦Š÷§Fb>¾ÏÜT cœ …\ÚèhòŸ%HD 9H@sôCÖ"HZ ³Õª¸t €ø}5 å߶TÃN^Y^ñ„.X‚/ÉQi *GˆÀ‘Ýo½°LòÙ&ÀÎÖAѱPûj| †Ø·b1Mš„N+†q,¦Ð–.@&;móE,v#mëèÛ^_Ånú3Ò:6y›eEýìwy­ãî"ÉÞBðW…¸xi|7º=Qï7˜òCîÕêCðµXÄáAþî#”xŽKÂ#¬6ŒI`ýCŠ?ÇZñ£ú¯ãgÊ7|±_­ÿý7nW–›#ÅíñÁHï7…eG¯Qéëã^Î+eID 8Rp68çUDà‚" fM2àk_ ¶A€]@_²Õo¥Õ6×÷Ú]©áž×,’4þœ€àŠ­î_ήDÄø0¿¾51!1XMCÚ"c­ýîL¤i“1ô Ì·#šØààÕTPÐLjãé wÊŠóÆA@W˜á1ŠV+@IDATb b-ùŸ'àå$|M@ŒëÆ]êg;5þΟE„_¿~°P<_ÜÀ·—ˆþa ð%ZÿgD÷_eN;ƒêž¬Ä¬¼ 0‡ÖŒ`òoúÊI„U3ÌñfFpáè¿ÿ©Aˆ?ÇÙ_AO–D HæD ÍÙ/Y«D hvjë[å‘“·¦Áp„Í^ùÓ©Ÿän2`û—Fv‚tBjñCžƒ´.U:@ñSmzžd:ãñ`¼…àÓY¢œCtüý_½wszü’{¾Óiþ[U¢d:´wbH¤aÐ ‰Bµ+×+ËEÐW iŒ{p‡ñ×1ý·ÍŽ›V Œ’|Ý|¶Ñ¾ëS/ùN?í`™rªS¾6G¤ô ¨ýòÁ<„¼£xáÿãÂZÅvHDIF;¿‰ySCnjç9òÉëwkÄ¿4w(Öß«ÕFOq _ÿŽ¹¿Úþ«øø<3V³â0õ_™ÂÑþÌ’$‰@"м¤ yû&k–$-€€kå=þ¨4p[iþúÀ¨}c«(‰Ó4¸b2††P_à^/&ްКB^Ôr‹U‰WU‡iø.îàw\Ãx+œ§»s;œ­b] v²íd{»Wj­bð»AKbrl*µ´Ìk8¶¡…F·*±¢¯­zVƒj’é'SÃ)èF@Ô2†âÎuæ¹}#éW ÐOR^/§=ø¸Ö6ןÃÌcëFË[{ 0ülªºø›Ö¥öÛò§ ¦Ú‹‰nâTÐoWFz‹k£ÅÖ=·$ÿhÿ'zÉ^Qúúà¯!Äÿ”¥)UÙÜID h)hyš&A Zü4Iu²#‹T2ÜãL ­IAPW€2?÷›®À[/M¹!u}Ùˆÿ$da­äWs+ÅgÏ‹§'ûOwçÂ?Y êê&ÑîUsË8^“ìÎŒó›‹4ï>ÏÌg>‘üjv¹ØÅ${‚bf€VÐ&íi#¤Oâ7m*À&78RL`í˹õâ!ÞT–þðU\Žž¬™öÔ³í°©áô¿56XÜÆâAWÛüÆDõœÚh?l9nªÏØÝ!ÅåÞ®i.4ô4žAÕm„ûŠ$ ˜?1¯$Üšúïrÿ‰AñéçØ ¾‰XuΪ궡¶¯Šqn0—þ9iü¦{Š÷æ}„¶ßÀ•Ó1VþßÂ>ç[uºo^è ?‰Y‘ªbÖ‹O×7¬Z~™¨ÆãeÆ Û~‘HÀEêÍlK"œ9®KÕdkPiµ_ÒžyÎ÷‚sSØÕÞEðöÐL* Ù‡¤ü3L÷×!0òýÈT¤Og}$×Eÿw’–’fˆ¯Î$?@3ú0Dr‚ÉW-C(«ž’Èé;-“`é_½…öÿqÇæ âÓ’ëÏZ¥éSöwµ£ýÇ€\ñjŽ Ø Áÿª~rxJöCÐÇØ s{‰óQ@ýàSÚ©Ýg–·_ ˆC…CKmóóÈã^üÜwñsmgâéïßKߌ#\»‰™ÿ ‚š÷ˆçñ¾q*ø\k•NýüýW]/ÎÒ€?GëUßw§Ñj@]ó‰@"´()hÑŽËj'‰@s `tû-p[Ø¥1@;­ à2 b©3(ƒóžâöÁPX¬ÁøßE«ýœ(åw ä§%À3¢ùP-Èûë˜ÉkºúÒ%ïZÇû1Úø)¯¶&YP‹ªàd€&Öî? Å\,›ÔªÅºÓ±½X\…H^E«J5ç55ì!H yï{:ñuGÛ­ ÿ¯—7Š§¼Lo¶´¹]<#ºù“µíÐ诒ôȱâ ;ß®‚ý×üÎ\ì³  v†@ •ÌËË–•ioŒ ÿËY\ïOÁcW)Sø*Ó+?nº¿öýdÇõâû¯?ù‚É]Á¼\Új¥œê¥«‚§Cç¸}Ò´M9R1+ › Ú~Hýµ¡|ü{Š?ÃÄ߈þÏü`z$üûÇpÑ"ˆ§}¤+J–D H‹…@ .VfkDà,xuMÌâZŸt£ÿïÕÒƒ¹ÞÎò2òA͉1Òï#½˜>û)ÉÆM\îίók[ø‡·Gú»9¢­+P”lŸß×aådî›RðÇíCTtØFÓÝAP½CL¼` ««EÄl‡ñd6_jgi㮃ªµšõmCÛßÝiê¿žHgœƒö%–Z÷˜®ñE¦GaswJ•@BÈ»dø_¨á7ÃOÜžÀçaÜ-Üs Ôéq•™s·¬…&wV5H&B MÔY•D hA‚”±L†ì£ smL¶#`ósƒs\RÜœ?PÁ|§9õÞÁ AÇ&Š‚*0®‘jí)–›šÁC¼¶´¶\ý#æ¤a„ôoîtk4¾€ZË~, ŒÐjE«5¯fP#Ïú |°Ûpix°¼Yø="¾G£š˜šÕæ„5”P*Бô+èäÕ‹Hô«uõe¸…‹±&šªXzñ©™$^a˜n%ý`>ÃxÒ¬ÿ&®7LŽ/¬L¦ ÿøts\+Zf4U?deD hRДULfF€U7ëm9äm{3ÚÎ2 ]3W»Iê&á˜@)Ù½ ¹3=±¾&CÀ—¼ž¬lÿá«gÅS,ôõŸÝÝÆʂʇšï „+[‡ˆÚŠyŽÑ@íìH_o™… IÚyÜj(0Òú×ßÄ¥dÒÖ^üñùrC"ü{sÿz;™vÑ(„s‹†kÃýhû‹IúZ+c´ZqŽcbAß[“”„›m3õ õTRÑŽêb?‚É Ìüÿ«÷®WÔô£ñÿàÊh¤aÔÇ?´þt‡±:²$‰@"\|Rpñû8[˜$§Š«ms×Ã4ÕÖ<8²3p%ÞLÌàTxë“G1Ôõ]hŠÕBi}‹ xn5×?™,‹ ÙÆçûZÀ|ýL¦€·‰Á°‰ÀvVñå[×é<èˆÑŠa7‰qÈó°Ö ÄO(Ë‘1e›U•ø«}¶‘^N«†n‚†–¹E§…ÍÒºç\ÇW5ÜÆ}¦&õŠ±ÃŸ˜KŒ™1jú5ù¿A?·FöŸaN)hrmjå&HK‚@ .IGg3Dà”p®64€Ðuè†ÑèµÎòFh²ÜaloÃG¥šâH‹ZÌe´ÿOÐîAÊ?-¾XX//„¦dÛ&ÁçØÍïåFoT‘ÿŸ½÷|’$IÏ;½DjQZ´œžž™Vö‚ ˜ÑŒßÎìþس3’vFŽ¸#ˆÅî‹ÙQ­»´N-ªò~GFvVuuuuUŠÈÌ×»£"RE¸?îáá¯zÞ|YBòJ>é-Îûp$akŸ®ÍÂgêwe4ôÁ_J‹E<ár~fùŒRÿÍŠXn3ÃI‚ÿ™x)üð ³}¨ÁÃÐhp]]ZZ .¯”›æ× ùÓ%îÂ->Å£æ>éxïSHþdñW(F‚{DY¢G”é¤Fµ7vV CÀ0zŠ€)z §Ì0&„ý–\ƒ±X—QÈJ-€–°Ã Fµ„•„Cy"‹`Ë¥<*P!ÎÿÅ~Á-!Èl*®¾Gͦ›B«C¼(oì‚ò> ¥6Sª¶Q.ÎÔ~ u/N*..@EÆX+ @ªõ_#ü§§[n¡_Âÿý™Æ@çè ×)"û”§¶7Bê€ïòîËIø§.RžÍÄ>2M˜EÂýìÞÖþ$œ‹îÓ¶»>•ðnþèF¤BŒÕ?ݾ~Ù7 CÀ0ÞFÀocbïŒ2Z/X1ãNëp çH]1ºžýš3GÏ€ùk¦âã°ú§xÿXé`.G@H@t&Ëÿ)²ú#ÐFSpl/a.¥VœKxAñ|€æ€Ô‡Í }ƒÌ=ÿÁc‹€ !/Ž9¬ÎjƒwýÿàóDèºÏ©þ>Á?½ðã¬]Çîã^U[Ãן·}òPéþ)ø!æpåWÿ2#9ÆÉC¼f¯ä<÷‚ØýsÜ/ú\á5#—}AÍÖ¦˜6Y1‹€½ÁâmWë;¦è;Äv"0škýBdë1í…\ƒ«¸þÃB?p*+·G@.Íô“q¥„ɜЀjãÌýôÁ’;D Þ8,ºß<Ý! @ÓÍ{)aÎ:®ò£:%H’%ö_Œù÷ó÷s\¹âDŽø-)›Òpà%à£ÛÃÜÛ3ˆëÿ4§\Ï,æ|ܹ4£Ú!@º«ñÁðJ/êþéúÕ8W˜†ÅÏ9Xü#wˆéÿñJ&ÿ„ûåÃwo™%x#¢(K¡|Ñ=#wñgŒ´ð¯¶wABa{C` ØØÌv‘Á!` €ÁamWmal—²k€bÒµyá‹_°×7B )CàÁÚ)XV~q,’q!‚`ç¨ìÓÿÅå:/ÁhÖkj7b›ä‰Û.¥ênÇ sÀÎuáþFÈöóG€Ïh€šB£~y)Å‹t/Ú:%<÷zq “vf^Ê…_Ö|¥WÉß:–ÿuÃîÿÑRÎÇø¯@ò§p y týºü9B\Ãýàk`WœtlìMú»ö›`ìºÔdÃ@@AXô%‘¶…Ñ_}Í˯éþHÈO¡•üÎœs?Ç æ*xH{Z=/?Ó½K{eɽ‹çƒ¤ÎM”#]$裠™’Šà¯óYÂEN¤k~½ÊIš@Ðr (ƒ~²>ïù0>ÆÒÿ3n‚ÐÓB{)É¢Iðw=xí[†€!`ýEÀýÅ×În‚€¢‚+Xþå–¾…ô¯ã%_ŠQ^Ü.ï.d<)[à}qæ‰Îô™”/’Ó¢./¿ ))3ÄmEàûËnÁîén¡mIšú®ê¾Š¸²9ˆÃ€º‹Ðq:ŸîqT;£Ýê@ö8Þ D/?éÌ’ÿÿø£;ÞâÿðŠ/PHI#Åbà5‚—@äµD½ÄÈÎe†€!ð!˜àCв!p,Ì%4!Ÿ H!¢“€ÿ7.¸—µyÈïy×fp—€ìKêSkLs|ê…Ÿq€f±¤çR1ÒK6]Rdz¼ž&Æä¬K6¾ªãBB}3‹  Ø  ãXïzQ Âm0mWÅÿ·¡†"ô“—Ë Š€Eöy”,Â׊!`†€!pLp”ì;†€!`\…‹ò[€Xé²5OJW‡¬£­ØÚë÷«ÎbŸÝBÒJXRxÀX`N#‚€ BÞŒ[!Ö;‡›÷^&eÆW‡k" õ:Tú`I–¬þŠQÏ¥cxļR Õ¼Õ0£òi€-iëV”rÅJVÿõ|ÚÝ…í_Š€qRvݪoìdž€!`×BÀׂɾd†À;hËZ£+g} +m¹~êE 8#r+A@BÿôÌ@.5°‹hxÉÃAéÝŒ'ÅÒ'ˆ«7g\UÙ¤ ,úÞ†3Þg©OeE–0 …-$ggƒtôÏHª/µ’÷dB[tI¹øËÚŸaäØïo¶ÿ‘UVyCÀ0Ž€)¹]°¿˜°Õ_|íì—#Œ»!EÈèÊlu„3ñøÜçJG\ö¹¼Ýöî ˜Bè“Û·Rºå XÃõ[ï*é&O[ÊJO™’8äùOÊ.þÏ"©f‰IÏ¡¨HƦ½Œ÷ÌP=Ç èVÆç§}O‡˜ëÝðøìþê{ç}™/±ó륎'bRi·ÝCªc+†€!`·EÀ·EÐ~1Þ»’ŠX}­:£‹R„/å/‘À‘šî°^Ç …¶Åι¤ òp~[­Ã@@Œî™ä,a&-w—ôn²œs(ö+®rÖdü1ïy3ð0ç?/‘º)$Ô ‹U\Ó×U˜KÄ]r:ÔV Û 0ƒ°¨<ïñÐhJ"`kïÅ¢ö8¼Íùoý[I§l1„~e-Èã$@ ãRŽAópúéj”°¿ Yú½äÎoCÂÿGù¤»ŸKzm‚†ê( «M·Q¬º&–}š€ÓyUÂ}ðj¼ÿª­Û«×]7Ö:CÀ0ú‹€)ú‹¯}Ð\\4 úúv½ E X™žÂpÆV…½TkºRµ ÚLÇj7¡àX³{€€Èç¤LRÊ·»s?¾ÞJý…ùAWé2ðdñRP}F†1ÞÔÉäbÝ÷J ðÆ+·üv ÿðXo…ý*ôeúPžJá÷éJÎÿEa%ÀÔTÕíxß»¨`è>oûrc¿~!†jl÷ñØ7Þh†@ÿ0@ÿ°µ3†À¤!À‡wŠ5¯J&€R½érê=+†ÀmЙ@¡”Ç£DÙfä ’‰ˆ/ Èqê%âB…ŒS‘r\*“wßê(Cþ %`L¤YÎ&½bä‹Õ9÷ÅZÞÕIJ_rGx %gëþ ûãžµÅ0 C ˜ Ý`•0 ±@@®»lzÃ+nç$ás¸‹ÀŠ!p[dIŸK%Üýù–;»$›=’¶ƒh‚³ËͼÛr|Û Þä÷HÅ>…2Haá­å79W£0 Åî£Û \¢Ðàowþp(ˆˆ—°ø?\ȸ¿|¼æ•ãx´”sûXüÿËW/Üóý‚;*ÕHÊ9ù'R¸äô„Īd†€!0b˜`Ä:̪kG!L¹Ù«Jˆ€ÒJ.³bÜ Ò²¬§ú•PÌú³¸Øk|I ‘"DŒzjSÞúq‘cÕYôåàÿ]lýà³ð¾öð5zž†<6V² ·Ž"àãÅŒ[!öÿÞ|Æ­Ï¥ýùD쨾|ƒ•MÊV CÀ0ÆSŒe·Z£ C`˜4°Wëî \s«¤œ¬T]ÃD~¼¯-¡3†é9 €¬ëk™¸;€ð÷ñCN§-YŸÅPwQ2 .~úãXþƒÞf}zÙt5…jŸ¼1S¿´/Ø[ž£Á»û£øX†ñc,þ9_›swàmXFð¼2çßS‡øý9ùµ´8^î÷.Ô:|¯{_øêX½ ÛîǪqÖCÀ0††€)†ýåžÁ `å6ØBá6èÙoo‹@0þJøÏ*î–> ¸-®ö{! ™S.õrA_P(ñä%ÆÙ&è {¥¡lK‘ÃÌ3â9/Ø*CAËö,Ï4‰ÊãRäÝ ·~Olè%v0—€ÿz|çâ?ç+y÷·Ÿ¬aùOºß]t÷²¾ï2¤p”à¯ß{%‚ÿ9^Cô¶€/„7mÀ¸ÀöíÛ®½ŠöAák½gÅ0F qz Œô—W×—ã2´wFsh· †@O &VïR­A(@3XØ·×±öì Ä{  -„G¹×g ˜ƒiÿ88¥GBF¢~RTÌP¿Y¶ÀR>>Ý¥ôjŸç6ä^gQtdQ̤é{Xýó(gßåŸbÿ—PÈâ/Å<#øù¹òa¢í‡}ûÜ…ì…!`C@€Ð©‹ÓÞja—ìFÀÝhDà7@{ºG ¬ †Àð’Á”«q+—žyŠ5W @ àˆdý³bÜ)å‘—°)S'*dœˆ¹?î:Ó›^àV¿cló_iîlILâªë¸µD yÌL#ÈãåKÄݧÄõÿérÞ­æ“îVÜ ±þ þwéyB(cƒ¼!4=ŒýëUåVV C`<0Ù&zýh €ˆõI³Ù4@ÄúĪc|SÞ忈P–„©½„€8ŸØþleûaxÚ·»ð£‡?²&ç>ç±6gb±¶¥=ÅÉKÑ%Æ| Ìã4′ äh[ýW²)'Vÿ»úýøÞ‚[˧]Ï yqþã…A÷xìËñ8 ˜¾d'5Fh<œF¶þUØýÃöFgFK*çµÀ~dL8,^@p‚à?S›v'„È@Yd…´ÝŠ!pkd…žƒ°XCœõ‚æðͦmÉM‚? ªˆ€¦Ž‰@'ï‹$Bwþ;ói÷—­‚Ý}ŽõÿÇëswÿ  †±þ·îì :¤eQ1âÔ êtkêØ#ÀÜi+Ÿˆõ²)"Ö!V["À­S,š¢… ?6)¶*5W<;u›¥ª;‚¥]ìàJõG0襪˜]fÜP:À5\ΧðùÿaOŒò¬¯üøbKEH‘У>ïӪטYÿ•}Á¹”˧cXü3^P]Í¥¼B@í u…¾oåú¿suHT›l>¹Âõnß4z€ÝÃ=ÁÔŒ›=±§'1@Oá¼ýÉÎ(·?ËäžaÑ››±°Î•‚µèyëSø^$ز&·ŸÆ½å¢òhp'W›g®Æ&"@íOíö÷®XûdNÌÎúØò8{/h}±*·8"P—¡W§Ç½¡ö®ÿò䉹Ù))ó¦Ü|6Ž7FàîßãKNÌ餯׼©9²¯…2©„ÿÎ?Ä'kè@èRÒ…‡íu¢¤|{M9v“Ù@°}sóxƒETŽL•žh×ãôô4b5­êüWXÍ݇H_ßãr}vÑÖÚNSu®U¥À¹wí…!ps4¦øÏZS®‚õç¸ I)Âp ¸„7+†ÀmP€¹tÂ[I³äœŸŽ“ƒ®Žµ]cÏ{? sŒ¿ÆyP‹aÖå6(Ÿÿ­,ú)øbžt!UEÌþ y¸qñ}ÖþuxîÓv¿Öñ¹û×›§>Têt–'·ƒçTM.òÖ|9fm£î½¦\¼UýëðM9—pw™c×ãÊd¤6½†F§Ææ¾kb €‰ˆìgffì1w‹¾XL°0A­ËøSæ\§aavå@½Â+Þ³Å-€¶Ÿ¾øµïK‡ßïKë†sR=³eõ¯1?™/÷J5wPn¸†(‘Æ'‚d8àÚU¯DÀëí¼À¯¡&…¥ˆK[.Á>Ï|:bUS«…ó\ £}8‚˜ bÖh4Æðñ>8ÿãçë^P„}½À&ìÃJÃÕX\œ°°ØÒ1«=^ï_lá-gƒ«¯]iLðãc­Ž7ÊQ€xÌ/p‡nœí3äÝ·ÐåÏ>·rø§×ÂU‚¨g¢'Å\žñUŠ5]ù ÁIÐP`BUÕï~!͵ƒ%õ*ÑÇK¾×ýYKü—A*Ë&ÂÃ…Ïîr£!'ªvëC,úØ©vê1E }vݪÒ)I…·Ä$º†€Ÿ`¿HÖŽyOÞ‰gž¤ ¤þ©Vó¼7#E<Vn…@WÜê<öã!` €Ù«Ó`Õ¹L,íÕéÇþ<ÿû_ÿØ3EÀ†ÐU®ÖÝËc¿¨ØÅ­ðûÝ‚WÌòYÁ¬î×Ý ¬öeÉÆ~¬ô¿ò;‘â©æžì\…ðž?½·8¶Ëùð.jÃ+o ¨±Ž¥´ÿhOÚDú—& ` érÎ?È&Ý ŠÍM¬¨‡dðŠ\XRÂÎ×EÛS¨¸ÿäÿFXHMFô"ð⦦t€ Ú%|Ã-xgäÿª…ʲM˜Ôn¡ê6Ø¿æY}RG‘%׀Π±ù&[úŽ@—¬Ù™ß¼—gL%¨Ã½Ä´û4ŸÀ“jÖÝ#«ÇŬË&ÉðÁ>M¨^ ¥j.üÊ<¶Ïô½Öc~»#ÖÁ¦ˆF‡tnŒfSþ›VnŠÀù—%|(&SÄXI4¸e¬ ÉxS¶\ …@¯¦sxÈ ‚µL³"‚Ku@!\ÅvWį¨»ß°cCàj< BYhÙ’›«Þƒ&í²võÉFàSÝ;MÚ¨vÊý[÷•\'u¿)'<ÿ­ôA©…©¸°ÏgP¶¤ÙbY1D¬uéq´ü÷¨ëì48Eá^ây¬yR)S P—ùŸñmÅx/,šÿ(’ýeåŸåó$[–¹RÇ)Þ#ZÔ- ø¯£È°N\!£Êr>EJÕ¸[œK³OøЪ,<+3ü.‰2ÀŠ!0N˜ b½‰ b5­êh’–œ.똎ͤÓ^Ç o€/”]ãÃBe@ƒEGÃížT]™÷vd}(ÕQœ¹§5ˆ½ vIûýÃ¥ý„¹äc{Ë„/¸'X¿–ñ4Ùdl!»Æ`•{<ÑBPCX·å­„ÿWEHK4Á4Æ‚‹ÅÓ"V”¥lŠcc¨]\¯Ùˆ¹ )„i¥ær&ÎÜÖt»Ç½Q2iŠÒ6ÈA¦kµ7õñõ3ÂËôí$ý„1Z©Ÿº£’Û:®¸CøRx:h< rOð#ÞÖîqÑ}L³² ™9ÞË17~ļ˜c~œ'}çZ.MÖŽy/‹k À®ý2¥ü³©¤‹qœ%£‡žÏ³„$ ýÔ&%€•›#†àÍáëË/MÐXo~R ¸9vúe¢­¥ öÁ"xu1Ø×¼ªü ¹Èž”¼7À ‹W„`jÏÀö*Ò¶‹‘=¬ÇðµÉ‚4iU­õˆ_]‡ŸÙÞ¸„ Ÿ"ãí%.­ ŽgU,\Sñ ØX G4¶Á}ó|÷Ä}ùzßïÒXVGùéÚ¼Ë@T'ÅÇ4JyX¹BP -“\XPgîzÆÂÕ¼ÛþÖ¿ö!TÒºúÖPŽõ äUAqõò°è^£8rÿgµb\‰@8Áø}0^¼á}íþ²¤¬`ݸ2çý•ùŒ›#dJF¢9³xPÍÊ{JJyÍYúçOî5ÙX¼²Þó¡ex@CøØC½ë’’Îó8Ç¿'épòî>A0±+.y7e4½šðÑêÊÚ0û¡× ÷UF@û¨XcQrÆvŠBvbÂöªMBÄÐrÛ§¸7wŸ\Ǧ¸ˆˆ½YŵÀ-1®4¶´É-> qÛ¸1 +¼¡×ÚØ`¿_¬Šxx+ J€…4 /¬,Þuý¸a0èA¯eé,Òvšñ”ÆÒ“Õ}Е¸p½°îDžjÙˈ! ô§úU”¤G(Gàæ)ñÌ•R`èƒ8bXMlu.¼Eà7‡=F>tk‰E<îÓ ÝæQú­_§!ñiA¯ÞMî›ß¿Ü÷!7÷ Uº¿œw+¹¤ûŃe·Êl™ã‡¼ç¾”+{¨¼‹R›F¡.Â-À*q«u°—`x. IýÔÉs?°7%À(Œ¢Á×QI…ãi®Øã9û5žxÏ ÚDixªQcgð¥+v<Æ5´ž „þ®°Ôºƒ'3;å>YHó½?¬RŸš3ú§5@ÄúЃéÿxóÇk¦§ƒs²¤%Oq1L¥@“‡KÆ+Ê3ûÊrqXj¸c¼ÊÄÞ¾Æ; ˆw€Âž{þ€ö|×™ö:ƒi¤]%2(«¤BMQ$mÃáЀq+º¥äÚ/å¨o±x­iÅÚ^©æ•!ÿ ?À ¼îeðŒ¨y2¦;X¯ç¿IòÝo³ÜƒV®‡€,WÂ<ËÂW< ¹Ð{àzç¸Õ·4­…S[Ømë‡oÜê “óãËÏ1n9XWàÙyÄpÀ³S©¶ÏPÍA ÷c Ĥ7­Ó×m 9æÿ;ÌcI”™ËÐõ¯"ÜëÙ°yŸ<œÄ+3O\¿ÂÊö•ª/tíWö§ýdå!ü˵_ŠHS.Oú`³öw#` €n4"pl €áu‚'‚áAÑÂM,E Ech“µR–Š ‹y”Y´œñhº-\wÉ[|„p߈ËÅ–‡ÌÙÙ©«Æ!:à @%ÁƒJŠ…TÃ-áæ½Xq5V2e¬ ¨r|©`“ÅL‰­òÖ¢æ­7†„]¹/H ·ø#¹¹"7z/tØîËE|R‰}²Þ+®?¦ØJ} ¸|j/n— ÷Œej{†ûF\¸n¦•¶¡@±œõø©·îè<þ~ìœkÀ ‘ˉCA–mÓ,ž}ø¬RQŸ©h×>ô¯í!" gj…{_™Q¤¸ªëù(ë?cÙßôám?tÏÁZgQsEšýJK‘—¦˜»’l"ô[ÅŸÂÚ¿_ÌÚ|ÚeP, 4Îñ|rYVYûEâ§PÍPð°Æµ ݃`\Û8Rí2@ĺ˲D¬CÚÕÑÃ%p% RÅ$xèœ!À­À*+%€Bþ—R…E Ypi<Æ’Q!æykçI%ps|rXöñÛX‚Ÿ°ÐáçoVÇÝòh¹ó×îþ šØX­Þ‡}ˆDÖdÁû‹ $ps3.p'n;ÁbG)Æ¡Hð Ü3.‡¦ç܆Cb ¬Ò~ €g û÷Ìs8vNn„ß<ßõ‹½ßYðîsî–±ÛËÍS!VÞF@˜+¤D2mŠ{x¾ˆ@~Ö*÷à°ÿu±a\·ÿ-ëß„W¸…Wic¾|ëóÎ#w Ž…нÂò¯”¡Ow dP°PX.¶=|ßöÑG =Ùhbò…}xØ~½È막ÕGÀ_FпOx¥ˆL— î›#¦_ÏÍe²îû°0æ ú¡§¦Œ1ÓcBÞ"À’õV±¾6êE÷‰¬ÐZ̉@|jWKJŽÃ¢q®›` òô¤ê¿{?Ÿ„+ êVøÿŒÏ•ÆiŽ¢&>Ž“³uÖ•þ—öGÈëBÄ’Z8{.)[4‘L1êv_ËÅ ýlýtSÐ…g7¦áqxÿ\üü¦×ÎïÂкaQ{̃O÷Šnƒ0:½Ú¶s8õ³«ö© åé¥-F—ê ÷°Õ»9–’³n‘ô|«>L ?Çx‚-A+«þâ\@â'Åo.&G“pt˜[oúÉÎ2¹˜ b}o!ëwT'|øø‡u¼¶zfúŒð€¸ÿU*ÑðO«•¹º[_¬¹bÙäî,Ò£a€öñ¨â pŒKø&ïÕÐÿì'P<ç Ó…‹ÀwTÈÞŽ0Áª¥ÅÒE}=‹gH> ƒ9=Z×(„$SnÈ{«¦ûAé–$¸Çah– üÙkLë í"/€p˜+%çot È5X­”d Ä|Ê[ u;C˜@…€˜îE|'åɤ! œ…‡<b¸Ð&ؤ`¸1shîŒñzgÀ<Ï€σæl‘ø¥ãÓÞ3,É{KþúeÝ_†ÖsÇ0×®ýYPÖ~Rö1¿Ãóq{Öª<Ƙ ZkR^´úãÚµ™F ÑÌÅZÞ;`.—ö©Ðî¯I!@ª@Oˆõ‹ïáIÙ‡ ‰¹{ìŠx (7|KHÏ›(JÃ]{A$I)”–Âýµkg_*êB6yz(ÞµTr›GeÜßOø@Œ×yOš7²¬¬4îƒâ4ó,ìff¹'äŽÞ¿Ý |Ž;Ö⿉fÝýnãÀ øÿ¼uäRXþ׈õüw—ÝÜC?‚ê§÷—puŸÅ3 é-ÞCíÛ(\Ì%ø+€2(¬$Ÿ$¬<‹Ì'â_ð¥½Hïk•u u1{…Àÿ#øÛ×ëÚÉG Å*ÏÂ]B¡6!ýû Þ=AáG†i'Lh$š3™•ìžG<Ùˆîyuñûü]¤Óhgcn-KÜ>ÂÿÇ«y/èÏãÙµ:Ÿói–óÌç),ûRKØ×JŠÌÎ)aß{éÔšGº¯9™¨C«õd°!L¡ÎPU 9…[5üš× 3zp¯½\MHnЈ+T@E1ßrm«` IÆëÄB€•SéÒ~ÓœH®ˆ[¤¸´/{kžs'—ŽKß<_{5tN½• ý|‚ÕKü5klË"Ò±€cûªv†‹¹î涇¯¬ƒÊ.(Ž¹¦Á§ŽpðkÑ)÷€<%î/ÚÄËFÖ!}χPpÓ…‹ÄîÓŽ<ž×l€ ï0Ë,[}úth#*ìíÃãk6ž6Æh« Oy”yþÉ»§Á½îç@0ëý·ï^Tº~ O3éä5Çó:Ë\¬Ì.IÖ@ö²ú¯#ü¯äâ¤wÅÂ[¿˜ûçú8V,¿O݇@1üz^‚~ÄšoÕé%í§|/Oiçº ¦¸ z}ø-ZP»Iú€ë0O©›r \š%øOåyHòP\ÈŸú87yËU÷ \!E&xÀ¾Â©€5T9ãËJÇ~ 2®Ò/ê-WðcW«.¾îúÈ#‚@ûÎÖBWYžï`Æ?õiðNWZX½ƒ…UDj{£jÈÖ«q.À,[ËNžÅ^…G èhŸöâº2T ´Ú4ÁÕb¼Ûð-Þ;xÉ(<`š<‹É­Í¹UX¡µÀ¼‹R Á½¥ÐÏÕq£Ú楳e‰s$ƒÀ"¸+õäÉT=ð¾èà;šm´ZzLð\{‚Õã¨ä UwÆÜÐBñçUEç…ñhöè¶â¼§î(ĈýóÌ]ö1ï®Þ¨99ͼ³ˆ²V}/°,ÖÍIùLʯ}„p¥y.ÌHIÙæ+ YùG&«¹!0Š˜ b½fY"Ö!=ªŽ¬sÓb¡øP :¬y$ zFd,!Š‹”`ï¨è*X‡p“|±sìÓ|_iÔN°”ìŸb=i{tªwÖõôÔ‰­D Ó}Ú«§($?^žó}ÛBIZ±£Yù÷×J‹8YéÏZb¤—vz˜žÏ»µ–âZ›~¨v×îÓêŠ_÷…{Áà¤zæ~_>òok9÷j߇üíÇ«îBî/’#š÷¥tH²¨ô¬ÐÝ眀cïÁ¢[ ï,̳8WØ‘wFÒt -„uð°&F=ëõϵ×(Q´Ppû" ¨ Òhtœ—Æ™0:!ZAµR¼%«†9z=wR̽q÷ÿE,ûJѧÌHš‡Ó(feèÐÜ#]Ÿ¢¤ öÏ8ΣéhÔŸwÑè,«…!p3Lp3Üúö«z󮕱D |Øšn=þ‚¸C) æЖˊ*K¦\&å Võ» iÏÿ§¥ºO¡TdátÂVE¸ÚÂUZáТ ÖûáùÛW9ÿÒ^ ¿âá²Üá5,ÛûX¶g!I:!{„B´P’µÄ³¾v=¹¢Æ¸éãòxñÂ(‚9VŸ3húõ¯Óž ¥3àJ¯3…K @èž‘!]Aðñ ˆp^e +|šëz,ùΛ»íú—µoJ|ša/­¸”Ž¾RÛ$ à<ÂÚƒÞ·`|úL-‘»Ž[ÞO;x¹í ü—dý·a9Äñú6øóÌßIÞžC!³‚bU!‰6)råæ?s¿æͳ«÷IØ_™Ïx—~)hóp¶(Ü1‰b@iüËï3¸ Ÿ!¶Õ.=dÞlC®Ð¤_Þ333Ý+€ˆÕΪÓ¼ÐD „ÿÀE.î‰/þ©H¼" yì{–ô†Ûc¿ ™œ\*¿Ý9qû# )d Ü=Š$A]|ÝiH÷7í _ÐÇZðBðð%XôÝïÝní‹XOÉ},ÁyT‹žðq¬=rñ\@(ˆ‹¾\|Yý»Òû‰í1•íã®{¹€¤¯aÜà2(ƒÆß?Ù†pë€Û?<Û& î~zwÑýhuÎ-B6õéÚ‚'Æ“bEÛ8¯è#¥` à"‹óÙ&¤ yS®ù›/àQxníuÑðõžfâ¿~®Ãºp ñÔ>ÜF,=ÃNˆù/2&Ÿœ¸_½Úó©ÿvÉàS„jÌø¦‡í¶^M»Æ˜æÅ.ÁcZÃk­éIÿD~º‹2p‡gV™Õ§þ×›2ìʈíµðŸež^ÔÜÈœ8 þ ^Ç8^#l+Ïšb™”|+y¥êÃÒÐ/+¿â÷—æ³°÷ãàãù!ñcŽ ûÕ‰lÁÿˆµØªc0ÀED†üÚH‡Ü¸<ÏaŠÿãkÃó5 ä W­9H<än·„ ž<î/åQ4°úÕÝa©†Kù©Û/Ö¼p)–åW…š8Á]z³rÙiª:¯ì Ÿ„Ý æ-¬âM„Ø#Üa_Éq†å:å’¸Mvu?kÓ×sK°Œ;¨”UÛx8°¶|cî–s®U‹· ¡B@)æë¢ö_o»Rý öé¤gŸÇ¾DÖ}žéiÒã%Ãô¥&]$½J@GnÝ6öq­»G+s>–}”íÔ~É"3MÌèÃÅŒ·Do@lé6½P6µ²¡»<]¶QpMOÕ|ÖŒÄÌ.áq÷¯Êþóõ÷çVÝ" ÜV°Œ³ˆÕ)‚åðø 5µ‡–ùø\yA¤ð†€¼$Â[½o­½xÜ=TŸ°«Æì¾ɉ…åE<ûy½œ[!;?¦öb¿àž²?A9]·ÆgüðšÁTb’/á'»–Ÿrà½Àx9ò'wæ|Š¾¦wp÷—kÿªŸjY¨”,V¤1û)XSre™î½¢I¦Æ·J‹bé©®sž+£Iv€¸{¥Ì¸ ËkF3¬Bĵ ¬âTÇe!«õ¸B„öÆßz`þǃ[C>+=R¦&P…©í+> @ƒûTïš+·+ï; ††_nþKÌ{ëéY·– Hü–qïŸÃ¨°KûÔ|"ñƒ¿¥)ˆüÂðDÍ-V C`|0@ÄúÒ<"Ö!#P= ÅÐBÐW\^Aò ÿÎʼk"P*Dà„˜K¹\³?FØTÌù3¥d¿uRuÍÝ¢{CóØ™ž¢ÖE=«)þÃØà^T\ëõ«‚ÿ¿ùD9î!XÂÅR,ö£ìV)ÅÓRô¥ðøËK\MËô‡R†™/Þ˜ˆoÙQÝVDXËŒÿW‡%· ¶û„X(ï¸\[rwÁ­‘®jR«á ×Wå«Vœë8¬o5^¤Ø¢Cch\·öó! ù^Jhe8Ù!èËÍ÷‡ÍCÈÿ*ðÓð¬Ñ=kRå`zF8ƒ÷2ŠÏŸ¬dÜŸ¬åÝY…þìG÷Ý21ýréWzb­%t,"oíçõ(?ƒ®]ÅML±~‹Åb½7‘E¬VÞ" ´´õ* O9b(²´kˆ|‰i…pŒ¦€"@Ê#”Š=OpÈÚù?nÞ§‹Èý‘´I¿‰p%La5‹€¬Œe6ÜI=)däê~Í É ­¸Ré<”:ÆàœAÉá3È ¯¢…i/J÷y8¥<¶Û:û+¿ß+ºyðUòûX¼¯äÝ2äÿMñå†ÐÊ€ðdX(eªXÆY ‹p—Ù&ïI#ÑmÅ7Õ9´F‹•~ëºø(”£Þ þýnU7h:ØäPa?…ìÅK«ÿ½ D…ä½Ö×÷PHHQ~ky`ÄØDX|!âEmç…U÷à¾x¥­zc…·Ž·ðkþ*¡ÌÜåžÚ'äL™šÜX^­Ü/ÅßX!Ù‹Æ“ S‚[@š`NPx8ƒä8*óZ/°s `0½VS„HØÞ˜ ¤ðÖeHçî-e¼À°Oj¦ÖY/ i%g¥ÏHålEÈßíAÌHÌlÁôç(´p“%wÝÑCàTwïýüÁ2‡ ÷¯Xß_Ò6e@ðCLþÀ~iàÿ„?ëý^§Pï~Ì%•>³\?óeê#+¥„•9êxŸÙá Èáp’,í=A ³(Ý×>ä§Í ×áøê_½Õ‹¾'Ûûî×ý»êøž9Ä/¼Â×£ÑbqÊ”põ—ûÿ3Òþý §Ûq3¯ÁÏ”p?MÝZ¶q¾Ãü8Í\†²s>ty<³”êOs³Ÿ#F·…VóÑA |HŒNǼ¦¦ˆX[€ˆuȘVÇ –*)Øæ–q–…t²´¸¼:SuçÀ×þô-Ò°ÌO›îdmã"?O¼¼bf½ðï=5úpÝœ2hÚ”[ÁÝÔÝYDÉž3¸ž¶ðxP(J0Öø¦¬‚ý*í…°Ra©èJ§gº¾CéRD PðÞ_" aÿ§wæÝ_T–Éöï+m`\Š9/„çògŠÖUÍ“RWí}s;õí#¾ç`ÔuÎ]t _ÇÑÃò”I&y3=?,ºßÀü€WS~™Ö¹›gôÚ6zƒŒ›ÌóL\Ëxø-¡ìÏ’ % ÷Iš½æc+†€!0™˜ bý>==mOňõÉ8WGŠÅj‹¨†:…åNÀv±¡"1ˆ½0\fcôÉ ‹ç=ëÔaÎúskçAT¨G×P½åöïɧþï"TºPC@éa™Pœ‚ý˜ë ¼›_¹›]ì}€µ‡÷©\þ>–ËceËð±Ëe¯S)õŽPƨþKXÎ$X'ñÐB@¥µ¾y{/þ’ÊÌÐn…ñÌ ý¼n6e\ì‘k½V?…›—ù¯ƒãu¾s­«÷öK5{»Ì]ò¦9”ë?ÞUž->ÔI—zß}ÙÛêØÙ@ Ãœµûÿ<[’p¿Yæ®8R¬+lx“‹€)"Ö÷F±óêhÆàÞʼ \~±ç2´9Ï*ô¤ã¯)"ºÚ‹þ¡pMW̬H²j,˜Ÿî»_?Ývwç3îßHAƒµ†ˆî‘l­ˆôD¨—Àê?…§ÃøüÌû÷–Á¿û¦æŽ‰Å÷%0Î_¿ÝpH€W‘@ÇØÒ¥ú.Çáw/SHŽ§^ Æø‚¾”G('¾&TABÿ'Ovü“î#²üÅ£·€²ì!$Z«dPˆ†¸¢R4F<ïœâ÷:çÞÛ†¨/uí>·Ž»_÷å‚ãuRÏÄÎ`:×_jbˆãÅ}øY„°Ö­¥íÁÿØv¯•öïõ¡+kžùÿL÷¢¿»Ú¥vXés¬ÿÌc¯fÝ2že ¹4 ̘'4€þAog6¢Ž€)†×Cá#ý\ Œðö¢ï1Ã)éš„4‚gÒ¬ÕŠ\»-šõ½v`­¯¼ÙS¬¢ p1ÈŠ&+s…ØYY¨åÎý–€0"À‰”Nîó"¼C8@2>y8¤y³Ò@ùÁxëÅX“(.…ƒtW8‚IVyã…Ïø¯o å(¯5PÀ˜® ´àY2õ‡(¤¨™Ï&½×ŒÚ…3€“­Ý¯µõgˆEW—RBÿ†X»ô{„fˆñ8𜗮 .œæ:ß¹ð“A¼TÚ?‘gV™¯v‰ùß>.y…f€3î+4Sƒ¨†]ãxd˜{3‰¸÷øSf þ/ÊÞ2&SD¬³Í b2æÕ‘¼"w@ehà¦)ÁÇÙ¸›ƒ°yÖp{޲ʪ.¢‹Î±ë:„°tw„À7{'®Àâù'–ÜÝjƧw“ëù¨¥¦ëî#¥¨»·˜óÞe,ÿOˆ¹—«ð&ÃÖw?Ì$Áª¼O˜ö_澇 ®Ÿ-‚O>>ãêH";µºß^R/ð…÷“Ï%Èè«-´5ÂQÆÔ%Àð¦Üêul£¼¸¿Pð)ïÓ…Τ°ªi‘ý¾K¨iý, ðž ´c Å÷ W”@«ÂRE»A×Å_8º¼²‰qUF`.Všî„9W©*Ï—rYè*“ ʅÆÌãT¦I}9pàøBÑÇ*’ÞµµKƒkHˆ™*9÷ú¸ê¾Ú>rI|ëÿtuÎg GÀ_v—ÜÚIO¨öIøZáÒRˆÝÛ»•{pTŸÖ ,C8µ÷Û/?4ì?àºu”{eæB¥æIòöQ„áñ:W?†F´SeÅŠÛa¾ú~çÈý׊ ©¶øí²¯öàÌA¸¶wK„”eÉà‡W®`§1 ÑDÀÃé7ÍÊ—ó¸{³H Ad€),˜ó"l¶¨qU U-Dß9dûX³É<µV*­€BŽËU„ªï…9bÑGyÒ–p*/íeI¿Ç‚TÇ/HÁ·V¨¹2´ü„u¯”Ô)ÝÂPûýöN$‰óp$¤±üß'›…bõ…Ý1¬ã'X%%dÁQdè22 %“_q@x‚4\«AÖ€2MOyÈã@Âþ‹ƒ‚+c¹•ŽA®µjŸ<5fù‚ÿΠ­ŸÔ‰ÿíö]·W@p“Ú}Óù©^_ ïÎ/Æò@¡<"[ñå| -ÙÄb~„ È8õdyjy§ÿ¢ƒºVí:;CaKâ(à}#φñ_ô›1v5Ôšg"H¡0öJ<Û奃ù_áAV C`²åµäd÷œµÞèÞRˆÕUž«Xšt¯i[Ñýñ!§yæS¥õèRvš÷! ‰‘µ„J!Ü—/ˆ¡uî1VçE,Íq„ÌQvá”kºê/×ù¿ùâ¾;ÆÂ>åGK9÷ò¨ìþáÕ¾;ARL´7‡zaˆ?Ú‡‚¤öl‚ë˜ü»Ç«XàSî§÷ÝÖ\©Þp„dPd~?ì»ÜRÊ€]®%ïý¼ã–,iY羬ø÷»?Y£ÃÍ™¼æœKDg/°t*uàÇ~®>BIóÅÝ·À^yÂkfTÑ]E×7ÐuÕ¾6^¾ ƒ©Jçš#èÑÞóžò1þ(ŸŽ syÎxTŠÏoñ&ùfëÈ Í¿Ãb¾Çx*¡Hò£3췞פ·'T»ÜJû÷õÆûÕ³÷‚T¦E…ó(lFcm@c¿·-ñ³qÏgÙ'gÜsÐr.áQŽ.øe5'X1 ‰FÀë~òbûµiĪeÕc´Ðr,PBXJaY•·ùë<+ƒB@x#ü6YX—§îB¦¼3¤ ‘K­ÝòdÕEœÖž²œç±ÚËR^Ê5Ü>–COtˆrã÷d@¨ÐÎÓ–üxÄâ·$Eú¬oöœÏÿi·€e볕¼»·q?¹·„ð½q"éûÀKVá  $åÀï ýÂ;>êU¸«èw<‡Laíüe@’ÛŸª®Ìùïj¡ð?MÝtß(àÇž”ïü©ºÎÚ«Ãà^žB Ï _´S[XÂf†û^:R— çMm¹Ék^Ýà~ÞÃ]þË×î}9â=q`”ñ Ðo©ßF8¯ÀkGÜòdøª­Ð¨ñÚþp FªWƽ2<¤÷e—•wîÿiæYy÷¥P´Æ™«¬[Æ} D¯}¬W´l±!L0üÎðÒlø ¶D)$‘.ä3®€åT‹‡UÞ;AZ:‰f•Ç´Ví)ì‰Ä ½ê¦Qˆy~AA³Èæ´ 9áÒ~’€£ž× h"-ÅqãßÃ]ÿ€°YØi»ø (C¸9“úk åµÎƒÁëóî“•9·Ö¼c(ZÿËà•7O²FH€Â(æSÇÞ}ÿ„׌q±yéXR½VÅPÿçÒ:ozµD ÐvœÎíSßg7ʧ^+GE·’M¹ñl'À|&á2¸àÊãF!7ï»Êx÷Gí&tÎÝ9x÷OnÿI÷#Lǹèí«Ýç3È2.ÁXcl—ØxYÿ·Ùÿ+Ü‹O{9  „GJ1äÉÿ|.ââ«}x¬/vûôË |±ýï¡Ó^!G´S÷²×× ´Fv1€”¥Üƒi”€+(Yïæ.ÏÜgî‘’š÷­ƒF€ùB[+BÀê UÅ8"Ö!T¹ /Û<†@VgẔŠ¹5ˆÙfpÀ—Ф5A¸ ¥©FY§UÁûkµŸa]ƒŽÑýòá2i¶°2·™ôåZÞ ÔD ÂÆÝŸÜ_rŸ È‹í³ÕyýÝÖ¡û#› µ¿ˆ…Ô ÿ|?Ÿ˜u¿ÄÚ/rÄÇXÿÿê³{žS@RÈýýáòœû¿‡þ“+ÖÜožn!¤Ü0”Ÿ<ßu‡ëÞ§?tWæ·ï•_%Ÿ!Äw ëyk<ƒ ` Oqü#Ö])i/çÜ_A⸜Mž°ìîS}žÁ×¾ók*¦Ú…[p€Pйw»êÞiÄmBa´ç¾mÝÿ{/sŸn3n‰ïÿ§'ÛîkÆò–¯O0~…Ÿ<&â_¥Û›œ»–EÜ–—Ê%È×Q4[–ñ]qýæ½ÅÃîÿxÁZ¿‘àSƒxpzÁŽú&ã §üÛ¯á&ãûz¾âäÎ+*ÐhxN„÷^ðš_ JªU»f]×ü}O¾v-{r¥(D­Ö=©¾nɧ8¹ú xRÊKD;„‰lPfa9ïXÈuøNëôÚùfuàä s¬¯œ{qþ7}~%×ñ””Qrì`õߦMÇxîT¸GeýgPÓ¦w´§Ïu³ÓƒÐÇÀ_ój¶j¥9Ç„†€!"` €‰áïýÓÜ8†ß“Z…ÈB ËäîÓV²ÞЙ>(»× HÏdòQ–úá­;'«k´~Ö,¨%Xì!<ü’­ Hç¦Y`/ÃÕ ”tJ 8kmµAÂþbù—šIÏð)Þr£Þo‡HIEÆ?ßæ»óó„¬äXàÊÅ^ÂÿEË– ”—Î+×û߬ðŸÏ»GXãÅÄþdlò Iàs„™*œ—Îôc•ë‚«ïÍè§S(à0¨µ ,º_#(帯ä°N˜‚úíóõEŸÖqR.¥ÞTÆe/\øfUp»ô ý¼ýx †­ÆnûåXOj£Üüë¿Ê8ñlïØ{›¼¤¿ÿ¥wÏ þÛ’‹˜þùîÛqþtšNtUéþ¼ûøªßôá³&Ï‚BhË»'îñ¤QüÿKî3` â!Ö¯M±S>Ï‹4sÑ*iQ﵄gŸæA+†€!`„˜ DÂö†À„# ë@"Fœ ÖÒ,‚Õ Â‰âX*M—8RJ@l¤¶°ð( sRHþÍË}Ï”ÿÑRÞÞI¨•%ù¢à;àJöìrr—€¬"^E †–F 4×[±´——JÒJGI—}6=-E\ïÄe½”gÂd~Å{úõ6ü ›Xlkìžm@&ZIÒô~ùù‰‡Ïüú¯ ¾. pó´é^ß½…{´¸¾AX€8ê3Ÿµ@·“ÜtÔ‘«^yw]ÿâûm"ÀîséBÚTÞ UðùMþ^rî𭛜nÔ~ÓDáSm4<éäׄ(5äw îïPØù˜xÆÁ)Š, þgê—+Æë[m¿äÅ×oý ¿oˆÌ°ÐöFzJ;ÿ‘,%¯QTiŸcýë{ý­ŽýÈSJic—™GóxŒùØë—w eo“‡€)"ÖçƱ™°êkS„J,Ëób²lmU<£pE[ š0\†ÛÜ@b«#Ÿ °J˜ÜÁåv ã|:áb ¤pœÜç‡[ÏÞ\]Š(¿G¨žA—D‚{8>õ Ö?ø®ÿÁÂoyepj6 å“ULé•]a%[ö™d±Ià{ w];(í3…'쾦¾Ò~?  ”!N¿O VÓ¶Û·B¾Ç"¬ÜïRjˆä0CȃH •éAi½ÇÂ,ÖCÔºa‡cµ«I¿‰Õ_sä>Š#àÿ=qðrù—U\Y'ªx(%ÞÅ!4j8¨ÍÏ5Ú£¶mAú·rK^>; Š+ÃE@ÓÏóÆ:ÊÎExR”$MhT¢íuÙ´5ÜÛÕ C`X˜`XÈ¿ãºhiÇuÍôŽÛÛQB@H¹RkÑðÑE¯ó|òÙÕ ‡¦–áq”j?fuñƒ5DZ²*GøË£¦;Dpüí³]ÜÆgÜÃŬû›ÔývÀx.蘆?sa+oj-×ïS,ŽïÌd=I <]þü“uB,*îç/ö<£ùIgökÈÍ nÅ6{·mYn©þÚ_,Û¢ý™·ô’Žï (£Ø-ÕÝ÷;&QB<\ÌxO„uêðo©Ã|+(Þî/e}Ÿªí7mçŪ 䵤\a€ëÆ™<)´u$ßÔ ïQJ?)„D*ùÝö!VÿšûÃÆû cGÇÏéÛcx%äê_bÜt”G¡ öeã¦ïµ¾ýdù—ÒãeÇÿø~ƒ6º§´õˆ×M<‚°†Kî‰Û_ÚÎpÄ+Â÷î3·=Î%ÜÜÿW°þ/ÍçÚ¡}pí;†À¤ ` €ˆõ´yD¬C&´:ŠG– ‰eTV„ ¯—qkVîseg·2@Úƒ¬ÈU\µÄ ,piÒæUå^ÌgrA­ç¬Ý@.ååèмރ+ §$Pž"La}?&ëEeƒÜ–pŸ` |Ï|$Ä7©ÃµFÿ99ˆüHÞ „(ñ(U ÉElB¯øqe P–½¿˜KzÁQ!ž$÷ǵo{Ð=…zÝo²ì‹_ ÒÒ瑧„˜þ‹ˆ5V¼ÂHÕ£ù?ªEc^m–¥_i En¸Áü£yHab­öüã•c£ÚÈ1¨·†[ŠI$Çs!“˜qqy±Í¢l)Eâô…5Áˆ:¦ˆV]km­*[mÆ @HB‡„‘/ænkè·…–Û@Òz/0õ_ë#Û"w²²)ÅÖk„ŽiÆdeü郢—-äFž'$@B«•ë! ¤0EÚ¬,ø=D_Ä_©0sð`!à|‹•WŒûíOÁ]¼?7Ø{G'yæa—p-…H8Tê·c¼¦稒N ‰8îBصqT„$Þxx(Ì#IØ€ês×Á›s~„ÔŽåÝž*o ¹å‘æ½2^r{Eüûÿ|ºãqÏ÷‹0áW\á¸Ê—|œ¿í †ýËëëçR>*¼á5m~I Ígð¼:(¹#î‰SÆZpŒx#‡nÏ®‹R“yhN‘–³ž0ñÂù¤T|ßÕ³j؉ C`$0@ĺ©^'/µC`ˆh¡Ãb0—Kû˜äe˜Ë’n-ut·z궑{PBÐë9q—VÇàæ)Áñ;bŒÅX/Wã?{¸â]­Å0Ÿ%=ÞŒhò­\)¹´)àãµy¯Üúæì_€«,œ¿z²å^àêü-ÛÂ_­… ë/&Q™å}Ÿt.vôê?ÿyð%ïFŽ ©0ƒWÄTO&‚8i7ïá¶û“;óp$Ý_=^'÷œ'Lá‰3CØÇûŠä±pCÓ`¥‡x.‡jÍí£únçÈý§¯^ºçÄ"À±£àöDx\ãTäþ¯,¿…ÔðÊŽoP>~¿wâ ´Së1kïHöý`~XBa(Eæσ\Z¼""¢Ø‘ì«´|†Ed0@dº"¨ˆqD¬C&´:rœeÑ0‹å1…P¹Œ€,Šéƒ iØNYøM(0h¶ W.{‘ÇÉU].Ç\>ã,ôÖqÑUf ´Z—[¹>ÂL)…o«ëÈöÈ%QK5»ë³0/Ç_&ï¹  ‘óÞá}qðùŽÜª}øûý9Ó˜¦É°¥° —Rú,“o]÷¢òzkA¯l þ•e¯»‰\?¨»*þE÷ìøv`ݧ¯Äú_ç^“òFVp½÷A}ÿA•P'†¥û8|¯{k‘þ‰CÊ°×þm2ß eñÊŽ©÷+¥úWC;sˆ€z!Æd °°Jm²þkž0÷ÿ%ÛÁN^Clè¨\Úë)ãˆX‡Lhu$¿ÌµÜ éÒ~üñªÛFùv¿ì5„ÊÏÆâÐÊ€PÇ„¸#tìb‰ü¾yE.í~ùh•Ô)ï2ž&Ž]¬•G@µ°“"%Éú/>™qe\»ÿ ‹_>\öäox½ïÙÞEø QOÞê#IƒÚ½¯@ð¤ä‹|_6dók,Êrû©PòëôëÏï-»E¸ ä _ eÀB&å³!„—QæB•Î^c%Ü‚ôiç¨/:}û}¾R_ªÿ¾“JØ7|Sxwoz¡>ík ϯ}xÜŸ *ÜáÕþ‰O—ùk¬ÿÿ•¹FéH·Êuø º½ú[þ´n\Ί—¦¬óg™ýJ.îàÉ´±¨BLø—~¶v½EÀ½ÅÓÎfŒÕ@žà‹ Y$3²>²Æ#äX°ÊºZ¦,Žl"“+î>™V`}.`”u8A‡–ä’M¬|8Šµ—»½Ê ¡o‰\Ú9ÜðEôVG@W¼·¾÷÷}‘e‘ æúŠe×@_}~ÍÿÞyeB «Ê3®5CáΫ¨›Uñ`õϱ°orÁ Þ9ú¹”ºg}ì¿ÿ%BÁ?T…ï÷}ÿƒ7Xôý¢¹@ØYÆß`ÝÕ‡¾a‡öªJºªÎ©}XÞu~~»}xvy9„)_âú2@é1½þ×7óbÛow]ûõÍPÔW @šy Ã|•‡¿Gîÿ å³b†ÀeØìp*C|Ï8†¾]ú-$T$zæᨯ¼œ‰»ÏàدµÜwø6.\¼UÅÉ|C‹oúFøKè—°'·ño6ÜQ¾î~„9H«ú5¡•"ÀŒp ˆI_ÒãúÙú<‹ë· ) ÙR °íb½¯ã]Fpj÷þ,‡‚ÜÕ•‘õ^$¾(¼ é|ØÁsØŽ¹†æöq=_dÿéjÞ“J!°Àk²IY¡Û2⮾ZŸ>í¾x÷qŸ.g§íê.1û7IQ–ƒ¯I‰©Œ#¯ÈtP­ãö/å£/í1Ú~e»a @0,£|”Ž¹e<„ä1”f>HBjª9ÊŠ!`—!` €ËPâ{Æ0DðíÒo! ËbËgÜçawîÎ|ÊÏ¥MÞEÈÙÓbP‚Ž•!Ð^|kíÅGiåö:—þå«}R@Mû¼òYYXÆH 5M(‡•Û!ÀÛÇßÇáõw¦þ?¤Cû)¸KPú’°€z¾ëŽè‹mâ¤KÜ> œ40ê/IöÚ¿«„ŸùïÊ©—¾Ö,ý{œÿ׸^ÇðÈùÍëïÚ»žK¹OhÎü øéƒeÏÛ¡øôŽõ¿ûZáù»ßëù±Æ'j»Áë’ÂnÜŠÚ4ŽíR?ɳ¡T«ûT•OwÝþê\·CŒÈ½÷‘Óí¾·Î¥öèÞbNXÀ3ïcˆz*´FÈÞ|.ã²(g!•ØŠ!`0ÀED†óZOR_Œ DÂöQA`N4¯È&gÝ<[o¥òJT*:iõ-Ö›R°!™,ÒqúK 2näŠa´î¬Ü-¤¥PQA¦Ò.*åâá|ÕÇëK °š/z}…¨(c` )>pŠ÷ouýyWŸð¾ÿˆ?þÉ Ò9<=PöH®.Ñßqb³Ïxï5§üÊp>…¨ßµÉ}[ãcðEã1¸ªvC©Âà=WT_IŸ[a|At)â¿ÒTJø/0¿tŒÿ¾µï¿cÅh4¢=¯'¤¨÷JߘYRÚ¿6þG£­–†À00À0P·k#‚€áB"‹Eùã;K.MÜqfûØ}Wh¸×òO–Tb«üáõ(Â(6_›û îºrÿd%»nÓ­a©þüî¢'Œ^ÇïÊa–ÝŸ¬Î¹»XÝ–±¾}¾>çšä±ƒ2æ%Û—¤÷+ßÑÂ¥º%€ä¦Ð+à}Ðè»’¢ý÷§ým¦°3yß‘à_ð8ÈãódçØýÀ&…O k ßóºÊ÷ZT×N _„ûÎvAäÚ¯ð•Âÿ—¯÷œˆ.ŸÁ/² ó¿æ”ªÆ¯Æc[èŒ`&¶J ‚~¼6çà ´2Ÿó®ÿ!/ÈÄ‚b 7 +0À•ð؇†€! "@Œ pÄY\d=ñÙ )ÐRŠ1'&Ô–÷C#ZŒó_}pÄÂýË¿\Ð?Û8ôiêkœ# &Y jín¥7°Où°€$÷„‚`Ö Êü¬e5 ã+HÓ¦wNÜXæ«tЩ„„(OÙíS§©×‚þ»²V¡ÀÕÞ+Î_Vÿ„û#®¥ünÂ-s-…~l·G碎ž$σ=Av'Qh‹¼FJxwI¡ôÿ~¿… ë?J,y|)œ¥¥•H!C‰K£ô[æ¾_[̹9Bƒ¤´7¯¯Hu“Uƈ¦ˆX—4›M­¢¬‘C@‹Š\&è™›c¿L¾áÏÉ[¾ à¡-ô‡Þ_ÞÑœÙC–º H»D§¶a©¡W7qSô¾›¼¥ÓŠt±ÕšÅ]?îî/fýkiÎÄpL–†},©'ð5È*ÄæC7ºÕg^Cs 5ô³úû”Å¿·*Ê…Še#ØžâšlJ'(Žˆ¾—ð‰îÃ6µ_wÞî{E&ã!rººÆH¹ ê)k Œ™ÍÂç³Ø ´DÂÿ!–ÿŸµsƒS$]«Úÿ%õÿ:J™æøEÂòDªçs ÍIV CÀ¸ S\…Î>3À!€n—¼ ܋חçܤ€,òqVŽ¸Žqqnh%y6`—ãkÕ|R¾Ä¢õÂþÿx±ïþeëا¨[bQxòºÇ«ó¦9Ïh?)ˆ ªZnK ØÛdœ…x*5õÌ{üåãuŸ%à·OwÜ·„hlSý¯ÛGU5”ª$Ôë$ÚÞWº•m²Êò£2}^‡ƒ@!;Û'xp©’Ö]Â"mêA1ãÝÕ}_ÓFîs54ÜúUy?,€êSðu¿~vÃýJ¢|E÷ß üS6‘z²MÀ‘«óYM /PÒÁ=¼î «k?â ¡;âñóQ>é,B¸”wkKs.Áü#¯=+†€!`\…€)®BgŸYÀ!€n—¼"“K`]µ(…‹±ÜŒç!†J•aš÷ C[^ Ⱦ|©=‹ÂS¤®#Ráy—\x•;^Ìõ²C èÃ8úR >©dxÅÞÏ ,Åfä)Y,ÜÆOPì"Xð ’ÚåI©Ö¢ŸlM„w•k«Ît¡sN®U÷Ò¶sõV@@¨Xm/¸½õýs?¾ý =Uibç€AÌ{o®!¨/Ž€›v"Ƹ”G(pEº‰çÐãto‘Lò0i1†-îÿ¦÷ïwqîë,®ÿy¬ÿz6ÇcAê?#ÿëîvæ›!À˜4­ÔÍ ëÛ¯LÐ7híĆÀx! EEœØf-ôç³i÷ÙyŸj®Ø8pÏXŠ:Öÿ7‹ÕñB â­é’ ¤¤9EØß(îWÅ­!pÎ M@>€… )¢P Xé’¹ƒ+R¾òr'Y¨ÿìá2¤ŒiŸ"p ÂÀ#Ü«_–ÝKú¦¢°”6"aóâ,®êOÝJ]ýzemõ=¶VÇ« üöàïG…'ÿuíÁ_?ly÷ÝmT»¯¶îº$üþ›}q÷b÷ÄJ~µqྂ;D®ÿ{ŒÍ3ï]~wPí ¯gûw#ÜèYò÷H*âÑ;KYŸ4Î<Ìë7ï¾®}bÜÖ$¦û槰_öSôP;!0®(®0ÆcŠ½ˆ†ÝYpbA¶_r‰£ͶEGtú«0á×Xÿÿ¯ï6½:—Š¹•lÒ-±e“¸‰¢°ë_ [-ÈçgRnžã%îYû÷ðÊøw]¥ ü—{Xï·QÔI½Öð®Ø^~ïtLçàêŠú¯µ¿{ÍŸ\}ÂÛ|‹RBÉÂl¥„@†{S}»Î®6šî»­C÷=!)_mº_¿Øuû>îŸð ¹‘ëôÝ—Ôe­ :cjzfâQžÃëón™¯ ^FqŽ2´JiÅ0 «0ÀUè á3 èvÉk# /)¸Š  Aœ³BVcÓ.ÎJñ5Ìk»2_ûªöÅFÀ¯q/Ç @ä^ê7‘>ß/À JʺŒ_$*Ÿ½y|0º×þÖá P‘7@k·”«d g€2”«îPñûHË'xˆ4P$òè÷Eû(/èÏÕ­]é°î&=¶;1:;u\þ+ÿûx)æÿ%+¶Q–ò¼þÛã6Òc/:°¨&xáq¿-W”Ÿ‚kDÏaºx‰ôUó¼ŸúT»Œ!`Œ.¦ݾ³šCA@®Í9\ÈÞYr9_í¹Ï.÷ˆ!Uüñ„Rž2ÚÌCéQ¿ C¼s õþáÉ–{ »÷gJ H(Ç=¬Fyúož¾ …ÔáUxü¯,εhO¸ÏÖ|Ê5‘2þÙÇkß>ÛöJšïÆ~+¶8Z(Zâ=M¿sÂvD0“DÙ]/½–õ_ÿ4˜ "TC¡A[Äú¿uàãýÿÛ_º?`ý?"µkQ!(Ý–õëÅþTk&©2tÿ%ü’šqk阻G¶‘‡ë<‡™Ã•¦÷ü8IØX[ CàC0À‡"Öçï[À>l§ï ˜ÅêÄàÔ§ZHÍbÙ¤ËúªW@Ûy ±GÀcßÅÖ@C ·HNô|¸ŠyxKò§ky„—²{Z¨»›ZJZ‰ô—ÿ"ürÕ)Ÿà÷¯÷Ý!îçŸ01` …N‚¥B¬ôÐUWÊ…̱ˆ´2ç•11úã”~Ià! ¨à²}€ò¦)—•ne-úLìï•Ô¹ÿ÷Qü•Gßm»ß½:ðîÿòÜ „ÿ+nÝólkÌŸ.gÜ €óðŠÈò¯Øeé±b†Àu0Àu‘²ï†@Yå•k8›:s÷W¼%9“ïÙÄ4ŠšàFiBЖ@9p‡Eþ!BšÞ^ ¯ä¡QƒcC¡?»·úßQ—]¡÷îã˾{Û÷.;ÿeï]r)•÷_ª6Ü.¤[¤ùÛðoEÓ1J¯¥éþÝ5ÏÛý;îç¦à)—æu #O­<ÊÛ¼âþüõ ¶ùºøÛ) 1GÀcÞÁÖ=¬ÑJ¨0+F€þþ«ôÇ |e øÙÃHÛÊî'/÷|¿}»sì¾Þ9ña²ÞJ¸ó^ƒEý<àzërcíÛÜßöúã†P—A_²_x·ñ¼´9׸¦²€lÁò¿sRrωóÿÏ_¾ð€/Ê> @Ð?/]'ë:¼ôºöæPg´\’Ý#”³óÌ ÷à y´¾è–½›'›‹<ñ¬†€!ð¡˜àC³ï†@->dýOƒxRªc>áŠXš”z.†{r:_®ZÈvÎfýE€U$ÿOÊNè#ïÌO"?‚þS²,З*â°`Å@ÿh¹/¡_ܺeæè¥ ”—„øK²þ¿>‘×FÝU«¸oË@\(è$¸ßBù,uÝøê¸û5/{^t~õëýäo‘¬þÏvOÜ·„üw\ÿ_¡LR(É)ãÊ—‹Š¾~·åÚ0ñ_õ÷ò”KÒGæ„‘¯H+ùü àÇŠ2·HideðÝÔBi(n¥¼õ ?^ËñÇ+×ôT@Ë­Šc†ámmã˜5l„›c €ˆužqD¬C¬:W" AEDfEF´¾$—Dçöq1TX¥ðóÄe&\‰ã@?ô’å´ïš‚c帉PY#„ã‰[}šv?½¿DŸ>X¦qCÏ%ç<„Z× ¿˜#–×î¿#‡»rº??,¹/7\5$ Cn¸/[$´·ðp°ðÕÂFjßÏÒ}þðš—_O<G(`ÿðjÏ‘²û¿¿yíþëw›Þ+ë°\EpԤ̸èXŽ»Ï}ù9íÝ!! Û—ՑŸjg§Ì§¹6\½Q‡ý_ÊÙ8Û ïó!áa—5 ž!` €žAi'2&o±DؘaSìø ›-I¢??.7a-2· «!`.#lŠ#À§¨ƒd*8óáF45œþÔ}$/ŒÌLÜ¥°ÜêuŠp€÷Ø=‧øŠõS—CA û°®>õ¦ÁáÔ÷ÍUT¢c›:pôé@á"ºŸ†µËý¼»¿¶×lò hyáߺ¢Oð÷þ´þ>îMÓdØõä­u·ÚDðØ}—õ¾vFCÀWL0®=kí2€€¬Mr)ÕVŠ¼ƒUró ˆ@à¦<1$`Àº/—…A²ÉÉåZ.â»íC,˯Üj.í~ñÑŠûÑÚ¼w=Wx‡;V†ƒ€—FaR¯IØÿËOrÍ}¼{ìVaß',à«#÷áïlXJI$líM}.ºuÃM—¨γ›ÿ!Ê»ÿÝœe÷dÿ„ûá_ãA?°2rH¡WD0Õhùgëkîñ*^wqæÈgÓ~^Ð|`Å0 ë"` €ë"5 ï5ÌðV A@‹JY"ä’XĽôånÁ=Ù+º×¤™«à®èWÿ¶.‰nojÑ8C|)5<@pTi¸2ÖäöËÙ¤·2ç±,Ï#üË}fš/[ê.)Ä·‘%äFÞu”oOøP¼&à¸Zs/! ìHàamq¶Ÿ^’5u>ÌÂ}XÛß…n™OãàùÞ±{ÊXø1ÿÿ‰ð²±Èòÿ†ðÏøíÒÉdtqø¦=S}ä4¦ô‚m“7À4¡3fp’ºñ8 ù&áƒõ¯¯¿÷íþ¿Vïû’:UBû{º?ååQü±yVqæßWx<Û;qGEACò™M¿ïv4>o£þK æg„…Û• z”'€2ÄP ê=+†@ÀX¤%†•!` €áv†­Œ†‹¿]ý–Èõ«Ó.‚âs\ÇŸVÜw…º;DPÏ­5‰ôèîYDª›jÄ ï±À, @ü—¯^ºß½ÚwŸ"ðûÙ#˜èÓne€2X8Àð»R|÷åK%\!0.Ö@/-Л(†UÎXïI@µ[¿w= ÿ˜pÚ¡_¶Á<»{Tv/üwûø»o^¹¯¶Ž|šO¥ú „¾k¡;½ë„¡ ù‰}Å=þÛ×Gn-SvKù”»GˆV²Ö…|;-àðnù¡!c6 GÀŽY_aYú ¯¼‡hq)¹"ÖÿƒB‰´dUR‘¹gD±4%€«Oþ{ˆy_OÕ¶ÉsClòb›»ü.V& qb›!P&I¸Hx€b$€Úz³¯½òÞ“ ¹þÊúçI8õ uXJPˆT&xܶ A_kj÷ ¬ð²ã­ór¿ÀýYöÖÿoñà#‡·¸•qBÀßF-·GçN£d¯Ã pLß—ØDšÏ„Ùv¬ãÇ©Û­-†@¿0@¿ýðóÚ*éÃ1³_ Å”j“ûÿ!©¦¶X€î°UZ¹–?³û ©czqYÉÛ¢}Cºœ úöWÏ÷Ü Hÿ…€ŠrÓ/æR>&½—µsÜ éÙʸosnc–Ûw4ýŸ=ÙnÖ±Å=)O,Aǵ†ûfK?Ê× ”t_oº°{Ü›^ø÷ /B8¯+ÜXž±E:Z¡Û<¢°Ëe\*ÕÂ#(PŽC[­ c…€MHëNSD¬C¬:†@Ô¬O§^ø/°y¶yàþ釷óÿNk±_ùÛª?êýxeý°(©+xT›M÷ÝnO€šËgþ7×Ü) ÎuB~,BºY’N¬ ¹Ù+À·„à¼FAs( IŠCì÷köÈÊíhß_·å¶ \ýûo_»Þ8RÎ}³}LlxÓU¸/Ë?o÷äíqà¤ÞÛÁú? Yë;°[îÞRέ-åñÀ3k&à‰`Õ­J“€= "Öÿ¦ˆV‡Ø ­þ°Ú¼YÿÅü_Á@Äûå†;ù_·ëÿ;~koRæ´èÓ*Ö¦=„Ì {YšÅ6/ Á]RŽ¤€Ó.9«<ô£Ó¶q¨©H8OÙ*GÄk«qoÚƒdz÷BèTéTtOÖ¸•ò±<Óð|ûx(  Åú_ÀlL_6u¶ÏÜÆAÅl ÏyèÞ÷¡Y6iï[³ Þ ` €Þàس³@Ï ´õ Y åŠ{¹¹ïö‰ ß‚„j«Òt‡!E> ܵRíSì´ƒC@‹HâþÕ•Rú”Pø|M *e}À–Èû‹9·>Ÿq?º»äRxˆƒN õVú‹@ øÃôŽn ¥Ì·;'n“ûñ÷ðV˜pÉßý­Ç¹³‡×c/] hŸÃ·Î}o^è¦ðsÔÈ©Uϸs/>CØ‹qŸ•ØK |Kû6 :CWŽbNðÎz‰^˜ bkÿØÅñɦ!„¤uO+†€!`¼ S¼ {ß0.EÀ[„qõß9,À@]ÂEú)åŽÇUÓ¢Óž—â6šoÊ•8¨ùBò‡{BƇgôû½|’€˜;Á3@„d–ç| º˜Òýšüß÷îö–`ܾÿ/"¸×(6 bƒ±ÿ€D²±Ÿ„„^ŒSé´Gó݆VEÿä屉¢gJ—§¯[bùjŸƒI¿”n*úZÞvß üÛ@!” 5ëüy2(k.—G«CÀ0Þ‰€)Þ }`ÝHàhbuh@ W¼(€ÒMiAê…ÿîØñ éF’Å)G ÚŠ¸Ÿ¾8(ytŠp>“p«xÌ¥>M` +”9ôg4¹çNpù?$ £Àý¨|àuîMeæðe¨¡$Sý׸y3vúƒÄžUØz|'°íÖäeÆÀ Š€÷ýÁIÉePÈ*#@s1ï÷R?K.;"ŒÃÐ/mˆµ°Kw#` €n4ìØ0Þ‰€\Àåú]Áò$ëÿ¿>Û…t¬âžay(Jèð+R[ì¿ÀQý@ýªæ÷/!žcüO·] ÀÈE~âV°<ýûÏïº/î.ºî¨yÜQgí¹à×ã¿5,ý¯•}C–òÀcý/Axæ­ÁC’þÃÛ?œ| @n§ tr„æX™PÚsr Åë € ¼ð~Ïóx÷¨è~‚WÐݵ¸§}ÀŒ“ $Ñj6¤¶f:ZõšäÚ˜ b½_«Õ"V#«Ž! «oÅE­^wBöK5· óÿ‚H# ¬‰Aà”>—÷GÉ5\’Å櫃¢ÏK¾‹@º '@ž…i2wŽ§Œ8DLe¥w4Qº¸}.p”1 Ã’ÎMáû¨ëïÚkg2 ‹ qã…û^ÏãY„ý"JzyéÉ[oB‹¸ˆ™½6 !` †€!p-ÿ»²4+n›8ð=˜ÿ÷p/!èÙbÿZŽÇ—BáRkO„z¥&;‚úHèv±BÇðx¾_rwPüâÑŠ›KÅ]>•ðaFxû! ]›xþKÜ{OöNÜ ¼6!âlpF%Þ‚šàÌ 67ܾÏí †À¥èFƒ¢€`ƒluÒ>ThÞXµFÃ-ä!̤, àRðìMC`²0Àd÷¿µÞ¸6²þ‹ix—p¯ö nÀ×ÿù˜có¸6ŽãñE´R°i zŒºˆ5:†B`¯…ì¾û“õy“zwBªEç•Q°L:þþ• DÌÿ“Ý‚û~çȽ&|] •PA¼Úß7J€¡UÁ.lŒ9ÜeüßBP9©»•Ê©{„òUÏi)’ñY¤s¬y£€€Âˆõ’)"Ö!VC jHÀW¾ñ €ÒÊ0¿À¢Ã§ŸŠZ…­>G@Â^“1"=Ð Ê1“o"”J8-’:°Î’õ?)^€dÂg  jÖUÂYDU¶"€°ÿËõ·æ>À2 +}UR[¸kïØ_CÀè5º÷™“xË: Kä+ 6)è´…`õt;߇"`O‚E¬Ïß7@ŸþÐÓ7 »I>4û~ßoá¢Æ¶ÁÐ_ìºo·ŽÝV¡æPñ_ß ­Kð„à”ý! ÐîéG•†{Ž@©yÉýòá²['CÀ/­º%2ÌŸÍFÅ`=xK'Öÿ¿@¹òÇíC÷Ýα«(¼ì+"üŠ€@±  £  |­’†Àè"@f­ÿ?{oÖÜH–f~\°p'č̬¬®Ê*«iÓŒzæèµæUfó+ôdú ziÙ´™d¦—‘MO·É$µº5ÓV]S¥ª¬Ü#cepǾƒÀœsÎ@0H&#Hàx„Ó‡û½çú½~¿í|? 3ËÂ÷»¶Ï«E²f“Â8˱V ×ñm]•\\7R\7¢W¼´¶R\Cýüú àÂEîÆTÁàE±aûò`mp €ë»®4®Pøì žmLBé Ð UJ¢XxÎrP,ÇÃð$éÚ½Ú"Ž…,šƒÎÀ³LÑZÅKh¹§¦Xý °þ— d)¢/’±Gü üû5 7Ë«EF€ý }¿…mÊ×mdçáR‡÷¹{+¸Y‚4>Ü0"º|ÀPÀ€5Š#@ðÚD%A€óŠJ½aHûǵT‡ð÷c ÿœlȾ˜¦ TAHÈ…á#Ð!]dÕe Ø+5lvnÎVb¶ëÔ¥‹AŒ†‘1@¯£‹‘ÖÿÂnö‘vóÛÝ‚æbsÎ@IDAT=`Š9wbv 4( ñ|¤¸¨Uõ¸.z. ¨‚l Ñ‹ÌϺP€ÃbÅ’±¨…çá…«!0 ðPÀQÁ=5㺜Q|¥4€£@]÷< pù"ÜŸ8æÿ—å†=mv­Äø?Ð÷¼ëøt"0˜îB`$ßî—ì9Øêà ðªrɘ=ÚÈØÿòѦeQÛÊ-`Šp€@ ±Ái>êÚØ°æ=?,Ùÿûý˜ÿ«Pȵ¬€ç>ð|Ý`¯‹2¡xNA8U!0y Ó1€ô[x!5K­Ó³g»EKDB¶”IY ×y±“×xO¤xOà®ùgš]3 ºÜÕàžîÚÇpã®Ã„[@ê¿"ÜŽëí®ÕèÞíføW»‡~=ppká9jµ<öú¤ lB”Š…ìÒIÖáQAH¥ÿ0x"¡ÐI(;C´x©kÈ´P„ëÿxòþ;ÀѯƒŠ“^mz~…Àð€—´¯à¡·wucEa{1xXu0óÎp«ÃkÝI)‚Ú2*—!…¦8^ì÷Oöìy†w0¡hva^ @J€¶Ð˜Ýš‚<êšxf^åk–‡'IBì6RJ.Ä#öù­%»“MÙ2H?ÜÈYV«¸"" tÝŒ)ƒôïÊ“/·ìëí¼‹ý¯Aà…[ÐÒa›^ž,ÊB^‚.Ö”êš;‹« +yR×@`͵ÔåÆ*AÆŠ4€ß€^CÌàswsÉ…„ÀàÈW¥\×Ër‹ xÍ&@ÀÚ¤Õj¬D*δ!@9¹Ãò_«7-”B_í–l„c;°B¶ér¬E¼ œlâ?¼RíÂì 2*“¾„ûBä€dKø|œ«‹ çÑ>ƒpÕøQ0Í+ŠÐ´þï" Dz*¼‚×Ä‹Bͪ­pÂà&ò°Røw €I/&¹nïÒÁun`à l ¶?@ÙÊ¡‹‰ˆÕA‹´½Lp¸Ò"†‰€8†‰öåî%ÀåpÒYB`Š@,!ܲ‹åš•àú_¡Pî„UþuÍw§è9¸ªÒP ñÞ=FüªúL¬ÕU›ÅçÝB2˜°®"×(âVÓøBxÓ’ÊŠð´Ð[ôàÆû Òý1îÞÌ´ðš\ aaû«Ûà·ÞŸ ðêe ÒníCä¯^1]aâhCÀ÷v¨yìÞá¼ÏéþŸFM#ð°š œâpâš@F@ €Ñ7›#¾*ð `Qóÿã—vãÉ^É^øo…š³.è‘Õ³r˜«Þ‰Q”Á'Ñ:¶ß¾<²/_å- Û?<ÝÇ6b?ÛÊÙO°.§böñfÎ)æÁbíÜW¯pûqù)ãuéQ‚Î7;yûë?¾pœ Ì@²/r&x8¤FÅá0áÜÿ¡4tCF@Šx-Å î\É.¯åºˆ¸&ŠSF|Ò€ç¸W¶ªöÝó=Ë•v!V ae V-B`X(`XH_þ>R\«¡œ©,CY79NÚ™VŒÌíeÄh“ü¯VaÿqBáËmçü\‡…À»!€gŠ.îtS­R€ç®‹‡¬‚»XýsÈÀçq-“tÏ^4<ï Êô˜‡GÀ¤z Ê íòpÉC G_܇å<(LˆYàÉ_Y8ì~ \yß·@xN÷ÅÄi6Þý.¨ä1äÑ Ëð¬*b á˜ÙÀXË«î\obÇÏ ¶Ç4—K!Ák})F×&œiA€‚V½Ù[;Ò•ªö .ÇÏʶ]¬C â¿À4ÔÄ„&ãþk…*«œð߀ëûï_Ú!Hïð©ï¡ X^ˆÙ½¥´KmEÂÀ<¨˜cx€­1߶19¯·ÚVçÆoŸì‚È«`ߣ/€‹ƒd€-ÿ9+4*àJ;áß½å&çUÇš°}ø|6¾BE!Tœ¢žDûÈàóÝvÁeÈ`ÜÜ\ÉZo Õyð¬h7€<náw¿¾ïŽÙþB$€7 ¯.~]¸ Ò:P­ÁòxÁïv ö‡ÝŠíáX “^-BàÚðX ´½çÚ^€ÇÉ \W0iýý«HCöG°Y/"[À‡«ik>èX.¬°YGBs‚ò€ €IXhT¦€YEŸ;¬Öí÷/ìï¾}e{P„ìÁ 6oGü7îçTèÒSá  ëÄÔ‹M(Ú$a¤€J®þ³|…ëë§BàZà€Ÿª§Õ–…^l½¶;«‹VÁ;ž yU0xº}ý7‰€<nÝ÷»¶ï‡ÛýJ!7­.ü#Ѐ¬ÿ$þ£û?]ÿ‹˜äV1áå4›ånÝAý׃(T©oïx>±±hØBønš³¬Lø¤êù/¯ •iªË"ÀT7¿*/<(€´a]ÜÞÏÛ³#{±â¿JË^µº.þŸV-BàÆð§nË?3Ö€P¼ôw³¥{~T±ß<ÛwŠ€ûH¸O€õŸýÉ­œóØʦlm1iax0<`\ˆ®hõ?„×M‚þ ßü¿¿xf;P|bÄgP0õf‹p@q&ÈÂ&Ë‘ã ­ãT*r—c´I^(5xcì«öõö¼2öß_Ú—É(@ÊcÓêc“¨Ì÷Þ>@?´&=¬zö Ô…Ä+[ɤ, ²Õ(Ò°ÒK‹¸aÆóEpàŒòòRŒýóïÍQ{2|Zϯ£¾ n²Ž‰Á1­*È׎À2ΉoV¯5¼¸þúvràSºRÑÖ"ÆL¾ãé)ÕƸÊп™ž—burPÍ€@ ß^ÀgèE`è_|ÃT*Ť¸&}{MPø'ã“YÆÁÒõò° ‹ ”p2¬EŒLNHïð8‚*ÀY²ò$ăҪM7lKFCö<VÒ [Àþ&,\ (’psMÇÃF¼k"w€7Ùuñ¯#¨»G ÿE¤Û¤ÐŸ'ßâý÷!ô?Þùf¡âÈ«˜ ³n\ƒmùÈ‹óx@‡ËhjŸ`‘©†ÁÌáîÏ0“´ËSXNIÌøc$Ã赡ññívב"àúH~ñÌ2›È‹ƒ”¡P ‚g$Zh~Þ"àZ™Ô¬*l‘©+Òññ1Ô÷Z‚„€Aj~Y0!9FL–Ú&€m3‰EjAø/Uj–óÿs¸¶þã³¼b¢û “\Gr566¼IlÕÉ!pŠôþ¶AíëK„|áŒ=‰àÖšƒGÀgYËàóF&aVÒpw ÛZ:‰Ð€ˆ;wä£ðpö$’{eÛ㽂³*ÿÍŸCð¯: NòàEÒ¿qq£–ⵤÏ=²‡ðßàq|ÌBáßµÆÀ=kÖª%À\ïwdZ©à½OÏ?¦v“=“„v>zúFLR³E EÜ(Îú+#­ÿ߿سĵ¾Äº @“üÇrjR£%ÒÅ…À; @¯çßô…»»&´õV˦E0±M@Ð_€…‹V‘;E@*²U„ + Ø4¼¢ØÏ€T‚L/ÈïH"8ûC€LÙN1@uõ\Ñ=üâY“aóÆ*(hºÐº–£\{p÷Üýpó/9¿Ä“3¶¼ áò9\s«Œ+ǺüÝ•YGìŽÃÂröWzÿS9ÕxŒº þ©X¡àϸþbÅ‘û‘Tr^y(?¿ƒ'ÝþËØÏWšà8¶}(DkBÇy¡°Ñ±ø‚ÿ¨+æ•F…À%èÙÆ¥V»k¯ÊM¼÷¬ŽñéÖ¼¥n¼ã£­¬—„S§]„\ú\8¤κ‹¾ÀB÷Ö=X"w!üÁ͵ˆqšäZ„@àèËc¾@F¶|ZÚIÐF+»û3ÚoökÉ(!Ë&"v7l(6¡XNÅœ‡ÓRÇqîSø§B€Š ÿôàE) r’ìz þpK2­.ÝöÑwš˜`Ó]œ òÄSø¤kùÂlváRþ[L¼ D»ƒÏôR—w=Ú6DZ²ÌÄd`æsä ÃÍÝ–EÁ>Û’mÀç"Ñ6*c¾B–…ïö´Ovl©ˆéBð§ö“¿'÷Ä ÿö}¥Ï0ë£{ ëD »þ‡À+„°Ÿ.$b¯À¥‚qhff\BŽ®]køCòn¥[\).ƒÒω  ‹<†ˆù4ÞŠ‚J1€dN§ à~¡f{XK˜·i¾ã¬àd =©Îc‹ä´< _ >ΘàRÀ£’€Â9³éÅ`é/ÂÕ; ^€XP„16%@ÙæÃg*æ¨ ÿ‰'B,NÔĵ³ïâö±­"ß6½¨(¢Qð܇¥™Ê€<ÜnwãOvÿ ú`‡Â?ËçÏ»½ËºkëOüf¥¸gq!!TÀLâζ ÐÏ°&†Tì!Í¢ qB< ÷ŸÃíŸ)&K°‚ÖáùDBTÇ{ÂñÏ ü}¡ŸU˜€vNKè.ÁFÀë—U<ëoḶ¾‹*Æ%ŽmdRq|Á®„J7f@;¼—Á˜a3ªâJ0*äu_!0B(ñÒgìÿ˜®ÿìÐ~( ý<*Î÷_cõ›G·~_œÖ—Ôœ}ÿB˜Ø’àä–3X÷pÊS¤Ú›Ãq_¸ŸÅùóPÐÝŸBœaXü `(AÙ¨0˜õÃð[ö[¡³…>å¯E— (PP¸dì?Óvзhnà3G§È.-n¾péoǵû±Üo•ý­ýF¹¾ ïÀ0 šV¡T¡…¿ %ÝûŸ7È·È®° Æù“d±…öi¢=š®-&ñ¦¨h„ÁgÇ/æÍWÿ“¶BàæàsŒgþ%ƨÜ.ÚÒQÝ…HÝß*9£@D©!x=) àæš@WA@@ € ´ÂÛeÀÛ˜èÈ5"à<0Afü_ ®Èy²þcÍs2ìfðší^#ܺ԰p‚´/M¿¾9­Â|¼ÛXt´|Ì)‡ÃÂOË/ý8Rc1³@: NÿÜá-f~H¯ì)üÓÒÌÔ„E¸×6 \6ÀöïÜÊá Ðs÷öoˆ²±x¸–çîÿºŒ±‡j²¦þzuⵜ§®Úž>îÎòüiõ¯9‹Ë*–1¶½bZS( p÷Áx(xSû£=xÍ“…mÏÅ=6î÷Y…ÀD!à=õ%lvAÕ¤ó†¡Ã: ÅjOTs¤2òHC C €0´+&ß ‹îÿÛûH÷ sç1(Bª»¹ÁÓâI‡Dõ›& Ü;ßÖ¹Ë}¿òÞ¾÷äC˜‡ðÞ붇@»/üŽ‚¿#Ä>åv?3ÝÝù; ¢´î“ á4Î Ý ª¼Ä¹ïßØíóód-¬&ëÍõM)ûÝëIo%^¯Mk=½(ðÙãUh;+ÿ!„ù„úCx4åÎA"¿BŹÿ— Ü<„ÐïýÀ QÁyTаéÏL¯8¡íñî¨ë“ŽÉF˯ÂèW;ÿûþžåHŒ BÔT2î)99fi׃‡q-B@ €à4Æ`çÀÔQ‹¸¨ «ìÿp‹}qP±¸*ïzæµ›¹©®*‚€€›Ïö'µ4øºQ·ÿÙŸë☋å§! ûUô— ²\N~ßÿìíáÃÙÞyýë½A"ÇSN®qòãÉÛA= ™[¯P;þÞ)ðFl›¢ «>ãú·ÁÕ‡àˆæï÷ V‚÷Ò³²)0ó­ýä_hsLs7ôïÚçZ`™N• G´)DÀóXª¶í©/™)…¡u†€%†”©RLác¡*ORLE3«’BsaLºùr/WëHûW²¯¡ñÿÝvÁö1iÞÇ$ÛcÀò'ËBLL1¾€è¶}‰ñ²]ÃÿíTÂG`gGŠ†Hxÿ< ø Éý-…zzZP°o@©c{Pª97Æès­b\Ú†U¿‚í!ÜùŸÃÍ¿‰s›ÇÚØRy@"?*#¶¼>F3„\@àçï¶h˜©nb¡E €þWÆú Êð¼¥Ú£Ý#K `akK‹£iWDóO7_ñ2úù5" À5‚y]—bG‘ÖõºÐÔu|ÜĘÖÿ¦GüWÄ„ú%Xÿá2[eê?-B@œ€„Çó±ü8q4¡pO >Ùö)à;Ë>ŽQXw‚;ãù»È’€qˆnýU°’ïAÀxþ¤ì;€°_fª>ä*çv^KN¿eA[*-_Ï*‘•mäÖk¿¤þÁÖѾxöŸôÓ:úØO+äÊè{ÐK‡r›æ£o@¦B`"`"šQ•#À—x/ù¬ÿ¯ö ¶€&ÞeL¢˜8‹ÙŗзB@‹è‡8Ô!ð¿B\1d}'<Ôa]äW´ü3>Ÿéø¨ (à™ù›X9>1ÏãJÅÁ!¬’të/cŸÊ-:ÁÄ úøãküÏ,!÷µ!p)˜"•i0ÙÇ^_# Ù1úÜ*<摃©O™U‹x_:>eZ‚„€Aj ”%³D2Ǭ]ƹ8þ¹Òê–GZ¬ožíÙ.Üjw+°þ#VßiB@\ Jø³kf¬ ëþÓòK¿Gkþc(9þì—ë^ª>ÆóCIÁ>E@‚=S“CQ@¥}ŸÊIQ|)rõøp¯¾²á$«ƒÿùJ•Ð…Àt"ÀyÀúáׯ VFßd¸ÎÃ;ë ‡]Ûúi2§ÕZLRL\“ªBBàM(ü3^¶Õ†¥­Ñ´<\k °ªU1ùnã;ŸŒëÍ_é“Bà] •ñøâbD6qÖ ðS@Öþ„ü0÷7©”lÁåç±'AÊ÷’¼|¦pï¯üš_ù_¿ÞáÉZ„€x/¾zäD@H%éˆâzsðP(À{«yø»ðR¤!NC§ÑÇ÷G€)ÿ %iA{©ÿ¾xQ°=(v0wìÿ4¯iB@\¾NB±ïöŠ‚ÛpkÇ9ÊÔrtŒñ†nüþ©|lb=‚f»ïýaiPÐ?ÙÇÅüï¯Zfý^L; í¤{͸€› Ü<¶¥ÒïYó†¥LÊ–² 6Çþ­E\ÞWÇðÊWàÊêB ¸ø®ÿUhó+5¤üƒîI¡n/!übÎɸ! „Àu"@ÅâAÍË,BÙÂÖOHúÜÍ™ŒG=%8C}s!˜‹j²y!BÃÿR €ác®; ¡ Àñ–k q}ùbÅòˆÅ¥ûV¸,pU ÇCiÝDL#þ|ïìaFÒý4>ªsðhA[׆¦®#Án¾â¸Ò©¸µžÃêé‚_#•P³à,TFL!£oƒ±/õ­L½U­7ì»ç»ö ¤\w‹¶>€÷'èc_QU@à!öð“å,㤈x´#ƒû*BžÁSð·ßïÚr:f ɘ­¯d\Ãáy„È 0í5&Á|ól]𘔋)À$¶ªê4õp¨u¬ÚpóoAà/!Ž/_m ŸvÇt‘üO‹B`(HØ ̺‰¸8; § SpÎÏÍ€<¸OÂ6ög-4Åžäÿë€Y×#E@ €‘ÂîÍåp.4úâ2Pø/#§6Yÿ÷Šöt·dßï—íe¹aäáöcr/s-#„€B@LÎ6гCž•!øc6Jò`2`žsP(#À< ×XEy\#˜×t))® H]F .\ø(ü÷_ª!'wÅ~½Wµâøªpÿ×"„€B@7ðæ/á=xXiÛ#¤ÜÉWí”L幌lZ„À»"pLÓ–@! @ šÃ+Œ4el”1*C­ŽñÒfúž£"„~ÿ¹ÜÛð hÊô?F-©¢ ! „€ Ì Ð€Ð_@(ÀA¡ìÂÍ–Åc› =´Ë 077w–åé¬c—¹œÎ¹¤¸u !œð «Ý¶—{yûê ÈÿŽ*öªÚ²}ï¸Ø¹Ai/•C! „@ðÀ<ó…£VϾÜ)X ‚ÿ‡u»»¹d‘HÈ"¡E£a—&0xeW‰„€ø1¤ø1„†ü}$áÅ0dÜ'åv]¼°ÿß¡«Z{¸ÿA{_‡_bÿ¤´²ê!„€Bàæ À!ȃCź­,ĬÑl»ÔÂô ‚@9o¾ &áòl^+J0š6‘,6Ü'ú®´þ·ÛGþW‚ÛÿA¡j/ŽªvPiZ *¤˜èG@•B@!puú³Ôæ Î5fí Ü´ÝÃÜÿg,“NZŒThB`ì`ìšLg#À÷u©zòˆûÏ—ª¶}X¶ßî”í°Ù±m¼À© Ð"„€B@Gaƒ8éi»kûÇ[)5ìÙN!† „€i¤üñ«è !ÐéðIÒ$ÔuƒÔý² ½ŠBØ.A.…ûž‹ýïX éÿèP®·­Á¿÷ºñiB@! „À» ¤±pëØò˜[DBs–[LXBÝüü¬ó˜™y—Kê\! FŒ€#n€Ó·‡ §Qô4(ú|!”í»x9·áæ_DÌÿ×Ovli{žÁ Í}ªzÉÿb¨/…€B@³à¢k/Á'ô»§‡¶ÐÂ0Lÿ·×—]jÀ8B"áÐY?Ô1! Š€k˜p8L·†âªÖ0.Òþøï¸{l „ìåÁútM¼·‘P‹B@! Þ¾á< Ÿ€ °†í£JÃêBæá0ïB á½úî×Ö/¦V î#Z…€j¯0P´X,) Pø¯5šŽ—®ÿ‡ˆÓÛYO±ÿ­£I¤hÓ©XB@! Æ:¦ExF-„à Pv‡"á9‹F®ÒŒES½ÇX†~SÝðB¤¸ž¡éKjí¡ßY7[˜òï(_v±ÿ/÷ ÈÙ[´¯óuÛou¬å€! „€B@¼7ð¨`}CnÓŠ'û%[ýaÇré„%âK%c67ÃŒòxoŒ'ø‡  `ÀÚW €€5H$a‰š+–Š`ÿ_GnÞj½‰µe%XþŸÃE¯ÎØ-B@! „€¸"œQTð'Ieæyx„æç m] SôŸ››»â]ôóID Ù¤ÚHK H­Ñ/ ˆ¥`»­H~Z¿âþw ¶ƒü¼/JV‚‹^¯bÏßJJ€ µ›Ê#„€B`,@XaÄBO 5 ?=°ÍrÝ>¸½lÙtÒÆc—`,ë¦BßRÜ´ï}a)Þº›û!8psðNÔ•©è ´*öÿ탲í•êV…&žÂ?NT]U! „€B`”ô¬ïÂo p€ÏÚ+W=B@’F‘€Z„À  À Ø— 0Xf€P§X™AP´3Îå.³·&^ÄÄüoÄÊîü}x\íù¼+Ò\€¡¾B@! .ƒ@lvÆîÇÃö0·M¬±hÈB¡9ÌEfá{(€Ë`8mç4 )ÖèR¬AúÅQ@0Û%P¥¢¶Œ»1hÜïm­Ør&e‰hÄžî•, ü,\õ 2°Ø{Õx*ŒB@qCDiúæöËûË ŒÛÒ"æñ¨K 8 å€!p)N#2úÏRŒ¾ Þ*BÞ‚D.@`vvÖâüéñ¿ŒZ.µ6¼­*È`îzy%`¹A}%„€B@\„@‡-¤üËDæ-›ˆXž‡™TÜ"‘óDô„).ÂpZ¿CZ¡ä‹ @ €`4ÆI§€U—û­`K¥æ HBûÏÛ\þÿ§Ïîظ2ß½²ù—+Bð}Œ½.+/ðhB@! „À"@WC¬ÅCö«ÍE[JÅìƒÍŒ}ú`ÃÍ=S ýÖžªEœFšxžeÄŸ¥mœÙ!à €Ñ¶ËXÝqwÌÃë†mûTË5+TêöªX·ùú¬í4­àdÿ3¹±ª¯ +„€B@ Jõ04äb!{¸¶hkÙ¤ÝÛXBè᪠Aœ‡ðOOD ÿCj1¼ ²hò°v“`ø ÂNp¡Ž$€Ê0üvë;’ï_ƒÇp€.¬ýkÙ”}ºÙp™jˆ7:V‚ji§£x€±nl^! „À#0cIÌ+ðo.ÿw³qÛXZ°•LÒÒpý§±Áþeù¿ñ¦ó €kC)Ö ,:Šl— ‰J€^Èss K ïÏݶ»9ÛÞ/Øq÷±=Í×l©{JU³Ã@¨E! „€o @s>ÿVóÿùzÚmfm=—´Ï?¾cÙÅ$æ!·Îâ<Î=´‹(—ËR\о“` ÿØ-åðcéûó ^+_ÊÔÐ3$€éI X@žIðÌb(®Èà<u\! „ÀÔ"„L¿„Ô~Ë0*d“[^Œƒñ?yEdÃq#÷W-Bà’ÈâtI †ušÃBúüû¼¥ƒ@çã¥o.Ùx£`æ¥f~i±c?½¿f›K5ûö呵ŽA xlOÀÉRèöÇä·žÂKÜD§! „€“ƒ@ߢÿ1Üþ?]I9¶ÿ¶–ìÁÖ2„ÿ˜›WPð—Õrš|5A€ËÌ2/sÎ0Š;÷ ˜Í¬€`¶ËØ”ÊK µX¤káâôæg­÷ÿ(4ú{ <¨¶Àpleuö¢©çÙ¸ÜøQ)nâw¿Hðî°éç ‚Æ~|ÌðÑÝ®¥¿w/ÛÜo°ÌAÕmkÖZVDæ“7À9(ê°B@ D oõ¿¿?»“µ[¹”Ý^MÛÏA$œ‚ðŸLÄ\†! ÿrýŸÀöB•Îü÷‡PÝ‚H°ç Õj!…[Wôlk—q.ãõ¢‘°uC][ʤ\H@ Zþ•ô®•êm„t-јAfƒG€<ƹ­Uv! „€ï‚@Fý„û4k û»µ²`›Ëi[]J["udÂrûDuîiÎPœ>EŸ‡Œ€Cü‚ÛQæ´` ¸%}õ^Ðiš{Æï%âkµöáVÎÁîûâ l­î‘-5m§Ñ²=¥k}/Œõ#! „€cƒæQL>áß™„å0¸¿ž±ÛkYËÂý?ŒTügÀ  E\7û‹¬ý>#ÞJ0â8ëöÊp*:vU˜0†0€²0CÀ/gïYµÖ°ïžïÁ e¯J D 3@£cn¨–#ÊU!×ï…€B@ö ð?/Я¬:¿Ÿ~¸e·ÖrÎX@ÏA¹ý³éÆ­T}€„ÿ5œ£kŒ3;:I®2â]»Lôù2Gö^¼ÜC–„kß>/‚`D?¤ ðŸmÃ# gG„*'„€B`:ˆÁò .ÿ‹Xs‰Èþb–ÁšÂ¼ Ò`Zþ%üOç³qµVÀM zµkJp5ünê×â¸)du]‡_îTDàâwkíØþéO»vTªÚÂ7ÛÝ.Z¡Ù±o60ïˆù“3õUBS! „€áߌ}·r+ åÌnfí'7áßâBÂÅüψðo\Zt,Ê9ÀòjB€V“ 0XvhʤEû׎‰ã±¬þ=§å íO¡T³½|Õö 0‡IBÞö¬«áúÚ[@B@!0dœ`ֲѰÝ[]°u0þßÛÈÙÝÍe—)hiƒEø7ä6™‚Û!  „þ€µ³kGl” ,IIí ŸÜã.˜¬ÑêØn¡jÕvÙ h›íH'5O€ª$„€SÞ÷qTôQ,d›É¨ÝÊÄmsiÁÖr ìþa.@Ë¿! &)ÖÆår¹/€zÀŠ¥âL(TDÂa£ÖŸ?4c÷·–íånÞ)žÕl»Ò´Bµe b bÀ }T-! „€˜X@ø·š³Ï×Óöéí%[Í$íç߶åÌæóE8 bþ'¶õG^±££#yŒ¼Þ,€oâ1ìO~‡ð·¶¿¿oM,Ã.ˆî7½8bÀÙy›Á¿T2æ&µzÓ²°ÔZÇÎ`¡>c!„ ”ß‚éäÑ}ëB@! †…ÀÙÖû8ý+þ—#s–á_¤¿Y¬édÜ’ þÍá½ÏtÃ*§î3mlooO[•__)†×D””Î^ß’ jX†W,ÝIxpÀô€LH«ÀÏ>X·ÛàÈ>;@V€#+Cð¸ÖõˆšB@! üi¦¿EÑð>Ÿ·Ÿ­¥ðÿ ¬ÿÜ^¶(ûã±°'üã ÿjÆ + š‹¹\Î'¬fã])‚Õ~N€0y«]¦¢4ôˆG£‹ô,k×J­á»¥ºÕÚ–‡ ÔîÚ1¼ gë´¦.UR! „@ðð¥y¸ýS²ßJÅì³;9gùÿðΪ}xwÊþ0ÒÏ‹ð/x­7q%êv»ÅT*%@ÀZV €á6È€Zö­;áŸG …‚oÁ£Ã@€J€^îþóóŽ€>+ÙtÂî‚0…ìTôzm«u»¶×arÿ‘>y|‡QLÝC! „€x :šö, ÁŸ©þ2‘yÛLÇme1i¸ý/$bNøAøçû^‹¸i È‡B!ïÁäÃùzÜ}T{CA@ €¡ÀüN7éåóyð®k£A€ÆZÈìßëÚ&{G%[ö°jûuVzV„"àá|4EÖ]…€B@"€p¾[x‡ÿ“[‹vLÿ·VÓöùÇwÇO"uïw ÿ$Ö"nãããR$¹éÛèúïØ0N¯T*°­j£CÀã#  kÙÅ”…ÁÀ"Bøø¾fª¿õ\Ú–±&ãáßÞåZ„À°€ F¶)-ÁB@ €`µ‡+ <ŽX,i  !`)‚⽈-.$ì#eOøl¯h pµ:¶ …Àþ1ù¨𽼦,UY! „ÀÐð,ùal~Ù¹„åÀöÿ`=cw7²–I'- þ ½xºáT#@x› Ú‰÷§›QV^ €Ñ áÃ_*•¤M»è®§ ‹` ®[ÌKá/>™1`Ó¾yºclwJMGXht ìfð Ð"„€B@ ¸ô§`ÙáÿWV-ëÿO?ز;›ËÎ埤rûb{èV't:Êɇ×;š,¾Æb${RŒö‹o šSµ@ àÍ9O€\°~ºö`ñÏ×Û¶ o€&„ÿC“î*¦B! „À„#àyÜE±¹ O½4ÜþiùÏâÝœá_2¬>àñaøž„ÿ \=–/(ž€s“_Ip“è^þÚ~p[xHpyìt昛›C aÌ"𸳹dÿ3,GÅŠ¥¾|iñWEËà  WmÚÑ 1 ÿX©€ºB@©@ÀsûGž^{ Ùÿx;ã”òàòÿ'°ü§ ü“¿'4? ²?®ýó§U2H´ÛíZÊ£²xHœ'áDZ‚@pJ¥’>s°üÇ¢a‹öBn2Å!_LÚËý’í—뜇XÞG=>ÊXOžhA(„€B@\+ê±."Õßmý‘ðïîzÎ)èãѨÍCø§â^‹%ð¨µZ-¿šúHŒx+Àˆ·«3T«Õ·Ž¾˜*à\ó"„æçœka§Óµ[+‹v «ÿn¾ju„,Âà䀯: à£Ìßè‘Öó#„€BàjxïÓ86@ø·•ŠÚF:f·WÒ¶¶”†û1ÿ$üó,ÿW»—~-®Ž@³Ù¬aå…Λžwüê7×ÎE@ €s¡Ù½ÝÝ]u†‘Á¯ÿTDÒ%4?‚À°}þÉ{ˆìÏwŽ¬Ù>¶çùš½(7-=Vƒã½ˆ R}/„€Bàr@¸_‚þ³Õ”ýôö’­d’öùÇwl †è‰ðïr0ê¬á ëéÍåšÁ}¿gó¿Óöà@½ê%/ÓÃR… •¸êµô{!pPhvÖs-L&bŽÙr°F4 ¨´Ž-]ïXá%ÞDèšB@!0eÐò¿†Œ<¹ðœeAø—Ù ÿ’1þÅŒ¡z"ü›²‡"àÕ-—Ë…ííí³ü³Ž¼6“S<)†ß–|àéÃÅå̇?“ÉÌ mÆËP(ô¡wšþ `"À‰½æ°]É.ØçmÙ½RÕ2OðpY Š€o+ ð ü'OûÉN0+¥R ! „€ ý)#6Åáu·¾h™DØ>†õÿ£{k¶ÁŸz$ü¦ÁT ý]M}$F´•`DÀ㶃¿¿ï¶ä]—`t £;_¦ŒÅ"Îåp!a–« pô1àaµeûÍŽàÐå#ï/})„€B`ê ÿíëɈ}¼•±%Äúp{ € ¼CˆûŸáßÔ?$ÁàÅ‹ÊÀ¦‘ xÒ #¾a»±X,x¥S‰„À)f11éÍš›€Ä¡  ƒKn1a÷W,Uª[™@Gd•ãcÛ1 §í¢EÃ×{º > ! „€˜z¼÷d ›b!ËFCv{1n«Ù¤å  Û?cþCþ©Œ×"‚ˆÀË—/ ÊÆIŸ&~i$)Òƒ±ÿ=0f§h*‰¸23@*GH@Ä>¹¿‰IÊ‚í–9à±e«¶WmZ­Òµ‡G ¨÷ÀŨê[! „€˜j Øo ÞÿØLÛ=0ýoaýÅ'w-ŒîLÇKáŸï`-B ˆ þ¿ƒr7á;ïx«2Qe’ €ÍÉ|™P°h*’8NB"áYäž³L:é<8)YZˆY¥Ù¶¬ÿɶÇ]kâ]ÐSzÀs±ÔB@!0ÝDñþ\œŸµ,,üËx®åRP¬§l)³à¬ÿLõ77ç‘ñN7Rª}ØÙÙ¡@KÀ`ô 2¨ýâ>­ÿ%ÀY¤£/­J ~†  ×‹ØâBÂ!EàXŠŸì¬qܳ<8ž×À E€ãÃœÁc?Ø ~äúúúšð F=ìøû'—V›œ@¡!0 °ŸÙ×OUîd,>Ù9u‚>Þ(n,†Gnò)ÿ>Ì%-‹¸ÿ‡›9{°¹åzÂÅüSøŸ‘Ûÿ¶….~-À€“=.þ Â­¿º/þøç ÒîM ÀM zÅkV«Õ.Òf¯xý\ŒZý—‰‰æ1Q©Ô–ýá•°[nX³Óµm¾8ÜS  eÈô¥~7‡Ä>ÚÍ[Ð]~öÛÄß¹xº׈úôI_çeûýý¤{c‡û'ýþo­K½{A® ¿»‹1ûüÞâýãöÓ6íþ­U÷N"óŽçöÿ—Õ©B`DìííqdñG{Vi.úî¬óuì Hpð®á§þÃέ¿oЖYË5\_—#A€é9Á¤'@"u“•E­¤=bË„,C ÐBV€zðé—'À͵U®ÿ†˜g¡œÉÀÅÔym Íæp^^;­Â4f¬ƒöéPPPûÜ\ÛèÊBàº`?eí'=ë ³æÑŸB³¶€±™ýº‹>~ŒµŽqx‡JY«÷W¯Xø€ÿnq×íïks½ôÛ,Eì]Äü³}–“Q'üçàA—Bª¿X4…úÞ§3¯õµ×[ ]M\+½^¯ytäA_t]„¹è}wÍHpÍ€^ñr'ààà tÅkéçB`ä0>1™ˆZiŠîm­8¶â£bÕ_<³ôNÉŽmë–šv„ (¯gš#/ú€ørÁÿ1‰ü4±[PÊD!,Æ#†€P@Ç?ìí¨uŒô=Û¦‚Æÿ©ûýÉ0å>éAE ßq!TÞÌÙÇÙ„¥"óvnå·¥…ÞZ *û¦õ°T³ß=?²ÃFÇ øýÿÍý^]ÿMH®õÇe´StÞþé­¬­‚íÿþzÆ~öè„ÿ¨e’Ž_‡ÊZþ]+ðºØ "Ðív_d³Ù™J¥Â»ø#ˆ¿½Á;ëÒ?†€?†ÐÍ}^pÇáP¿¹[ëÊB`8Ì0Šp€HØ £" S¨Ø“WGvTñ2ÃÄ«mËã©'-àë÷ÃpÊ7=wÁ¤‘•íO9‰ŒÃÜŸEj©5¸™& §!‚ƒbÈ^k°þ›µº]›s=/qƒk#^É SÓŸj*Æ ¾H™~ÿìïiôíÕTÔa»·¾hn­Ø”€•ZÓ)RG%ÛÎW×OYZ íª÷ºàrñÇfõû›|8BÏÀõŸí´™KØÖrÚnCp{}ɱý“\—átZ„À8!>³—Édr°ÈþäÁß~§ý!" ÀÁ¸|7ÇÖïþ–§õ7³Å-B`ÜÀÜ‹—&.Œ©Ä±ÝY˸ÉçÎQÕj°>eá p‹Ó6¥N×;úÛq¯ü(Êïæéøã0(ÝJïCÈO‡æ,íV_è_Ï$lci| ó–ŒG]*Ç¥Å:>ÏY¹Þ²½bÃöÊM«ÀJø}©nÛhC"¨²ÔN£h]ÝS¼‰À©þNq a=ëȃÀ¸¡?2¹,ÜÉï­¥’qLò¹Å¤S 0•\cp cÀ1¼}ÊPìêö)ú{ž 5+ ßס8„BÝþdÚâÆ€×ÝWúsyúm‡"æC(co“éíuguÑ6¡XZLõytàö/¿Ëãª3ƒ@§ÓÙ …Hiy"ë¦lÓ^)‚ñxïÔ² mF{à£v…ÀX#@—ÅH8sÂeÈ>Gãï4ìé«C«#=à6&™Oòu;¬ô\Š@¯²ou‹±Æ`x…÷%ÿþÇ ¬ýá꿶µ ýŸÝ_³¸•.eVj)íÚ%å'™ud!ù¤X±z£eÏà©ñ ÙŽà<óxߢՖ•( `õD7ƒíWMí5¼6Ö„€À@Ç8ÆÇ[1²Ç'Ö¶Oï,#wü"òÆÇlk- ¬°ËÏ-­ÎìÇ=÷ÍVÛ>¸»nfË^ìæm{¿h‡׊|»c¯à­•o[kÓ…k¡¯»-Êàoýâhû ±0æ’‹åÓå”ýìî’-/&ìx?®/g\;QiîÅüûíü—שB`Ä´Ûí#V^frp™sF\›Éº½ÁjOv× ~ÿûߟÀ VIU!ðŽµÿ9Ý/@Ìå/ÎT떃ţ TÄ€™zÛèLH=¶ëïx§):sB’}qØd0¡ A ›ÿûÜGéþ» Ó2¥s˜d’T*ƒ4éTÂÅ–úäRTpN‹´¬ k` Š^zʺ—à m@€50E@‰'–ÃÂ\‘ôGkBÀõ1^ ;Üï/qôÉúy‚d\qZý‘6n}= w2ÈgÓI—7>þN,û:]Ê©˜u#,úp¨ÿ¹ÙŠ¸>߀B€£õ‡.dh¾ Yã3HBÛ+»¨®<‚üÂh¬öÛär[ŒÏÀ ãmÞY¶Ú,ëÿ¢–€G]þ%ü_MLJ¥ÒS„°p üAbpëï³\*)FÛ¸ç=ø½~ø¯W® úméî׌ybÑ°›Ü¬æÒö˶,_®Yúñ.&;G0í+¸‘|ÎMvÑMÎë)×\¶±½œ›ƒS0èÙ2ðýä~tõ§;éÝ•´%÷úRÊ þt^ɦGFÇåß)g¼¸azi$@Á¤”Ë"„¦q\Í&­RoÚ¼5žî—¬eÍ7‡ûŠ›&Ú§ê†+þåU@h׋û¹ Ùס¤ÃÇ ÛLDlÛ‡«iÄøG!DÆl.ä1XùéêŸNß‚¿þ!è{)äx1wüA(è@ÅÀÚÒ¢ ªÖP $¬Úï÷/K jÛ×{E{^i¹°€ív™BX(\OýÞazá;ÿxnÿŸ¯§!üGíÑíœ}rÃþ-$ã}áÖ)i.¼ž¾F)ÍáмãÔ…ýbj6ö’`ô ÁÎà¯,ë™LfZ³oÃáðG£/¢J ®N>ãpk솩˜s1Že0Ï7šmÛ/# næ¯ TðÊð#NûÝâú 11Wò&ñnòI<·´ö3î7¡à‚Oï­¹IåÚò"„”›àS -€þêCB 1Ñ#Q*wiÂè¼ ¡ ÞhÚ6BâÑ=PwÃÜ‚gà±Qíҽà _¸”¿õ¯ª­WC ß×ûýœ}¹âW Ð»‰ÛR*f?½¿jËÙ”óìÙXÉ:¡ŸŠ<*õØÏýô¬î§ 3kst–±º!o|F_nµÛÎcóîaÁ²/ìÊÚ:,z Ý*Aø?‚¯bÅyl öùÁýS7šúÞ8M×ÿ†jldœÛÿ ed•6!´ßZ„À¸#ðôéÓÝÃÃÃq¯ÆD–_ €á6«ÿVôgí§ïîßK$ÀWRœ†HŸ'o2Š©&&¦ñXUš±åLÒ‚¤*]¬[V¦”x¼ÂD³‡ïiÝžj¹’£Æ©ÜÞ)ÌäבÞ+¥J–Lþp#eš¯û°ú/ x1þ´ÒêO’?Zø8Ñ÷Ý}Ï{–èòKÈgg½I(rùºßÓ%5»Ø¶­FÚà%ÐFû¬"4€da;ˆnàó>ÈhuÍ‹aÂEüQmÚÛï<°u\œFàŒ¾Îžxîâ éIBI·Šþ‡ ¸–¯¼sпWú ñþT²†À(ÿ.ìñ—¹Ì!¤€÷ã§Æ £ÍVÂVs-ç½Å° ¦ ¥ð6Ò¸Öµ[C¿‡¢€ý¾Ùõ®ƒ]Ûâ€ã7Ýþ?á_ë]ð4lä¼1: NJq¶•äZ„À$ ðÍ7ßPÎüÕ¯–?3ð?k;d¤2à·»ðáÇ‹¸W¯×8•>càçÚã'›t?O:Šô€Ÿ>¼e+Û9(¢bßÛ22¼"}©áÅ™»ê^ØmÆ+½«:g‘¯'×ë`ëÿ &‘tÿ¥Ð#k)[Ȳ°€ÿ~ þÂ}a€Ä_þDÿÇnéO…݈™šÛ­µœ51Ù.W@IDATÿø~ÁJàq8,Tí›çV€'Çw»p>¨ºLÄ ¿¹ðóécož¡OB`zðû¶¿%Þþ2„òOaéß@Lþ2ÖG·–Ñ#p÷OØ B©èÕ“„PîÇø‡¡ "ï]ûú öTRyØÅ8°-Þ‡do¯¸°€#~‡~_B¿ÿf§`!ôý*úüS„qµÞèæÓÜïý¶ÄVÿu¼ó~¹‘¶ðÎÚ\^°_|z×ylì/å-Cä®Òfƒí§}!0jþð‡?4N•ap0xc”8už>Þ0RÜ0À—¼¼ß!ü­U«UyÆ‹åååK^B§ ñC€–Ž0Ö9XškN!µ wÒ%Ä°Ö@6WÇD2IhÁuX¡§ùm1É<­GsXpý—UþK°¦aMZ»ÿ:ýIî·¶”b%æ¹ûS7¡¤0ðžÛ)žuþ´R%ãž{ð ÊÁûEæ§! ‚Ém¡Ú´-(n˜6¬ˆ´Ž´[û%æÏûëgB`š õ= ? ¼~GÿK!µß2½z@ê·²G__p}/ ŸepzP™†G…v.×!DòôÒâ±9mYT2K•…2hý!\„´ÑÑ›èón 8Iè.3µbÀrm“Ò6¥7Çkz½1,˱â;ò0¼ï=µÀªâFàücg €š €1ê])FÝgß¿GÒŒ|>¿wö×:*& Ʀr2É%Ò©GwË ¦úÌ«¼s+/25\L1 NštwrÎùªÄ¤‘ lB¶ÑÏíÀ–1¿Ë`‹NÃx–¤¬sYàFREºùÇ[JWRßštÂËÁâðZérd à}¸Ð5xɇe…µìùAÅ…ìCHøªÜ°"~‡èT­_A·ÑœÀ§?Ó‰;•ë36ÝÆB¦í|t4äRù­AàÃKjîâèçIXåÉéÁxñ8ö)œSð§¢îºúúéÆð¯;‹ûгˆ÷b±ïou­’Àµwà…TÆþ³ýŠ•°‡° ¯B´Jeà±—rÐ]wÒÇo<Žoë¨Ðy%í£¥¤e1f~¸•³‡·–œÒÛ/úmçÿN[!0! €Ã„¿²Vn´;µõñ{-CB@ €!}ê6|ØÝÔ[ÿÁ÷·îÔJ¥bOž<Ùýå/yê§ú(&N.9r„U°d1æ´ æù…ÄKgQÞ‡E¹ ËR±ÛqeïuòF—™,PÜA¡ÚÍ 1œ±%(Hî.ÆlÂýgw—íÎzÖåö¾½¾äât)Ä $pbÎIº‹ãÇï(_\÷ÂöbÑrÕKôÀ ²u„otŽP¶"ˆÂ ˜øÿññŽ# {vPFñŽ…á°O€ëE-‚?ü¹ýë.¥®'‚Œú€ëœ¯;hÿ ¤Ezö|´’rÖþ5Äõ?¼½ì\ñi-¦§Cz<"OüPø 8_H¿ÉZó^ èÁe^F è@1{¯XA(€×ï¿z²cùRÝž [À!”‚s»™6´Æ‚ ÛØ9Ù¿ÉèÚ®Y½¶¥—Û]„müüî’KËøÙÃM{pgÍyN1üí&7#ª½n+¬Ýn?&ŸŒ™§Ñ˜äžº®ý,@°š†âdýòË/ËÁ*žJ#n¡ÚscM€ì"âÍWáòÊ}’Ì­b¢I×Òšnòžƒ'ÇAZúnÃüð©V_,7÷)°rABAôodkÁ˜Üé ßSÞÅ †^ T6пaÜvÞ v­v ÀX°ãM^`—Iê÷NîGøªxm›Â¸Ìð ¶g+yYb4¢ %üóAÐ2‰4¯ÑÌ^¼xq"לª'kRŒøS·ì'û_|ñ…{Gž:W…ÀD#0‡IQdsôxpklÖa䞯X4ôÄr{e;ÂDò bÒé-þv\aÁl±?ad "˜€IãV2l¸~r+ë~N·V3ÎS"íÿ(&Ì¢à±tÓ8*€óx*pf`Ádê@zs¤‘Ë:* åªý)Ú°÷ৠË#àñ¿ß)Z©Ä°î9Â@´¥ °uÍ:îm;®Ï¤Ê}-œ¸®ƒ{Ï6é8>>€•?‡~ÎÌ Œ'GúøznÁyò,!ƒClhé§ÐOz0¥ß¨úúY¸°š$±ãxDå-Çï8\ò¥ªýüC„àñö‘À+€ë¯Ñï_ߥ ,<²ÀIëçlﻇwØŸÝÊØ:¡÷×3öóo;rVzNQY+áÿ¬§IÇ&(¾Ç8uºsó³¿NJUDzR«ÙüŽâ:bgNŒbÁ*¦J#nZ·f1é¥K;;'ÀdŸÿþÅ¡•c¸•ÂÚÜÅ»eÜ GÞT9º1‹¦ðO‚¿Œ "Èíµ»`ô_ƒP@²¯­µ%×6ćB@P¿,,׈!ÐÐ+ \©ÛR¦A î”ÉXí;gÛE8Ï0¬cÂÀ±cÛA;ÝÚöDÇss›®,n öm*´NzÌpM¢/B8ÌÅC¶Š>~kei;Aî«?3l0¶Ÿ}‡B5k¾Å=(}ý4`,³pL¢Br JöûL1ïX™)ä–’ÂÑÁ¡ ¤ÂÏ)ýÎXpºú³Lš`è)18$£ß’rLï ?GÂMd IBØvõ¾ªZVàõSB¶ƈ] âÛ7[  ã; ×Ñ–Œ]Y¤gÍAøÏbeøš#nì{mMZ¿Ù8ú$^#ð»ßýŽôÿ§ßÎþgn÷_ÿP{CA@ €¡À|áMüàŸäîU·wxxøßÓéôÿê©­˜F89f(À†U¡xúêc쀩_#-züø}[/ dYЖNíû €þ=¼µln¯Y JÖU„CÜtÃ#€÷yíûï¿÷_ÐìÀ~'fÉ÷G\Òé½½£mûó:;^©Tzû·»ýgög£-¥î.€'ô"§àHeãJWA¬ôáfÆ2°a)Ž"†”äq¯°Ž&€“A°v¢¬«˜è‡!ô3Ç÷¬B Xþ·@ò·aa«`ö§UŒÙtf|?W*8¦eñ„Ö–iünQLîççáòážJz´á Ì°ˆ¥tÃÒÀ¯†°{źý^e´ûhÿ˜ ÏPÝÅõG\# çÙ@ŸÎÂÍÿÎRÂ>ØÌ"Å[Ôeì`¿¦Ûw‚¿gí§ÐrÏ÷´Ày}þuŸCçXN% ±j´Z®¿/Añdz>„ åî+lPþí9âWŸ,p Çì^c3Ÿ)´?Ýþ?€Bwí}/·Íå(}’.¼#¾«f¡Ð"¦ Z­ö÷+++¶··7Ø3¹ïö·ÓM`ê+À𛂽÷ö{óÞ~Çð;…Ûþ—ÿò_êÿâ_ü‹7ÏÔ'!0¥pòH×ñÔ,-jaûìÃÛvk=g¯ö ˆïÚs¸ŒnÃrT(#n–%ëG‰ß8\n’‡nÍžÛ®@øÿ±ýt÷ˆ_Ý^BžoX QVº³ì ý ¯³„£N¬Û4 ÿgµ -¤ÌéyÜ´R8¸³±ìˆ $$·/vó ¬Ún¾lÍ?¼„w@9Å~Ï'>ë:&®Š€gÉÞ‚àÿÄ+à#ùSäwÿÈިȣðïyœë7û5öùlkyO`nþÅ“=6í›ý ¼ƒšVåøl=qbXc}êÆûB½O…ŸÃêÿÁú¢m.¥ì—?¹g9¸2#=>8ž³ŽZ„À´!€€¿¨3;¨¿ò0÷¹ø[ï“þ)† ÷7ãƒÏ7ÃE¢÷ÛßþÖã»2S[½Ÿ>L+œH{댋§‡ðL—q²l×Iˆ”R‹`çt»ÒQ…Â\8ÁcÊ/ÎóÈêO‚¿ ÿå8„|X‡ÈM‹?-\+°ú3/6‰ðb`ÅwÖ@þöË7N—&†s}‹ÓeÑ}–‹“ëñ§Õj[–Õ&-´3±ïw, ¼i‘­âj7†@¿³ÆÑÏSÑ¥ëOï®Tìy;¼“$ü]Ü ìïœÍ!Œbvَщ_"ÞsJ>öm*T8Mb–†0]è„Õà PHŠ€~Wã¥nv¨çÜB>—¼rðîÊ&#Hi W—Õ!éˆ9vIø÷ÑÒv€åÿÛb±Hmüé^ùcŸ§®‘ÔYBåH`¿ð¦~çà–© ™~‹ÅþôÂ_éK!0e!ž“E.dÔþäÞš­çR–yyd-Ä  xÖèÙ\ÃÃ(&‰×»`öŠÿYtŽarz'˜~ü ´ö¯¤AòqLÐkK‹Î"´Œ£Ìá¾Eг$^o™&ëjƒ…ZVi]ãäz ñÕ~FUdQx’À´ù“V¿½' Õ&ôV>—‹°ð®gçþÎtw|ù|ò»Áç6Ň2xÐB€q}fŠàI=*U@|É@Kûgð¿ üçñ~ !@Ûaà×hRÖ¸öqþMôøÞùŠÝGKIÇöÿèVÎ>¼½âÿ8”Aþ©ØÕ3ð&nú4]üæ7¿yú¼·áÆy†/Éòµöׯ'ÿú_ÿk5aO&‡Ž’ö},Dnòç‘ûÑÍ·´uLö’?È@ðßZŒº´_kÙ$\A“Žœä~$£ Ê‰¡ƒ7Ûî}>±ˆc¯7ë,‚øà<*Ι!šÇ6?‹¨)64e5D}Ÿ›é7Bàøh…çg Ø CáèY¨ù\ªŸØ{&–Ž=C<•§Püñ33†P¡ÛÅŸ x|Åá†?Ï°0(V«P€´†±¾~Õ1°Ì( ‰]ïc_)éxèöŸŸK ÄôJ¢‡‚„ÿAд?ÍüçÿüŸÛõç›Ø_ë =Æ°÷¥6âoÞo°CøûÜrqŸøá‡î_|ñÃ'Ÿ|âÕ_! ÞB`î÷ÉxÌ ÚיּxûƒB²Ç¶tP±¸‹vÊð À¤Ð[ünöÖ¥Þ<€IŸ'IRÏK3ΟÞÊÚbû³ˆÿ½½žu‚]üi ¤%0«?]‚}‹Ö›Ö§« à ž'c„ï ‡8É!çfóö nø”à*ë·g!€ âx´2óYGúNrzPÑ甑gýDÇ®Œ€ßßggÀ¸tcWAȪô Ø;*ÛîQÉŠ•ºýáɾTvXo[cóÝ8Îb`ÜW°ûí¬ÝÂøòO6Aö‡L.÷Ö3ö‹Oîº .ó©ä%/@Wnj]`8>>~Ðe?þÿôdëôg¿Æç÷¿×öšàš}ÏË~ðùùdE*ÀÃ?ÿó?ÏKëgB`òàä+†'@ÄL ãbœ=ã1מîY!ÆA) sJ{!ãB÷~ºúrbOÒ§(üËÓˆõÏÅæ-ƒkoÂú´µšqäO÷·V]jBÆ«2,Á4!¼ã«|ëO¸Ã°È-B hr®ÀL½¨EÜx+c˜±Ö”€ÌäAOºÿŸÈ˜7rãé¾(ÇQ®æA²Š”ª€ãÊ\r– *󥪪‰×ŒekígI` !A½ž7þ¿ š!Žýð.àØ¿†¬›K ¶±œ¶•,ÒIZå,þýÉê[ÔA€˜§’Qk£­Á Àଋ  Ü‚ ¸€1!wpŽ3ÎýÛ €ƒ¯s¡uSøã<€ìûüÌ + ˆB)óYkÝî UhÜ·÷ËV9àv±f{ð«aÜŒñŸYÜâoÏ*¬ügìãxÈî0ËØþïodí6”¾KðBˆ@ñèþõsÓŠÀÑÑÑï«Õ*«?(Ïøpô;ŸÿQÛQ! À¨}ßÓá­óìÙ3¤ÂîæñÂ˼þ™ö„€8'ƒ´þ»¸{LÐ~ñÉ=6í‡ûضí&‚³G˜ ÂàÖ /X¼üÖ™ñpœVŸeLòW!P®/DíV@ö•´•lÊî¬ç35'ÌûMÿAÁߟ ž.›>ß ‘PîÀ‹Ä"ör¯h Äf/@ƒSºŒ›ÇÍIWD`^D_ßÀ˜ƒ0‡8ðE}¦±Ê`ø Îq74ãYßsó ®-:PÞZ[BŠÐˆ+ör÷È…|ñî}±¡PïX©S·—P¸‰×Lúuš0”ï¨SP2<Éãç÷–m J€Ïݶ[Ë®½Éýà{! ¿öº£.YÃúïÇ[² §åš~Ç n¦¡dRŒ¦•ùðŸ6œî ,™;FWhÓþ.•Jý³ÑWwダsÏ´Q=K@H§•& bÀ%LØ;Ý®Á´ +P âÑñ Rz–=û¥1©\;o– ÿËÉ°-C°²'2>g1Ù礟JZÿ¼‰ÿé®<>X}I1Qç$œí‹tÀÄ=o14dk :@-Bàê¸.ãCž>)ð€Ðã‡ä£NùGßô·^éW¿­®p1T¶²ifá @ϯcŒï$¤"F«5šŽ@pB|Jx¸e ®,°€Ïmœ‡ß—6¸0äkc ½¿r°üSÙ“ÅøO¥/C ü6—²w5í ø‡؆ÌrZ¦9ï³`RŒøþmÙ!øæávpì(½Z­Ö{ñâÅüøã¥DIûBàÈÈì3to¬dìO?»‹Ñš¥¾~iÑ—G–‡5èë rÇ#–ônÖüma²÷h}ñ„Ñ-·à&|+n Wý$ä«&€4À¾âàÉvàÄœŠŸ ¸î‚;:×À¬¾gÛm†z`¹ÈÕwåÔ-Æ÷†ÆügHжrÌöE ¨ K½3q5'¡èä^qlü Ý‚¢vcI™–õ'Õºóx¾[°2”ÀÏö‹ö-Bª#Ã;ì ao"6c àùåzÚ–RQûp+gòá-Œ1QË€ð‘íͱFcÿ$<1ªÃM ðoþÍ¿)ãºoÈ1ýÏþíNË<þqm‡ˆ€CûGnuVgqǘ à¿ý·ÿö?r }-„€-Ã$å‹„{Ž”Vâb¹ærH‚%z~®i/]ȉǶk^±½›°ò|¸•µE0;o"Öskîþ!'`rbÉIŸþ|„ƒ±Çd?Œ lo’²-ƒ”½ÛÕ¶ÍuúQ¡Áh¨q-ßÂTàO ÏØ2ƈuÁe@@çyH”¦åøLOút1 ,‰ñ€žK †mµÛV„8 nf ˜‡—P¹Þ²b£c;Í®å¡$tÊBü:ƒ1ÿîò‚1­ëƒÍe{p{Õ¥™õ=>‚R_•C V«õE±Xd±NË4ƒÇ‹Íó´Œ)Fú©[ú„‡ýŽà;ÙþÅ_üÅÑ?ÿçÿüÔOõQ‹ð­4>1 ™£iÕÔ@”)(Z8¶’ŠX:†«ÜnÁ[€¬Ò´ÑÝ“‚¿›ø!”@K RJZa©¬a~nf}H"#Àl š€¬ò`ÃQ‘ø&† Be¼€¨hrÙ> èkƨ2ÓQTŽýLÝJ…­—¦â]xn$Ñv!dèXJ€¼VªVA¶˜”…xØz: ²¿´­dR–…§GÊcÏíßi‚¦@ÕR¼{{{•H$Nd\âô¾U×2B¤!øçÜÚïotšo¾ù©5wϼvÎïtX3pV!Å¥ À3vÿ§ݶ»[ËV‚èùΑ³3­Sîtñ÷Ý<9áó­þspùÔL8ÁŸ`ÆIþ"¸n-Ùr´÷Þh­mÀÂöó‡Vw@„ÀåpÝ©DA0¹ «ð-dá8!×ÿËC8ª39þ‡1þS‰Ëm BTßÝ\qe¼¾{¾gåjÃ¥d:Ñ 8c>ÿøŽK)Ë,ñ>Ù«¯PU]t_!t¾þúë_oooCö–àï¿€}Ù†U<ôªM\ù¤N“úâÌíÒÒÒÌáááÿBÀÿ-8EVI„Àx À˜ÍÙYXð1‘çÐ ÷ðë𠵘.¢´ 1L ÷º•sÑ„o<Ú—íÄ6¦K6cukHýAûÂ9›­ˆÕŸgŒG}TÊ`!ÀÑ Šg,„q!FÂI„Ì>ᇫ´*Íi86p Â†Þ`tâ6Îô­ ûch D[ lÁ3€!`äXà»ç)æÿ4¢ú,ÎFàßÿûÿ¼P(œVø'ëEì#€­£mv†Ó³S;½„ÿî“'OþA €Ñ6˜î>ÞpÂN/2E3;»_³ANôâˆ#çdÖ~ þã×Îl3r>0SÓ€%Aä•‚‹/H¿­À?Z„À{ À1c‚㞧2ƒ$à]’DˆCf\À{\T?ÞØÞƒ’ã˜ãÌ6À÷Òju\fˆBÉóší_5–n—¬tÏNÞ#tÿ„çù­ÿrÿ¿$€:M©@à_þ˹S«ÕNË+þgn¹œÞzGõwdH02èOnìwŠ“ØùÿÛ{(MªòÞ»ú~ïž+sP@ áFˆ2hHˆ‚âçgŒK¿rbÖñ(‘¨`VŒŠsbVDß’p4„hä¢(A@!‘ A¹Ée˜a®Ìs¹v÷yžêþ7Ïì©÷í·§oïå·×ª~ž}©]U¿ªz»þ{ïÚoœ´UmÈZÚ¯¾úê+àC€À‹|¤¿ 6ïµ=h^o¶d~_6ÇÄ\;¯¼ ¯$n=²ÀF,œÛŸõvwfþ‰IÄI\d@ HÀ„ÿöj²§sÝõJô¥sRۀĪçi¨žsá{…¿üÂôK.¹dÛðð°@ kMþ9@ʽhþ@¶dA6×Þén§ã?!Et?öß··½ÅŽúòk§¯·;kniÙ¯ €™À#»»7ðÂuR@ ÝÒæÚ5Òa#|IŸÐ_#¡Ý¨I€@C¸ì²Ë~VðþQc@CsªÆƒ§ zΊ„¿ï‘Ä‘Íìs€CÿñÿñýêÙ}ö€@uðQíÙƽp^¿ éîÎ^ÚÛž½¬³5ë3‘çß{'@ '`—‚!â%mÍÙ+ºZìËíÙ<{`ޜޑWìu ŒðÏÿ}ãßØa±ØIYJüKÏ_Ôüß‘üZ"@€À»îºëÖ•+Wú€cºÄ|×+ŠK»ø î{‰ñwÖÐ0kèÇÝ°n·º™dó¼îîîaûà¿Œ[ 4(ÿ`—½àsøk‡/—½la6ÏÒš›|b7þ 6è¥ÛĽ] =Í­Ù’þîìe‹æØW#Ffÿï²ù#ò9h¼p!F'`Ÿÿ[>ÿ'Íâ:E¾[©Iåï¬àÉgVñï·ñô&‰7Qôó†›}sèÊ+¯üé~µ@9h±É}R·>û¤[þmwïMŸ.I$Ðj#ºlö¿>|ø«ñ$ôþGJø€@£0á—}þO’ÑF­’úÂæé„Y&@À,Ÿ€‚ÍëÆHoÇ›,÷¿ô¥/mÛ»wzH‚ Q-6`N_O¶|Ñ\ëÝíË?ó6òÐ~Z‹~mIk.£€!baWö’Ås²…v´·µå¯‰ÐÀÏ  üô§?ýç;wúðý§”>ñ¸ûJwK¨B4TáI±]Òã{'_6ÞdÃýýýÃö Ž‹«ó0Ø+@ÕAÀ{r{{:³ù6«û\æÝåïuûÏ«ÿ²î÷3«Ÿ[lc°±KÀ†ƒXç¿ÍÑž_#ÞXÄ»ÿÕqï²€@uøøÇ?þðúõëýä>šd4ÿqúŽ{܃ìHŒ¿³J€€YÅ¿ÏÆÓ#Þ@îÝdC¿úÕ¯†.¾øâ;ö©‰ ìCÀ{q}"Àükö^w¿} ðå­ÙR›õ}d6@^ØX£Dì´û%p= õØÿîÑù"ü€>ý×(WÇ TH`ëÖ­7®ZµJš$µ©v‘¶‘­p+›n4L7á‰×¯›Ç×”mz³ ]uÕU;vïÞýøÄ7Å€ƒ@‹ ïîëíÎÌÈ{xÙPïCûÚ³¥6ë»ýfB€Æ¸ö?ʦlnSs¶ÄF„Ì·¡¹}]vôeszó¯G0üb¤@KÀfÿÿ—íÛ·køÔ$®U<.Íâ¢ïqB•  JND™Ýˆ7”n,Ù<¯­­møᇾ¤LdAhh.äZm"@}°ÛÄ^ŸõòvûDo M¦~tÐG»÷þ·Ù×"ìZhokÉGŠøÌÿÍÌüßÀ‡úË¿üË•›7o–ð—À/Ò*Ê‹Õx¡ ðÜS'!ìB¼1tãÈJôG›ûöΡÏ~ö³ÿêÁ… }4e>  ¼®Îöl±}æíÐÅöÙ·.`ÿ {ûÐjŒˆŸ÷æla{kvè|› r~oÖßÛe_‹hÏš}d€r›6mºÊzÿSâq-Ò,²¾^ôózø3ûh˜ýsP´~³x•¯l?{Çwì¶ÏrÜ“¯Å@؇€ë{à=»>À’…ýÙÁ6Ûû¢|–îBÐ`\ßÛ…1×^Y>¯'[º /oèîêÌ:¬À'Ž$@€À믿þÊ7î§A,×Ó\³È"úGUí_þ»Uí©ÿº‰¢ÝïæóÏqÜzë­_ªÞÃaÏ Ì.oy 9ë1‘×o_èöï½ÓÑ;»'f–·Þi£Bú»;³¾îŽüÓÞóïÃÿyÿ–O ›‡ª†Àààà3Ÿüä'7Ø$€ûiÛÉRâßÓ¢¯4ì, `–ÀW¸Ù(úå«umŸpÆ ÃçwÞãÃÃû*¬›b€’€ `ñ‚lù¢yÙBÐcÿ {ÆÚ\IƒtÞ"”Í·Oÿ¼xnö’Åó²{ÀgÿGü7è%ÁaC…ì«cÿÛç³Ì}ôGˆK§DëuyœPeh¨²b»“Þ(ñF*ÿ¶N~3ÚËðêÕ«™ °úÎ){Tòï¯ôŽŽè°ÿ„ݦy廊NÒ ìŠ±—?²N{-Ä{ÿûl@»5!þg>›€jŠÀ…^ø£Ç{Ìgÿ—)Ò'JÓ±¥šFéØY&@À,Ÿ€2›7‘|·±åmŸtûÀà—¾ô¥ÊÔI Æ&`ªÏ'ìîì°×¬ÀDßòÞÎìÐî¶l¥ÌüÎ;p‘̳Ӽ¸¥)ëno±ODvå‹¡ Î>ÇTJÀ&þûáwÞ¹ÛÊKüK‹Ä¥EmRé&(7Ãh˜aà°¹x#¥¾ßxZ ';Ø&€;dNW6×Òó/”þÚ¯#&Ö4Ü” Ø6Ä@W{6 7›7З7 ÑP÷?  07ÝtÓWJÌþŸk«J ªÕÓcHã1Ð0 Ð+ØdÑâi¾¨…M7›ây+\kkkv×]w}¡‚mP€@Cpç£ò¯Ø'àú»Û³>› Þ¿ÏkqIøÄ=v ô·5Û'ÿìëÖóï‹¿’y€²¡¡¡íçŸþêgžyÆõ†zü¥=d£F‘†Q« UxRÂ.éæ)²º=O7àЪU«ÿäOþäa¿aC=¸€ 0J`¤`ä“€súz²Ã—ÏÏ_:7›×ÙžµçŸDÖïÅbçÖZyæÛÌÿ‡ÎíÊ^¹d ;hnoþ*H·h·ÆÎ~ýž}Ž ˜xàÙ'Q¥3¢æPc@L‹zeb¢ôŒ `FqOjcñ¦òQqÝ€º9‡ìáv衇ú‡Im•!Ô)¼Àfz÷=6ùÛ¹}6¼'ëµÑ­4ÔéY=,W÷6¤Ózÿçú¹ïï¶ÏAveÖøÓÙÞž_~} @ ËÎ=÷Ü;mò?i ×ZŠ„¿#óôÒxÌß%4Ìø nVb_V7b¡}üñÇ?üáß>ÁmP€@Cp¡ç“¾õÛpýöE€Nî_èBÿÕýuÐi£æôtd º­÷¿cìÓˆÿº?õ  P!µk×þóÊ•+ µ†U¡tiY¯=únb3I u&7ƶ&DÀo •õ•uC¹ÕWhy䑽6l¸bÑ¢Eà+ @`_M&}ö÷¥‹æå3¿ÏíjÍæ´ eCƒCÙ.û¹õWB½°«ÖðÓc¯,ß›½léülá¼¾¬ÝâÍv=ÐPoç›ã”Àç>÷¹+Ÿxâ‰ýF[}ÒQDr ›d½"À€=ÉÍÄ›*úº÷³«W¯ü¾ðIn—Õ!Ô-oaõ×:m@‡ ÿï4Øk_ðÉáL ê’ÀÈ¿Ð6;Á]vÎý½ÿ‘Oÿùã'½.O9L˜€Íúÿã+¯¼r‡­¸ŸÆHÒ¢.q?†4óðg‘ ³ÿ6o²ô†Ô;9yKÝÞ½{‡®¸âŠí/¼ðÂÝ°V P÷¼··½­ÍæèÌúì=ð…slB@ÿ$`_G6ÏÏ¿Èúºì•ùË|䇽î1`£?æÙçÿz»»ìïý¯¯£åh (k¯½ö Ö{ÿ¥3Rýáñ(ô¥UtÓ¬7ì{7„*'IÜWÜŸLÕe!kŸ3jøù«_ýêwTù1²{€fœ€7ø°ïVëõß³g0[³~s¶wï`688œmxaw¶%>ÒÌøÞ±Á©%0ò¯sNKS6χÿ÷¶g¯>jyöÒeå Ý£óLí6© €@íعsçoyË[®Ü¸qã^Û{þnãRÔ€ð¯¡Sí‚‘P;ts¹-p±…ÎÓóø³Ï>;ô·û·›lÀ}µsˆì) ™#0Ò`_°F€^›p^_W6Ðmía€P_LûÛÈŽælAGkÖ×á¯}Œ,mÖ À»ÿõu®9@àÀ |ç;ßùŒ}N\ÚB6êŽèGmâõ¸Ù‘«Š#ªêtBݦ¾zü•§ø˜mkkk^¼xñüñ¿WX;‰€™€°eïà`¶cçî¬Ë„á MøØÆmÙº=öŒ3Ì3L]\öÙÇn[^a¯wyPoö’}Ù±¯X–-_¼ ëè°Ïÿµ¶ÒP'šƒ€&C`÷îÝO¼éMoº|Íš5.ü}QÏ¿û{FÓŠ, Ñïj!0 úÏ’ž>ݦ~l+ô}À§?ýé >œ§ú•=„ 0³òÖSkðÉ{º:òÏötµeí&­_x¬Õuf÷Š­Moèé¶wÿûm¸Ÿ-> ­­5ý¡ÖõéØ.uB¨ßûÞ÷þzÐ[Á÷iìñ"Ñ/m"[+‡ÙðûI@í]ºÉdÓ›ÔoP-yžÝȃ>œ§ö•=† 03ZLðû+}Ý&;³^Š‹mŒ\—‰FB=° íµŽÎölÑÜžlþ@wÞÐlçÝx Î1ÇL†€M ¾æœsÎy|ݺuÒÒEâ_e\x.‘Ÿ'ò§: ÐPç¥Ô^¥7—ß|Js?Þ ºi‡üF>ÿüó×Ø°žÇJUL: F&Ðj=Áóú²…ó²yö5€9]­ÙB{7¼?Ÿ @oY52¡?vù>ªc~og¶ü ¹ÙR[zº:mä‡5X:€@£¸ýöÛ/´ÆP û¨)R!ím£ã«©ãç¿^mœ.¿Ábˆ7œnTÙ1áo+(mh×®]ƒ_ùÊWþ"V‚@#¼Ø'ƒë°ÏvXc@}#~ ½%ëb2Àº¸D¼ Ç'=j·sÜm£ºì½ÿÿ/N­S‡ÉA@8 þªðÙgŸýÈêÕ«£ŽŸ6¸¾ˆZ䀶ÉJ³G€€Ùc?Ù-ÇoLè[¥òãM;øôÓO}æ3ŸÙ¼eË–›&»aÖ‡ Poü;ð]Y½0§¿';lñ@öÊÅýÙKìsq=.y fO¹?è,lÎæX ÀÜžŽì ùý6Ò£??ߜ֚=­ì8 0…¾üå/ÒF G¡}×i\¾Ò$òݪ˜ U|r’]ó›ËCz“).áŸÞ¤c7ìæÍ›?ò‘|~¤þB€€ø€vëù÷‰á¼‡xžÍ° ¿+뵑Þ8Àl€"U{ÖO_§/öÄÓeŸìïµóÚÓ•OX{GÃC˜Z6aøM÷w·Ù; ­æ¨#\ChQžt‡ïDô=N¨4Ôȉ*ØMÝtný¦”Õ*;v#Ûðž¡›nºi§ ﹤ >’ 4,|8kh6µèól’¸¶ôu¶fí>~œP›ìÜù<KíË‹{;²Þ®ö¬Ó†ÿw¶Û+¼û_›ç”½†¦”€Íöyï$´JÇ4ƒùÒJW@Ô¾Ò#òݪœ U~‚’Ýó›ÌCz³IüÇ›3½qóø“O>9ø®w½ëêááá]#Uñ€œ€ÏßÒÜ’õÚW^²x~öÒ¥ ²}]ùäq¼Pƒ×H>¾¿9[`#;^:§;;dAŸÍþßc#ºó/>øˆ¼á§]† 0V­Zõ·Ür‹õî,ÿQWÈ—‘ŠÝ Ž&@À ŸâÍéæ“ÕÍ­ÆÒ|‚ûî»ï¯¦x_¨€@í°ã–VŸ(®# Ãü6Kk¯ý#kÌ#°s×f#z;Û²>ëý÷Ñ­vN[ZZ²&7€@ A xgà;ÞñŽk¼sÐH'¤~Œ«ŒëÒ#1þÖ jæTí·£ºéduSÊFá/?¿‰ýFûÛß~}ïsý~µ’@  Øás‘8ÇzŠçÙ2×?g¯j_èÈ{”µsyعjjÎúMô/›×›|ЀMðØ=Ò`Ãÿ}Ä€@£¸÷Þ{ÿÊ>.µBô]W¨Œ4‡lDçi„!@@œ¨°›é ¦›P6Þ¨ñÖÍ›[û,àÐu×]÷±P/. †'àšÐ{‰úzò¥¿»#›g s­ Ó{Œ]3¢kã:ÉÏ•õþÛÄ çôd‹læÿþžî¬-ÐÌðÿÚ8‹ì% 0 ¼Ðzÿï)Ñû/ý NÅh¥7¦a¯¨r¦Ð0S¤§w;ºã ª†€(üuC®Y³fðøÀ“/¼ðÂ}Ó»kÔ@ ¶4[ïp[ëÈzlØøB°°»=ëkm¨­ÃiܽµÿŒ-6BµÝnü<úÜöUÞûoÜK‚#‡Fx' wZ,ê…1`éÑ÷2Ò©õ =PC쫸„%öAå}v,ÑzÇ mGG‡çýûŠ+Þa–@ á ¸8ô¥µÕ~6‡‡³g·n3;”µ›øß°ug¶aОsxÔ©‰ë¤ËþÃÍ1ñäÜ®ìä£ΖÛÄŽsú{²>ÐÒBÿGMœDv˜rÞùwÆg\e{­rún‹|5¨‘@âÊ÷‰ g–ÿg–÷tnM7¥ZóduóÊê&Ú´iÓàÅ_¼Å¾ûùíéÜ1ê† PKüS€þ‰8Ÿ,®Ë&°ïÆ÷uud&}Ž€¼Yµ–¨A÷µÓN•7tXcNgG›ËöŒ™ÿôbà°!1]tÑ…Öûïº`L˜/Zé éŒh½NjŒ 5vÂÂîꆋ7bôÇ»©ózÆ ƒï}ÛP´d9lIDATï{ÿÕë-@0> À_è³aã çôÚç㺳.àÏ:úõ…Tu0Ñïó5,±wÿïïÌæÙ+=]ù—Úm~^¨ÎÓÆ^AÓOÀ:ý®öÎ?ï´­•Z$ú£•Æ˜þd ÓN€€iG<£ÐÍoØR7·§Ù$ CÿùŸÿ¹ûÖ[oýÐŒî)ƒ På|ÀÜÞlÙ¢yÙ¢y}Y¿ Ê~kù@•ï|Cï^sÖm7‹ì½ÿ—ÌíÎ'èëÎúmbGÑá#<€Ààà೧Ÿ~úÿñyÀìØ¥Êê+'m‘ZÇçi„$@@ ž´°ËºñÒ›RñŠnnŸôÝï~÷C[¶l¹-Ô @ ¡ xO±ïìhÏ:­ç¸ÓFôÛÌ9>´œPÝ|¾ÆÎ6ÁÑÕ–uÛðoÌñ×:|áŽê>wì 0=®¸âŠØ€râ_óÄ2®%¤+¦gǨuÆ 0 àŒ#Ÿò êQÔmô}CJs«§ùûÄ÷ìÙÓd#î~ç;ßùûöÐËuáô€@C¶g›0kµwÿwîÚýêÉ ÙÎ{lÐäPöŒOèÁ ª‡€5ÚXvP[KvìA}Ù+–ÍË–,èÏ}É¢ü³ŽþZ#ªçt±'€ÀÌX·nÝ7ì³w®]»V"ßmÑG¨#Q ²3³ÓleÚ0`ÚÐÎXÅzúÔM­n\·ñ†v_?yúÎ;ñ‹_ì±WΛ±=gC€ª˜@³÷·ÏÆù°ñ|€‰ÊnŸPκ—Û¼)•PµZìÜõt¶Làhó8´Ù¹CüWíébÇ i$àCÿmÖÿ¯šø÷gþrš@yQ?HW¤{(ý‘¦¯4ÔÀI:€]ô›Òo^ÙTüŇV­Z5xöÙg?üÜsÏÝrÛd@uIÀ;•óeôè\û3LªúOµŸ'?occ㪗ÙC@SNàk_ûÚ¹6ô_â>j€}:mÞW$þÕ Ñ/;åûJ…3CÀÿ5ꃀΥwÜú3ª7ò¸m]Ú̶Û­ûùÒÙÙÙzꩧ¶ßpà ߱Þ/G€ @€jŒ€ ýÿú‰'žx©õþÛûkùè_·Zvú²*£F5ÐPcç}¼Ý¥cä赯}íU6"à§%¶E2 @€ 0En¹å–_qÅÏoܸ1}~—àOŸáýy^e£õ=JÅ~Ÿ¢½¦šj"@@5éÝ—xCGñ/_?i#@ü1‘¯2CÏ>ûìàïþîï^`ß];½»Oí€ @h\Öëñþá>è#q‚?»ë™\Ïè©U¾¬¯£giÙÆÛ`GN@cð¢ÜÓ$þeõ#‘þˆx\yùŽõþ=øàƒ{ßúÖ·¾wppðéÆÂÉÑB€ @`ú ˜è¿ÌFÞ~wtÒ?=»ÕóyúÜ˸ŸùÝ×¢÷8¡0 `œää5Ñ_’<ö5OW™hÓ‰U®iÇŽM[¶l~衇n|ó›ß|¦} #­œ8 @€ 0q6Üÿ»¯~õ«/]»v­ ùØaÅ¿Þ/6Ä­#‘/«IãJÇÖ!êð¤VpHöEE•ç¶âÅ¿ `ŸÚ¼yó§vÚ[­€k«ˆ.i€ @¨ÀsÏ=wû‰'žøùU«VIüKØGñ/á<­$öe+ÜŠÕ DZ½œÉ‰Gú¾¶â±&5(_ñ"›mß¾=³Ï‘ šøÿþI'ôÿš-ª3Ö@€ °¶û^õªWý•}ukȃ)'þÕP$þ]짋¶HC€H4ˆ¥ ANtÁaFq}UZ´î—]¶nÝšýò—¿ÜµdÉ’Û=öسT€ @¨ŒÀ®]»[±bÅGlâ¿AóÕƒ¯õòGÑ/_e´N*ü£à~e;F©š'@@ÍŸÂI€Ä}ZIL—­ûqÑúyo¸çž{¶ÿÚ¯ýÚ½‡z蔉… @€Êسgφ3Ï<ó}<ðÀ =WÇž‰{‰ýÔ*_66”ß(¹ C€€†9Õ%T¾d$# ÿ’¾ýX5ýð‡?|ÆZ.]ºtéë’:ˆB€ @ ûªÖÖw¿ûÝ|÷ÝwïÙ´i“ y5¤b¿(^$üÓÚ"½ÿ"Ñ`–Ï6Ø ¯àpõc  µê¥èÇFi*“Û§žzjÐ>xÏý÷ßÿÙ ¶K@€ 4,{Í÷‡>ô¡ÿ~ûí·ï¶™ÿÓgp=g§³ý§ÏáZÏŸåÝ×3½žñoô=Nh íým 4 u¨ñ:H{õ½‘ÈGŠhi5ß—¶QÛ|¥©Œ¯ãë7Û'ßxÄGœk>€ @†-|ìcûýË/¿|»w¢YV\$úew[¾ +Í㾎‹~YÄ¿Á ìK ¿}sˆ5x-ÄFð îKì»Moð2²ÍÍ69à[;ì°ÿié@€ @ÀxÏKKËÿsôÑGÛó²Ä»[õîG±E*þµ®zþÝzˆ=þÑÉåoCà€†:Ýe6þÄÖÂø¢¢Ô¦?Njôrù‘Í^:|Ê)§|‡×Êž2!@€ˆ€¿óÞyç½sùòåþ%-îöEÏÐzæŽÏÚÑå´®žÝõl/ëT£ïqBð^Z"yî+]ViŠ»Õ¢<·ÙöíÛ›®»îº'í{¦¿|éK_zZžÈ@€ 4 Ÿíÿì³Ï~Ïõ×_¿síÚµå„ìé êtÓº±O¾È"þE¢Á- ~¾„¼gÉOmÌ‹¾„,ýÌ¿póÍ7o´W~|ä‘Gžé+ @€ ÐHvîÜùøYguÎ]wݵ{Æ ±÷¾T¯ú{þÝW¯¿,â¿‘.¦ + Ö Å%Úýp£_tø1?õw«Å²;ï¼skooïÍ'œp›,WQŠÈ’@€ PwžþùŸÛ«±þÀìݼy³Ä¿„¿¬÷îGÑ_ªç_ë#þëîJ™ž¢`z¸ÖC­漏Eù²^N¾Ûè«Ž±toøÙÏ~¶cË–-ÿvꩧžÙÔÔä  @€ P·ž{î¹;N<ñÄ¿Z¹rå =K¼Kô˦b_¯x~º”þuË›&ǯÞ×–ˆOÓÓ}hQÌiJw+_uŒ¥y#Àc=¶çW¿úÕwßøÆ7žÞÜÜÜ¥BX@€ Ô§Ÿ~ú:ýúùU«V Ù٥ĿÄ~%½ÿêßï/å×JŽeRq6‰ªXµN ÄkDâÝ­Û×â I¾øgÿ´èÓ€—˸ïë·,Y²¤É&l¿òÊ+¿dŸ \fi@€ Ô §žzꊓO>ùf%üݪÇ_6öŸ6ÄÞÕÿusÅLßDq7}[¡æZ&¯ùn}Q@.ä-îb_"ßE¿Ä¿¬ÒTf¬`áÂ…MGqDë~ðƒ/Z#À!¶.€ @5Oà‰'žøÊŠ+¾]¡øOâëj@ü×üU1{àÂrŠZÕÒ¨Ÿ¢Ì8|©Ô™ÿˆåëÚ¨áÿú¯ÿÚkïDýé¦M›þ­Ü‘@€ Z pË-·œ—ˆ‰x>v_?>;ËWžÊÆgo=Ë G|vWcÔ£;–€âµ"ß­/ à#â¢y=Ë–-k±ï¡ž|ÜqÇ}¬Ä¾ @€ ª%°wïÞMŸøÄ'ÞÅW¹/¡.ﶨÀÓÔûŸZ•×º±®¸ÌçXºtióe—]vúË_þòÿi ¾.€ @ †Øo»í¶¿?ûì³Þ½{÷ЦM›$Äe%Ò%úÕ½D~Q#@,ëðúU·¶åäÜWˆ¾Ò°˜©øš‘²$ÒëPq·Z\´»/ñîÂ\‚¾”øWC€dµžêJ·á6yCÀ%—\²âØc=×Úl{@€ *&`bÍ7ÞøY›Ùÿ {~Ãý£(w?.©˜÷xÿ1.ß××zªK‚?µ‘â?ÒÀŸq.|¨ñz”/q­„{ÚPÔÓÔ «z¢ÛÉæÌ™ÓôÕ¯~õ¤ãŽ;îCÍÍÍ]Õ‹ý€ @!àCý¿ûÝïþý¹çžû” ÿõë×Kh»užZïñ²ýùŠËJðÇuU¯¶·+d'÷ 4,f”€DÖŒn”A  ôš” ÷Uä»`wß­‹yY {YUz´Z×­/ªWÛÊ­°9š¾öµ¯ý·W½êUç´¶¶de € @³H`ûöí÷]}õÕÛë „¿Ä¹¬‹t-QÌG?ŠýèÇ2ªCÖë‹ñx i<æáC`Ƹ¸!@ Ú¤×¥â¹·•¢ÝE½Ä|øQüG?–ѺªOV۳˖-k²oÇ6ýÍßüÍâßû½ß{_ooï«6xì @¨w6´ÿÊø‡¸æë_ÿú 6ìØ'ø³E¸û.ÐeÝ=÷QÐË—à—Uº¬¿¬ê¶ª÷ٶǼ UCÀ… ÕJ ½>Ç„øè»P÷4Y ùh%ô£ø¾òµŽ×å¾êUÝqÛþùÀÌGØwd»Ï;ï¼·YÃÀïÛ:@€ i"`0;ï¿ÿþ/~ðƒ¼ë±Çò÷û]›ï#¾%Êe%Ö½ $裢_~,¯zܪn·ZÌÍ}· žG€@UpQC€@5H¯QÅ÷äv.Ô%Ö%æ%î%êSáŸÆU.ZÕ)»Ïv[ZZ2ÿ͇vX³}^æ¸ã?þXÃÀÒjʾA€ Z"°mÛ¶¿á†.ûèG?ºÚÿªU«$Âý0$ÀÝ*=Šu÷‹Ä¿D¾Òx\/Ö§íÄmËw«€ø lU˜ªªbg H¯SÅ%ƽxèîû’6¨A ×W}¾=÷µÝh3ÿj€ýS¶YgÞóž÷¼Éâï°wѼ € @`ì™jëC=ô• /¼ð.ûœŸòßÙ0‰}¯I¾¹lëñù¥¬Ä,ŸÖ£úãvµñÈ<Ÿª%€8©ÚSÃŽH¯WÅݦ‹D{òiƒ@: 6 ­§:}[î§Ûô]nêèèðO6õõõ5]tÑEGtÒIÐÝÝ}Œg @€Jxúé§o´Ùü¿uÁl°I—ÕÛï+HX ñT¬§B>þüJOË+·åi<-îKž8úGé1 UEÀ µD ½f—÷cq_]¢]6mˆ¢¿”Ÿ®ëÖ¶|»žîal_-Zä~ö›¿ù›íþçþkö)Áwwvvêi@€ ,{î¹çîüáxÕ§>õ©•æû„~Ã6ì_bZ‚;µ.È=Ím\\Ô{\⾫ò±Õnתkp߃—!@ &äâ¤&ö”„À¾ÒkWq·é»<- þ4óä{™RKºMÅ}¯sßGø,µgœqFç‡?üáWuÔQÀ|Ž‡@€@£xþùç~÷ÝwýÓŸþô#6¡ßàŽ;rá?ÊA‚:ß.Ð=-Z‰öTø{z*þ½ç?¦ËW²q¶J¾Í¸Ož¦ tű¨j.L¨UE×ï~ÂÛÎÓ\¸ËFŽüh½lQ<ÖëÖ6´n=(žû|p“·l¯X±¢í}ï{ß¡'œpÂoÏŸ?ÿw™3 gÅ@€êŒÀÐÐÐóO=õÔ·í}þ;¿øÅ/®_½zµ‹ólÆ n\DKHË/²è©âßóRáãÊÖ}ßžlºmËÛ?÷=xjŽ€ÄIÍí8; @ ½ŽßGt[ù"¡îâ^b^Bßãò•_×z©õízš¶ŸZËÊór럜3gNÓÞ½{›Î9çœþ7¿ùͯ:üðÃßf£–y @¨EÞËÿ‹_üâºK/½ôþ«¯¾z‡Íä‚ø…^ðÑ€–ØVšân%È£u_Kþ©_‰èW=ª?n;îû1x9j’€ ê…@z=+ž pÅS᮸ľÇå§ Ê‹Vë{ýîG«m¦ÖÙ{š‡Ü¾ìe/k²÷ß²×¼æ5­öECO<ñÄÓ,XðFŒ@â/ @ÕIÀzùw¬]»ö[·Þz룽üCþÉdK“`–ÀÖ(^d%Ê£H¾¾§•ÿi^\ß·éñh}¿´/òÝ*x5M@£¦‚‡@ PtM+ÍmºD¡.ï6 þ4®F•OË*Ý·}mÛÓÜ÷ ´ɱ¼8:àOÿôOÞð†7k¯œ<00p²5øv € @`Vø°þÍ›7ßöøãß{ùå—ÿò›ßüf¹^~ßG h‰ìÔJ{zëÑbßÓÓ†€¢ü¸¾êÖ¶=σâòóÄÑ?žG€@]訋ƒá ¤×¶âѺ¯E¢\‚=ÚTàÇ€4Oë)ÝëWš|mSÖó=(.?ës 7ùD9¿ó;¿ÓþÖ·¾uÉñÇô²eË^g_8ÒW @€ ©&`Ï>3ÿ=öîþïºë®¿ýíoo¾çž{öúkŒ6¤hô]~߬Är‘•È.²éž'?ÚRÂ>6xù´œ§Å:‹¶íidGb#‹Òb>>jŠ€ ê™@z+­ûZ\Œ»/Ñ­D½§É/eãz©¯úµÍRÖ63¶_î{ð²rÛÝÝÙ§›íï°½W×tæ™gvuÖY‡qÄÇYúoÛ÷sŒç/ @¨œÀ®]»ž°¡û·Þoášk®Yóƒü`·ç÷`.ª$e=Ý}-i\én‹Ä¹§ÅE‚ÞÓ*û±¼¶¡íÄm»ïAi#±ÿ*ÿÅ<Ô‰‰:8e ¤×ºânSßã.ÚeSãã5(?®ëu_qù©µ"yO÷ ý±4mÀ¾(ÐlCò†_ñŠW4¿å-oéÿßø%Ë—/?ä ƒz¥½>p|sss_^ @hh6 ñÆgŸ}öÞ7>¼råÊ'ò“Ÿl¸öÚkŸ÷Éú¼sÁìÐè¤}â$a,ëéQDùž–Šp‰|å)žÚ(èåËzÙèkÝX§ö'Zís´î{ðrÔ-1ÑP·GÈAàEE×»Òܦ¾ÇcC€âQÌ»E~ôÓ¼t=«ÎhÝ×âe<(îÖƒâòóÄÑôý|Ÿu×&ÌëÚ´iÓ°¿J`Ÿl·ÏÎ9ú裗/]ºô0k48ÖFÃ܇… Ô½¿Û†ïÿÌ:î·Þû•?ÿùÏŸúÑ~´õÞ{ïÝk~(³F€!ëùÅpê+­û¥çžmê‰ù˜}‰ýÔÆm¤ûâÇæidGbûÇ•Ž…@]˜¨«ƒâ` 0¢ë^i©°V\bÝãîWº¤ ¥ÖS½Ñ¦¾Ç}ñ ?Æ•m9ßóü‚&oá÷øÛ·o>ꨣšO9å”.³ýÖP°ÀF ,°ƒ%Væ¥Ö@p˜½VpP¾" @¨ »wï^mŸÜ{ÜDþ*ôëŸ~úéMO<ñÄf½¿Í„þ®Ç{lÈE~GGGæ#­Ç<ñóåYO‹é.Æ=HØ{žü"ëiq)%ðK¥Õ©}ŠÖ÷)î§Ç”®8uM@â¡®’ƒƒ@ E׿Òܦ¾ÒÔm)a?ÑtßF¬WÛŒé1Í}J“_Îzž­;Û?žÙëMþÀàïü fÞK྽NÐ|øᇷX#Aç‘G9`ñù6Â`¡•]l“αŒƒÚÚÚ|YĈáÅB€*#`=ö{LÔ¯³e£5Ðo²Åþ?·Özè7Ù0ýÍ?üðÖ‡zh×£>:¸jÕªaŸÈ–üÿµ7èûÿkk (¶iZ©¸Ò‹¬§ÅÅÊããÊSk0h·ÐeÖhÐeK4趥Çü^«·Ï–^‹Øü=qãø€ Ù&`ŸÃÛfïÒo3»uÏž=ÛÍÞ–íæ»}Áþ/î01¿cçÎææj~Ûúõë·­Y³f‡½c¿Û&ÛÛkvÐ{çG{èóÿŸö¿1ïµ÷ã³Õò‘z½÷éỎ!{žÒd‹Ò¬Ñòz<­««+¯ßž¬¡ÉlæÖkgPZ³ÕáyÍÞsbë7[^³•i¶úZ}¿,)³Q cÇ+?ìgž§tßo÷ãzî[oN^Î}fsGq{hÌó}›yþÔ,?‡~½ÖìTáŽÃ´ OÊv)ž?û­Ë×´ßDÝ#¹U\÷ŽýŒæéŠk=³#¼¸ý¼œý¯P}yŽ¯çÁ÷  ïAâC¾øWs,Ïßs¶tOó2Ãn}±´lÔz¹¼1Û­‹oÛô°[ûâÿŸüÕ9oìö¹vüÿÿϱãÍôÿI»©ònmù:î[Øg¿U¾À–+W”ÓÆó•­ûEq¥ËúùH}¥¹ÕâeäË¥å©\ºÅÝzP|$öâþ—Š+ †"ÀƒfCn¶BE÷ELs_qù©uqçiÑF_yž¦%M‹qùѦ¾ÇÇ[¬È~ûîi|]©iyP¦T\鲪SñR¶Òr¥ÖŸLúln{2ûͺ€ P9‰ÅÊטš’ÙîxeÓü¾ï¹â©U^LO}—Z\¨+O~‘-ô±\Q¾×Ëh;E¶è8<-_Œà—Kå Ý#J‹Ö}-^£ûüJW<ÚèkO+•®2Ѧ¾ÇË-–½O¾â²¾®üQ7/?ž_”_.Íó´-•;P;UõèöY€‡ÀT ÊRõ¥—óåWb½L,§x)+aîùòËYÏ‹ù¥üX_ê§ûâWš§yHíHêÈ_åÅ4|4<šþ@…Šî¥YO+·Hà{ùE¶(­Ü:q›Z7¦É÷ÖïÖƒâE~^`´ŒòÓ´4½(^*MuU’ eãzõÅh¢ëQ€fžÀL ¿‰lg¼²Eù1-úN4ÆåË*_q·ÑùÊ‹ù.Ò=H¬«L©¸Ò£¾¯?^\Ûˆe}bzŒ»ïÁóÓP”––!†%ÀCmÞzü ”ºg”^d=m¼%Šuù©õ:Ò4Åcž¶ó”VÊ:Ž˜§¸¬ç)È/eÓrWÙ¢<¥É¦e•î¶\^,WäOfÝ¢úHƒ ú#0ñXn݉äŲÑwÚŠ—²*óS¿(îiq‘`/•óÝOã¾Þxi*£}öòòµ]Å‹l^xô—'@à¸H@ E÷OL“­ûéâÕ‰õ˜VÊ÷ºÊå¥ùé¶÷}/ÓŠ|¥E{ ~ºŽÇcðý)ÆË/µî®Wª>Ò!@ ¶LF4Ž·n¹ü4/ÆÇó•/ëÄÝW<Ú4½T\é²Q¸¥Åüè{ÙO}ßט¦º=]¾[©iyÑ?*Óð!2x.‡,L€@ѽÓäGë~Q\éÑF‘¯ôJÓ¼¼—õP´Ž§«ÎÔƼ"_iE¶TZLOý¢¸§)øþ• ãå­{ ëÕC ÔŽã­S.?Í‹ñè;AÅS[.ÏËjQ¹¸¾òd½ŒÄxô•­ÊHZ\'úq=]ñhS?/dT^q, 0<øNE!PR÷TL—mê{¼Tš§—ôZ·ÈªÀ¥(?¦¥e—õ²©¯x‘iå|Ïó úGbûÇÇKW~)›Ö_ªÜT§ÏÖv§ú8¨€ÀT˜-Qw Û-·Nš—ÆYLÏW~9óRßã¥Ò”7[Ô0Þú:f•S¼ÈÆ4÷|] 0xˆTJÝ_1]~‘iîÅ•>žõ]¬Tü{ÙX_©xL—_d‹Òt,1Ï}1¯(^*ÍÓÓÖ•æÇøDÊÆõð!@ vLDHVZ¶¨\šV.®¼Ô:Õ4-Æ£¯²žÓKÅ•^d½. }ÕëqùEëxZš_WZ´©ïqªs$Æ_@`JðÀ;%©ã(u¯Åô"_inS¿’xQÕU”çRI~,'?µª?M÷¸‡˜ŸÆËåå+þIËż´Î4/ÆÇ«'–¶·?ÇD€J˜maWéöÇ+W*?Mñè;Åe‹Ò”WdK¥Åt÷+‰«\QYåiÿŠâ1O~‘iîÇ mÇ4|@` ðÐ9…0©  PêÞ‹éòe½zùn£¯¼˜VÎOóÊÅ‹ê.—¦¼h£¯mÅ4÷=Tš7RúÅ¿q½S_ôÆËWÉJË©<€j‡@¥âr¼råòÓ¼¾S‹qù²1_inå+_ñh+õÓri¼h^&–S™"ÓRßã ªOq, 0xØF¸T ”»cž|Y¯^þDl,[ÊWÝ1_i±EecZ9?Í+Š{Z Úߘ–ú•”‰ëL´|\€f‡ÀDEe%åÇ+“旋Ǽ"¿\šòÊÙ¢¼˜}?C/—¦2²*«¸[¥ÒGrGþÆ21˜<ØÎd6 (w_Ƽñ|åËúnÈŸn«CN·÷!-3^žÊ•«4ï@ÊÅuð!@ ¾T*FË•+•—¦ÇxôhŒË—ùåÒ”7Õ6n?úÚŽ§yHã#©#ËåÅrø€À4ÐÃù4o†ê!I(wŸ¦y1}ß¼â²1-úÊ—-Ê‹iÑ/Z'æ»ï¡T¹4//<ú'®SIz,ã~©õÓrÓ¯–ý˜îã¤~@!P-±Òý(U®ÒôX.úÎ,Æ‹ü¢´¸^Q¾ÒdcùèÇü˜^Î÷¼4¤õ¤ùÄ!Y"Àƒè,g³˜$r÷nš7‘x,}ßÝ—/«Ã)OóÒ:KÕQª\¹tÕ5ž-Ú§ñÖ!€êƒÀdDj¹u‹ò$-®}§ã¥ü©(§3·¡4Ùry*ƒ…ª„¿Ur"Ø Lñîç¢ü4-ûn¥i1}B%iEeÊ­_´*ŸÚru§e§3^-û1ÇHÝ€¦›@µˆËJö£\™‰ä¥eÓ¸˜Çôè{~/J«¤Œ¶%[´Žò°€@ àµN»I¨ä>/*Sišvo"å‹ÊªÙ©*£úÊÙJ¶Un}ò @ vL•ˆ­¤žÉ”)Z·(Mä‹ò*MS²Eë) Ô0zkøä±ë˜$JïÿñÊ•Ë/—w¿Òr¾ÎDÊÆm”ò§º¾RÛ!€ª‡ÀT ܉ÔWiÙrå4/žruÄrø€@àÁ·ŽN&‡i 0Ñ߈JËWZ.Ò¬×LJ L'ÔYg"eý8'Z~:ÙP7 P%x ®’Án@ LÅïÉTÔ1”³½ýÉì;ëB€@y³-ˆ§bûSQGyJäBuM€‡Ýº>½jŽ¿I5wÊØa@¨â½BPƒ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @€ @¨mÿ0ív§UÏ6PIEND®B`‚ic11C‰PNG  IHDR szzôsRGB®ÎéDeXIfMM*‡i     ¬†bó¥IDATX íWklTUþvÛ-}ØÝí¶/hÚBK "BH ø…ƒ€©  5¢ÆÄ $jŒ@HÔøC£Òò*o‚ˆ! m‘BKµÝ¶´¤Ý¶´µ¯Ýõ›ÛÞõîínIô“ÌžsÏÌœ™3ßœ¹w‡ôgÀÈ¿ÇãYJÙjr:ÙL6‘U;½­‡kÂ*õsrŸ|“\D.6 Z9—ü›ÉÇÈÿ6䆽Ký)@¥cT’ÓH·ëØ}V„›‚°}Y6l‘a#ÚPxš¼D›‰`­‹c¿Î=Lža(\ÉcE]+ö4v*æ& Ö6uøà¦Q5øÇI§ËɇÕ%£:óaär»ñùÉk¨mîPd.\©m%ân…ûÝ.üTÙä-€²ª&lý¦=}ÃöâÂ*í¢ÌÀ çhÚ:{°«¸ïW· „'Úž’æNiïѪ!ˆO›âÍ 6bO];º™ÝÙq(X’…ПDÿJfªÆú®R£ eüèP¶U4ò¤Ã ˜)Ž]ÔcðZ3ï|K² ;×ÍÒÂqƒv“T=!ª@ŸHÅ8I.aÐòlkŽ/ÏÂÅ5¹8±, "iêòÕ±óxëç¦j˶>>}ôBÑÎHÉl.ž“ld Û²âptÃãÈËIDâ3Šªî!7Ɇ•“‘b¢×!Ý‚2“í²–|²îŽVK;ïwãnñf¡ ™‰çŽSÆ«wè·?pêV6ÏJÁ„Úºûi GµÃ©è:œ] 4U ò‘ÇJ*Nåú{í¸^Ó„ÂÒ?±·Ö©TøcL{þÄX„ò¾¯>ÖðQ6ÑÕÛ«Ž\¬nÆØèH|{±GïJÞËŽÇâ)‰HIˆF´%B–n1 ‰2 @Î[ßãZŸ‹Ž‹+˜§¸þÊR¤ÅXèp‡Êî â¦ᣂq§£çgâÑ´8% âK·°ì@é þÑÍË)ÑصIÚ€oúðUüÕ ‹÷xO»ÉˆT»¼€ªÆ¬ÌÎßf†Òí‘ÈN²ã‹ó¿ãÜ ŠÊë¼vbïâ>Ý=½Š­þ'``³ÑrgOYå¤Xk¤Ó½™?‘ÌÐâii¨svâ𕤱(We'øØ*ûÈ-òCú¼—ùòÆyØ7žŽ!n,Àžà O'ŽK«ÑCÜ-¡˜†sRÇX°qÑdŒ¶„£æ;¦-ùµ ;~Xžƒ-OÎðãx ¦e&cê¤$ÌÉnÄ¥OŽ£ºß—¾>²w× :*{ÏUÀf‡-d𠽸TéÀD»œ½¦@°E»c}LÁÁÞ÷ˆ>Š€Ey™ÄØÌHcœÄ²ª£ ûŽü‚ôØ(¼±brb­¸Üئ\µ†¶n\®¨ÁºÏŽ¢õ#ú3ÇYb ì\|Ì€…jê›QÖÚÅtb¸õT9>½p¯2€ª&'jÙ'šÛ»q°ä6N1-}XV‹ Žf$ÖŒ¼júkx’ ¯”“ýÎcÓ±rïuôʤZ†¬Mìý~‹Ì€d`ó3 ×U%çò•¥ùŒò¡Õ‹r±.Ñ Œf ¬¡H+y‹Sr?ñ—1+$KØ ãÄŸ_Ÿ’€×Ì×:—½}®ƒ7,‘°þÌa¶ÌµälïÄÁ³%˜’ÎÞ? M­xçËÓ(lü>ÝUñì,ÈW ôFu=~,½žš‡(Ë#Ú­d>âëx?ž×[èŸÝnö}wÅòö¤¢gçbežÿ«¦ê _‚çÔ5=…ª`¤Ñh4 7#II³¤:sTr³Æd¢•öA äãäEg¸±ìÚÈ”9ä³üĈ@œ[õýFCEYÏ'«Lä{^àò«Ïu=É%•j—*•owùcr˜Ø{[=ŸÒÿ#"™10-ÐçIEND®B`‚info>bplist00Ô X$versionY$archiverT$topX$objects† _NSKeyedArchiverÑ Troot€§ U$nullÓ WNS.keysZNS.objectsV$class¢€€¢€€€Tname_assetcatalog-referenceTiconÓ   €Ò !"Z$classnameX$classes\NSDictionary¢!#XNSObject$)27ILQS[ahp{‚…‡‰ŒŽ’—°µ¼½¾ÀÅÐÙæé$òUEFITool-A66/UEFITool/icons/uefitool.ico000066400000000000000000000764461442134156300200450ustar00rootroot00000000000000 hF ¨®00 ¨%V@@ (Bþ:(  @ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿvGovGÿvGÿvG“ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿzJyJWzJ zJyIËyIÿyIÿyIãzJ zJyIUyJ ÿÿÿÿÿÿÿÿÿ}M|LŸ{Lÿ{Lå{Lå{Lÿ{Lÿ{Lÿ{Lÿ{Lé{LÙ{Lÿ{LÁ|L ÿÿÿÿÿÿNYNÿNÿNÿNÿNÿNÿƒSÿOÿNÿNÿNÿNÿNÿÿÿÿÿÿQ ‚Qç‚Qÿ‚Qÿ«‹TÿéàÒÿ½¤yÿµ™iÿæÝÍÿ„Tÿ‚Qÿ‚Qÿ‚QõQÿÿÿÿÿÿˆW†Uá†Uÿ¯Xÿ÷óîÿÜÍ´ÿ¼¡qÿ¹œkÿù÷óÿ´•`ÿ®Uÿ†Uÿ†Uë‡VÿÿÿŒYk‹XÅ‹Xÿ‹YÿñëáÿáÔ¾ÿïèÝÿÞзÿ»žjÿýýüÿÛË°ÿòíãÿŒYÿ‹Xÿ‹Y½ŒYi\ÿ\ÿ\ÿ›nÿÿÿÿÿçÜÈÿ÷óíÿÀ¤pÿ¯‹Iÿ÷ôïÿ£z.ÿãÖ¾ÿ’aÿ\ÿ\ÿ\ÿ“`ÿ“`ÿ“`ÿoÿþþþÿýüûÿëáÏÿ—f ÿ”aÿä׿ÿðéÜÿëáÐÿ•cÿ“`ÿ“`ÿ“`ÿ–c—cÙ˜dÿ˜dÿȬvÿ×›ÿáÒ¶ÿùöñÿõñèÿÒ¼‘ÿÛÈ¥ÿÜʧÿ˜dÿ˜dÿ—c×–cÿÿÿ›fœgßœgÿœgÿÔ½ÿÿÿÿÿÒ¹‹ÿÉ«qÿùöðÿôîäÿ¥tÿœgÿœgë›f ÿÿÿÿÿÿ¡l kÑ kÿ kÿ§vÿÚÅ›ÿþýüÿíäÑÿ»–Jÿº”Fÿ kÿ kÿ kí¡kÿÿÿÿÿÿ£nQ£nÿ£nÿ£nÿ£nÿ£nÿ­}ÿ¯€ÿ£nÿ£nÿ£nÿ£nÿ£nÿ£n{ÿÿÿÿÿÿ¦p ¦p½§pÿ¦pó¦pç§pÿ§pÿ§pÿ§pÿ¦pç¦pó§pÿ¦pצpÿÿÿÿÿÿÿÿÿ©r ©r{©r©r©r¹©sÿ©sÿ©rÑ©r©r©r©rÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ«tg¬uÿ¬uÿ«t‹ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ( @ €ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿvG¯vGÿvGÿvGÿvGÿvGóvG ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿwHwHùwHÿwHÿwHÿwHÿwHÿwHQÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿxIexIÿxIÿxIÿxIÿxIÿxIÿxI£ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿzJ yJµyJ¡zJ#ÿÿÿÿÿÿzJyJËyJÿyJÿyJÿyJÿyJÿyJÿyJïzJÿÿÿÿÿÿzJ yJ{yJÙyJ-ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ{L {K¹{Kÿ{Kÿ{Kû{K›{K™{Kù{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kû{K­{Ky{Ké{Kÿ{Kÿ{Ké{K-ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ}M |L»|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lé|L-ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ~N¹~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Né~Nÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€O§€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€OÿcÿPÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oå€O ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿQ)QûQÿQÿQÿQÿQÿQÿaÿÄ®ˆÿâ×Åÿɵ’ÿ‚RÿQÿéàÒÿóîæÿ¼¢wÿQÿQÿQÿQÿQÿQÿQÿQÿQeÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿƒR¡ƒRÿƒRÿƒRÿƒRÿƒRÿ¨†Lÿöóíÿÿÿÿÿÿÿÿÿÿÿÿÿ«ŠRÿƒRÿéàÒÿÿÿÿÿíåÙÿƒRÿ‹]ÿƒRÿƒRÿƒRÿƒRÿƒRÿƒRÕƒRÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ…T‘…Tÿ…Tÿ…Tÿ…Tÿ¬ŠQÿýüûÿÿÿÿÿÿÿÿÿüúøÿì‚ÿaÿ…TÿêáÓÿÿÿÿÿíæÙÿ…Tÿʵÿ©†Jÿ…Tÿ…Tÿ…Tÿ…Tÿ…T³ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿˆW‡Võ‡Vÿ‡Vÿ‡Vÿ•jÿùöòÿÿÿÿÿàÔ¾ÿϼ™ÿ¥@ÿѾžÿÌ·“ÿ‡VÿíæÙÿÿÿÿÿúøõÿ²“\ÿ͹–ÿ÷ôîÿ”hÿ‡Vÿ‡Vÿ‡Vÿ‡Vý‡Vÿÿÿÿÿÿÿÿÿÿÿÿ‹X ‹XYŠX»ŠXÿŠXÿŠXÿŠXÿÏ»˜ÿÿÿÿÿýýüÿ—kÿÅ­ƒÿúøôÿÿÿÿÿǯ†ÿŠXÿíæØÿÿÿÿÿÿÿÿÿêáÒÿκ–ÿÿÿÿÿѽ›ÿŠXÿŠXÿŠXÿŠXÿŠX±‹XG‹XÿÿÿŒY«ŒYõŒYÿŒYÿŒYÿŒYÿŒYÿŽ[ÿøôïÿÿÿÿÿûúøÿõðèÿÿÿÿÿÿÿÿÿÿÿÿÿµ”[ÿŒYÿêáÒÿÿÿÿÿúøôÿäØÄÿϺ–ÿÿÿÿÿúøõÿ]ÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYñŒY©Ž[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿ¡v*ÿÿÿÿÿÿÿÿÿÿÿÿÿüûøÿòíâÿÿÿÿÿþýüÿ™kÿŽ[ÿàÒ¹ÿÿÿÿÿìäÔÿ“b ÿ¿¢nÿþýüÿÿÿÿÿ•eÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ¯ŠGÿÿÿÿÿÿÿÿÿýýüÿ¥|0ÿìäÔÿÿÿÿÿÛʬÿ]ÿ]ÿ¾¡jÿÿÿÿÿõñéÿ‘_ÿ«…>ÿ«„=ÿåØÂÿ—gÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ°‹Fÿÿÿÿÿÿÿÿÿÿÿÿÿùöòÿÿÿÿÿúøôÿ¢v$ÿ’_ÿ’_ÿ•dÿïçÙÿÿÿÿÿ×Å¢ÿëâÐÿóîäÿºš^ÿ“`ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ rÿþþýÿÿÿÿÿÿÿÿÿÿÿÿÿýüúÿ¶“Qÿ”aÿ”aÿ”aÿ”aÿ©€1ÿú÷óÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ›lÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ–có–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿÖÃÿÿÿÿÿÿÿÿÿïç×ÿ»™Yÿϸ‹ÿíäÓÿûùõÿ÷ôíÿáÓ¸ÿµ’Lÿ®†9ÿôîäÿÿÿÿÿÿÿÿÿóîâÿ–dÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–có™d™dC™d™d×™dÿ™dÿ™dÿ™dÿšeÿ±‰=ÿ°‡9ÿ¾]ÿûùõÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçÚÃÿ³ŒBÿƨoÿѹŒÿ¬/ÿ™dÿ™dÿ™dÿ™dÿ™d×™d‰™dA™dÿÿÿÿÿÿÿÿÿ›f ›fñ›fÿ›fÿ›fÿ›fÿ›fÿ§yÿýüúÿÿÿÿÿÿÿÿÿ϶„ÿ«)ÿÔ½‘ÿýüûÿÿÿÿÿÿÿÿÿþýüÿØÃœÿ¤tÿ›fÿ›fÿ›fÿ›fÿ›fý›fÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿh‘hÿhÿhÿhÿhÿ­€(ÿþþýÿÿÿÿÿÿÿÿÿüûùÿз…ÿ¢o ÿ¯„.ÿéÝÆÿÿÿÿÿÿÿÿÿüûøÿ·Cÿhÿhÿhÿhÿh±ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿŸjcŸjÿŸjÿŸjÿŸjÿŸjÿŸjÿ¼˜Mÿõïãÿÿÿÿÿÿÿÿÿÿÿÿÿõðæÿâ`ÿ lÿÅ¥eÿðè×ÿ¸‘BÿŸjÿŸjÿŸjÿŸjÿŸjÿŸj¹ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¡l¡kß¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¤q ÿжÿûùöÿÿÿÿÿÿÿÿÿÿÿÿÿäÕ·ÿ¤q ÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡k?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¢mq¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ­~ÿ¾šMÿ¿šOÿ´ˆ/ÿ£oÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÃÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¤nÓ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤ný¤n'ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¦p)¦pç¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pý¦peÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ§q)§qç§qÿ§qÿ§qÿ§qϧq£§qù§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qù§q§§qѧqÿ§qÿ§qÿ§qý§qeÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ©r'©rå©rá©r]©rÿÿÿ©r©r§©rÿ©rÿ©rÿ©rÿ©rÿ©rÿ©rÉ©rÿÿÿÿÿÿ©rQ©rÏ©rý©reÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿªsªs ÿÿÿÿÿÿÿÿÿÿÿÿªsCªsÿªsÿªsÿªsÿªsÿªsÿªs}ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿªs+ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ«t«tï«tÿ«tÿ«tÿ«tÿ«tÿ«t;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¬u§¬uÿ¬uÿ¬uÿ¬uÿ¬uñ¬uÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ(0` €%ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿuG%vGÑvGÿvGÿvGÿvGÿvGÿvGÿvG÷uGuvGÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿvG]vGívGÿvGÿvGÿvGÿvGÿvGÿvGÿvG§vGÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿwH vG•wHýwHÿvHÿwHÿvHÿwHÿwHÿvHÿwHÛwH/ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿxI/xHÙxIÿxIÿxIÿxIÿxIÿxIÿxIÿxIÿxIÿxIeÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿyI'yIUyIÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿxIayIûyIÿyIÿyIÿyIÿyIÿxIÿyIÿyIÿxIÿxI±ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿxJ yI?yIYxJÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿzJyIÃyIéyJÁzJKzJÿÿÿÿÿÿzJzJ9yIÉyIÿyIÿyIÿyIÿyIÿyJÿyJÿyJÿyJÿyJÿyJózJ=yJÿÿÿÿÿÿÿÿÿzJyJ™yIßyJëyJczJÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ{L{K/{KÅ{Kÿ{Kÿ{KÿzKûzKÇzK[zKW{KÅ{KûzKÿ{Kÿ{KÿzKÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Ký{KÕ{Ko{K;{K{Kï{Kÿ{Kÿ{Kÿ{Kï{Kw{K ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ{L/{K»{Kû{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{L÷{Kõ{Lÿ{Kÿ{Lÿ{Lÿ{Kÿ{Lÿ{Lÿ{Kÿ{Kÿ{Lÿ{Kÿ{Kÿ{Lÿ{Kÿ{Kÿ{Lÿ{Ký{Lç{Lÿ{Kÿ{Kÿ{Lÿ{Kÿ{Kÿ{Lé{Lw|Lÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ}M|LÅ|Lû|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lï|Laÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ~M+~NÅ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nï~Nq~N ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿN]NíNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿN§Nÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€O€OÇ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ‹^ÿ–m+ÿ‚Rÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oë€O_€OÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿQSQýQÿQÿQÿQÿQÿQÿQÿQÿQÿQÿŠ]ÿ¤GÿÄ®‰ÿÖÆ«ÿ¿¦}ÿfÿQÿQÿª‰Rÿóïèÿôïèÿ˸–ÿx9ÿQÿQÿQÿQÿQÿQÿQÿQÿQÿQÿQÿQÿQ§Q ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‚Q ‚QÍ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ„Sÿœu5ÿͺšÿøöòÿÿÿÿÿþþþÿüûùÿʶ”ÿŠ\ÿ‚Qÿª‰RÿóïèÿÿÿÿÿÿÿÿÿßÓ¿ÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Q÷‚Q7ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿƒR_ƒRùƒRÿƒRÿƒRÿƒRÿƒRÿƒRÿƒRÿ¦„IÿèßÐÿüüúÿÿÿÿÿþþþÿÿÿÿÿÿÿÿÿîèÝÿšr.ÿƒRÿ«ŠRÿôïèÿÿÿÿÿÿÿÿÿäØÆÿƒRÿˆY ÿeÿƒRÿƒRÿƒRÿƒRÿƒRÿƒRÿƒRÿƒRÿƒR«ƒQÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ…TO…Tó…Tÿ…Tÿ…Tÿ…Tÿ…Tÿ‡Wÿ©‡Mÿûù÷ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüûúÿáÕÁÿ­ŒTÿŠ[ ÿ…Tÿ¬ŒSÿôðèÿÿÿÿÿþþþÿäÙÆÿ…TÿcÿàÓ¾ÿ¦‚Eÿ†Vÿ…Tÿ…Tÿ…Tÿ…Tÿ…Tÿ…Tÿ…Tyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ†Uµ†Uÿ†Uÿ†Uÿ†Uÿ†Uÿ†Uÿ£}<ÿëãÕÿÿÿÿÿÿÿÿÿþþþÿþþþÿðêàÿȲ‹ÿŸx4ÿ¶™fÿ¡{9ÿ†Uÿ¯WÿõñêÿÿÿÿÿÿÿÿÿêâÓÿ‹\ ÿdÿæÜÊÿèßÏÿ y6ÿ†Uÿ†Uÿ†Uÿ†Uÿ†Uÿ†Uÿ†UÙ‡Vÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‡W!‡V÷‡Vÿ‡Vÿ‡Vÿ‡Vÿ‡Vÿ‘dÿÔäÿýüûÿÿÿÿÿøõñÿÁ¨{ÿ¹žkÿ§ƒBÿ¨…GÿàÓ½ÿ÷óîÿ´•_ÿ‡Vÿ±’Zÿöòìÿÿÿÿÿÿÿÿÿûù÷ÿÒÀ¡ÿ£}:ÿæÜÊÿýüúÿÑ¿Ÿÿ‘cÿ‡Vÿ‡Vÿ‡Vÿ‡Vÿ‡Vÿ‡Vý‡V7ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‹X ‹X'ŠWO‰X³‰Xÿ‰Xÿ‰Xÿ‰Xÿ‰Xÿ‰Xÿ±VÿüúøÿÿÿÿÿþþþÿϺ—ÿ“fÿ§ƒBÿÙɬÿûù÷ÿÿÿÿÿþþþÿ®ŒOÿ‰Xÿ²’Yÿöòìÿÿÿÿÿþþþÿÿÿÿÿôðèÿ¹œhÿæÜÊÿÿÿÿÿûú÷ÿ²’Yÿ‰Xÿ‰Wÿ‰Xÿ‰Xÿ‰Wÿ‰Xÿ‰X«ŠX=‹W‹XÿÿÿÿÿÿŒY!ŒYW‹X‹XÍ‹Xõ‹Xÿ‹Xÿ‹Xÿ‹Xÿ‹Xÿ‹Xÿ‹XÿÚ˯ÿÿÿÿÿþþþÿüûúÿÓÀ ÿÈ°†ÿôïæÿÿÿÿÿþþþÿÿÿÿÿùöòÿ¦:ÿ‹Xÿ²UÿõñéÿÿÿÿÿÿÿÿÿþþþÿôðèÿºœhÿçÜÊÿÿÿÿÿÿÿÿÿàÓ¼ÿ‹Xÿ‹Xÿ‹Xÿ‹Xÿ‹Xÿ‹Xÿ‹Xÿ‹Xë‹X½‹XƒŒYQŒY!ŒYÏŒYëŒYýŒYÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYÿ^ÿùöòÿþþþÿÿÿÿÿþýýÿøõðÿüûùÿÿÿÿÿþþþÿÿÿÿÿÿÿÿÿëâÓÿŸu*ÿŒYÿ±RÿôðèÿÿÿÿÿÿÿÿÿóïæÿæÜÉÿ»iÿçÜÊÿÿÿÿÿÿÿÿÿûú÷ÿ“cÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYûŒYçŒYÏŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿ¦7ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüûúÿõñéÿÿÿÿÿÿÿÿÿþþþÿÕ ÿ•fÿŽ[ÿª„@ÿñêßÿÿÿÿÿþþþÿãÖÀÿ‘`ÿp!ÿÜ̱ÿþýýÿþþþÿÿÿÿÿ˜iÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ¶•Yÿÿÿÿÿÿÿÿÿþþþÿþþþÿòìáÿ̶ŒÿÔÁžÿÿÿÿÿþþþÿùöðÿ¼žfÿ]ÿ\ÿ›mÿçÝÊÿÿÿÿÿÿÿÿÿåÚÅÿ\ÿ‘^ÿ¥|2ÿÓÀœÿõðèÿþþþÿ™jÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿÀ£mÿÿÿÿÿþþþÿÿÿÿÿþýýÿϹÿqÿìäÕÿþþþÿÿÿÿÿèÞËÿžqÿ]ÿ]ÿ‘_ÿÌ´‰ÿÿÿÿÿÿÿÿÿôðçÿ“aÿškÿèuÿ£y+ÿ±ŽLÿãÖ¿ÿškÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿÀ£lÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøõðÿùõðÿÿÿÿÿÿÿÿÿûú÷ÿ´Nÿ’_ÿ’_ÿ’_ÿ’_ÿ™iÿñêÞÿÿÿÿÿÿÿÿÿÓ¿™ÿ¹™]ÿñêÞÿõñéÿÇ­}ÿ£y)ÿ“aÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ¶“QÿÿÿÿÿþþþÿÿÿÿÿÿÿÿÿþþþÿÿÿÿÿÿÿÿÿüüúÿÕÀ›ÿ”bÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ¼bÿ÷óìÿÿÿÿÿýüûÿúøóÿþýüÿþþþÿýüûÿèÝÈÿšjÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ sÿýýüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýüûÿÛÊ©ÿ¡uÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿšjÿζ‰ÿûùõÿÿÿÿÿþþþÿþþþÿÿÿÿÿþþþÿþþþÿžpÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ–c÷–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿÒ½“ÿüûøÿÿÿÿÿÿÿÿÿþýüÿóîãÿÊ°~ÿ­…8ÿÀ¡fÿßѳÿñëÞÿù÷òÿõñèÿçÜÅÿ͵†ÿ©.ÿžnÿÆ«uÿöòêÿÿþþÿÿÿÿÿÿÿÿÿÿÿÿÿôïåÿ–dÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cõ—dq—d—dË—dù˜dÿ˜dÿ˜dÿ˜dÿ—cÿ˜dÿ˜dÿ—cÿ¥x!ÿѹÿæÚÃÿæÙÀÿÔ½“ÿ½œ]ÿ̳‚ÿíåÔÿýýûÿÿÿÿÿþþþÿÿÿÿÿþþþÿÿÿÿÿÿÿÿÿðéÛÿÏ·Šÿ­ƒ4ÿ¾^ÿãÕ»ÿûøôÿþþþÿöòêÿÇ«uÿ—cÿ˜dÿ˜dÿ—cÿ˜dÿ˜dÿ—cÿ˜dÿ—d÷—dÉ—d›—dq™c™d™d'™dK™d‰™dÓ™dÿ™dÿ™dÿ™dÿ™dÿ™dÿ™eÿžl ÿ§y!ÿ¦x ÿ¨{%ÿÙÆ ÿüú÷ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþþþÿþþþÿÿÿÿÿüûøÿïçØÿÄ¥kÿª~*ÿ´ŒAÿ»™Vÿ±‰<ÿŸm ÿ™dÿ™dÿ™dÿ™dÿ™dÿ™dÿ™dÕ™dƒ™dG™d%˜d™dÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ›f›fõ›fÿ›fÿ›fÿ›fÿ›fÿ›fÿ›fÿ›fÿŸl ÿÒ»ÿýýûÿÿÿÿÿÿÿÿÿÿÿÿÿáѳÿ®ƒ0ÿ¸’Iÿàаÿ÷òêÿþþýÿÿÿÿÿÿÿÿÿÿÿÿÿþþýÿëáÍÿ¾›Yÿ¡pÿ›fÿ›fÿ›fÿ›fÿ›fÿ›fÿ›fÿ›fý›f=ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿœg¯œgÿœgÿœgÿœgÿœgÿœgÿœgÿœgÿ§xÿãÔ·ÿÿÿÿÿÿÿÿÿþþþÿÿÿÿÿíãÐÿ½šUÿ n ÿ¢pÿÀž\ÿæؽÿþþþÿÿÿÿÿÿÿÿÿþþþÿÿÿÿÿúøóÿÉ­uÿžjÿœgÿœgÿœgÿœgÿœgÿœgÿœgÙœgÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿhOhóhÿhÿhÿhÿhÿhÿhÿ£qÿÙÄœÿþþýÿÿÿÿÿÿÿÿÿÿÿÿÿþþýÿõðçÿÛÇ ÿ¨yÿžjÿª{ ÿÓ¼ÿùöðÿþþþÿÿÿÿÿþþþÿùõïÿµ>ÿžiÿhÿhÿhÿhÿhÿhÿhuÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿŸj-ŸjÓŸjÿŸjÿŸjÿŸjÿŸjÿŸjÿŸjÿŸjÿ¨xÿÕ¿ÿ÷óêÿþþþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷óëÿ϶‚ÿ®‚*ÿ kÿ±‡1ÿÞ̨ÿ÷ôëÿêÞÇÿ¶=ÿŸjÿŸjÿŸjÿŸjÿŸjÿŸjÿŸjÿŸjÿŸj}ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ kw kû jÿ kÿ kÿ jÿ kÿ jÿ kÿ kÿ jÿ¢nÿà\ÿäÕ¶ÿûùöÿÿÿÿÿþþþÿÿÿÿÿþþþÿýýüÿëàÊÿá^ÿ¨vÿ¥r ÿÁŸYÿ±….ÿ¡lÿ jÿ kÿ kÿ jÿ kÿ kÿ jÿ kÿ kã¡jÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¡l¡kå¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡mÿ«{ÿǧgÿ÷óêÿÿÿÿÿÿÿÿÿÿÿÿÿþþþÿþþþÿòëÝÿá]ÿ£pÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kwÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ£n¢m‹¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿªzÿŤ_ÿͱwÿβyÿƦdÿ¹‘?ÿ¥rÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÙ¢m3ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ£m7£nÙ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nù£n‡¤m ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¤nQ¤né¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤ný¤n£¤nÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¦p[¦pí¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦oÿ¦pÿ¦pÿ¦oÿ¦pÿ¦pÿ¦oÿ¦pÿ¦pÿ¦oÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pý¦p©¦pÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¦po¦pç§pÿ¦pÿ§pÿ§pÿ§pÿ§pÿ§pÿ¦pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pý§p¹§pÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ§q §qo§qí§qÿ§qÿ§qÿ§qÿ§qó§q§qc§qŧqû§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qû§qɧqi§q£§qó§qÿ§qÿ§qÿ§qÿ§qý§q¹§q-ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ©rY©rí©rÿ©ré©r¡©r/©rÿÿÿ©r¨q+©rŸ©rý©rÿ©rÿ©rÿ©rÿ©rÿ©rÿ©rÿ©rÿ©rÿ©rér'ÿÿÿÿÿÿÿÿÿ©r'¨r‘©rß©rû©rý©r©©qÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ©ri©r£©sY©s ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ©s5©sç©sÿ©rÿ©sÿ©sÿ©sÿ©sÿ©sÿ©sÿ©sÿ©soÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ©s©rA©s©s§©sÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿªsªrªsÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿªsªs·ªsÿªsÿªsÿªsÿªsÿªsÿªsÿªsÿªsïªs?ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿªr ªsÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ«t«t«tû«tÿ«tÿ«tÿ«tÿ«tÿ«tÿ«tÿ«tÁ«t!ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¬uO¬tç¬uÿ«uÿ¬uÿ¬uÿ«tÿ¬uÿ¬uÿ¬u—«u ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¬u¬uϬuÿ¬uÿ¬uÿ¬uÿ¬uÿ¬uÿ¬uõ¬uo«tÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ(@€ BÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿvG1vGÿvGÿvGÿvGÿvGÿvGÿvGÿvGÿvGÿvGÿvGÓÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿvG‹vGÿvGÿvGÿvGÿvGÿvGÿvGÿvGÿvGÿvGÿvGÿvG%ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿwHwHåwHÿwHÿwHÿwHÿwHÿwHÿwHÿwHÿwHÿwHÿwHÿwHyÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿwHCwHÿwHÿwHÿwHÿwHÿwHÿwHÿwHÿwHÿwHÿwHÿwHÿwHËÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿxIxIÿxIÿxIÿxIÿxIÿxIÿxIÿxIÿxIÿxIÿxIÿxIÿxIÿxIÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿyI yIñyIÿyIÿyIÿyIÿyIÿyIÿyIÿyIÿyIÿyIÿyIÿyIÿyIÿyIoÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿyIÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿyJ#yJÓyJƒyJÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿyJUyJÿyJÿyJÿyJÿyJÿyJÿyJÿyJÿyJÿyJÿyJÿyJÿyJÿyJÿyJÁÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿyJ;yJ½yJ­yJÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿzJ#zJãzJÿzJÿzJïzJzJÿÿÿÿÿÿÿÿÿÿÿÿzJ zJazJ×zJÿzJÿzJÿzJÿzJÿzJÿzJÿzJÿzJÿzJÿzJÿzJÿzJÿzJÿzJýzJgzJÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿzJ1zJ³zJÿzJÿzJÿzJ«zJÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ{K#{Kã{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kí{Ky{K {K {Kw{Kë{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kó{K›{K!ÿÿÿ{K){K«{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{Kÿ{K«{Kÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ{L%{Lã{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lë{Lç{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lû{L¿{Lý{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{Lÿ{L«{Lÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ|L%|Lã|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|Lÿ|L«|Lÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ}M%}Må}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}Mÿ}M«}Mÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ~N'~Nå~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~Nÿ~N«~NÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿNNÝNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿNÿN{ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ€O“€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oÿ€Oû€O'ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿPPõPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿžx;ÿžx:ÿ„TÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿPÿP™ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿQ‹QÿQÿQÿQÿQÿQÿQÿQÿQÿQÿQÿQÿQÿQÿQÿQÿ‚Rÿ¢CÿÁ©ÿË·•ÿ¸oÿ‡Y ÿQÿQÿQÿQÿÓÂ¥ÿÿÿÿÿú÷ôÿÔĨÿ¡}@ÿQÿQÿQÿQÿQÿQÿQÿQÿQÿQÿQÿQÿQÿQÿQÿQÿQÿQõQÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‚Q‚Qó‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Rÿ±’_ÿîèÝÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèßÐÿ†Vÿ‚Qÿ‚Qÿ‚QÿÓÂ¥ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿо ÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Qÿ‚Q…ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿƒR…ƒRÿƒRÿƒRÿƒRÿƒRÿƒRÿƒRÿƒRÿƒRÿƒRÿƒRÿƒRÿdÿÝйÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¾¤yÿƒRÿƒRÿƒRÿÓÂ¥ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛÌ´ÿƒRÿƒRÿƒRÿƒRÿƒRÿƒRÿƒRÿƒRÿƒRÿƒRÿƒRÿƒRÿƒRÿƒRÿƒRÿƒRëƒRÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ„S„Sñ„Sÿ„Sÿ„Sÿ„Sÿ„Sÿ„Sÿ„Sÿ„Sÿ„Sÿ„Sÿœu2ÿóïçÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿéáÒÿ„Sÿ„Sÿ„SÿÔÂ¥ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛÌ´ÿ„Sÿ„Sÿ‘eÿ—n(ÿ„Sÿ„Sÿ„Sÿ„Sÿ„Sÿ„Sÿ„Sÿ„Sÿ„Sÿ„Sÿ„Sÿ„Soÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ…T…Tß…Tÿ…Tÿ…Tÿ…Tÿ…Tÿ…Tÿ…Tÿ…Tÿ…TÿŸy7ÿùöòÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÜζÿ•j!ÿ…Tÿ…Tÿ…TÿÔÃ¥ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛÍ´ÿ…Tÿ…Tÿ›r-ÿõñêÿšr,ÿ…Tÿ…Tÿ…Tÿ…Tÿ…Tÿ…Tÿ…Tÿ…Tÿ…Tÿ…Tÿ…T1ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ†Ua†Uÿ†Uÿ†Uÿ†Uÿ†Uÿ†Uÿ†Uÿ†Uÿ†Uÿ–l"ÿöòìÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿóîåÿ®ŽUÿ†Uÿ”iÿŽ`ÿ†Uÿ†UÿÖÆ©ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÛÍ´ÿ†Uÿ†Uÿ›s-ÿÿÿÿÿòìãÿ“gÿ†Uÿ†Uÿ†Uÿ†Uÿ†Uÿ†Uÿ†Uÿ†Uÿ†Uÿ†U¡ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‡VÙ‡Vÿ‡Vÿ‡Vÿ‡Vÿ‡Vÿ‡Vÿ‡Vÿ‡Vÿ‰YÿçÝÌÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýüûÿDZ‰ÿ^ ÿ^ ÿÅ­„ÿûùöÿœt-ÿ‡Vÿ‡VÿÜÍ´ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿìä×ÿ•jÿ‡Vÿœt-ÿÿÿÿÿÿÿÿÿàÔ¾ÿˆWÿ‡Vÿ‡Vÿ‡Vÿ‡Vÿ‡Vÿ‡Vÿ‡Vÿ‡Vÿ‡V÷‡VÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿˆW;ˆWÿˆWÿˆWÿˆWÿˆWÿˆWÿˆWÿˆWÿˆWÿ½¢rÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîçÚÿ—m!ÿ¥?ÿu-ÿŠZÿ¹jÿõñéÿÿÿÿÿÿÿÿÿœs*ÿˆWÿˆWÿÜδÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿúøõÿµ–`ÿu-ÿÿÿÿÿÿÿÿÿÿÿÿÿ¹jÿˆWÿˆWÿˆWÿˆWÿˆWÿˆWÿˆWÿˆWÿˆWÿˆW]ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‰X1‰X»‰Xÿ‰Xÿ‰Xÿ‰Xÿ‰Xÿ‰Xÿ‰Xÿ‰Xÿ` ÿ÷óíÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¨ƒBÿ‰Xÿ‰Xÿ­‹NÿìãÕÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ–jÿ‰Xÿ‰XÿÜδÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÕÄ¥ÿžu-ÿÿÿÿÿÿÿÿÿÿÿÿÿöòëÿaÿ‰Xÿ‰Xÿ‰Xÿ‰Xÿ‰Xÿ‰Xÿ‰Xÿ‰Xÿ‰X»‰Xÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ‹X/‹X…‹XÛ‹Xÿ‹Xÿ‹Xÿ‹Xÿ‹Xÿ‹Xÿ‹Xÿ‹Xÿ‹Xÿ‹XÿºœhÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿúøõÿŒYÿ¡x1ÿâÕ¿ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿüûùÿ[ÿ‹Xÿ‹XÿÜ̱ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÖÄ¥ÿŸu-ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÀ¤tÿ‹Xÿ‹Xÿ‹Xÿ‹Xÿ‹Xÿ‹Xÿ‹Xÿ‹Xÿ‹Xÿ‹Xù‹X·‹Xg‹XÿÿÿÿÿÿÿÿÿŒY-ŒYƒŒYÙŒYÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYÿäØÃÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòíãÿ×ŦÿÿþþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëâÓÿŒYÿŒYÿŒYÿÖÄ¥ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÖÄ¥ÿ v-ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿíæØÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYÿŒYÉŒY{ŒY+ZÿZÿZÿZÿZÿZÿZÿZÿZÿZÿZÿZÿZÿZÿZÿ“cÿþýüÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÒ¾šÿZÿZÿZÿ×Å¥ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëãÓÿæÛÇÿ×Å¥ÿ¡w-ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ™kÿZÿZÿZÿZÿZÿZÿZÿZÿZÿZÿZÿZÿZÿZÿZÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿª„@ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ´’VÿŽ[ÿŽ[ÿŽ[ÿͶŽÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÚʬÿŽ\ÿ u)ÿ¢x-ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ›nÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿŽ[ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ¾ jÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôïæÿÍ·Žÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûùõÿ•d ÿ\ÿ\ÿ\ÿ·–ZÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÙÈ©ÿ\ÿ\ÿ“aÿÉ°„ÿûùöÿÿÿÿÿÿÿÿÿÿÿÿÿœoÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ\ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿʲ†ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþýüÿÍ·ÿ•e ÿÀ¤oÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÓ¾™ÿ]ÿ]ÿ]ÿ]ÿ˜hÿüûùÿÿÿÿÿÿÿÿÿÿÿÿÿáÔ»ÿ]ÿ]ÿ’`ÿ]ÿpÿØƦÿÿþþÿÿÿÿÿpÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ]ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿÒ½–ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûùöÿ”cÿžrÿôïæÿÿÿÿÿÿÿÿÿÿÿÿÿüûùÿŸr ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿÖàÿÿÿÿÿÿÿÿÿÿÿÿÿ÷óìÿ•d ÿ‘^ÿ©7ÿã׿ÿ¦}1ÿ‘^ÿ¬†?ÿêàÎÿžqÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ‘^ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿÒ½–ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîæ×ÿú÷óÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ͵‰ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿŸrÿúøôÿÿÿÿÿÿÿÿÿÿÿÿÿ×Ä¡ÿ”bÿ¸—YÿÿÿÿÿþþýÿÒ¼•ÿ›lÿ“`ÿ”bÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ’_ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿʱ‚ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿîåÖÿ–eÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿĨtÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿôïåÿ÷óëÿÿÿÿÿÿÿÿÿÿÿÿÿøõïÿĨsÿ”bÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ“`ÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ¹—Wÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷ôíÿ£w$ÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”bÿàÒ¶ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¥z(ÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ”aÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿžpÿýüúÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ÷óëÿ«‚4ÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ›kÿëáÏÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¡sÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ•bÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿÓ¾•ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿèÜÆÿ¤x"ÿ—eÿ³ŽGÿкŽÿæÚÂÿõðæÿùöñÿõðçÿìâÐÿÔ¿–ÿµ‘Lÿ—dÿ–cÿŸpÿèÝÇÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿúøóÿ—eÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ–cÿ—dÏ—dÿ—dÿ—dÿ—dÿ—dÿ—dÿ—dÿ—dÿ—dÿ—dÿ—dÿ—dÿ—dÿ—dÿ—dÿžoÿëáÎÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿøôíÿÆ«tÿ›j ÿÅ©rÿôïäÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿïç×ÿ»šYÿ˜eÿšhÿÓ¾”ÿÿþþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÖšÿ—dÿ—dÿ—dÿ—dÿ—dÿ—dÿ—dÿ—dÿ—dÿ—dÿ—dÿ—dÿ—dÿ—dÿ—dý—dÏÿÿÿ™d™da™d©™dñ™dÿ™dÿ™dÿ™dÿ™dÿ™dÿ™dÿ™dÿ™dÿ™dÿ™dÿ™dÿœiÿ¿ž`ÿÔ¾”ÿÓ¼ÿ¼™Wÿžk ÿ­‚2ÿïçØÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿëáÎÿ³‹@ÿ™dÿ¯†8ÿâÓ·ÿþýüÿÿÿÿÿþþýÿßÏ°ÿŸmÿ™dÿ™dÿ™dÿ™dÿ™dÿ™dÿ™dÿ™dÿ™dÿ™dÿ™dÿ™dë™d¥™d[™dÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿšeše?še‡šeÙšeÿšeÿšeÿšeÿšeÿšeÿšeÿšeÿšeÿšeÿšeÿšeÿšeÿšeÿ´Bÿûúöÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿßήÿ§z"ÿšeÿŸl ÿ§z"ÿ¡pÿšeÿšeÿšeÿšeÿšeÿšeÿšeÿšeÿšeÿšeÿšeáše}še5šeÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ›f+›fÿ›fÿ›fÿ›fÿ›fÿ›fÿ›fÿ›fÿ›fÿ›fÿ›fÿ›fÿ›fÿ£rÿøõîÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòëÝÿ¶Dÿ¯…4ÿȪrÿðèØÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûúöÿϵ„ÿ m ÿ›fÿ›fÿ›fÿ›fÿ›fÿ›fÿ›fÿ›fÿ›fÿ›fÿ›fÿ›fÿ›feÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿœgÇœgÿœgÿœgÿœgÿœgÿœgÿœgÿœgÿœgÿœgÿœgÿœgÿŦiÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿðèØÿ¦vÿœgÿœgÿžiÿƧkÿùõïÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿóíáÿ¿œYÿœhÿœgÿœgÿœgÿœgÿœgÿœgÿœgÿœgÿœgÿœgùœgÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿh_hÿhÿhÿhÿhÿhÿhÿhÿhÿhÿhÿhÿ˯xÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿöñèÿ¾œWÿhÿhÿhÿ¦vÿÜÉ£ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿñêÛÿ£qÿhÿhÿhÿhÿhÿhÿhÿhÿhÿhÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿžižißžiÿžiÿžiÿžiÿžiÿžiÿžiÿžiÿžiÿžiÿžiÿ®‚*ÿýûùÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿçÙ¿ÿ±†1ÿžiÿžiÿžiÿ·BÿðèØÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿõïäÿ¬~$ÿžiÿžiÿžiÿžiÿžiÿžiÿžiÿžiÿžiÿžiÿži+ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿŸjŸjÿŸjÿŸjÿŸjÿŸjÿŸjÿŸjÿŸjÿŸjÿŸjÿŸjÿŸjÿ·?ÿöñçÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþþýÿÚÆÿ¨yÿŸjÿŸjÿ¡nÿγ}ÿüúöÿÿÿÿÿÿÿÿÿðè×ÿ¬~#ÿŸjÿŸjÿŸjÿŸjÿŸjÿŸjÿŸjÿŸjÿŸjÿŸjÿŸjÿŸj1ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ k kí kÿ kÿ kÿ kÿ kÿ kÿ kÿ kÿ kÿ kÿ kÿ kÿ kÿ¦uÿØÁ•ÿþýûÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûøóÿÌ°wÿ¢nÿ kÿ kÿ­#ÿäÕ¶ÿßÍ©ÿ¦tÿ kÿ kÿ kÿ kÿ kÿ kÿ kÿ kÿ kÿ kÿ kÿ kÿ kµÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¡k‰¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ°ƒ*ÿäÕ·ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿòêÛÿ¿šQÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡kÿ¡k;ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¡l¡l÷¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¾šOÿòêÛÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþýûÿäÔµÿ°„*ÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÿ¡lÁÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¢m¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¤pÿʬnÿ×Á’ÿÞˤÿß̦ÿÙÖÿÍ°uÿ½—Iÿ§vÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mÿ¢mEÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ£n+£ný£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÿ£nÉÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¤n¯¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nÿ¤nQÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¥oŸ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥oÿ¥où¥oIÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¦p¦pŸ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pÿ¦pù¦pKÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ§p§p§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pÿ§pù§pMÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ§q§q§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qý§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qÿ§qù§qMÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¨r¨rÿ¨rÿ¨rÿ¨rÿ¨rÿ¨rÿ¨rÿ¨rá¨r[¨r¨r{¨rç¨rÿ¨rÿ¨rÿ¨rÿ¨rÿ¨rÿ¨rÿ¨rÿ¨rÿ¨rÿ¨rÿ¨rÿ¨rÿ¨rÿ¨rÿ¨rÿ¨rÿ¨rÿ¨ré¨rƒ¨r¨re¨rߨrÿ¨rÿ¨rÿ¨rÿ¨rÿ¨rÿ¨rÿ¨rù¨rMÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ©r©rÿ©rÿ©rÿ©rÿ©rï©rs©r ÿÿÿÿÿÿÿÿÿ©r©rI©r©©rÿ©rÿ©rÿ©rÿ©rÿ©rÿ©rÿ©rÿ©rÿ©rÿ©rÿ©rÿ©rÿ©rÿ©rÉ©rE©rÿÿÿÿÿÿÿÿÿ©r©rc©rß©rÿ©rÿ©rÿ©rÿ©rù©rMÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ©s›©sÿ©sù©s©sÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ©s©sñ©sÿ©sÿ©sÿ©sÿ©sÿ©sÿ©sÿ©sÿ©sÿ©sÿ©sÿ©sÿ©sÿ©s_ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ©s©sa©sÛ©sÿ©sù©sOÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿªsoªs#ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿªs«ªsÿªsÿªsÿªsÿªsÿªsÿªsÿªsÿªsÿªsÿªsÿªsÿªsÿªsÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿªsªs_ªsMÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ«t]«tÿ«tÿ«tÿ«tÿ«tÿ«tÿ«tÿ«tÿ«tÿ«tÿ«tÿ«tÿ«t×ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ«t«tý«tÿ«tÿ«tÿ«tÿ«tÿ«tÿ«tÿ«tÿ«tÿ«tÿ«tÿ«t•ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¬uìuÿ¬uÿ¬uÿ¬uÿ¬uÿ¬uÿ¬uÿ¬uÿ¬uÿ¬uÿ¬uÿ¬uSÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¬uu¬uÿ¬uÿ¬uÿ¬uÿ¬uÿ¬uÿ¬uÿ¬uÿ¬uÿ¬uÿ¬uý¬uÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿ­v)­vÿ­vÿ­vÿ­vÿ­vÿ­vÿ­vÿ­vÿ­vÿ­vÿ­vËÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿUEFITool-A66/UEFITool/icons/uefitool_128x128.png000066400000000000000000000164621442134156300210640ustar00rootroot00000000000000‰PNG  IHDR€€Ã>aËùIDATxœí]XTWö–$šIL4ÉnºÉÆÝdw³‰ßwS7»Ù( "¢Ø£¢RDéHªHST”Þû0€hì&&Æ»±k4Š½aAQ„ó?çÞš™÷æa¾9ß÷ûž 3·œßïžsî}oP~‹¦*yNðÔ\¼Ë@ð*‘¾‹Að)±Tzj&c^šH~Š$ÃŒ%x- Szj&cž¥s8a À§œ®? *Ug¥§g²ÖÌeÙcHÔ^Ág‘´ð*ÁCS)ø•½¬ôMÖš¹«û!Yw1\K+]ð*µVzŠ&kͱĴõ]=ñ-õC>ò(yHEàVðaù…F½Ô'Щ.Âõ¢ÚŸ¦éƒŸuFòWáõk§µ~$GC5ÍXœ«¸ût€ä¦±Â1ß”ø6üã‰iÓMífƵzò5âJ{lrˆgñNüÜH¶Jš­8â!è”RtH%LÚª¼ 'Ê/ÛÅ48®á‚·ú©Æý> ±ŽßÖ¢¸OE¼vz(D@仟e^€(l<4ºû-¶õ9kÓµìiÜv9£ƒwqjWN{Û– 4“«>‚?àx_TêG·b÷~¤Ñ~¦½~)ЦÁ´¢é 3ÜŠM+ü'{ŽM–MÒ°èQpð ®‚ýÜÁ´+7(dST˜VP?oo ^‚¶yJè "’üzr!S•&¶ÝdÉ#Øzäw ùnH>’LË'õ› òA›vê„éùÓ”¦^¦æ}ÌÉWkÉ7Á(àQ¦NpURnj$¿è¼‰|¥D@‘@]«L$˜Vð à<Ëu®y&(J Ó‹jñêj<òMäw(Ô‹ Ï"p-ø óÏ~\sMè(`i¡°V[t’OSs§³©¹&t4¸k("±Ûʲ™KΓØÙ~”ž° `© ¿Jp.|W>òëE;– Ç„ŽÚ‰¹æ¤ÊO>ÀÜÇPu›Xñá’óðÀ9›Ã) „)Íà¤ýK¶òãl/(¸ä^Gô5ŽÈœs̱à¨åëàpF‚2 3þû)ÏxÑ_o…”Á;aåð6âÍà2xÁ¯žpÏçïÇ÷ öé 8fp±(=þ¶@»±©ÙFþ =Æ䜳+φ•ÕaŸÝ\sÀ©h3l9~N\¾ Wªî@ÕÝ{p§¦ª7ïÔÀ¥›ÕpìâuØøËÈÝz <˶Á箄Þ>è\ÇLìÒy¤Pz>ÍáB«?ç2îÎ^3®È\²?Äðs‡&«cV/®äþóV1Rõµ3×nAùî“0)w¼ŒQB˜’©ü܃j1—ì㓯3§¬|V (툠Éið§ RÈÝr îÕÖéM~s»Q]þKv@J N`®¼®9'8åÿA9LËs“W™ÊAKüÓny°x\Æ.¥QÚ˜¹|7¼ì«æ})9W\iáå(G¾Îœ²æ³( ”#ìÒ 3’22u-ì;sURâ)‚än9 ƈ"LNÕ†úvÄÚÀ>cJ†ñæÌVÖIÁ%­·Òô ”ÔWQY 'NÜéHþçs–Úg$%žlÝá³ð¿¸å¬z‚cR ¼<£’Ö÷’­ÐeŠv÷À"’Ìówͧ¢´=-ì”Äeò¹óßð/†ìÍG FÂ% œòÖ³•*•ÕÔÖâxBßÆ'Üß·¡ ÚÅ.å Þ_Q—ÄlÔâ`¶³ûçv)òÃöç³—B«Ó!÷GÆ.`d³¼O×ñ áIL+cS¿ƒm'ô¿[Ø’Ñ â£—ð~(âÈåû´:arÒÿ”À$ÜúÙ§Ö0uË ÌÏ'&BÑOÇÚMÈí»÷ é‡ýðEìèV V VÂœÕ{àÐ9ñÛ:1vwöÙë0Õðˆ%»Oèù»ÔùÆ'Þ!û9ìØU¸ŒšLN2P¿Ÿž{N]Ö›¤Z ó»ÎnTß…˜»ØØ„qi&%qØ&p!LXÈÿ=Ib°ú%ù„`—ö±0%^ÜÖÐËèØ¥ÿ«Xg$½WãYF¼ƒLä“£&ꜗÀˆ¯w:óMŸ|Øm€¤´’m¿À{AÅœx[-Ùøïß9¥A_ÿBø0b|YoªÙkì}4©|E©`rr-^ öÉéx#LJ~ÝpÒ'¤õÆbc³QeÛ‘€j–ëÒùv‰©ó{öCmû‰ Еív(Ç`K+ƒÎ¸ªVÿ¬ÿêonKwŸ€gRx4Ðõ3Ž"Ã\âëyÐUßÃ1žuIƒÞ®iðŒs*üÎ!‰“0¶á}œ”fÀßÙe®•ìQó³•UXS¤ñè¢l¢JIzË'—=8!¥ýpð4ôÖ‰ Å¾ã¹Ãu‘b¼ôzkãý2†Í_&ÉÊ×ÙÛwáuÏìVÆjð‰+tèøÔ5’9³±­Ùwž¤>nž4cÅÒOUW$þ®íúúäh#ŽB<Ô¯cc̈Ǽ-—ån<ɱ” '¶ÑkJ2ü\!ýÉ#=ÍüE€±ó”á`<9H`¾]õ³¼'yž…ëq‹8Ç qvÂqf­? ùØèpËO³ ÓÕ)JñÀ:76pU=b϶ZrÕ†¨Y´Ñkœ(žÑ WˆêëÐÙ«¼f7|·ÿT«ï£UŸýã~èë™…íÏæiJ tà02¾ž =ìØvLnûé—óðøĬÏvql<ï” '.µ}@•ôÝ^è‰óFÄÀ“ö pübËóúñÐiø<¢„ ò«8¾ëøZÿ7sŒ±Îí阧.ßh7¡‡q¥…—mâ-‡Ù±°ó¢T0*¶}cÄ÷G/ÛÞfÛ¹@ç/µ„ÒçpU—lmú½…cç+arêjx”N«çOí¿èŠ[ÐÉ ïÿÆP¤StÖ3(€Š+íþI(†tëHFÆÀˆùKEm#/\¿/ãž_ ¢ÄŒß÷GÌ6o2U €ŸwNnÚ.ŽkîÊì÷t$Q¾žÃ¹ÒëL$Hü““€oÑz8z®^sKÇ×EŽK œð“¨üãíLôþ®ãpÐc´«hxÌPoõÙ˜¥Û8 bƇúç!шèfŸ†ˆÅ[¡|û1ø«w6ÿ= dt,tÂ눹ßÀníM¯›Õ5ZaÎ6>:cqpÆ  Ûøy°¿¢}E`:,¨t<51ž9š×cR<ñ¸ø¥·à¥©)Zñ´26l³®X:*nËÆ%­Ô  éÜžwJÂÝC#õ‡‚úg`>,Ýu¼Éç+oU£R±ÏXãs  ?Æ®„Nèèõ‡O·K:Ûýë[Îlዶˆúœ/Õ6Q­ ¿TT{f‘¥\ˆÍÛ Ò Ø×+˜"¬ÚÕâíb&€©(€1±Æç@á+¨@Çi°3Äm; ï{eÁ§!E¢Ä؇§ûø¹<ä¶2®¼ âöýÿ-Ò  qsØkOL˜î9ßÙV" E¥e8 0g(á‘,/jô¾–ch½Ss¯Í÷’F>ŸY¬ÍË-Œ WâãHí4ÄØGAõ©¨£¢áÓàBØqü|›Ÿ¯¬Ò `tŒ2|É Š09e¥(GKi VíÄЩu@³1!y}ÝÓáv_ÿÖÙ'H4Ó($pDKkÂðY0GDIÆ€»ˆÑÑÊp@`ùG  Ã>TåËò˜vkvðôeè>.Ž¯ºæcBa|®ÝÖg!(ËpxiJ"D/Ù }¦a>:¢ðßbŒ À%™ O1xè‹1>pÒ½ìÀYÕ¶”FÏ ¾?ƒ¶g‘÷ Wï¨yKD·5|v98$¯„S—ùia_wÜÒY…‹3¼25 }¥ ,Œ‰½È —±ÚâȘ +vׇGƒlJúj†EÜ?|Í6QÜJ¸.\kø.!Uùo¹µO(œž¸åÀX¤×ót\_ ð{ ‡V¸mÉÂë)Aw¬Iár“œ°ž žykEwøÌØxÈð¿ùý^.€Æã g]Â0SÀ0ˆZ,n[šûã>uäõ³Žt:¦Ž©C^`Ͳ·Ðƒ„qñ/4ýnÀè˜^˜9Ö¨ŒÄiÙÅ`3 þæ•É¾4!ÆÖ8ݾŒÛ„å,—ëk[ž….Ôÿ¨ûàœ¶Z¯6õ€ydIËB”Štzntt5þü“0*6L÷±ðU´È¿-ôUôsH¼ ~8u†WÍsx㔳$B—‘QðãÖo¡êì׋נÇø9,Ìöœ3òЫ† ½ù³“æó: ñx††ÃÔ ýžRb˜†[:ËPQØwê<>6–¥AI|©#0*úþü-’î.ŒŠû›ðoUWñ_ {FÆŒÄÐQ€Š:[/)ŽNŸœ,îž;Ý zÏ;Ã&®š³Øg_›²â—oo׳…ÕwïÁÛn¸Zm"î‹«‘0=ë[ÖŸ$>äú’^"Œ‰žˆé¼a„·f6Q/£"G£ÊÔØy5©X_`xÖv.[ÝbÌ+w-†ÙІϓБýP‹¶Š?Yü4(…ü&c± ƒi™†·tƒCP›[}ïIœk¯‰sÙÜ ò5ÂÈ(GÆ‹ÑmDä"~³ÃÀI ã)œ‹±— …NZ½õ"â" 1XD¨a“ˆ{ ÃbKñ3a’ €N"ûNO%¶ú­Â ÷KÇ‘{›~×ϘF‘€nÈP86Hܳ˜Ó9/îvÁÊíÐÉ:œ“ŽŽ|É!ÿ*†Š?wv‰ËàX+w m.呤ñ8ðçiút@ãCTùƒ°ûÄx‚Æja¸ßØ⛣ ùdcg>‹©`ja¸óÇÅ‹?„ÉÃ-Ôûið±_69{Öc!ùo&'•Ä×Þæ@hñz¸ÜÂW¸SVà{BšŽvM_Õ.âé$3·•o:-D!ÏdmÐëbmX ÖƒTL¼ÛhI$–žT» —F|Ñ*K¾Îl"rÙ¡ s„@Rc!'æön[¶z÷/ð¡oõÖ\tµŽ.ÏsP¡÷õí”,þ˪¬¤¶›µU¾©Éû.]¿ï¹ã¶Ó*Dñ4pC°Žü£ÒÔs³‰è‡¨f9P `!å–©_1ÖÜhÏ?oéVøƒmk—­@ Zè׋G±6œ"¥‘fmD-j@õÝ°Š,æ}K埑ì5OiÚ›šMx6ËKÃà ‡–¤ˆq|Š±*YZèÌ"AHËýûqƒq”ð4Ò¬ ¨è›´ðöš$~a`é¦ ð¥)ojÖááÀî1ò†…$ª½h£d" [òÓaxgj"t¢ðß¼O L^ØŽÛÁ˜J¹ÍÚ˜½x3{DÍ!·šAÒøC:ø²;¢|ñ×܆……²“-)'k$ †À‚ïAÊçF6ªÀG ý!y¶ñ‹ þ¬*üì¾aíIêlfÕáÕViÊÌfÖ+8 K<|KÊ}òb%üÇ?³uÂPXCgµI<õ¥Ù°úØÅqA*% ® 6ª7•ÀÐ$V ŠÀ ? µTÁ»® à•µo=N]„ŠK×à$îý·`Å®^¯Lœ­%¿•öð÷–(¨Ù‰óW! È÷§'b dý*6wØqwpŠñÉò à&S¢U°òÀˆ ôg×n6a¬VxzÌ,èLN¢×)ì·ÕŠipx~=átŠ·ÿäH^± †„@OlOׇâó­ù?ô–0Tõ¾q`œÁ Z… CT|u†´ãsHì_¦.„0õ0*ºþâÝé¼` ŠÃŸ·§ôÜZñ04¨Äxä yp‹íuÉÁ¿%P¤0ó㤛4ˆ¨Ã#äž`üãÀ2(?t¡2¡£€îq Q}gøÀm’üOT\5S.ÌšÐ1`R‡×á2 @•Èž¦µ 4¡£·n7 XùÿWÿ>Vý+=aÀŠßàk¸@-‘¥Nò €‰Àï Ì7?³-í‡MPCtä›ËK|sX’p'08À¥À¶¼AׄÁþÆ#_gÖª>~öšD ØUu·® ¯3sÁà€½, Yø›`,ðð]°¬ù:ú:fIÆ$_ÕAÈ×Ù`?A€I÷‘ ù7sK¥)¿ßHþ»Yn2÷3 ,Ï©ø¤¥hÏØ`ãÆÅ0ȯJ°ðãs1¸M–ûo–‘|}"0'é?IöYÿã‚ùŒi‚yÀü÷*>ù‡@:â-üoà˜“sß¿° ÝÜ}ý¶M_¿X ùƒ†(MqÛ6Àû5."l†8èVº…ÿIt˜·`¡êÕÐ tbª·ð_Ç#ƒÎ‰"Û–„káçž ñÿkŸô³{_…ïû‰ ! }¾±¸‰W+#3i€‘,üv±U;hƃaîÏWö ÿ |¿¿0Ø÷ù¶IGœ”ûÌýWbh½Ç#‚ëíË –¦ˆL¿ƒx ÌüÞhÕ/6Ó»ã<'`dÛÄ`ÑÆøi~æþù:# "¶01]^ô?ƒÎ,=ÿЮ¶->ÀÏÎCüÂÚRFwp~Y–Íqü=Ú5~z¿¹Ÿ#ŽÿÐ…lÎ ¿›Â _ëvµÝ¡Œ¥¿\¾<¤ñ~&˜©^2¨}ó/b»\¾Æ­úA3¾7Ø?æ>=±NpÇyœ¨OmÌO”Vüròu6ÈïU&úÝ qb³Øk’µï“\/0c‘…ÄIe_¸?‡"@ÿœÖ»U¿ òufîÓG°ôcWÉÛöû ªNˆÄ¢}oc±úŽôs¡ˆæ.˜ùØHÞöoÖ,T }°°9ÐG~ð~6 66]”žºÉt6ÐgËËÆËÿ¾þJOÙdÍÌçÿ0<×àäKw…3Œü¶ÉZ7:#à½ky@Û³>;»¤G”ž²Éš›™7Û;›yËj w˜ÒS5YKÖßíO(‚*¾ZåÏ=Œ(=U“µl„þ>«Ù—:xKÚšyÿŒé¦ƒýy“5˜™«xIÞ®‚šÕdm›™×KB¯+,\K-3ïZa€ûgJOÑdmÙïb^­KI¾] _¸‹ü7L¦œ™ùÇ|]'}ø÷ž¯ôÔL&Æy¼€ià"+Üú{J:êïùÞ“oÝþiXdÊŸe¼IEND®B`‚UEFITool-A66/UEFITool/icons/uefitool_16x16.png000066400000000000000000000012651442134156300207070ustar00rootroot00000000000000‰PNG  IHDRóÿa|IDAT8m“KH”QÇwš|LSŠŠ …ºÑ°ˆ’ *µ°¤"[õ¢ B,I‰(¤E„H„´ˆ©¤EMBÄ@ZEO4¡ÑILMlÌÏoÅ|SX8‹{ιÿs¿£DD±€©“÷£T"mrqgÓ‚uIÕØ€N`x„¢2!À; ÈŽ7äÒîèuüvˆ€ª‰1P¡ù½d‚ ‚ r¹nÔ€5•XSÕ`MkBXÍŠ¥)d¦áÅC‰œkŠ±æ€?!`#ˆ¼Öd/I¥µfû7òñÛNE^£­ÐÝMgTû_×¥–%³gªJ9TVD[÷{¢Ó³„÷•sâ¬?ÿ€±Ÿ³@q°ý2¨­(µ  ©º„¢Ü VfØ\b6®¹ûò39Át|>EÝõïIdä‰c’CZk7b¬ðad’PC'NÜÐÛ´¼¬ 1'Ž_ ÚX€b Ø‡Ö$Ý/¥¯¾Ž‘ŸäHùjª×¬¤$/›Ú«™œqXd óö`Ì1DöeÃߧŸæ—ã25ãPµ6׳4=…s;6Q´<×qA½ îù$ÜØŽ˜-˜ø:Nó­^J ré™ û픵̺šû/>qâf¢]0ñqŒÞ*áÆïæR@¥Üé{Öš³»ÊI[¤pÍ`t‚[ÏÞ$ïÉ¢ kZöá…XO]ìgNkÿR-ò å\‚D±]Xs3A™ŽzV37ç€Ñ`õVzñ>¬iû3 jÛiÈNP”çÞ {œ¸ˆÔ¢x*ÏÇæ ükªº¹¸â-¯ÉÓ õ Õý’EÁúÇ@IEND®B`‚UEFITool-A66/UEFITool/icons/uefitool_256x256.png000066400000000000000000000367321442134156300210720ustar00rootroot00000000000000‰PNG  IHDR\r¨f IDATxœí]X\ÇÕ}¨Y¶ÉNlÇvœØ±ÇqbçOì¸$NäÄEÔPïH „ˆ^„TBB¨":¢ XB½KVï½÷Þ{/Hºÿ½óvË,ì.owÞîÎù¾ó­ìî;sîÜ;oÞ÷×~ŠÂKC?ßâ"üŠd;91ðÏÿGM†½ap~(vì&ÆÁù|È[¡¿ŠcðKï¼÷0òÃÁw”Õ„4xÚmËdç ’Ñçþ…™’oá¿ÑÃN?ó9‰Ì¿0y»ì* oÛçÉ}PtLš€‰¿ð ‹ªäTÞô×e~'°cý¥Ü—e;µï£­ãðçå¿¿­öBt óé}ÌfI¾ùßIm=–bûf1áë7Oñ¶õY°]Iƒ²E0¾ya²øUر”^²Ù=o+…D´ñBYmÏÛ6{¥>µœÿÇÆ&ô½z…_‘"˜ 'ìTõŠÿ'[¨ÏøÛâ(Ô¯¨%+4†´Àé'‚€qðË · ñ šBù*‡UÀIˆ_ЮÉvzbðþo±© åâ§UT߃@¶½¿OîPlìS¶*ê“+((HdÛÇóHÞÓÿÆ[¥BEñOçïpAAµÑípÓJž Q=|§{±Fðv¤  -r0Nžƒr·Jžºƒgl´ 0‚m”¢‡ Ú 1kö-x‚%@Þ2®嶓ç?f âîTAA¡›ýWJ=3êó–pÍ઩'ùä,–”-((X-sh°TòÍmÅ[¾Ê`Pö·Ø˜‡lu“»sUN6Yæ,dOŒ¶ Û¨e óÎ4ÈZùˆæw¼e«,¼¦†Aà6[ àîdAA•’Ìæ–HM-Þ’Uƒ²Y½³Ÿ%Õþ>¹÷q’4ïQtªGÿÔ?b/±µÞζgDze‚4`Hž õGzÓ ³F9=§Éï¥ÏàÝG"›³ó¤Êž€d7”-¯¨ÀáöÆ™LÀõ|sàõP-üyx ü'~!8'/‡žÙkÁ»p„ÌÚ šy; RÇ!s¶CÀÌ-Ð?=tÌXM¦,ÏÇ̃÷‡Ã/óÀ‰>×3£Œš Ïûæ–g”-x© ý¶NVûç¤ñ–§uà ùæówº=ˆbünÂ"øñð“Ån*®Ý{;Ï\ƒ´u‡Á-g|2bÔ£ÙË=]T6ðö‰­‘Vþ½s¯K^éó–¦u08å—íö²›„(4”Š£è>ˆ,†ôu‡àa©é3½¸…YÆÆ—!zÑ.h¿ ÖÊxûÈVÈ&ÃÌɼei]xgö‘|¦?åî|[#Í°ið².„–l… ·îs~e rc×Ùë0rÁ.ølô¨EöÒÚ— ü¦V²Í?9—ÐGð–¤uÑ-ëEÉ;{þ`+ÄYµ¶×4hŸ¼¶¾Ê[ïUâî£RXqð<ôÉ] Ïûd‹ `ˆ4û{gÅò–#xMkƒµO)[D¢"X9©ÎwOƒ¿Gφâ'áÉÓ§¼õmh!Ò¯h5‹Ù/õOçïGµ’¶ý̦¼¶r=ÿ8Öùƒ ÖË8cSÖ²3ÛþNX$­>¸IiÚºÃðŠŽœiðî;EÄÏfÿ-Ò€É xKM½áÏj$Þ¥4q&«‡¯^yëàüÍ{VmÍqóþ#¿lüŽÕù)å‹t¦\k_œµpüêm“l ,á/QÅò÷óîÀœ'èÃ.¼%¦nÐC<3vÈwº¥Ûqð¾®…’',$UeA™IñöðèÜRätßœvSúŽmÿbÔlX´÷ŒÙöœ¼zšbÉ õMæß—ær í†ÌX+¹jŸç-1õÃ3sËxwštK†f‘˷”¨å°ëü6 K ‰·_Šymî/·û×þ¹0záN¸ó°´ÆvÑ.Èîé+Ë3Þýj3è²_©D[ߪAßä·¤ÓŽ³­’Ü;®¤AŠrËZ w€¥Au¾Öù ¼3™xͦûN<:&/‡½ço(j#­ Ì_/¯ ôOãßÇÆ’fÏi ìç˜oKÂ3c¸äm³?ÎT½3WÁ£'êÞУ¯óߦ:Ÿ„ïa¦°è}øþ¿D̀­ÇÁRË›TžÎØ$g'¶hå@z&oi©SßA‡—7‰¤Ù.û%Ã1³P\-$e0“êü‘%²ðÝSÌo/Öæ|2!´x\¾cùó (¸ob~–ú§òïïê8 6Ý’ÜSíü¼¿š¢Z´40GŽì¶JZíǨ¿dÿY‹ Á\ì8}:$-ƒZ´¸G k涕faÌtšNXW~MßR L€J–²¬…w¿WG6®E`îI¿ÃÙÿ»u”wgÕ„8 ¿‹ŸŸ¨ïÿéëw!¨h4„u~Ÿ$ó…ã‘ÊÞÿnh>¤¬>`ÖÁ£J€¾·wæJ¹-¼û½:ÒB 'f}“ÿ·ÔÔ ´¡l±„wGÕ8$AüÒÝ\aw<‚©?îƒ÷°Îï“(§û5h_}Li=sÖÀ©«ü·/ß~P -'-bvqïû*™ª[ L›Ä[jêƒÛô_ãìŒm– GÙ0kaÍ·úˆåOç5 ÷œ†ÆÌ’¢¯™Í¡{2ûŒ¯ð³–ì7ÿš¾%pîÆ]øûðb]à? ’Ö<Ó.HRßæ-9uÁ=m;ŒwÕ”8³6ôÉ„#*8ÀãäÕÛÐ7sÔ¥t„áaf›XºŸ¯ûgÃØE;U{Isûé+ðVP®îê€ Æ‚!zQ–›È[rêÁmÉ=};÷Î#Õ¶‰ƒïWƒ³˜øx¢pë1øÖçR/]ºon{0pÔÂ÷wN^û¾¦o L\¶G^Ôä=ª¢¼Æµ]r÷ÈpOo+yf<åÞ1JÅòüÀ Øwþ:P=X¸j“èÝj šE{'Â'š"(ÞvœK[Líeˆ_² Þ ž^³€g ²R ã±Ô?¹%oéñ‡«¶¶ä‘2—ë‘bÄZyÞ®SVÁåÛ÷Áeò"îT¹^7×~þKƒ2 |æf¸j‡“,Øs ¾U"·»_ÿþ7†¬ÜMËá-?þpOú;FÄ;l•”w§(Å>S!jÎV«Š€öÉ·š´SþóívÃr¡o4Ÿ06Ÿ°î5}s°³¬i+ ŽÞvÞýn isGêE¶ñÍ¡á‘â!ïQ4$¿cgC©÷LZ¾¤ž ºô×Tá'éÒýBÈZȪv›ÊJ¢çm‡×ã¸éUÃl‡'½XÖëÁ[‚üÐ3ã%Œ‚ûÙM'4pí…ý’¡>FøµG/ZMCgm©ûl”ñÃð|ˆ_¼ ®ßU÷¶e K3¶ƒ¿EÉÂï›Ì¿¯kBZ ôH[ÄÊ`‡-‚ôO";$Ù¾ˆ©xç”e»!æYÐ#MãçË%¥Ã•ÙD{èwø7NøÿφÃÔ÷ÚÄ!¤[O^†6SC-,QäL*èãšR^¼!¹¥ü‰·ù J†ü„[t†Òì—ÏõO%û¬·a†®ÏÇ-Ú †å±Zž=ûL…zž©ðçˆ蟳 í9 ÷=¶šmæâ,Ûº¼L—ÛÑO}«$iü{¦:àéÀîI¯`úsB> Ra öž ÿ‡éê•ÛÖa¯ß}³¶Ÿ€È9[`°v=hfoô5Øž¶òh1 N)«öÃû¡Óåµ h¼ûÓ¤ûÜSIM-Þ’´zÆ¿„5è@É=õ)‹èöL¼ÝR—q»YƱâÀYøoìlù²^Ÿ©üûÐ’¤Å@÷Ô«R÷IvühpW×ÚRßä0-îŽQo6ü(F½RÙ IöOL]ƒ1U÷Ú:ì;w z¥/‡º43²t_}g Ê‹‚«Q#øÿJ}RÁ[²5›å“cª¢_ ¼Qöø'¶ÓÌAÄO웈³Y -Ù 6r ¸UqéÖ}†åÊ«>86zN‘ýU•?Ýd²¿Õ³—ŽúSæPÝ稉úÛ…Ý“"÷£^’¥¾S;Kn“ß·ò€Œ$cÝSº ÓPà‡Ù,¯Þ»ô¤Gs S!°`½Í<óÏÒxˆ~ÈZw>’/ ×­ ÁR9€ã„ÿ~+ žÝÓ–C@á1w+Ä.دÛÀO»Ú%,†‡@}ÚrÛS x÷¿ÑL–'H¦›4úÙuÔÎrd„ä–òºž&ä=¡!¦-ÿ–ܒ±¦_ÊŒeLT|_{a¢¸yOÝ7æ%ì wŸ‚ÿžõó6VFló!¹PŒu¾µpáæ=ÖÏÌ>ÞcÎZì«+ØÚAÒÔûnÔ}†T–Ö»%ò7’'±&ÿ_&lµÂ}ðt\xκƒð§Ð\&V èíè%_]ø›¦Á^vȇ­`åÁ³àÔ¦4¿G5Âï-_9é’¸˜-ÒY±ó·Wo£½R_.ö¹£¢_è—óvZ÷ɽnÞ…A¹«á9ýŠxE›èÿ=äÙ‘JÚ%§V¬:xÚM^(—7, Uãol[£þÉ¿x'·Ý‘tfãk´ñ¨w‚åÆ•-Pr#88»Od+Ô¼0× ]60Q— T`¯Éìç¤@û) ÙÕˆó7îr³UºYgþ®“à2aÔeÂ'Û§åë÷³a©ï’4ò' X¼ÇO²çÈÄYöã!ùì:ž KŒ]¦.–§ØVÖg줔™D†ië[~Ó GòÈ]_¼aµ'Ñ“yiïBôœ-ðH-8‘Ýt |ÆøºÛDø<ªr:0õY$,Û]^‚9*¹À›(¸ÌµxE’ñØÛ¡]ße—Ì ØLYŠ‰ïK^)ÐxÔLÒ®‡¢ÍG`Ï™«ì„\%BÂýÒÇpÌìíÇ!¸p=|9¬žwO’¿›UoüŒïi2v6{€‡Z°ùøEyCï1È“Ü àIÄ´ØvGeº˜·ó$üÖwšq³;$Æ®rvð¢G2¼œÍãæ€Wö*ƒ%oÃ!X¼çl8zv¾p&aºpƒ­-ì8yÖ:swœ`›eÂfl€N ‹àoC  ‘Wª¼Q&z#gûŠÄ÷:Ÿ§º†/Þ¼¿óË”*ï±È‹¬nsTbJ=aÉNÞã°RP?’‡â™`Z›zO–¯»S¹@ï%¢pká k¾<’à’QØ)ÐÙ 2Îê‰PÞËÞ7á'ïcŸWãç´?—{‰UhWçôØΉüÇ"/r7€Q¯ J…Wø>Á§*œ¸r ¾Ydz¨Œ4s“˜õì¥cÙÏ,àc´ûÛÑ%pEÅ—2isVÙ¦#RÈ® í¤ùª?¤ƒVü¿™Éìåî3Sˆâÿth>»@Í虲Ôö|«$¹Àq€&¯ØÃ{üÚ¹öͨbÛ¨8£¾í—ûΪwWÚŽ_-ÁŸ¤…ŽÂ^´X–ÈVÌmgq&ý"ªëxþþ«Š='BC÷©°t¯õfüò֨ߧ–$wxg¨O†L¯Ñ=æ<@ÿ08[^àíÃÊØkÔBßN]¶›·«Œ†¿Ãýb#±Ëx蘰÷Ø3 ›Ž^€×¤È W¼ýX‰_=§­PýºJEøÐh7wßñ"w¸ ÔxV²‘÷Ø3Ú‡¡ζì²o_ꉳèWôª¼ÜW<3W°ñÀݼHi›Ã±ûxÈßp÷Ø«"f¬× \ø³ÇDø•gl?©þ' WÄšÃçࣰyïoò"w8°6Ö>Žžç=þj„{J¡ÙØþA€²n°îßÅÛ%Fã襛à…3ÿónS[üDîX›8[½Ü?‰m…µuºp~3(M^äåÏÎñÐfü<‹<ùèÞÃRE£ãÉÆ-Ø&û íf;yGÞdÜ‘ˆbùO:ÛnÈ^»ju/fkûgÏצ(zw=à4{Í~h;~|– ÿ^E›kv<-JÎÚvþ‘‡Â'LÞãP-¤ë¶EËŸ‚2mn±ÊžïôÕÛ”·öK?³‡ ÆžÉÝkîWQÏ÷·®Þ¹—°ì°Ô3h&®T<–` P_—îQf·ßšCçàÕþ‰†ghlW›ø9F}¤Äe»àÝÁé,pÐCm` ¨†~ï(dŽp$â`ú÷p-;ÝƸyÿ!øfÿo J×&÷# !}åxPªlºóà|™ÏÒr‹û…Õiò|vÊqMqîúøK2y–6ð}ئC³« Ú”EPßÊåC¼áÏ£ßág~7ª>šWõßÚ;¹`mâàøψB‹¬ZW†0íZ\Ç`z/§è48Q@ÍbgÂ…OÃ]¸ë$Ôé1^žÕ,å?üìnSØ!"J OÊb:ÆUýè»70€ž»Qù…[±Îo3~Ôê>¡ê@B}€¾ÿsPä®ÝÏŽRëMßß©šï·g²ÁâHìÿVÀ\aiÐ}ðoû¦É©¦Nt:»Æli¬>xê²lÀ–cÀ#m) N´;°«B~Cõk³O»þ ¼{Q Û0Б_IÌ»M|œ»¼ à@'䚃g̦`ÙžSðŸ¨|9è€Aé ÌθÌenß$×Ø”Ù8¨ƒ³õÚCÊù,eÙ®ŸBSIþë0ýYKv™÷\GxÀƒ8p´Ï Ýj)ËwÁ~i ¹ÆʹKÌV¨¾Ö#fö&ewç±ð &JnŸž°p»ù¶Ñz úíƒÓлk´Yª˜ÎÆÍ3mo¹%páÆ]ˆÄzõ× ¹Œ„¨âõŠ~þÁó× !–;R׸šùËu4xM[¦¨m±s6Ëk"¦ØÑUî»—°Maù«Ù.š¢[Â|Óí°'2§:qöðÍZQóQ¬¿ý’Áàœý\ÚªÛ:®¤|ñÑ\bª>}Ý~EmY²QÎ~Œù~¨˜!ÕÁ×N“æÂŽÊ<Ä€±vØ#¹Àƒ(ˆVcKDJ.M*}«PÖê}5 ˜n?ßkì>¥ÌÖ_=FÌÜ`¼ðPüõ»‡œ5ûµ ox°Óøkp¦Í nN_½¯R‰Ñy¬™¾ËvÜ)½qjÔ¬MÆ ¯s¼Ôw2»¤ü)N"P}èhD1¼â1N\¾©ø€Rh›q»øY¬Ž7ËW(Ž13@Í?[¨Ì¦.qrÆÂVy5ºÿ ™‡‚T9˜é{ s¸Ò ¹lÏIÅ”‘º|—<ÈÍñU»ðL_ª¸Mãl©½Î¦ ¯…bï:y.üg]*•ÞÉ‚`Êür;‘Ü àÅö10NW¬}g®Â‹XÇË[’Mô€‘%·)qÉŽráÑ~ü÷ça90gëöûž‰ äû(è÷"XŽRH ÔùŽ€‡¥áˈœaG›î'×H^¾Sq›2~Ü}0 E> Þ“nûÉ6ã®Sæ±àÃlè4ÀD ÊïÞìFßÓ>†ÿxäEîð"¦›ŸeÀ-X$øe¯`b3ÝO£A»þ€âöä¯Ý/v>Ó–Uºc­Ð=ÁÑ«¿T`ˆµ‰µæ =ãa——·ÔŠ¢ ÍË°Ÿ½åˆâö> 66üpk× ³7°EÀ®q×ØñËìØäqeâpbí—´T¹c­ÕŒg¯Á‹½Æ31™â#' v·º½]éLƒ¶1²1ôQ>\»s>ðM•yEk‰~”‘Þeì5 ÿžÔilg©Ë¸<üÁy0Ý7Ñ¡óû&¦Äq°誙5N2÷>†¿Mc5½ÑþÁ`Q űt·y7ÚÔt%@j;J¶mhÔ{‚â`þöc¬}ÜÇ¡E©== ¥Kܩ˘£øš‚¯m%×1¿—~‚Žc‹oèŠP€¯í>`JüöÀD¸t˸{ÇM]7÷Ãú6ºxÜPÉCHºMª *#@N±ðã>eŽÿ6ÖýRÉë"¼Ç¡Ò¤™ž´Û‰þ!þl‡Ô9n NôßK]F½,טßa”èŽPˆxÉ^ƒSÇÑ©qÙ£KY-‡Á'þélÕû¡ÂG›Š˜ÙQTÑ&€ºøºæ€á#µ,K€‹7ï²àÏÖET0k.ú8YŸìäé±w°´_‰¯áøú¥ÔRó‚q¢7„.cÞÆÁÐ£È ©SÜeö%´nÐ9®l Ø,qõMZ¨ØÀªˆ¨¢u µ‰–™0õþgD 6Jïª3³¶'*ŒõMG ca-‡³ºR¶Òf”lG ½” Y«öÈýÂ{ü™ËŠ¢ïÊnÙ¾‚zœƒ“µ—ÔmÌ_¤Æš:5½!PÝÐyLoüò™ìKéËetÆÅÚ]GÃ;^SÙS{”dí¢Ëý‚éfmœÍ\bgÀz×0;N\„úÝâäE/c|ƒÙQ=h´”Â[›13Ø÷ç— c8è£F½â t8ë+ntY Æ^űPv vìMÔÎÌPðõSýs¼%m>\Gÿâ‰a> í¦¼Ù(NžÕÂNòl<(Cù»ÞÆÍÝ„Ÿ=¢zؾøhøgx6»!ÆRë„ýéÒWk#ìé( À–£†wìY ,´)Ûáª\ÊYa\XuüQ¶{'Ë"œ<ûJ]Q3’¦oé* '©óØ%×X/,V°ú‹·ã+Òu¼Þoœ¸¬ì¡ûÎ\†=ƱÏ7Ê,GjcÊÛnL1l>¢üÌ«Ñ®qØpüâ x½ïDãûÂZ¤ ¹ã˜LÞµ\c_ÇŸ”·yª ôDaP=®$h&ïBûÍNx”‘4IJd`Úb8vQ¹ 4yá69µvÀàŸµL}³¿~r§˜ö¼ei]tŠÍbåÖ™ª¡k4üÆc2œºrK¡a,cë± ð‹ncu3±öŒ–ÿÇoѦÑ%Êì(Ì[»K‘ÆÙÐa€XN@4c˜õW£°çôxƒˆi}`ÊÎbú&oIZFµÁÆ?e;±hÆS©CZ‡`¬•Æ¨™ëämè{i`ÒìÔA7@+þ®}4ûÝ'~)³j¾ž%+ƒc{ñ–#tŒÇžò»ž¥Ëpè<~;W_IÐ%¾Ì.êPÀï`31 rÌ bf®gÝ.Ùtþâ›,ÿÞPñïëc‰Ð}âlØuÒ´3òWï? u™¸MVº H™MÒ’íð®ç”Ÿf)57ï=„ÏB2 Užd á1ÙV{‡D§1_`ísO_oª†8ðë"go>la°hÇ1h£…·<&Áû^ =cíO6!ÑŽ½€ÌeðfrÚZ™Ñ,Hü …œ³Îù´ãõÏ@]ÝzGõ~ˆÆ0Ú*€Ó·‘¹rDkíÀ¨QÏ8³@TájÃ>äM6ûÇñ–!?Ð F/f‡UºŽR©sp ~<8®ÜRþ=è³oÞ3¼°·Åú]‰b¸œ)Tfg;9¼³æäù[àN5Gœm<|êéתóþM=Ì46Z0œ¹z ¥-†ú`W™ØÆF=L¸Òâ«1måAVþFwå-C¾péÂN…uáß!ÏÒeø¤/±ÐÐ7÷•BÒâíð{ÚÃï4ó·SÁ8©ŠÙ%ïhÞRS':ÿ-¦HgäÍ*è¬ÊØz¼ÞgläpNž1 SˆB°,hÐe´¼>PÃöÖFñ-ß}\q;• ±%ë V¿AÏ’”¯\‘ZGÀ[jê…ëÈ¡l‹$ïΪŠ8Ó¼‡õ´©Ûp­‰‡ÎÀ÷‘9l“•5KwWÜ>¥@ÂÂ-P„¯DÆciÒâ_»è‰¼%¦nÐƈö£É×Gª—8»~80öªøÙ‚tÕbÊ‚ÍðfïxZFÊ"1±µ0x,¶@ÉÀ±v´ÁÐõç iñ6¨O¢Ç{ûÝ0þãÀ(Rˆ¾#µŽjÌ[^êFkÍ)/ȫм;͸ ð{I°þ€ò»å”Ýl7{Ô¢ÐÖ„€AcÁ6uz¢0atñZ¨Ûn¸ ‰_G6©\(}ê^—·ÌÔ‹v#&Ò“`¸w–)Ä:ûõ^q0+ÿ-ÃU¡pÝ>p¢5SÚ†`î–CŠÛbjøe÷1°ïôeÍ^†A)ÊäLF5t)Å’¦ o™©Î#?’Ú¼f3³ÿ3A a§HƺT­èW R«H“ÀìM·Å¤€Ë/0ø&"‹Ùc³â'Ò>€v#×Kßû¿È[nêCÛ‘SYšÄÒT£N,µ‘Ó–À žïoN]¾ ¯ö+§Í¦´ ÛÌ·gÉ ¦úØ9Š?+1N\G=•ÚD÷æ-7u¡æŒŒ7Øb ïNª I`-5Ðjøt8zášâÂ1É‹¶¢]CMos$ÌX¿Oq{Ì öB¶»qø^ÉUóKÞ²SÚŽLcgðî¥Øb(¼ç1 ëgþëôH°…f`ú¯1+h×*ÿÜD‡Dëm†ð–:Ðzا8óßf«Ó¼;FI¢xê·™K9ÒÛ\ÌÛzjµ61õ׳U$ä­Þ£¸MÚ±ûKNH®a¿á-?þh3"Ë®fÿŠ¤’³Ïü“aÉNëßCðàQ)|‘iÞìOijr—âv9| ºÒ ÐÃü¾€6š/Ñ ÷Øn.‹½ëïçÛ¯ÄylAÎZkMìÎ\®üKve›Œ¸÷ O²ŒwÄ%¶÷ÅAá„Â/`Û$yw†5Hׯ[DÀ;nãaüì Uªv¿¿î1†•"fÛŒÙKÚÒíŠÛ¶|×1ˆíYæ;•·ùÀ%êßRÛ‘÷í~ö–$HÖǃ¦Bê’mpëÞCÅvôÂuø+~~f"Ú™¼x«âö¬Ù+_ÓçÝÜɲ€[ḻ ©%µV,ÏþQŽÉVCYŠý‰wŒ›µN±Ò`ëÑóð>SY¶!²؈Ÿ‘°`³"vöœº¾© àµî±rFÄ»Ô@ù°–|‰2b‡sÔ¥v#Ôx€Ú) ÐÞì5zO*9›šõ<:klÉ:ø5‰«e„2¶µ“çm¬‘èé‰?+÷œ€^fÂË]0à7’‹†¿ßUÃaT †;È!¡®®µ±ásØ¥še:kdqàë{ýÆC§±E0qÎXµ÷$;üúûpïa);”vÒÂé+·`éÎc’¹>ôœ$ÏúÎ:q)aS³!0m0ôÐäE[à›ðiP¯í0ð#•³ÍžÈ´0l¡äî7 µþF»G¬äíxµ²•.4€Z(˜W»Å‡ý'ÂçþÉðuH:ü3(>8…-ò9‘¨P¨l§ŸÒv4qXž‹‹7îÀŒuû {|1¼… HD²‘·OÕζ#KQmyËÓ² [!)Ò‰Ùß4ÒÂ! ¼ÅP¨äõ6Û[ò{1ÄÎ\kPð”‘8sÒoƒÎ˜±¼ã/—4ZYØ6{#mƒo=lƒÔÍžorŽj!µQ*7:RPílÎÖTz\ºy69 ©‹·Bÿ©sàs¿$hØ)ZJ”±øyÛl³Œ¢+O%—¡n¼ej¸jêa#—± Ü-hQÐTÃ÷™T_§Á;}â ^»alqPj^¾æÀÛN{!Û=µÏ>orŽjÃfªm‡tE36ÃëËÞ6Ù3éIÐΑ¼åª,kêK.Q«ÙìÏÛÁ‚‚j&=Ü¥uÔ ©Å;ºQ¨µ¦6ì wç Ú) p‰Å[¶Ê ¥ælÌz¶å—6€ VMùÊÀeÉyˆ#ÞZÓ Åÿ„»Sm‰òZ@oùÖ ®š’³f «khñHPPÐ8Ò Î.ÃnKÎ#>ã-cóÑ*Ò Åÿ”»3m‘t·`«ÈB©±¦o)›Úõç¬YÅVþ‡ šJ*œ#K­Â¾ä-góÐBóäy^ÞΪ‡ ÚiáÜyh‚—xKÙ|¸h¾Ázæ<»ù‡·Cm…mÙU³tÉuðó¼%\s¸„#µŽ<'‚€  d3d†ägâ×£eDclÔ9¶ºI7 þœ­õâ·‡™ÿY°  ÑAAÁŠd²fšÔÒýÞRµœ5ÿ‘\"ÏŠ (X$þVC3ÙÎY»‡KÄ¿EÔ‘Äïâ(â×£gÍšlæt0ñëÑ"TìÈ«!‚‚ŽC¿<ùe9¦øõh©ùk‹$þ–ÙŽ-~=Z†‹ è8”gþé{{>ÔT4‹ø—‚vOyæâ¯ÍB)œA@Ð.Iâo‘+Ä_\Âÿ‰Aà”‚vEy¬¿QhNA â»'ºe¸  m“Îùk1]ê6FˆßhPh‰A€ž0Ó"\}¤}Û,@ áo‹£Rß4FèørÞöTF–ÉFäIß ñ›Ž–!_©.” »Ôbˆy—ur ¬ÛLX»¥æaÐ÷cðß×ÊÊFÞöé©ã xKÉvAA UÄIîA |ÐíÃìÄ[jò2³O^¸,Ÿ?dA ÷ ¾¥¾Rë_•“¦šðg‰È[ªò¤/5Öñ×Mþ”Z áÊ]ÄA©ùÁRKÍ+•Xè„Aê{©åÐ…øwOä@ ÁØ Ëƒï•¿ô½æ5ƒcÅyÈßðï¦áxá—™±ïâWt.Z«ˆl0´³<©¦”g›#È@©U诫µ‘olæ‚¿ßÿ´<`YÁ^»£NøÄ–;¤V˜u5 }ÕèñÒ2‚ÊÇ Ê²lf*¼€ˆ- 0š}‰â’ƒ@ó0ËRG&Ü!Ç‘¡R“°7L·Óû9mðýËË¥l¶'¶(óÿ#̸V` Ø]r ndö˜qý/‚Yد¥e“‡Eì] â·(š‡|ƒã{P¥%^ó!§°3#56ÛG®õ¤faÍð³K÷t›¿ÈÔF ŽÔŸ²ÿ/búœ!5 ÿ;YZ ¸ºÖÖõÃ"ü®'Š¢Ü·ZÉ9ðŠØ,PZ„}Îfh%:²\øgðs£$—ðßZÀb'–’6 KÄxN¾l5TdTfɹ‡¾_ËÖXš†¿gÿË €ÒrHkü¾Ùw+„ø9à‡òTó q„Ô<üm«ØMßC—®š‡/Åï¾a‘ÙÈ(¿mèƒ(–Õ}¤©gÿèiÕÍÃ;ãwo`þ§`Pñ7/âç– „—;0Ô8ê—Z ¹€ÿŽ‘Z…ÿžñšZR‹Ð¿`ª;A. Œ´ßH}Ð,ô¤ô?#V- Z¥oÖ…¼ƒÝŸßÒ”~âWš†üt¬Ú P&ü°ËØyc-šjš‚ïý_Ã@p^žU Nk-↦ñv}èÁÍB½p\ìgÀ˜€,¥Büj a•rá_Åh=^jòos†æaÓt¢p ¶ò_ÛòvûÏ@—›‡àX9*AYˆ_…hövØѲ @—eäTÿþ{²Ô<èO¼M4ˆ!ÎhûSî´Šø™¨ÎJÍ^çívƒø.ðMÝ• Ó? ,P‡KM½ò6SàY4 ”ƒ@«(ê¤lÕý{¬³ÕŽÆ”‚†A›©6¶oÊ‹ž9¼]nZÿNj6ûæBùeJ¿Fˆ_µø!ès©EÄ8©iðßx›bš…dzAÆ[ –f ÊÐB:óv·Ihò. 2Wˆ_À2hÚgÆRîµ$Y†vEôow› 'ÞØ+èAÍB¶Ë—ÈBì“òe¶"Þ®P'š†e‹˜¼…j)Òåµf!½y»Y@@ u‹æ¡÷ä”Y‚U’ÍYpßÆ+µƒn'nö£n¦´/²6…ΕD- Pš„ b+åMCì‹Í14 ëÏÛ½êÆwš†Þ`eoÑ*EjK“ЛR“À?òv¯€€Úá„‚)a)3oá*9û7 ]Âî˨MBº³kæMƒíƒti³i/o· Øœ5ob8/—*pMØŒew¥fÁóv«€€í Yè4¹ PˆkB¶û/d»Â! `$š:cxÊ]À5¥ÄBx»S@À¶@irD^A¶Q²ôÿ¾ôCȧ¼Ý) `{h/_?ç-d3Ù,ŒÀFÉÕŠçý Ø šøƒés©Ô$l’ìJFˆ†·l-Ý_À™t»\¨@Ð&‘­<”š|ÅÛ¶‹‚‡²™”» M¤´v° & `&šþÓè{r]­aK9hÅðvŸ€€mÃݽ. i¥Í•lí"øÞî°}|4ˆ=ˆ‚·¨¾ïÇf (oC>@AÝ`kx‹Ûèô?8ž·ÛìN(þY6“4 ~"}çׄ·Óì?÷`[ƒy‹Û¨ô?è0{Ö€€€BøÖ÷]é‡ÀëLd?ª—ÍX–’ÉÛ]ÕãÿtENÄNcIEND®B`‚UEFITool-A66/UEFITool/icons/uefitool_32x32.png000066400000000000000000000032561442134156300207050ustar00rootroot00000000000000‰PNG  IHDR szzôuIDATX…µVYL”W½¨5­ij«Õ¨ñÁ4µK¬}¨éKÛز‹  "Šì²ï :*( ˆ‚Ⱦ*ûb­ ŠÖ‚˜ÔZwAT°©àŽˆ(Ê2ž~÷þÃÀàÌ`Þää.ÿwÏ9ßwïÿÏ0ö:-´2ŒÉ~ ©¾,¸¼þµ¸^«+©D%„TR¯¸Ï+&½}q¿Š),HñP•© L*ŒßœP@™•·ˆ}¥±X¶B+ÕDXõeq±aå³XPy"ÌaòÜw_]ܿIJ`¡‚´›æÛ&„Ý$Ö!JF€¯•vòÉüBP/bCöBðø—1‡W1áW´šhh Ñ•K¼\×[ÁM¿Lë~ÅEÌ¿ì=Ýâ>…¶Ì¿T)6øê‡O˜÷ |*óÚ­GUÆ{w¬þ#ðÌ+¦R­É¹`«sðsR ê¯ßE÷ó><éíÇí®Ä¹Ï<0·l0ÞÜË ¬É¿Å|Š>ÑoÀ;ûsæ•ÿ˜y‰gîܳ1+RÂS-xñƒí)ˆ;|ÓC‹±(µ©uW0™Æ<^c¿7“W^~qÞVg}Á>}®6öG#&ûæû¨w÷¨×û”È9qésNâð¤¹[f¥vQ—ŒiÌ-ÝšÁ\Ó3× P/Á)³#K0W®€cîï¸ÛÕ£.ýpC¼¹|KÓŽÀ!ë< êñ‘£sšŠKpö0×ÌT2bÅÜS§JâN)'H¤ƒ¥ss¡ ΩVî„}F­¸lJªoýµÛð/i@Bõ9\¹Ý‰®ž^Ü{ü uÍ·`³«† ûq±­Cm(«®‰8’‡ø8¸×rJéÚÌ…g™æ¸K«’1Þ9n>ÐÈòÉó~,M©Á;ô|Š.&ùÒ]±OÄü¨rt?ëÓˆ=ÿï8&àV͹&×fIЊ‰˜â›NU™ùýºÙÑ­.ÿ<9}å–%ø|ì™–{]¢JɵçÑÞù„ªÒ£¸*ŒY©ƒlÅhÅò|ê©60 |Ué5¨:}]Ìž»1vdÀ&e bíäÕ[`Kãñc´®ÙµÈ:~ ãµó‚9ì¤s¢ û!ª†Ý6LpJBëÝa¯Ýð÷»Ä¸·sBéfÛÄ¢¾¹M¬8ÛŠ“X}FÌ/Þ¼ƒå#x9ì·“&¯i³eñ2Â1ÂS^vfO¥“`½{ÿº&Èž÷õãì»gìžu˜ lEc›tOøH?zµÿójª®æãÜtd¤ÕI¨!D ½ŠËâ?c¶qÌ6öJI­6aÉö*uö ¢K`µµ·Þk‰‡Nƒ-‰ASûÐÍ/9Ù„ƒg[ÄØfÇ>Á!¸glé¸0»¸º?D61éDÙÇŒ·Ù‚Ú 7áõ;P44Â1å‹Žc}Y ¬7£IUz>70 'éHŽRÆ©8l§bô/¡eô7ØË–sŽEQ˜é¾—é<‡·R22Ç' cÉ@£êÙÁ3×ÁÌ×cûþ?1Óƒ^7Ë(¨yøQXÇXŽn`q”•Uɬhó ˆtºËüzªYÄI4}ïmPWàeÍçã¬IÐb48x¬6&ë·–¿OMÌ*Z©aI0—ÀÆF S^UIôŽ[¬ÇØÅQÂXqÝEü £OïB¹æ^5ÇFŽÂ׺ XÈ=ÙâÍä^®œÜXf!õ47 ã¹I¤]{9ø…´Ó’®Dæòï˜ùºvQ>óµÃ°ŽÄÖXÓ-ñ|¾p½’Lû’¼G|KÚD¶f‘RÖœÐT¦d”­XÓ‡ÁSÙ ªÖ…)%3‘yzE3];6¶©Î2“p{f6ŸÆDò”È©Üšàk¦²>Š©¤~%ñ=3“íc¦*¯,>¼f2Gf&Ÿ ±n¶‰™QEŒÃ5ÁEŒÃ¼ÄcaL\+ÿŸ¸^c‘_’‰^4À35q}sBºš\>†ý\/²6 ‘`Êû.f:óíàÍ08‚Ê 2"Áˆ› ¦7ún·ööb/Q)¥”6¯IEND®B`‚UEFITool-A66/UEFITool/icons/uefitool_48x48.png000066400000000000000000000054731442134156300207260ustar00rootroot00000000000000‰PNG  IHDR00Wù‡ IDAThÍš{p”ÕÀww“lžHH™‚Rˆ€" UŠø@ Rd‘‚UÀÑa, D¡X¥ EŠµCñDŠP„ò2„áaB$! ›×f³ÙýNÿØG²É·!ÁtÆ3sç;óÝû×=çܳç®EšõE° Hñ³Ä ¼ŒÈ YüˆÖ< mA¤¤ ĺP©+^<è‰"¤­šÚŠzqƒ —å£êe×U"ˆªÚ‚o‹PéëÂPXdÉ£ú[/ ÜÑš} ß/¿™ëÃP˜eÉ£%ד­e.$2 äm±*=ÃìgQ,H ˆÛÚ~G¤kŽàé53c(J^Y®Ò3®'šº^«™ã€@ øX œ·Æjjf†‘ž(•Áê#®n üiM$ ®¥Ô ˆ‹!­w< F¦V\ˆû>_ZÅ_¶#ãh>µu­.…fËŠ'ÞlÂWo¥¼û„d9ˆÃçP’FO7hTŒĪñƒX6&•è0³WhAáÈÅR^ÝzŒm'/h0ðxj"}ã"1(šÐÓÁ VëÉê?w‹l&½–4^ÜýŒ‰fÎð>ŒOM"*4¥\êy–V×òÞÞÓ¬;ržÓEÜßž—îëÃ==;“[\ɬ/°÷\º<êñUò÷?·NMKýÎí‚y}d?ž|3UÅ5l?UÈÜÍ?òs¹•„öa,~x“÷ €RŠŽ‰Al~ö~ÿþNöæywMlþ&üû"O"†¸·Rg„™èâÞ#ÀñËט–q€©k÷QYcg|jM¼“éÃn¡]p J)D¥&£âöÄ(ŒWÒSÔ³ꉩ»ê™cûý*熲*9?_ãÞ^q˜ ¯Û\*«â§¢r~wS,Ï éÉà¤:†Õ»¸<ãèÅ–ì8ζ“—p8šÍN7á*W~h"+“ÿaDĺF½uI) :<!Àh`nZ?KíŽ9À¨û‰gg”RÔ:œä—Tòì>SHLDÑáAZ¬+(£²ÆîO‰`£[‰"8¹#Syîž>„š|\˃wž±š¢r«î÷z`h.Ë4·%vÂèvxp“ÑÀÃý»1/-ÕoFyd@“ïêEH  ‡S£Úî@ §&:_L­ÝÑbyi]"C¼ó@Er«+ðŒF& îAZßÄ&ßF2ï¡Ûèè.1þ¹7‡©ÿÚÍÅÒJ®VÖðÚ¿ñÔ‡ßPQSÛJ4–ÕÈêš&¬þá}ç}BÎåRDs€‰?J¥k‡0ïw„9ièÀ•òjž[³‡¯³/ðÞ®l†-ÚÈÑ Å¬œ8”¨ ˃¦ajMÄ”TX}|V)xx@wN'Ï]!¹KGD„›cÛ3¼Oì>ˆÊݽºxéä—SWç ´RãÛ™><…‘)ItŠ®·n ¡U ä[¼¸Ç:†3í¾®Yk½ï#Ì ¾©3Î`©®¥GL;¢Ã]î'"Ô94Ì&#ÃxeôíŒì—„Rnš­TÀ€¦e¡i%hšv½íÊ:_LeÝÇ…Ê­µÐ)"Ä'« HìD\»Ð4:„hôÎõèÉwóå> tŽ Å`P(¥°Õ9¨µ×µÄuhÚ4-ËŒ"2 ôýÖ_­½ŽoO^`têÍîÌ¡±éðOZªyòw½éê=¸ºFE"•ò üØv¡¤Nì;s™òj¿u@ ®Cl?JeY&ùlf>¯_²Hpõxd 0RÂÚ}§xðÖ$‚Œ˜Œjì–m=ÌÎãç™zÒR’0š3n4L06(øê•ñÔû`«sðÑîl@ó×Øj9¢.¢(”Ïf: A1'kÓmÀYଷ(á^tNèÝ'òÙpð4 ê…Éh`üo{QPVÅjcåŽL>Øy”Y£î _b ‘ÁîìUoi¥6»ƒíYyd_p•øuNuûrøæØy—‹x÷ ‡,‘Ïgj,n5*ëf竱 wá*ê|àjy5ïï8J¿Ä’㣈 bÁØ»¸XRÁú§yéÓÝôïÃÙÂRÁéÔиKnÑ5¦~¸Ps'/]å½G)©¨Ö ¥²ô&šû=° ‘*½ÃãÀÙf² ›Ý¸¬ª”¢kt;ž0•·&£¬²†ìü"Áátz*kìTÛì PUcgÖÇ»øñ\asÖjù|¶n™ê_M‹DÓõ²€£ÎÁW‡Ï2fñzŽåQçtz… 0’œÀß&ÜM÷˜HÐ4D¯K¸R% iTYmL\¾‰o²Îát8›Ë:ýÕ˜¿êʪÿƒfÌ30 ÐýäGó()·òô}ýwç-„¹ò¼Sc[f.‹- òz½ ÕÖÕV›«ÍoýßF©@Ëbdþ¯‰¼àÔœνLî•2¾øï)†õI$)¶ÙùE¬Ùs KuÏú"K5žâã=ÙøFéuÁ ¼ Æ¼6I6Î÷ɳM[‹£_ÇÕy¾£5šƒNíB‰nÊéË%87|5V‚«Ùö‰lzÅKD¯µ8èq£\ô ØRE±åß(E[q)è±H&ÈéúCæW3, ‡@|,¡ßZ5? ‘MÜØÅÅÿ,À ùjÁêÆú­Åͯ•€LEd"?±!bÅ;Ð7ùÇ5+ͬ)Y¬Ñ“µ¹û¬¸‚æ¯Üâ@ä"S@&!ì\=TObiˆƒ?\CÈf <‚ð6.K7\cAXŠ°R¾Z ý׿äK›…ÈF ŠÓ ÞvÊ–×íîy®jöm\.׈€.Ù*P#@É–7¼J›2á~w¯j6¨Õ²åu¿©ëº ¨/÷ÀÕ7ú^¶¾¡ÛdU#æ< jº1Ó¸¼d³l]8Z—NÚ3¢q(É- ›Í»- PÙúÆY\•js‰HÊ_ ö9¸þã—×–…6àû–Èmù_ ‘€@K7Ù]Ìb±X,Ö”7Aùjº|giFN§e€XÙ]Ìb±X,Öí žv:¨=Ê€)ò¥íš·K ^ÔRvW³X,‹U¥ üw”þ“JÔõj8L³¡î(Rä½&»«Y,‹ÅªR?Ë×"M-ÛQš™xÈîj‹Åb±TY,MÐ1-·¬aìL%(?Kvw³X,‹¥ªßÔ• ¼ëœþ·3T]1(ïˆâþ ì.g±X,‹ÒÿnjzZNǪ̀V‰0ù]Ù]Îb±X,–¢Y&q _‰ã€A²»œÅb±XŽ.Ÿ‚'”~y\ýO+¾, `†ìng±X,–£«_þçÊ®þ§ýÅ>€3Š·å1Ù]Ïb±X,GV¿üH®þ§e@Ö¤r¥þ'²»žÅb±XŽ*ªþ˜·—«ÿiŒ¸ò¾•Ýý,‹ÅrTXÞE‡TÊÇÿ4†ê-å/V‚ƒË,‹ÅrDå æêP÷\RMyFö`±X,–£ÉÉÒg¡+¸úŸ &Øx˜×Fö0`±X,–£) ÿ%%ÈrCéO)Ñš¯¨,p^„ìaÀb±X,GSPŽ»2pª|Gè¨ÐÆË@ËÅ-¶™ì¡Àb±X,G’¨þÇ€4(ód¹®øZ^”=X,‹å(òÉzB Ê;k½£ž‘…Èäw“=X,‹å( Ìn£ô›tK ¢Yh#‹/§`‰“=X,‹å( Ê›(œlèèÐqÀÀ¼ÝJ𢖲‡‹Åb±Ì®À´ÖJeŸõ,:#“~b@‘â—ó'ÙÂÅb±Xf—_Þ_Ñù”ªÎGNÐÑ¡: ¹²‡‹Åb±Ì®@Ë7Ê@NÿëõzàlÙÂÅb±XfVppS VŠÝç²£B'1óŽ(ý¦> {x°X,ˬêŸý[ npú_G¨}Q¢L~Wöð`±X,–YEkÍâ&:8>¦ Z’ È ’=⤱ü&ýLñÏ=gY2F`€¨'{è8¤ü-¿Rúå‡cvX Ìõ—ý8,–±å“ó†˜wH\v˜wK ²LW,|ë™VòËj'v–òú¿aè7 Ën%xQKÙÃÇaÔ/ÿ×ø…œ÷2P&(¿T Èö•ýh,–1HÎ?ÿPUúÙzéI¿ü›J@^þÙ˲Ñô °D‹6—íÔ˜Ú£nÖ,Tü&ýIöð1½|-/¢]ƒm~Îj›ªõÝÏ_¦øçúÈ~LËXú‘óÿ·Ÿå_ÀW˜ÒÒÓ²×”òŠ¼_ ÈÝ/f”²S7ès`ñ”=„L«€ü—ÐþŒCçÞj‹îŒqÀbÕMäüƒ,‡EiÓÀÜ»# r¢£ R¾œñ°ìG7•¨ú_`n©(2SS?0úCÙÙ²‡éDYÇ ¼ ÈÑÆ"Ûr¾P¯l.Ur¼e?>‹¥oùg¾Y+ç_J»©;Ÿ·*þ9Ýï™-d¿†)˜ý­¸üG¶3cê•lÌ>¢x§?({™B9¿Gû…\¬µã¯,Ö=äo©»ó¯]T£®Á-V|³ÿ)ûu -ªþ³Z´©lgÆÔ5kS¢øeÿUöP2´ü-¯(y1Øž—êåøoë“Š ‹ƒë6‰£~ pþÕÙ€¼2 òÅr«îòËúZýÓÿ†…Ö¦²ƒd%CÊ?ç؆ñhC®4ØñW§"ðÏî+ûY,}ȖοòƒfÝd¹ŽÁ@”8ŸËª½h™-ûƒÑ „rfÈJ†R@Þkèô‘«6uüÕá €Å²Šœ`ÞÕXåÚÚ‰ÛŸ6DåŨþ;Å/ýg²_ÙòÏ)°[Ÿ0Ú@ÇfýsÎ(iËNºW åu$Y¡2Êd/¨íìÙ7"°À À/«ìWg±äÈÞÎÿ‡ÆP¹ðCçÍ›£jITýÏÞF±ó˜Çà7ÀR®ä|"{HéVTh,À’†\×ÄñßÖ?°Uþ9o£:ªù,“ÎåªçÚ×+¾Ù”àEMe7…îDÕÿ‚òo¡Q”ïʆ!öä ‘=¤t'1ùÈÍÀ1~Cuü’ÆzEàŸã%»IX,mä›ùRœuD@)RË\tx“Ý$º’N¬5[Âçþ9Kù «|-d{²›Ru8`9Œ„óÏ“ëü+±¨÷§æã¯3ÅÎ_G——å~œ1™éýÃ4‘Òι¤øXž•=´¤Ê/çüŒç"…ºqü?ì§@K©âÃAˬҕó¯þá«Ø(h¹‚AÀX¥¯å²›Jš|sÞÃv(Õdê‰(}KñÉl+{hIÕA°ä)¹EºtüÕ©²¹„3Ëd©7:ÿ~ûO¥eSø!¤x[“Ýlš‰j›ûf¹b;¬âÙ¿É }~9£d1MåŸù>:þIH±îu8`™NiÁâ1õšR|ÈîÑ¡@Å?g·âNÑmÚ}²›Ðæh¤e¼Š†&ßy!rAJvþæCôiÎNÅû›úÝÌòÏùßyªêø'ÇñWG,Û`à›ÉAËà ÈFçŸkuþ9ÆBœÆs¥â—ýzMcO2þY¯)Ùý”Àœeø^×D±“ŠÛþd·7c?¨ýs®b@»?“_‰]ðÁ–沇¤„ã:û#´3Ó*ÜßZÀJv›7´¿r鈠‡ìÆe±ê'rþuþÕQ3·ÐiNWü2ޑݬu–wúËhHüѨNŸ dŽå²Û–ÑêoqqíwÉ)Rü³7â˜Q|Ó?›?& hýÒ?ÆÙò á,+î­Ýζì¯@K ,㉥Qgþwü0æZïÈ-¥B}³+»‰kT@ö3èð{á³ÏÄ~¸¨:}žé3Vh]Mý%0g®C9þêTf8`éUŽâü«CÆR}ß­Š_v7Å{\ MÚšfû~9ÿEƒhAcxIuú;øuÐ.Œñ©\&U!¯c »HõÖ(ëEeº²þ‡Ï²@ìÁqDÇ[Tì ÈtÓ¤ýY¬ZËuÈPª³îÅŠ¿åS»µs`Æs8Ûï‡l©Ú—À)~ÆΈ``RE°{Ç\¬8klû»4œ‚›+þY_(t<µâç:²ã¿­(ÈÅ ›ƒ–N€Î?¨;î¸X•¿¥TñËÍW|Òß°]g½&6iùgŸå‹+fû²ß™q<èœz?±üU¦ÐÉŸìÞJ  ®¦ìU,ôÏ]¢–éžÄcüŽí/Ž–ˆ%,–T‰™;ÿêˆ@€ ¤H›Fa@ð«zµ-ívöÉúÃ|äšzoEþû1 QQdH½pè ÎJG(¾é/Öyœ{Ïl¡øf:á÷[ª–.¦ïÇŽ¿æ¶W=sÀ’(ª³íŸ{Bÿlæ‡Tdü²Ïáõ;Å-ýgµjWš ùf~Žô¹ Ͳ*gB:x'†¹3öœóJ@vŒuÓ`Íê‘Üÿmã+Äÿv$Gþ»…k&À/Ó¥¡¦œÅª›|3ÞGÍhÝ[öAïT¬cúgPü3ûÞõœ5D߬Nh çŸ}–?Ã0 sG*‚Ÿô®²]ËVòIû‡pþìü†a˜Å‚²90…Èùûe‘o&Ã0 ÃÔŒ?¾Ù7ïÌ.²]«¾òNÿ˜?Ã0 SgD…A@†9߬sìü†a˜zÁA€¥ÎüÙù3 Ã0 £"ðÉî,Ûµ±î¥>©Ÿ(~Ùìü†aÛPdp [±óg†aìAeÊA€îÄΟa†±'A@߬N²]«B¾™ìü†aûCA€_Ö Å7ƒéòNûTÝðG‘YÃ0 ÃØÿlúzSéËA€<õMù':ÿóìü†aM¡ À/ó†â“ÙQ¶+t<ù¤þGñÍ Ã0 £-~” À €ëh('§&ŠOú<%0Oþ`†aòCÞéSd»EÇ’wÆgŠov©â“)0 Ã0Ž‡º1°HñÊxO¶Kt,9Yš(Þi3ÅÎÙƒ€a†q<è†YŸ´\EF²]¢ã©oú_Eôå›% 0 Ã0ŽùZÿ÷LzC¶+tT5R¼Ó2Õ(L‚a†q Èïx§'Ëv‚Ž-Ÿ”?`v…³ Ã0Œ&ƒ~§OÆ+²] Ë'cji` †aÆ\¨³ÿïd»:ÖäûÒ7u›¨ÏìÎ0 Ã0¶vþ{gQüÒ&Ûձé]±£nI, Ã0ŒyðÇÙßÔ/e»8VMê‘ÜR银\ñË‘?`†aãã› JŸôýŠwâc²]ë^ê›þoÅ'³TñÎ?p†acCJ¯4Ù®U7V¼Sgˆ Þi Ã0 S?hí¿oÊNÅ7ù'²]«¶ê›üŽâ“Q(ª6É@ Ã0Œ1¡£åÞ).²]«®ê“šÎY†a¦^ø‰ÙÿFÅËr¿lwƪ«è¢†¾iW8 À8}‰TÀÀ¯Ïd¨ø7ÿ‡þ?}Ÿ¾:x'†‘‰oæ-Å+¹‹lWƪ¯¼SÆq€1<äŒÉ1{¦Xw’úkrØä¬ñß4÷Ï€G¿Ì…g¿™¿^9þ2f6|0~ücâ<øWô‚Ûø4j>ü=r|8~®øw¯ü^Æÿ÷|ðdñ}ZøgZ6)U?Û=©*`°þl†1TO¦oÊJ%8¹¥l7ƪ¯Ü“ŸÇÎ<…‘œüÅ0u…,:ۖ茟ÿv2¼1>‹[¹«aøœ­´j?ÌÜqÖ9ûÏ]…£—nÀ™«…péf1\/.…¢Òr(+¿·àκ…AOÿîþûËøÿÎ^+„cø}èûm:vfï<©k@Øüíà·Ú%.÷ÆÎß|7îÌRƒ¯”ªŒŒáI§Ù¾_Èva¬†ªOê7j4—Æ0Æi ßtpÎ\ [O\Ž¹°¤ì.®\[•–•Ã…Epèü5X~àŒD‚¦¬ÁÉ«¡Óá l5cáÁ€{²š=裃6e˜Ú üEêBÅ-¶™l÷Åj¨<ÒGct@ñÉ”?°æ^xªéö÷Æ̆ù{NÉöõuÖµ¢8tá:ÌÝuBænƒŽÉKá#¦CKºHÅËxTì5ÐA{3Ìmàìß'³Çè?e».–­ä•ÒWTs’>¸æ.CDçøBðdˆ[±ŠJõ1Û·…®–Àž3W kÝ!ðÌ] o‡Ï„û²Ô`§"C »ý† ÙŸ´ïE=–Iä=îA4°[Ô¢:d SIªØX÷``M^§®Êö×v-eì?w RW€îiËá·C§B#Z{u·î#àì#ƒ>EJŸäd»,–­Õ'©³â“Y®qb@»éû¤ÀÿbÀº#çdûei¢M‹+ž…AÓ7Á»£gA+ÿ õ¤Ñ'E~?1Žûï“iÐ#mì>sE¶o5œn””ÁÒýgÀ#g<óužµÂaRµÊ… SOÄ­©×¯äWe»(–½åô‘ê) >ÆÜx©ÛÞ=æì:!ÛšBTì(aå>ø`Ühê›Î¦aˆÙJœl×ÄÒJ^É©Öb c¬ëü¿œÑËv릈ٴúð9x5dšõ(¡ú1êDð¢âÿ[Ùn‰¥•¼R~§ôI½,Š>P ‘al‰[<àŸ ~ykáøå²}¤iµ÷ÌðÈ^?¡Êƒ^:èwÆxP}¯ä±²]Kky¥Œ/{2æÁZ ÿßQóaõ!Ç=Ögo¿^Cfn†ŸöÏÁ`+±êC†© }3èëÅ3ñÙµ¼žÃÎ?©xgȈŒ±¡ô3Îú7´²×ì°l¯’²rH_sÛyªhoõŽô?cLÔÙÿÙ®ˆ%K^)_‹›éxÃÔšyâ ô±þÙðÎH©  Ë>Zºï4ü}Üœj»ÿuÐÿŒqñË¿Ç÷”ŸËvC,YòN|L铼_ :”ŒqpO„¦Þ©Ð5y 컈ªÿ¥¯¥uþ)ê?OvüŒ˾I²]K/òJì¤xg”K˜Œ>AGÔÚ/¼sWÃÑ‹|¬Ï^Z¶ÿ |Ç£™0tææ:/óÐòÀ×Ó6@KÊ`ð’€ õÿ´R´éÿ‘íVXF‘[ì³éŸTú¦é`36Ášîÿù—¹0váÞàgG­ “u~‚žŸåó˜ ÎöPÖà…Áy¼$`hç¿GÒÅÉÒD¶[aI^I_qÀ$àŒ¿ ~푺Üe½—Õpí;«®ó·ÔË:¿§šî1xd­;å·lsœóÐ…kðYÌ|µD1/ èœý÷M-Æ_$Û°Œ&·ÌŸâ‡{g ŒÕб¾‚­œî·—.Þ(†Ð¹[áÉ:Yç'Ð9·öMƒ€üµpæj¡Íß™®&4m4듬,óchöOG»éˆ7‹Ugy$zªÇGt0˜™º³þV>©4i­pP,Û‹fÔÙëŠK7ëüÖe‡ÆÌ‚åÎؽ èýë—UU3€Ñâìj¡âÿŽl7Â2ª¼"ïÇr£Ò—ƒÃ@³O—øãð©0÷I»;G­óÿ+rŽzNÞM'é~—xxf`.D-Ùť嚵ÅêCgáåï&ó¾=!fÿ‰Ù²]ËèrOl¯x¥– Ãè:Ú‡_½sV‰ãg,Û‹ÎÌ»g­€–}S…Ã3nÙýîM½’À9m<MJ»¹xþ1n¶Ú&²ÛÃÑ¡µÏäŠgüë²ÝËèr nŽAÀ±@öÀfîÞ§¿ÌÜ ¥8³K¬óÏÙ OÒy~—8uæ/»ÏiíûýO!0s{íÎôÛSt´°gêRu„#GÅ[ìüO’í:Xf‘GBGt Ztïž »N_–íL'Zç·¬?¤óü4»u×ã÷Tûü§0|Öf¸VT*»™*U†íõåÔõÐH=ÔI[9böŸtmöïe» –Y䞘&öÈÜÌíXןÝ3WÀÕ"®ßok­:pþEçùÝ«Ž¼É†žŸ§MìØzB¿GÍßÍ+NÈn3GBTýKˆ”í2Xf‘kì_¯ä›•}€Î¿)~6s3ðe½¶­ó{f¯TÏóëeßCM÷¿ôí$ÈYlt¤ß®JZ¹Z‹Ê: žÌÍþ½’Ï)îI¿–í6XfPppc4IÿP¼’J\‰Œp‰ƒMœÅ¥|‘OCEw"xÒy~ïäjé~àÍú$Kú28|AΙ~{iÎÎãÖL@¼üv6+T¹Õ#aˆl÷Á2²‚Ñì¶zôOƒšéàÇûeÂn>ê× ]),ˆyÛà©/³AéKÆR~ßZû—‘?‡Àlœ-›Ußo? ¤q`/Ô,À KOËv#,£Ê#éÅ3¹´2ÉÈÇ%FÎÙ*Û~ZS6†×‡OUgü”Š–ݧôŽƒÇ3 döf¸^¬Ÿ3ýöҔ͇áŸT}õ™ e[÷Äoe»–%Öþãç(}ÒädFÅ5~ýM\âK}ê¥u‡ÏÁÑóÕâ4âXŸúÔÚ¯äÛÅmͧ¾ IDAT.€í'õ{¦ßÊX³ZQltO<¦¸ÅþL¶;aMbçr Ïþu·~¿I¶Í6œŽ\¸¾¹«à>ïцŠ»ä~¬€Òýø‹x7Ùn…e¹%䪳ÿF/ôŽ…ÁÓøÜÿ½DëüŸGσÆÖÝôÒû­÷xчÏ̆¸e» Ôgúm­›Åe¢ï*Oe0¶N¸Ç¯SœFµ’íZXz—GÂk5^GId\¦ñ0mëÙ6Z·:zñ:ôÍY ­èbÞVx@óÑÙ¬ÿƒ>)0pò:¸pÝqûÈÖ**-ƒˆ¹[ÕŒm º® Î²Ý KOê‘Üg0kÕ¢:¤ÌíàL÷Ñ€t‡ÝpìÒuh3_uüzšõÓÌùxÜ,X{ˆÏôÛRKöž„÷#fð€­6>~‰âÛL¶ÛaéEqŸ(‰e•˜}áM=aÛ ÇªOZyà ü.8”^Öþ²ûÂÚŠs üb`$.ߥåŽZÄ×ö¢ë™ÝÒ—As:º&2=:és³ 6&*.QoËv;,½È-6ÏZ,‚Ñ+èt&;ØÚrþƃð¨_jÕñ>=€ÏÒ“GærQ{€eÑí‡cl‡§úgªÁž[œü¾6+t$Ð5v”l·Ã҃ܣ_VÜ㮊ÈPöÀdîÎ8‡~¿Q¶ÖLÉ+÷B+¯DqŽ^zÛtÌÿÛa0× ÙÍc*ÍÝyþZ z®:éo3CǼÝâðý,œýÇ}'"BÙƒ’©çhøfþè”á׎ñ ¸ £ EÇYCgm†ÇƒÒE`Ëé~ ˆÍ€q“d» –L¹Å·Q‚üÉÜ×8˜ºù°lûm7—•ÃGc¾3n©íLÁGïXxcʶ…ï_°¥¦n>:YícWvüÒðK¾ç—¸_ÈvC,Yr‰›""AJs2ú§W4tI\$Û†ÛMt”ŽN;ˆ£~2Ú—¯øÍ \ˆ^¼“Óý6Ô–c mÌ|hDNŸŠ8Éþ,1Öš±î²ÝK†zFÿ#ðK•w”3úç£ipø¼9o”[°ë„õ=5nW«ã¶ ±Κ|™EK¹zMYù¤ˆVZpÇüª è7_ n,Û±´–k¬/Ïþ :ªïf˜ó4ÕøÒÃâ˜mIçÌcàù/³`Èô pâ볕ÊÊË!cõ>xi°Euü¢ >?Lî"ÛvMqŽú½lwÄÒRTÊ-v¹õ8c$Ði=70[̬Ì(ªõÿTP†ê4ìÑ~”‚)^ù6FÍÝ §¯˜³-eiõÁ3ðéØ™j€Õ;Fþg†¹;ê2€¿l—ÄÒR®±o`xSl‘=™ºƒìÛéëeÛy»iÑsðÆð)VGÛðö²žáWzEAË>‰ð1:§Ì5ûàZQ‰ìW5•_¸ÞÙ+ %Õo°WÇØšºÆ.Qœ,Md»%–Vr®¦ÿu0™ºƒNñ§©âµYu¥°¾)Xû§Ò3ªî3Iª!@GÌÐ5ñˆ‡W¿Ë‡¯¦¬…ÍÇ.@¹ÔRÐRTÅoüÂíð Uñë­¶½ìÏS;è˜kÜ5Å#—BN–VŠ[ìNÿœÍ:Å·2“סßwö È_¿˜­f( ÇNýÞÅšf¦?£¿ë¥: }’áýðéÂé/ßn “bÙ^³¶…·GLUõqºß˜ð2€É%{|1§ÿO#—H^±G¶ÐDoÁ”‡À+s9|8j¼88ž Ï~™¿ ¶À{èì;',€Áë¡`Ëa8rá”–—Ë~lÓŠ.¦ê¿šÐXtæt¿¡Q—ñiG¥ÿ=SÔuQÆØàŒ‹Rä[_í4ݾw¥°.\/()cg¯…Î^-K3û¦¨|˜†á&Ên_Rzľ$Û=±ì*h¤¸ÄnT<’ä:Æ6ôŒ†7GLóè Y,{‰‚®ôÕ{᥯s­{2bå}ÆvФÐ%ÆM¶‡bÙC½G=‚³ÅO1Ê@±HûÐFÆ An3ŠJ¹rËöZ¹ÿ4|B%š{G«é~Ùã±=4)t‰ù^¶«bÙBï7UzE¿¬¸D÷FgŸNÿ8vò-µò“c{zEOö Þáβ™öž¹ néK¡…g¼:ë—=ÆûA“B—˜›øëH¤­â÷´È³ ¢ÎQ+n±cç E‡¿¿^e~)²£ªO®<ë75´ggƒ ÖÉö,ƒëâb›½ ž H¥ÇDQ4Iúøf4 N-LþÂ%ö<2GqRzG¿£t o-Ûűª‹ 7¸Å¾¤8G9cçe(®1Çðk¹è@*ñÈi~ǃ uïhønúÙ>„e@QöȲîü!Øb]ççt¿ÃBAM Õ¬q1Ú–}Ä¢Ïé¬ôŠzO È[ìCØÇ΂±>Ïò™Û±ÁÓÖ¯°j«•NÿÆͬª©`×1ZALÕ¾‚^Q·ãlýsk½ÙŸ+G†&“T0HL.¨?.+.q‹•ÞQƒ—¨¿)Þã”íÍ)šå»Lø :þŠk|*:ü£Ø!e<ËgjÄE5âA–U|<ŽU£öŸ½^™Ë ¥g‚ýÖù­e˜ÅrŽËÆh·ZàÏ{Ä/^ø*þ4tü_ÈTx?|š(Þôבðça“á7_çÀOýS¡¹G|U¨žÕï'û3æÈß©ÌÄ”!‡1 HÿsYéàল]§qåú6â‡hăqÐ/G®gϳ|¦.PÐ3z$-euY¬êº|³Âgo†ŸZ×ùmåT+f÷T‘¿o#üõcið·ˆéÐ7k9L\´æï<ûÎ\5è9n—Š,¬–"ôõfI™·t5óΓ—`Ò†ƒðí´ ðùÄÙðtÿ õgT<7g$g].H²Þ.{ûcÒ;v¸Ò+öŸJŸ Êv©ú–º–ÿKüÀtÇÆKFÃÑFU´#QmàÊ”ÃÔ:«Ý=Já¢Êx,•ŽÎ[^û6¿ª¬²­Æ›púQÐgˆþnø箄™[Š›+mY²š @l:ŒÁí"xÜ?UüL›¾SD@¹ÄÞBtýY>ž8>þ¨|:®…l—+_Î (½£?Pœc¾V\c–b{Em´Š=Ô˜1Œ™è]èjXÿÌž?»G$¼<8W\ÓÊr\-Ûw >=£êÞ[kkjÿÅA9Ð/o¬:pZÌàµÐQ l‡L_ÏöK·f¢mó^Œ °” zÇÞP\¢·`Rœc?ljïÏd»bm$Öòã~/ß!à 6P©š6I`‡o6ÈÑZe÷Hõ+þÍŠZzÆCë> ðŸ$xØ'îï“(þ¬™»Z×_¬“ÒÿA‡-~mKc†Ïñˆw$.ß­‰aféG;N^çäEbœU¥Ím0Æqœ6Åïù19k÷I]j:vñôÉ\-è{Ù(¸al ù¹Šå zGŸCŸ8ÿÎOéû–â4ª•lWm;9EÞ3ü÷—¨¯ð·_öråË»ñ,ßtT8o4Œú¦À»¡SÁ5m Œœ½&o<ˆ³¢3bÃÕé+7EJô,B¿>|þ¬?|fn;Q‹v@ e|6aüzP¶ºù©âû:ÛÀ¨YwV÷ÉX&Ò¨,sëô•0xê:xƒMTÚ" 3þHh‰cÓ)f.,Ù{RWŧèvÂ_̪ ¼½R‘°f¾]b‹p|îÂñ5é 8G>g¬£†ô°=¢ŸÇˆ¦:÷8|™ý8Û/áY¾‰©–þü%÷´¥0ý©Ë7¼ûžfSÛŽ_AAׄð~ÿÆ4†*²õ~fuæöÆÐI"(a™O7KJ!vÉÕÒxq¶Q& jƒm&ÎåõªCç¯Â‡áÓ80Õ³ôµwô% æã×b"íö€lÿcQu¤^±ï¢AþRqYÀ³|S·X±Á.gí~±›Ùž¢ï¿h÷ Ì] ¯|cÁ` Æš¨§qGãxŸ™¹Q³õZ–ýõýÖ#ð—SÔ5~[¥Â­góÿV³q†mÑ-‘ÿ?«ª’!c,nÏ”¨Ëæ±I8Áî®ôŒþµ(w¯¹h–O© JQ¸ÄÄàÃìãY¾ƒa-Ròñ˜0oç1¸%!ýy½¨T¥rI] ?JWg:õ™í8«{>YkÕü=X¶Óšƒgà‹‰³¡1õ«­f¾”-ê>žï—Ñ‹v®¦Ä¥ÅðQÄtŒŽÈÄY'ÖTˆ(æ ŽÍ•ŠsÌüúÅ3êaû9}·ØûðýŸÒ{büaóDj¢¢‚˜åë  PSç¿é«öêfÝ“öÄ,Þïà¬Ol$¬óZ¯ú^” øzÊZ8­Pö+±ê ]§.[Ú±™ÔfëüÍÜbŲ–‘¿t^ú:‡—ÌDõå—˜r¥wÔqüš¶ÌUqŽú=úìfõwøp°<ƒßÔ ¿a~݃_‹…Ãw·:ühÆ‘è­V £MO‡Ï_•mÓî¨bœÍÚvþ7a–ººÇõ¹kûŽ´ÉȾɅI€>ÂÖÝtò2mð[ ú&Õ½¯ï5Öqüñ[‹aÒý÷Òâ=' µgœíڈѮր€2ð¢Lqôuìç hÏÂpÒþ_¥kÔã÷vútü Wä[ŠóDºùh¶âu¡òü¢(ÄÃNßaqžÍÝb`øŒ º™õßK+÷Ÿ‚¬´ôÀ±Û½Ρâø"Hð²€þDiíqó¶Â/¨õ­³­´º»ƒÇ~y+ź™ôõ”5j†D¶=aìLLU©búµsôÛSÐŽ{£_]é‘ܲÊñ÷ŒêŒ  J¯èÝJï˜"µ¾¾µîômÅZ‡áƒ^ñ±j¯lûU/­Ú¾ˆœ Mèƒ`=¢X+hoþûV@¸§-if–\––AÚÊ=ðÊ7¹Uõ%l5Î)ˆè†³þ` Ìßu\ö«ÚE´‰öwƒsmÛnŒÎ‰Q}¹›5;Ð;ºÇúv Æ ßÿ£Y¾ôftŠŸôI€©›ɶ] ÖœíÇ཰©U›kÛäp–ù¨Oô³¬u XÚŠ²N8ß1¹îýWËqÞmŸOÖ28oòÚ™«÷qàȈýÕ|¾ôbôI¯(h³ßüõdÛ,›‰vp'/ß/ÒÙðŠÔqÚCé6÷K†ù«`Ïé˲_Ç!4oÇ1øxÔôÊý6ç8^èŸ!jW8‚èÒ¡?dŸ¶dŒ‡ô`ôÛ&HüÒ²í•]DÕrV`€_·e¢—šxÄ' úf.ƒGÎÉ~SjÉž“ð¿ñ³  ­iVÔz°å·^ÍKËCÏésS«½DŸkô`ôÜ ËJÙvÊîZ¾ï¼2E=#Ý«Ù´ ¢Cô\±[¼¸”‹ 5TäøÛLœ ͪy²õøÆþ¾Ï=Bgn2̦V[Š® ~¶_Ža^ px¤?£/Ðè~1 n—ʶSš¨°¤ B¾ß(ö:Ô9@8«÷4Â_¿5,&.Ü&ngcÕ^ä‚ï>m"«;þ:dµßjÊŸŽ‹:²<Ò–ˆ%-éö†‘‹8Å0ÎóK7§9šÖ:ï†NF1^{¬sÛU¬Q£ƒ¡6¤›ç(+@ YwíÉø~Ëaø÷ØÐÔ5ºÚ¾ ;`ÝÌùQDì;Ã9io…ÝÚš1Ò€ÑèÀ"q먺^TòVAsZwk¤õhC2ª”Zí6áï_þ:M^+ö‚"^"¢[SWì†wiW?µ•püõºj ý ìO·”ÅpUâu½zÕ8øå— ô¬ç8gÌ0X Óm‚¨‡_XÂ3ւ͇à—ýÓ…oP›Šfh`»Ž‡æ®1ðÚ·øfÊZ‘îv´Ì@QI,ÙsúYVÂóÔ¶äô‰^v×èàšá×aÓ×ËnÝ©Sì<16¥ÛFÒ€‘ÎZ ƒZºç¤l›¤:w>£›Ô„“šh“6®šºDÃof‚gúÈY³Žœ¿eåæÛŒFû+V8C¦­ƒWƒ-ÐŒ2+äpzFj3®±½ðˆƒä»e7….µp»õªdØ FÒ€‘Îþ;ãl€u»È))X-*–lÕÞÕ‚r†?é›ï…NÙi›‹M„F»uŽDíuòÒu˜ºñ æ®û(°ïIïk‹@ª¶àÏ{Ì;fl9,»Yt« ‡ÏBÚ&Ûþ0òþŒ\Ð(·r‹›àXwÖ”‡àçþ)ê®i;õÈ4tQÓ±t"áía“À's$,Ý)öœ»V¨» €føûÎ\†ÉÀ` ^þ> õNRßG†Ó¯ {¤è¯¥{9£U“hL=×/½òî Æ‘þŒ\º‡ö1seÛ"Ýkë± ðÆwùö_3¥5ñê :è"¦Ÿú$Á›CóÁ9i¡8¶˜µfŸ èfFÚ¼h¯à ´¼\ ¥%ºQ.mÅø¶`´ž / ʆè ^z^ ^(ˆé9Ñþëú5Žç ðlPšXz`Õ¬2ìÛ¿…T¾`éÀÈ 7­Ë’#aÝ[g¯Þ„6‘³ÔL€–3Û^Öú÷AA—qâ×´±.jz:0Md >Ÿ0 ÜÓãl| Œš³Ydh¥äçl? vû<–ï;)fÇôû¹øçt/ý~±3Âü­bÃœwÖ2Qàˆ %Ñ,‘~NÓŠ3úôó© *fø2~uÄÿt®ÎXQ@Éqü†qLpöÿÎJu–ZÖ³è(Ÿ:G±‘Mlf“ؽ"Uè9zLPO-tEçÜe¬ ý¾‡¬4îM\¢ ™kt%ô{úsñ½zFZ—!¬ÿŸ¾O·ŠY½õçôÒÁ˜½ÝÇc ’ ›Ž²ó¯‹FÌØPUû‚q<¤?#üà§ðéz)lÖFhFm(;¨ ½*ˆ¼ õíÜï9Ž'ÀÏR`í¡³²‡…ᔵz/Žá òû‘ƒô`ä€úg‚REZ›U?%,Û ­ÝcÔY¶ìþtT°í÷I‚•ûy«>Zºç„ÊîGFÒ€‘C×qà’¼P¶ý1¼ò7€ŸxÄq ló‡°ígo?"{V»O]KA†Î1õ§*=È8="aæV6œ¶ÐŒÍ‡áQ¯øª¢AŒ&ã·Uï(È^³Wv÷ZTsB\„Õ#R~Ÿ2Ú#ýí±î–¦šì,ÛˆvÓÿTÜ(ÈA€Ýé qöO'X Óé+7àé€éÀhO—qÐ-Ž+ÿÙZ³·…G¼âÔ]Õ²ûجЦËnã _î ÙÝm ]¼^¿¡KxÌ:&wß̘ü°§òJÏþÄ3gTãå÷³é2:Dφb¾YÑ&ºr³^ù:Ûè m‘þŒ¶à ªµG¬(áʲò×í‡û\£¬gðuÐçf¡ë8x{h\ÀY+Ë6¢*’ú6W­ù »í‘þŒ¶to¡-âkíª„¥; ™s¤zÆZvŸ›tPO$ÃΓew­©Dež_báÀQ‘þŒ¶t n)‹dÛ‡PÄìMЈ–8h=&@k×h±Ç‚e[ÝÄàÍï,bb ½Ÿí‘þŒ¶tIKwʶ;£ÀœjYÝž’ûݨôTKž³YvWšR•K]9àTÖ4gÌOHhâ<‘ë¥k(º;ÀiâlP:•ßÿFÛ­{ü<(+¿%»+M©k¼úMŽÈîkF{¤?£Ý'À³)\þWc]¸Vo—§^´#{ ‰®ãàÏßZ¸^…uùfünP–º@v3Ú#ýíè2Þ ™Ì·ÿIÐΓ—àiÿdu­Uö80ÝÇÃÞq°/ø±«Î_/„_ Hçq騈56Æ1è<z&Ì—msV³¶†V½'ªg®e=Óc<4Â6JX²Cv—™^篪i÷qòûÑéÀhG×±öýÙ6Ç¡6sƒèQ#@öxÐ+¨öNZ·€×ýí­…»ŽAk·hŽŠô`´£üÉö˶9-Z~i5[89éãA`pôûA™pîû±§N\ºý-+àAkÕJÙýÎÈAú0šÑ¨×Ø|„OÈ]ÀòòWj&@ãB7 #ºÏ% í:.»‹L«Â’2ˆ_¼^JUƒP^Žrl¤?£ h\öŠƒ£®Ê¶A,Ô¢ÝÇ…³c\.caÈÔµ²»Æ´š¿ãüux¾Z—¢¯ù38pðÿ›/ÓÅ‘4–>4bÆ:áô¤ =€íðΰ|Q˜†e[í8qºÅÎ…&Tø…³NLuÄæÆü ¥³èE%|‹š^D}ñIDZ$HöøI·ñp¿k4¬9pZv—ÔZ·n””•Cù-ýnT;@óÓi4tŠš-Û6±î ˜…ÛÔÔ,Å–=N´¦ËxsH®®Sÿ¯Á¨Yá7ýSUgÚq”º®‹ü}+çHH\*¿nÁ²½'àãð)êxÇMuÐÇŒ~‘þŒ6`à•ºH¶}bÝAt4ð¿c§£S-œh <-Ðqêy×ÿÌ-‡à_eª}S“Cí:rÚæ2¸§,„æ½#ÕàDvß2Æ@ú0Ú€¬îr)Ɖuoí#3·¶ë3®=x>£%#rú](cÄØéÀhÎNâo³«ab5\KvŸ€t^ÛÌ©Ü.càay"àÑ“h#âÿȱÖÇùWÐq µS¦íÈù«µîs²f'tЗŒ±††1?ht“t°KÙÞºQ\ §/߀3WnèzgyMòL]„Nh”ü1cpÖÚ¬Ç8X°ã¨ìf¾Måå·À#y¡ºÃ¿!ï‡ÁC» ßÛôÙhLGÍß Ïù%©Ï×m¬Mí‚ô1ÁÈCú0Ú€ôŒ»mj˜ô¤½§/oÆx±*<è ºGà )Ðnü÷·hœÒáZóÝtôÂ5xÊ'A,ÛH7¶˜SäL¸¥³:‘ó·¨Î°[Ã?g” eå¶y¿Ù[Ã_¾ËU³¶tÖÖ#Œ¿î—j½¢ZcƒÑéÀh:“ìÕ{lb”ô¦UûNÁs¾‰ tˆ°ñ±*ä@i&<ë—(ö@è-í|7¡ FË76ƒcÑÙD†Cgd7ïm¢çyÆÊZ üœ=Ñ7^Tákˆ¶=£fA#úžm8èsAØ3`ÒÛI…¨*NŸÈŒöHFÐ0YÖ쵑ÉÔN]¾¿ÁYÌ=e5øpD>ì9uIöcßS׊JàOßdÛÖøËÛß+e‘즽M7‹Ká¯Ãòl·ä‚Žô·hØq¼~õ(SEëüá÷Ïd+ÇÜMmÿÖ.Q¹ŽžW/;~ñ:<âÀ£"ýmÀ k•ù2ßM]ƒ3ÿ:o4‚¿ L†µ¨;?eÃh,f¥&0Îø4ËÖ[ð5qþV›Ï°›;O€å{¦Ù8 IDATOÔé9ŠKË fÁVx! Y fm‘¨ ³š£“ëÞž}¡å&éÀhTÜL¢M~¿éŸV÷µQ4øÏø%Âæ#çd¿B¢Ëfþ1rŠ9–:Ž‚>ɹ—è¼þ A)¶][GGÚ¨Çx±v_[ÍÙvÞýÎRUZ؆Ÿy;œ¶]pààT®—2æ¦ËhÓX²û84í1®îmA¿Ó(xe`:œ¼¤ïÍ wƒfÝëñŽzÑý.¥•É½›FÍÜX•ú·ñûN^¿ÿž?ûñóÐ9j4í9^ òÄØlàϦw¡ìA‡ø¹w<Œ›³ ®Ü,¾ë3ˆÀ#F dF{¤?£ 8ë^°Õ–öSº„o^ÿ6A#ùùØéb¦­WÑu³mÇͨ:þeD°]çËnÊÛDkÿ¯~QµÎnK°¯²jȶQ±¡Áù+á§4󦫶r¾äø;F@+ç රrÏvàÀÁ‘þŒ6 ¡5kƒ-m¨tu£Ðú¶ LœyÓy…Ä{OBsÊtÑHã3·è5ÖÔמ‹e{N@c{eV0ÈX±ëG?“j ¤.Û /Ó­‚Ðu±aZ þgT¬Ú_û«‰9pp¤?£ І9³ˆÎY¿>8KÝÀÕvéh›÷«÷Ÿ’ý:wVxo¸ß1Bþxºg{Ž†‡Ü£ààÙ{ïD×ZKw‡ÆtÜ®«}ßßfß‹‚üü¾òeä¬Úc³{HG/\Å Ú¶ÏËñ!`ÌÎpÿ2$ŠJËlf<ô¦iÀ¦áÌ3Ü:óªCûпm.Ökõ¬œÕ{p8JþxºW[bPÆIù*ˆ%ƇìvºWÒ3b;>æ!Ó֊ヶ–è½·c¤?£ 83þÎ .×PÄ ºp­†LZ ÓéíÃëfØб>Ñ'VÜ/ WQQ——*Ž‘ÉS÷hËüµûd7×5j憪uy½Ò!šv.îµcùdéÀh䧼ãऎ›-µõè9h?~†5}ZcŽ5~Ñ6Ù_£FÎX§7²ÇT cíç>ñ⤆50w9(N#å·Ó°Þ^ùI¢Ò¥½Å€ƒ#ýmè2FEjè®a£©`ÃøÓWéê²@çZ9t¬Ÿ™¦ë#GÎ_…Giݶ6ï#lC×Dý.¥x$Í×_@}‰íö»~)¾|§fÕ)9pp¤?£)kèw“›½téF„N[ {Fß{Y 1­¹êy€ä’0_·Y€F؆“×éëìuu‹ž­Ÿ¶ë¢:þGÑ ™¼ Î]½©i[pààHF;Ð0O©Å%%f­¥R-„æ=Ç©»µ¯Ñy;QÍ‚&²ÇÓǘºâìmY]$îVÐCÐ!št ÝcfÃ.I%qààHF;:Fè¾î½Z¾çü+|Ššv½Óþtýsô]5‘î+8[›Ù0°r¯ßz´²óo* UShohûíÃáX¸ó¨ÔöàÀÁç?Ç ýHÊZ"ÕàèETYoòº}ðú  ÕÐÙújíô¯ˆ)º«_ÿCM˜»ÉêÈt0¶*Àç‰^°EvÓÜUTèéï!ùrÚŽoâØz10 R–n×Å‘\5ˆÂ`”ü±Ãhô`´£}˜éª6TW ‹E5Á_ù' ã¬tŽÁÀËRàZa‰ìÇ«QtÝëCn­ut0¾Ð‰´è569+»iîªÒ²rx˜EÖѲ]hl=Œ}58oœ¾rCv3TŠGú0Ú³ž÷Ðø•j´ÃØH"£ë/w*Õ%ÐûS­€ÜÕ0@ìþd‡öaðïðÉpKçgÜYu“kü\qzAڸŸÝ;NßIeå·ào#òÔ“öj‹Žá &ªÇ_eÛ&F{¤?£-hœ~Û?.㬑eå­ÙJ§pyãª]¨¸oAï¢à£ú4KîP‹ÿÇc¤?£-hÄZõûOÛïŽq–ö¢Ë‹óˆ².h?¦Èée¯Ú-»î)Ê{}6YdÂêôŽèøuï ɆfÝÇÔüo9`Œ‚øð2ŽEDZqŒeÑŠN»±ÓÔe­ÇM»¥»ô} BŸ*¥]-Û‰ 9„7¿Î€™›Šb>Í»Yëùßíÿt0Pp׉jà(Û.1Ú#ýíA'œ¿R¶íaÙX1ó·¨ÇµOè–Âàã|(7Hm º’—¾pzíBá)Ïhˆ˜±®VGc9`L…ô`䀆Ï5Aÿ…[XuÓ3— µó8m ::Ó6cŒ³§$|ÆZP>-ºϤyp°—cqÀ˜ éÀÈgmþ:Ý0붬ډÒðo ÎTϹk5–0˜ì5Sö«×Zq ·À§#ò`Õ¾“uþ¿f Ž]¸Æ€##ý9 kÕs,ì>yA¶ bÙXšïÀÀ-~®ì×®µ.]/ª÷~³Ûñ}("Ý1rÕ€d?#‡ö#!e)ï0›2–ïTOhµ ]ôMY ûµ5‘Ù€1³6h›-bôƒ¨Ø)ü¦Òuþf,ˆs4°Ç m(t7Pê–U;m;zNÕQ;-ÆQ›H_,ûµ5ÑŽct-jܵ=0°Î5@YdºáÓÐ|µ(’l[Ähùø®cU:EÜPp ¿¦tóÅß,D®‹¿èbM ‰ÿΘŒü_ Hä‹L¦E¥ðkÿõ\»ã¨Í½Tökk"5e ®îþ¹2BpàÌexÐy|ÍïÂœjN_\U=òþyÒ~”»Ò>äJ¥œœš(íït óÇ´ÿÑÊÿÔ™³Ò¸s8¬Ü[÷ÍP²u³„7/ÞMt¯Ãøéê>-ƃ-Ëd¿¶&2S0qî&±C¶ blÕéw£¬>ý~äqü³ôí”.¡O+÷”“¥ ~ƒWð?â7\*R ˜4ƒ-ËeÛ¢:ëÛI+`@æ8{å†ìGÑ¥FL]-³&cè‹0tò*Ù¯¬‰Ì”–—ÃÇ!y˜±¦þ¹›8\Š“øÝJ‡‘ã”aÿQœF=ro§_S0Ð~Ôñ›öC–+bϦ À»ßfAqi™l›T'}•³ ”ÿ…_úÄY/ká²ÆÕ5uý>hDNJ‹ôîÃ!tÚÙ¯¬‰ÌÐéŸÖ=ÇrúßÈÿí:¦j=¿ãȵèð¿ÅYÿ{Š[ì}õwúwÓûÁM•Î#_Å2ÎJ…ƒãƒà¾c`çqc•?{ƒpúÚqäü³\ü»^J‡‘¿T‚ƒkçôk :†ýYé:?kð«‚>I څ‡Cs 5{^¸ý4éñã.¾ mlü_ÄX¹÷„ìÇ”&ªËÿï‘“´™åqp;:–î>Mx’¦c¬ëùt<¿SD9Ú¸ƒH,N´ÛâLÿIÙî¾fQ¢}ø V:„¯ÃJ‘ZcÀ T¬K2ú¡C¸Hï:aœª€Ûžƒz«¼Âõ‡ïC;àïë6zÇ̆Ýz/[*(c±Ø g÷ñÓ&ÆÏÞ(ûu5‘¨€J‡Ú£¾׸9¢Ï¤Û¦ 1Ó­Öã!ŸÙaäV¥CX~ýXéü l·^?97Ç—y £—`üº)® :r0 +Ð ÐÎq£èµBxÒ=JMqßí¨¾×c.‘0(gœ¾ìX'âlÅž´;Qó6Ë~]MdôàøÅkð„ûÄš?7Œ6ˆ™þëz~ø5dNž*ä3?×B¶û¶­(è4òÿ”ö¡C”Ža›”NÁ€5F©\FíBà­ÁéPTbŒÓe·nÁë_¥ª)î{½»6#à—Þ±0gª7ä¤yÛCcJ)v³ïØÁ¶š·Iöëj¢ÇÎa¡—wý,…ê67k½ZB¶½qHª9}á÷Â.àŸOCûä¥8 Yœ¸sQtÓ~ø;J‡Ð¡Ø›‘’ªFá`@Í:GÀ*­›w›8C=ë^Ûw¤MO0¼þe XÐ@S)T3kÏÉ‹p_÷ÑöСÄ-Ø"ûu5‘‘uó_zí‚fÆFT8ý±êú~Ç°ãøçièû:£=zV¶+–/o :E¼‹QÐ0±îAÁ@W¤ÐvôMž'ÛNÕZat”éóáuO2€íÃàÃ-°pÇÙ¯a7]¹Y OyÒ2I¨ÇM$.Ü*ûu5‘‘€9[AcÙ6Æ G_±s¿#å ÛƒAø8üóÿ*ŸxT¶ËÕ¯z$·TÚ‡¿‡5?`ÛEãñ2và ù¹¾1pîêMÙ¶ªVš±ñ4¦Ùm}g¸ð4GcÞ5r†¸@Çl*)+ƒw‚3í?ããàvtܺÐfôÔºe̘Ú#œþèŠõü8>Ö)íGQœÂÞWþÞZ¶k5žœFµR:„|`Ý ¹¹Œ— 4WÊâm²íU­tøÜex¸÷x놦z¾ouÀ#Îãàˬ%púòuÙ¯eSu‰¬ã2I}ààGŸ!½[ŽœÕf9È‘¨\Ïízÿl¾Ò!4@éòšâæ¦aQ³ë?Á÷)Ã>DCŽ¼]J' ºZo,ä`À¶ 1ÿà»CÔ ³îoÙjMÓºQð…¾10aö¸i’‚²«íŠò˜]]Ã[cÄ> öì˜rÑ!¬Ea:†1 ¤YçpX±ç¸l›U+ Ì^bup6z§P¼ùU*LZ³GF–(™ÜƆís'ÚŽÀÀ‘6Vœ¬¸ 8~rWí’ý¨•:xæ2<ê2ÞºD¾}1FVÕÜïv 9¤tŒˆU:†¶ÓQ³‹‚Ž¡ÿÀã¥Cè^5mÝmÉÁ@½A‡Ñ3z¦l»U+ÍÙršÐ3w°±qC§Fßóßaù†®(˜·z·jøkrX ¥ÝH^ìHc´´e÷ ÐlTÜ®×1¬}Ì6d$~Ž>QœB’íöXw’Säý¢jRûºqrK-8®¦ë*6‹1÷Æ)~Òkì;}I¶íº§.ß(‚ç½cÔe{´ÎûºŽ×ØÙØe¿nµdç1h*ÊÓ†Úo¼`Û§/Ý.ûU5‘èŽõö5·‡^€c®Â“î‘jfK¶]1 8‘ì¶ Ûì+üܼ­ôn)Û½±ê"ç°§‘Ÿb'ŽÇ<  p Pk¾.ÒëFwò<|Þaök ržØOºN€ïòWÀ…kÆ8%AÚŽ«U·QØHF ç.S—ÈdÛ£@KÉNa›Å¾3– Du”Û‡ý ‰D#x‰ƒ€Z‚3†Ÿ{L„“—ô¿+~ÙîcÐŒÖêìéä¬mB—üâ!yÑV(.ÕÕÄSØÒ½ïØDF ŽžçÙ¡‰¢Shˆl·Å²‡Ú‡…Xl0µg!SWɶc÷TiY9|0$[]çÔ¢]h¹¡m¼38fmÖ÷ÕÃ× Kài¯(û:~Ôzd.æÙ]Pwû—(NÃß—íªXöPû÷”ØÁœ¨hÈ~ág PHlvþ율N›ФÓHh7z*l8xZvÜQ…%eðÚ—)öÛ#a'ÜÞ²Ú¿óhïqjùkÙvÄ(Pú¿}è.Å)ø~Ù®ŠeÑ©ö¡;DGËlFá‹V ÿ[‹JËà]ªzGgµlr8Ëz°ÇðO] 6]éI¥å·à£¡9ÖS vj~Ô²„9<û¯+”n)ÛM±ì©ö!áê2@(SÚ€çúFÙ+ú¿Jwá¶#Тr/€ÆPŠý‹aðŒG$DL[× ‹e7G¥ÚŠ°Ãí:F+¸ÇÃö¬;p Zw£Ùlˆ|ûaÂ(ý ýOÙ.ŠeOÑ2@Ç‘ÅJÅÙqæÞ´Áyˤ´ºÈ7e>(Ÿ•×Vhü•¶ÃáÕþ‰³b'ÎÀåWTì3ÓzJÂ~ïÌÀíí!+ .? Ÿdßþ6#â¨ìˆC|YÙEg:B6(g£™{ƒí ×ñpøì)F­.ºt£Þœ®@™m†AµÛ߇æÀâG¥¶‰EŸ µã»:X@Y&§šÛ#w¥œ Íh\Ó³1w¦Ó(êÓTÙ…¨ÀC§Qò‘ø|ôIœ+ŨÕU{N^„úF«k õyWk:_¤ÍÚnø}Zt‡‘3`ÇñóRÚcPÎûØN©KŒqTCµçähªÓ€Šbý>0QÝ#Û^ *çÚN¶kbi¡öá¿WÚ‡\‚d<£€N±u×Q°þÀ)Í [}DÏù¬Çĺ8koÕ5†ä-‡†f«ÿ¿âtAÚŽ¨Ÿö _ç,Õ|?ň)+AùŸl#G¸ `ß©‹Ðy\ÚŸ5µ‡¤`Øäò3_F„N…9…œP:†=%Û5±´ÝÚÔ>d®õØS[Љý7,_ëڵѦCgà·¾qâ¹kõ~èè›w«Lgß(*°©«á'=FÛÆ°¶S_õ†è¹¡¨D›BB£g¬µoÀä@aI©hç\Ç×n,Iv8:õ)¤Û £!ªÿ…dËvK,-å4¢‡Ò‘€ºÒ˜EENj«Ãç®À¿CóTÞ¶†Ô(¥tÑ‘Q©ßjóá3ð¯õÿ×ô=j }6ÃáíA©P°nܲóƒ‘t#`mƒ ú`â`î–CðÖ 4k&¨–}¯q@ÿ¾ˆ˜Ì³ÿúBéÿv!N²]KKuþF}GÕ»àC˜ÚB¥pýãáµBÍ \CE3í±ß¯…§="Õm¬ÆÜi„ú•~î; JÊîœÝ jƒñó7Ã3îÖïádƒ¶DƒÝ¿~62Öì?i·÷ÅçVƒÆ~o³t…nïèï¡9ªkÛµ®i¶t4Á‰ìƒÑéÿǧ`¾Ú×áä4l¼º  ƒh$ÐÈ\¤™³•Ž_¸ #§­†7¦À£½ÆÀýÝGÁýFëA‰0qΆ»:ÿê:xæ8£chJG‡ÚØÀ©RòÅP¸¿[x&ÌŽÇÖŠã Ö¢‚Rãg®‡§Ý'X½z8V €ã®Ás^ñgڱ͌zü/]¶+bÉÓ°7•¡7Å9PÙÑHàl£u×pXµ÷„&FÎÖ*+/‡cç¯Â¶£gáðÙËP\ ÇÿCÍÞ|Þø2Y8o¥Ýð†·)9t8O¹‡Ð©«ÄŽn[‰..²I°r7L,Ø~X=BJmÕ¶}ªaÐ ƒQ¨È¶ †í>]ß!ä3Ù®ˆ%CN–&hxçªG@B˜ÚBžÏ‡Á»ßdÀõ¢M uåf±ØaÿHÏÑUË ¥­ºñ;¿8H]¼Í&7¦,Þªfì5p,$,0npäÜp-:…©{%Úm´ &­ÞMÅÏ!ß&‘"ýPq ~D¶+bÉ’Óˆê@ÐÁ€4h,GL^iwC§wm?zÚEL†F´¹ÏVŽ–6¡#ùë7é0sSÃn´{ðÙPˆž³ÑF­©(¸ŠÂç~–öuÐ)‰v6r¤'.\ƒúD©Ù ÙvÀ¨Ð&ðvøö¿C«KðƒøÁßÅA@=@‡÷`·X³Ï~ØŒ¤I«wÃTgB3y[´ñçC¡IûPh‹ƺzÖ`Ð"ˆ2PP^~ ï8ïgT|²e{Ø9(¿u :-PÇ™l`TÄÉŸ°¥íÐd» –l9…~)¢AÙƒÒˆ ƒzû«T¸zS?—ßÈÔ…ë…0,<ÒsŒíf•ô=ð{=Ð5ú$Ìë¢ø›m“Ú¾ æl9­èF?{µ‰€Øy›¬'Ytðù7*4ák7b£âäßJ¶ûaÉV›¡Ïá‡é´¸JöÀ4"èú§/´›Á3¢v;/fiM¨}l5ûn«O¹Œ‡a“VÔú(¦8À@¥Ò—l·ý¬¿:v 6:-N°Ø,Ã䨨¾²]K/j;b,gê ÎP›w…ië÷ÚÅèYßoÜoH®ª?`‹ö¶n|É7âço•êj9g»¦‹ d.Û¡Söj;t2„²m6Ûpꨴ#›uûé%Ùn‡¥µ ý℃¢âHS7Ú …ç=#ű:Öí¢å‘ˆé«áÉÞcÑY~§´I›íþæÀd˜´f·¨w'Q$åCì×÷ø½ÇÏ\§q«Ö_™Ë¶[gÐöû,ä®ÜióçöŠŸ£ŽÙŸu££ÿ™,Ûå°ô¦¶#RÕ#:¤FÓ?GäÂÍâšg¤Ž*ºL¦WÔ hÖ!¤ªÈŒ-ø\­EðÉ°lX´ýð~n]ôßoÿ¿½3“¢8ûxžQ<M4ñø¢ÆÏÄs¨Á짰s{0øQ4*x¡ìîÜ»3»³Ë^ˆšh@AE Ê!*(â *r(—,×n}UÕ³ˆ8»;3owÏÿ÷<¿QÜ®®îÿ[Õ]Õ™;ï¢E†Q0b ÷Yh/7ûIWñ˜³Ê€!õ¬gMuܽQX})ë9xfÚ`AOûOZo~fcþŠ5üŠèm!µŒ+}m/·®í5ê)õ¬¸òÇf|@3Ó\,ýp=ïrÝHm·?êëÛèª÷¼ªW2ßØc©ãèŽX{æ«y*9E[£¡tÔôE+Óv4#»öìåcç½ÁÏ[Φó±€ü{Äßwüµ#øŸçk7oã©/e¶pÇùÈÙ˨›4eŒT|ñÍv~Á€µb‘úÚ6ƒr†·¨&H4@¯ô¬¹’õ²³mPŒjO¾á¾¼•ëÖs‰5›¶òÛ&Ìã{ i¶l0 k…Àé·ÜËϽóþÌŽE0ìéW©›2eŒRÈÏQ;=ŽçþéR®ýï1h+ŠM3@¯Èí{Ô<›\' [«³ <¤>À~œÅ«ÖñüÊiÚ’AiºÎCQšÿ¾Cé2`ÐðEÈLXž ÿÄ瓳C:¸žÍàÕÃeá7‘:b€Þ)ª¶2ß}ê…êNkd=UÜ^=ƒï¨Å&A© ·¦}øÅwø9òënrʾ8ƒ!•NE0ä_K©­?ØnIDAT›/eŒPÜ=û5­p3Jлj àZqÞÿJ/@ïôíÛQ\x/` Š"àæûŸåõõ‡^¢¾Üç}ÀäùüÈ^Ú èYQ$žXDÝl)£÷`æÒUüHù…R„ú”÷ò¢šg™Ï×:^€P³ƒ÷©gGòÅ*Ø:“›ÖTÍz%·ðÜ`é‡_p‹z,húì°uÅ XTg®=ÚP,\ù9?±ÏH}ŸoÃ9HÎÔ±â*u¬£ ß(NÌQËFÈ;°Á-®æzTóñÏ-Oó­ÜüÈÇr·¿³n¹—3O\{™ú|, €meðöš¯ùýƨåœäçÔLÊÿŠ«—0ÛèÎÔ±Œ„¯&ùíÆ,@,Jð£®Ìg`y`«X·y;¿cÂ<ÞIn"äÕY@¸â¼|ÆBê&J=Ÿlø†Ÿç}âÜVÒŸO³ÙS=NéM'ÀpÄÚ³ÕOb MŠ"àøÞÃùœågèÖn~äN—‡&kAQ¤“ibQD§£h´…€Ü«áeþ™P…â-–?üê4F¤`ÐeÌ7hfÒda‚ŸÔg$_pˆ-kAjl¯ÝÇük ïÒgD³Õ„¢8Ð_~³ƒ_.?ðƒðÏŒrú¿¨úzêF¦¨zë9L»Ñ¶™¼Aþì÷ðWV­Íð­Þܼ·v#/:K{aL~€êœŠ 8Õ8Ÿƒ~ìå÷š–ØeB¯(ÿx°aëNžWþhSÓ«Oþ—³Þýƒ¶PPu +´C½MJÝ©Í¢·ŠŸvã(¾øƒõY¸å›—ºúz>å?+øYýÆjü)Ê`°ý¢(›ò"uS¤Œ þWVˆðw#ü3¦útv¢u|3P\=!ù6)L‹5É"àµô ´Ï7mã×­}1N¾$˜Ís銉`>u¤ŒV$2×¢ýWÈiÿ¿ÉA©ð§¾Íj²(JÜJÀ U=¨M)Qwl“é­ä?½~$Ÿ¿buöÀÄ<±t?÷öq*”ÕK‚Ù8‡âÿUòÈ Ô‡ž2”€,Ô. MÒfk¨¯=³ÛCÎT c?¥Ž`dä”ÉxP €÷ù¸¹¯«­¬<†‡WÄM¡Ž`Ú‰›ç“ÚV’:èÀ¹¨–îñ©|õÆ­Ô™a8³^ÉÞ›æâÿ#— …LízTó‹>ÈÛËðÏd¡[ Ä ªeE•¥` *óD§ÙÑ?±"\λc<_¼junùÁKügoÚYœ£>÷þ›ú°S&ã3R9êÏÖ2L˜šjE@Õ‹µ§Ž kx;VX9;¹‘¤Öç'öƧ¼„©°äƒuü1 •/Ufåü¸b¼×Ýÿ¤>ì”yìåw›æ²¨Ù+ŠuÂ=ã­ìÆŠjö¨CÞi¡RŒf;ˆ_Ë™ÏwíÙG!º¦dÒ "”+²wnP@£(u…U‹˜mtgê˜zÄçë :È<Œþu¨ÑŠ°±TNåµ…:GtÉ–»ø¯úiú\p6tÇxñðYÔ‡ž2(rÜâšzqþ{SG Ð#… ›6M„Ñ¿nEÀ™ýFó9o`çÀƒ™ºp…¶ÙL6χ(Š†¡€Q. ,¬\Á|ã©ã艼ØâÆð"FÿÐS©–X…§.À#${÷×ñ¼ò)@œ»ÏàõõÆØ·Tß (Lô§Ž ' «÷ÍOt?=ï­OøÉ× W›ï·_ƒ¢¸àÎût¿%óë7óþÍå'õ¦™¨?‹jêYQüZêx™Ä;QŒþ?Ô–€TÂ\WåêÑ@×ð$>iþ[ê«zzãÁç—óãÿwpò¹¿Ú­AñóœÇXÝï¬ÙÀo½?±÷PužÕ2Qê6ƒú´¸ZÞÞe¾!øPi)Œ`=jè;ÔŸ® 1º®àÿuË^6ùy¾üÓ/É—·­ß²ß4öi-¸¼: ©(~}Û½ü»Ý{IÛ©9r…ÄË+?ç×ÜóO~\/Q49£~˜šò½°‚ø]Ô12-tŠ8ÉŸ`ô«e‹ÑbçžÕjC¡»ÿ½”øÅæ¬îw¿£võŸsËhmäZ ÓEÉYýFë¢Ø¶k7|Ñ{<¿rª¶5²žÛ êS¹C`aü3æˆJW Ýx+ýýÔ•áá*WÛk¿ªâ^5s!_öÑúŒ=&#þ±Ï¼Æ/ð€šÐÝ”ÿÁŠàW}Gñ„ÀÇ_}Ãkf½Â/¼s¼Ö^.?lƒ2#¼ñJê¸éÄ'*:o|Zò!ŸûBØå²Q ÛVñ_ßz/÷ ›Å?¹ˆ¿øÎg|ÍÆ­|Ûw»[^ßî¬å«Öoæ¿ð&¿zÄüÔëGh›ûÈÇÔÇœŠž8ÿù #ÕŒE6Ù*Úúé×>àW‚wùûÎåÆi3¨oeFx+¿fÎØÙÔ±Ò…'Õžïè ƒAã+?¾ãˆja-ŠƒŸô"F ÷qk|*ï3ú)îä>ì_‹ùýóÞà“¼ÍNœÿ3gÏøï;~6w&¦ñßôÏ;ûj´Ñ¾ 19‚¥>¶–( €Ó²TÔîݧf_dÛþ÷ã´¥ªÍâôíÍ¥\%楎-œá_ˆŠn=Fÿ0cÊW2ÄíѦ©,š+ÿ³ÙŸ‘ÿÎkàá{ÒµÃøö]-ŸýH¹¿À[Ÿmà‰ÇòKýkÏö1Ú‡™VËŠíÌYuu|¶â©¬Ru§‚Ðlf R–|°ŽG[À/ <Ì;õ¨ÖB_Ͷèà˜an(3ÃS9M$H;ê­Åû¥8™_bôa@—ÞCù–µ­üýuõüóM[ùÌE+ùÍãfó ûWû24…¾gH •%j™'ö7ê­Å‚Ñ?„2YlÚžúªˆ½ûëÔ§ŒŸyã#õ<ÿÊÈdm{ã†÷*0½õb±Zð,óù:PGh)E±³ÕÛœr4!—AÓ«'ÆO¸fÿzëÎC†½üðâÆm;ù;«7ð‰óßT»òý-4Q ê…Gõ"e4ùò£ŽÂ¬”³û˜·ÜMg ¥xcw'wv‚fBoŒÿ÷ÁjD/÷Føø«-ü…·?å£ç¼ªÂ>?6…ŸÙwïP$Špw¹üK¹E°7¶„ùEi U bç²ÂøfŒþ!̬{$øåÁ‡Õ–ÀGö¬Ö¶,v5 {¹ÄQ?'„­¶0QÏ%tŽ'v8Y[Õ[œÔB¡ñ•E€§bu¼Ã{£!„iS(=ñÕÌ>:âÀ!wn’;8aô!„0Ê/ɺ+Ô1~Ol2FÿBÓ®6°ÜÈl‰s¨£LAù%Ì[ùÚ.”º£@!4Ÿr€é‰£Ž;p0žŠÇÔzB!L³j€¹Cüóï©#4à_*NJ­V¥é “@!4§j Y1áCAz€·cîŠYýC!̼q¹AÐnæ*Ï£N?à-¿B Œþ!„fâ„\0 ¢$kÏÜåOk›4Ä „ÂÌ«œUûDþx©c0wqG®bžÊ=ò³¤äBaîX v\Ê|#ñ¡ ¬£FÿÏbô!„D¹7€;v=uæΰ•y+÷bô!„D¯,*V2g° u$æ¶þE£ÏWŸûõT@!„4ªY€h u,æžð™7¾O½ˆA}ò!„æ®rs wùçÌ;™:s_¬“hðxãÒ?ê!„0÷”ù# W´FÍLƒ,âŠÆXŠ!„Y¶!üÝåÕjC:@€«¼E„¬y@øÇÚSÇ`nã®(Çã!„·!ü=Ñ„¿^Ef „fÊÆð¯¨Q{Ñá)Š" E„ÂôÚ0í_1á¯W\æE€êŸB*eÿwËQkh-s†·i×î'-³!üÃ÷3[ÿÎÔ±r Gø6抠HUüò¦ç¿$.ØáÌY¯–ê €¹dÓúô/„Qæ(=UÙEÂ)Â]Z ážòã6„áˆ@ðã6d‰íôl¼X‘_1gh˜øu‹V  ¡‰m|I-²Iü~ˆêÿc ^&î'³D¨íE!p8§ý@øZœ‘[QBür3Že̼†]:à¨C¶Ÿ5zžø3ã…Û1 MgÓºô-"ôïáõëî)ÿ#œ-þì~õ˜…@3_ø{áôŠ€&eðK‘åâ÷}˜+vtJmh‹^,þü£¢ k1ú†W¿šÙúFmGë ß»J;fÛÅuð‚ºä5E}Lä"ü^±oÉé" )øßÞÈòbǶª]‘®âBJ½d‰Ñ4šêrÄ/?Bc ]ЦûŠüv½3\(|E{q0‡ Õ®¡‡˜m4ÂèUD÷æTÐüá÷Dx÷cÝǧ¡%Û‰ž•9¢óD[Ö¡€º·)ø¿}w¤z´•Näˆ×é%þþׯ9êcΦÚÛþDAtdZÛ€´âõA˜,ÂæÕÝ0 ¯R{#8ƒ]ÒÞ–>_æ »Å `º 4Þôtpüª>Ùl9Ÿ#\Ãl‘sÒ~4'ï¶cÕ ›3¼B+ÊuÐnc`„Føcàð'‹†•Ü Y» ?bÎÐ]¬[𤌷ç¾NÌ(Ô–¢€Ô6¿ ßÐû¢o–0OÙÏ3~4Ç{× ¢è…wèCu=ºM:à@øCb ö7Š½êfá_WòE${øSæ–2[蔬·é%};2GÀ+F@óÅÍ¡¾± n˜6ŸŽpp³o`ÞØ Y¿š#¯CG¸L¸Z»¢ôí”–¶'Û:4ጉ=t³+cò†"—óÙCkı™;ô3êfU/FÙ‚ñóÍîA!3ªz _­áß* àiÌ쮊Q=a Ÿ&Š ñó}aŠB@+´þÀàØÃ7²PÁ¯–ܬUx”uÏògªØ"]ÅÏ8U´ñöÆ—©Û_õbŸ ÒrYüÊÇ]Õ ©»ûâ ü’ÙƒƒÅ1l4la¬ 8&±>`ìYì1ÄÅØ°æØúB\„qfóŸNÝ|)á \Äì‘Ñâçþ²Ù¶Ã¶ÀH³=úEAiÍQ»Wfâ×L#_F´‡ïǵÅP…€ ÿðdæûÃ0$ŽÐº.œÏø7ˆ_µIm4PÃ[M/ bVÆÆ)þp½¸NWˆ_cÌ" J3 7 rDîÇ´M›!ÓéýGªüþÀ¤ØdÞ£«@jñ‡¿fÎЖ_ru3¥Wߣ™5àÍtql›gô|„Y2ÂØ]Ïú”Ù#ãÄõÙMõ3¢ÍMÇþ.gdøÛB ü¹ÑK FÇjÔ³I8‚ÙJ3»~™{ð\q“¿K¸Xë.uÜ(rTøuÚsýÈâß9™eÀ‰Ô]4k8‚ÇjÚÇ.kàz–é" 1øÃ[ÅïïkóÇĬ-øÉš]-pfRw9Ý!‹a¹Á–=´P[þ˜…B@‹ÀÔ”¿ €)‘E€3¼;íE@Sðo¿ˆÙ£¿¥>T]b-;O´ÏvÕ^Ô3« ¶àµÔ]N·ÈÙƒW‹B`™j«Ln„?MØ‚}ÒV4¿3¼Sm¦a \L}x:§hÿgµç :)˜Uܺtyk6É/9F äìäÛi/Ô $ø€æØüm+šFü»Äï§2{øÔ‡däžîxÀܪ)çÐÓÔ]ÍPÈ%m¡[E`¯RíçjãEùOCøp(ìëÄ…ÒÂ" aĪÿ<]—R†á¸*ü QlÂc«7Sw5Câx²¸7•¨ý—϶°ýUø‡¦©ÙÀ ŸQ¦RÈ°Ò¦­÷ˆàŸ%.®¿Rÿè†FΚàe@sªMÿo3õ^ÙÀQz*s¢¢M×iƒŽ þÁéRÁê-.œÚä¦%êH¿=¼Wüþ)f+Ë£þqM-P(Ú»þ{í ¯ÜëÁ|žº‹™Kä fT‹Pßи‡À¡Ú]†¿üï¶Ð „?-Á8¨7|™l?³…g³î¡nÔ?¢©èì"nTŸ²è‚ÆV†%xu3Ý‚g‹Âj„¸7m>d!àDøÐzd`E€¶[V¸˜æŠ ÎÂä›ë ýØ‚c“m Í¢J;™ÃÿêîeZäRZyíȽF þÁÇþ´Kà:QaÏU¶‰ÅÚSÿ8¦¦{Y7µ5ªý¦4¡ñÔ¦ÿ2æë@ݽL-ô;f OdŽèvñÏ3YÞmÇRÿHry’5¸L¤œÑ±K©»VN!?¥lëÿêZ†-T•\2®šþÖ2Kô"ên@ïÈÙƒ»ÕÌö 4²r™š-°ŒåÅŽ îVôŽ {`‰ êƒmÓ¥žÿG¨»£`õTáA`°õj38{˜%ügêîÀ(ÈeMöÀ<0°òù¿Íÿ¶úÂ26ÿ\<0°jº`‚º0¶À?PUµ `/³†® îFŒ†3ü 1‚Ü„ÇTMÿßg¾GQw#FÄx /Pµ ­u÷`T,bf׋Ñ$‡F1$ÝϬÁîÔÝ€Q± 8‘ÙkÕ·ȃ ¦¤ûrkÙMÚztcN¨f[ö2kéeÔ§@.cx†(¶à1@–T»ÿ•­`y}Ž¤>õrké ÌdI¹÷‚¥lõ)Ë÷÷#Ózòp4½rÿÿ>f+Ë£>åcÝn?IûB dTmúÿCµ3  òËÆcO€ «¦ÿýwSŸj  ‹?_„T¶Δª]ëXw¿•úTM4~!0¨ƒ°4¡²]óËV3[ÿŸPŸjà@äÛéøB`f”Wäc@wä—ü…©Mjð ýêY~ÀM}Š€ïsA¬³”½†­Ó¬ööÿzµÚÐ%ÝKKµoÕ—Át)Û3¿t"õ©~˜n/f–ÒZ5r¥N³¨Í\C}j0ÿég: €mßIEND®B`‚UEFITool-A66/UEFITool/icons/uefitool_64x64.png000066400000000000000000000060441442134156300207150ustar00rootroot00000000000000‰PNG  IHDR@@ªiqÞ ëIDATxœÝ›iXUÕÇûp8 "9€Cš¢"‘9UÚàtsJ3SÂ2óé–™•W‘´ÌÔ ÔÊéjy½f]¯™8š(š™Òd^#IS#S.* “Ìž÷~8¨œiŸ½‚Þþϳ¾ìõ®wøïw­õîµ÷VDD¡ LÙÕ(ž"ï ½·&ý¹Cm@d"hl”ÉŸÕ« ·j¬CÖô®)Gl Õ8”W‚¹_G€ÈŸ‡à7lݺ(1Æ+1Zj 2XçÝ‘0%fCSþ•˜ £”˜ ƒtÇ¢wPbÖ/žÊ÷¹2/2[EÞdþzF˼ÈU.t¦¡U>EʼÈ-Z è"@™´~ð¬Íå< X*ó#K«É‡Ñ@¤V6ØLvËüH³îQU}-lÆ”Ãe~äV-4 LZç(øê8ƒåNìÆ/ÁZtkÀ`9°è[e§…Š| O¸$Á%JôZC•qµà«ÃLín¯Î`!aA”* ª(u«ÁBÂBç$8%@™oÀ’r£kÆ·ZC90TŽHrÔéJùeKÕÛª~]–DÞGai/Äÿ@^I¹^’äýgöª h*…•—V.&è±Ü£u0kŸíA°¿ªœY„•ûŽ3-ñçóK0 Lés¯÷k§iYù Zº‹Ù…zÜè$ŒþYMÀe(ãþe†è±R/÷ÅdT¯ˆ“eýÙ~Rÿ›sõZï¶!,êFÛFV²aøzâz.ÜÎñ? ´ºâ2e\O‘(Ô<ì0ø®fªÁg”ð· ûX—ròêµ`Þv/#ïmåt\“z¾l¹÷ÌÙ¢u:Dc™¾Náú¡Ed¬Þê+_Ź߲òé·™u?¦ƒFEá¥íøuÆ0ÕàÎä1}ËòKÊ´ú2Rû‘jA§šÊ +®ª^9À†”tâëL ¯—]Ÿ§‡;CêÑ$À‡î­CÓ=Ì.ÝmQRQÉ‚/3wÇAŠÊtÕ&`8–g‡°[•1ûþÀP ‹WÐ;¬1[_釧†F›RO“°ô? ñóò¤¡¿7yÅåä^*Óªâ vdùóæꊈ(Êó˃±|¥é:¾òöô êžVtiÑ€J³ðÉ,¶:C›F¬y¾7mƒõ?V¤žÉ&zý>’;G×– ™ñhgú„7Åà`!ñàižù8Yuº9@6–›$`§|8&[Ṥt{X… :^ìŠ~”Ž·×·ºž{©Œ9Û°tÏÆö'ºïÝ4©WÇ¥¾´Ìxê!ÆõŠpÚÿÉ,F®ØÅéœBn×”~ÍèÒ¢!¡ ¨c2R\^IVA {Od’tè4I¿œÁ,Bƒº>lye][6rª»¨¬‚z¯|Äe³û!(<ûÛ£úû1ï<=Ô7“ì¢R,ÜJÊ© šôø˜Hž<„6YåÍbV‘q±H“^G0\ÏaC¯¶M\PßÏ›/¢ÚÀߥN!þ…>š‚ðó2ºí?"×GÀ53TÇ›-ãâm4¨êœÔ·îjn5ö\Þ%²‹J­®å—³î{~ϼxó¨ïçü)9íüEŠJ­÷ìvykÈ}NõÝäÇÌ!ÖoÅW}ŸF‹I+¿Ú²Ø™EXúÕ/´žò w¤¢ÀÍ#ÀJÊ+éøæ"ÞXÍù¼KV}úÞM‹Ûê:Ô7ëñû¨ãåyU6§¨”Wò2éòINË ËŒµ¼´jw6$eæ4ð½yä]*µ“у¸áÝÈ),ám)v}¯êb§+È׋]­k®ÔÓ(.«~:™E¯ÙŸ‘SXš±ýØóÚ0:6op]Á_7¹ŽW_ƒBtÿN{÷šßf2ò0êzyZéêß¾9&£‡•\nQéÕ~£¢;¬iïŒbD·¶×ê‚›IÀÑ §ïD©W‡‰ý;Ù]÷5о¹•®.-:$RAhHëF¼ñؽø˜lJë›IÀ“Yn!GÜn¥«Q€¯LÛ@öΈbÚ•…Ó._6_7í‰Eä˜ÞÁÅeüðû9;§2r ‰ß›æÌgº…†Øë´ADÓút­.gƒßÎçr6·ÐÀ÷#2 ‘£¬™t8 LWFÌkåUv$–÷í.ñéwGy°m«kAu¼ùþ6ÞKÜÏ‚§{Ñ3¼™Ý¸6! •Uç~Þ&uCX±û§™aƒr`7°Ø*ñ1WïšÕ„’ø˜CÀ!`š2âÝÀ»XÞñ;ÅêïŽ÷ÄCU« |½<éÞ”ÝGNÓëíxweNT›ÞvUÆdô 8À‡Œ\ËŸzA)Uí² KXþU*–gUì†Küd‡çhNÍJü䟙é*ŠJʈÛdðºì¹¾ÜÑÀŸíšròBwOù˜—>ÞÉ…‚â«2þ>&§é}Åe|yè¶ÌØð-ÅšN†V9 ^•Y;e¯–µañö~JÏ´Û:8ôÅcIžþ$æŒ&XõõaZ½²Œ¸{))¯ÄC¡š{ûigshý!+“Y‘´çÈi–íLÕ|)"ªŸËh9œëÊPeåe"n"§°Ä¡ £‡Éƒ»òÛ¢1 èpÓÖ~MØ„’‘]pUÇ¥2ûƒY9óG¾U–däòô’DÌfM«ÿzY÷šê²V#rÊ•±ôÌ‹ œ³ŽB•šÆ~¬Ÿø8I¯Gâ¡(\,*¹Fâe's¹Z†üQPÌ€Ùk9›S %xYä*<-ø!¤ÅàŽ¥çŒOÈÌS>бŸOn3Þ‘íkäÓýÍU>}AÏv×ýFƒˆ¿V£Nœ§ó«±ó`ºªÚøoXuÈÀ5Îæ–‘­'x™¦ ‹U=ßT%@úv}DÆë4ʹœúÏú”ÑK¶žuÑNïÁSY,ܲφ{d\Ò°m«Èdµ]œYËdÀO]ÆÉHïù™O’Òë®toN}_ŽËá£]©”V8>ß¿TZÁÖŸŽ±ì‹ŸH>|ÊÓ¶˜  õ¾lœžé¨ÓùGRÏ ŽöEz à°früå•—o´úå²iúXGÎ òÖb,;þP DÈæÇl;®Êc3 ˆ #include QDeviceBuffer::QDeviceBuffer(QObject *parent) : QHexBuffer{parent} { } QDeviceBuffer::~QDeviceBuffer() { if(!m_device) return; if(m_device->parent() == this) { if(m_device->isOpen()) m_device->close(); m_device->deleteLater(); } m_device = nullptr; } uchar QDeviceBuffer::at(qint64 idx) { m_device->seek(idx); char c = '\0'; m_device->getChar(&c); return static_cast(c); } qint64 QDeviceBuffer::length() const { return m_device->size(); } void QDeviceBuffer::insert(qint64 offset, const QByteArray &data) { Q_UNUSED(offset) Q_UNUSED(data) // Not implemented } void QDeviceBuffer::replace(qint64 offset, const QByteArray& data) { m_device->seek(offset); m_device->write(data); } void QDeviceBuffer::remove(qint64 offset, int length) { Q_UNUSED(offset) Q_UNUSED(length) // Not implemented } QByteArray QDeviceBuffer::read(qint64 offset, int length) { m_device->seek(offset); return m_device->read(length); } bool QDeviceBuffer::read(QIODevice *device) { m_device = device; if(!m_device) return false; if(!m_device->isOpen()) m_device->open(QIODevice::ReadWrite); return m_device->isOpen(); } void QDeviceBuffer::write(QIODevice *device) { Q_UNUSED(device) // Not implemented } qint64 QDeviceBuffer::indexOf(const QByteArray& ba, qint64 from) { const auto MAX = std::numeric_limits::max(); qint64 idx = -1; if(from < m_device->size()) { idx = from; m_device->seek(from); while(idx < m_device->size()) { QByteArray data = m_device->read(MAX); int sidx = data.indexOf(ba); if(sidx >= 0) { idx += sidx; break; } if(idx + data.size() >= m_device->size()) return -1; m_device->seek(m_device->pos() + data.size() - ba.size()); } } return idx; } qint64 QDeviceBuffer::lastIndexOf(const QByteArray& ba, qint64 from) { const auto MAX = std::numeric_limits::max(); qint64 idx = -1; if(from >= 0 && ba.size() < MAX) { qint64 currpos = from; while(currpos >= 0) { qint64 readpos = (currpos < MAX) ? 0 : currpos - MAX; m_device->seek(readpos); QByteArray data = m_device->read(currpos - readpos); int lidx = data.lastIndexOf(ba, from); if(lidx >= 0) { idx = readpos + lidx; break; } if(readpos <= 0) break; currpos = readpos + ba.size(); } } return idx; } UEFITool-A66/UEFITool/qhexview5/model/buffer/qdevicebuffer.h000066400000000000000000000014741442134156300236560ustar00rootroot00000000000000#pragma once #include "qhexbuffer.h" class QDeviceBuffer : public QHexBuffer { Q_OBJECT public: explicit QDeviceBuffer(QObject *parent = nullptr); virtual ~QDeviceBuffer(); uchar at(qint64 idx) override; qint64 length() const override; void insert(qint64 offset, const QByteArray& data) override; void replace(qint64 offset, const QByteArray& data) override; void remove(qint64 offset, int length) override; QByteArray read(qint64 offset, int length) override; bool read(QIODevice* device) override; void write(QIODevice* device) override; qint64 indexOf(const QByteArray& ba, qint64 from) override; qint64 lastIndexOf(const QByteArray& ba, qint64 from) override; protected: QIODevice* m_device{nullptr}; }; UEFITool-A66/UEFITool/qhexview5/model/buffer/qhexbuffer.cpp000066400000000000000000000014521442134156300235320ustar00rootroot00000000000000#include "qhexbuffer.h" #include QHexBuffer::QHexBuffer(QObject *parent) : QObject{parent} { } uchar QHexBuffer::at(qint64 idx) { return this->read(idx, 1).at(0); } bool QHexBuffer::isEmpty() const { return this->length() <= 0; } void QHexBuffer::replace(qint64 offset, const QByteArray &data) { this->remove(offset, data.length()); this->insert(offset, data); } void QHexBuffer::read(char *data, int size) { QBuffer* buffer = new QBuffer(this); buffer->setData(data, size); if(!buffer->isOpen()) buffer->open(QBuffer::ReadWrite); this->read(buffer); } void QHexBuffer::read(const QByteArray &ba) { QBuffer* buffer = new QBuffer(this); buffer->setData(ba); if(!buffer->isOpen()) buffer->open(QBuffer::ReadWrite); this->read(buffer); } UEFITool-A66/UEFITool/qhexview5/model/buffer/qhexbuffer.h000066400000000000000000000016401442134156300231760ustar00rootroot00000000000000#pragma once #include #include class QHexBuffer : public QObject { Q_OBJECT public: explicit QHexBuffer(QObject *parent = nullptr); bool isEmpty() const; public: virtual uchar at(qint64 idx); virtual void replace(qint64 offset, const QByteArray& data); virtual void read(char* data, int size); virtual void read(const QByteArray& ba); public: virtual qint64 length() const = 0; virtual void insert(qint64 offset, const QByteArray& data) = 0; virtual void remove(qint64 offset, int length) = 0; virtual QByteArray read(qint64 offset, int length) = 0; virtual bool read(QIODevice* iodevice) = 0; virtual void write(QIODevice* iodevice) = 0; virtual qint64 indexOf(const QByteArray& ba, qint64 from) = 0; virtual qint64 lastIndexOf(const QByteArray& ba, qint64 from) = 0; }; UEFITool-A66/UEFITool/qhexview5/model/buffer/qmemorybuffer.cpp000066400000000000000000000020511442134156300242520ustar00rootroot00000000000000#include "qmemorybuffer.h" #include QMemoryBuffer::QMemoryBuffer(QObject *parent) : QHexBuffer{parent} { } uchar QMemoryBuffer::at(qint64 idx) { return static_cast(m_buffer.at(idx)); } qint64 QMemoryBuffer::length() const { return static_cast(m_buffer.length()); } void QMemoryBuffer::insert(qint64 offset, const QByteArray &data) { m_buffer.insert(static_cast(offset), data); } void QMemoryBuffer::remove(qint64 offset, int length) { m_buffer.remove(static_cast(offset), length); } QByteArray QMemoryBuffer::read(qint64 offset, int length) { return m_buffer.mid(static_cast(offset), length); } bool QMemoryBuffer::read(QIODevice *device) { m_buffer = device->readAll(); return true; } void QMemoryBuffer::write(QIODevice *device) { device->write(m_buffer); } qint64 QMemoryBuffer::indexOf(const QByteArray& ba, qint64 from) { return m_buffer.indexOf(ba, static_cast(from)); } qint64 QMemoryBuffer::lastIndexOf(const QByteArray& ba, qint64 from) { return m_buffer.lastIndexOf(ba, static_cast(from)); } UEFITool-A66/UEFITool/qhexview5/model/buffer/qmemorybuffer.h000066400000000000000000000013111442134156300237150ustar00rootroot00000000000000#pragma once #include "qhexbuffer.h" class QMemoryBuffer : public QHexBuffer { Q_OBJECT public: explicit QMemoryBuffer(QObject *parent = nullptr); uchar at(qint64 idx) override; qint64 length() const override; void insert(qint64 offset, const QByteArray& data) override; void remove(qint64 offset, int length) override; QByteArray read(qint64 offset, int length) override; bool read(QIODevice* device) override; void write(QIODevice* device) override; qint64 indexOf(const QByteArray& ba, qint64 from) override; qint64 lastIndexOf(const QByteArray& ba, qint64 from) override; private: QByteArray m_buffer; }; UEFITool-A66/UEFITool/qhexview5/model/commands/000077500000000000000000000000001442134156300212155ustar00rootroot00000000000000UEFITool-A66/UEFITool/qhexview5/model/commands/hexcommand.cpp000066400000000000000000000003211442134156300240400ustar00rootroot00000000000000#include "hexcommand.h" HexCommand::HexCommand(QHexBuffer *buffer, QHexDocument* document, QUndoCommand *parent): QUndoCommand(parent), m_hexdocument(document), m_buffer(buffer), m_offset(0), m_length(0) { } UEFITool-A66/UEFITool/qhexview5/model/commands/hexcommand.h000066400000000000000000000006221442134156300235110ustar00rootroot00000000000000#pragma once #include #include "../buffer/qhexbuffer.h" class QHexDocument; class HexCommand: public QUndoCommand { public: HexCommand(QHexBuffer* buffer, QHexDocument* document, QUndoCommand* parent = nullptr); protected: QHexDocument* m_hexdocument; QHexBuffer* m_buffer; qint64 m_offset; int m_length; QByteArray m_data; }; UEFITool-A66/UEFITool/qhexview5/model/commands/insertcommand.cpp000066400000000000000000000010051442134156300245600ustar00rootroot00000000000000#include "insertcommand.h" #include "../qhexdocument.h" InsertCommand::InsertCommand(QHexBuffer *buffer, QHexDocument* document, qint64 offset, const QByteArray &data, QUndoCommand *parent): HexCommand(buffer, document, parent) { m_offset = offset; m_data = data; } void InsertCommand::undo() { m_buffer->remove(m_offset, m_data.length()); Q_EMIT m_hexdocument->dataChanged(m_data, m_offset, QHexDocument::ChangeReason::Remove); } void InsertCommand::redo() { m_buffer->insert(m_offset, m_data); } UEFITool-A66/UEFITool/qhexview5/model/commands/insertcommand.h000066400000000000000000000004451442134156300242340ustar00rootroot00000000000000#pragma once #include "hexcommand.h" class InsertCommand: public HexCommand { public: InsertCommand(QHexBuffer* buffer, QHexDocument* document, qint64 offset, const QByteArray& data, QUndoCommand* parent = nullptr); void undo() override; void redo() override; }; UEFITool-A66/UEFITool/qhexview5/model/commands/removecommand.cpp000066400000000000000000000010721442134156300245550ustar00rootroot00000000000000#include "removecommand.h" #include "../qhexdocument.h" RemoveCommand::RemoveCommand(QHexBuffer *buffer, QHexDocument* document, qint64 offset, int length, QUndoCommand *parent): HexCommand(buffer, document, parent) { m_offset = offset; m_length = length; } void RemoveCommand::undo() { m_buffer->insert(m_offset, m_data); Q_EMIT m_hexdocument->dataChanged(m_data, m_offset, QHexDocument::ChangeReason::Insert); } void RemoveCommand::redo() { m_data = m_buffer->read(m_offset, m_length); // Backup data m_buffer->remove(m_offset, m_length); } UEFITool-A66/UEFITool/qhexview5/model/commands/removecommand.h000066400000000000000000000004311442134156300242200ustar00rootroot00000000000000#pragma once #include "hexcommand.h" class RemoveCommand: public HexCommand { public: RemoveCommand(QHexBuffer* buffer, QHexDocument* document, qint64 offset, int length, QUndoCommand* parent = nullptr); void undo() override; void redo() override; }; UEFITool-A66/UEFITool/qhexview5/model/commands/replacecommand.cpp000066400000000000000000000011111442134156300246650ustar00rootroot00000000000000#include "replacecommand.h" #include "../qhexdocument.h" ReplaceCommand::ReplaceCommand(QHexBuffer *buffer, QHexDocument* document, qint64 offset, const QByteArray &data, QUndoCommand *parent): HexCommand(buffer, document, parent) { m_offset = offset; m_data = data; } void ReplaceCommand::undo() { m_buffer->replace(m_offset, m_olddata); Q_EMIT m_hexdocument->dataChanged(m_olddata, m_offset, QHexDocument::ChangeReason::Replace); } void ReplaceCommand::redo() { m_olddata = m_buffer->read(m_offset, m_data.length()); m_buffer->replace(m_offset, m_data); } UEFITool-A66/UEFITool/qhexview5/model/commands/replacecommand.h000066400000000000000000000005231442134156300243400ustar00rootroot00000000000000#pragma once #include "hexcommand.h" class ReplaceCommand: public HexCommand { public: ReplaceCommand(QHexBuffer* buffer, QHexDocument* document, qint64 offset, const QByteArray& data, QUndoCommand* parent = nullptr); void undo() override; void redo() override; private: QByteArray m_olddata; }; UEFITool-A66/UEFITool/qhexview5/model/qhexcursor.cpp000066400000000000000000000117311442134156300223260ustar00rootroot00000000000000#include "../qhexview.h" #include "qhexcursor.h" #include "qhexdocument.h" /* * https://stackoverflow.com/questions/10803043/inverse-column-row-major-order-transformation * * If the index is calculated as: * offset = row + column*NUMROWS * then the inverse would be: * row = offset % NUMROWS * column = offset / NUMROWS * where % is modulus, and / is integer division. */ QHexCursor::QHexCursor(const QHexOptions* options, QHexView* parent) : QObject(parent), m_options(options) { } QHexView* QHexCursor::hexView() const { return qobject_cast(this->parent()); } QHexCursor::Mode QHexCursor::mode() const { return m_mode; } qint64 QHexCursor::offset() const { return this->positionToOffset(m_position); } qint64 QHexCursor::address() const { return m_options->baseaddress + this->offset(); } quint64 QHexCursor::lineAddress() const { return m_options->baseaddress + (m_position.line * m_options->linelength); } qint64 QHexCursor::selectionStartOffset() const { return this->positionToOffset(this->selectionStart()); } qint64 QHexCursor::selectionEndOffset() const { return this->positionToOffset(this->selectionEnd()); } qint64 QHexCursor::line() const { return m_position.line; } qint64 QHexCursor::column() const { return m_position.column; } QHexPosition QHexCursor::selectionStart() const { if(m_position.line < m_selection.line) return m_position; if(m_position.line == m_selection.line) { if(m_position.column < m_selection.column) return m_position; } return m_selection; } QHexPosition QHexCursor::selectionEnd() const { if(m_position.line > m_selection.line) return m_position; if(m_position.line == m_selection.line) { if(m_position.column > m_selection.column) return m_position; } return m_selection; } qint64 QHexCursor::selectionLength() const { auto selstart = this->selectionStartOffset(), selend = this->selectionEndOffset(); return selstart == selend ? 0 : selend - selstart + 1; } QHexPosition QHexCursor::position() const { return m_position; } QByteArray QHexCursor::selectedBytes() const { return this->hexView()->selectedBytes(); } bool QHexCursor::hasSelection() const { return m_position != m_selection; } bool QHexCursor::isSelected(qint64 line, qint64 column) const { if(!this->hasSelection()) return false; auto selstart = this->selectionStart(), selend = this->selectionEnd(); if(line > selstart.line && line < selend.line) return true; if(line == selstart.line && line == selend.line) return column >= selstart.column && column <= selend.column; if(line == selstart.line) return column >= selstart.column; if(line == selend.line) return column <= selend.column; return false; } void QHexCursor::setMode(Mode m) { if(m_mode == m) return; m_mode = m; Q_EMIT modeChanged(); } void QHexCursor::switchMode() { switch(m_mode) { case Mode::Insert: this->setMode(Mode::Overwrite); break; case Mode::Overwrite: this->setMode(Mode::Insert); break; } } void QHexCursor::move(qint64 offset) { this->move(this->offsetToPosition(offset)); } void QHexCursor::move(qint64 line, qint64 column) { return this->move({line, column}); } void QHexCursor::move(QHexPosition pos) { if(pos.line >= 0) m_selection.line = pos.line; if(pos.column >= 0) m_selection.column = pos.column; this->select(pos); } void QHexCursor::select(qint64 offset) { this->select(this->offsetToPosition(offset)); } void QHexCursor::select(qint64 line, qint64 column) { this->select({line, column}); } void QHexCursor::select(QHexPosition pos) { if(pos.line >= 0) m_position.line = pos.line; if(pos.column >= 0) m_position.column = pos.column; Q_EMIT positionChanged(); } void QHexCursor::selectSize(qint64 length) { if(length > 0) length--; else if(length < 0) length++; if(length) this->select(this->offset() + length); } qint64 QHexCursor::replace(const QVariant& oldvalue, const QVariant& newvalue, qint64 offset, QHexFindMode mode, unsigned int options, QHexFindDirection fd) const { return this->hexView()->replace(oldvalue, newvalue, offset, mode, options, fd); } qint64 QHexCursor::find(const QVariant& value, qint64 offset, QHexFindMode mode, unsigned int options, QHexFindDirection fd) const { return this->hexView()->find(value, offset, mode, options, fd); } void QHexCursor::cut(bool hex) { this->hexView()->cut(hex); } void QHexCursor::copy(bool hex) const { this->hexView()->copy(hex); } void QHexCursor::paste(bool hex) { this->hexView()->paste(hex); } void QHexCursor::selectAll() { this->hexView()->selectAll(); } void QHexCursor::removeSelection() { this->hexView()->removeSelection(); } void QHexCursor::clearSelection() { m_position = m_selection; Q_EMIT positionChanged(); } qint64 QHexCursor::positionToOffset(QHexPosition pos) const { return QHexUtils::positionToOffset(m_options, pos); } QHexPosition QHexCursor::offsetToPosition(qint64 offset) const { return QHexUtils::offsetToPosition(m_options, offset); } UEFITool-A66/UEFITool/qhexview5/model/qhexcursor.h000066400000000000000000000043741442134156300220000ustar00rootroot00000000000000#pragma once #include #include "qhexoptions.h" #include "qhexutils.h" class QHexView; class QHexCursor : public QObject { Q_OBJECT public: enum class Mode { Overwrite, Insert }; private: explicit QHexCursor(const QHexOptions* options, QHexView *parent = nullptr); public: QHexView* hexView() const; Mode mode() const; qint64 line() const; qint64 column() const; qint64 offset() const; qint64 address() const; quint64 lineAddress() const; qint64 selectionStartOffset() const; qint64 selectionEndOffset() const; qint64 selectionLength() const; QHexPosition position() const; QHexPosition selectionStart() const; QHexPosition selectionEnd() const; QByteArray selectedBytes() const; bool hasSelection() const; bool isSelected(qint64 line, qint64 column) const; void setMode(Mode m); void move(qint64 offset); void move(qint64 line, qint64 column); void move(QHexPosition pos); void select(qint64 offset); void select(qint64 line, qint64 column); void select(QHexPosition pos); void selectSize(qint64 length); qint64 replace(const QVariant& oldvalue, const QVariant& newvalue, qint64 offset, QHexFindMode mode = QHexFindMode::Text, unsigned int options = QHexFindOptions::None, QHexFindDirection fd = QHexFindDirection::Forward) const; qint64 find(const QVariant& value, qint64 offset, QHexFindMode mode = QHexFindMode::Text, unsigned int options = QHexFindOptions::None, QHexFindDirection fd = QHexFindDirection::Forward) const; qint64 positionToOffset(QHexPosition pos) const; QHexPosition offsetToPosition(qint64 offset) const; public Q_SLOTS: void cut(bool hex = false); void copy(bool hex = false) const; void paste(bool hex = false); void selectAll(); void removeSelection(); void clearSelection(); void switchMode(); Q_SIGNALS: void positionChanged(); void modeChanged(); private: const QHexOptions* m_options; Mode m_mode{Mode::Overwrite}; QHexPosition m_position{}, m_selection{}; friend class QHexView; }; UEFITool-A66/UEFITool/qhexview5/model/qhexdelegate.cpp000066400000000000000000000027631442134156300225700ustar00rootroot00000000000000#include "../qhexview.h" #include "qhexdelegate.h" QHexDelegate::QHexDelegate(QObject* parent): QObject{parent} { } QString QHexDelegate::addressHeader(const QHexView* hexview) const { Q_UNUSED(hexview); return QString(); } QString QHexDelegate::hexHeader(const QHexView* hexview) const { Q_UNUSED(hexview); return QString(); } QString QHexDelegate::asciiHeader(const QHexView* hexview) const { Q_UNUSED(hexview); return QString(); } void QHexDelegate::renderAddress(quint64 address, QTextCharFormat& cf, const QHexView* hexview) const { Q_UNUSED(address); Q_UNUSED(hexview); Q_UNUSED(cf); Q_UNUSED(hexview); } void QHexDelegate::renderHeader(QTextBlockFormat& bf, const QHexView* hexview) const { Q_UNUSED(bf); Q_UNUSED(hexview); } void QHexDelegate::renderHeaderPart(const QString& s, QHexArea area, QTextCharFormat& cf, const QHexView* hexview) const { Q_UNUSED(s); Q_UNUSED(area); Q_UNUSED(cf); Q_UNUSED(hexview); } bool QHexDelegate::render(quint64 offset, quint8 b, QTextCharFormat& outcf, const QHexView* hexview) const { Q_UNUSED(offset); Q_UNUSED(b); Q_UNUSED(outcf); Q_UNUSED(hexview); return false; } bool QHexDelegate::paintSeparator(QPainter* painter, QLineF line, const QHexView* hexview) const { Q_UNUSED(painter); Q_UNUSED(line); Q_UNUSED(hexview); return false; } void QHexDelegate::paint(QPainter* painter, const QHexView* hexview) const { Q_UNUSED(hexview); hexview->paint(painter); } UEFITool-A66/UEFITool/qhexview5/model/qhexdelegate.h000066400000000000000000000020651442134156300222300ustar00rootroot00000000000000#pragma once #include #include #include "qhexutils.h" class QHexView; class QHexDelegate: public QObject { Q_OBJECT public: explicit QHexDelegate(QObject* parent = nullptr); virtual ~QHexDelegate() = default; virtual QString addressHeader(const QHexView* hexview) const; virtual QString hexHeader(const QHexView* hexview) const; virtual QString asciiHeader(const QHexView* hexview) const; virtual void renderAddress(quint64 address, QTextCharFormat& cf, const QHexView* hexview) const; virtual void renderHeader(QTextBlockFormat& bf, const QHexView* hexview) const; virtual void renderHeaderPart(const QString& s, QHexArea area, QTextCharFormat& cf, const QHexView* hexview) const; virtual bool render(quint64 offset, quint8 b, QTextCharFormat& outcf, const QHexView* hexview) const; virtual bool paintSeparator(QPainter* painter, QLineF line, const QHexView* hexview) const; virtual void paint(QPainter* painter, const QHexView* hexview) const; }; UEFITool-A66/UEFITool/qhexview5/model/qhexdocument.cpp000066400000000000000000000061331442134156300226270ustar00rootroot00000000000000#include "qhexdocument.h" #include "buffer/qmemorybuffer.h" #include "commands/insertcommand.h" #include "commands/replacecommand.h" #include "commands/removecommand.h" #include "qhexutils.h" #include #include #include QHexDocument::QHexDocument(QHexBuffer *buffer, QObject* parent): QObject(parent) { m_buffer = buffer; m_buffer->setParent(this); // Take Ownership connect(&m_undostack, &QUndoStack::canUndoChanged, this, &QHexDocument::canUndoChanged); connect(&m_undostack, &QUndoStack::canRedoChanged, this, &QHexDocument::canRedoChanged); } qint64 QHexDocument::indexOf(const QByteArray& ba, qint64 from) { return m_buffer->indexOf(ba, from); } qint64 QHexDocument::lastIndexOf(const QByteArray& ba, qint64 from) { return m_buffer->lastIndexOf(ba, from); } bool QHexDocument::isEmpty() const { return m_buffer->isEmpty(); } bool QHexDocument::canUndo() const { return m_undostack.canUndo(); } bool QHexDocument::canRedo() const { return m_undostack.canRedo(); } void QHexDocument::setData(const QByteArray& ba) { QHexBuffer* mb = new QMemoryBuffer(); mb->read(ba); this->setData(mb); } void QHexDocument::setData(QHexBuffer* buffer) { if(!buffer) return; m_undostack.clear(); buffer->setParent(this); auto* oldbuffer = m_buffer; m_buffer = buffer; if(oldbuffer) oldbuffer->deleteLater(); Q_EMIT canUndoChanged(false); Q_EMIT canRedoChanged(false); Q_EMIT changed(); Q_EMIT reset(); } qint64 QHexDocument::length() const { return m_buffer ? m_buffer->length() : 0; } uchar QHexDocument::at(int offset) const { return m_buffer->at(offset); } void QHexDocument::undo() { m_undostack.undo(); Q_EMIT changed(); } void QHexDocument::redo() { m_undostack.redo(); Q_EMIT changed(); } void QHexDocument::insert(qint64 offset, uchar b) { this->insert(offset, QByteArray(1, b)); } void QHexDocument::replace(qint64 offset, uchar b) { this->replace(offset, QByteArray(1, b)); } void QHexDocument::insert(qint64 offset, const QByteArray &data) { m_undostack.push(new InsertCommand(m_buffer, this, offset, data)); Q_EMIT changed(); Q_EMIT dataChanged(data, offset, ChangeReason::Insert); } void QHexDocument::replace(qint64 offset, const QByteArray &data) { m_undostack.push(new ReplaceCommand(m_buffer, this, offset, data)); Q_EMIT changed(); Q_EMIT dataChanged(data, offset, ChangeReason::Replace); } void QHexDocument::remove(qint64 offset, int len) { QByteArray data = m_buffer->read(offset, len); m_undostack.push(new RemoveCommand(m_buffer, this, offset, len)); Q_EMIT changed(); Q_EMIT dataChanged(data, offset, ChangeReason::Remove); } QByteArray QHexDocument::read(qint64 offset, int len) const { return m_buffer->read(offset, len); } bool QHexDocument::saveTo(QIODevice *device) { if(!device->isWritable()) return false; m_buffer->write(device); return true; } QHexDocument* QHexDocument::fromBuffer(QHexBuffer* buffer, QObject* parent) { return new QHexDocument(buffer, parent); } QHexDocument* QHexDocument::create(QObject* parent) { return QHexDocument::fromMemory({}, parent); } UEFITool-A66/UEFITool/qhexview5/model/qhexdocument.h000066400000000000000000000054721442134156300223010ustar00rootroot00000000000000#pragma once #include #include "buffer/qhexbuffer.h" #include "qhexmetadata.h" #include "qhexoptions.h" class QHexCursor; class QHexDocument: public QObject { Q_OBJECT public: enum class ChangeReason { Insert, Remove, Replace }; enum class FindDirection { Forward, Backward }; Q_ENUM(ChangeReason); Q_ENUM(FindDirection); private: explicit QHexDocument(QHexBuffer* buffer, QObject *parent = nullptr); public: bool isEmpty() const; bool canUndo() const; bool canRedo() const; void setData(const QByteArray& ba); void setData(QHexBuffer* buffer); qint64 length() const; qint64 indexOf(const QByteArray& ba, qint64 from = 0); qint64 lastIndexOf(const QByteArray& ba, qint64 from = 0); QByteArray read(qint64 offset, int len = 0) const; uchar at(int offset) const; public Q_SLOTS: void undo(); void redo(); void insert(qint64 offset, uchar b); void replace(qint64 offset, uchar b); void insert(qint64 offset, const QByteArray& data); void replace(qint64 offset, const QByteArray& data); void remove(qint64 offset, int len); bool saveTo(QIODevice* device); public: template static QHexDocument* fromDevice(QIODevice* iodevice, QObject* parent = nullptr); template static QHexDocument* fromMemory(char *data, int size, QObject* parent = nullptr); template static QHexDocument* fromMemory(const QByteArray& ba, QObject* parent = nullptr); static QHexDocument* fromBuffer(QHexBuffer* buffer, QObject* parent = nullptr); static QHexDocument* create(QObject* parent = nullptr); Q_SIGNALS: void canUndoChanged(bool canundo); void canRedoChanged(bool canredo); void dataChanged(const QByteArray& data, quint64 offset, QHexDocument::ChangeReason reason); void changed(); void reset(); private: QHexBuffer* m_buffer; QUndoStack m_undostack; friend class QHexView; }; template QHexDocument* QHexDocument::fromDevice(QIODevice* iodevice, QObject *parent) { QHexBuffer* hexbuffer = new T(parent); if(Owned) iodevice->setParent(hexbuffer); return hexbuffer->read(iodevice) ? new QHexDocument(hexbuffer, parent) : nullptr; } template QHexDocument* QHexDocument::fromMemory(char *data, int size, QObject *parent) { QHexBuffer* hexbuffer = new T(); hexbuffer->read(data, size); return new QHexDocument(hexbuffer, parent); } template QHexDocument* QHexDocument::fromMemory(const QByteArray& ba, QObject *parent) { QHexBuffer* hexbuffer = new T(); hexbuffer->read(ba); return new QHexDocument(hexbuffer, parent); } UEFITool-A66/UEFITool/qhexview5/model/qhexmetadata.cpp000066400000000000000000000074021442134156300225710ustar00rootroot00000000000000#include "qhexmetadata.h" #include "qhexcursor.h" QHexMetadata::QHexMetadata(const QHexOptions* options, QObject *parent) : QObject(parent), m_options(options) { } const QHexMetadataLine* QHexMetadata::find(qint64 line) const { auto it = m_metadata.find(line); return it != m_metadata.end() ? std::addressof(it.value()) : nullptr; } QString QHexMetadata::getComment(qint64 line, qint64 column) const { auto* metadataline = this->find(line); if(!metadataline) return QString(); auto offset = QHexUtils::positionToOffset(m_options, {line, column}); QStringList comments; for(auto& mi : *metadataline) { if((offset < mi.begin || offset > mi.end) || mi.comment.isEmpty()) continue; comments.push_back(mi.comment); } return comments.join("\n"); } void QHexMetadata::removeMetadata(qint64 line) { auto it = m_metadata.find(line); if(it == m_metadata.end()) return; m_metadata.erase(it); Q_EMIT changed(); } void QHexMetadata::removeBackground(qint64 line) { this->clearMetadata(line, [](QHexMetadataItem& mi) -> bool { if(!mi.background.isValid()) return false; if(mi.foreground.isValid() || !mi.comment.isEmpty()) { mi.background = QColor(); return false; } return true; }); } void QHexMetadata::removeForeground(qint64 line) { this->clearMetadata(line, [](QHexMetadataItem& mi) -> bool { if(!mi.foreground.isValid()) return false; if(mi.background.isValid() || !mi.comment.isEmpty()) { mi.foreground = QColor(); return false; } return true; }); } void QHexMetadata::removeComments(qint64 line) { this->clearMetadata(line, [](QHexMetadataItem& mi) -> bool { if(mi.comment.isEmpty()) return false; if(mi.foreground.isValid() || mi.background.isValid()) { mi.comment.clear(); return false; } return true; }); } void QHexMetadata::unhighlight(qint64 line) { this->clearMetadata(line, [](QHexMetadataItem& mi) -> bool { if(!mi.foreground.isValid() && !mi.background.isValid()) return false; if(!mi.comment.isEmpty()) { mi.foreground = QColor(); mi.background = QColor(); return false; } return true; }); } void QHexMetadata::clear() { m_metadata.clear(); Q_EMIT changed(); } void QHexMetadata::copy(const QHexMetadata* metadata) { m_metadata = metadata->m_metadata; } void QHexMetadata::clearMetadata(qint64 line, ClearMetadataCallback&& cb) { auto iit = m_metadata.find(line); if(iit == m_metadata.end()) return; auto oldsize = iit->size(); for(auto it = iit->begin(); it != iit->end(); ) { if(cb(*it)) it = iit->erase(it); else it++; } if(iit->empty()) { this->removeMetadata(line); return; } if(oldsize != iit->size()) Q_EMIT changed(); } void QHexMetadata::setMetadata(const QHexMetadataItem& mi) { if(!m_options->linelength) return; const qint64 firstline = mi.begin / m_options->linelength; const qint64 lastline = mi.end / m_options->linelength; bool notify = false; for(auto line = firstline; line <= lastline; line++) { auto start = line == firstline ? mi.begin % m_options->linelength : 0; auto length = line == lastline ? (mi.end % m_options->linelength) - start : m_options->linelength; if(length <= 0) continue; notify = true; m_metadata[line].push_back(mi); } if(notify) Q_EMIT changed(); } void QHexMetadata::invalidate() { auto oldmetadata = m_metadata; m_metadata.clear(); for(const QHexMetadataLine& line : oldmetadata) for(const QHexMetadataItem& mi : line) this->setMetadata(mi); } UEFITool-A66/UEFITool/qhexview5/model/qhexmetadata.h000066400000000000000000000050571442134156300222420ustar00rootroot00000000000000#pragma once #include #include #include #include #include #include "qhexoptions.h" struct QHexMetadataItem { qint64 begin, end; QColor foreground, background; QString comment; }; using QHexMetadataLine = QList; class QHexMetadata : public QObject { Q_OBJECT private: using ClearMetadataCallback = std::function; private: explicit QHexMetadata(const QHexOptions* options, QObject *parent = nullptr); public: const QHexMetadataLine* find(qint64 line) const; QString getComment(qint64 line, qint64 column) const; void removeMetadata(qint64 line); void removeBackground(qint64 line); void removeForeground(qint64 line); void removeComments(qint64 line); void unhighlight(qint64 line); void clear(); public: inline void setMetadata(qint64 begin, qint64 end, const QColor &fgcolor, const QColor &bgcolor, const QString &comment) { this->setMetadata({begin, end, fgcolor, bgcolor, comment}); } inline void setForeground(qint64 begin, qint64 end, const QColor &fgcolor) { this->setMetadata(begin, end, fgcolor, QColor(), QString()); } inline void setBackground(qint64 begin, qint64 end, const QColor &bgcolor) { this->setMetadata(begin, end, QColor(), bgcolor, QString()); } inline void setComment(qint64 begin, qint64 end, const QString& comment) { this->setMetadata(begin, end, QColor(), QColor(), comment); }; inline void setMetadataSize(qint64 begin, qint64 length, const QColor &fgcolor, const QColor &bgcolor, const QString &comment) { this->setMetadata({begin, begin + length, fgcolor, bgcolor, comment}); } inline void setForegroundSize(qint64 begin, qint64 length, const QColor &fgcolor) { this->setForeground(begin, begin + length, fgcolor); } inline void setBackgroundSize(qint64 begin, qint64 length, const QColor &bgcolor) { this->setBackground(begin, begin + length, bgcolor); } inline void setCommentSize(qint64 begin, qint64 length, const QString& comment) { this->setComment(begin, begin + length, comment); }; private: void copy(const QHexMetadata* metadata); void clearMetadata(qint64 line, ClearMetadataCallback&& cb); void setMetadata(const QHexMetadataItem& mi); void invalidate(); Q_SIGNALS: void changed(); void cleared(); private: QHash m_metadata; const QHexOptions* m_options; friend class QHexView; }; UEFITool-A66/UEFITool/qhexview5/model/qhexoptions.h000066400000000000000000000023531442134156300221510ustar00rootroot00000000000000#pragma once #include #include #include namespace QHexFlags { enum: unsigned int { None = (1 << 0), HSeparator = (1 << 1), VSeparator = (1 << 2), StyledHeader = (1 << 3), StyledAddress = (1 << 4), NoHeader = (1 << 5), HighlightAddress = (1 << 6), HighlightColumn = (1 << 7), Separators = HSeparator | VSeparator, Styled = StyledHeader | StyledAddress, }; } struct QHexColor { QColor foreground; QColor background; }; struct QHexOptions { // Appearance QChar unprintablechar{'.'}; QString addresslabel{""}; QString hexlabel; QString asciilabel; quint64 baseaddress{0}; unsigned int flags{QHexFlags::None}; unsigned int linelength{0x10}; unsigned int addresswidth{0}; unsigned int grouplength{1}; unsigned int scrollsteps{1}; // Colors & Styles QHash bytecolors; QColor linealternatebackground; QColor linebackground; QColor headercolor; QColor commentcolor; QColor separatorcolor; // Misc bool copybreak{true}; inline bool hasFlag(unsigned int flag) const { return flags & flag; } }; UEFITool-A66/UEFITool/qhexview5/model/qhexutils.cpp000066400000000000000000000227131442134156300221530ustar00rootroot00000000000000#include "qhexutils.h" #include "qhexoptions.h" #include "../qhexview.h" #include #include #include #include #include #include #include #if QT_VERSION >= QT_VERSION_CHECK(6, 0, 0) #define QHEXVIEW_VARIANT_EQ(x, t) ((x).metaType().id() == QMetaType::Q##t) #else #define QHEXVIEW_VARIANT_EQ(x, t) ((x).type() == QVariant::t) #endif namespace QHexUtils { Q_GLOBAL_STATIC_WITH_ARGS(QList, HEXMAP, ({ '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f' })); namespace PatternUtils { Q_GLOBAL_STATIC_WITH_ARGS(QString, WILDCARD_BYTE, ("??")) bool check(QString& p, qint64& len) { static QHash> processed; // Cache processed patterns auto it = processed.find(p); if(it != processed.end()) { p = it.value().first; len = it.value().second; return true; } QString op = p; // Store unprocessed pattern p = p.simplified().replace(" ", ""); if(p.isEmpty() || (p.size() % 2)) return false; int wccount = 0; for(auto i = 0; i < p.size() - 2; i += 2) { const auto& hexb = p.mid(i, 2); if(hexb == *WILDCARD_BYTE) { wccount++; continue; } if(!isxdigit(hexb.at(0).toLatin1()) || !isxdigit(hexb.at(1).toLatin1())) return false; } if(wccount >= p.size()) return false; len = p.size() / 2; processed[op] = qMakePair(p, len); // Cache processed pattern return true; } bool match(const QByteArray& data, const QString& pattern) { for(qint64 i = 0, idx = 0; (i <= (pattern.size() - 2)); i += 2, idx++) { if(idx >= data.size()) return false; #if QT_VERSION >= QT_VERSION_CHECK(6, 0, 0) QStringView hexb = QStringView{pattern}.mid(i, 2); #else const QStringRef& hexb = pattern.midRef(i, 2); #endif if(hexb == *WILDCARD_BYTE) continue; bool ok = false; auto b = static_cast(hexb.toUInt(&ok, 16)); if(!ok || (b != data.at(idx))) return false; } return true; } } namespace { unsigned int countBits(quint64 val) { if(val <= std::numeric_limits::max()) return QHexFindOptions::Int8; if(val <= std::numeric_limits::max()) return QHexFindOptions::Int16; if(val <= std::numeric_limits::max()) return QHexFindOptions::Int32; return QHexFindOptions::Int64; } template qint64 findIter(qint64 startoffset, QHexFindDirection fd, const QHexView* hexview, Function&& f) { QHexDocument* hexdocument = hexview->hexDocument(); qint64 offset = -1; QHexFindDirection cfd = fd; if(cfd == QHexFindDirection::All) cfd = QHexFindDirection::Forward; qint64 i = startoffset; while(offset == -1 && (cfd == QHexFindDirection::Backward ? (i >= 0) : (i < hexdocument->length()))) { if(!f(i, offset)) break; if(cfd == QHexFindDirection::Backward) i--; else i++; if(fd == QHexFindDirection::All && i >= hexdocument->length()) i = 0; } return offset; } qint64 findDefault(const QByteArray& value, qint64 startoffset, const QHexView* hexview, unsigned int options, QHexFindDirection fd) { QHexDocument* hexdocument = hexview->hexDocument(); if(value.size() > hexdocument->length()) return -1; return findIter(startoffset, fd, hexview, [options, value, hexdocument](qint64 idx, qint64& offset) -> bool { for(auto i = 0; i < value.size(); i++) { qint64 curroffset = idx + i; if(curroffset >= hexdocument->length()) { offset = -1; return false; } uchar ch1 = hexdocument->at(curroffset); uchar ch2 = value.at(i); if(!(options & QHexFindOptions::CaseSensitive)) { ch1 = std::tolower(ch1); ch2 = std::tolower(ch2); } if(ch1 != ch2) break; if(i == value.size() - 1) offset = idx; } return true; }); } qint64 findWildcard(QString pattern, qint64 startoffset, const QHexView* hexview, QHexFindDirection fd, qint64& patternlen) { QHexDocument* hexdocument = hexview->hexDocument(); if(!PatternUtils::check(pattern, patternlen) || (patternlen >= hexdocument->length())) return -1; return findIter(startoffset, fd, hexview, [hexdocument, pattern, patternlen](qint64 idx, qint64& offset) -> bool { if(PatternUtils::match(hexdocument->read(idx, patternlen), pattern)) offset = idx; return true; }); } QByteArray variantToByteArray(QVariant value, QHexFindMode mode, unsigned int options) { QByteArray v; switch(mode) { case QHexFindMode::Text: if(QHEXVIEW_VARIANT_EQ(value, String)) v = value.toString().toUtf8(); else if(QHEXVIEW_VARIANT_EQ(value, ByteArray)) v = value.toByteArray(); break; case QHexFindMode::Hex: { if(QHEXVIEW_VARIANT_EQ(value, String)) { qint64 len = 0; auto s = value.toString(); if(!PatternUtils::check(s, len)) return { }; bool ok = true; #if QT_VERSION >= QT_VERSION_CHECK(6, 0, 0) for(auto i = 0; ok && i < s.size(); i += 2) v.push_back(static_cast(QStringView{s}.mid(i, 2).toUInt(&ok, 16))); #else for(auto i = 0; ok && i < s.size(); i += 2) v.push_back(static_cast(s.midRef(i, 2).toUInt(&ok, 16))); #endif if(!ok) return { }; } else if(QHEXVIEW_VARIANT_EQ(value, ByteArray)) v = value.toByteArray(); break; } case QHexFindMode::Int: { bool ok = false; uint val = value.toUInt(&ok); if(!ok) return QByteArray{ }; QDataStream ds(&v, QIODevice::WriteOnly); if(options & QHexFindOptions::BigEndian) { if(options & QHexFindOptions::Int8) ds << qToBigEndian(val); else if(options & QHexFindOptions::Int16) ds << qToBigEndian(val); else if(options & QHexFindOptions::Int32) ds << qToBigEndian(val); else if(options & QHexFindOptions::Int64) ds << qToBigEndian(val); else return variantToByteArray(value, mode, options | countBits(val)); } else { if(options & QHexFindOptions::Int8) ds << static_cast(val); else if(options & QHexFindOptions::Int16) ds << static_cast(val); else if(options & QHexFindOptions::Int32) ds << static_cast(val); else if(options & QHexFindOptions::Int64) ds << static_cast(val); else return variantToByteArray(value, mode, options | countBits(val)); } break; } case QHexFindMode::Float: { bool ok = false; QDataStream ds(&v, QIODevice::WriteOnly); if(options & QHexFindOptions::Float) ds << value.toFloat(&ok); else if(options & QHexFindOptions::Double) ds << value.toDouble(&ok); if(!ok) return { }; } default: break; } return v; } } // namespace QByteArray toHex(const QByteArray& ba, char sep) { QByteArray hex(sep ? (ba.size() * 3 - 1) : (ba.size() * 2), Qt::Uninitialized); for(auto i = 0, o = 0; i < ba.size(); i++) { if(sep && i) hex[o++] = static_cast(sep); hex[o++] = HEXMAP->at((ba.at(i) & 0xf0) >> 4); hex[o++] = HEXMAP->at(ba.at(i) & 0x0f); } return hex; } QByteArray toHex(const QByteArray& ba) { return QHexUtils::toHex(ba, '\0'); } qint64 positionToOffset(const QHexOptions* options, QHexPosition pos) { return options->linelength * pos.line + pos.column; } QHexPosition offsetToPosition(const QHexOptions* options, qint64 offset) { return { offset / options->linelength, offset % options->linelength }; } QPair find(const QHexView* hexview, QVariant value, qint64 startoffset, QHexFindMode mode, unsigned int options, QHexFindDirection fd) { qint64 offset, size = 0; if(startoffset == -1) startoffset = static_cast(hexview->offset()); if(mode == QHexFindMode::Hex && QHEXVIEW_VARIANT_EQ(value, String)) { offset = QHexUtils::findWildcard(value.toString(), startoffset, hexview, fd, size); } else { auto ba = variantToByteArray(value, mode, options); if(!ba.isEmpty()) { offset = QHexUtils::findDefault(ba, startoffset, hexview, options, fd); size = ba.size(); } else offset = -1; } return {offset, offset > -1 ? size : 0}; } bool checkPattern(QString pattern) { qint64 len = 0; return PatternUtils::check(pattern, len); } QPair replace(const QHexView* hexview, QVariant oldvalue, QVariant newvalue, qint64 startoffset, QHexFindMode mode, unsigned int options, QHexFindDirection fd) { auto res = QHexUtils::find(hexview, oldvalue, startoffset, mode, options, fd); if(res.first != -1 && res.second > 0) { QHexDocument* hexdocument = hexview->hexDocument(); auto ba = variantToByteArray(newvalue, mode, options); if(!ba.isEmpty()) { hexdocument->remove(res.first, res.second); hexdocument->insert(res.first, ba); res.second = ba.size(); } else { res.first = -1; res.second = 0; } } return res; } } UEFITool-A66/UEFITool/qhexview5/model/qhexutils.h000066400000000000000000000035171442134156300216210ustar00rootroot00000000000000#pragma once #include #include #include #include struct QHexOptions; class QHexView; namespace QHexFindOptions { enum: unsigned int { None = (1 << 0), CaseSensitive = (1 << 1), Int8 = (1 << 2), Int16 = (1 << 3), Int32 = (1 << 4), Int64 = (1 << 5), Float = (1 << 6), Double = (1 << 7), BigEndian = (1 << 11), }; } enum class QHexFindMode { Text, Hex, Int, Float }; enum class QHexFindDirection { All, Forward, Backward }; enum class QHexArea { Header, Address, Hex, Ascii, Extra }; struct QHexPosition { qint64 line; qint64 column; static inline QHexPosition invalid() { return {-1, -1}; } inline bool isValid() const { return line >= 0 && column >= 0; } inline bool operator==(const QHexPosition& rhs) const { return (line == rhs.line) && (column == rhs.column); } inline bool operator!=(const QHexPosition& rhs) const { return (line != rhs.line) || (column != rhs.column); } }; namespace QHexUtils { QByteArray toHex(const QByteArray& ba, char sep); QByteArray toHex(const QByteArray& ba); qint64 positionToOffset(const QHexOptions* options, QHexPosition pos); QPair find(const QHexView* hexview, QVariant value, qint64 startoffset = 0, QHexFindMode mode = QHexFindMode::Text, unsigned int options = QHexFindOptions::None, QHexFindDirection fd = QHexFindDirection::Forward); QPair replace(const QHexView* hexview, QVariant oldvalue, QVariant newvalue, qint64 startoffset = 0, QHexFindMode mode = QHexFindMode::Text, unsigned int options = QHexFindOptions::None, QHexFindDirection fd = QHexFindDirection::Forward); QHexPosition offsetToPosition(const QHexOptions* options, qint64 offset); bool checkPattern(QString pattern); } UEFITool-A66/UEFITool/qhexview5/qhexview.cpp000066400000000000000000001266441442134156300206750ustar00rootroot00000000000000#include "qhexview.h" #include "model/buffer/qmemorybuffer.h" #include "model/qhexcursor.h" #include "model/qhexutils.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #if defined(QHEXVIEW_ENABLE_DIALOGS) #include "dialogs/hexfinddialog.h" #endif #if defined(QHEXVIEW_DEBUG) #include #define qhexview_fmtprint(fmt, ...) qDebug("%s " fmt, __func__, __VA_ARGS__) #else #define qhexview_fmtprint(fmt, ...) #endif QHexView::QHexView(QWidget *parent) : QAbstractScrollArea(parent), m_fontmetrics(this->font()) { QFont f = QFontDatabase::systemFont(QFontDatabase::FixedFont); if (f.styleHint() != QFont::TypeWriter) { f.setFamily("Monospace"); // Force Monospaced font f.setStyleHint(QFont::TypeWriter); } this->setFont(f); this->setMouseTracking(true); this->setFocusPolicy(Qt::StrongFocus); this->viewport()->setCursor(Qt::IBeamCursor); QPalette p = this->palette(); p.setBrush(QPalette::Window, p.base()); connect(this->verticalScrollBar(), &QScrollBar::valueChanged, this, [=](int) { this->viewport()->update(); }); m_hexmetadata = new QHexMetadata(&m_options, this); connect(m_hexmetadata, &QHexMetadata::changed, this, [=]() { this->viewport()->update(); }); m_hexcursor = new QHexCursor(&m_options, this); this->setDocument(QHexDocument::fromMemory(QByteArray(), this)); this->checkState(); connect(m_hexcursor, &QHexCursor::positionChanged, this, [=]() { m_writing = false; this->ensureVisible(); Q_EMIT positionChanged(); }); connect(m_hexcursor, &QHexCursor::modeChanged, this, [=]() { m_writing = false; this->viewport()->update(); Q_EMIT modeChanged(); }); } QRectF QHexView::headerRect() const { if(m_options.hasFlag(QHexFlags::NoHeader)) return QRectF(); return QRectF(0, 0, this->endColumnX(), this->lineHeight()); } QRectF QHexView::addressRect() const { qreal y = m_options.hasFlag(QHexFlags::NoHeader) ? 0 : this->lineHeight(); return QRectF(0, y, this->endColumnX(), this->height() - y); } QRectF QHexView::hexRect() const { qreal y = m_options.hasFlag(QHexFlags::NoHeader) ? 0 : this->lineHeight(); return QRectF(this->hexColumnX(), y, this->asciiColumnX() - this->hexColumnX(), this->height() - y); } QRectF QHexView::asciiRect() const { qreal y = m_options.hasFlag(QHexFlags::NoHeader) ? 0 : this->lineHeight(); return QRectF(this->asciiColumnX(), y, this->endColumnX() - this->asciiColumnX(), this->height() - y); } QHexDocument* QHexView::hexDocument() const { return m_hexdocument; } QHexCursor* QHexView::hexCursor() const { return m_hexdocument ? m_hexcursor : nullptr; } const QHexMetadata* QHexView::hexMetadata() const { return m_hexmetadata; } QHexOptions QHexView::options() const { return m_options; } void QHexView::setOptions(const QHexOptions& options) { auto oldlinelength = m_options.linelength; m_options = options; if(oldlinelength != m_options.linelength) m_hexmetadata->invalidate(); this->checkAndUpdate(); } void QHexView::setBaseAddress(quint64 baseaddress) { if(m_options.baseaddress == baseaddress) return; m_options.baseaddress = baseaddress; this->checkAndUpdate(); } void QHexView::setDelegate(QHexDelegate* rd) { if(m_hexdelegate == rd) return; m_hexdelegate = rd; this->checkAndUpdate(); } void QHexView::setDocument(QHexDocument* doc) { if(!doc) doc = QHexDocument::fromMemory(QByteArray(), this); if(!doc->parent()) doc->setParent(this); m_writing = false; m_hexmetadata->clear(); m_hexcursor->move(0); if(m_hexdocument) { disconnect(m_hexdocument, &QHexDocument::changed, this, nullptr); disconnect(m_hexdocument, &QHexDocument::dataChanged, this, nullptr); disconnect(m_hexdocument, &QHexDocument::reset, this, nullptr); } m_hexdocument = doc; connect(m_hexdocument, &QHexDocument::reset, this, [=]() { m_writing = false; m_hexcursor->move(0); this->checkAndUpdate(true); }); connect(m_hexdocument, &QHexDocument::dataChanged, this, &QHexView::dataChanged); connect(m_hexdocument, &QHexDocument::changed, this, [=]() { this->checkAndUpdate(true); }); this->checkAndUpdate(true); } void QHexView::setData(const QByteArray& ba) { m_hexdocument->setData(ba); } void QHexView::setData(QHexBuffer* buffer) { m_hexdocument->setData(buffer); } void QHexView::setCursorMode(QHexCursor::Mode mode) { m_hexcursor->setMode(mode); } void QHexView::setByteColor(quint8 b, QHexColor c) { m_options.bytecolors[b] = c; this->checkAndUpdate(); } void QHexView::setByteForeground(quint8 b, QColor c) { m_options.bytecolors[b].foreground = c; this->checkAndUpdate(); } void QHexView::setByteBackground(quint8 b, QColor c) { m_options.bytecolors[b].background = c; this->checkAndUpdate(); } void QHexView::setMetadata(qint64 begin, qint64 end, const QColor& fgcolor, const QColor& bgcolor, const QString& comment) { m_hexmetadata->setMetadata(begin, end, fgcolor, bgcolor, comment); } void QHexView::setForeground(qint64 begin, qint64 end, const QColor& fgcolor) { m_hexmetadata->setForeground(begin, end, fgcolor); } void QHexView::setBackground(qint64 begin, qint64 end, const QColor& bgcolor) { m_hexmetadata->setBackground(begin, end, bgcolor); } void QHexView::setComment(qint64 begin, qint64 end, const QString& comment) { m_hexmetadata->setComment(begin, end, comment); } void QHexView::setMetadataSize(qint64 begin, qint64 length, const QColor& fgcolor, const QColor& bgcolor, const QString& comment) { m_hexmetadata->setMetadataSize(begin, length, fgcolor, bgcolor, comment); } void QHexView::setForegroundSize(qint64 begin, qint64 length, const QColor& fgcolor) { m_hexmetadata->setForegroundSize(begin, length, fgcolor); } void QHexView::setBackgroundSize(qint64 begin, qint64 length, const QColor& bgcolor) { m_hexmetadata->setBackgroundSize(begin, length, bgcolor); } void QHexView::setCommentSize(qint64 begin, qint64 length, const QString& comment) { m_hexmetadata->setCommentSize(begin, length, comment); } void QHexView::removeMetadata(qint64 line) { m_hexmetadata->removeMetadata(line); } void QHexView::removeBackground(qint64 line) { m_hexmetadata->removeBackground(line); } void QHexView::removeForeground(qint64 line) { m_hexmetadata->removeForeground(line); } void QHexView::removeComments(qint64 line) { m_hexmetadata->removeComments(line); } void QHexView::unhighlight(qint64 line) { m_hexmetadata->unhighlight(line); } void QHexView::clearMetadata() { m_hexmetadata->clear(); } #if defined(QHEXVIEW_ENABLE_DIALOGS) void QHexView::showFind() { if(!m_hexdlgfind) m_hexdlgfind = new HexFindDialog(HexFindDialog::Type::Find, this); m_hexdlgfind->show(); } void QHexView::showReplace() { if(!m_hexdlgreplace) m_hexdlgreplace = new HexFindDialog(HexFindDialog::Type::Replace, this); m_hexdlgreplace->show(); } #endif void QHexView::undo() { if(m_hexdocument) m_hexdocument->undo(); } void QHexView::redo() { if(m_hexdocument) m_hexdocument->redo(); } void QHexView::cut(bool hex) { this->copy(hex); if(m_readonly) return; if(m_hexcursor->hasSelection()) this->removeSelection(); else m_hexdocument->remove(m_hexcursor->offset(), 1); } void QHexView::copyAs(CopyMode mode) const { QClipboard* c = qApp->clipboard(); QByteArray bytes = m_hexcursor->hasSelection() ? m_hexcursor->selectedBytes() : m_hexdocument->read(m_hexcursor->offset(), 1); switch(mode) { case CopyMode::HexArrayCurly: case CopyMode::HexArraySquare: { QString hexchar; int i = 0; for(char b : bytes) { if(!hexchar.isEmpty()) { hexchar += ", "; if(m_options.copybreak && !(++i % m_options.linelength)) hexchar += "\n"; } hexchar += "0x" + QString::number(static_cast(b), 16).toUpper(); } c->setText(QString(mode == CopyMode::HexArraySquare ? "[%1]" : "{%1}").arg(hexchar)); break; } case CopyMode::HexArrayChar: { QString hexchar; for(char b : bytes) hexchar += "\\x" + QString::number(static_cast(b), 16).toUpper(); c->setText(QString("\"%1\"").arg(hexchar)); break; } default: { QString hexchar; for(int i = 0; i < bytes.size(); i++) { if(!(i % m_options.grouplength)) { if(!hexchar.isEmpty()) { hexchar += ", "; if(m_options.copybreak && !(i % m_options.linelength)) hexchar += "\n"; } hexchar += "0x"; } hexchar += QString("%1").arg(static_cast(bytes[i]), 2, 16, QLatin1Char('0')).toUpper(); } c->setText(hexchar); break; } } } void QHexView::copy(bool hex) const { QClipboard* c = qApp->clipboard(); QByteArray bytes = m_hexcursor->hasSelection() ? m_hexcursor->selectedBytes() : m_hexdocument->read(m_hexcursor->offset(), 1); if(hex) bytes = QHexUtils::toHex(bytes, ' ').toUpper(); c->setText(bytes); } void QHexView::paste(bool hex) { if(m_readonly) return; QClipboard* c = qApp->clipboard(); QByteArray pastedata = c->text().toUtf8(); if(pastedata.isEmpty()) return; this->removeSelection(); if(hex) pastedata = QByteArray::fromHex(pastedata); if(m_hexcursor->mode() == QHexCursor::Mode::Insert) m_hexdocument->insert(m_hexcursor->offset(), pastedata); else m_hexdocument->replace(m_hexcursor->offset(), pastedata); } void QHexView::selectAll() { m_hexcursor->move(0); m_hexcursor->select(m_hexdocument->length()); } void QHexView::removeSelection() { if(!m_hexcursor->hasSelection()) return; if(!m_readonly) m_hexdocument->remove(m_hexcursor->selectionStartOffset(), m_hexcursor->selectionLength() - 1); m_hexcursor->clearSelection(); } void QHexView::switchMode() { m_hexcursor->switchMode(); } void QHexView::setAddressWidth(unsigned int w) { if(w == m_options.addresswidth) return; m_options.addresswidth = w; this->checkState(); } void QHexView::setScrollSteps(unsigned int l) { if(l == m_options.scrollsteps) return; m_options.scrollsteps = qMax(1u, l); } void QHexView::setReadOnly(bool r) { m_readonly = r; } void QHexView::setAutoWidth(bool r) { if(m_autowidth == r) return; m_autowidth = r; this->checkState(); } void QHexView::paint(QPainter* painter) const { QTextDocument doc; doc.setDocumentMargin(0); doc.setUndoRedoEnabled(false); doc.setDefaultFont(this->font()); QTextCursor c(&doc); this->drawHeader(c); this->drawDocument(c); painter->translate(-this->horizontalScrollBar()->value(), 0); doc.drawContents(painter); this->drawSeparators(painter); } void QHexView::checkOptions() { if(m_options.grouplength > m_options.linelength) m_options.grouplength = m_options.linelength; if(!m_options.scrollsteps) m_options.scrollsteps = 1; m_options.addresswidth = qMax(m_options.addresswidth, this->calcAddressWidth()); // Round to nearest multiple of 2 m_options.grouplength = 1u << (static_cast(qFloor(m_options.grouplength / 2.0))); if(m_options.grouplength <= 1) m_options.grouplength = 1; if(!m_options.headercolor.isValid()) m_options.headercolor = this->palette().color(QPalette::Normal, QPalette::Highlight); } void QHexView::setLineLength(unsigned int l) { if(l == m_options.linelength) return; m_options.linelength = l; m_hexmetadata->invalidate(); this->checkAndUpdate(true); } void QHexView::setGroupLength(unsigned int l) { if(l == m_options.grouplength) return; m_options.grouplength = l; this->checkAndUpdate(true); } void QHexView::checkState() { if(!m_hexdocument) return; this->checkOptions(); int doclines = static_cast(this->lines()), vislines = this->visibleLines(true); qint64 vscrollmax = doclines - vislines; if(doclines >= vislines) vscrollmax++; this->verticalScrollBar()->setRange(0, qMax(0, vscrollmax)); this->verticalScrollBar()->setPageStep(vislines - 1); this->verticalScrollBar()->setSingleStep(m_options.scrollsteps); int vw = this->verticalScrollBar()->isVisible() ? this->verticalScrollBar()->width() : 0; static int oldmw = 0; if(!oldmw) oldmw = this->maximumWidth(); this->setMaximumWidth(m_autowidth ? qCeil(this->endColumnX() + vw + 3) : oldmw); this->horizontalScrollBar()->setRange(0, qMax(0, this->endColumnX() - this->width() + vw + 3)); this->horizontalScrollBar()->setPageStep(this->width()); } void QHexView::checkAndUpdate(bool calccolumns) { this->checkState(); if(calccolumns) this->calcColumns(); this->viewport()->update(); } void QHexView::calcColumns() { if(!m_hexdocument) return; m_hexcolumns.clear(); m_hexcolumns.reserve(m_options.linelength); auto x = this->hexColumnX(), cw = this->cellWidth() * 2; for(auto i = 0u; i < m_options.linelength; i++) { for(auto j = 0u; j < m_options.grouplength; j++, x += cw) m_hexcolumns.push_back(QRect(x, 0, cw, 0)); x += this->cellWidth(); } } void QHexView::ensureVisible() { if(!m_hexdocument) return; auto pos = m_hexcursor->position(); auto vlines = this->visibleLines(); if(pos.line >= (this->verticalScrollBar()->value() + vlines)) this->verticalScrollBar()->setValue(pos.line - vlines + 1); else if(pos.line < this->verticalScrollBar()->value()) this->verticalScrollBar()->setValue(pos.line); else this->viewport()->update(); } void QHexView::drawSeparators(QPainter* p) const { if(!m_options.hasFlag(QHexFlags::Separators)) return; auto oldpen = p->pen(); p->setPen(m_options.separatorcolor.isValid() ? m_options.separatorcolor : this->palette().color(QPalette::Dark)); if(m_options.hasFlag(QHexFlags::HSeparator)) { QLineF l(0, m_fontmetrics.lineSpacing(), this->endColumnX(), m_fontmetrics.lineSpacing()); if(!m_hexdelegate || !m_hexdelegate->paintSeparator(p, l, this)) p->drawLine(l); } if(m_options.hasFlag(QHexFlags::VSeparator)) { QLineF l1(this->hexColumnX(), 0, this->hexColumnX(), this->height()); QLineF l2(this->asciiColumnX(), 0, this->asciiColumnX(), this->height()); if(!m_hexdelegate || !m_hexdelegate->paintSeparator(p, l1, this)) p->drawLine(l1); if(!m_hexdelegate || !m_hexdelegate->paintSeparator(p, l2, this)) p->drawLine(l2); } p->setPen(oldpen); } void QHexView::drawHeader(QTextCursor& c) const { if(m_options.hasFlag(QHexFlags::NoHeader)) return; static const auto RESET_FORMAT = [](const QHexOptions& options, QTextCharFormat& cf) { cf = { }; cf.setForeground(options.headercolor); }; QString addresslabel; if(m_hexdelegate) addresslabel = m_hexdelegate->addressHeader(this); if(addresslabel.isEmpty() && !m_options.addresslabel.isEmpty()) addresslabel = m_options.addresslabel; QTextCharFormat cf; RESET_FORMAT(m_options, cf); if(m_hexdelegate) m_hexdelegate->renderHeaderPart(addresslabel, QHexArea::Address, cf, this); c.insertText(" " + QHexView::reduced(addresslabel, this->addressWidth()) + " ", cf); if(m_hexdelegate) RESET_FORMAT(m_options, cf); QString hexlabel; if(m_hexdelegate) hexlabel = m_hexdelegate->hexHeader(this); if(hexlabel.isEmpty()) hexlabel = m_options.hexlabel; if(hexlabel.isNull()) { c.insertText(" ", { }); for(auto i = 0u; i < m_options.linelength; i += m_options.grouplength) { QString h = QString::number(i, 16).rightJustified(m_options.grouplength * 2, '0').toUpper(); if(m_hexdelegate) { RESET_FORMAT(m_options, cf); m_hexdelegate->renderHeaderPart(h, QHexArea::Hex, cf, this); } if(m_hexcursor->column() == static_cast(i) && m_options.hasFlag(QHexFlags::HighlightColumn)) { cf.setBackground(this->palette().color(QPalette::Highlight)); cf.setForeground(this->palette().color(QPalette::HighlightedText)); } c.insertText(h, cf); c.insertText(" ", { }); RESET_FORMAT(m_options, cf); } } else { if(m_hexdelegate) m_hexdelegate->renderHeaderPart(hexlabel, QHexArea::Hex, cf, this); c.insertText(" " + QHexView::reduced(hexlabel, (this->hexColumnWidth() / this->cellWidth()) - 1) + " "); } if(m_hexdelegate) RESET_FORMAT(m_options, cf); QString asciilabel; if(m_hexdelegate) asciilabel = m_hexdelegate->asciiHeader(this); if(asciilabel.isEmpty()) asciilabel = m_options.asciilabel; if(asciilabel.isNull()) { c.insertText(" ", { }); for(unsigned int i = 0; i < m_options.linelength; i++) { QString a = QString::number(i, 16).toUpper(); if(m_hexdelegate) { RESET_FORMAT(m_options, cf); m_hexdelegate->renderHeaderPart(a, QHexArea::Ascii, cf, this); } if(m_hexcursor->column() == static_cast(i) && m_options.hasFlag(QHexFlags::HighlightColumn)) { cf.setBackground(this->palette().color(QPalette::Highlight)); cf.setForeground(this->palette().color(QPalette::HighlightedText)); } c.insertText(a, cf); RESET_FORMAT(m_options, cf); } c.insertText(" ", { }); } else { if(m_hexdelegate) m_hexdelegate->renderHeaderPart(asciilabel, QHexArea::Ascii, cf, this); c.insertText(" " + QHexView::reduced(asciilabel, ((this->endColumnX() - this->asciiColumnX() - this->cellWidth()) / this->cellWidth()) - 1) + " "); } QTextBlockFormat bf; if(m_options.hasFlag(QHexFlags::StyledHeader)) bf.setBackground(this->palette().color(QPalette::Window)); if(m_hexdelegate) m_hexdelegate->renderHeader(bf, this); c.setBlockFormat(bf); c.insertBlock(); } void QHexView::drawDocument(QTextCursor& c) const { if(!m_hexdocument) return; qreal y = !m_options.hasFlag(QHexFlags::NoHeader) ? this->lineHeight() : 0; quint64 line = static_cast(this->verticalScrollBar()->value()); QTextCharFormat addrformat; addrformat.setForeground(this->palette().color(QPalette::Normal, QPalette::Highlight)); for(qint64 l = 0; m_hexdocument->isEmpty() || (line < this->lines() && l < this->visibleLines()); l++, line++, y += this->lineHeight()) { quint64 address = line * m_options.linelength + this->baseAddress(); QString addrstr = QString::number(address, 16).rightJustified(this->addressWidth(), '0').toUpper(); // Address Part QTextCharFormat acf; acf.setForeground(m_options.headercolor); if(m_options.hasFlag(QHexFlags::StyledAddress)) acf.setBackground(this->palette().color(QPalette::Window)); if(m_hexdelegate) m_hexdelegate->renderAddress(address, acf, this); if(m_hexcursor->line() == static_cast(line) && m_options.hasFlag(QHexFlags::HighlightAddress)) { acf.setBackground(this->palette().color(QPalette::Highlight)); acf.setForeground(this->palette().color(QPalette::HighlightedText)); } c.insertText(" " + addrstr + " ", acf); auto linebytes = this->getLine(line); c.insertText(" ", { }); // Hex Part for(auto column = 0u; column < m_options.linelength; ) { QTextCharFormat cf; for(auto byteidx = 0u; byteidx < m_options.grouplength; byteidx++, column++) { QString s = linebytes.isEmpty() || column >= static_cast(linebytes.size()) ? " " : QString(QHexUtils::toHex(linebytes.mid(column, 1)).toUpper()); quint8 b = static_cast(column) < linebytes.size() ? linebytes.at(column) : 0x00; cf = this->drawFormat(c, b, s, QHexArea::Hex, line, column, static_cast(column) < linebytes.size()); } c.insertText(" ", cf); } c.insertText(" ", { }); // Ascii Part for(auto column = 0u; column < m_options.linelength; column++) { auto s = linebytes.isEmpty() || column >= static_cast(linebytes.size()) ? QChar(' ') : (QChar::isPrint(linebytes.at(column)) ? QChar(linebytes.at(column)) : m_options.unprintablechar); quint8 b = static_cast(column) < linebytes.size() ? linebytes.at(column) : 0x00; this->drawFormat(c, b, s, QHexArea::Ascii, line, column, static_cast(column) < linebytes.size()); } QTextBlockFormat bf; if(m_options.linealternatebackground.isValid() && line % 2) bf.setBackground(m_options.linealternatebackground); else if(m_options.linebackground.isValid() && !(line % 2)) bf.setBackground(m_options.linebackground); c.setBlockFormat(bf); c.insertBlock({}); if(m_hexdocument->isEmpty()) break; } } unsigned int QHexView::calcAddressWidth() const { if(!m_hexdocument) return 0; auto maxaddr = static_cast(m_options.baseaddress + m_hexdocument->length()); if(maxaddr <= std::numeric_limits::max()) return 8; return QString::number(maxaddr, 16).size(); } int QHexView::visibleLines(bool absolute) const { int vl = static_cast(qCeil(this->viewport()->height() / this->lineHeight())); if(!m_options.hasFlag(QHexFlags::NoHeader)) vl--; return absolute ? vl : qMin(this->lines(), vl); } qint64 QHexView::getLastColumn(qint64 line) const { return this->getLine(line).size() - 1; } qint64 QHexView::lastLine() const { return qMax(0, this->lines() - 1); } qreal QHexView::hexColumnWidth() const { int l = 0; for(auto i = 0u; i < m_options.linelength; i += m_options.grouplength) l += (2 * m_options.grouplength) + 1; return this->getNCellsWidth(l); } unsigned int QHexView::addressWidth() const { if(!m_hexdocument || m_options.addresswidth) return m_options.addresswidth; return this->calcAddressWidth(); } unsigned int QHexView::lineLength() const { return m_options.linelength; } bool QHexView::canUndo() const { return m_hexdocument && m_hexdocument->canUndo(); } bool QHexView::canRedo() const { return m_hexdocument && m_hexdocument->canRedo(); } quint64 QHexView::offset() const { return m_hexcursor->offset(); } quint64 QHexView::address() const { return m_hexcursor->address(); } QHexPosition QHexView::position() const { return m_hexcursor->position(); } QHexPosition QHexView::selectionStart() const { return m_hexcursor->selectionStart(); } QHexPosition QHexView::selectionEnd() const { return m_hexcursor->selectionEnd(); } quint64 QHexView::selectionStartOffset() const { return m_hexcursor->selectionStartOffset(); } quint64 QHexView::selectionEndOffset() const { return m_hexcursor->selectionEndOffset(); } quint64 QHexView::baseAddress() const { return m_options.baseaddress; } quint64 QHexView::lines() const { if(!m_hexdocument) return 0; auto lines = static_cast(qCeil(m_hexdocument->length() / static_cast(m_options.linelength))); return !m_hexdocument->isEmpty() && !lines ? 1 : lines; } qint64 QHexView::replace(const QVariant& oldvalue, const QVariant& newvalue, qint64 offset, QHexFindMode mode, unsigned int options, QHexFindDirection fd) const { auto res = QHexUtils::replace(this, oldvalue, newvalue, offset, mode, options, fd); if(res.first > -1) { m_hexcursor->move(res.first); m_hexcursor->selectSize(res.second); } return res.first; } qint64 QHexView::find(const QVariant& value, qint64 offset, QHexFindMode mode, unsigned int options, QHexFindDirection fd) const { auto res = QHexUtils::find(this, value, offset, mode, options, fd); if(res.first > -1) { m_hexcursor->move(res.first); m_hexcursor->selectSize(res.second); } return res.first; } qreal QHexView::hexColumnX() const { return this->getNCellsWidth(this->addressWidth() + 2); } qreal QHexView::asciiColumnX() const { return this->hexColumnX() + this->hexColumnWidth() + this->cellWidth(); } qreal QHexView::endColumnX() const { return this->asciiColumnX() + this->getNCellsWidth(m_options.linelength + 1) + this->cellWidth(); } qreal QHexView::getNCellsWidth(int n) const { return n * this->cellWidth(); } qreal QHexView::cellWidth() const { #if QT_VERSION >= QT_VERSION_CHECK(5, 11, 0) return m_fontmetrics.horizontalAdvance(" "); #else return m_fontmetrics.width(" "); #endif } qreal QHexView::lineHeight() const { return m_fontmetrics.height(); } QHexPosition QHexView::positionFromPoint(QPoint pt) const { QHexPosition pos = QHexPosition::invalid(); auto abspt = this->absolutePoint(pt); switch(this->areaFromPoint(pt)) { case QHexArea::Hex: { pos.column = -1; for(qint64 i = 0; i < m_hexcolumns.size(); i++) { if(m_hexcolumns.at(i).left() > abspt.x()) break; pos.column = i; } break; } case QHexArea::Ascii: pos.column = qMax(qFloor((abspt.x() - this->asciiColumnX()) / this->cellWidth()) - 1, 0); break; case QHexArea::Address: pos.column = 0; break; case QHexArea::Header: return QHexPosition::invalid(); default: break; } pos.line = qMin(this->verticalScrollBar()->value() + (abspt.y() / this->lineHeight()), this->lines()); if(!m_options.hasFlag(QHexFlags::NoHeader)) pos.line = qMax(0, pos.line - 1); auto docline = this->getLine(pos.line); pos.column = qMin(pos.column, docline.isEmpty() ? 0 : docline.size()); qhexview_fmtprint("line: %lld, col: %lld", pos.line, pos.column); return pos; } QPoint QHexView::absolutePoint(QPoint pt) const { return pt + QPoint(this->horizontalScrollBar()->value(), 0); } QHexArea QHexView::areaFromPoint(QPoint pt) const { pt = this->absolutePoint(pt); qreal line = this->verticalScrollBar()->value() + pt.y() / this->lineHeight(); if(!m_options.hasFlag(QHexFlags::NoHeader) && !qFloor(line)) return QHexArea::Header; if(pt.x() < this->hexColumnX()) return QHexArea::Address; if(pt.x() < this->asciiColumnX()) return QHexArea::Hex; if(pt.x() < this->endColumnX()) return QHexArea::Ascii; return QHexArea::Extra; } QTextCharFormat QHexView::drawFormat(QTextCursor& c, quint8 b, const QString& s, QHexArea area, qint64 line, qint64 column, bool applyformat) const { QTextCharFormat cf, selcf; QHexPosition pos{line, column}; if(applyformat) { auto offset = m_hexcursor->positionToOffset(pos); bool hasdelegate = m_hexdelegate && m_hexdelegate->render(offset, b, cf, this); if(!hasdelegate) { auto it = m_options.bytecolors.find(b); if(it != m_options.bytecolors.end()) { if(it->background.isValid()) cf.setBackground(it->background); if(it->foreground.isValid()) cf.setForeground(it->foreground); } } const auto* metadataline = m_hexmetadata->find(line); if(metadataline) { for(const auto& metadata : *metadataline) { if(offset < metadata.begin || offset >= metadata.end) continue; if(!hasdelegate) { if(metadata.foreground.isValid()) cf.setForeground(metadata.foreground); if(metadata.background.isValid()) { cf.setBackground(metadata.background); if(!metadata.foreground.isValid()) cf.setForeground(this->getReadableColor(metadata.background)); } } if(!metadata.comment.isEmpty()) { cf.setUnderlineColor(m_options.commentcolor.isValid() ? m_options.commentcolor : this->palette().color(QPalette::WindowText)); cf.setUnderlineStyle(QTextCharFormat::UnderlineStyle::SingleUnderline); } if(offset == metadata.begin) // Remove previous metadata's style, if needed { if(metadata.comment.isEmpty()) selcf.setUnderlineStyle(QTextCharFormat::UnderlineStyle::NoUnderline); if(!metadata.foreground.isValid()) selcf.setForeground(Qt::color1); if(!metadata.background.isValid()) selcf.setBackground(Qt::transparent); } if(offset < metadata.end - 1 && column < this->getLastColumn(line)) selcf = cf; } } if(hasdelegate && column < this->getLastColumn(line)) selcf = cf; } if(this->hexCursor()->isSelected(line, column)) { auto offset = this->hexCursor()->positionToOffset(pos); auto selend = this->hexCursor()->selectionEndOffset(); cf.setBackground(this->palette().color(QPalette::Normal, QPalette::Highlight)); cf.setForeground(this->palette().color(QPalette::Normal, QPalette::HighlightedText)); if(offset < selend && column < this->getLastColumn(line)) selcf = cf; } if(this->hexCursor()->position() == pos) { auto cursorbg = this->palette().color(this->hasFocus() ? QPalette::Normal : QPalette::Disabled, QPalette::WindowText); auto cursorfg = this->palette().color(this->hasFocus() ? QPalette::Normal : QPalette::Disabled, QPalette::Base); auto discursorbg = this->palette().color(QPalette::Disabled, QPalette::WindowText); auto discursorfg = this->palette().color(QPalette::Disabled, QPalette::Base); switch(m_hexcursor->mode()) { case QHexCursor::Mode::Insert: cf.setUnderlineColor(m_currentarea == area ? cursorbg : discursorbg); cf.setUnderlineStyle(QTextCharFormat::UnderlineStyle::SingleUnderline); break; case QHexCursor::Mode::Overwrite: cf.setBackground(m_currentarea == area ? cursorbg : discursorbg); cf.setForeground(m_currentarea == area ? cursorfg : discursorfg); break; } } c.insertText(s, cf); return selcf; } void QHexView::moveNext(bool select) { auto line = this->hexCursor()->line(), column = this->hexCursor()->column(); if(column >= m_options.linelength - 1) { line++; column = 0; } else column++; qint64 offset = this->hexCursor()->mode() == QHexCursor::Mode::Insert ? 1 : 0; if(select) this->hexCursor()->select(qMin(line, this->lines()), qMin(column, this->getLastColumn(line) + offset)); else this->hexCursor()->move(qMin(line, this->lines()), qMin(column, this->getLastColumn(line) + offset)); } void QHexView::movePrevious(bool select) { auto line = this->hexCursor()->line(), column = this->hexCursor()->column(); if(column <= 0) { if(!line) return; column = this->getLine(--line).size() - 1; } else column--; if(select) this->hexCursor()->select(qMin(line, this->lines()), qMin(column, this->getLastColumn(line))); else this->hexCursor()->move(qMin(line, this->lines()), qMin(column, this->getLastColumn(line))); } bool QHexView::keyPressMove(QKeyEvent* e) { if(e->matches(QKeySequence::MoveToNextChar) || e->matches(QKeySequence::SelectNextChar)) this->moveNext(e->matches(QKeySequence::SelectNextChar)); else if(e->matches(QKeySequence::MoveToPreviousChar) || e->matches(QKeySequence::SelectPreviousChar)) this->movePrevious(e->matches(QKeySequence::SelectPreviousChar)); else if(e->matches(QKeySequence::MoveToNextLine) || e->matches(QKeySequence::SelectNextLine)) { if(this->hexCursor()->line() == this->lastLine()) return true; auto nextline = this->hexCursor()->line() + 1; if(e->matches(QKeySequence::MoveToNextLine)) this->hexCursor()->move(nextline, this->hexCursor()->column()); else this->hexCursor()->select(nextline, this->hexCursor()->column()); } else if(e->matches(QKeySequence::MoveToPreviousLine) || e->matches(QKeySequence::SelectPreviousLine)) { if(!this->hexCursor()->line()) return true; auto prevline = this->hexCursor()->line() - 1; if(e->matches(QKeySequence::MoveToPreviousLine)) this->hexCursor()->move(prevline, this->hexCursor()->column()); else this->hexCursor()->select(prevline, this->hexCursor()->column()); } else if(e->matches(QKeySequence::MoveToNextPage) || e->matches(QKeySequence::SelectNextPage)) { if(this->lastLine() == this->hexCursor()->line()) return true; auto pageline = qMin(this->lastLine(), this->hexCursor()->line() + this->visibleLines()); if(e->matches(QKeySequence::MoveToNextPage)) this->hexCursor()->move(pageline, this->hexCursor()->column()); else this->hexCursor()->select(pageline, this->hexCursor()->column()); } else if(e->matches(QKeySequence::MoveToPreviousPage) || e->matches(QKeySequence::SelectPreviousPage)) { if(!this->hexCursor()->line()) return true; auto pageline = qMax(0, this->hexCursor()->line() - this->visibleLines()); if(e->matches(QKeySequence::MoveToPreviousPage)) this->hexCursor()->move(pageline, this->hexCursor()->column()); else this->hexCursor()->select(pageline, this->hexCursor()->column()); } else if(e->matches(QKeySequence::MoveToStartOfDocument) || e->matches(QKeySequence::SelectStartOfDocument)) { if(!this->hexCursor()->line()) return true; if(e->matches(QKeySequence::MoveToStartOfDocument)) this->hexCursor()->move(0, 0); else this->hexCursor()->select(0, 0); } else if(e->matches(QKeySequence::MoveToEndOfDocument) || e->matches(QKeySequence::SelectEndOfDocument)) { if(this->lastLine() == this->hexCursor()->line()) return true; if(e->matches(QKeySequence::MoveToEndOfDocument)) this->hexCursor()->move(this->lastLine(), this->getLastColumn(this->hexCursor()->line())); else this->hexCursor()->select(this->lastLine(), this->getLastColumn(this->lastLine())); } else if(e->matches(QKeySequence::MoveToStartOfLine) || e->matches(QKeySequence::SelectStartOfLine)) { auto offset = this->hexCursor()->positionToOffset({this->hexCursor()->line(), 0}); if(e->matches(QKeySequence::MoveToStartOfLine)) this->hexCursor()->move(offset); else this->hexCursor()->select(offset); } else if(e->matches(QKeySequence::SelectEndOfLine) || e->matches(QKeySequence::MoveToEndOfLine)) { auto offset = this->hexCursor()->positionToOffset({this->hexCursor()->line(), this->getLastColumn(this->hexCursor()->line())}); if(e->matches(QKeySequence::SelectEndOfLine)) this->hexCursor()->select(offset); else this->hexCursor()->move(offset); } else return false; return true; } bool QHexView::keyPressTextInput(QKeyEvent* e) { if(m_readonly || e->text().isEmpty() || (e->modifiers() & Qt::ControlModifier)) return false; bool atend = m_hexcursor->offset() >= m_hexdocument->length(); if(atend && m_hexcursor->mode() == QHexCursor::Mode::Overwrite) return false; char key = e->text().at(0).toLatin1(); switch(m_currentarea) { case QHexArea::Hex: { if(!isxdigit(key)) return false; bool ok = false; auto val = static_cast(QString(key).toUInt(&ok, 16)); if(!ok) return false; m_hexcursor->removeSelection(); quint8 ch = m_hexdocument->isEmpty() || m_hexcursor->offset() >= m_hexdocument->length() ? '\x00' : m_hexdocument->at(m_hexcursor->offset()); ch = m_writing ? (ch << 4) | val : val; if(!m_writing && (m_hexcursor->mode() == QHexCursor::Mode::Insert)) m_hexdocument->insert(m_hexcursor->offset(), val); else m_hexdocument->replace(m_hexcursor->offset(), ch); m_writing = !m_writing; if(!m_writing) this->moveNext(); break; } case QHexArea::Ascii: { if(!QChar::isPrint(key)) return false; m_hexcursor->removeSelection(); if(m_hexcursor->mode() == QHexCursor::Mode::Insert) m_hexdocument->insert(m_hexcursor->offset(), key); else m_hexdocument->replace(m_hexcursor->offset(), key); this->moveNext(); break; } default: return false; } return true; } bool QHexView::keyPressAction(QKeyEvent* e) { if(e->modifiers() != Qt::NoModifier) { if(e->matches(QKeySequence::SelectAll)) this->selectAll(); else if(!m_readonly && e->matches(QKeySequence::Undo)) this->undo(); else if(!m_readonly && e->matches(QKeySequence::Redo)) this->redo(); else if(!m_readonly && e->matches(QKeySequence::Cut)) this->cut(m_currentarea != QHexArea::Ascii); else if(e->matches(QKeySequence::Copy)) this->copy(m_currentarea != QHexArea::Ascii); else if(!m_readonly && e->matches(QKeySequence::Paste)) this->paste(m_currentarea != QHexArea::Ascii); else return false; return true; } if(m_readonly) return false; switch(e->key()) { case Qt::Key_Backspace: case Qt::Key_Delete: { if(!m_hexcursor->hasSelection()) { auto offset = m_hexcursor->offset(); if(offset <= 0) return true; if(e->key() == Qt::Key_Backspace) m_hexdocument->remove(offset - 1, 1); else m_hexdocument->remove(offset, 1); } else { auto oldpos = m_hexcursor->selectionStart(); m_hexcursor->removeSelection(); m_hexcursor->move(oldpos); } if(e->key() == Qt::Key_Backspace) this->movePrevious(); m_writing = false; break; } case Qt::Key_Insert: m_writing = false; m_hexcursor->switchMode(); break; default: return false; } return true; } bool QHexView::event(QEvent* e) { switch(e->type()) { case QEvent::FontChange: m_fontmetrics = QFontMetricsF(this->font()); this->checkAndUpdate(true); return true; case QEvent::ToolTip: { if(m_hexdocument && (m_currentarea == QHexArea::Hex || m_currentarea == QHexArea::Ascii)) { auto* helpevent = static_cast(e); auto pos = this->positionFromPoint(helpevent->pos()); auto comment = m_hexmetadata->getComment(pos.line, pos.column); if(!comment.isEmpty()) QToolTip::showText(helpevent->globalPos(), comment); return true; } break; } default: break; } return QAbstractScrollArea::event(e); } void QHexView::showEvent(QShowEvent* e) { QAbstractScrollArea::showEvent(e); this->checkAndUpdate(true); } void QHexView::paintEvent(QPaintEvent*) { if(!m_hexdocument) return; QPainter painter(this->viewport()); if(m_hexdelegate) m_hexdelegate->paint(&painter, this); else this->paint(&painter); } void QHexView::resizeEvent(QResizeEvent* e) { this->checkState(); QAbstractScrollArea::resizeEvent(e); } void QHexView::focusInEvent(QFocusEvent* e) { QAbstractScrollArea::focusInEvent(e); if(m_hexdocument) this->viewport()->update(); } void QHexView::focusOutEvent(QFocusEvent* e) { QAbstractScrollArea::focusOutEvent(e); if(m_hexdocument) this->viewport()->update(); } void QHexView::mousePressEvent(QMouseEvent* e) { QAbstractScrollArea::mousePressEvent(e); if(!m_hexdocument || e->button() != Qt::LeftButton) return; auto pos = this->positionFromPoint(e->pos()); if(!pos.isValid()) return; auto area = this->areaFromPoint(e->pos()); qhexview_fmtprint("%d", static_cast(area)); switch(area) { case QHexArea::Address: this->hexCursor()->move(pos.line, 0); break; case QHexArea::Hex: m_currentarea = area; this->hexCursor()->move(pos); break; case QHexArea::Ascii: m_currentarea = area; this->hexCursor()->move(pos.line, pos.column); break; default: return; } this->viewport()->update(); } void QHexView::mouseMoveEvent(QMouseEvent* e) { QAbstractScrollArea::mouseMoveEvent(e); if(!this->hexCursor()) return; e->accept(); auto area = this->areaFromPoint(e->pos()); switch(area) { case QHexArea::Header: this->viewport()->setCursor(Qt::ArrowCursor); return; case QHexArea::Address: this->viewport()->setCursor(Qt::ArrowCursor); break; default: this->viewport()->setCursor(Qt::IBeamCursor); break; } if(e->buttons() == Qt::LeftButton) { auto pos = this->positionFromPoint(e->pos()); if(!pos.isValid()) return; if(area == QHexArea::Ascii || area == QHexArea::Hex) m_currentarea = area; this->hexCursor()->select(pos); } } void QHexView::wheelEvent(QWheelEvent* e) { e->ignore(); #if defined Q_OS_OSX // In macOS scrollbar invisibility should not prevent scrolling from working if(!m_hexdocument) return; #else if(!m_hexdocument || !this->verticalScrollBar()->isVisible()) return; #endif auto ydelta = e->angleDelta().y(); if(ydelta > 0) this->verticalScrollBar()->setValue(this->verticalScrollBar()->value() - m_options.scrollsteps); else if(ydelta < 0) this->verticalScrollBar()->setValue(this->verticalScrollBar()->value() + m_options.scrollsteps); } void QHexView::keyPressEvent(QKeyEvent* e) { bool handled = false; if(this->hexCursor()) { handled = this->keyPressMove(e); if(!handled) handled = this->keyPressAction(e); if(!handled) handled = this->keyPressTextInput(e); } if(handled) e->accept(); else QAbstractScrollArea::keyPressEvent(e); } QString QHexView::reduced(const QString& s, int maxlen) { if(s.length() <= maxlen) return s.leftJustified(maxlen); return s.mid(0, maxlen - 1) + "\u2026"; } bool QHexView::isColorLight(QColor c) { return std::sqrt(0.299 * std::pow(c.red(), 2) + 0.587 * std::pow(c.green(), 2) + 0.114 * std::pow(c.blue(), 2)) > 127.5; } QColor QHexView::getReadableColor(QColor c) const { QPalette palette = this->palette(); return QHexView::isColorLight(c) ? palette.color(QPalette::Normal, QPalette::WindowText) : palette.color(QPalette::Normal, QPalette::HighlightedText); } QByteArray QHexView::selectedBytes() const { return m_hexcursor->hasSelection() ? m_hexdocument->read(m_hexcursor->selectionStartOffset(), m_hexcursor->selectionLength()) : QByteArray{ }; } QByteArray QHexView::getLine(qint64 line) const { return m_hexdocument ? m_hexdocument->read(line * m_options.linelength, m_options.linelength) : QByteArray{ }; } UEFITool-A66/UEFITool/qhexview5/qhexview.h000066400000000000000000000152411442134156300203300ustar00rootroot00000000000000#pragma once #define QHEXVIEW_VERSION 5.0 #include #include #include #include #include #include "model/qhexdelegate.h" #include "model/qhexdocument.h" #include "model/qhexcursor.h" #if defined(QHEXVIEW_ENABLE_DIALOGS) class HexFindDialog; #endif class QHexView : public QAbstractScrollArea { Q_OBJECT public: enum class CopyMode { Visual, HexArraySquare, HexArrayCurly, HexArrayChar }; Q_ENUM(CopyMode); public: explicit QHexView(QWidget *parent = nullptr); QRectF headerRect() const; QRectF addressRect() const; QRectF hexRect() const; QRectF asciiRect() const; QHexDocument* hexDocument() const; QHexCursor* hexCursor() const; const QHexMetadata* hexMetadata() const; QHexOptions options() const; QColor getReadableColor(QColor c) const; QByteArray selectedBytes() const; QByteArray getLine(qint64 line) const; unsigned int addressWidth() const; unsigned int lineLength() const; bool canUndo() const; bool canRedo() const; quint64 offset() const; quint64 address() const; QHexPosition position() const; QHexPosition selectionStart() const; QHexPosition selectionEnd() const; quint64 selectionStartOffset() const; quint64 selectionEndOffset() const; quint64 baseAddress() const; quint64 lines() const; qint64 replace(const QVariant& oldvalue, const QVariant& newvalue, qint64 offset, QHexFindMode mode = QHexFindMode::Text, unsigned int options = QHexFindOptions::None, QHexFindDirection fd = QHexFindDirection::Forward) const; qint64 find(const QVariant& value, qint64 offset, QHexFindMode mode = QHexFindMode::Text, unsigned int options = QHexFindOptions::None, QHexFindDirection fd = QHexFindDirection::Forward) const; void setOptions(const QHexOptions& options); void setBaseAddress(quint64 baseaddress); void setDelegate(QHexDelegate* rd); void setDocument(QHexDocument* doc); void setData(const QByteArray& ba); void setData(QHexBuffer* buffer); void setCursorMode(QHexCursor::Mode mode); void setByteColor(quint8 b, QHexColor c); void setByteForeground(quint8 b, QColor c); void setByteBackground(quint8 b, QColor c); void setMetadata(qint64 begin, qint64 end, const QColor &fgcolor, const QColor &bgcolor, const QString &comment); void setForeground(qint64 begin, qint64 end, const QColor &fgcolor); void setBackground(qint64 begin, qint64 end, const QColor &bgcolor); void setComment(qint64 begin, qint64 end, const QString& comment); void setMetadataSize(qint64 begin, qint64 length, const QColor &fgcolor, const QColor &bgcolor, const QString &comment); void setForegroundSize(qint64 begin, qint64 length, const QColor &fgcolor); void setBackgroundSize(qint64 begin, qint64 length, const QColor &bgcolor); void setCommentSize(qint64 begin, qint64 length, const QString& comment); void removeMetadata(qint64 line); void removeBackground(qint64 line); void removeForeground(qint64 line); void removeComments(qint64 line); void unhighlight(qint64 line); void clearMetadata(); public Q_SLOTS: #if defined(QHEXVIEW_ENABLE_DIALOGS) void showFind(); void showReplace(); #endif void undo(); void redo(); void cut(bool hex = false); void copyAs(CopyMode mode = CopyMode::Visual) const; void copy(bool hex = false) const; void paste(bool hex = false); void selectAll(); void removeSelection(); void switchMode(); void setAddressWidth(unsigned int w); void setLineLength(unsigned int l); void setGroupLength(unsigned int l); void setScrollSteps(unsigned int l); void setReadOnly(bool r); void setAutoWidth(bool r); private: void paint(QPainter* painter) const; void checkOptions(); void checkState(); void checkAndUpdate(bool calccolumns = false); void calcColumns(); void ensureVisible(); void drawSeparators(QPainter* p) const; void drawHeader(QTextCursor& c) const; void drawDocument(QTextCursor& c) const; QTextCharFormat drawFormat(QTextCursor& c, quint8 b, const QString& s, QHexArea area, qint64 line, qint64 column, bool applyformat) const; unsigned int calcAddressWidth() const; int visibleLines(bool absolute = false) const; qint64 getLastColumn(qint64 line) const; qint64 lastLine() const; qreal getNCellsWidth(int n) const; qreal hexColumnWidth() const; qreal hexColumnX() const; qreal asciiColumnX() const; qreal endColumnX() const; qreal cellWidth() const; qreal lineHeight() const; QHexPosition positionFromPoint(QPoint pt) const; QPoint absolutePoint(QPoint pt) const; QHexArea areaFromPoint(QPoint pt) const; void moveNext(bool select = false); void movePrevious(bool select = false); bool keyPressMove(QKeyEvent* e); bool keyPressTextInput(QKeyEvent* e); bool keyPressAction(QKeyEvent* e); protected: bool event(QEvent* e) override; void showEvent(QShowEvent* e) override; void paintEvent(QPaintEvent*) override; void resizeEvent(QResizeEvent* e) override; void focusInEvent(QFocusEvent* e) override; void focusOutEvent(QFocusEvent* e) override; void mousePressEvent(QMouseEvent* e) override; void mouseMoveEvent(QMouseEvent* e) override; void wheelEvent(QWheelEvent* e) override; void keyPressEvent(QKeyEvent *e) override; private: static QString reduced(const QString& s, int maxlen); static bool isColorLight(QColor c); Q_SIGNALS: void dataChanged(const QByteArray& data, quint64 offset, QHexDocument::ChangeReason reason); void positionChanged(); void modeChanged(); private: bool m_readonly{false}, m_writing{false}, m_autowidth{false}; QHexArea m_currentarea{QHexArea::Ascii}; QList m_hexcolumns; QFontMetricsF m_fontmetrics; QHexOptions m_options; QHexCursor* m_hexcursor{nullptr}; QHexDocument* m_hexdocument{nullptr}; QHexMetadata* m_hexmetadata{nullptr}; QHexDelegate* m_hexdelegate{nullptr}; #if defined(QHEXVIEW_ENABLE_DIALOGS) HexFindDialog *m_hexdlgfind{nullptr}, *m_hexdlgreplace{nullptr}; #endif friend class QHexDelegate; friend class QHexCursor; }; UEFITool-A66/UEFITool/searchdialog.cpp000066400000000000000000000033311442134156300175200ustar00rootroot00000000000000/* searchdialog.cpp Copyright (c) 2014, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "searchdialog.h" SearchDialog::SearchDialog(QWidget *parent) : QDialog(parent, Qt::WindowTitleHint | Qt::WindowSystemMenuHint | Qt::WindowCloseButtonHint), ui(new Ui::SearchDialog), #if QT_VERSION_MAJOR >= 6 hexValidator(QRegularExpression("([0-9a-fA-F\\. ])*")), guidValidator(QRegularExpression("[0-9a-fA-F\\.]{8}-[0-9a-fA-F\\.]{4}-[0-9a-fA-F\\.]{4}-[0-9a-fA-F\\.]{4}-[0-9a-fA-F\\.]{12}")) #else hexValidator(QRegExp("([0-9a-fA-F\\. ])*")), guidValidator(QRegExp("[0-9a-fA-F\\.]{8}-[0-9a-fA-F\\.]{4}-[0-9a-fA-F\\.]{4}-[0-9a-fA-F\\.]{4}-[0-9a-fA-F\\.]{12}")) #endif { // Create UI ui->setupUi(this); ui->hexEdit->setValidator(&hexValidator); ui->guidEdit->setValidator(&guidValidator); // Connect connect(ui->tabWidget, SIGNAL(currentChanged(int)), this, SLOT(setEditFocus(int))); // Set initial focus setEditFocus(ui->tabWidget->currentIndex()); } SearchDialog::~SearchDialog() { delete ui; } void SearchDialog::setEditFocus(int index) { if (index == 0) // Hex pattern ui->hexEdit->setFocus(); else if (index == 1) { // GUID ui->guidEdit->setFocus(); ui->guidEdit->setCursorPosition(0); } else if (index == 2) // Text ui->textEdit->setFocus(); } UEFITool-A66/UEFITool/searchdialog.h000066400000000000000000000021701442134156300171650ustar00rootroot00000000000000/* searchdialog.h Copyright (c) 2014, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef SEARCHDIALOG_H #define SEARCHDIALOG_H #include #if QT_VERSION_MAJOR >= 6 #include #else #include #endif #include "ui_searchdialog.h" class SearchDialog : public QDialog { Q_OBJECT public: SearchDialog(QWidget *parent = 0); ~SearchDialog(); Ui::SearchDialog* ui; private slots: void setEditFocus(int index); private: #if QT_VERSION_MAJOR >= 6 QRegularExpressionValidator hexValidator; QRegularExpressionValidator guidValidator; #else QRegExpValidator hexValidator; QRegExpValidator guidValidator; #endif }; #endif // SEARCHDIALOG_H UEFITool-A66/UEFITool/searchdialog.ui000066400000000000000000000213711442134156300173570ustar00rootroot00000000000000 SearchDialog 0 0 400 218 Search false 0 Hex pattern Hex pattern: false Search scope Header and body true Header only Body only GUID GUID: true xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx ........-....-....-....-............ Search scope Header and body false Header only true Body only Text 0 0 Text: 0 0 Search scope Header and body true Header only Body only Text search options Unicode true Case sensitive Qt::Horizontal QDialogButtonBox::Cancel|QDialogButtonBox::Ok HexLineEdit QLineEdit
hexlineedit.h
 tabWidget hexEdit hexScopeFullRadioButton hexScopeHeaderRadioButton hexScopeBodyRadioButton buttonBox textEdit textUnicodeCheckBox textCaseSensitiveCheckBox buttonBox accepted() SearchDialog accept() 182 185 157 194 buttonBox rejected() SearchDialog reject() 182 185 286 194 UEFITool-A66/UEFITool/uefitool.cpp000066400000000000000000001332221442134156300167240ustar00rootroot00000000000000/* uefitool.cpp Copyright (c) 2022, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "../version.h" #include "uefitool.h" #include "ui_uefitool.h" #if QT_VERSION_MAJOR >= 6 #include #endif UEFITool::UEFITool(QWidget *parent) : QMainWindow(parent), ui(new Ui::UEFITool), version(tr(PROGRAM_VERSION)), markingEnabled(true) { clipboard = QApplication::clipboard(); // Create UI ui->setupUi(this); searchDialog = new SearchDialog(this); hexViewDialog = new HexViewDialog(this); goToAddressDialog = new GoToAddressDialog(this); goToBaseDialog = new GoToBaseDialog(this); model = NULL; ffsParser = NULL; ffsFinder = NULL; ffsOps = NULL; ffsBuilder = NULL; ffsReport = NULL; // Connect signals to slots connect(ui->actionOpenImageFile, SIGNAL(triggered()), this, SLOT(openImageFile())); connect(ui->actionOpenImageFileInNewWindow, SIGNAL(triggered()), this, SLOT(openImageFileInNewWindow())); connect(ui->actionSaveImageFile, SIGNAL(triggered()), this, SLOT(saveImageFile())); connect(ui->actionSearch, SIGNAL(triggered()), this, SLOT(search())); connect(ui->actionHexView, SIGNAL(triggered()), this, SLOT(hexView())); connect(ui->actionBodyHexView, SIGNAL(triggered()), this, SLOT(bodyHexView())); connect(ui->actionUncompressedHexView, SIGNAL(triggered()), this, SLOT(uncompressedHexView())); connect(ui->actionExtract, SIGNAL(triggered()), this, SLOT(extractAsIs())); connect(ui->actionExtractBody, SIGNAL(triggered()), this, SLOT(extractBody())); connect(ui->actionExtractBodyUncompressed, SIGNAL(triggered()), this, SLOT(extractBodyUncompressed())); connect(ui->actionInsertInto, SIGNAL(triggered()), this, SLOT(insertInto())); connect(ui->actionInsertBefore, SIGNAL(triggered()), this, SLOT(insertBefore())); connect(ui->actionInsertAfter, SIGNAL(triggered()), this, SLOT(insertAfter())); connect(ui->actionReplace, SIGNAL(triggered()), this, SLOT(replaceAsIs())); connect(ui->actionReplaceBody, SIGNAL(triggered()), this, SLOT(replaceBody())); connect(ui->actionRemove, SIGNAL(triggered()), this, SLOT(remove())); connect(ui->actionRebuild, SIGNAL(triggered()), this, SLOT(rebuild())); connect(ui->actionMessagesCopy, SIGNAL(triggered()), this, SLOT(copyMessage())); connect(ui->actionMessagesCopyAll, SIGNAL(triggered()), this, SLOT(copyAllMessages())); connect(ui->actionMessagesClear, SIGNAL(triggered()), this, SLOT(clearMessages())); connect(ui->actionAbout, SIGNAL(triggered()), this, SLOT(about())); connect(ui->actionAboutQt, SIGNAL(triggered()), this, SLOT(aboutQt())); connect(ui->actionQuit, SIGNAL(triggered()), this, SLOT(exit())); connect(ui->actionGoToData, SIGNAL(triggered()), this, SLOT(goToData())); connect(ui->actionGoToBase, SIGNAL(triggered()), this, SLOT(goToBase())); connect(ui->actionGoToAddress, SIGNAL(triggered()), this, SLOT(goToAddress())); connect(ui->actionLoadGuidDatabase, SIGNAL(triggered()), this, SLOT(loadGuidDatabase())); connect(ui->actionUnloadGuidDatabase, SIGNAL(triggered()), this, SLOT(unloadGuidDatabase())); connect(ui->actionLoadDefaultGuidDatabase, SIGNAL(triggered()), this, SLOT(loadDefaultGuidDatabase())); connect(ui->actionExportDiscoveredGuids, SIGNAL(triggered()), this, SLOT(exportDiscoveredGuids())); connect(ui->actionGenerateReport, SIGNAL(triggered()), this, SLOT(generateReport())); connect(ui->actionToggleBootGuardMarking, SIGNAL(toggled(bool)), this, SLOT(toggleBootGuardMarking(bool))); connect(QCoreApplication::instance(), SIGNAL(aboutToQuit()), this, SLOT(writeSettings())); // Enable Drag-and-Drop actions setAcceptDrops(true); // Disable Builder tab, doesn't work right now ui->messagesTabWidget->setTabEnabled(TAB_BUILDER, false); // Set current directory currentDir = "."; // Load built-in GUID database initGuidDatabase(":/guids.csv"); // Initialize non-persistent data init(); // Read stored settings readSettings(); } UEFITool::~UEFITool() { delete ffsBuilder; delete ffsOps; delete ffsFinder; delete ffsParser; delete ffsReport; delete model; delete hexViewDialog; delete searchDialog; delete ui; } void UEFITool::init() { // Clear components ui->parserMessagesListWidget->clear(); ui->finderMessagesListWidget->clear(); ui->fitTableWidget->clear(); ui->fitTableWidget->setRowCount(0); ui->fitTableWidget->setColumnCount(0); ui->infoEdit->clear(); ui->securityEdit->clear(); ui->messagesTabWidget->setTabEnabled(TAB_FIT, false); ui->messagesTabWidget->setTabEnabled(TAB_SECURITY, false); ui->messagesTabWidget->setTabEnabled(TAB_SEARCH, false); ui->messagesTabWidget->setTabEnabled(TAB_BUILDER, false); // Set window title setWindowTitle(tr("UEFITool %1").arg(version)); // Disable menus ui->actionSearch->setEnabled(false); ui->actionGoToBase->setEnabled(false); ui->actionGoToAddress->setEnabled(false); ui->menuCapsuleActions->setEnabled(false); ui->menuImageActions->setEnabled(false); ui->menuRegionActions->setEnabled(false); ui->menuPaddingActions->setEnabled(false); ui->menuVolumeActions->setEnabled(false); ui->menuFileActions->setEnabled(false); ui->menuSectionActions->setEnabled(false); ui->menuStoreActions->setEnabled(false); ui->menuEntryActions->setEnabled(false); ui->menuMessageActions->setEnabled(false); // Create new model ... delete model; model = new TreeModel(); ui->structureTreeView->setModel(model); // ... and ffsParser delete ffsParser; ffsParser = new FfsParser(model); // Set proper marking state model->setMarkingEnabled(markingEnabled); ui->actionToggleBootGuardMarking->setChecked(markingEnabled); // Connect signals to slots connect(ui->structureTreeView->selectionModel(), SIGNAL(currentChanged(const QModelIndex &, const QModelIndex &)), this, SLOT(populateUi(const QModelIndex &))); connect(ui->structureTreeView->selectionModel(), SIGNAL(selectionChanged(const QItemSelection &, const QItemSelection &)), this, SLOT(populateUi(const QItemSelection &))); connect(ui->parserMessagesListWidget, SIGNAL(itemDoubleClicked(QListWidgetItem*)), this, SLOT(scrollTreeView(QListWidgetItem*))); connect(ui->parserMessagesListWidget, SIGNAL(itemEntered(QListWidgetItem*)), this, SLOT(enableMessagesCopyActions(QListWidgetItem*))); connect(ui->finderMessagesListWidget, SIGNAL(itemDoubleClicked(QListWidgetItem*)), this, SLOT(scrollTreeView(QListWidgetItem*))); connect(ui->finderMessagesListWidget, SIGNAL(itemEntered(QListWidgetItem*)), this, SLOT(enableMessagesCopyActions(QListWidgetItem*))); connect(ui->builderMessagesListWidget, SIGNAL(itemDoubleClicked(QListWidgetItem*)), this, SLOT(scrollTreeView(QListWidgetItem*))); connect(ui->builderMessagesListWidget, SIGNAL(itemEntered(QListWidgetItem*)), this, SLOT(enableMessagesCopyActions(QListWidgetItem*))); connect(ui->fitTableWidget, SIGNAL(itemDoubleClicked(QTableWidgetItem*)), this, SLOT(scrollTreeView(QTableWidgetItem*))); connect(ui->messagesTabWidget, SIGNAL(currentChanged(int)), this, SLOT(currentTabChanged(int))); // Allow enter/return pressing to scroll tree view ui->parserMessagesListWidget->installEventFilter(this); ui->finderMessagesListWidget->installEventFilter(this); ui->builderMessagesListWidget->installEventFilter(this); // Detect and set UI light or dark mode #if QT_VERSION_MAJOR >= 6 #if QT_VERSION_MINOR < 5 #if defined Q_OS_WIN QSettings settings("HKEY_CURRENT_USER\\Software\\Microsoft\\Windows\\CurrentVersion\\Themes\\Personalize", QSettings::NativeFormat); if (settings.value("AppsUseLightTheme", 1).toInt() == 0) { model->setMarkingDarkMode(true); QApplication::setStyle(QStyleFactory::create("Fusion")); QApplication::setPalette(QApplication::style()->standardPalette()); } #else const QPalette palette = QApplication::palette(); const QColor& color = palette.color(QPalette::Active, QPalette::Base); if (color.lightness() < 127) { // TreeView has dark background model->setMarkingDarkMode(true); } #endif // defined Q_OS_WIN #else // QT_VERSION_MINOR >= 5 // Qt 6.5.0 added proper support for dark UI mode, including detection and notification on mode change // It also supposed to work in all OSes, but still requires changing the default style on Windows from Vista to Fusion auto styleHints = QGuiApplication::styleHints(); model->setMarkingDarkMode(styleHints->colorScheme() == Qt::ColorScheme::Dark); connect(styleHints, SIGNAL(colorSchemeChanged(Qt::ColorScheme)), this, SLOT(updateUiForNewColorScheme(Qt::ColorScheme))); #if defined Q_OS_WIN QApplication::setStyle(QStyleFactory::create("Fusion")); QApplication::setPalette(QApplication::style()->standardPalette()); #endif #endif // QT_VERSION_MINOR #endif // QT_VERSION_MAJOR } #if QT_VERSION_MAJOR >= 6 && QT_VERSION_MINOR >= 5 void UEFITool::updateUiForNewColorScheme(Qt::ColorScheme scheme) { model->setMarkingDarkMode(scheme == Qt::ColorScheme::Dark); QApplication::setPalette(QApplication::style()->standardPalette()); } #endif void UEFITool::populateUi(const QItemSelection &selected) { if (selected.isEmpty()) { return; } populateUi(selected.indexes().at(0)); } void UEFITool::populateUi(const QModelIndex ¤t) { // Check sanity if (!current.isValid()) { return; } UINT8 type = model->type(current); UINT8 subtype = model->subtype(current); // Set info text ui->infoEdit->setPlainText(model->info(current)); // Enable menus ui->menuCapsuleActions->setEnabled(type == Types::Capsule); ui->menuImageActions->setEnabled(type == Types::Image); ui->menuRegionActions->setEnabled(type == Types::Region); ui->menuPaddingActions->setEnabled(type == Types::Padding); ui->menuVolumeActions->setEnabled(type == Types::Volume); ui->menuFileActions->setEnabled(type == Types::File); ui->menuSectionActions->setEnabled(type == Types::Section); ui->menuEntryActions->setEnabled(type == Types::Microcode || type == Types::SlicData || type == Types::NvarEntry || type == Types::VssEntry || type == Types::FsysEntry || type == Types::EvsaEntry || type == Types::FlashMapEntry || type == Types::IfwiHeader || type == Types::IfwiPartition || type == Types::FptPartition || type == Types::FptEntry || type == Types::BpdtPartition || type == Types::BpdtEntry || type == Types::CpdPartition || type == Types::CpdEntry || type == Types::CpdExtension || type == Types::CpdSpiEntry || type == Types::StartupApDataEntry ); ui->menuStoreActions->setEnabled(type == Types::VssStore || type == Types::Vss2Store || type == Types::FdcStore || type == Types::FsysStore || type == Types::EvsaStore || type == Types::FtwStore || type == Types::FlashMapStore || type == Types::NvarGuidStore || type == Types::CmdbStore || type == Types::FptStore || type == Types::BpdtStore || type == Types::CpdStore ); // Enable actions ui->actionHexView->setDisabled(model->hasEmptyHeader(current) && model->hasEmptyBody(current) && model->hasEmptyTail(current)); ui->actionBodyHexView->setDisabled(model->hasEmptyBody(current)); ui->actionUncompressedHexView->setDisabled(model->hasEmptyUncompressedData(current)); ui->actionExtract->setDisabled(model->hasEmptyHeader(current) && model->hasEmptyBody(current) && model->hasEmptyTail(current)); ui->actionGoToData->setEnabled(type == Types::NvarEntry && subtype == Subtypes::LinkNvarEntry); // Disable rebuild for now //ui->actionRebuild->setDisabled(type == Types::Region && subtype == Subtypes::DescriptorRegion); //ui->actionReplace->setDisabled(type == Types::Region && subtype == Subtypes::DescriptorRegion); //ui->actionRebuild->setEnabled(type == Types::Volume || type == Types::File || type == Types::Section); ui->actionExtractBody->setDisabled(model->hasEmptyBody(current)); ui->actionExtractBodyUncompressed->setDisabled(model->hasEmptyUncompressedData(current)); //ui->actionRemove->setEnabled(type == Types::Volume || type == Types::File || type == Types::Section); //ui->actionInsertInto->setEnabled((type == Types::Volume && subtype != Subtypes::UnknownVolume) || // (type == Types::File && subtype != EFI_FV_FILETYPE_ALL && subtype != EFI_FV_FILETYPE_RAW && subtype != EFI_FV_FILETYPE_PAD) || // (type == Types::Section && (subtype == EFI_SECTION_COMPRESSION || subtype == EFI_SECTION_GUID_DEFINED || subtype == EFI_SECTION_DISPOSABLE))); //ui->actionInsertBefore->setEnabled(type == Types::File || type == Types::Section); //ui->actionInsertAfter->setEnabled(type == Types::File || type == Types::Section); //ui->actionReplace->setEnabled((type == Types::Region && subtype != Subtypes::DescriptorRegion) || type == Types::Volume || type == Types::File || type == Types::Section); //ui->actionReplaceBody->setEnabled(type == Types::Volume || type == Types::File || type == Types::Section); ui->menuMessageActions->setEnabled(false); } void UEFITool::search() { if (searchDialog->exec() != QDialog::Accepted) return; QModelIndex rootIndex = model->index(0, 0); int index = searchDialog->ui->tabWidget->currentIndex(); if (index == 0) { // Hex pattern searchDialog->ui->hexEdit->setFocus(); QByteArray pattern = searchDialog->ui->hexEdit->text().toLatin1().replace(" ", ""); if (pattern.isEmpty()) return; UINT8 mode; if (searchDialog->ui->hexScopeHeaderRadioButton->isChecked()) mode = SEARCH_MODE_HEADER; else if (searchDialog->ui->hexScopeBodyRadioButton->isChecked()) mode = SEARCH_MODE_BODY; else mode = SEARCH_MODE_ALL; ffsFinder->findHexPattern(rootIndex, pattern, mode); showFinderMessages(); } else if (index == 1) { // GUID searchDialog->ui->guidEdit->setFocus(); searchDialog->ui->guidEdit->setCursorPosition(0); QByteArray pattern = searchDialog->ui->guidEdit->text().toLatin1(); if (pattern.isEmpty()) return; UINT8 mode; if (searchDialog->ui->guidScopeHeaderRadioButton->isChecked()) mode = SEARCH_MODE_HEADER; else if (searchDialog->ui->guidScopeBodyRadioButton->isChecked()) mode = SEARCH_MODE_BODY; else mode = SEARCH_MODE_ALL; ffsFinder->findGuidPattern(rootIndex, pattern, mode); showFinderMessages(); } else if (index == 2) { // Text string searchDialog->ui->textEdit->setFocus(); QString pattern = searchDialog->ui->textEdit->text(); if (pattern.isEmpty()) return; UINT8 mode; if (searchDialog->ui->textScopeHeaderRadioButton->isChecked()) mode = SEARCH_MODE_HEADER; else if (searchDialog->ui->textScopeBodyRadioButton->isChecked()) mode = SEARCH_MODE_BODY; else mode = SEARCH_MODE_ALL; ffsFinder->findTextPattern(rootIndex, pattern, mode, searchDialog->ui->textUnicodeCheckBox->isChecked(), (Qt::CaseSensitivity) searchDialog->ui->textCaseSensitiveCheckBox->isChecked()); showFinderMessages(); } } void UEFITool::hexView() { QModelIndex index = ui->structureTreeView->selectionModel()->currentIndex(); if (!index.isValid()) return; hexViewDialog->setItem(index, HexViewDialog::HexViewType::fullHexView); hexViewDialog->exec(); } void UEFITool::bodyHexView() { QModelIndex index = ui->structureTreeView->selectionModel()->currentIndex(); if (!index.isValid()) return; hexViewDialog->setItem(index, HexViewDialog::HexViewType::bodyHexView); hexViewDialog->exec(); } void UEFITool::uncompressedHexView() { QModelIndex index = ui->structureTreeView->selectionModel()->currentIndex(); if (!index.isValid()) return; hexViewDialog->setItem(index, HexViewDialog::HexViewType::uncompressedHexView); hexViewDialog->exec(); } void UEFITool::goToBase() { goToBaseDialog->ui->hexSpinBox->setFocus(); goToBaseDialog->ui->hexSpinBox->selectAll(); if (goToBaseDialog->exec() != QDialog::Accepted) return; UINT32 offset = (UINT32)goToBaseDialog->ui->hexSpinBox->value(); QModelIndex index = model->findByBase(offset); if (index.isValid()) { ui->structureTreeView->scrollTo(index, QAbstractItemView::PositionAtCenter); ui->structureTreeView->selectionModel()->select(index, QItemSelectionModel::Select | QItemSelectionModel::Rows | QItemSelectionModel::Clear); } } void UEFITool::goToAddress() { goToAddressDialog->ui->hexSpinBox->setFocus(); goToAddressDialog->ui->hexSpinBox->selectAll(); if (goToAddressDialog->exec() != QDialog::Accepted) return; UINT32 address = (UINT32)goToAddressDialog->ui->hexSpinBox->value(); QModelIndex index = model->findByBase(address - (UINT32)ffsParser->getAddressDiff()); if (index.isValid()) { ui->structureTreeView->scrollTo(index, QAbstractItemView::PositionAtCenter); ui->structureTreeView->selectionModel()->select(index, QItemSelectionModel::Select | QItemSelectionModel::Rows | QItemSelectionModel::Clear); } } void UEFITool::goToData() { QModelIndex index = ui->structureTreeView->selectionModel()->currentIndex(); if (!index.isValid() || model->type(index) != Types::NvarEntry || model->subtype(index) != Subtypes::LinkNvarEntry) return; // Get parent QModelIndex parent = model->parent(index); for (int i = index.row(); i < model->rowCount(parent); i++) { if (model->hasEmptyParsingData(index)) continue; UByteArray rdata = model->parsingData(index); const NVAR_ENTRY_PARSING_DATA* pdata = (const NVAR_ENTRY_PARSING_DATA*)rdata.constData(); UINT32 offset = model->offset(index); if (pdata->next == 0xFFFFFF) { ui->structureTreeView->scrollTo(index, QAbstractItemView::PositionAtCenter); ui->structureTreeView->selectionModel()->select(index, QItemSelectionModel::Select | QItemSelectionModel::Rows | QItemSelectionModel::Clear); } for (int j = i + 1; j < model->rowCount(parent); j++) { QModelIndex currentIndex = parent.model()->index(j, 0, parent); if (model->hasEmptyParsingData(currentIndex)) continue; if (model->offset(currentIndex) == offset + pdata->next) { index = currentIndex; break; } } } } void UEFITool::insert(const UINT8 mode) { U_UNUSED_PARAMETER(mode); } void UEFITool::insertInto() { insert(CREATE_MODE_PREPEND); } void UEFITool::insertBefore() { insert(CREATE_MODE_BEFORE); } void UEFITool::insertAfter() { insert(CREATE_MODE_AFTER); } void UEFITool::replaceAsIs() { replace(REPLACE_MODE_AS_IS); } void UEFITool::replaceBody() { replace(REPLACE_MODE_BODY); } void UEFITool::replace(const UINT8 mode) { U_UNUSED_PARAMETER(mode); } void UEFITool::extractAsIs() { extract(EXTRACT_MODE_AS_IS); } void UEFITool::extractBody() { extract(EXTRACT_MODE_BODY); } void UEFITool::extractBodyUncompressed() { extract(EXTRACT_MODE_BODY_UNCOMPRESSED); } void UEFITool::extract(const UINT8 mode) { QModelIndex index = ui->structureTreeView->selectionModel()->currentIndex(); if (!index.isValid()) return; QByteArray extracted; QString name; USTATUS result = ffsOps->extract(index, name, extracted, mode); if (result) { QMessageBox::critical(this, tr("Extraction failed"), errorCodeToUString(result), QMessageBox::Ok); return; } name = QDir::toNativeSeparators(currentDir + QDir::separator() + name); //ui->statusBar->showMessage(name); UINT8 type = model->type(index); UINT8 subtype = model->subtype(index); QString path; if (mode == EXTRACT_MODE_AS_IS) { switch (type) { case Types::Capsule: path = QFileDialog::getSaveFileName(this, tr("Save capsule to file"), name + ".cap", tr("Capsule files (*.cap *.bin);;All files (*)")); break; case Types::Image: path = QFileDialog::getSaveFileName(this, tr("Save image to file"), name + ".rom", tr("Image files (*.rom *.bin);;All files (*)")); break; case Types::Region: path = QFileDialog::getSaveFileName(this, tr("Save region to file"), name + ".rgn", tr("Region files (*.rgn *.bin);;All files (*)")); break; case Types::Padding: path = QFileDialog::getSaveFileName(this, tr("Save padding to file"), name + ".pad", tr("Padding files (*.pad *.bin);;All files (*)")); break; case Types::Volume: path = QFileDialog::getSaveFileName(this, tr("Save volume to file"), name + ".vol", tr("Volume files (*.vol *.bin);;All files (*)")); break; case Types::File: path = QFileDialog::getSaveFileName(this, tr("Save FFS file to file"), name + ".ffs", tr("FFS files (*.ffs *.bin);;All files (*)")); break; case Types::Section: path = QFileDialog::getSaveFileName(this, tr("Save section to file"), name + ".sct", tr("Section files (*.sct *.bin);;All files (*)")); break; default: path = QFileDialog::getSaveFileName(this, tr("Save object to file"), name + ".bin", tr("Binary files (*.bin);;All files (*)")); } } else if (mode == EXTRACT_MODE_BODY || mode == EXTRACT_MODE_BODY_UNCOMPRESSED) { switch (type) { case Types::Capsule: path = QFileDialog::getSaveFileName(this, tr("Save capsule body to image file"), name + ".rom", tr("Image files (*.rom *.bin);;All files (*)")); break; case Types::Volume: path = QFileDialog::getSaveFileName(this, tr("Save volume body to file"), name + ".vbd", tr("Volume body files (*.vbd *.bin);;All files (*)")); break; case Types::File: path = QFileDialog::getSaveFileName(this, tr("Save FFS file body to file"), name + ".fbd", tr("FFS file body files (*.fbd *.bin);;All files (*)")); break; case Types::Section: if (subtype == EFI_SECTION_FIRMWARE_VOLUME_IMAGE) { path = QFileDialog::getSaveFileName(this, tr("Save section body to volume file"), name + ".vol", tr("Volume files (*.vol *.bin);;All files (*)")); break; } else if (subtype == EFI_SECTION_PE32 || subtype == EFI_SECTION_TE || subtype == EFI_SECTION_PIC) { path = QFileDialog::getSaveFileName(this, tr("Save section body to EFI executable file"), name + ".efi", tr("EFI executable files (*.efi *.bin);;All files (*)")); break; } default: path = QFileDialog::getSaveFileName(this, tr("Save object body to file"), name + ".bin", tr("Binary files (*.bin);;All files (*)")); } } else path = QFileDialog::getSaveFileName(this, tr("Save object to file"), name + ".bin", tr("Binary files (*.bin);;All files (*)")); if (path.trimmed().isEmpty()) return; QFile outputFile; outputFile.setFileName(path); if (!outputFile.open(QFile::WriteOnly)) { QMessageBox::critical(this, tr("Extraction failed"), tr("Can't open output file for rewriting"), QMessageBox::Ok); return; } outputFile.resize(0); outputFile.write(extracted); outputFile.close(); } void UEFITool::rebuild() { } void UEFITool::remove() { } void UEFITool::about() { QMessageBox::about(this, tr("About UEFITool"), tr("UEFITool %1.

" "Copyright (c) 2013-2023, Nikolaj Schlej.

" "Program icon made by Alexander Zhidkov.

" "GUI uses QHexView made by Antonio Davide.
" "Qt-less engine uses Bstrlib made by Paul Hsieh.
" "Engine uses Tiano compression code made by TianoCore developers.
" "Engine uses LZMA compression code made by Igor Pavlov.
" "Engine uses zlib compression code made by Mark Adler.
" "Engine uses LibTomCrypt hashing code made by LibTom developers.
" "Engine uses KaitaiStruct runtime made by Kaitai team.

" "The program is dedicated to RevoGirl. Rest in peace, young genius.

" "The program and the accompanying materials are licensed and made available under the terms and conditions of the BSD-2-Clause License.
" "The full text of the license may be found at OpenSource.org.

" "THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN \"AS IS\" BASIS, " "WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, " "EITHER EXPRESS OR IMPLIED." "").arg(version) ); } void UEFITool::aboutQt() { QMessageBox::aboutQt(this, tr("About Qt")); } void UEFITool::exit() { QCoreApplication::exit(0); } void UEFITool::saveImageFile() { } void UEFITool::openImageFile() { QString path = QFileDialog::getOpenFileName(this, tr("Open BIOS image file"), currentDir, tr("BIOS image files (*.rom *.bin *.cap *scap *.bio *.fd *.wph *.dec);;All files (*)")); openImageFile(path); } void UEFITool::openImageFileInNewWindow() { QString path = QFileDialog::getOpenFileName(this, tr("Open BIOS image file in new window"), currentDir, tr("BIOS image files (*.rom *.bin *.cap *scap *.bio *.fd *.wph *.dec);;All files (*)")); if (path.trimmed().isEmpty()) return; QProcess::startDetached(currentProgramPath, QStringList(path)); } void UEFITool::openImageFile(QString path) { if (path.trimmed().isEmpty()) return; QFileInfo fileInfo = QFileInfo(path); if (!fileInfo.exists()) { ui->statusBar->showMessage(tr("Please select existing file")); return; } QFile inputFile; inputFile.setFileName(path); if (!inputFile.open(QFile::ReadOnly)) { QMessageBox::critical(this, tr("Image parsing failed"), tr("Can't open input file for reading"), QMessageBox::Ok); return; } QByteArray buffer = inputFile.readAll(); inputFile.close(); init(); setWindowTitle(tr("UEFITool %1 - %2").arg(version).arg(fileInfo.fileName())); // Parse the image USTATUS result = ffsParser->parse(buffer); showParserMessages(); if (result) { QMessageBox::critical(this, tr("Image parsing failed"), errorCodeToUString(result), QMessageBox::Ok); return; } else { ui->statusBar->showMessage(tr("Opened: %1").arg(fileInfo.fileName())); } ffsParser->outputInfo(); // Enable or disable FIT tab showFitTable(); // Enable or disable Security tab showSecurityInfo(); // Enable search ... delete ffsFinder; ffsFinder = new FfsFinder(model); ui->actionSearch->setEnabled(true); // ... and other operations delete ffsOps; ffsOps = new FfsOperations(model); // ... and reports delete ffsReport; ffsReport = new FfsReport(model); // Enable goToBase and goToAddress ui->actionGoToBase->setEnabled(true); if (ffsParser->getAddressDiff() <= 0xFFFFFFFFUL) ui->actionGoToAddress->setEnabled(true); // Enable generateReport ui->actionGenerateReport->setEnabled(true); // Enable saving GUIDs ui->actionExportDiscoveredGuids->setEnabled(true); // Set current directory currentDir = fileInfo.absolutePath(); // Set current path currentPath = path; } void UEFITool::enableMessagesCopyActions(QListWidgetItem* item) { ui->menuMessageActions->setEnabled(item != NULL); ui->actionMessagesCopy->setEnabled(item != NULL); ui->actionMessagesCopyAll->setEnabled(item != NULL); ui->actionMessagesClear->setEnabled(item != NULL); } void UEFITool::copyMessage() { clipboard->clear(); if (ui->messagesTabWidget->currentIndex() == TAB_PARSER) // Parser tab clipboard->setText(ui->parserMessagesListWidget->currentItem()->text()); else if (ui->messagesTabWidget->currentIndex() == TAB_SEARCH) // Search tab clipboard->setText(ui->finderMessagesListWidget->currentItem()->text()); else if (ui->messagesTabWidget->currentIndex() == TAB_BUILDER) // Builder tab clipboard->setText(ui->builderMessagesListWidget->currentItem()->text()); } void UEFITool::copyAllMessages() { QString text; clipboard->clear(); if (ui->messagesTabWidget->currentIndex() == TAB_PARSER) { // Parser tab for (INT32 i = 0; i < ui->parserMessagesListWidget->count(); i++) text.append(ui->parserMessagesListWidget->item(i)->text()).append("\n"); clipboard->setText(text); } else if (ui->messagesTabWidget->currentIndex() == TAB_SEARCH) { // Search tab for (INT32 i = 0; i < ui->finderMessagesListWidget->count(); i++) text.append(ui->finderMessagesListWidget->item(i)->text()).append("\n"); clipboard->setText(text); } else if (ui->messagesTabWidget->currentIndex() == TAB_BUILDER) { // Builder tab for (INT32 i = 0; i < ui->builderMessagesListWidget->count(); i++) text.append(ui->builderMessagesListWidget->item(i)->text()).append("\n"); clipboard->setText(text); } } void UEFITool::clearMessages() { if (ui->messagesTabWidget->currentIndex() == TAB_PARSER) { // Parser tab if (ffsParser) ffsParser->clearMessages(); ui->parserMessagesListWidget->clear(); } else if (ui->messagesTabWidget->currentIndex() == TAB_SEARCH) { // Search tab if (ffsFinder) ffsFinder->clearMessages(); ui->finderMessagesListWidget->clear(); } else if (ui->messagesTabWidget->currentIndex() == TAB_BUILDER) { // Builder tab if (ffsBuilder) ffsBuilder->clearMessages(); ui->builderMessagesListWidget->clear(); } ui->menuMessageActions->setEnabled(false); ui->actionMessagesCopy->setEnabled(false); ui->actionMessagesCopyAll->setEnabled(false); ui->actionMessagesClear->setEnabled(false); } void UEFITool::toggleBootGuardMarking(bool enabled) { model->setMarkingEnabled(enabled); markingEnabled = enabled; } // Emit double click signal of QListWidget on enter/return key pressed bool UEFITool::eventFilter(QObject* obj, QEvent* event) { if (event->type() == QEvent::KeyPress) { QKeyEvent* key = static_cast(event); if (key->key() == Qt::Key_Enter || key->key() == Qt::Key_Return) { QListWidget* list = qobject_cast(obj); if (list != NULL && list->currentItem() != NULL) emit list->itemDoubleClicked(list->currentItem()); } } return QObject::eventFilter(obj, event); } void UEFITool::dragEnterEvent(QDragEnterEvent* event) { if (event->mimeData()->hasFormat("text/uri-list")) event->acceptProposedAction(); } void UEFITool::dropEvent(QDropEvent* event) { QString path = event->mimeData()->urls().at(0).toLocalFile(); openImageFile(path); } void UEFITool::showParserMessages() { ui->parserMessagesListWidget->clear(); if (!ffsParser) return; std::vector > messages = ffsParser->getMessages(); for (const auto &msg : messages) { QListWidgetItem* item = new QListWidgetItem(msg.first, NULL, 0); item->setData(Qt::UserRole, QByteArray((const char*)&msg.second, sizeof(msg.second))); ui->parserMessagesListWidget->addItem(item); } ui->messagesTabWidget->setCurrentIndex(TAB_PARSER); ui->parserMessagesListWidget->scrollToBottom(); } void UEFITool::showFinderMessages() { ui->finderMessagesListWidget->clear(); if (!ffsParser) return; std::vector > messages = ffsFinder->getMessages(); for (const auto &msg : messages) { QListWidgetItem* item = new QListWidgetItem(msg.first, NULL, 0); item->setData(Qt::UserRole, QByteArray((const char*)&msg.second, sizeof(msg.second)));; ui->finderMessagesListWidget->addItem(item); } ui->messagesTabWidget->setTabEnabled(TAB_SEARCH, true); ui->messagesTabWidget->setCurrentIndex(TAB_SEARCH); ui->finderMessagesListWidget->scrollToBottom(); } void UEFITool::showBuilderMessages() { ui->builderMessagesListWidget->clear(); if (!ffsBuilder) return; std::vector > messages = ffsBuilder->getMessages(); for (const auto &msg : messages) { QListWidgetItem* item = new QListWidgetItem(msg.first, NULL, 0); item->setData(Qt::UserRole, QByteArray((const char*)&msg.second, sizeof(msg.second))); ui->builderMessagesListWidget->addItem(item); } ui->messagesTabWidget->setTabEnabled(TAB_BUILDER, true); ui->messagesTabWidget->setCurrentIndex(TAB_BUILDER); ui->builderMessagesListWidget->scrollToBottom(); } void UEFITool::scrollTreeView(QListWidgetItem* item) { QByteArray second = item->data(Qt::UserRole).toByteArray(); QModelIndex *index = (QModelIndex *)second.data(); if (index && index->isValid()) { ui->structureTreeView->scrollTo(*index, QAbstractItemView::PositionAtCenter); ui->structureTreeView->selectionModel()->select(*index, QItemSelectionModel::Select | QItemSelectionModel::Rows | QItemSelectionModel::Clear); } } void UEFITool::scrollTreeView(QTableWidgetItem* item) { QByteArray second = item->data(Qt::UserRole).toByteArray(); QModelIndex *index = (QModelIndex *)second.data(); if (index && index->isValid()) { ui->structureTreeView->scrollTo(*index, QAbstractItemView::PositionAtCenter); ui->structureTreeView->selectionModel()->select(*index, QItemSelectionModel::Select | QItemSelectionModel::Rows | QItemSelectionModel::Clear); } } void UEFITool::contextMenuEvent(QContextMenuEvent* event) { // The checks involving underMouse do not work well enough on macOS, and result in right-click sometimes // not showing any context menu at all. Most likely it is a bug in Qt, which does not affect other systems. // For this reason we reimplement this manually. if (ui->parserMessagesListWidget->rect().contains(ui->parserMessagesListWidget->mapFromGlobal(event->globalPos())) || ui->finderMessagesListWidget->rect().contains(ui->finderMessagesListWidget->mapFromGlobal(event->globalPos())) || ui->builderMessagesListWidget->rect().contains(ui->builderMessagesListWidget->mapFromGlobal(event->globalPos()))) { ui->menuMessageActions->exec(event->globalPos()); return; } if (!ui->structureTreeView->rect().contains(ui->structureTreeView->mapFromGlobal(event->globalPos()))) return; QPoint pt = event->pos(); QModelIndex index = ui->structureTreeView->indexAt(ui->structureTreeView->viewport()->mapFrom(this, pt)); if (!index.isValid()) { return; } switch (model->type(index)) { case Types::Capsule: ui->menuCapsuleActions->exec(event->globalPos()); break; case Types::Image: ui->menuImageActions->exec(event->globalPos()); break; case Types::Region: ui->menuRegionActions->exec(event->globalPos()); break; case Types::Padding: ui->menuPaddingActions->exec(event->globalPos()); break; case Types::Volume: ui->menuVolumeActions->exec(event->globalPos()); break; case Types::File: ui->menuFileActions->exec(event->globalPos()); break; case Types::Section: ui->menuSectionActions->exec(event->globalPos()); break; case Types::VssStore: case Types::Vss2Store: case Types::FdcStore: case Types::FsysStore: case Types::EvsaStore: case Types::FtwStore: case Types::FlashMapStore: case Types::NvarGuidStore: case Types::CmdbStore: case Types::FptStore: case Types::CpdStore: case Types::BpdtStore: ui->menuStoreActions->exec(event->globalPos()); break; case Types::FreeSpace: break; // No menu needed for FreeSpace item default: ui->menuEntryActions->exec(event->globalPos()); break; } } void UEFITool::readSettings() { QSettings settings(this); restoreGeometry(settings.value("mainWindow/geometry").toByteArray()); restoreState(settings.value("mainWindow/windowState").toByteArray()); QList horList, vertList; horList.append(settings.value("mainWindow/treeWidth", 600).toInt()); horList.append(settings.value("mainWindow/infoWidth", 180).toInt()); vertList.append(settings.value("mainWindow/treeHeight", 400).toInt()); vertList.append(settings.value("mainWindow/messageHeight", 180).toInt()); ui->infoSplitter->setSizes(horList); ui->messagesSplitter->setSizes(vertList); ui->structureTreeView->setColumnWidth(0, settings.value("tree/columnWidth0", ui->structureTreeView->columnWidth(0)).toInt()); ui->structureTreeView->setColumnWidth(1, settings.value("tree/columnWidth1", ui->structureTreeView->columnWidth(1)).toInt()); ui->structureTreeView->setColumnWidth(2, settings.value("tree/columnWidth2", ui->structureTreeView->columnWidth(2)).toInt()); ui->structureTreeView->setColumnWidth(3, settings.value("tree/columnWidth3", ui->structureTreeView->columnWidth(3)).toInt()); markingEnabled = settings.value("tree/markingEnabled", true).toBool(); ui->actionToggleBootGuardMarking->setChecked(markingEnabled); // Set monospace font QString fontName; int fontSize; #if defined Q_OS_OSX fontName = settings.value("mainWindow/fontName", QString("Menlo")).toString(); fontSize = settings.value("mainWindow/fontSize", 10).toInt(); #elif defined Q_OS_WIN fontName = settings.value("mainWindow/fontName", QString("Consolas")).toString(); fontSize = settings.value("mainWindow/fontSize", 9).toInt(); #else fontName = settings.value("mainWindow/fontName", QString("Courier New")).toString(); fontSize = settings.value("mainWindow/fontSize", 10).toInt(); #endif currentFont = QFont(fontName, fontSize); currentFont.setStyleHint(QFont::Monospace); QApplication::setFont(currentFont); } void UEFITool::writeSettings() { QSettings settings(this); settings.setValue("mainWindow/geometry", saveGeometry()); settings.setValue("mainWindow/windowState", saveState()); settings.setValue("mainWindow/treeWidth", ui->structureGroupBox->width()); settings.setValue("mainWindow/infoWidth", ui->infoGroupBox->width()); settings.setValue("mainWindow/treeHeight", ui->structureGroupBox->height()); settings.setValue("mainWindow/messageHeight", ui->messagesTabWidget->height()); settings.setValue("tree/columnWidth0", ui->structureTreeView->columnWidth(0)); settings.setValue("tree/columnWidth1", ui->structureTreeView->columnWidth(1)); settings.setValue("tree/columnWidth2", ui->structureTreeView->columnWidth(2)); settings.setValue("tree/columnWidth3", ui->structureTreeView->columnWidth(3)); settings.setValue("tree/markingEnabled", markingEnabled); settings.setValue("mainWindow/fontName", currentFont.family()); settings.setValue("mainWindow/fontSize", currentFont.pointSize()); } void UEFITool::showFitTable() { std::vector, UModelIndex> > fitTable = ffsParser->getFitTable(); if (fitTable.empty()) { // Disable FIT tab ui->messagesTabWidget->setTabEnabled(TAB_FIT, false); return; } // Enable FIT tab ui->messagesTabWidget->setTabEnabled(TAB_FIT, true); // Set up the FIT table ui->fitTableWidget->clear(); ui->fitTableWidget->setRowCount((int)fitTable.size()); ui->fitTableWidget->setColumnCount(6); ui->fitTableWidget->setHorizontalHeaderLabels(QStringList() << tr("Address") << tr("Size") << tr("Version") << tr("Checksum") << tr("Type") << tr("Information")); ui->fitTableWidget->setEditTriggers(QAbstractItemView::NoEditTriggers); ui->fitTableWidget->setSelectionBehavior(QAbstractItemView::SelectRows); ui->fitTableWidget->setSelectionMode(QAbstractItemView::SingleSelection); ui->fitTableWidget->horizontalHeader()->setStretchLastSection(true); // Add all data to the table widget for (size_t i = 0; i < fitTable.size(); i++) { for (UINT8 j = 0; j < 6; j++) { QTableWidgetItem* item = new QTableWidgetItem(fitTable[i].first[j]); item->setData(Qt::UserRole, QByteArray((const char*)&fitTable[i].second, sizeof(fitTable[i].second))); ui->fitTableWidget->setItem((int)i, j, item); } } ui->fitTableWidget->resizeColumnsToContents(); ui->fitTableWidget->resizeRowsToContents(); ui->messagesTabWidget->setCurrentIndex(TAB_FIT); } void UEFITool::showSecurityInfo() { // Get security info UString secInfo = ffsParser->getSecurityInfo(); if (secInfo.isEmpty()) { ui->messagesTabWidget->setTabEnabled(TAB_SECURITY, false); return; } ui->messagesTabWidget->setTabEnabled(TAB_SECURITY, true); ui->securityEdit->setPlainText(secInfo); ui->messagesTabWidget->setCurrentIndex(TAB_SECURITY); } void UEFITool::currentTabChanged(int index) { U_UNUSED_PARAMETER(index); ui->menuMessageActions->setEnabled(false); ui->actionMessagesCopy->setEnabled(false); ui->actionMessagesCopyAll->setEnabled(false); ui->actionMessagesClear->setEnabled(false); } void UEFITool::loadGuidDatabase() { QString path = QFileDialog::getOpenFileName(this, tr("Select GUID database file to load"), currentDir, tr("Comma-separated values files (*.csv);;All files (*)")); if (!path.isEmpty()) { initGuidDatabase(path); if (!currentPath.isEmpty() && QMessageBox::Yes == QMessageBox::information(this, tr("New GUID database loaded"), tr("Apply new GUID database on the opened file?\nUnsaved changes and tree position will be lost."), QMessageBox::Yes, QMessageBox::No)) openImageFile(currentPath); } } void UEFITool::unloadGuidDatabase() { initGuidDatabase(); if (!currentPath.isEmpty() && QMessageBox::Yes == QMessageBox::information(this, tr("GUID database unloaded"), tr("Apply changes on the opened file?\nUnsaved changes and tree position will be lost."), QMessageBox::Yes, QMessageBox::No)) openImageFile(currentPath); } void UEFITool::loadDefaultGuidDatabase() { initGuidDatabase(":/guids.csv"); if (!currentPath.isEmpty() && QMessageBox::Yes == QMessageBox::information(this, tr("Default GUID database loaded"), tr("Apply default GUID database on the opened file?\nUnsaved changes and tree position will be lost."), QMessageBox::Yes, QMessageBox::No)) openImageFile(currentPath); } void UEFITool::exportDiscoveredGuids() { GuidDatabase db = guidDatabaseFromTreeRecursive(model, model->index(0, 0)); if (!db.empty()) { QString path = QFileDialog::getSaveFileName(this, tr("Save parsed GUIDs to database"), currentPath + ".guids.csv", tr("Comma-separated values files (*.csv);;All files (*)")); if (!path.isEmpty()) guidDatabaseExportToFile(path, db); } } void UEFITool::generateReport() { QString path = QFileDialog::getSaveFileName(this, tr("Save report to text file"), currentPath + ".report.txt", tr("Text files (*.txt);;All files (*)")); if (!path.isEmpty()) { std::vector report = ffsReport->generate(); if (report.size()) { QFile file; file.setFileName(path); if (file.open(QFile::Text | QFile::WriteOnly)) { for (size_t i = 0; i < report.size(); i++) { file.write(report[i].toLatin1().append('\n')); } file.close(); } } } } UEFITool-A66/UEFITool/uefitool.desktop000066400000000000000000000003701442134156300176100ustar00rootroot00000000000000[Desktop Entry] Type=Application Version=1.0 Name=UEFITool Comment=UEFI firmware image viewer and editor Exec=uefitool Icon=uefitool Terminal=false Categories=Development;System;Utility;HardwareSettings;Electronics;Engineering; Keywords=BIOS;UEFI; UEFITool-A66/UEFITool/uefitool.entitlements000066400000000000000000000011541442134156300206530ustar00rootroot00000000000000 com.apple.security.app-sandbox com.apple.security.assets.movies.read-write com.apple.security.assets.music.read-write com.apple.security.assets.pictures.read-write com.apple.security.files.downloads.read-write com.apple.security.files.user-selected.read-write com.apple.security.print UEFITool-A66/UEFITool/uefitool.h000066400000000000000000000101241442134156300163640ustar00rootroot00000000000000/* uefitool.h Copyright (c) 2014, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef UEFITOOL_H #define UEFITOOL_H #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "../common/basetypes.h" #include "../common/utility.h" #include "../common/ffs.h" #include "../common/ffsparser.h" #include "../common/ffsops.h" #include "../common/ffsbuilder.h" #include "../common/ffsreport.h" #include "../common/guiddatabase.h" #include "searchdialog.h" #include "gotobasedialog.h" #include "gotoaddressdialog.h" #include "hexviewdialog.h" #include "ffsfinder.h" namespace Ui { class UEFITool; } class UEFITool : public QMainWindow { Q_OBJECT public: explicit UEFITool(QWidget *parent = 0); ~UEFITool(); void openImageFile(QString path); void setProgramPath(QString path) { currentProgramPath = path; } private slots: void init(); void populateUi(const QItemSelection &selected); void populateUi(const QModelIndex ¤t); void scrollTreeView(QListWidgetItem* item); // For messages void scrollTreeView(QTableWidgetItem* item); // For FIT table entries void openImageFile(); void openImageFileInNewWindow(); void saveImageFile(); void search(); void goToBase(); void goToAddress(); void hexView(); void bodyHexView(); void uncompressedHexView(); void goToData(); void extract(const UINT8 mode); void extractAsIs(); void extractBody(); void extractBodyUncompressed(); void insert(const UINT8 mode); void insertInto(); void insertBefore(); void insertAfter(); void replace(const UINT8 mode); void replaceAsIs(); void replaceBody(); void rebuild(); void remove(); void copyMessage(); void copyAllMessages(); void enableMessagesCopyActions(QListWidgetItem* item); void clearMessages(); void toggleBootGuardMarking(bool enabled); void about(); void aboutQt(); void exit(); void writeSettings(); void loadGuidDatabase(); void unloadGuidDatabase(); void loadDefaultGuidDatabase(); void exportDiscoveredGuids(); void generateReport(); void currentTabChanged(int index); #if QT_VERSION_MAJOR >= 6 && QT_VERSION_MINOR >= 5 void updateUiForNewColorScheme(Qt::ColorScheme scheme); #endif private: Ui::UEFITool* ui; TreeModel* model; FfsParser* ffsParser; FfsFinder* ffsFinder; FfsReport* ffsReport; FfsOperations* ffsOps; FfsBuilder* ffsBuilder; SearchDialog* searchDialog; HexViewDialog* hexViewDialog; GoToBaseDialog* goToBaseDialog; GoToAddressDialog* goToAddressDialog; QClipboard* clipboard; QString currentDir; QString currentPath; QString currentProgramPath; QFont currentFont; const QString version; bool markingEnabled; bool eventFilter(QObject* obj, QEvent* event); void dragEnterEvent(QDragEnterEvent* event); void dropEvent(QDropEvent* event); void contextMenuEvent(QContextMenuEvent* event); void readSettings(); void showParserMessages(); void showFinderMessages(); void showFitTable(); void showSecurityInfo(); void showBuilderMessages(); enum { TAB_PARSER, TAB_FIT, TAB_SECURITY, TAB_SEARCH, TAB_BUILDER }; }; #endif // UEFITOOL_H UEFITool-A66/UEFITool/uefitool.pro000066400000000000000000000110701442134156300167360ustar00rootroot00000000000000QT += core gui widgets TARGET = UEFITool TEMPLATE = app CONFIG += c++11 DEFINES += "U_ENABLE_FIT_PARSING_SUPPORT" DEFINES += "U_ENABLE_NVRAM_PARSING_SUPPORT" DEFINES += "U_ENABLE_ME_PARSING_SUPPORT" DEFINES += "U_ENABLE_GUID_DATABASE_SUPPORT" HEADERS += uefitool.h \ searchdialog.h \ hexviewdialog.h \ gotobasedialog.h \ gotoaddressdialog.h \ hexlineedit.h \ ffsfinder.h \ hexspinbox.h \ ../common/fitparser.h \ ../common/guiddatabase.h \ ../common/nvram.h \ ../common/nvramparser.h \ ../common/meparser.h \ ../common/ffsops.h \ ../common/basetypes.h \ ../common/descriptor.h \ ../common/gbe.h \ ../common/me.h \ ../common/ffs.h \ ../common/peimage.h \ ../common/types.h \ ../common/utility.h \ ../common/parsingdata.h \ ../common/ffsbuilder.h \ ../common/ffsparser.h \ ../common/ffsreport.h \ ../common/treeitem.h \ ../common/intel_fit.h \ ../common/intel_microcode.h \ ../common/treemodel.h \ ../common/LZMA/LzmaCompress.h \ ../common/LZMA/LzmaDecompress.h \ ../common/Tiano/EfiTianoDecompress.h \ ../common/Tiano/EfiTianoCompress.h \ ../common/ustring.h \ ../common/ubytearray.h \ ../common/umemstream.h \ ../common/digest/sha1.h \ ../common/digest/sha2.h \ ../common/digest/sm3.h \ ../common/generated/ami_nvar.h \ ../common/generated/intel_acbp_v1.h \ ../common/generated/intel_acbp_v2.h \ ../common/generated/intel_keym_v1.h \ ../common/generated/intel_keym_v2.h \ ../common/generated/intel_acm.h \ ../common/kaitai/kaitaistream.h \ ../common/kaitai/kaitaistruct.h \ ../common/kaitai/exceptions.h \ ../common/zlib/zlib.h \ ../common/zlib/crc32.h \ ../version.h \ qhexview5/model/buffer/qhexbuffer.h \ qhexview5/model/buffer/qdevicebuffer.h \ qhexview5/model/buffer/qmemorybuffer.h \ qhexview5/model/commands/hexcommand.h \ qhexview5/model/commands/insertcommand.h \ qhexview5/model/commands/removecommand.h \ qhexview5/model/commands/replacecommand.h \ qhexview5/model/qhexcursor.h \ qhexview5/model/qhexdelegate.h \ qhexview5/model/qhexdocument.h \ qhexview5/model/qhexmetadata.h \ qhexview5/model/qhexoptions.h \ qhexview5/model/qhexutils.h \ qhexview5/qhexview.h SOURCES += uefitool_main.cpp \ uefitool.cpp \ searchdialog.cpp \ hexviewdialog.cpp \ hexlineedit.cpp \ ffsfinder.cpp \ hexspinbox.cpp \ ../common/fitparser.cpp \ ../common/guiddatabase.cpp \ ../common/nvram.cpp \ ../common/nvramparser.cpp \ ../common/meparser.cpp \ ../common/ffsops.cpp \ ../common/types.cpp \ ../common/descriptor.cpp \ ../common/ffs.cpp \ ../common/peimage.cpp \ ../common/utility.cpp \ ../common/ffsbuilder.cpp \ ../common/ffsparser.cpp \ ../common/ffsreport.cpp \ ../common/treeitem.cpp \ ../common/treemodel.cpp \ ../common/LZMA/LzmaCompress.c \ ../common/LZMA/LzmaDecompress.c \ ../common/LZMA/SDK/C/CpuArch.c \ ../common/LZMA/SDK/C/Bra.c \ ../common/LZMA/SDK/C/Bra86.c \ ../common/LZMA/SDK/C/LzFind.c \ ../common/LZMA/SDK/C/LzmaDec.c \ ../common/LZMA/SDK/C/LzmaEnc.c \ ../common/Tiano/EfiTianoDecompress.c \ ../common/Tiano/EfiTianoCompress.c \ ../common/Tiano/EfiTianoCompressLegacy.c \ ../common/ustring.cpp \ ../common/digest/sha1.c \ ../common/digest/sha256.c \ ../common/digest/sha512.c \ ../common/digest/sm3.c \ ../common/generated/ami_nvar.cpp \ ../common/generated/intel_acbp_v1.cpp \ ../common/generated/intel_acbp_v2.cpp \ ../common/generated/intel_keym_v1.cpp \ ../common/generated/intel_keym_v2.cpp \ ../common/generated/intel_acm.cpp \ ../common/kaitai/kaitaistream.cpp \ ../common/zlib/adler32.c \ ../common/zlib/compress.c \ ../common/zlib/crc32.c \ ../common/zlib/deflate.c \ ../common/zlib/gzclose.c \ ../common/zlib/gzlib.c \ ../common/zlib/gzread.c \ ../common/zlib/gzwrite.c \ ../common/zlib/inflate.c \ ../common/zlib/infback.c \ ../common/zlib/inftrees.c \ ../common/zlib/inffast.c \ ../common/zlib/trees.c \ ../common/zlib/uncompr.c \ ../common/zlib/zutil.c \ qhexview5/model/buffer/qhexbuffer.cpp \ qhexview5/model/buffer/qdevicebuffer.cpp \ qhexview5/model/buffer/qmemorybuffer.cpp \ qhexview5/model/commands/hexcommand.cpp \ qhexview5/model/commands/insertcommand.cpp \ qhexview5/model/commands/removecommand.cpp \ qhexview5/model/commands/replacecommand.cpp \ qhexview5/model/qhexcursor.cpp \ qhexview5/model/qhexdelegate.cpp \ qhexview5/model/qhexdocument.cpp \ qhexview5/model/qhexmetadata.cpp \ qhexview5/model/qhexutils.cpp \ qhexview5/qhexview.cpp FORMS += uefitool.ui \ searchdialog.ui \ hexviewdialog.ui \ gotobasedialog.ui \ gotoaddressdialog.ui RESOURCES += uefitool.qrc RC_FILE = uefitool.rc ICON = icons/uefitool.icns QMAKE_BUNDLE_DATA += ICONFILE QMAKE_INFO_PLIST = Info.plist UEFITool-A66/UEFITool/uefitool.qrc000066400000000000000000000001701442134156300167220ustar00rootroot00000000000000 ../common/guids.csv UEFITool-A66/UEFITool/uefitool.rc000066400000000000000000000000601442134156300165370ustar00rootroot00000000000000IDI_ICON1 ICON DISCARDABLE "icons/uefitool.ico" UEFITool-A66/UEFITool/uefitool.ui000066400000000000000000000664431442134156300165710ustar00rootroot00000000000000 UEFITool 0 0 851 586 0 0 true UEFITool 0 0 0 5 5 5 5 Qt::Vertical Qt::Horizontal Structure 0 5 5 5 5 0 0 10 false true 200 true Information 0 5 5 5 5 false false true true 0 Parser 0 5 5 5 5 true FIT 0 5 5 5 5 Qt::Horizontal true Security 0 5 5 5 5 false false true Search 0 5 5 5 5 true Builder 0 5 5 5 5 true 0 0 851 31 &File H&elp &Action false &Capsule false &Image false &Region false &Padding false &Volume false &File false &Section false &Messages false &Entry false S&tore &View false Insert &after... Insert an object from file after selected object Ctrl+Shift+I false Insert b&efore... Insert object from file before selected object Ctrl+Alt+I false Rep&lace as is... Replace selected object as is with an object from file Ctrl+R false E&xtract as is... Extract selected object as is to file Ctrl+E false Extract &body... Extract body of selected object to file Ctrl+Shift+E false Re&move Remove selected object Ctrl+Del &Open image file... Open image file Ctrl+O false Insert &into... Insert object from file into selected object Ctrl+I false &Save image file... Save modified image file Ctrl+S false &Rebuild Rebuild selected object Ctrl+Space &About UEFITool F1 QAction::AboutRole About &Qt Shift+F1 QAction::AboutQtRole &Quit Alt+X QAction::QuitRole false Searc&h... Ctrl+F false Clea&r Clear messages Ctrl+Backspace false Replace b&ody... Replace body of selected object with a data from file Ctrl+Shift+R false &Copy Ctrl+Shift+C false Copy &all Ctrl+Alt+C O&pen image file in new window... Ctrl+Shift+O false Extract body &uncompressed... Uncompress and extract body of selected object to file Ctrl+Alt+E false Go &to data Ctrl+T false Hex &view... Ctrl+D false &Select item at base... Ctrl+G false Body hex vie&w... Ctrl+Shift+D false Un&compressed hex view... Ctrl+Alt+D Load &GUID database... Ctrl+Alt+G false Select item at &address... Ctrl+Shift+G true true BootGuard &markings Ctrl+Shift+B false Generate &report... Generate report Ctrl+Alt+R &Unload GUID database Ctrl+Alt+U Load &default GUID database Ctrl+Alt+D false &Export discovered GUIDs... Ctrl+Alt+E UEFITool-A66/UEFITool/uefitool_main.cpp000066400000000000000000000031041442134156300177230ustar00rootroot00000000000000/* uefitool_main.cpp Copyright (c) 2022, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include #include #include "uefitool.h" class UEFIToolApplication : public QApplication { UEFITool* tool; public: UEFIToolApplication(int &argc, char **argv) : QApplication(argc, argv) { setOrganizationName("CodeRush"); setOrganizationDomain("coderush.me"); setApplicationName("UEFITool"); tool = new UEFITool(); } virtual ~UEFIToolApplication() { delete tool; } virtual bool event(QEvent *event) { if (event->type() == QEvent::FileOpen) { QFileOpenEvent *openEvent = static_cast(event); tool->openImageFile(openEvent->file()); } return QApplication::event(event); } int startup() { tool->setProgramPath(arguments().at(0)); if (arguments().length() > 1) tool->openImageFile(arguments().at(1)); tool->show(); return exec(); } }; int main(int argc, char *argv[]) { UEFIToolApplication a(argc, argv); return a.startup(); } UEFITool-A66/appstream/000077500000000000000000000000001442134156300147755ustar00rootroot00000000000000UEFITool-A66/appstream/UEFITool.png000066400000000000000000015310041442134156300170750ustar00rootroot00000000000000‰PNG  IHDRð~¬³b€IDATxÚìÝu|Gà÷$îÄ ‚»»‚»kq¯|Å)--P¬XK‹»µP¼ÅÝ]ƒ; "„ñ»ûþHî8—Ø]à}ú»ænvvwvo’}of"""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""úd ÌÝ€Ï Ï7åU2s7àsÁ@)ëx‰ˆˆˆˆˆˆˆˆˆˆˆT1ìˆO†ñe/|z0œâ9 """""""""""²4ŸuÀ÷¹…WŸÛñ}*>›PïS´,ñØ,±MDDDDDDDDDDDDÆ°ÄÍÛ”eŸZ d®ãùÔÎ#Qf™+Tûd¼O!xÊ­cøΑ9åVÈ–§Ã¼¼Jåt»óêy!"""""""""""Êkr:lËsa^^ ªrª½yí<}ªr*pË3A^^ ®²«­–xÌ–Ø&"""""""""""ú}æêÉf‰óÛY\ˆgiá¥wÆnË”}æÖ¹¶´÷”ˆˆˆˆˆˆˆˆˆˆˆr^n…P¦ìÇغÙÙöO"ȳ”°Ç‚;CÛ1f?–èeVvv†êXÂwfò,!DÊl²£í‚L.ËŽåDDDDDDDDDDDDy]V9YÖÍŽöåä¾3ÍÜ!SföŸÕ6g&´ËJЗÛÇGDDDDDDDDDDDdªì¬2Ìåd˜—™õÍâ™3,ÊíðÎÔp.3a^v´›嶜˜ÛΘu²«<·Û£Ì™ºßìfÓ”òì ߌÝ<"""""""""""ÊmÆUÙÕKNfÂúÙ智^®‡xæ‹r#¼Ëj@—•°-'çÕ#"""""""""""Ê)Ù=_]VBÁìø²r¬Ù±LËíÀÈ\á uŒÙ¶)Ûá\yDDDDDDDDDDD”Ûrkn;c7cÚ’Ùí|R!^n†@9Þe&¸ËŽÐ.3ÛÌL}vDDDDDDDDDDD”UÙ1T¦1õM}ÛÌŽvgwýLÉ­P(·Ã»¬„l9Øe¦Ç_vÏûGDDDDDDDDDDDŸ®œš.³!Yvz9æf}“YZ€g)ÁÀ„e†¶ol¼‘¹;D¦©ÁžÌÈmå… /Ïx¦l?'ûÌwƬo)Ãkfu"""""""""""ÊÛÌ1\f4™‰Ï]ß”6dÇ9ɱ //x†z¹™¼å溦l;+ç(»×%"""""""""""Ë•Ð(3Ãešºž©\N¯kì1˜ZÏÔº&ÉÉP''†Í4¥—¡Ì”ðMÛr¡ ûÊl‰ˆˆˆˆˆˆˆˆˆˆˆrZf‡Í4f=©–2C›¶ç™icVzã™u8ͼàÞe&¸ÓÚ ŒX73m2昳«}žŒ —2S'³=ßdZ¾ê['³A^v„xŸu€—á)Á¾ÐÎØÀ.3sç™ZטeDDDDDDDDDDDôy3v9C妄fÆzÆ„y¦yæñòL€gŽžw¦†kêËŒ­«o¦´ÃÐq‹é’™p);zÛ¸É ¬c¨ç^fÛaê¹1KO²åäüvêu•úö­«Ž¶rS‡ÔÌLˆ—缜ïL ¼L îô-ê¨oh_г-}u9GœˆˆˆˆˆˆˆˆˆˆˆôÉ®yïÔ—)בêXϘpM½Lª£Ž±ClšòÜÔsgj£ˆ³kC¹,3á¡àHÚŒ þ„0­úŽ!§zâåÄvˆˆˆˆˆˆˆˆˆˆˆÈ| …DÆæÆ]Ú¶+P«§/<“fÔ—iÙž ;AÉëÊ—i[G^O ö\ÛWõýä)¹ÝÏÔåÆ Kilx§/T3&¸Bw{Œ#ÏØa69WY­ŸÙuˆˆˆˆˆˆˆˆˆˆˆ(wd&x2uSæ¼3å«®õéq'Õ±®¶ºYé‰gêpšY]n´Ü ð2;t¦©á± ?¸3ê u,Ó×cÎIV{à1”#""""""""""úüd5¸34‡œz™¡¹ì”‡È4%¬3&È35ÌÓv<ú†÷4å¼»Ì$–àR2«áz8§o™¶íul[_ôµUßy1âeµ§#}:LífjxgìœvÆôȓꨯ-ÈS_G۲̆x™/Ox9=t¦±á¡0øÐéšÓNÛ6õõÄËLï>@À—Õsʈˆˆˆˆˆˆˆˆˆèó‘•PÉÔ^i¦ô’Ó×óNW'Õ±-©mAÇ6uƒ1˳ãœfŠ%x9ÑóÎÐ2}=ëôÕÑ·}½ð„Zêè:/†ŽÛØsNDDDDDDDDDDDdlï;CÃe*Õ²i+ÓæIõÔ‘Q0ÜådO¼ðÄYÝ€™ ™Ê è”ë ¡;Ü“?Ôƒ<¡–}ꥧ­w´lOW=cŽÝÐy5åœ3$""""""""""²\¦AÆN2#ëèZGŠù‚®^vúz×É š™H¡ÜÉëÈËjÛTnƒ¶ã¨=WþªNW¹>ÊÛÏ9Ý/'æ½ËŽðN¨åµ|¡Ú~…ÐÔébS_<}½ï {fÞc—‘åËîáeÖ34ò2}½ïÔêCbJul_í½ñôµÁÐüxúŽ=;æóøx™ajx§üZß|wÚÂ;cƒ;mõzÊôµI_/BmçAß9r"""""""""""úüÆé«khJ!4Ã2åõ¤Ð ÎÔ:R¹€HéµP©ž|ê½î´•©“zO<õã0Ô;Ïlr²^fzß3ï1!¼®¶žvê¡œª]5­‘lZ©ÕÑÖëÎPpg¨íÐQטsšaƒ?"""""""""""Ë•ChÖ©?×Õ[ÍÐ\wêu¥Ðì§Ü{N @€¥õ¥jutõÄ“êد¶~ÚÚ®í¸9g†Î{žígì|nÊ˳Þ‰ ;„ƒƒƒóñãÇ»U®\¹­µµuI@à`¦óCDDDDDDDDDDDôI“ÉdRRRþ»yóæ¾&MšüûáÇX¨Î‘§<ž¼§œª·”Cd¦ÐÁÁÁåÍ›7Å}H¨’””œM§„ˆˆˆˆˆˆˆˆˆˆˆˆŒakk'ûëùóçôáǨ)RS}ˆLmÏÃCiª?‡Ž2]CnBKCe&fuZh âÔ—›Z¦+ØËjx'`sìرn ˆˆˆˆˆˆˆˆˆˆÌ#))qª;v¬k¤g8rò|GÛH‹ÚFfÔ–#Ai™¶ç¦–)/Ë®sFí0³ëš2§¶¯ê¬­ž®7BeXLh¾yB¥eò2ÛȨ¨ƒ±qü³ûä‘ñœ^y¸»·„=ëä½èÔ{âI¡{¸M@÷›ÊËŒJÓP¯:™‰åzåD«ä”T3""""""""""""Ê‘ÙØ@w‡.¡Úsm½îÔië0¯aâò‘Ûž)½öL9ÑúÞ0]Ãh ÞýR”š’*™UFf#ÏpÔsS2!ÀøŽaêË`ByŽgóöLm¼©'F×¼wºÂ<ô‡wB©LïEYÆråÿgÇ©R4Z`–𖈈ˆˆˆˆˆˆˆˆˆÈ¢dd6ÊYŽsùp™òåòeÊÃ\*çFê¯íA@K¹¦…B¦Ö×+»}òA—.ÀÊÊ *TDÉÒ¥õÎc÷áÃœ;sÕjT‡‡‡gΟi"""""""""""¢¼IžßH¡ÖéCh*çBÊõd:Ê T_ÎÔÞU¹:Œ¦¹†Ð”¨òs}Cfª×Ó×óÎÐ2¡ÒC¹û¥Ñ .Œ—Á/pêøq;r{víÂógÏ •JµÖOJJÂÁû‘ðîîf<åDDDD”ÛRRRЬy Œ7ÁÜM±¸cZ³f š5o˜ûˆ,Ò¶mÛ0`à ´lÕÍš·ÀÜyóqöì9´ïÐ —.]6wóò¼Ìü,Û¾};:uîŒÇŸ˜»ùDDDD¹N"‘àÞ½{F׿wï$Ifw§œá(wÎ25 wÓ•Q¹ÔÛN›Üîgˆ®±EOÛsõ7YWKãOšXŒ/zôĪËñîÝ;<þ çÏžE>'¸;ÙfìU©ÈÉ©R\¹t I‰IhÛ¾½¹Ï/Q–Mž<.^Äæáá©ýÃI[¶nÅš5bʔɨ (2t?~¬sÛË—-E±bÅŒ®{óöm,_¶\¥¼zµêèÜ¥Æ7î†ì°¡CСCsŸVÀ¥K—1qÒ$ØØØ`ÕŠ(àS@k½3fâÔéÓØ¿o/¬­­UÖÕ% NL:Å܇h1"#"±mÇ\½váo#œ’ŒÂ aÅŠeZë¿Ä/Ó~ÁË—¯ô^ûÚ$''cèðáI¥X¹bD¢ôÑ_þ¢£ß™»)DDDDHKKžY䆇bÔèïЯo_ôíÛGoÝõë7àïõë1Þ\”+W.3»SÎp”{Õ)“÷ÄSîy§ë9´¼VïM—«=ì É®wÕ˜q@MM/õ¥¡ÊËuõ²Sþ åBd2=õó÷G‹-°Ï.Ä'&ãÆõk(âå‚VEÅx•€Ld…4‘ î?{ƒà'¨ggg½Ãl}.Úëø`“‹‹‹IuÛ·m‹R%JbîÜyxõú&Mü•*WÆûè÷ë:yЦM•ò¢E‹šûthHNNÆÜùóðûìÙ&¯[ªTI”*UZ£¼XÑ"æ>,‹qíÚ5Lýe:$’4ÔªU õagk‡„„­õŸ8ùó 555Sûû{ýz¼ ~‰9ü®¢Îž=‹é3fB$¡ZõjÈç–ïÞEáÅ‹`lÚ´uÌà]¹‚iÓ¦A&jÔ¨:µë ú}4NŸ>ƒ ~ƸŸ~DãƤ^ãÆÇõë7P° ?êÂÚÚ wîÜŶmÛpýÚu,Z´@#TSŽï¾ƒðˆT¬P-[µDjj*.^¸ˆ%K—âù‹=j¤¢~RR~üé'ÀÔ)Sç9§ŽE$á»ïFãÿ‚Õþ…aC‡dûûpöìYÀŒ3T®…Ò¥K£R¥J(^¼¸Y®ÏÝ×_}‰V­Z¢˜þÛADDDŸ—´´4L™:0eòä\ ñÊ•+‡~}ûâïõë@gˆ'ïúõí›ÙðP ïÔ¿*/—j)WÏ£”—©ïÐÚi[OãB@]Û4‰±ïhn¦Núº0ªÕÕãN['ÔSf2‡wÁhdØ"8úè R’“qòBJ[…wÑF €7¯žãÞíÛ(]²(J°‡•$IO€!}憚muË—/·|nxõújT¯[;;8;9i¬wëö-$&%™´os)XÐ7oÞ¡ÇѲE “Ö­U³–ÁOB~ÎÞ¼}‹©¿L‡—·'¦O›†üÞÞ:릥¥aÉ’%Ø·ÿ5jG{ìݷߤýEFFbçÎ]¨Zµ**T¨ (_µf -\ èu*÷òÕ+ô÷7Û9*S¦ š7o^={ÀÝÝ]QÞ­KW|;t(þúk­"ô …hØ Z4oŽF©|`ñ·Ù³qìØqœ:}Í›5Ó¹?OOO4lØ(Uª¤¢|ð A:t<ˆž={(Þ«={öâÉ“§tíÒùóçÏÖ÷áÝ»hØØØh¹"‘%J”ÈÉKà³cÊŸèÖÖÖ ïˆˆˆ>7oÝ„T"CÕªULZïúõŠ¨\©rŽµ--- Ó§ÏÀåËA€éÓgàçŸ'äJˆ'ÿ{SWˆ§ÞeñoSåOÞIµ”Ƀ2! ÷ÈÓöUy9ÕûNÛoœ÷e)ChjÔÐx¤êëé^SÔ)—‰2òçÆ“É`÷ø2\¯ïAª§/ª7jŽ'içñôñc„GEcóµ·\-©k\¼õö®^(^®„¶€X §Ô爵*žxDDDDæá£GغõÜ¿wñ>ÀÓÓèÙ£;ìíí³\ß}z÷Ʋå˱rÅJÔªY nn®¹rÂÃÃqààA\¸p¡¡¡J¥ð÷óG»öíжMkƒë1?î'¬]»—ƒ‚ _´oÛVgoJ@€]»vãÀÁƒ ½½ªV­†ÁƒÂK-¼Èj·nÙ‚ä”dLž4Qox'oWhX„Ý»cþ‚&ŸÓƒ!55íÚµU”Éd2„¿ GáB…4Â;ZûȈH¬ß¸AAAˆ‰‰§—'Ô¯^={ÁÖÖFQïÊÕ«?~ÌŸ‡Ø˜XlܼÁÁ/a%¡r•ÊÊ”)£(Ûµ{7vïÚ…ýû÷cï¾ý …«‹ *VªˆAš4ì.Y† .`÷ž}˜8a<êÕ«gÔ:çÎô3Ñ¡}Û ðäáÝÅË—1yÒDÀ´3-"ÄËÆðÐÌp”{½Éƒ;)4Ã:@{Þ$ öÀS^nö¡4s;À36µÒvõ ½©+ÐS.SŸèÈD<»'Wávj¤nžx_£<íÜ(Àûèh¼{÷O^†bßÁ#ðöñC\\,š·h 'g¤ mᘠ§”Lj·)iÊn‰ˆˆˆ(={3f΄ƒ½=êÂÙÉŸ<Á–-[páüyÌ_0NŽŽ™®o*+kkŒ>S™†ÅKcâÏ?çÊy¸pá"6oÙŠ€:uиQCÄÇÀÁDZ`ÁØX[£Y³¦·Œ±?þÈd „L*ÁÙsç±hñ„„†áÛÿ}£±ÎºuëñäécÖ«‡ÚµkáÑ£G8qâ<|€U+VÀÆÆ&ÛÚxñÒeT©\þ~é!YRR2D"!¬¬¬4êŠD"Ìš9Baúç%©ÉçôÔéS°µ³CZµe^Þ^ {ƒØ¸88;9éÝÆ›7o0jÔh$§$£Q£ÆðpwÇ“§O°eËV\¿~óæÎÕhÿÆM›qûöm r¥Jxùò%Ξ=‡›7oañ¢…(P 2#55VVV*ï‰Îº)éóq8:dþ{!%cØRnj理ÄD¼zù 5kÕÔ˜ÏÁÁ%J”À£G ‘H4–çıT­RŽŽ8}æL¶xùó@·nÝ°aýD½{‡‘#G ÑÃïáÇX»vœœÑ A}¸¸¸ª, º‚þ݆reË ]Û¶ ÅÙ³gñèñc´nÕ Û·oGÝ€T®\÷îÝÇá#Gðìùs,]²Xq¼ÇŽÇÍ[·T¼ /A("%%7nÜ@:µËnܸ¨Vµ*€ô?À,X;{{4iÒ.ÎN¸sç.NŸ>ƒ§OžaÍꕪ½wºŽK"‘à§qãpÿþÔ¯_M›6ATT$Ž?K/aÉâÅ:çUöæ Æ|?•+WD‡ísç/য়Æcò¤I*Ç£KRR2fÌœ‰»wî"  jÖ¨‡áèÑc¸}ë6Ö¬YmÔµFDDD–ã믾FøÛL›1Ó¨OÞÕ©U _õuŽ´I9¼SnÓÄ ãÍâÉŸgSx|Ìu$JÏÕàN^O×wÊeêu3Óû.WçÈË­Ï”yît­g¨×ò¨>„¦®eB˜ÐO˜§Ë»`õ amG"ÍÉb•«TAÈ«W8îRSS77o u›¶ððôTô¶“ m .·Ä«ˆƒ6®¹tú‰ˆˆˆ,˲eË4ÊÜò¹« ‡—[ââã1wÞ\88:bŲ¥ððøØKbïÞ½X¸h1V®\…1ßÎTýÌHMME£† XgÎœÅÅ‹—Œº ¤Ïù§QÞ¼E ƒÃ¾5kÖuTz½bØðá8zì¨Q^dd$Ê”)Ÿ'LP_}ûö÷ß~‹;v e‹æ(RDu>¾à—ÁX½j¥JØðÇœ98|ø®^»†ºÙÒÆ—/_!** M›4Á°yËV¼}ûP²d |ùå`OÉÊ!3¢£ßãåËW¨R¥²F ѳ{wÌ7ß}÷¾ùæT¯VMç(‹-Fjj*V,_®rÜ[¶þƒ5kÖàÐáÃh׶­Ê:W¯]Ãâ… Q¢ÄÇyÒvìÜ…eË–aÕê5˜4ÑôP8,, Ïž=G@@€Q#Šœ;wP«vÍL?©D‚K—/ÁÍÍ¥K•¼ €T*EüÚ{VùùúâÞ½{ˆŒŠÒ;‡`v‹P(DÅ qáâE„‡‡kô͌ʕ+vïÞƒ÷11hѼ¹Ñë.]¶­Z¶ÀСCµ˜·oßƈÃU®—åË–cûÎغu+æÏ›‹²eËHï)úÃ?âÖí[xöüŠ)ª>êöÍ[èÒ©“b/^@ÕqëÖm\º|YñóJ&“áöí»(XÐ_ñ³R(á÷ßfÿ ¿âû«G`ÂÏ„û¢|ùrF׶íÛqçÎ]LŸ6 µj}|oš5k†#GaÍ_âç  ž·çÏŸcÔÈ‘h£Ô‹·ë³g6l8,\ˆZ5kh|ksÿÁ¬Z½J%”Ÿýûï8zô‚‚‚˜å냈ˆˆrX,ÆÏ?OÀôé3 †xÊá]NhºÂ;¨W¯žE„xÙÞéÙòp™ê½ïjϵ͑'ÿªm;@ gìüx9&óf/}ÃgZS_˜§­L½'žÑ=ðl^?„UT$ŽùìSZ1P¾-4j __.\¯^½B\l¬ÖIî¥HÄΰK{…´´4sŸw""""³Ø±s—ÆãØñcZë.Z¼Dã±eëÖlkËÅ‹ÿmÛ´V ã ]»vð÷óÇ©S'‘””œ©ú™!•¦÷ô1|8œ]\°pÑ"$$$µîǵžßÐPƒë:88h¥J•„½½="#¢ŒnÏ=U‚/GGtìœ~³ÿlF¢¬}ûv=…2B»×!ÙÖÆ·áéaݵë×°iÓfthß“'O Aƒö?þ4>4ñÝÒM>Üb©’¥4–µjÕ ßƒèwÑ?~úõ€7áýû÷*õ¢Þ½Ã•«WQ£fMBDFD*ò çÚÕkÛ¯Y³†JxíÛµ…«« .^¼hòß"‰sç̓H$€þý Ö¿qã&Ž?Ž¦M› h‘ÌͶaã&„†„bРAŠðäÇx€öajíìñqq:·›ÝÇR¤hz ýÂÀP¡¹ÁËÛ C† ÑÙûÐÉÑ­Õ† ­™Ñ;´R¥ŠŠðHï)Z³f @XØ€»»; *ˆ;wî(~N…†„"8ø%*T¨€råÊáòåËÉÒïe<ñ11ïQ½Z5•}*\H#¯–FDF}\GAŸ(V´¨Ê÷†§‡'¼¼¼píšæ÷†®óÒªUK•²bE‹"00QQQ¸wÿQÛiÓºµFÚºuëBB ÿ &"""Ë#ñêÔª…i3f*>Ø¥ÌÜáœ<Ä»xù2¦OŸñ)ä†r}Y±¹’¡ef•“¬ÀÄr}Ë•ßùkmCeBm¹zH§ü&ÇP5ŠðC ’Ȭm™¤o&5%î߇‹³ $R ^½z¡PˆsgÏÀÝÞž^JŸê@ ÂJöiiiŠ?lˆˆˆˆ>'G6ºîž={4ÊŠ-ŠÝ»gK[ž={([¦¬Öååʕšï‚bE‹š\?S2~GtuuÅÐoÿ‡Y¿þ†Õ«WcĈWÍÎO-[Î_xD8À5Ÿ›Öå-Z4Gƒ pìøq=zk׭Ö­[0pà tîÔðäñÈd2?~Ç׺hµÐ Ò|Äb1Š+«×®"ìM˜bQCd2æÏ_€›7oaì? P¡‚zë?}ö ¿Lû… ÆÈáÃ3uîŽ=Š 7¢e‹hÙ¢…¢\þw•®¿£22%H¥Ú—çıäÏÚ2"ÄŽ;qÿþ}DDE©ÜH7f) }Þ8m º¹¥‡X‰ÉIËìuô¦Ê©6¶mÝFcŽÂâÅ‹¡`Á‚¸wï^¶Ï¤ÄD€³£î9îlmmжMk´mÓ=ÂüeË–ÁÍÍ6T„ŽMš4Aà ´nC²¨žS;­uÝò¹f´Í¸¢R© .¡Çñíÿ¾18ŒêÓ§O1öÇŸàæš³~ [íÐçÈÑ£˜3g.êÕ«‡Q£Fª,sȘƒ.))Q뺉=Uì5¯©œ:ûô¿õu÷’Ý¿ÿ>|øðñ}psÍ‘ÏОvzÞ㾫V©†;wãæíÛÞExyy¡X±b°¶±Æò+qñÒ%”(Q·nÞ„H$B¥Jë'%%c×îÝ8þ<^½z…„„ƒk;.ù÷F±¢E1`Àë3 ®­­ö¹é\œÓ?H”h\hg£êQÞ£-Äãá¬\µÒ¨ðNN9Ä[¹j%†|;$GÚ¥Þ)vÙâÉó€4hf@2|œøÌiˎԇ΄ŽrmÏu­—ãr3ÀÓÆØ^z†B;mõuõÚSôŒF4¥@q$û”€ÕÓH¸\݉wõ 4*ׯ^A±âÅQ¬XqXY[ãep0Î=ƒäädܺy||P¡bEXYYÁ9å1„’D|€H(Ì–›ZDDDD¹I~;ú}4<<=´ÖùŸ~£Ú1ãCL–LÞÆøøxÇ’^.¿¹mjýì0rÄܹóæÍ›‡åË—Á*þ0¼|9“§LA¾|ùЭk7)Rvvv€I“&½‰D‚äädØبÞ‹K?/êÁ`|ЛÕ6æs˧h£6ŽŽx•Ñ£';„éA«T&5ª~éR¥0iÒ$ ü%>‚F *Η­­ j×®eô¾•Ã"eqק¶ÐOD"Áœ¹sqìØq ::tÐ[ÿá£G?n<Ü=<0û·ßàææjò9Û¿ÿ,\ˆ† à§Çj„Õ^^^ŠD{óVëú!¡¡ …ðòV |ròXRSÓ{§ Eº¿/wíÜaò¹ÈßK‚l ¨r¥Š‰D¸së6Z4kŽû÷ ]»ô9õüýüáãëƒ+AWЧwoܾsåÊ•ƒ­mz/?©TŠú ÷ïßGÓ¦MÐý‹nÈ—/Äb1._RÜì1æ¸äCU&'§˜ô½¡MLL¬Öò÷11 èhøôóï{""¢O™rˆ7õ—ôQ;êäx/·€€Ô®UG1±1êÕ«‡Y3f@(Ê™ßOt…wêsâe1ÄSÎpä9Ž< ƒÒ2]!›z'1cÂå9òáïܹƒ%Jh­sëömˆD",XЄ-›G©Òéó“ݻժUÕX~ÿþ}X[[£P¡B™ªŸÜÝÝñ¿oþ‡?æÌÁÆM›`mc“õªÙ±s$ ~™:UeHK™L†‰‰°¶5~ŸOŸ>U™K îÞMïÙ–•ó’Õ6–,Y"‘×®]GÏž=T–I¥R„†„ìÁd yÀkô:^ó*&gôT,Z¬(®_¿©DbtïË'OŸj”I%<|ðöööðôôÔ»¾T"Á¬_ÅÙ³çðÝèQhÙ²¥ÞúwïÞÄŸ†¯¯~5 ÎΦ÷DÚ±s–-[†-šã»Ñ£µöœ²µµA±¢EqÿÞ}H$•á ðäÉ+VLåJNKlFo[máô§ÈÖÎ¥K—Æ{÷pûÎmH$Ô ¨«X^»fMìÚ½wîÞA|ü•ùï4hÔ°Éà.yÿ¨°K|‚ë|ù2¼#""¢<«i“&°¶¶Æú pÿþ}åÿüó/>>€•òظ8„«];@z¹õŸ@€zyy¡Fõê ÃÆÍ›5Ö‰‹GLÌ{ò7nàáÇ*e»vïÆû÷1¬WOc4eiii˜úË4œ=w?ý8Ö`àuóæ-Œ?… Æï³gg*¼Û²õ,[¶ :tÀ˜ï¾Ó;ìa›Ö­‹·mW)ß´i ’““Ѥi“\=–W¯Óçuôõõ1ù¸óªªU« 6&'Nœ€“£#**ÍW³f-H¥Rlß¾#£îÇ:¤¦¦ÏSéíí­²=‰D‚3gϘ܎6­[C"‘`É’¥HKS3-- oÞ¼Q¼ Åô3päèQí$%&âÀÁƒ*e/_¾Âù éÖ*UÊܧœˆˆˆ,ˆX,Ɣɓ1eòäï,ͽ{÷ô†wr}ûöA¿¾}ñ÷úõY™¦ÀØ|GÛÃÐ6µ•™Ë®rŒ%\]Ɔv#Ðñ0Ü+Ï8B!R½ŠâféN¸±m9¾(!B©ÀûKHvõEŠKHíœàaŒJͬ!H"’$Ø}1>Ë£BM3†Îd€GDDDy‘»»;Æ|7¿ýþFþeÊ”¯¯¤R=|„×!¯QÐß#†Ó¹ h-ïÝ«·Îa9µIMMÅ“'Oð>:põúuTªTɤž0666;öLœ4ßþï[4lØnnnxòä .]¾ ?_?|õåàL×ÏN£GÄ—_}ƒ+W¯ê¬sñÒ%¼{¥Q^´Xq´kÛFçzuj×Á;wñÛ¯¿¡}ûöI¥¸}÷Nž:eôÜr@z/¤ÁÁ:lªW¯©T‚“'O!""½zõ„OBŽìhãÿ¾ù÷îÝÇœ9sqùÒeøúúâéÓg¸zí*|}}Ñ»W¯ìx«… ‚­­ îßW ÒB^¿Æˆ‘£àïçò#Ÿ»;$’4<¸ÿ0ýû§ ?ºw릨?zÔ(Œ5 ÿ½AAWP¾|y$'%áÍ›7¸yë&Mœ¨1„`‰ÅñÃر¨XÞù½ñüù œ?nn®0 ¿ÞvÏ™;.^D~oo\¸p.\Ô¨SºltéÔ Á/‚1á矑’’gg'ÌŸ¯ý{û›¯¿Öù½}èða¬Y³¶¶6ˆyÿ3gÎÒ¨cïà€ÑóáµhÑ'OžÂš5kpëæ-*\OŸ>ÁÍ›·P¢D ´kóñ:Ïcyðà>Äb1Š-†ÏEµªU±~ýœ=w6TéZ©REØÚÙ!(è œœP¢DqŲҥKÃÕÕ‡†¯/ *„·áo±oß¾Lµ£[—.¸qã®\½Š¡f­Z°‰‰[·o£y³føæë¯GÃéÓgp÷î=4oÖLe;åʕßþ‰;·o£h±¢ˆÅ±cÇ#†7j="""ú¼|nÁ\éÒ¥1Þ\”+WÎ`ݾ}û jÕ*(]ºtfw§-¤“—«¥ihú5m£@êë™'Ó±,Weå*3%}˜°¾¾ª­Ž¡^wêCkj«c’¤ädlÜ}ÅË6ÁÃÕñ"-®Éoà ÛÔd Ø8!γŽ^{†kwŸ!î¾ B¡RUá–/Ã;"""ÊÓ7n ü»m;îܹƒGÁÞÎù äÇàAѱcGÅœGÚìÛ@kyÛ¶mM ðöìÛ‡åË–+^Oú ªW«ŽY³f˜t<ÕªUâ… °aÃFœ>s ðôòD—.ѳgO@ÐÔúÙÅËË _}õ%.\¨³ÎãÇñøñcò€:uôx]ºtFJJ >ŒIS¦ÀÞÎÕªUógãСC8}ö¬Qm…˜?oÖ®]‡ãÇ#66¾>¾èÓ»Z·n¥ãÏŽ6º¸¸bñÂø{ÃFœ¿p—._F¾|ùЩSôíÛÙ8o£••*Uª„  +ˆŒˆT\Û¾¾¾èÜ©#nß¹ƒûî#11 666ð÷÷KÿþéÐA1×$xxz`ù²¥Ø²u+.^¸„={ö¼½¼Ñ¾m[•€D®YÓ¦puuömÛpæÜ9ØXÛ Q£F8 ?<<ô½~ÞcðÍÛ·xóVû\s©]:uBxdRRÒ瀻té²ÎmöîÝKç÷vHF¶¤¤dœ:}ZkgggE€'‹1}ÚTlܼ§ÏœÆ­Û·àêêŠÎ:¢ÿþ*½_súXÞEGãéÓgé¡• ÃÌæueJ—†½½=P7 ŽÊ2±XŒêU«âÜùó¨\¥²JøekkƒÙ¿ý†•+WcÍ_!5%¾¾>èо=š7k†Ž»˜Ô¡H„Ó§cÏž}8vüŽ=†ä”däËç†Õª¡AƒúŠºåË—‡½½=jÔ¨¡±Î:ÁÓÓ­]‹ÿÝ(Y¢$z÷é™é!«ˆˆˆˆ>E"‘ȨðNΔºZÈ3å!3•ç¼ÓUµå†æ¼3Øé ù µ_.SA`fæ¨3´®®$Sý«¶T½—œrà&R+*•‰ÕÊDZž‹3BVJËŸ½x¹E×KeRÄ%$!1)YQöþý{EÆd;RË´{¨ž3ÉŒø µçÚäX¾¼2„¦z™1©©®ºBèOYUw(ÀÊÊ ù\]!‘J´VW&ȸ@N‘0=ìc€GDDDDôiã‹Ÿ¡PÈ9‰ˆˆˆˆr–¶ÎZRµ2@w&¤þZ=˜SÞE¡ilrd¨Ë ¶rm]•Ÿë ÖÔ_+Už×NŒc ñqž;qÆk±Ò2ùs‘Òs«ŒeŽÏ^¼üÛlï)-\°€x¤‡v©$Ò2¾ÊŸKÕž§!=Œ“(-“)•K•2-_¡ãµòjÏ¡V®ÌÈ29=žÑóÌiYOÛkc’Tõrõ‡Ú{ç‘ùé]QÛ0.;Rþ ¯Mm_ŽÈéÏ؃ÔWnèĪ/Ó6a! » %œ""""""""""""J§o<@324uš)™“¾ò\=¹ÁPš)0â¹òkžºúÒWmóß™ýM """"""""""""mYŽPíµ¾^x€á°ÎÔlJ×ëaÎÞgÆž(õ2CÃeBÇrõí ÁðŽˆˆˆˆˆˆˆˆˆˆˆÈ©¢hJO¼ÌŒò¨m¹Ùr¤¼0|¤1ažú2CÝ*…ZʉˆˆˆˆˆˆˆˆˆˆˆÈü´®¨^®«ƒ—ò6áE²´Oß™†ÒRcÒV}Ý*‰ˆˆˆˆˆˆˆˆˆˆˆÈüLÍwLÉŒRÓìr;À3&åÌÌ 2%ÌÓöœˆˆˆˆˆˆˆˆˆˆˆˆ,ƒ¾wÚêhûš™ýAÏ6r5OgóöŒi|VBsO?U¬«­ÌÒÌ_°í;tB¯>ý ‘H²´­ý`â¤ÉŠPSÙ“ÇOqṳ́¦¦™ûMö.ú:tìŒúIo½;v¡}‡N8tè 2*§ÏœAdT¤¹!ÛLœ4 í;tÒĮ߸í;tÂÍ[·3µýOñœ‘c‡ÃÔVnjÆu‘Åz&çÔ†MdÊ ÞŒégÌvLV§Nm4oÖT£¼t©Ò[[Lžô3Š)š»ÍQÉÉÉ8|äìííK—.£nÝ€Loïî½û8xè0ÆþðlmmT–µhÙ%K•Ð(Ï | @õjUqåê5¼yóùó{k­·wÿ>XYY¡U«үɓ~V\#DDDDDDDDDDD@gJ¯;y]ŒcJÝ“Óž©Áœ®rSçÅ3´,GºR+Z íÚ¶Õ¹ÜÊÊJïr]RRR •ÊÌl:uqqñ˜0~æÌ‹={÷à%%%C$ÂÊÊÊè}•/WåË•Õ¹\"‘ %%vvvFmÏÔúYÕ¾];\¹z ûöïÇ—ƒi,úì)>|„&ÁÅÅ?¿·Ák"11VVV‹-%oÏyY=f™L†ÄÄDØÛÛ›ûPˆˆˆˆˆˆˆˆˆˆÈt¦ä:Æ.SßžLÇ2cÂ;ùvs,è³´9ðŒíY§\f(Œ3ô&çÚX¨ èÚ­;Ö®]gTý»v£k÷¨Wõê7@ç.Ý°oÿþÜj.`ÏÞ½pttDëV-ѨQ#œ9{111Zë&%%cñ’¥hݶêÕo€€zõѾcgÅñNš2‡ô0]»uG×nÝqüÄIÀÚµëе[w$$$¨l÷îÝ{øúCP¯>4B³­°xñ¤¤¤¨Ô[¶bºvëŽÈÈHŒ?u °A#tîÒ /^ÊñsÕ¸qC8::bï¾ýZçÛ³'ý½kß®¢,èÊUtíÖAW®jœË…‹£E«ÖlÐõêã˯¾ÁÝ;wuÞ¼y‹®ÝºcÛö*ëÎúõWtíÖûP)Ÿ4e*†™ãç!³Œ9f]Ξ=‹®Ýºãêµk˜ýÇ6h„ú £eëvؾ}§¹ˆˆˆˆˆˆˆˆˆˆLc(Ï15Ò·ž1Ër%véÉŽ“ghlÓ\ îä$)^#*êÁºó,†Q·nú÷í±HŒýbÊÔiHø€/¾è–ãí}óæ-®\½†íÛÁÆÆmÛ´ÁÁƒ‡pðàaôèñ…JÝ””üoèPܽsÍ›7CÚµ`cmƒÿþû·îÜ4jØaaopãÆ tìض6é= ‹. ˆŠz‡ÁÁH¤ŠíÞ½s_ Wgü0æ;¸{¸ãôé³Xû÷z<}þóæü®¨…ÁÁ>büüüðãØ‹¿ÿÞ€ïÇþ„mÿnAüùsì|ÙØØ¢Eó¦Ø¾cnܸªU«*½÷:|ž¨]»–¢œ={õTÖ©\¥2~üá{Å뢅‹`ô˜ïqäèQôïÛ7GÏY»ví±}Ç.ìÙ»_%À»pᢢÞa@ÿ~‰Dz·±eë?¸}û6¦N™¤à iÓÆèÜõ ,^¼K—,NOjTɧ’’kkk<|ôqqñ ¬‡«W¯A*•B(âö;HNNBÕsôø•="‘f'ßׯC²tÌú$&$`úuŠáf6l€/zôÂâ¥KЦMë<9¿"Ñg(³yOf†Ì´Èùñr{Íììõ&0²\Ýá^¶ö‰°±¶RyX‰ŸNîС#€~}ú¨6X @‡í;wïegÓ5Èd2ìÛþþ~¨X±"@(¢u«Vøïñ>'Nž†ªV©¢Ù¾üùqåê5œ>sÍš6Éhs~¼|õ2™ îSªo™:oooÀ«×š½ìÞ¾ GJJ òç÷ÎõócH¾|n¨W·.N>W¯^cïþ}°µµEó¦M>î„Ä$ôÍ&Ô5«c×®=¸xé’’’Q3cÈÐZ5j`Ñ’¥¸xé2$‰¢Ü™z̺hëe'/ó¶Àk…ˆˆˆˆˆˆˆˆˆˆ´2¥·¡eyRnϧ,³'ÓØuLí•g15lø{ýz³ìÿðá£HNNBÿ~ý0eòDÇÌÓ!‰°gï^Å:õë#*ê<¤wÛöC*ÆÆÆl‡O(\¨Nž<…÷ïß«,Û¾s NíÚf9G†tÈèm7ÁB<|øÍš6Õ:œ¤66DDD8:lTýš5jB"‘`ùŠ•ððð@á"…µjÖ@rrþüóÏôyZÂXKaê1ë²wïÅЛr{ö ªXðñ‘VÆô¶3e;¦îÛlY’%ôÀËìÁsâ Õ±ÈD¶^½z ÄÎ]»‘˜”„öíÚÁËÓQïÞáÁƒص{/¶ý³%Çö¿gïˆÅb4mÚXër777Ô¬Q—/!<<^^žпŽ=†i3fâuHêÔµµ5þ{ü>z„ï¿ûP®\YÀïsæ¢Q£†°[¡B… ðóóÕº¯!Cþ‡±?ŽÃÿ¾†áÆÀ×ǧÏÅßo@É’%=-M@@<<f¡™ßRRRðìÙs$&%ÂÃÝ ä·ØÐJ.22¯CB`gk??_888dy›‰Ož*èï‚þþæ>4""""""""""Êœ\Íz,‘0ë›ÈÙu²•{úQÞ–ÙÅfH–Þ/»¸l²Ò»ÎR}ŠÇ”xÞ2';Λ[¾|¨Zµ*œÌ}8DDDDDDDDDD”3²;+Àˆ¡,ÍÅÒ¹cÊ Ÿûyûœÿs>v"""""""""¢OHž ìÔåÕxú|o 哈>•xê”Vƒ]$ ä/`îöf»Oñ˜rÃç~Þ>çãÿœˆˆˆˆˆˆˆˆˆ(PÏ|>™wê>Åx†ÇÇ=%"""""""""""úÄ}ÖyÎçàY,xDDDDDDDDDDDDD„‘a€GDDDDDDDDDDDDdAàYxDDDDDDDDDDDDD„‘a€GDDDDDDDDDDDDdAàYxDDDDDDDDDDDDDDlîä5‘‘xü11±psuAÁ‚þððð4w³ˆˆˆˆˆˆˆˆˆ>yQQŒùóC dj2™ GŽŵë×ñî]4Ê—+‹ú›ûÐrÄÝ»÷ð×Úu8 ?Ê—/gîæ‘ à)*êæÌ‹£ÇŽC&“©,ó÷÷êËáááØà.]ºŒ ãÇÃÖÖÆÜMÇâ%K! 0ôÛoÍÝ""""""""¢L›8i‚®\ÅÙÓ'agg—©m,_¹kÖü…òåÊÂÛÛQÞ¤ìÞýزe zõê‰2¥K«,‹ŒŠÄé3gЮ]s7“ˆˆLÄÏHc¾ÿwïÝGŸÞ½Ñ¦M+ässÛ·á¸w÷.öí?€¤¤dEÝ»÷îãà¡ÃûÃà9{b‘}övïÞ‹Z5k`ÉâEænJ¶xóæ :Œ&Mkx¥K•ÆäI?£t©Ò™Ü:™ <#ü÷ø îÞ»&aÔÈáŠrwww”+[_|Ñ-ÓÛ–J¥HJJ‚½½}–Û™[[[…¹÷©¡„„ØÙÙi Y˜˜+++ˆÅ¼Äˆˆˆˆˆˆˆˆ(÷H$¤¤¤hí¡—––†ÈÈH4¨_Oï6’““È`cckÔ>ÓÒÒ ‘¤i­Ÿœœ ±X ‘H¤R.“É””d°'¡¾ã1$~o´kÛVçr™L†„„ØÛÛ=$©®ûDD”½òvÿð\ðóõ3XwÒ”©8tè ÿ€èÚ­;ºvëŽã'N–­X®ÝºãíÛpüøÓ8Ô l€ú ãÕ«×øïñ•ºÊV®Z®Ýº#55U¥<4, 'MFƒFMP¿acÔ©ˆ>ýúãìÙ³€®ÝºãÕ«WxüRÑ–®ÝºãÍ›·€ž½ú`á¢Åû;þºv뎛·n)ÊΞ=‹®ÝºãÚõëX¸h17i†ú c÷ž=€¤¤d,\´-ZµF`ƒF¨W_~õ îÞ¹kî·ˆˆˆˆˆˆˆˆ>Qòûm‘‘‘7~ê6@`ƒFèÜ¥.^¼¤¨·fÍ_èÞ£àÈÑcŠûdwnßQÔ9pà ºvïº P7°!ºtý{÷íÓØç°#ñó¤É¸{ç. Œ:uѱóªËîÝG¿þQ7°êÕÇÄÉSœœ„„„ü2m:êÖoˆÀÐõ‹÷ÏÞ¿3g¡]ûŽ¨S7 ¡ió–˜;w>’““õþùç_üþÇ\Ào³ç(ŽI~¿/èÊUtíÖAW®ªl?22?OšŒÀРQ6hˆñ?ODxx„J=ùýÀ7n`ɲehÔ¤)ê7lŒ¦ÍZàïõÌýÖ}ÒØ=Ê… ùC ààáChѲJ–(®³n£† ö7nÜ@ÇŽ`k“>„fÑÂ…‘QxŒ#G£€O~Œùn4aoo‡˜÷ïñ"8qq±ÛŠŠÄ‹à`H¥REÙ«W¯1pð—HHH@÷/º¡lÙ²HLLÄ­›·pïþâ‹n]ñçÚu„ø¢[WźŽŽ€à—/Q¼x1ý}øð/‚ƒ‘˜¨(‹O/›={`àÀ°·w@‘Â…‘ššŠ!ÆãÞ½{èÔ©#ªV©‚¸Ø8lÜ´ _;«W­@Ù2eÌýVÑ'F~¿møˆQðóóÃc@l\,þþ{¾û¶ý»òçGÕª•aç`‡¹sç£XÑbhÞ¬)À;~À¦-[0wî|T¬XÓ~™ €·ïÀÔ_¦#&&}z÷Vìóõë×~ŒóçÏ£yófèÔ±âââT–¡]›¶èÖ­ .]ÁÁƒ‡`oo‡à/aem…ï¿ØØXüµvÆŽ‡Ý;wÀÊÊ Û·ï¢}ûv(èï =ŒÛòÏ?xþ¿ý: P¶\9Ô ¨ƒÝ{ö ^Ý:(Q<ý¾eÁB… é÷ó>(Ú‡Aƒ¿Fä»wèß·J—.…Gþú¿7àöíÛظa=\œ(Ýü}Db¾þú+X[Ù`ûömX¸h1 (€fM›˜û "ú$1À3‚§§zõ쉛6¡Wï>ð÷÷C•Ê•Q©REÔ«[îî6DЕ«¸qã:uì''G­Û,Uº$~™2Y¥,,4̤výöû‰Áê•ËQ©R%Eyûv»ÅñE7lÛ±b‘0KC}*KKKŦ« °~ÃFܾ}S§LB›Ö­åM›6Fç®_`ñâ%XºdqfvGDDDDDDDDdPå*•ñãß+^-\£Ç|#G¢ß¾¨R¥ Ê–-›à+¢r¯,&6K–,G¡‚±|ébX[[7n„^}úaéò•hÛ¦ \]]넽yƒ‰' C»vm {ósçüŽú€vmÛ"$4Û·ïDãF 1û·_u1sÖ¯¸pñ"Ô¯(^¼¶nÙ¨²Í-šÃÕÅë֯ǫW¯áïï‡òåÊâí۷ؽgêÖ @à ž§¿×ýа0Lžô³bxÍõëÃǧ¦L†¿þZ§2„¬ýsbºœF  ]‡NØ»o<"¢Â!44zÔÌš9µk×BDDöì݇iÓg¢M»X´h d2™IÛëÕ£G–ڃ˗ƒPG%¼Ë ;wÔÏûÐáÃÈ—ÏM%¼4jØ×oÜDJJJ®¶“ˆˆˆˆˆˆˆˆ>ÝÕ>¼^£F À«—¯ ®{ùÒe$''¡[×®Šð¬­­Ñã‹nHINÆÅK—UÖqrrD[µ{aržŠðN®R…Š€Î:©–Wª ½çžœP˜~ÛV"‘ øåKܽwwïÜ…——àÁÇ™>O§NŸ››Z·j¥RÞªeKxxxàô™ÓëtéÜEÞ@¾|n(^¬^½z•év‘~ìg‚fM› YÓ&H$xúô.\¸€õ6bÝúõÈŸßÝ”†¨4Äßßð|zú¼ ~ ™L¦èŸ›ü3ºí+{þ"B}û È S„š‘‘QHKKCLÌ{xzzåz{‰ˆˆˆˆˆˆˆèÓçS €Êk[[X[[#9%Ùຯ_‡ )¬±¬X±¢€Õýùø@$iÝ^þÞeNŽŽËò«•§W›1'Ü-^²ÛwìDBB‚ƶâãã3}ž^‡„ lÙ²m‰D(\¨nܼ ™L@ t¬ù5¶ãì삈ÈÈL·ƒˆˆôc€— "‘%K–@É’%P³VMôë?ûöï7)À³µµ5º.¨wð“ÈÒçÂSþäKvÒ×£P½÷HÒÒPÀ×Í›7Ó¹ž½½CŽ´•ˆˆˆˆˆˆˆˆHW˜#FÎ’fÜk³²Ò¼×&¥—I¥R•r[[;ÝmŠL^¦|?nùÊ•X¿a#úöéÖ­[ÁËË ÖVV¸y놙ԴÑÀÔ÷£ëž¢ØJ ™L¦à u¶Y""Ê ð²¨l™2°¶±Á›·oeÊÿ¸™ÂÞÁ˜¨±ìmx¸ÊkŸ>€/^Ü®ºÛcoo„Ãû3ÄÛÛ ‰IèÛ§·Ië™›·wú¨Q¯_¿FµªUU–½|>L¤w~o“·›YÇ@É’%0r„ê\tYïñæåé‰íʾzõžžŠ!<‰ˆÈ|ø“ØïÞEãÝ»h­ËîÞ¹‹”ädøøú*ÊìíÒ?}cÒ~òçOïŠ~ïÞ}•òÈÈ\»v]¥ÌËË¥J•Äé3g]üu±s°CLl¬ÖeòçÇ£ÿA"‘(ʤR)Ž=fRÛ5lˆˆˆp:t8Ë盈ˆˆˆˆˆˆˆ(7ÕªY "‘;wïÑ™jûŽ] …¨U£f®µG™ÖmÇ®]eööé÷"uÝÿSPo߆ãâÅK*å—.!$$uj×ɵã$""ÝØÏÏ_<ÇÈQ£Ñ¸qcÔ©U >>˜”Œ‡`ãæ-€Þ={*ê—+Wðûœ¹hÔ¨!¬ÅV¨P¡üü|õîÇÞÞõpìØq”(^µjÕDHH(–/_gg'$%%©Ô3z¾:ƒ¿úC†üeË”Arbnܺ;[[tíÚP¾\Yl¹ssçÎG©Ò%!Ñ°aØÙÙ¡E‹f˜¿`¦N›Ž/ºtA|B6oÙ‚¨wQ&£AûãäÉ“øeÆL¼F@Úprt›·otå BCCñÛ¯³ÌýViðòòD·n]°eË?7~zöè[[;lÞ²·oßF·n]‘?{àÕ¨^;vîÂò+ѲEsD¿õë7âMغ¥J–‚H$Âúõ‘š’ {{øúú bÅŠZ·Ý¿:|~žˆÑ£G¢|Ùrxòìþ˜3ööö8 ŸÙÞ""úˆžüýüѤq\¸xTYæëë‹1£G¡i“ÆŠ²† `@ÿ~8pð .^¼‰D‚Ÿ'Œ3àÀ˜Ñ£ñêÕk,^²‹—,…µµ5¾þú+„…†`ûŽ]*u«V­Šóçá÷ßÿÀ´i3å=j„âõWƒ#*2 ûÀæ­[!“É°sû6øûû¡[×®¸vý&8¨8¶æÍšâß|ƒ_¦M7ú¹¸¸àÏ5«ðÛì?ðç_k±zÍŸŠeÞÞ^øâ‹næ~‰ˆˆˆˆˆˆˆˆt=r$¬ÄVزõ;~ ‹Ñ«GŒ9<‹[7Í°aC‚ÕkþTÜg«]»&Œû £Ç|¯R7_>7L< k֮Ŝ¹óššŠV-[è ð| À²¥‹1uêtLýåãý¿ÂE cÎï³áëkø&å9"‘@gÞ£#"ú4ó3ÿsÇÏ2™ ÉÉÉHLL@RR„B!„!„Bv`$""""""""Ê ™L–þ€ €‰„°µµÓYŸ÷興ò&Sæ<£H$$&&"%%B¡b±8ýþr@DDDDDDDD”)ò›¹iiiJ$HHH7syŽˆ(ï2õg>1À3ŠL&MÿT@[;;X[[C(²k'Q&Éd2@ZZZFϺDH$=õyŽˆ(¯2õg>1À3’"‘"‘ÖÖÖŠO÷QÖI¥R$''A&ÓwÏ÷興>ÆýÌ'xF@‘HÄnùDDDDDDDDDÙH~¿M$!£ƒ†N¼GGD”·™ò3ÿsÇÏHòîøì’ODDDDDDDD”}ä÷Ü„!„BýwsyŽˆ(o3ågþçŽS!""""""""""""² ìg„´´4¼ k[ˆE"ÀÚÚÜM"""""""""ú$H¥R$$$ ::)©)ÈŸ?¿Öz¼GGD”÷û3ŸàE,ÃÕÕ b++XY[C$™»IDDDDDDDDDŸ¡P{{{@&CšD¢³ïÑå}ÆþÌ'¡IDDDDDDDDDDDDdQàYxDDDDDDDDD”­®^½Š«W¯š»DD” ø3?gp¼âžÏÍÜM ""Êu>DéÒ¥ÍÝŒ<çtáµA9×e§Í›áð‘£ænïÑåKù™ÿ©a<""""""""""""" ˆˆˆˆˆˆˆˆˆˆˆˆÈ‚pÍ"“ÉÌÝ""¢\'“Éøo`ñ’.¼6(§ñ#"""""²ìGDDDŸµ°°7~ ‰Dbî¦Y¤—/_!<"ÂÜÍ """"""ú¬0À#""¢ÏÚ7ßAÓ­iî¦e‹ÔÔTH¥ÒlÛ^óVmðÓ¸ŸÍ}XDDDDDDDŸ¡™K¶m߉U«×ÀÏÏkV­PY¶ióV¬û{=Ö¬Z???s7•ˆˆ(G] ¤ɿ@(bóÆõpuqɶm7mÑ ß|ýºuélô:µkÕ‚¯¯/lmmÌ}jtºqã&~o8@±¶¶ÆÞÝ;ÌÝ\2ƒàà—X¶b%Îœ9‹È¨(…Bä÷öFûöm1äßÀÖÖ6WÛ†ÆÍZàÈÁý(XÐßܧ‡²ÀRþð#""""¢O¼\òþý{<{þÏž?ÇÙsçX¯žbYtt4ž=Žä”s7“ˆˆ(ÇmýgÞ½{‡÷11Ø·o?úôî•-ÛŽŽFpðKÈLìy4~Üæ>%999¡råJŠ×’´4ì޻(‹ù«ÝçèÍ›·èÒ­;RÓÒгGw”*YIIÉ8|ä–-_‰‡aåò¥¹Ú¦Ûwî@"‘p>µO€¥þüá5FDDæ–˜˜ˆðð899"_¾|ænŽŠàà—°w°‡§‡‡¹›BDDYÀ»<¹ÌÛÛ+V®Q ðt‘Éd¸„ÇŸ 99þþ~hP?PãÔAAWàààO/OìÛ·þþþhÖ´ "#£°wÿ~x¸»£m›Ö*ë%%%áÌÙsxþâ¬Äb”/W5jTרGDD”]âââpäè1ôéÝ /]ÂŽ»õx/_¾ÂÅK— ///ÔªU¾>>õNž:{÷ï<|„£ÇŽ+–/^ E V©çî]¼yóV¥¬~`=ØØèî…³gÏ)þH¯V­Ê”.¥RG&“áØñð÷÷CéR¥pçî]\½z VVVZë«xñbømÖ Åë„„ìÞ»E‹U)— º‚ظ84nÔB¡æˆéááá¸uûŠ+Š¢EŠ(ÚíS Ê–-ƒóç/àÖí;[‰Q¿^=”)SZk»ø»„eضcbbcñûo³Ð±C{EyîÝ0è«opòÔiܺu•*U\¿qï£ß£qãF*Û‰‰EPЭß3Aúõ}áâ%ܺu"± ê¢t)Õk:..—.áà¡Ã€ó.â¿ÇËkÔ¨®èuûøñ¼FÕ*Uàî®yÓ+55§NŸA¾|n¨Vµ*¯S31õç²'OžârPbcãàåå‰õëÃÃÃ]¥Î#8ø%*Uª/OO•e±±q¸OEˆhÊ5FDD”“ο€o‡G·®]0kÆ4s7GA"‘ Ió–hÚ¤1–/]lîæQ0ÀËe:´Çò•«pëöTªXAg½ØØ8 ü%nß¹ oooX[[#$$^^žX»f5Š+ª¨;Ñb¸¹ºâ¿ÿ#&6ÑÑј7çwÌ[°ññðîÝ;<{ö#G S¬sûÎ] 6‘‘‘(\¨“†Õ«aÙÒÅpqv6÷©""¢OÐÞ}œœŒÍšÂÍÍÌ™‡'Ož¢xñb*õ¤R)~ýÖý½àáᨨ(|ûÍ×1|¨Jý1?üˆ¸¸8À†›°aã&ŲQ#†cèÿ©Ô_óçZì?pP¥ìì©ÈŸß[k»7nÞ‚Y¿Î†X,F±¢EðæÍ[„GD }»¶ømÖ EÏ@€!ÃF [—ΰw°Ç†›Q ~„½y™L†I?Gï^=sü<_¼t‹—.ÊeKиQCåK—¯ÄÆM›±mëf•v·lÑNNN8pð<<ÜñêÕkÌ™;Æý„þýú¨lƒ¿KXŽwï¢E‹U)˜:i"âââP¢DqEù‚…‹qõÚuÜ»}C¥þógÏ1dØ­ß3?ü8G‡§§^½z¹ó`â„q*!üë×!2l„âõä©¿¨lgóÆõ¨^­* 2* C†ÀàAñÓØï5ŽëØñ1ê;|?f4ªU­Êë4‘H$˜:m:6où®..(P ?^C&~™2 :vPÔµ··ÇOã' Dñظ~-D"‘bÙ„‰“pôØqlÚ°NQfÊ5FDDdHhh úRoñã~DÃõ5ʽ<=Ñ´Ic”+[Æ܇aVÌ™‡#Gá—©“P»V-åááá8økøûûaÙ’Eü‘ „Yßi#“ÉTrÍ›7…››V®Z­±L¹þ’eËqûÎ]Ìœ1 gOÇñ#±iÃ:DDDbúÌ_UꊄBœ9{ƒÀéG‘/_>Lœ<ÿûú+œ9y ÞÞÞ8xø°¢~\\þ÷íPÈd2ìÜþî߃SÇbáü¹¸zí:¦L¦Ñ~>øàƒ>øÈŽÇŽ;áëãƒJ•*¢u«–€;wiÔ[·~þZ»_të‚W/ãÜé¸xþ êÔÁ¢%Kqàà!•úçNŸPô™’““³å\êúC&“¡gÏî°²²Â¦Í[4–%&&bï¾}¨P¾<*V¬ Òî‹/áýû÷¸pö4Ž:€cGÂ×dzÿ˜ƒ·oß*êòw Ëz”(žέZ½ ‰*ËüýýP¶lXYYi\?Æ^WpõÚu|øðÏÁÑCpèÀ^xxxà×Ù <"BQ·dɸy-]3æ¡Ü³k»Ê÷c•Ê•ukת‰Ò¥JaûöHJJÒhËÖ·ÁÆÆ_tíÂëÔÂú~þÈd2üù×:lÞòôë‹‹çÏ`÷Îí8}ò8*T(q&â¿ÿ+êúúøà·Y3qíúu,Y¶\Qþïö8tø~3U*WÎÔ5Æ|ðÁ‡ù–.55Ïž?GJJ *W®¤õáæêªuÝJ•*bùÒÅÙ6%@^Õ¯oo„GD`ò”iHMMÕX>mÆ,<úï? Пᑉàå2kkkôéÝÇŽŸÀ³çÏuÖkÜ°¦Nž„NJà U­ReJ—Æ­Û·Uê ¤¦¦¢]ÛÖ°µµE©’%ðáônÕÖÖÖ(SºÞ¾ WÔß·ÿ ""#1bØ•aZ¶hŽfM›àà¡Ãx÷î¹O}bžH$•º«×ü_L™4vvvWLž8-š7Ãû÷1*õíìì`mm ýßZ{{{ÅCÛ¼LÊu”{{hó÷ú Éd;æ;888Hÿ·wäˆapwχ›·h¬“€Ù¿Î„³³Àßß­Z¶@||<^‡„äø¹öôð@ëV-qöÜyý>r±±qèÓ[³'`l\&N;»ôáºý|}ñåàHIIÁÉS§õø»„eéÚ¥ªW«ŠC‡ ^ƒFøáÇqسw""#³m‰‰‰˜2y¢âÚ(\¨¾4ÉÉÉ8¥tm…ÂŒï»ôï+;[;•ïGõ!]ûõëƒ÷11ŠáåBBCqñâ%´iÝ ®j7ÍxZ¾µëþ†¯~û½âg¬«‹ &ý<‰[þùG¥~“Æ0p@,]¶×oÜ@pðKLŸ1 M7 Têšz£R¥Š˜ýëL­ù0ä@úïùGWyꞧˆˆÈXÛwîth×VQÖ¦u+̘ù+.\¼„Àzu¤Ï{ŽömÛh܈õóóâórµÝ7nÞ‚«««ÆüZb±•*Vĉ“§¡2wS‰âÅ5&²Ïï>DР¯¾Áùó´Ž%nìk+++Àâ…ó5>I-ççç—'Æ*'""Ë¢k®‹ÓgÎ""2‘‘¨^«ŽÆòcÇO 66NNN‰Ò=IMK3éß"yÝÌη¡k=±XŒ””­Ë2>X#‰MúwY_ûŒi¿±ÇÚ¯o 9‡E›Ö­ðï¶í‰DèÑý ë©—KÒÒ‡7‰Dü]ÂÌŒ½¶­­­P§6êÔF•Ê•0iÊ/Ø°q3&N§±=eR™Tç~Ô?RIz}±X¬÷z2Ôæž=»cåê5ؼe ¦Nž„sç/ 44 ßÉë4—eÇÏùyoP?C¿ýŸÖmÈçdT·k÷H¥RX[[cÓæ­¨Y£ É+s,ѧA |ñÊÖÎ`ý¦McÐÀX²t9êÕ €{>wL›>M›4ÆàAUêîÝw‘‘˜1mªÊðß­Z¶@ófMqàà!Lœ0Nñ!Â={÷&ŽÿIñἂý1bøP 1Jï1È÷íåå•mç¦d‰øêËAX¶|%V¯ù +V®F`½zh¯4‹Ü_k×Á×ÇGÞéÃmO™ô3Ú´ëˆÍ[·bÒÏõ>|'''T(ÿñÃ].ÎÎX½b0¼#¢O<3ñóõE«–-°eë¿øæë/U–Ý¿ÿ!¡¡hß®-zöøBeÙ›°7YÞwÁ‚n®®*ãxå”;wA `êäsÚÉݸy ›6oÁƒ‡Ðý‹nðóõ> ›:©TŠÁÁpsu…››[®´ÝÏÏ!!!ÃW@hX„B!|| ˜éÌê×´IcøùùaóÖвEsìܵ5ÔÙ^mósÈË”þ.a9>|ø€cÇOÀÖÖ-š7ÓXÞ°A}@ˆÒ\ˆB¡‰R©Tåf‡òœÉêÂÃ5¯·o߀ÎpÌXò9÷ìݱßÁ¿Û¶ÃÃÃ-[4×Þ^§ÍÏÏIIÉ&÷+W®bÉÒå ð̨téR¨Pç/\T)/^¼œœœpðàa4lÐ~¾¾¸pé6oÞŠöíÚbÏÞ}8{î{÷@jj*Úµm«u¹››ëÕÅÉS§üò% ,ˆ¾A_~ƒ¾aÌèQ(\¨þ{ü³ÿ˜{{{|5xÆvŠ/@€õ6ÂÍÕ...ˆŽŽFXØüõnܼ‰W¯>öî“??vü„âi///Ô®U0xÐìÞ³Ógþ +++”+W¯_¿ÆÌY³!ðݨæ>ÅzuíÒ‹–,üù Q¬XQÅqiãíí¡ÃGbüO?¢p¡‚¸t9k×ý ?Ô« ¨Çß%,‡­­-F†é3g¡Gï¾Я/Š/†ääd\¿q¯ßGGGôëÛ[±NêÕpèðü2}&†ù"‘{öìCXÆH2h†Ñ äÇÿ†Ç„q?¡ ¿Ξ»€¿×oDÑ¢EP§¶F»JOŸ³ä÷9sÑ«GwDFEÁÊÊ ;´×¨_¦LiT¯V‹–,ôèÞMç1ó:µ|߉þcÀà¯0îÇP¢Dq¿Äâ%Kqïþ´Tê-*•J1ö§qø€¹ü±8ýOÔéÓ¦¢cç®1ú;ìÜöÆß=¦^cDDDú4lP æÍɱí«]»V-:ò§,]¼Pçʽí¤Rͱ¤¦¦æöéSáäè˜þÕIû\¶òãlØ >† ùVo9kkk̘6cƒsçÎãÂÅK8yê4Æÿ< {÷íǺ¿ÖpM"ú$1À3³/Òð1cÚTLœ4E1ñléÒ¥°hÁ<$§$ãôé3:|$¾4ß©ý.Z0¿Îþ[ÿ݆uë7(öÛ£{7|ÿ]æ¶IDD¤ÍŽ;!‹Ñ²E3uÚ·k‹“§Ncç®Ý5b8jÕ¬‰Ëã·Ùs0dØÇ€¬JåÊX8.Š-¢±"… cô¨Xºl~ø1}®/‘H„J+ªx›7oÅž}û5ÖŸ>óã06õêÖU]žX¿öOLžú ¾:\Q§xñbX½r9*W®dîS¬—££#:ul 7£O¯žzë.TڷØïÇâ}LŒâ8çÏùCqS]Ž¿KXŽ>½{ÂÅÅ«×ü¥r‹D"Ô©]cø…2†“€/ºuÅÝ{÷±k÷œ>s-š7ÃŒéSѪM{$''+êJ¥RH¥RT«ZµjÖÀèï¾W\¥K—‚ys´~â¹s§Ž8á"Ž=†óçÓ{êÙÙÙ¢§žáûõ탫׮£e‹æzçcáujùªW«Š•Ë—bÖo³Uæà)W¶,þ\½Båç投«qþÂEÌþu¦Jo=ggüþÛ¯è?p0&Mùs~ÿMe™¹ÆˆˆˆÌ!(è -^Š/„Ÿ¯/&O†Zµj¢wÏ*õ”‡ÿ6æoŒ|ùÜ ™L@ (­4tº%ò÷÷S ·mêßR.ÎÎhÓºÚ´n‰D‚Ÿ'NÆ¿Ûwàâ¥Ë¨PǤmå‚,ÔÓU&Ðò\ùµúCþñ¡–ç"¥¯B¥×b¥×"¥åVJ¯ÅåçVj¯£ßÇÌ×wð©©©ˆ‰ØÊ vvvFuËvqv2XljD‚PØÚÚ¨ÜÄH$HHHÐùIS$''#4, ÖVVðööÖ¸éADDdŠG¡T©RYß’ÈÈ(ÄÄÄ _>7£æ½KMMÅÛ·o! ááî›lkKtt4Þ½‹†³‹3<=<²ýü9søqNœ<…³§ŽÃÞÞ^kr« ZÕªø{í¤¥¥!$4"‘~JC,jÃß%r1×FBB‚b>¸üÞÞ°µµÕY711aoÞ _¾|FÏë"¿6Äb1|}| Öÿðá""#aogwww½¿Gÿ»m;&NžŠ ëþBõêÕ´Öáuš³râçOxDâãâ‘ÏÝøë̦\cDD”ûŽŸ8‰êÕ«¬'“É’’‚„&‘ þüZëeæ{>ÝC¿D“æ-Ѧu+“{à½yóõ4B·®]4†÷—‹Šz‡v:!~oü³eÄb1† S§Ï`û?[P¦LiEÝó.¢ÿÀÁèÒ¹~›5Ce;»÷îÃûè÷èÕ³»¢wÚ˜~Äî={±ýß­¨T±‚¢îâ¥Ë0Á"4mÒË—.Öh“D"A«6é½ÕÌŸ‹2¥³÷ßþ'Oáëÿ ÁˆaC1bøP­uº÷샛·náè¡(Xðc¯Âøøx,\¼íÚ¶F…òå)))X¾rÊ—+‡Æªlçà¡Ã>r4V,[‚&eëq‘é9š­?óÝ\]Fˆ–ñHU{­ü\¾\ªôZ’ñ: €LéµDéµ,£Lš±kõç2Å!)½V_¦\ǘ2üËÕ‚‰D"•Ĕ˳#¼ÒǦ.R¸°¹•ˆˆH'wy½ô±²²Ò:×Bvps3.D´$ý‡¡¿>:Ã;9ùЉb±X¥Ç–>ü]²ØÛÛ«Ì §Š)bT]9S® ppp0jÈ÷øøx¬XµåË•ÓÞÉñ:Í[¼<=u–Œ½Æˆˆˆ²*!!GW¼Ž‰‰¼|ù »÷ìU”׬777H¥RŒùa,>$$`þÜ9ŠÍš9mÛwÄ°‘£°gçvÅ¿cuê °^=lß±ÎNNèØ¡=¬¬­pøÈQ,Yºõê ¿>ŠýtíÒ»÷ìÅcÂŒiSáåå…“§Oãè±ã*=ò´yöü9 9)É,çòû1£Ñ§ßô8Æý¨n{á¢Å¸{ï>Zµh®¨kmmsç.`ã¦Í˜:yÊ—/±HŒ'Ož`áâ%ððp×;MQ^ƈˆˆètîüy¼xñËV¬€‡‡þ÷õ×æn‘†;wïáù‹økí:„……áßfe}£DDDD9 ""c~øQ£ürP.)^oÛºnnnX¶|%ο€9¿ÿ¦ò}ggÌýãwôé7&NÆü¹(–-]¼3ý ›·þƒ¿Öý }øï^=»cì÷cTö[§v-|ÿÝ(Ì_¸=ûô,èK— Ë=––fîS¦SêÕ°fÕ Ì˜õ«Ê4å˕ú¿V£J•Ê*õ—-Y„‰“§`Ôwß+ŽK  Aý@,š?æ!¢O‡ÐÌ¡!4³å """Ê äŸð|øða¶¿ö¹ÈîsØ°I3DFF¡JåJøeêdƒ½ÊWªŠªU«àï¿Ö˜ûTšOùûkìOã±wß~øûûa¸ŸÐ ~ Þú¼NsƧ|‘y8yÊ¢‡Ð´TÉÉÉ …µ•òçϯwøï÷11xòä)Pªd …Böd~ላƒ»‡»Áᶓ’’‰4‰òçϼ\d€IDATÖéˆ(ë8„¦Æs¨Õ1¦L{à}‚N;‚´´4ņ\666Fuîêâ‚êÕªš»É™fÊpÛ¶¶¶96]‘%b€GDDDô F‡w²m~]"SÞ¼N‰ˆˆˆˆˆèóÁ/‡H$s7ˆˆ(×ȇ_“H$ü70“xI^”ÓxYx9dß¾ýæn‘Y+V ‡6w3ò4žCÒ…×å4^cDD”]Z¶laî&åiykVS"""²x콑u<‡¤ ¯ Êi¼Æˆˆ(»ðß""¢¬a¼Ò¬YSs7ˆˆÈløï`Öñ’.¼6(§ñ#"""""2?x9ÄÅÅ%Ó뾌.‚×ïKBks‘ÑA€øº>FA·æn™Ýs7€ˆˆ(Ïb€gÂbýá"îÍݳ“J°0+ˆÅ2x{§™»9DDdÀ󨂋-Ȉˆˆˆˆè3‹÷Ñïáíí[[[s7‡ˆè“Á9ð,T*†•(2à³|H¡GŸBñ¯ÙÛÂ|ðÁ‡á‡•(R©DDDDDDôiHIIÑ;§á† ›Ð¤yKܺ}ÛÜM%"ú¤°ž¥’ß Íðö­c~ðEÍ0bx¤Fõƒ ÂÃ# ¿ÿ 8pЛ6»éÝŘïÂQ¥r"àÔiG¬^ã®·þ’E¯áâ’þõßçÑcN:ëN÷eÊ$eù4ˆE2Ô øw÷4•óADDŠ?«sÜ’¥ؽÇEçòßg‡¢RÅDs7“rYh¨ *ˆÀÀxLœðVcyÛöEáíŠ5«^¶mwÅÊUú÷›öKjÕL:쌹ó<õÖߺùÜÜÒWäuJDDDyÁ¶í;±rÕjÅkPG.\-š7C³¦M ÌÝL³H$Xó×ZlÚ¼¯_¿†P(D…òå0zÔHÔ«`îæ}àY(YÆr©i@ð+1 «”Ë¿#%Še1±B¿£R…DðÑ>ô¤£“DQ?.^€àWb”-›„‚þ©Zë‹ÄRE}ï)(S6ý¦Ëƒ¶~i…šÕÏ=ý¦CšÖvšÊÆV‚ÓC3Î YºìøÙOúùù¥¢rÆpnݲÃÓgÖ¬÷žžéÿÞ;:J²²yÊ£RSxöÜ%KZi]þì¹5RR>Þ|zÿ^„gÏ­Q£züuüîçì,U<âÙskT®œˆ¢ER´Ö‹?~ÿó:%""¢¼àýû÷xöü9jÕ¬‰‚ý!•J…£ÇŽc÷ž½èݳ¦N™dîfšÅô™¿bý†hÔ°†~û >$$`ãÆÍüÕ7øsõJÔ ¨cî&}òàY å¡È´•ÉŒXGþ¼m»X4o§w_Êõ[6C‡1ë7k‡fÛ·À/^º WïhE>庙q9È)J÷†ììd¨^-A£ÞóçÖˆŒ£råD>â‰D€V-c!ÇŽ;"9Yˆ¦Mâ5n¥¤pé²}Æüz@áÂ)¨V5Ag{Þ¼ãúu{¤¦P®|ŠKÆ“'6{#F½º þa¬wïĺb‡ˆ+8:JP¥r" NѧN׿S”}:´A‡öéÿVOù%?ž>³Æÿ¾‰Tô”’“H€'P®l¢£E¸pѵj% b…D>GGDd$ ,ˆÆÂÊÊÊè}ÑG ð,Yv$xÆÞI5µ~v­«Ã¬Y^xýq%ŸTlÙ¬QïäI'ìÙëŒêÕpåª=¢ß‹ðê•""ĸuËï¢E8~Ì‹†(ÖyòÄc~ðAl¬ù ¤")Qˆ¨w"T¬ˆ¹„ÂÚZõ öíwÆœyžIÈ_ бc ¬pæŒ#NŸ|¢rÜûö;cÁ¢ô!¦üýRa…¸X!:uŠÁÈáøLG^ "¢\&ßõC¿¾ï°{· RRÀb`ñÂ|7Æi„XûçKÔ ø =\›8¹¶lu…‹³îî¼±‚H$Ão³ÂкU¬Ê>bbEè7  îݳ…‹³NNRÌüÕ '¼ÅÐá~9"Ç~ ðÞ½áCüqý† H…ƒƒÏŸÛÀÓ3+—½FÙ²Y~›ˆˆˆˆ(«ÜÝó¡r¥Š8|ä(bãb^ll ŒÛwîÂÛÛÖÖÖ ——'Öý¹ÅŠUÙ·0ø«opõÚuøúøÀÆƯCBààà€¥‹¢Fõj*õoß¹‹o‡Gdd$ *„ĤD„††¡FõjX¾l \œµ¶w÷Þ½XºlëÕÃ_kVfùø> ©TŠþ}û¨”»¹¹¡mÛ6Ø°qž=Ž¢EŠ¨,~ù#GT&…D"Åû÷ïQ²D lûg3ìííÍý¶å9 ðrPtt4vìÜ´´4ƒuÅb1:wê7·óÖ}Æù6o †,ccÔ¹m¡H†˜8!d2`×Îçøi¼öîsF½º°sÇsLœœ§Ï8â]´nnéïï³½(ÀêÕ/C@mÜì†+ݱu›+úôúø©ò¨(1æ-ô„§‡óç½FiøðAˆq àù „ªízðÀ¿ÏñBÅŠ‰˜þË8;K ‘K—zàß®(R$íÛÅ‚ˆˆ(§ …émÛ]±ýŸHN cç"ønŒþýç$i´j[GŽ8)¼“§±e«+ºuyéÓÞ@$’!2RŒ®_ÆÏ“ò£q£8•žr yàÞ=[ŒÃÒçè=|Ä S¦æOoƒÚ‡VÆþ䃛·ì°p~ˆ" üï± ú(ˆ!ÃüpäÐSÒå¶øøxܹ{>>P¨`AEù’eËqûÎ]Ìš9ݺt\¿q={÷Ãô™¿j„gËV¬Â›·°ýß­¨T± &6ƒ¿úßÿð#N?¡P¨Øç7ÿPˆÿ³wßñM”Ç?™MÚ¦I÷bod/ÙD@6"S@dÊP6(¢²—ˆ Ù{*{#ˆ2eoZèÞ+ë÷GÚÐÚR(þ|Þ¼ú¢¹{r÷äîrw}¾÷|Ÿm[6R¢xq~Û½‡ƒ‡2aâWÌø~úkùü—¯\ T©·íæ½SºW®\µ àÍœ=—¯&M Aýz˜Íf¦L›ÎÏ©ãèõêÙãµÔ]áÿ‰à½BîîîÔ¨ñ.Ë–ÿ‚јñ82™ŒîݺØïr"€wéŠ ©ÌþF»t—oRÏIõtÌ$æç.[oP¿Af d‰$Nœt¦^}Ëë·ÞJæðQWBÃdèÜ ˜Íða§H$(X0źÌVD³ðGO._QÙ¬çøïÎ$§HøðÃHüü ˜gƒ…Òíã|Èž à­Û¨Ãh†áÃCи1R|Ú7œ‡5lÚ¢£¹à ‚ðL„^Þ, )œLÑ¢É˜Í “™É—Oo}€E­6ñøÉÓÛÁüùôLù&˜w«Å#K½ðò2иq,K~öàî]'J–|ÚKî·ßÜðñ6ðY¿0ë´ÆbÙ±ÓÝ{lŸ¾sWÉá#®´hcÓ“¯XÑdú~Τ¯}9tØ•Æ2Ný-ä¼sçÕÖ}ž··A¤»Aá?ãè±ãDDFb6™ e÷î½Ì™5™ìi†¨úuë?_>ZÐÒ:­|¹r”,Q‚ó.Ø-÷Úµkh4J§ „iÝÜøiÑkð`ÇÎ_ còW­Á;€¦MÓ¨a~ým7cG‰‡‡‡Ýz*V¨@Ï{P¸PAr“\]]Q«Õ\¿qƒ9sç£P(˜ñýt|¼-Y§ž„„†2iÂxZ·j‰J¥ {ÏÞ?~ÂnYJ¥’É_MdÄðÏ9~ü¿Ÿ<Å¡ÃG5f;vîbùÒ%Ö4š …%@6îlkšÊgåÍ›÷µloooþ¾t™äädJ–,a3¶_ZÑÇÇ;»‹A2Ið^£´ ÞªÕkø¨Ó‡ƒwVÏ´€º8[ºEGKíZFcbdÜ4Fû.x™mI}ÓÁ{vùéÿÞº_ðsü„ F#ôêN…r ÖeDDÈ­i6Ó¯ÇÓÓ²MCC*bn4J¸{GiW>0@ÏÝ»JŠKv8žŒÝgAø#Îoÿjûökð÷×3qüc$ébpAÁ »²^^d2K¬g]¹¦²›––ÊS.7S6Ý8¼BÎpuµDî"£dvó¢¢,÷ŠiYAAáÅÜÜ4h4îÝ¿ÀåËWxDËÍéôa›²ÁAÁÏ]–ÖÍfï5¥Ù{M1Œ;ž ›6sòÔT·ùòåÀ]§£lÙ2¹úÙß~û-<ÄÕ«×ìêò÷¥KÖ2‚ «%}ùEYQ¼X1¾übäóƒwØǞܴF¼¼ \»îD\¼ÔfÞï'1ÅK$g5žõŸû1™RSnªM6Ó7lÒb &Ûòo½•„8zÜÙfúæ­Z¤v˯R%½AÂÞý®vó–­ðàÈ1—\ßâGüˆñóª„'³Ùòã¬6ÛïBÃäìÚeÏ.}ï.…ÂÌ[%“¸|YEpº_l¬”5kíÇT«\)µÚÄÖmZŒFÛzÿV3{®Ožˆg˲ËÝÝÒ“îÒ%±±¶·ø‡»ðNé¤Ü®¦ ‚ ¿ÆÑcljŠŠ¢pá˜Ro†]\lÇÅ;~ü·ïÜ°:'%%…ÙsçqðÐa›ò2™ŒZ©ãØ%%=½?«S»7o±«Ë¶;Y¾b¥5­å³–­ø…FMš1j̸ùìM7B"‘°výz›é±±±ìØù+Å‹£p¡B¯v‚ ¢^nP«T/,㨴e‹/ñ ß€<´jÆÍÈ­[N¬ß¨Céd¦E‹hë{ÒÞô¸‹M£Zzùò¥P§NœMùÌ6¾žþÓ™kW-Ÿãêu'ÌÀž½.^TШq ~¾†lmŸ£Ç\HJzÚð”˜:&ßž}ë´¢E’)X0%ËÊ¥JYr«Ö¸ãço@*5³{†  % ¦ðà’)ðñ6 Tš©T)RؾC‹Á(¡h‘dnÝvâÆ 'Ê”MäâEµÍöjß.Š]¿¹ñý o¥”/—H\œ”-[´ì= ¡oŸpÌÄgk»‚ üˆÞ«w츋õzû÷%˵xëV-ýeiHøàƒh²>™DåÊ&rêg–­ð fõxnÜtbÆLoÚµ‹â§%žœ<éBéÒIè´–†‰ž‡3xh ]ºå£]»(¤ظIGƒz±,]îa³|ÆDÿ¾a|÷ƒ={ç¥ß§axû8wNÍôï|H G71¸ýËøèÃ(¾ŸáMÇNø¨S$Z­‘«WU,]îJeæÃŽ‘vïÙ·ß•‡ß+*”BÓ&1٪˫:NAA^…ÃGŽjI ËÍ›·8pð*•ŠÃ> hÑ"h4víúºuê'0'O²zõZZ¶hζí;8zì8ÕªVÁÅÅ¥RÉñ㿳jõ&ŽG©Ro#—ɹuë³çÎÃËË“ªU*[ëPýÝjÔ¬QƒM›·à¦ÑðAË(” öìÝǼù ©Qý]ºuíì°þܹ{—ÀÀÀÙÅŠ¥mëVlØ´''M7"66–…‹~$**Š¾û6·w™ ‚ཀྵDÒ:uŒ )I¦ÍZ¾Ÿñ4Ït‘"É ìFž=ÏFðŽqåÈÇ«¨Q=ž:icÐd1‚wâ„ [¶jm¦íúÕÍú{éÒ‰øùd/€7s–aaö韾žìkýý“Þá,’ån!eÞI¤ËG‘¬^íNŸOó •@ÍñŒõ„ƒ‡\˜1Ó‡NåçÛ©ÁT­Ljæ‡ï‚XºÔƒ‹«¸vUEù² Ìø>ˆ }S»+<­£›ÆȼYù~†7³fycJçëc`ÈÀPZ}-Z·Aøÿ&Îq¯ÜƒV®²íá¶a“Îú{ÅŠ ÙŒL÷˜þ­×\oãÆ>¡VÍ8qåÇŸ<ùã´3›6Üàýf–àÎêµîlܨ#0PÏ#Ÿ ÓYºÜæ'À§}ÂqR™Y¸È“N]ò “™©];žñc£Ñ˜2]WÁÞ'½ÃHL’°âÆMð³N/Y2‰±£žP ŠÝ{vïqc÷ÇËkP?6Û¼Wyœ ‚ ‚ ä´;w±cç.À2·7-[4ç“^=)RÄÒÏÕÕ•©ß|ͨÑcéݧ/%K–`ÞœY$§$søð>í÷ŸôêɈᖠ߂ys;~ƒ‡Ã`°´“I$jתɜ™3pqq±©Çü¹³øfê4Ö¬[ÏÒå+¬ëíôak ñu™4q<...¬Û°U«×'0ysfQ£ú»¹´§Aþ[$/Q.£i¿§ýìOZW+©ƒß%€,ÝÿÒt¯åé^ËÒÍW¤{-OýIÿ»â™×®‘QÑ3Ÿ÷áõz=1ÑÑÈ Ôj52™Œñôpa™Œœ¸[—xüµAçð䉂äd F´Z1žIV%%I •áînBãútûéõŒF *Õ‹{~’—'OìÜvÇáüøx)aar\]Mxxì1AþGïBõ‚‡r»*ÂKV`0@@€žô·=1124ã ¯ijèÓ7ãÇ>¦Kgû^_&)Ð$øùP«Eà.'ðè‘’äd ^^ÜÝŽ¢ ‚ ¹cÏÞ½T¬Xñ…åÌf3)))$ÄÇc0ñóósXîu·Ñ9b4yøðjµ ›é h4»÷$%%†ÁhÄßÏ''§ç®#99™GAA( üüüËs¯FRRAÁÁ¨œTøçZ=AxóíÙ»/GÏùî:í` 0¤þý3¯Óÿž6ß”îµ1õµËcçÆtóÍéþ7¥þàà÷"“þuF]¤2;͆è÷†z^G8© üÓ=±,:;d“ÊDÞ¼–ï`úí'W˜‘+Ì6ÓV¬ðàÁ_~‚Lf™.çÎ]%eË$f¸ý]Läsyú¤»ØO‚ üˆsÝÿÇ=£ÜÜlAiéëÕ¥IãXëôcÇ-O¿õ–ã1פRÈ“Gô¾zUd2KªtAA!çÉd2òçÏçpº£à€J¥"Ož<™^‡““… Ìíj­û›RA„ÿÀ{C™ÍfÌfÑ ú&0cfÏ~Wb㥴x?š¸)«W»£×C‡ö‘b? ‚ ¤#Ήÿ-þzŽuaß~ Ož„’? §O;³f­;åÊ%R¡|bnWQAAAá_Iðáºv‰@¥6±m›–Ñc-Ýy‹NáëIÁT®”ÛÕA„\£ÓY½ò>ßÿàì9^ÄÄÈðð0Ò¦u#†‡ävõAAAAþµDï äêCd‚‡HCö©Ñj4Ôc2ë‘ZÇýÑ­Ííª ‚ ¼Q¢uhœ"r»ÂkT¸P óç>,cÛI¥/¹@AAAAAðÞDE½®r3¬$Ñ n¹]AAÈ3§Šz]Í특DïAAAAr†ཛྷ•ñ” ÈíZ‚ ‚ ‚ ‚ ÂËØ—ÛA„-ñœ´ðJÝ¿ÿ€Ð°°L•MJJâþýÄÆÆfX&22’û÷ ÆžA„×I\ÓAAÁ±ÌÜÿ¦ÍýûÐëõ¹]uAp(:&†û÷”””ÛU„ÿ4À^£ÑHýFM;nB¦ÊŸ9{Žúš°qó– ËÌ›¿úš°oÿÜþx‚ ‚ðŸ!®é‚ ‚ ‚±ÌÜÿ¦÷óÒeÔoÔ„[·nçvÕ…7˜^¯Çd2½’e'''?wÙ+W®¦~£&\¸x1·7ƒ ü§‰šÿ-[·%1!ÑúZ*“â®ÓQ¦Ì;tîô!yòäÉí*fJñâÅhP¿þ~~¹]AAÈâš.d$íØøò‹Ô­SÛf^Ó÷[P³F F}1"·«ù¯Q¿Q>íó íÚ´Îíª‚ ‚ðüqú4cÇMD*“²võJtZmnWIHÕ©K7ÂB3Îò~³÷8 ?»÷ì凳ž»¼ukVâîî@£&Íž[¶fÍêŒ=*[u ¦ûǽž»üQ_Ž¤NíZÖ׉‰‰Ì_¸ˆíÛwò((…BÁ[%KЯï§Ô¯W×ZîæÍ[ô0è¹ËnÛ¶5Ÿôêi}Çì¹óÙ¹ëWBBBJ¥”(QœݺÒꃖ9°§AÈi"€÷qçÎ]d2M›4,OYÜ¿ŸŸ–,eÕê5ü¸pÕªVÉíj¾P»¶mh׶MnWCAr¸¦ ¹sç.‰‰‰Ì[°Ð.€wçÎ]Š-šÛUü×HKñj~EO< ‚ ‚ðæY»nDEG³sç.:Ô)·«$¤ºÿQQQ4{¯©ÃùyòZ‰‰áÎÝ»”-[†B :,/—?moØ ¾Ã2±q±¬^³Žwß­–íºèõzîܽKžÀ@*W®ä°¼»NgýÝh4Ò£goþ:s–Ò¥JѾ][âããÙ¼u+ŸöûŒo&e}¸,)9‰;wïR ~Ê—/çpÙ6ËîÖ£'—¯\¥w¯©T±" ¬]·žá#¿$,,œÞ½>~µ;R„,¼ÿw¦LþÊfÚ‰ßOòq¯OørôXØk3/,,œã'Nð$$wŽwÞ)M‰âÅ3\þùó¸tù2*•šjÕªàçë›aYƒÁÀ±ã'ø矇xyyR³Fõ Ë>|ôˆ«W¯ÙL+]ª~~öË¿}ûwîÞ¥NíZ¤¤¤°ÿÀAž„„'0zuë R©ìÞc49ñûIîß¿§§'uëÔA*•pôØq ,HáÂ…ru¿ ‚ ³Ä5]\Ó3âëëËùó8}úÏ  ÒKLLâè±cÜ»…\NñâÅ©Vµ R©m¦ýìì¬2›Íüùç_\º|½Á@üù©]«¦Í²ÃÂÂ9wþ<5ªWç÷“'¹wïï7{___9ÊÝ»w©S§6 °¾çÏ¿Îœ”DÕ¹qó&GŽ#)9‰Ò¥JÙ<íœæÐá#\¾r€+W¯Ù¤y-R¤°uÙiu)X EŠvø™Nžúƒ„„êÕ­ƒD"yU»]A„—ËÞ}ûéüQ'Nž:ŦÍ[3 àeåþ,c‰9r”èèhòçÏϻժfXöÂÅ¿  £^jO«‹_âôé?1›Íxyy:ì%ÎÑcÇxò$Æ•ªUªdxo’¶ŽÛ·o“˜˜ˆ¿¿?Õß­†““S†ŸõÔ©?xøèR©”‚ R±BùçÞפÝ7zyzR®\ÙÛG+ßNý&Óå[ð>ìðÂrÇ u8ýóa#ðôô`Pjoº—©K™2ïdªüê5kùëÌYÔ¯Çü¹³­÷ä½zö MûùzòÔ«kí=P©RE»¿ 9vü.þÍ'½zòùÁÖéõëÕ¥^ÃÆÌ_¸ˆ^={Øí[ âââØ·ÿ¡aaäÏ—zuë P(2ýùAÈ>Àû«þn5Ê—/ÇŸþÅ£  ë“7maÜ„‰H¥Rüý #..ŽÝ»9L½ôå¨1lØ´•J…—§'cÇO`âø±×K—î=¸|ù :…\ŽÑd¢wOÇOy=zœq&ÚLû~ú4Z¶hnWv×o¿1{Î<–,^Ä—£Çb40MDEEQ°@¶lZ«««µ|tL ]»ÌåËWк¹¡Ñhøfê4ÆŽEÿƒ4ð3ôï—Û»IA^H\ÓÅ5 ZÕ*œ<õ‹ÿôÂÞ¹sçé?`á+V”¤Ä$îÞ»GÉ’%øiÑ|Ón³º?²*""‚Oû àì¹søûûáââÂÝ»÷ðööâÇóy뭒ܺ}‹¾ýЫg6nÜLl\Ûwî¢}»¶Ì˜1‹Ø¸8æÎ[Àþ½¿Y6fΚÃõ7õÅÆŒ›@žÀ@‘œœL“Ƙ3k†MCÅÐa#ˆ`åªÕ¬\µÚ:oÈ ôï÷)*•ÃF|AÁغyƒÝg ¥ûǽ¨þn5›tG‚ ‚ ¼yvìüÕroШ!îLÿînݺmËêýïåËWèöq/¢¢¢ð÷÷#&&–òS!ƒS;wýÊÒeË9|`/k×odÑ‹1›Í(•J»Þú ™ôµ%0T°@~‚?!:z2?êĸ1£lîqâããéÙ»9K`@NNN<|ôæÏM¥Šl–}íúuz÷éKhhy1šL<|ø%Š³äÇ…øøø8ü Ûvì`þ‚EÔ¬Qƒ¥K~Ìí]›-fÛŽ|?}šM°ìUÛ´y+Ʊy ÎÃñ£¿´>d–vÇ´B¡ _Þ|œþóORRR삹÷<`ÐÏ1™MÖûÿbE‹²qýœ_Û¶„ÿ*éË/Bø·“J,‡\& *:š1ãÆS°@~?v„½»wqúäqê׫ËÏK—qîÜy›÷ïÝ·Ÿ ›6S¯^]ÎþyŠÃ÷±ç×,[þ‹ÃõÍš3‡Ë—¯0ìó!üõÇïœQ"“Z>ÃØñ˜4aü~œ?Oàãݹ{ï+W¯±)?{Î\._¾ÂÀý9“Z÷±£G1aâW6ÛFAþ Ä5]\ÓSRRèÞµ GŽãÚõë–‹Ž‰¡O¿ÏʤìÛý+;¶nfßž_ùqá|nܸɈ/FÙ”ÏêþȪ_Œâü… ÌžùÇd÷®ìض£ÁH¿Ï’’’b©‡Ìòüáá#G9~ô#† åòå+¬ß°‘Ç3vô—DÇÄpòÔOë.“Ëò_Vr`ïnöîÞÅ™Ó'©]«&»÷ìeÏÞ}6uùýØaëÒƱ³ÏýEŸOžŽaâêêJ›Öpéòe.þ}Éî3mÞ¼£ÑH—νæ£@A„¬Ú´y3”-[Æšqó–­vå²zÿ;òËÑ$&&²rÅRŽ>Èù3§iØ >k×mpX¾Dñb,Yºœå+~aüØÑ?rˆ£‡°~í*›².\d̸ ¼óNiŽ9ÈŽm[øã÷ctëÒ™_V®bÝzÛu,X´˜sç/°iÃ:ŽÚÏÞÝ»8yâ(ùóçcØ𑘞I>vüD”J%'ŽfÿÞß8´¿íÜNpP0Ó¦ŸÛ»ì•INNf⤯)W®,-š¿ÿÚÖ›’’ÂÕk×ðôôp؃²^Ý: èß/ÛÅÊ•*"—Ë9vü„Íô˜˜X®_¿NÙ²eöÄœ9{._Mš`sÿãæMV¯Y÷Ú¶ ü—ý7Z2„ ݺu›ó.?>ë“3f“‰iS&óÕ¤ñ¸¹iËÓíÛµàüÅ‹6Ëؾc'cG}R© _¾¼Ö[Ÿµcç¯øÓ§÷ÓZ5kÐ<ƒ‹¢L&ÃÙÙgggëò_¤Ù{MiP¿‰„OS[®]³mÈúí·=øx{óY¿¾Öi5¤B…ò¹½kA!KÄ5]\ÓL&vlF£áÇÅK2,·}û"""èùqòåËk^¯nê׫ˉßOrïþ}»÷evdÅ»w9|ä(ï7{÷š6±N/V´(}?íÃÃG8tøˆuuëÔF¥RQ¦LÀÒóÐÉɉ2eÞàÉ“'6ë0ôìÑ?T*_Ž´ô@}6€§V«­Ç§R©´³ÎÎÎ6ã¥tïÚ©TÊê5¶L³Ù̆M›É›7/µkÕÌá½,‚ BNºuë6.þMóæï#‘HÈHÙ²eغ}F£Ñ¦lVîo޼ŵë×iÚ¤1U«Xƨ–H$|Ö¯/ùóçsXßÔûø•«V3mŠ¥'ŸŸ/þ”zûm›²K—¯Àd2ñÍדХŽ£&“É9b>ÞÞü²rµMùk×®¡Ñh(]êér´nnü´hÛ¶l´K¡~íÚ5Š-Š§§‡uZ‘"…Ùµc+_Ošáö¬X¡=?îAÓ&rs·fÛò_Vò((ˆaC¿Öè¡aaF›që2㟲sׯv?¿þ¶Û¦\žÍýûøräp»cRA„7ËÆÍ›ø ]Z÷÷›½Çד§pâ÷“ÔªYÈúýoZ6„wJ—¶[gùrå¸yÓþÄM« h‘"669röÜ9t:...v÷P%JçØñ$&&¢N½_*Q¢‡¥Oßþ|رU*WÂÅÅÅü{V‰%8pð_Mþ†fï5åÒ¥‘Ëå6iÖ©U³†u›å¤ØØ8 ùÜá¼.?¢â3îmظ‰?NŸ¶+ëíåŘÑ_:\NRR?.^Bùråìî{_¦.çΟϰüÄ ãÐiµ$%&d8aFNýñ§þøÃnºL&³;†*U¬Hýzuùõ·Ý\º|™ÄÄ$Ìf½{ö$Àßqà0£ûÿ´”œ‚ ¼Z"€÷Æg[_Ëd2ªV©Ìàì•;K~^Fll,2™ µZTêø©“¨èh´:­ÝtG7ÑQÑhµöåÝÝíËg—ÎÁò¥R©5o8@Ll nnnveýüž3"‚ ¹I\ÓÅ5ýEºuëÂÒå+Xòó2Æm7?íno//»y©eìƒr™Ùi:ì°¡âü™ÓÈRÓ¼„G„ðÝ÷3øîû?OXx¸ÍkggKCTZ㙓2µ¡#õÐvT//O»in ±±q/µ­{tëÊÁƒ‡Ø¼u+Ý»v`ÆM¨Õ*Ú¶móRËAáÕ2lÛ¶ƒ"E ãããCLŒeÜšÕ«#‘Hؼe«5•ÕûßèèÔòî¯Ý3š¥ÅK•z›  99™jÕke\&"Âú0×ÀÏúɦÍ[8tø2™Œ ÊóA‹æ´iÝÊæþ `Öß3â‹Q,_±’å+VâââBÍÕéØ¡=5ª¿û:wƒ«W¯9œ“º­Ó ~L||¼ÝôèÀŒ{¸mÙº¨¨(ºu휣u‰ŽŽÉ°¼Ao@¥V””œ¥íÒüýfŒ>Ìnú³Ѻm{ó²ïoÖõŽ;ÎgóûÉ“¬Yõ‹]p:+÷ÿ‚ ä<ÀûÉȆõ–ô>2©­VkwqX»n=3gÍ¡BùòLò5 àܹó´ëØÉ®¼D"Ád²?ië<ùœv0?“W@Ÿb_þUJËÅQ=_w]A!+Ä5Ý–¸¦Ûóñö¦e‹ælظ‰ýûÚi¯ÓÆ–K/>>¹âåþT  CjºÖôžmP*ôï÷)uk×v¸¬ìŽõñ"£g¹ì¥–Q­jJ/Κ5ëèÞµ 11±ìÞ»Z¶@ë ¨,‚ ›ãÈÑc„†…FùJUìæïÛ€ØØX4M–ïŸWÞQ¶€ô=dõ,…B›FÂys2µ¥RÉä¯&2bøç?~‚ßOžâÐá#Œ3Ž;w±|é›Ìþ¬\±”‡qôèq~?y’£ÇŽ³{Ï^~Ö?Ã4û¯Š»»Ž½»weºüÀÏ>£Ó‡²´ŽM[¶àââbM™Su©S»³f<Ü@ooär9‚‚²Tg•J•©‡^ºŒ¨èh–üô£M–Z5kеKg.ú‘ÓþùÜž‡‚ ¼~"€÷"•I3u°wß~¦O›b3&JPp°ÃòîÌ—­›ÍÞkJ³÷šb43v<6mæä©?¦WÏH§;ÐéÃDEGÓ¥[æ/\Ä'½{¢R©rxäž°°pΟ¿@£† ²œÆ2'( J—.Źsç¹uë¶5•|š{÷ï3xÈ0†êp?½Èƒ–aÒߧñõñàáÃGTñ;Ax£ˆ;¦Ô.ÐÎÎÎO§™L¬øe•åw£í“Co¿õ‰‰‰\üû’Íô}ûØ-ÛÃÃ??_Ο¿@rrò3å÷¿ÖÏ©P(x«dI._¾BpðÓ¿ØØXÖ¬]ÿZë"‚ ¯‚¸¦ÿ·¯é… ¤~½º¬\µ¥Ri3¯vj*¨»~µ™n2™øõ·ßpqq±»ãU©\©"jµŠ­Û¶c4mæ]üû³çÎãÉ“'/½ž£ÇŽÙ¼>}úOL&eʼcW6m{%$&fjÙ-›¿§§ëÖodýÆMTªXÅ‹¿–í'‚ BöDFFrðÐa*”/GÇíiÙ¢¹ÍÏàŸ!—ËÙ¼eõûß·ßz €?þ°‡->>ž“§N½týëÔ®…^¯gÛövóæÎ_`}˜,.Íž;ƒ‡Û”“ÉdÔªU°Œÿ–æÁƒ˜úítîÝ¿oS^§ÕR¾\9 ƒÃìËVüB£&Í5f\Îî°Wì¯3gËxй¥]›ÖÌž;ÏfºÑhdü„I\¹zÕaZøÌH{€ïÌ™³vóΧŽï™±ÐAÈ}¢ž`§Bùr?~‚o¿ûžÞ=?&<"œ…?þDÅ å9sö,gÎ#$4o//$ mÛ´fÛö ñ“¿šˆ‡Žaßþv)’Ú¶nÍÜù ½{±ÿÀA¢¢£)W¶¬uz:µ©T±«V¯¥@þ4jØ€ØØX-þ‰þá‹Ãm¿¯’F£¡ßOùôì݇~ŸöÁÛÇ›sçÎ3ý»H$ôèÖõ¥Ö!“ÉXº|J¥’J+pÿÁ?Œ;¹\N{i>‹)ŒD"aÅ/+ñpwG«ÕIPP0ýúö±+¯T*ù°C,ú£ÑÈì™?¼–m'‚ BömÛ±½^O‹æÍÎwww§VÍJþüùÐëõüù׶nÛNíZ5Ñh4ëÁ»w L{ïßâÆÍ›v=ß^§¶mZ³}Ç.~ým7ñññ´hþ>ƒµë7pîÜy>ë×—âÅŠÙ¼çêÕkÌ›¿ÐáòœœœèÕ³]:wbã¦ÍŒŸ8‰¸¸xÊ•+CrR2»÷îeûÎ]T(_žŠ¹¼Á1ÀìôìÑ‹ÿfó–­lÞ²µZEîÝ2h OBBغm;ÕkÖá⹿P«ÕT«Z…aC3sö\>ìli\É—//‹æÏ£MûŽ ›å÷ëÛ‡[·o³{Ï^ëý5jTgÌè/èܵ‡uðV€Süáð‰UkÖ²jÍZÀr’Ýƾ÷›½Àêµëظq3|1r8:­–¥ËW8l¬A„ qM×ôråÊR±ByþzæI[©TÊ ç3aâWL™ö-“¾ž €§§cG¢[×ίµžŸöù'•Š…‹~¤S—n€%èV»v-ÆaQf™L&¦O›ÊçÃF0âÞ=ÀÒ(7ó‡ï(T° ]ùB òùÐÁÌ·€¡ÃFXëS¶L‡<€>ú…?.ÆÇLJƾÖí'‚ BÖmÚ´¹\Î{MgX惖-8xè0›·leèàAYºÿ˜þíT>éÓÙsç1{î}û3~ìhºtþèå(‚ ¹H\ÓÅ5ýy ÆÉII```®þán2™ Bo0àçëk7Mvtíþ1¿Ÿ<Å­ëW &)9‰|yóÚûÏÒëõ<~ü©L†—§çsÇC¹s÷.›¾ÏÀýп_®mCAAx“ìÙ»Š+¾°œÙl&%%…„øx F#~~~˽)mtY¹ÿ5›Íܼu‹˜˜X (€§§GŽ×'66–P4W¼½½Ÿ{?—””DXX£?¿Ž÷KXx8NJ'|}}²4Þž}z½ž  ` þþ~9zn0,cŸc&0 …B‘ÛWø?‘Óç|wv0RŒ€þ™×éO›oJ÷Ú˜úÚ˜Ó½6¦{mN–6Îȳ¿›3ø±~¤t¯Ÿ—¾Lf¦Ù=ð„ é´ZtZ­ÝôŒÒ)é´Ú,•@`@@®~Æ«W¯±tù êÕ­C“ƬÓ?À[o•ÌÕú ‚ BN×tqMµZMáÂ…r»€å©ã´ñ9^•€ÿL—U(äÍäX ?̘…JåD§Ž_iýAAÈ}Y¹ÿ•H$+Zô•ÖG£Ñd:cJ¥ÊÒýVV–-ä…BAþüù^ɲårù+[¶ 9Kð„ÿ4ÿŽ=ʾýxò$„üùóqúôŸ¬Y»ŽråÊR¡|æ/AAÈ=âš.䆇rùÊUvîú•Ý{ö2rø°WòT½ ‚ ‚ ‚ðß#xšN«eõÊ|ÿÃLfÍ™CLL,´iÝŠÃ?Ïíê ‚ ‚Iâš.䆓§þàËÑcÑét û|ˆuŒAAAAxY"€'üç.Tˆùsg–qW^4Î ‚ o&qMY´`z½á•,»]Û6´lÑ¥R™ÛSAAAø?#x‚ŽhèA„ÿâš.¤Q«Õ¨Õ¯nù"x'‚ ‚ ‚ ¼ ¢eCAAAAAAÞ ¢ÞÿInW@AAAA€½¹]AAøבukîåvµ„7Lr²åzü*˜L`6KÉÄ9JA„×+%%™LöÜ \šE‹bÉÏˈˆˆ°NssÓpöÏ?ìÊ&&&2aÒ×ìÜõ+ÉÉÉÖé ÔgÁ¼9¹ý±s]RR*•*Ãù ›¼G… åYýËòÜ®ª Âk%xÿ!þéÌŒÙÞœ9£Æh”àíe mÛ(ôs؈»a£Ž+ݹ~Ýr Ôóч‘ôènT7ÁS§\ž»îm[îÚ€²R—ÑcýùóOg‡Ëuu5²yã=ëëÝ{Üøa†÷së²nÍ=ÜÝ´l]ÐÚËÀIeÂÛË@¹r‰´m¿¿Þáû×oÐñó2nÝr pádúô§u«èÙOÇŽ»ðà ._Q!‘˜)Q"™!ƒB©S;ÎZææM'úÈóÜå´mÅ'½ÂÎ[ºÜƒ5kÜ40”fïÅ8,ó(HÁôï|8xÈ•„K¯aƒ8¾ñŸœí‰-£g¯¼ÄÆÊX0ÿ J±›ÿýÞüö›QÑ2œœÌԬǗ#Cȟ߶lú}êH±bÉÌý€ Õ ðܺõïFËæÙß·YýÞÄÅIiß±ƒ„qcS£F|†åfÏõfç.7BBäH¥P¢D=ºEÐêÛ:gõ»‘7éøq±çsË|5)˜*•ûs†LnF§5R¼x2mÛDQêí¤ —óÙÀ<ܸáDËÑôïf7?ýwC"#zªUM ÕÑ8;Û¢‡àâEu†ësÓÙ¸îžõõ´é>8 É°|Þ¼),Yü½ã++û4;çÞ5ÌçÅå+*L&È›WO·®tëñ¯ Šÿ¥SµkÅ1zÔ‡eŒF mÛ@*5³~íýl@ÆŒ~LlŒåBß¹[þÜþØBd夠ûÇùž»¼Q_>±¹ÿøã´3 yñ÷EÑ12”J3… 'Óµs$íÚF½týwïqcþBOnÝrÂh”àç«çƒ¢éÝ3W×7ãA"AAþÿ ÿô3k×­çQPR©”Ò¥K1hÀgÔªYÃá{<Äôï~ H‘ <///’““IHHpXþ‡™³Ù´y uëÔæýfïáêêJ\|2——_ ÂÿÀû8~Â…ž½ó¡Ñù¬FöìÑ°`¡ÿü£dælÊOÿ·E‹=ñóÓÓ»g8N*ûök˜ú­×o81}Zµlp°‚;w•4mƒZí¸¡0}bVër㦡ar:uŒ´[®“ʶ1'&FÊ»JÊ–M¤PÁ‡u‘ËŸÖåÎ%R)4nKr²„û÷•ÌžãÍü^Lšø˜vm¢lÞ;s–7sç{Q¢x2£¿|‚Ñ(aÝz#¾ 9Yʇê˜ûökè? %J$1~ìcŒF +W¹Ó§oV®x@¥Š–Á¤d wî*)?…òå.+0À>&gá"OV®òÀh„èhÇO”…„ÈiÛ®‘r>ìIÉIœ¿ fã&.ªØ±õ®] äeŒëÏ…Ô JJ²mðÍ`ЭG>®]sâÃŽQ¼S:‘‡ü¼Ô“Žò³}Û]¼½žÓïSGòäyz\x¸hØÀq¹ë7œ8|ħ—è¡”Õc=ÍÎ]nܸé„NkdízÞÑÝzäãò½{…S©b" Ö®sgøÈÂÂäôNÀÍêw#+¢¢dܹ«¤RÅòæuøvs{z¼¤3š¿ƒJeB¯—ð(HÁšµî¬^ãÎ÷ÓÑü}ûÀòÝ{JvïÑ ÓY¹ÊOû„ÙõP}ö»/åò5»÷¸1o ç?äÒO¿3+$à›A@zÕwdÏl“'rîÜUÒ°A,ýwÀÇûé²²z|euŸfõÜ»{R´ˆåüåìlbç.7¾žìKL´ŒB³µÿ…קt©D⤬۠cèP‡=£wáïK*Ú·‹Êvï¥ôQH$¢Ô¿IVÎQz½å|™'POåÊŽšÜuOê8xЕ>ýò §w¯pü „…ÊX·Þ/Gû-£WOÇeÆú :Fñ§p¡ E©4sì˜ óæ{qò¤ kWß½ÌAAx%†ø‚»~¥d‰â´o7¸ø86nÚBÏÞ}˜5ã{ÞkÚÄî=GŽàûo§ñöÛo½pGC§Ó±`ÞäòÜkŽŒŒäþý˜M¹ûpÔƒÿбSg$R)ýúö!Àߟ³çÎóËÊÕܸq‹_–ÿŒD,$ÓŸ·õÑtú0sÁ4OOßN}¼~ɾýó0zŒ?ò¥P©’¥Q+4LÎÂ=)?…MîZÓFµoEÓ÷ 1ý{oZ}•í‰‰‰RÆ÷£XÑd6¬½g]~Ó¦1´jS€ã'\¬¼4•*%0erð —½jµ;6ê¸zM…¯¯¥ámᢌ{L-üÑ“Ð09S¾ ¶1;´¢PÁ¦M÷aÅ/î|Ú'ûté­ß ãÈQ5Œeï>û'Ï6mÖrù²ŠñcÓ¥óÓ}Z¹R»ægÁBOƱí‰òì>ÍHÞ¼Ž«ÄD)->(Hµªñ4nóÂåd$«Çzš›u”z;‰J•XµÚ¨h:­mϸcÇ]¹pQÍ'½Âù|ÈÓÀKýzqÔkX˜ù ½èÕ3Ü®WUV¾YÕ±C-[d¾·âÈá¶çŒ3gÕtø°sç{9 àmÚ¤C&3óåÈ'Œü2€£Ç\©['ÎᲟýnìÞ£aøÈ>ù4»wݱž×:vˆrøþõtÄÇK™8î±ÃùÃ>±ë)ú¬¬_Ùݧ™9÷šL0yŠz6®¿g À·mÅG]ó³ðGO:vŒ´iÜÞü~Ò…zuã²µÞý\ “3nì›å{{8~äÖK}&³J–Lâãá4nË¡ÃÏOÑpò” jµ‰6­¢l¦wïÁÜù^ìÞã–#¼{÷•|5Ù—ñcŸp÷®Òa™_sC¥2Ó¡½m]ªVI hÑd~ûÍÍ.€÷²fÎöæQ‚Ÿ~ü'Ûi³s¬ܾ£äüy5ƆP­jK—y°k—u² ºEDXºž=Ûˆ­P˜É—WÏé?¤¤¼ºñ‰^… åÑiÄ8èj4Âæ­ZªUK ùû1|ý›·h3 à=«IãX> cê·>¬^ãN¿¾a– ‘3yŠ/mÛDeØ+åedt|½Ê}zà`ƒ†Úôž•H kçHNŸvæÀÍK÷"^½Ö­£X´Ø“í;´v¼ÄD){÷k(?… ézgŸ;§¦ÿ€<„GÈ(V,™¤D)wï))Y2‰Ÿýƒ¯oö·3gyó×g®ü}ÍfúÝ;JúöÏÃA¡Öt·3f{ã®3rã†Ñ12"#eÌüá?Ìô&.NFD„ŒÛ·<èi{ý“¾ö `d‚+ˆŽ–Ñù£HÆy,R¿¾FáárÔj“Ý= ÖÍÈ’Åpq1YSC=î‚…^L™ì0µæ×S|9xЕMî'£cÇ(ŠN¶K•Y¹bº"þlA!çmÞ²€~Ÿö±ï äÏOËÍY»n=‡潦Mxøð}û°yÿà¡Ãl^×­S›Å‹pàÐ!&3Õ:/66Öîý_ŒN¯ž=¬¯¯]¿Nï>} #O` F“‰‡R¢Dq–ü¸›÷¯ß°‘I_@Áù ~ü„èèÉtþ¨ãÆŒ² ú 6‚ØXK–˜•«V³rÕjë¼!ƒҿߧ·ÑÕk×éÛJ¥’+Ÿém®×ëÙ·ÿ•+U²ïÒté܉¹óðÛî=v<•Ê‰‰_MfõšµøûùüØòÀíד&Юm›—®— ›Hü%ü†ŠŒŒdó–m /nT“Ëå´nÕwww‡óãâ,×{xØm•ÖP|íš“uÚÅ‹–1ïªV±o¸ö÷×3q‚ã)™‘Õº€å)~­›£ü£äÉ9>>† Óæ„Ò¥’(R$™?N;“”$A¥2ûܺ§¤Ö]•íÞéÔqþª¿OT´¥çBb¢”bÅ’)Y")[ËLÓù£¬5ÊÇÅIÑéŒv=3 3ùò¥pã¦&/ÕsÃ`0dh õêÆѶMÓ¿óqXîòeÅŠ&9/îÒIlÚ¬%4Ln“Fóe\¿áIJåîôîa7¾^V·!díXK/3€fïÅ7¯žýò¢TšØ·ûùòYŽ»ƒ‡\éÛ?/#¾°>¨òªÉefŽseô—OhõAµêeÌ8Fù„–-¢©Û ¿íÑXx.¨3ΟŠ˜?ç!:å^`ÊT_–­ð x±¤ {Ñ 9¯X±dnÜtbé2ºw‹°¹xöÜÒ¡} y±a£Î.€*çÈJ½D™w,çÖÈ°¡ŽÏ¹ÿ¶Ü—-*z] ‚ ‚óÎ_¸@•Ê•ìæU®T‘µëÖsþÂEÞkÚ„âÅ‹qñÜ_|>|$ûöà¯?~G©|ú@²,Ý8]>êD‡vm¨U·ùòæaåŠe6ëHÿ^€±ã'¢T*9qô0žž– ·nݦc§ÎL›þ=ßOŸf-{áÂEÆŒ›@ÅŠ˜?g:£ÑÈ”©ß²lÅ//V”ŽÚ[Ëÿ~ì0¿íÞÈ/F1aÜZ·ú Ãz¼JwîÞ%11‘ҥ߶›çááA`@W®\µ›wáâßüyêwÜÜ4üóÏ?´nב©Ó¦óAË6XA„ÿ"€÷†rww§FwY¶üŒÆŒ§e2Ý»uÉ0xàåeD&3sã¦}ãlh˜åz([.xYëewà +Z­}]KO¶,²Z½^Br²„þQÒ¸iaîÝzCQ¼X2Ó§ñÖ[/ÜÊH‘ÂÉܺåDP°‚BSð÷µl7Ô=4µî²,­#½û÷•hÝŒ8èʘqþ˜L–ÏP§v³g>²wìÜåf·,©ÞkšýÔ~~.\PÛGL&ˆˆ“’"!6.óGfÎò&"BÆŠe§MI‘-£BjZ¿»ÜؽǷJ&ѯoÞ©ÓŸ<± à%$Hn°HÝÝ3®÷·Ó}pv6óIï—ëa˜Õc,½Ì¶nÓR®\¢u,¹÷ß‹aážÜ¾£´éÉ—'žÉ_3n‚?={ç¥ZÕ’’%lß®ÅMkdê7/N‡–ÓÎW;sËÛÛ@=ÙÖoÔ¢ÑXÆÀ»_É®_ݨT11£ì{TnܤÅÉÉL“Æ–ãúýfÑlÚ¬e×.·L§õð0âînäþýŒÿ0¹pQͯ¿¹1ð³0‡Á×—õ¼ã+»û43çÞ´ž+>ÞL&88`I³—– ïÉñÇοE›VÑ\¸ f×on|”îøß¾C‹T ­>xÀ۾݈£G…YƒwõêÆQ¿ž%uñ½û–q#_5‰Är]kÑ<•ÊL‰âIœ<åB³÷bP*ͼU2‰?ÿr¶–_ºÜ“ ¾ù:ب”É`äˆ~ýÍ_VzˆÞkôùþøÙo¦ú²|… ÄR½z $&Y~wrÊÚ€¶ã'ú9œ>dP¨µ9«u‰NM¥wÿ‚þý¨Z9…ÂÌ¡#®,XèE×îùøuç||l{_mبãÓö7"Þ^ÆŒÎ\ºE³µn`SËÓÓÀÚu:ZµŒ¶%ûŸõôig–,õ`Õ/÷Ñh2>Γ,Û>­×Ñ›NìÞ£!>>mºå½II¶]ÃÂä èp™kWߧbÇi/\Tsä¨+}? Ãí%‚“õcàè1WBBåÖtsÍšYx›7ëìÆS«T1‘úõbùõ77.]V‘˜(Ål†Þ=#ðwÜ#1'¾Y¹Ê•«ì&x·Z{Žjµ‰îÝ"ž»œ)S}qq±?v«UÏ0 ™ã+;û43çÞ§çu3f³„Ý{,ðôú8œùSH )Iä"ü·x¿Y “§ø²}»ÖÀ‹Š’qì¸ ÕªÆãŸ.Åá¹óO{w?«RÅöîÓð÷ߪ×Àðp7X¿;jµ WW“5ø£V›l΋gÏ©Ñ錸¸˜¬>¤)Q"‰cÇ-=±ö_—•sÔ¹ój q|Íœ8á±u Ö¼yõìþík×éØ»WÊ•,[á““™–-¢þyˆÍ2;Drì¸ 7ê1Ürý2›aÃ&-nnF‡c8¦wü¸ ’?_ ßNyý¥‚ ‚ðÿÏ`0`43 À¥MOJz5Ž;R¢D <ÄW“¿¡Ù{My§tiär9¾¾¾veÏž;‡N§ÃÅŅа°g–SœcÇO˜˜ˆZ­~©:ÈŸŸ/GϱϘ˜hÙžÊÔí{êÔiÎœ=K©RoÓú8)HN¶Ï¾P´H<<ËC›ö(_.…ÂÌ_gœéÖ%‚E‹=íž@h×±€]ªÄ>Ÿ„óY?Û›+©ÌLr²„Iã[Ó—ê´FÆ{ÌŸ9³u›–ñcŸØì“æïÇ0r¸}Ê)‰äåR'víÉÁC6oÑrú´3Å‹'që¶NJ3uëÄrà Æ®aðà!W‡ €çÏ\'] ¢cd|>"€þýÂ(ÿÌøoÏR¦rÒt H¡fxkÊ¿”ÇÁæ½ÃéÓ;Ü4^³Îõtœ=§fÇÖ»(R×Û ~Þ^¶n³\¿d28õ‡ (éÞ5â¹÷˜6ê3ηßJbñ¢‡6©bAArŠ\.G&“9 Öé*•*+‹})³~øž_ŒbùŠ•,_±jÖ¨NÇí©Qý]›²áá$''S­z­ —AžÀÀ­öµJë¨×[Ú!Ê–-ƒ³³3ùòæ %%ÅaJO­Vg7M"µÜ¯šÅŸ³‚ üŸ¼gƒxY Þ% ±kûV­vçê5®®F&LÝ:q”.[œ²ežRõ<|¤àÑ#…µ÷Ffx{ñó{q€,+u‘JÉpl³F c™ôµ/7oÙ?)5ð³°,õÊqäæ-% …Ùš^,ƒ[ï²nƒŽ  ¾¾z>B\œŒE‹=É›Çþó7jK™Ò¶ªRoÛ?½åéiiœ*VÜv›K¥P®\"7n:¤ pá§óU*S¦¶yVÉåf–ýü€-[µü~Ò³ºw m›h>î•£]Ã[` ží¢ì–õl°aÊTâ¥xyX¿Ag~íºe?îݧáÊU'Ú´ŽF­6¡Ñ<íyÑêƒh›Ôpa©½}Ÿé)•™³¼]bc¥ìÛ¯¡j•x|}Ÿ?ž^f÷iVŽõ¨(K/3£ê7*ìp½¿ÿîBÔÀËÏK=ˆŠ–±ä§lzÎÔªG×.‘,\äÉé?íRWf廑Ù}šF«ÍÜ9àYißóÍcÐhLôî“—%K=¬Áé©ãàðý›·è2;)½ðp9QQ2*UrÜsËf3´lýÂe-Yü KéÜ2s|ewŸfæÜë“šn6,LFÉ°tÉÓ‘ii“ŸíÉ,¼ÙÚ´ŽfׯnìØ¡¥ï§aìÜ醫«‰Æ m{5¥¥µMqÐk:-˜/Wäü_»¦X¤BaÆMcdÁ¼‡–É©ñOÿßdåU§v³f<Êò:t:#Íßáýf1 À¶Zt¥Ic˃2™™¶m£X°Ð‹#G]©W7ÎzÝï”Áƒ f3|û‹òäýf1Lý&•J´Æ‚ ‚ðêøûùñðÑ#ìRJ>ybù;3 ;‹Î–€V®XÊÃG8zô8¿Ÿ<ÉÑcÇÙ½g/?ëÏÀý­e n æÍÉpyÞ^^¯y‹¾XZêÌ°PËCÐÏöî Ã×Ç'·«)‚ðF¼‰´ ÞªÕkø¨Ó‡Y Þ¥ÑéŒ6©ùNüî‚Ñ(±é U¾\"§O;óÇig»žÑ(¡s×|4nK÷®™ZïËÔÅh”,ÇÝÝh×ã+.ζ‡\Nº~É۷x·Z¼µçJš"E’ý¥mªÁfZn>Ê•µïQÖ»WæÆR+õVºòð¡ÂÚØž&1ÑòYU¯1M˜\n¦]Û(Úµ²NKHrño55ªÇÙ•/^,9S)?V¢—0yŠmú‡´^v‹—x¢R™h“Ú‹ä­’Iü}I…Á A.·Ý_RãåeÈ‘Àñã®$'K¨W7î…e3»O!óÇúöZôz =ºGØ££eLúÚ—M[tÖÞƒ–§ÑUéëc™öð¡‚*•³¿M2»OsR`jOÀ{÷,Ÿïú '.]VQ«f-[ا[›:͇­ÛÜ:øiïÄŒìúÕ2^@ ©öpE§3¾°ghvdæøz•ûôíÔ”¿—¯¨¬½ïÒü}IeSFøw¨þn>>~Û£¡CûHÎœu¦m›(»`GžÔK)ì‚ÇA©Á[GŸd–Tj¹V›LØ|sbLÅ|ùR¸yÓ‰Ò¥“Ž¯)¼>‚>âÊ;¥)]Êö\!‘@­ÚñlÛ¡åÑ#ÛýÞ¡} y±e«Öš²µZÕx‡½¦Íf=ÖŸõt|Ö/ŒÁƒBAAxÕJ•z›‡qæìYjÖ¨a3ïìÙs”y§ôk¯WžÀ@:}ØNv *:š.Ýz0á">éÝÓÚ#0_¾¼Ü¼y‹Ò¥KYÇäû7(\¸NNN\¾rÕn^TT>佦Mr»š‚ oéË/Bx]Š+Æ—_ŒÌVðnæ,o>윟ää§Oà›Í°p‘'NNfš½÷´a¼u«(d2X²ÔÃ.ÕÞ¼ù^üù—3ò—hHËJ]~Û­¡Ný"Ì™gÿÄІÔ^9•*&¼pY%cä–§«>I¨1%ô‡±ãmÇ›ŠŒ”±f­;%Š'[ÇÅËŽ¦MbH`ÙrÛ|Þ±±RŽwÁ××`ÓðUڽǶ põšmšˆŸ–x’œ,±ײcÙÏøûüu»Ÿž=,á kïñ×O+nÚ$†„);vÚÖ|k×^j¬¿ôNÿiyÒ.'§¬ë7kQ©Ì JËÑ6?]»DP²dûök¬ë´Fù3gìsÙŸ?o™–/ïë9^rÒ¶mZ ¶4î¦õ¾ëÕ3Ân»´lÍûÍbxüXÁï']ž»Ü+WTÌší…››Ñ:az2nßv¢Bù„ {¾ŒÌ_¯rŸV¨ˆ·—Í›uvc/®^ëŽBa¦Aƒ§éO#"dDE=ý0<\nM_j6Ch˜Üz, ¹C&ƒV-£¹rEÅú :L&hÓ:Ê®\íš– ñÎ]¶çP“ ~ýÍ’9£qAÁœy^o:ƈÑAA¶›={5/ýëÔŽC¯—°m»›Ý¼¹ó½Ø»ïå×!dNÈ9ã'ø1í[_ ËÌ©S–s\à3é˜óê©Q=žcÇ]Ù³×äd eÐûnÎ>ªVqÜk®eËh–.÷`Ë-5ª?-“öÝHÑK¸yÓ‰ƒ‡\‘É`îì‡vûàVj*Þ¢E2Ÿ3+2s|ewŸfæÜ+“™9"„a#èÙ;/Ý»E TšÙ¼EÇñã.|Ö/̦ço«6qw7²uó]êÔ/LõwãY8ÿ!±±2ªU/ʇ#ùjâË÷„—Óºu‹{2¡ò§P¡¼ýáuêÄQ©b«V»S ¿žF c‰•²h±'(ùbDˆÃñ[Ó¸ëŒ\¾¬bñOžhµFär3•*&75˜\¹R¿ívcÂ$?|†LffÛ6­55ëËô›û¸{7é?Ñ„)Õª&#eå*w¶íÐ:Vx5Ê•K¤q£XöìÕй[~:¶ÂßOOT´Œ½û4lݦ¥Dñdê׳ïeܱC$ÇŽ»0g®>>6°/sûŽ’yó½ÑéŒx>“b;M±¢É”-›ó=¤AAøokØ >5kÔàØñãôîÓ—Z¶ >>žŸ—-'22’iS&£V«_~E™à¦ucÍÚõüuæ,#>JþüùÐëõüù׶nÛNíZ5Ñhž>Äöq÷nlÜ´…ñ'‘@µªU‰‰‰aåªÕlÛ±“‘Ç٭£H‘ÂH$Vü²ww´Z-‘‘‘Ó¯o‡õJHLäÎÝ»ǥˮ!ƒräè1º÷ìÅ ŸáïçÇ©Ó§™¿`•+W¢Qïe› ‚ ¼éDï?¢ÕÑ„„ÊY¸È‹=óàáadô¨'ôèfŸ sÐÀP¼¼ ,XèÉø –g …™ÎE2bXˆ]*C€Å?yf¸~g“5€—•º(•f–-}ÀÔ©>¬Y«ã—•î–å9›h×6Š/F„àäôriµ¢¢e̘åDbIwX¶l"]»DR«¦}Ó„q1$¬ZíΊ_,=å NfÉâ2W++Æ}‚««‰_R'ÁXûjâc›T–i.]VYƒqÏÒhLÖÞƒfϵhmÛ®eÛvËz*”O´ð Haþ܇LüÊAC,ƒ;9™éÐ>’Q_¼ÞS¥ÒÌòŸ0v¼?ß~çƒ)µ¹|¹D&ìpü£´}š‘zuãì‚8á2ÔjSŽŽµ“Ùc}Ó&Ë>hÙ<ã`tóæ1|û/›6ëhß.ŠBSØ°îÓ¿óaÔëvqr2Ó¦u_~òJz’=Ïî=nìÞãx^ƒú±v¼ôAV•ÊLÞ¼)|úI8½z…£ÓÙ·_Cx¸œ{Dd˜³ÔÛI.œÌÞt½áéwC&3ããc_¯Oïp›1$Ó °\ÝÝ_ÍxZ™9¾²»O3{îý e4))~˜éÍ'ŸZ×hL ÊgϤyþ J¡L™D.\PÓº•ãó‡T ?.ü‡ ý˜2͇I_[Ò{z;ú Ý^{ÂøÇL›îì9Þ `2I˜úMyóZÖ×±C_R³e«–ÃG\‘H Iã¦|D£&…mz g•NgdíªûŒ›èǤ¯ý¬ß‰€=Æ=¦óG/7Ö­53xÄ‚Ež¬YãÎçߎãìl¢}»(F Aá`<Åõãðñ6ð(HÁÀÔ ï³.]Rc4Z² ŒãïpýÝ»Fˆž ‚ ¯Ä¼93™úít6oÙÆá#Gðóóeú´)´ú åk«‡N«eÅÒ%Lšü ºt³Nwrr¢mëV|>tˆmyŽµ«~aÜÄILúúL©7ÌþL7†Îu²[G¡‚ù|è`æÎ[ÀÐa#Éd”-S&ÃÞ«P¸p!–/ý‰±ã&òùð‘Èårš5mÂøqc‘¼î A„7Tfφ’,L“8ø=ýëgÒZ\¥~—²tÿKÓ½–§{-K7_‘îµ<õ'ýïŠg^»FFEÏ|Þ‡×ëõÄDG#W(P«Õ™Ê+íéáž#;(ëž¿K  Ë1™$ê_8¦ŒÙ ÁÁ–1Ëòêî²+«u1,ãáøù6½.‰‰R‚ËqV›ñóËù4…))>R ›É“GÿÚ1iÌf ‘/%À߀ú5ŽÁçHLŒŒÐP9îî<<Œ/¿À×$«Çzv–ÿè‘3 ÏÕï†3^å>5™àÑ#F“D/ÿ1‰‰R‚‚89™ ÌÙkKb¢” `9žžFtÚœ??ÇÆJ Q Ññö6äÚuQ°ˆŠ’&G¥2áï¯ç_4äŠ ‚ ¯Ùž½{©X±â Ë™ÍfRRRHˆÇ`4âççç°Ü«l£KJJ"(8¥RI`@@®‘bcc ÇI鄯¯Ï ?gll,!!¡h4®x{{¿°îz½žÇ#•ÉðòôÄÉÉ)×>kHH±±qøùùâââòò !×ìÙ»/GÏùî:í` 0¤þý3¯Óÿž6ß”îµ1õµK¢ cºùætÿ›Rpð»9ƒëGJ÷úÙyéËdfš Ñï?FžÊ,‰Äò¤û›P¹ÜlMÙ•ÛÔj… ¾šT{`éuö*—ŸY øúðÍ튤rs3âæöï Ü¥É걞åçÏŸûÇ‹s^å>•JycÎ¥Âë¥V›2ì…š#Ë.ôêÎC æÕÔ]È:ΈN÷ï» ‚ ‚ 999KË~Þ±µråjê7jÂ…‹_ùç4 tû¸;u&9ùÅŸ91ñÍÙGY•Õ}šƒs&ƒV®^Cíz 8zìxno!D^Êw?ø°}»Ñ12´nFš5‹aäð»ã1.NÊì¹ÞìÜåFHˆ©J”H¢G·Z}ýÂ:¥ï¾Ï„q_XþE2{ÎHÿ=U(ÌètFÞ*™Dóæ1¼S:Ñá²)øa†7‡»#ÃÙÙDµªñ JñbOon/\T3|DÀsëÙ¿-›GÛÕ%#éÏš~nÙš5ã;ú‰Í´¬œ3¥ü¼Ôƒ ›t)ÉÌ(B—"éØ!©xdçÿÆ´é>8ñ‰yó¦°dñ?çU­’@` •*ã¨ý˜Ñ‰±|ñ:wËŸÛWÈ‚–­ Úôž”H͸º˜(V,™í¢([6ñ%–.‚ ‚ðÿ'((˜î÷zn™Q_Ž¤NíZÙZ~±bEÙ¸n ÛwîdÅ/«ž[¾õ-©Z¹2S¦MçÌÙ³¹½‰¨Z¥ ¨TN¹]•Wâø‰ß™·`!çÎÇ`0 us£Aƒú <___›²ºt#ì9Ì÷›½ÇÀýظi ?.þÉ:O"•àêâBhܨ! ÔGòÌ÷¡aaÌœ5‡Ž««+¥K½Í€þý¨\¹’Ýúâããùlß¾ƒè˜´nn4kÖ”‘ÇáâbÛfa4Y²t«×¬ãáÇH¥RJ—z›!ƒQ£ú»¹¶ýçÎ[ÀùóøéÇ…xyy:,ó((ˆéßýÀÁC‡IHH@­VÓ°A}¾1 Ÿ®cè°\ºt™¾Ÿ~B«ZfXîÌÙ³Œ=ŽÚµk1ê‹vóY¹Š_V®~îº~\4ŸùŸþ-}áÂEfÌžÃù󈋋ÃÝÝêïVcà€þ*X0ÛuK@péò¬Y»ž   är9  {÷®´mÝÊîøþùŽ?ÁÈ/FñÛ¯;Ðiµ9¼G…œ$xB¦|3Õ—¥Ë\¿áÄôiA6ËÞ·_Cÿy(Q"‰ñcc4JX¹Ê>}ó°rÅ*UL°–}ð@IÇNù‘H¡_ß0üõœ=çÌ/+=¸qCÅ/Ëï[µ“’%ܹ«¤@þÊ—wÜ` ·þ¬àÎ]%M›Ä V;~ZA&3g«.»÷¸1`P E‹$3úË'8;›Ø¹Ë¯'û-cà€Ðlï£QBžyùëŒ3¥K%Ѿ]ññR6oÕòi¿<|39˜vm¢¬åüÉ“o§ûðÖ[I ŠBaæØq-öäÄï.lÚp×.Ð&gá"OV®òÀh„èèŒS&deŸ¾¬1cý¹pQ @J²m„"«Ûåø zö·Fcä³þaxxÙ³GÂ…^üó’™?<²Yþ›N„†ÉéÔ1Ò®^NªœéÒv÷ž’Ý{4ètFV®rçÓ>aƒà))º}œK—TtéI‰âI\¼¨fõZwü£dÙ’é¶ të‘ËWTôîN¥Š‰$$HX»Îá# “Ó;5°íÈ¥Ë*¦}ëƒÁ ¡P¡Ì?Ý•‘¬œ3ÒO• 3Ÿ(X½Ö¥Ë=èØ!ŠI‚mU)h×¾¡ar5Œåwyð@ÉÖmZNÿéª÷yë-Ë“[î6ˆuXÇë7œ8|ħtAܬž32Zvlœ”ÕkÜy÷]Û›ª¬œ3L&4$ƒ‡\iØ –ž=ÂIH”²u›–qü¸sGɘg‚ƒÂ¿WÈ9wî*iØ Æþ\ããqºËÑ£^|¤B"]9ÿMîÜQ"“AÓ&–lŒF OžÈÙ¼EËÆM:¾žL‡öQ¹]MAA„7†^¯çÎÝ»ä tp×é²½|gggÊ–-À_g^Œóññ±#ÜÜÞœ4‚£G}‘ÛUxe­[}@©Roü˜uë7й[~\8ß&˜œ’’B·{qéÒeºtþˆÅ‹qñâ߬^»ŽÿÄ'$°jÕzöîÃÏ?ýHõw«½öíÿþþ¸˜Æf( ¡m»ŽDDFòaÇ”,Qœó.²qÓf.\¼ÈŽ­›qvvÎp+~YÅö;-û$ÚñC뉉IlÚ¼™ïgÌ"66–%Š;,W¨P!6¨ïpÞ¡ÃG¸{ïÎjµuÚ_gÎÒ¥[tZ-Ý»vÁÛÇ›+W®²ióŽ=ÆÎí[ ÈV]¾5†m;vR£Fu>îÞĤD¶nÛΗ£ÆpÿÞ}†}>Äî= …‚‰ÆñáG]˜1s6Ç}»ZÈ&À^èïK*–-÷ Cû(&lþvÉ$ÆOò㯿œiPßÒ0}íº‹—x’'PÏÖÍwÑé,½þ}Ãè? [¶jiþ~ µjZza%&J7ÞbE“Ù°öNN–†Â¦MchÕ¦ÇO¸Ø{fÎö&6Nƶ-w)YÂÒèÞºU4Þ^æÌóbï> Ù6’Wª”À”ÉÁdÖè/CðóÓ¿°\Vêb2Áä)>èÙ¸þÎΖ׶m¢ø¨k~þèIÇŽ‘Ïmt}žÕktüuƲæÏ}h `ôêN›öùz²/ êÅâîn$1QÊÌYÞ¼ýv×ÝC¡°lón]#øäÓ¼<äÊ™3ÎT®lÙî«V»³a£Ž«×TøúêéÝ+œ…‹<3¬KV÷éËX¿AÇ‘£.4jËÞ}ö7¶YÙ.S¦ú"‘˜Y·æžµûÑ|Ú?/;w¹Ñ­KåÊ= ÇÄH ð×3|XHŽ|G6mÒ!“™ùräF~ÀÑc®Ô­cß‹ñ—•îœ?¯æ‡ïÑ¢¹¥á¶Mëhœ]L<äJP‚€Ô€õ±ã®\¸¨æ“^á|>äi¨~½8ê5,Ìü…^ôêî°Whb¢”¡Ÿò~³¶n{ù't²zÎH“þ{)cĬ]§ÃßOoÓKqê4_BÃäŒúâ ÷ˆ°NoÛ&ŠºägÜD?6®»Xz·9Ú—‰‰RZ|PjUãiÜȾ×ifÏ'Ÿ ÀÓÓÀ grY9gœ<åÂÁC®téÉø±O{Dvù(’ ³z­;#†‡Øõ"þ݆}â°ü³þ¾¤âñcÛ”™µjÆYÏÏ9áÖ-'þ8íLLŒ =µkÅãå%ÆÍË »ûž[·œhÝ®S¦ùÒºU´õÚ&çø ž„Èq×yçDJ·}8cÿ ÞÞʼ“q¾”\¿áD¥J 6v ‚ ‚ ü”)óßNýæ…åΞ;GTdõêÕµ™ÃéÓR¤Ha (Ûç¹.\ü›Û·o“˜˜ˆ¿¿?Õß­†““}Ϻ¿/]âñcÛkÕ¬á°ì½û÷¹yóV†ëÌ›7%ŠÛ!nݺͧO‹7µkÕÊ°XR\î?p€Ê•+¡us{éí1oþ +–ýl]^êï¢qÕ0nÂD6oÙÊÇ=ºÛ¼G£qÍÔñ’¦}»6´lÑÜú:<<‚­Ú°zí:|Ößú™×oØÈíÛw=ê ztëj-ß´q#Z¶n˲å+l‚\¿¬\Åùóøá»oiÑü}Ú´n…³‹3&((Ø:ÎÙí;wXµz M7bîì™Öe´lþ> ¿Ç7S¦±kÇV»ºKǾý #¾|Ô«[…"ãa²´ý,Ä`00xà€ Ë,üq1¡aaLùækÚµi @‡öí(T° ӦNJ_VòiŸO¾÷æÍ[L›þ-[4gÛövóÿ:s–ï¾ÿ+W¯a6›4à3¦~;=úT·šÃ@çÍ›·Xº|ýû}jÓ#púw? —ËÙ¸a­M ®PÁL™6M›·0ð³þ٪˕+WÙ¶c' ê×cáü¹Öé]>êDƒÆï±ü—_±iHôö2püˆí²õz ûö»R¹R‚5`–¦KçæÎ÷â·Ýnv¼W!«u9w^Mp°‚AC­ ñ tíÉéÓÎ8 áC=¹2cÓfƆÚô>òð02vôc._y:ØlLŒ”޽©P>Ѧ B…r%&öi/³J–Lâãá4nË¡ÃÏ,+ûôeÜ»¯ä«É¾Œû„»w•/½]"#e\¿áD­šq6 âR)ôý$Œƒ]Ù½×Í&€#£@ÁW—»Úh„Í[µT«–@ó÷cøú?6oÑ: à­]çNÑ¢ÉÖà]š‘ÃC9Ü6paÙ¿EŠØ6Ð*fòåÕsúO))‡û_ã‹DcF?É‘^VÏŽ¸»™5ãõ槟=ù¸Gjµ‰èûö»âãm [×›÷”/—ÈçCBqu5b4JlzÊ=kælo)øéÇ^:Õí³reÛ-ßO²’!ëç µÚDŸÞá´oe³|gg%J$qô˜+IIR”JѨþ_ôÓOvýjû‡íñ#·2x~£&LòcÍZwtZ#þþzîÝWb6Køjbp¦Rò ¯^‘"ÉT¬ÀÑc®+È—ÏríÚ¸IǸ ~H¥à¯'4LN\œ”Ý#õÅÓÆšqüÐ[xpä—•–ÞÐGÝf3|5q|†)M&}û[=×­±ön|‘x{yÙ‹.dŸÓ<==([æöìÝGLlŒ5€@—ÎѦU+›òo¿ýjµšÛ¶Ùµë6P´hkð.ÍÈáÃ9|˜Í´={öa2™èÖ¥³ÍtwwwÞ¿+W­æÎÝ»v)ï?xÀ !Ÿc2›0MDEEQ¬hQ6®_óÜ^o™‘˜˜ÈÎ]¿R®\YŠ-’a¹“§þ@­VѦÕ6Ó»wëÂÜù ؽgŸÃ^JJ ƒ‡㽦Mhþ~3‡<“ÑH@@M›4¡Ù{M‘É¤Ï š9b2™ùå(òæÉçŸô¶™W»VMZ4of×Ë®bË÷-6æi;vvêòqî4kÚÄfš³³3o¿U’C‡gÓƒ4½íÛqâ÷“lٶݮÞ›Cð„:}Ú™âÅ“ðö2pÿ¾’¿/©J- àÏ6þ]¼h ˆT­bßÃÊß_ÏÄ ¶ceN?¬ú»ñDEË8}Ú™ÄD)ÅŠ%ÛÆîÜU’˜(¥´ƒq®<<Œè¹’. ó*eµ.—/[ºN—.e?ÈjÚ2®\Í^ñ” W¯9áéi° ÈÔ«G½ºO>¾¾† ²O×i2Áï¿» R™y'Ýö?ÊÚJVöiv † ¤^Ý8Ú¶‰búwö¹®³º]ââ,>ûFÇ´÷_»f»ÒÆ™3áÁ?Jž<‘ããc PõŽŸp%$DÎÐÁ¡(•f5ŒeÇΧãÛ¥ “s÷ž’Ý,Aª ÕÜ»§D£1R¹R®®¶)ö*WJ@.7sì¸+­[=m\‰‘qýºeË&: ÞíÛ¯aËV-›ÖßCC)B³zÎȈ³³‰ÆbYµÚsçÕ¼[-ž+WT*VLp˜v´WÏð.÷ú '–-w§wÏòçÏÙ`mr²„‰“ü(W.‘ÍmƒY=g”/—Hùrö磨(—.«)Y2 77Ñ þ_5}ZµGÖ„I–rÊÏK=Y³ÖÝ"øbd2™™¨h}ûçá‹Qþ”z;‰¢E_>Õ®ðòBBH$àÚs7*ZƘq~.”šU÷qs3¢×K0(Ÿ—zдqŒõ¡•bE“ùûïçßcݼ儫«ÉÚÛ[AAx³,X´˜sç/°iÃ:ʼS°ôìÙ»ÆäнHÓ=ý<}Ú¦Lþ € “¾fó–­.»Oï^ôîù±Í´”=Ý?îÅ•«W¬½¦Òü¼t9kÖ®§G·®|1r82™Œ¨èhúöÀ£ÆPêí·ŸÐÉIï¾[›6sûö §íþøóOªV©œã댋‹ãïK—ð'¾|Öé5¤q£†våoß¾Cbb¢Í6 ãî½{Öžz.þͽ{÷Ðh4T®TWWW›e\¾r€R¥Þ¶[þ;¥K–]ÏðfΞËW“&Р~=Ìf3S¦MË–Åé€IDATççÔqôzõìñRÛáôŸ‘’’BwŸ?þ^Z*ýñ –TùòååÆÍ›˜L&»ùÓ¦GRrÆáÌÙs—]¹r%›ô¹‘‘YØ®Y·ž‹_bé’íz»õëÛÇá{Ž?@•tÇWVëòÖ[%yë­’vÓõz=×®_ÇÛË+ÃàXŽ}©Tʉ¿‹ÞLðþEFF²yË6 †§®’Ëå´nÕww÷ ËÜ  ^Ý8ÆOðcÕw 3z½™ >éf“‚/8ØÒ}:³7÷ï+Ѻ9pЕ1ãü1™,½ÛêÔŽcöÌGÖÞ'!!–Ã5-eÜŒYÞܾíDËÑ4l‹·ë×íƒ`ÿü£dç.û.õR)¼×Ô>Þƒ®h<9^¢x²5“Õº¤/o2ÁÀÁyKú³´qøž<É^×óÐ09F£Äf<¿Ì “sñ¢ŠÇOlݦåê5'¾”íTžYݧÙ5s–72V,Ë85jV·‹——™ÌÌ›N—þô”©×KHN–ðÏ?J7-̽ûO{/–ÌôiAÖ±Õ²kã&-NNfš4¶§ï7‹fÓf-»v¹Ñéçñû©ëvu5ѱS~ÎœuF&3c0HÐhLL›D£†OŸèÉ“GÏ䯂7ÁŸž½óR­jIɶo×â¦52õ› »º„„Èùr´?#†‡P²dÉÉ9Ó-«çŒç)šúý¼_É»Õâ ¶ì¯ÀÀì/ûÛé>8;›ù¤wÆÁ¾Ìœ3Yþ‹‚|;-È®gßËœ3nÝrâî=%wî*Y½Úgµ‰ï§!üw)•fkúÔçõ6ÍŽ¥Ë< Ð[ƒw:­‘ ãÓ¬y!Ö¬Ó1nŒ17ÅÆJY°Ð‹k×hÑ<µÚr 6›`Ú”`òæM±ø 3íÛE±ÿ€†óÕÖ^Ñ"É?áBx¸OO_Rqè†Ro'R¯žåa˜7(^LkAAÞT×®]C£ÑP:]GëæÆO‹Ø?”J%J¥¥½Aæè©Øt$‰]™ñÇröÜ9æÍ™ÅÛo¿e3oé²åXƒw:­– ãÆЬù¬Y·ŽqcF;\OÏ-A£ôi _ƈaC¹}û?êBû¶mðòöâêÕkìÜõ+}z÷¢Fê/½Ž£ÇŽ‰Ùd"$4”Ý»÷0gÖÌn[½^Ϙqã‘ÉdÖÏ–±ã\]]éØ©3gΞC&“a0Ðh4L›2™F XË? ÁÕÕµZÍõ7˜3w> …‚ßOÇÇÛÛRæ‰ýßn-š7£AýzÖíÿé'½øyé2k@ðeüuæ •*U|n9???.\¸HtLŒMOI“ÉDDD$)))ÄÆÅÙÌ;zì8«×¬cÝšU¸¸¸¼t]3’Àì9s©\¹5kÔÈ°œÑhäÈÑcÄÆÆrøÈQvîú•{t·nÛœ4cæl‚ƒ3ê‹Ï-§Ój)V´(gΞsÞ "€÷ÈÝÝ5ÞeÙò_03îq!“ÉèÞ­Ësƒw‰‰RŒF ¿Ÿt¡t©$ì½Mþü)Ü»¯äËQþ,XèE¡‚)ÖY‰I–Vh'§Ìhbce$%K™3Ï‹%‹PµJQÑ2fÌðfÕw&}íËÔo‚­uP¦ö :uÊ…3gÕ”*•HCÀIi&9ÙþDsêgNýaߥ[&sÀ?ÑÏa]‡ µ6Ægµ.O·‹³YÂî=–4”½>§@þ$HJÊ^@$)µ.ÙËèÜy5}û[FÆyb eWVöivœ>íÌ’¥¬úå>MÆÇYV·‹Zm¢víxteÝzÚG 嫯-éÅÒ‘ÑÑ–¬ûôïFÕÊ (fqeÁB/ºvÏǯ;ïà㓽`htŒŒ5Ô¯kíA÷nµ<<ŒlÚ¢µ àÅÆZ>ëÏËT*§^½8""mÿèôð0¢Ñ˜¸pAÍ¥ Ùõð¡’ŠUŠ–Þõ11–}Ó¤q,Ç?½þº»iÙ"ƒA›NDDÈ0$<øÇÒH™nŸ¦õ¢¼sG‰§§¥Ë<Ù·ß•€=õêÅ+%$DnYAáßæÜùó ò¹Ãy'ŒC§Í¹,¹¥D‰>r”>}ûóaÇT©\ —çöÐÉ®…‹~dó–­Œþ¹M àáÇ„„†R¯^]"žéaäááF£áÂ…‹—+•Jùräð­«N§£mÛÖ|ÿà –._N«%,<œ åËQ§Nm‡ï‰ËðxéÒù#*V(o3mÛö6éU*mZ·Âå)(“’’4äsþüë cG²ö”³ÔÁrïýó²å´mÓŠ… æ¡quå¯3g:l$ƒ‡ã×Û(?¿eY‰I89YîõÃÂÂÙ½g¯5@›6®aR’}ÛA•Ê¶==<<ËåDD¼|ûPZJPßc›6nĹsç™üÍT¦Lþ ™L†ÙlfÖœ¹„†Z–¡OyúðvDD#¾ø’!ƒÚl³Waåê5„‡GðýôoŸ[.>>O>íX:Ôôù¤7}z÷ÌñúÌ_°ˆZB“ÆèÑ½Û Ëûúúpíúubbb^ɹ@xy"€÷ªx±btïÖ%à ^Zð®x±bÏ]ŽTjiø6™`þ܇ÖFìùS˜5ã5ëaÍZwkO­²”ON–ZŸð~îòef’“%LÿØšBO§52~ÜcþüË™­Û´ŒûµÚdí=D)[6ggùòZNÐ))”Jûu6?Æn 0‰Äq£þ–Mwñö²ßfÍÓiY­KZù½‰ÄLÍñ–eº1$˜ÍŽMí:°KÛØç“p>ëf}­JÝÎIIYJ¢Jå6o¼Gd¤ŒãÇ]?Ñ’Zmé’¨TÙ zdeŸ¦9xÈ•ACí–uþÌu›Ô‡Ñ12>@ÿ~aÓ¦—í2nÌc._.Àè±þ¬^뎯¯³gÕÔ©‡¯¯Þ¦ç ‡‡“'n¢V™lRT¾ývn“¾öeÍZw ´MWš™} °c‡))ê׋³6¾Ô­ǦÍZîÜUZSu¦m£bÅ’;úéÓRU*'0fÔ dÓf­µ·ì£ ­Û 0žý{o[{G¹òÙÀ@~?éÌšU÷­½Â–üìÉNìÚq'ÓcÀevŸfõœñ<ññ–}ÐHKó™”ÍÞ‚K—y “AçNÏOY™s†Ý{¶êˆŠ’ÙÍ—&»ç €žGÐüý‚+رÓN]òÓóã¾)zAý¿¹uÛ ¥Âþ8(PàÕÍ™^Z¯äƒ]©v°¨Ã2aaâVóuÓ¸­yìØ©%.NƆµ÷(SÆþº9w¾K~ö$6VŠLfF­6[ïýÒKëá|ç®’rå9|Ä…O? gÆ,oîßWž:¶ªè'‚ ¿Utt W¯^s8Ï Ï~–¢7ÉÀÏúɦÍ[8tø2™Œ ÊóA‹æ´iÝê…=Á2kÏÞ}|?cmÛ´â“^öŠðpËßÁ¢ÚÁC—öâ!/rÊ7S¿åç¥Ë=ê ºvþÈ’Î3*Šq&ѹkw/Z@­š¶=« C†ÇKL´ý8àßOŸFË͈ŠŽæêÕkü0s-Zµá§ònµª·SŸ~ýùûïK|óõ$Ú·kk3?m+V”±£GY§W©\™1£¾`À !lÚ¼…χ @©T ×[Ú-=ÜÝ©Y£ ¥%³OrŠåoÈ´@^zŽ‚×R©³ùå³»¤¥ˆtw×=·\×.9xè›·låôé?)^¼·nßÆIéDÝ:µ9pð..Oƒ¡_ŒCñbÅìÒºæ4£ÑÈŠ_VR¸P!jT~Pg¶lZOBBçÎ_`ùò_غmË—.¡p¡B™\ãóë2~âW¬]·žvmÛðõ¤ H2шçáay<"2RðÞP¢UåÿXFA¼ÌïÀÒ@ìâbÂÇÛ`×ÅÇÇ@Þ‘©S‚(˜zîÛï7™sfœøWI©T2ù«‰Œþ9ÇŸà÷“§8tø£ÆŒcÇÎ],_ºä¥Sè]¾|…a#FR©RE¾ž4Ña…Âò7mÚµø¬_ßç–yÕ"##Y¶|µkÕ´Ž%–^yÓ¦|Þ½ûXøãb»ž»»Ž½»wek:­–jU«°äÇETªú.ß}ÿ›7®·)sóæ-z}ò)qqq,ûù'ªU­b·ÏÔÀ‹£öÝ åËOÓlx{{ó÷¥Ë$''S²d –.ùÑ:/,Ìò÷œ÷kÙîiÒL/ŠÊår–ý¼˜-[·ñûÉS˜ÍfºwíBÛ6mø¸Wo<<7Ž¥{j¯“Ro%qð +*ìÆ]KKS™Ö“ªpádœœÌ\¾¢²«cT”Œ‡Sb¾ Y­ËÛ©c¡]¾¢²ö¤Ió÷%•M™ôz÷zqM¡0SºtçΩ¹uËÉn»ß»¯dð@† ¡ú»ñœ?¯fÏ> ÍÞ‹± ¥¥òsô¹2++û4MñbÉŒýâÞA+HÑK˜<Å×fzZOÈÅK½~ÉK—UÔªGËöÇôÔi>lÝæÆÐÁ!H¥P¤H2J¥™‡íopR·¹Zýô{úà%˜çhÜ9_Ë´‡T© OžÈ‘ËÍìݧaï>]ù7T|5Ù—!ƒBmx™Ý§Y=gd$%E¾\]M”yÇr\—z; ¥ÒÌ_9c4³nÞ¢å×ßܘ0þ1yž'ïØqW’“%Ô«÷ÂÏUaarΟWÓ¨al†½è²zÎØ±Ó Ô jwÜU©œÀê5î\¹ª}Zùò= Û_K\]-C)Ø@CÕ* ¸¹©W/Žƒ‡4Öý/x‚ ‚ ü¿“J¥F»ñ¢ž< y‰¥¾^Z77š½×”fï5Åh42fìx6lÚÌÿØ»ïð¦ª7€ãßÌ6M3º7C– ‚¢€¢‚ QQ@ܸQ\ˆ8qý([Å…ì "{UTÊP‘U(£{¤{dýþH›6M:)Cy?Ï“‡Þ{OnNî ç½ï9[~ÝJ×+»4z½ééé<ôèÂÃÙøùxÔjßÍÎqq±( JJJ¹ä’‹Oë¶8vü8‡ƒèè(¯e:?ƒãÇŽŸ”Ï6  '%yÌß³çî6œÀÀ@æÍEË-|¾¿uëVhµZŽ;浬¨¸¸ü;TipÁç³vÝzöìùÇk»ïþóOw™S)¸|X§ììlBBj¦©ÕjîП;ô¯üžEEìÚý§GöÛñädt:S¦~áñþŠ@ÕªÕkX·~çž{î ðÖ¬Y@×ø\žž‘ÁwßÏ ]Û¶ôís“Dzؘbcbøûï='T‡¼¼|† ΃˜4á3zö¸¶AïÏÎveAšëÈ‚§ŒLx¨âùûû58xÐç¦]ñ“kz¶æ³ ¡^õœ[ž=ש£÷ØfõQ‘}÷Àðln½%×ëÕ·O©©~Ùâ„×ÏÏI¯žùlùUϾýžY+V¸ð­zžÆƺ¶ÿxMµc‡k^Ew°W\^äs›Wlçk¯Ég÷Ž½Ü?¬q}Ÿ7ôšá‹Ý®àõ7#IOW3øžwWœz½ƒ{ç‘‘©fÖlϱ>ÓÒÔ|øQ8ÿìõó™I¹í·€Ú‡µùýº×ÝÐkÆ¡ÃZ¾þ6˜¥ËŒ^ëª~^Ûí®,áŠím·+ÈÈT»ìee®éÒFv=*þ[ pÔp  .íPÌo¿{ß ”¼ón„;à,NŸ_H',ÔÆ[ïDž^ÙˆâpºÎñªÝC;ðíw®û·Ãîy hÓºŒ´4 ëÖrÝu®ëO¯ùlOÐqð –ÈH+¦ZÆ B!„ø/0 Øív’““=æ¯\µºÎ÷VôHãtÔ/[¯";ÉQÏòµ)++cüçX·~ƒÇ|•JÅÕW_¸Æ[k¬ââ|ä1JŠ‹ùbêäZÇ 4 \Ú¡¿ýþ;GŽxöQPPÀ;ï¾ï(Ug·Û¹þ†>\Cöü³÷„·KLt4J¥’„„^Û9)é‹…¸¸¸þ_6mŽÇb±ÐªU+÷¼ôŒ †?ô:³g~_cð\Ý]öêÙƒ-¿neßþýËV¬X TfâÜÐûz ³æxfûåçç³tÙ´kÛ¶IºrlˆÈÈHRÓRk-÷ÓÊU ¸ó.¯}þÅ—Ó)--¥¿ÛÝóìQvïøÃë5iÂgŒz~$»wüÑ$cãmûýwŒFCmíFƒé_ËGŸ|êu~¥¤¤räèQ"##êóQ>Ùívò)þÙ»—/¦Nnpð %5ΣÁÐà÷ŠSC2ðÎíÚ¶å¥_@çßð†´,Ìšeæ7#ÈÊTsùå…LôãÓñaøù9y¸JW‹ç´,ã±G2ùlB(ý¶àÞÁ9˜MvÖ­ dñRWv)dÐwù6mJ¹{P3f¡Q;¹ý¶\ò TLœBNŽŠqo§xÔ噧2Ù¸)¡Ããxê‰L¢"­üº-€‰“B¹üò"®¿Î;¶g?&†úün~~Nî™õÍwAê}ÿ8êÖ­‹/*np]T*'/ŒJç¹QÑ 0Ž¡C²Ñj,Xh&>^Ïãeze«5Ä€þ–,ue*¹åæ7æáçïdçNS¿A§sp× Ê1¿þúËß##ïÏ¿\ÿ±]‡ZíjÕ µ¹3•ºOO¦†l€æÍËø|b(=ÇóP(`ÆAlùUÏs#Ó=º,¼þº|Úµ-å˯B(-UÒãÚ|¬e V­10™óÏ/áæ¾¹ ®³Í¦`ÉR#áá6:_Qè³Ì­·æ2ý›`.4Ñ­««Ì³Ïd°is ÷iÆÈg2hÖ¬Œ_¶è™25„–-ʸåæʺÜ;8›yóM¼öz$*:t(¢´DÉO« ,Yfâ²K‹éxW¾4ôšQá›ï‚Ðëdg«Ø¸)¤$-]¯,äÉÇ=Çõ|:[~ÕóÆ[‘ìÛïGç+ŠHKWóÅ—Ádg«˜:ù˜Ï,¸ýûýP(àœsêÎ&©ï5£Â¾ý®@Gm]†6ôšq× sæšyëHRS5tìX„Õª`Ýú@fÍ¢uëR®¾ÊuŽ¦¤j¸¦Gk÷¸xïñãöþ-yåå4† Éfã¦@Ë'§oŸSóP„8y¶'è8z´2¸Vh[µÚ€Éä ¶„‡ÛèÒÙ÷õ&Èl篿ü™öE&“µÚI§ŽEÄ•ùŸ™Îàûšqß°f¼òRmÚ”’”¤eüg¡üù—?7ö–cèt3íŒyÕ5êè1QLìj$¹ìÒ"âãõ¼ÿa8Ï"+[Åä©¡t¼¬ˆ?¶ëø#AGz†š°P …ëþ>k¶™âb%וwÿ{é¥Eèüü‹þ¤<ð „Bq¦¹¼SGVü´’±o¼Å@¥R²xñRRR\'5?€Z1¾Ô_Mçè±ãh4ŒF×_׫Öòo½ó.çŸw.jµš–-[pi‡4”V«%>þfü0“×_Cûö V©9pàã?Ÿ@hh¯¸Ü]~{BGVfvUÚV­^ƒÉäzp4<<Üݵã+¯Žá¯¿þfè}÷ràÀA8èõùÝË…Ï|†Á÷ å¾aÃyå¥hÓ¦5IIGÿÙçüù×ßÜØûú¿Kâ¡C”ž@À±Bpp0ú÷cÎÜy<3òy†Ü7˜àà`ñáÿ>F©TòЃÃOøs6lÜDF†«·§ü‚|öï?ÀÚuëñ÷÷gÔs#ÝåÞ}ïÒÓÓéßïv6lØès]·ßv«»‹ÑgŸyŠM›ã¹wÈ0F>ó4ÍšÅñË–_™2õ Z¶hÁ-7÷u¿¯m›6 èw;sç/ÀÏÏŸz_O~~>“§LÅb±ðчïŸð÷l¨Ë/ï`ëÖ߸ª[·˵k×–¿ÿÞÈ'ždä3OΆ ™öåW\}U·Ï¡úHÏÈðØÖ…E®ÿ×=z”9sç¹çß1 ¿Ç˜rv»ÄÄC\xaûÇšó÷÷çчâãOÇ3xÈ0†Ü;˜ðð0Nbê_bµZ>lh£ë2oþ~Ùò+:\BRÒ.S+tíz%1Ѿ‡çÉÌÌâàÁDºuíZ¯ñòÄé!¼³Hc‚wàê¢ñ믎2fl$&…º³™Úµ-eÂg©´mãÙýÔ“„†Ù˜49„×ÆFº×1øžF=—îúTój¾›Ä⥮'tBCm¼ùz*w °x”mÕª”o¦áÕ1QŒ|ÞuñQ«]A¨×ƤáëZóç_þî SuƒÃ+€7í‹j w¸ãZ—ÛnÍ¥¬LÁGŸ„ñÐ#qîÏêɌǪ/¥¦M9Êÿ> cî|37lgÌè4î»7Û£ìçŸãÓϘ=ÇÌâ%®m®P¸ÆÊy~d:ç´¬ìJkí:ƒWÀâ%&÷{/»´Ø£«Á†ìÓ“©!ÛàöÛrIÏP3yJ(Æ7s—­lT¥Õ:ùzúÞ}7œ™³Ì|÷½+Ã+ ÀÁ,¼8*½Æîk³~C YYjî–MM]Ï·¿ „V­JYµÆ@A’À@-š—ñý·IŒ~5Š—GG¹¿ÿUÝ xûÍTü«tu{NË2æÎ>̆óòè(*2óósÒ¿Ÿ…—^LçTÞ·zÍ€ÊóT¯wЦM)÷MeЯn~#"lÌ™u˜7ߎ`Öl33~pí§6mJyoÜQîS«ÊÊV¡Ó9<¶[Mê{Íp¯;Ëuë ª=S¥!׌°Pß}s„ÿΤ)¡Ø'ºækµNÞaáé§2d,²³ÔŒ*×áªÞx«ò)¿«ºÖÀûZ*ï}ΧŸ…a³Ã¡àÝw’‰‹s=Щc_N;ÊÛã"xtD¬û}í/(á›éG¤ÛÖ3Ä7äѳ‡‘µë ,\dâöÛr>,›]»t,XhbÁB:ƒaC³yæ© ÒÒÕ,Zl¢ëUmØ•°Îu­-*RrñÅÅîZT*èÞ½€ÅKLÒ}¦B!Î ƒîÈî?ÿbá¢Ålظ …BÁ ½¯gÜ;orý }(-­ù7ÑM7ÞÀÖm¿±fíZ¶ýö;v»¨Èȃ=ú0Ç'³`áBæÌuuÛyÛ­·4*€0iÂg¼úÚXž~ö9l6×ï9…BA÷«¯â³O>F¯×»ËΘ1“ÅK—y­ã·Þvÿ}U·nîÞŸþÀ×ß~Ç×ß~çõ>³ÙÌï[qOwêx_N›ÂÛãÞåÑO¸ç·¿à¾™þ:\rÒ÷¥û;CË-ørút–ÿ¸Â=¿Õ9ç0á³O½Æ¿kŒ¥Ë–³t™kÌJ¥’/§M¡¨¨ÿÓ;&ãÙàåG1úå%x÷/!˨èy}+iVïÏ(-•¬Aqfp:OÞñÿ³žž×·âƒÿ…7ø½_M¦çõ­8p@âlò‹Ñô¼¾•ûõäÓ±§»JB!„B!„gÉÀ'Õ­ýZz<Å_]Û¶¥|>þ˜×ü'ŸŽaφܛMǎŨTNòó•œÛ®Ôçz4'½zæ^s†€Ãóšùîû ÒR\¬D¯wÐá’b{$“Ë//:åÛç¥W¢°Ù|ð^ò)ÿì cÆFòë¯zúÜ”ÇSOfx,{ñå(Ö2뇤F­{Þ|3S§… T91´:§”k¯)àº^ù(›è‚“±Ziä£Ãj-3{æa‚‚–ÕVÕ¯[øìó0¶'è°Z„†Úè{SO<‘‰ÉØøõVf£WÏ|.8¿¤É¶âôعKÇó£¢é~u¯¼œæ³ŒÝ®`ÀÀ(•NæÌJB¥jxöìèWRÉÏS0xHóÓýµETüîzéÅ4®½¦ÀcÙ}Ïáªn…¼übÏŠf×._L=J³fe>×5wž™i_„ðЃY èoqÿ^¨ P€Ÿ¿ƒfqVn¼!›nÌCQó(?˾}~ÜzK.#ËôZþÕô`fÍ"$ÄÆß'y¬çó‰¡,Yb¢sçBÞ›zº7±B!„BqÊHOÔ(1ñ͚šV7þ0ILÔ¢TBïëó}.õn4ÊÊRó÷ßþôèQÀèWÒêút:“'«µÌû†óÅ—!\Ú¡˜QÏ¥c4:8˜¨eÆŒ †oÆwß$q٥ŧp ÃŽ:Î?÷ôVRR4$ÒòÅWÁ ’ÙT8JNÖp8IÛèu[,*iéÔ±ˆ˜+‹Š5k Ì›oæÒÅLžx´ÁÝ:žªí˜—§$ñ–K.)朖¾7ÕêÆw+¹r•'ŸŽÅßßÁ-DFXùc{_Ìö?|Ÿ„¿ÿ‰w[yñÅÅužBˆ‡ ÛSX¤dö\3Ï>“NçÝ­ôæx=»ÿôgà–FïZSyÍS(¤ûÜ“ÄD×J&…zðýhÛÆõ Ô¥ŠY´ØÄ’eF÷P˜9ËÌá$-]¯,*/ÜÜ78!+GÍ–-ü´ÒÀºuüïCïiÖòÓJf³ïgñÈÙ¨Tže²²Ô$Ò’xHËÖmt¾ÂõP•Ý®à»ïƒÈÊRÓ¼¹ï{±B!„Bñ_%¡ ^Hˆ÷ß­;3jçNéjRS]Ÿ¥T8Y½ÆàQæŠË‹0VÉLÚ´9УëÁ€‡»¡©*«UÁ÷3‚9§e?|Ÿäxé~uwÞÕ‚ Cùê‹£Øí°~ƒ“ÑN§N¾³òþÙëÇÑ£®À”Ù\YK®Šß~ -MM` ƒ ۗЪ•wÖàÎ:RRÕ<èGPÝã{†„ظ´ƒw Ñé„ß~ àÏ¿ü±Ú´h^F÷« <‚1”gFÆðÍô#^ëÙ¿ßí :,¹*"#lté\è3»²1Û±´TÁÆM=ªA£Ö­K¹²‹ïïÐï¶\î¾+‡Úüö[–\ݺúlP?rDËÞ}~´n]JËe”•)36¥Òɬ’8Ï|ÌâÓña|6!”fqÿ°lãªM›RZTkÀLHБ£¦gÊ yQ‘’ŸÑ{”‹±rÞy59sóTlܨ'7WEóæÖZ·‰âôP*á¶[r™2-„µëéÛ'Ï«ÌÒ¥Fú÷³xÌ/.V²i³žÃIZ4j'íÚ•Ò¥sá gBoOÐaÉQÑ£‡g°(7OŶmîëÀ¶mèõÂÂm,[f$.ÎÊu½òÉÌT³t¹‘Ð}ûxgqefªÙ´YOZšƒÁNç+Šhݺ´¾U<ëDDØرCǶm5ö.зOo‹`É“Ï^R’–]»ut½²¨(ϱ…_x>ÈÈÊy……JÝÝœÅKMÜ;8‡K.ñ¼÷ΟoF¥ròÒ i¼ðR4›6zÁÕ›B‹eÌ_`vðÖ­$/OUãƒ4B!„B!Ä™ðD­öîÛÇ7ß~ÂA¼ú˜4%„5k+0kÖ<¦Î?Ä…í+C£^Œ"3³²^Íš•±nõA¯u*))QЬY™WÖÔe—óý·IîF• ¾ü*˜»tü¼i¿Ï.Ÿ~6†Œt5?oÞïž·h±‰1c#ˆŠ²’Ÿ§"=CÍ­7çòÞ»)Ÿ[õ»nÛÀ¶mîeWv)äÛ¯=ƒZÙÙ*y,Ží :¢¢¬èõò#,ÌÊÔIÇ8¿¼{D…Ë}÷f³x±‰2«>‡ÏÇçÙ‘ÑØì ŠŠ”|ýÕ@§¿ÎÁõ×åñíwÁ<8<ÛgJ©„©ÓBØž cíªƒ^OÂ[­ x8§íRFãäé§2øëoÖoäí:wæ£Ó ¯¾ŬÙfLF;!!vŽ× R9yo\ 7ÝèÙXÝÐí¸g?C‡Ça±¨‰-£¸HIz†šŽ—ñÍô#øù5.ÓdS¼žI“C÷v w °x-k\ëÖ2îa6Ç’•å:6Ϋ–9øè#™(”N é~<:"–çF¦óÈCYåÇÆ/[ôìý{{^JªšGGxŽYuÇ ãÞNñYÿ¿þògÈýÍ°XTDEYÉËSÑ¢E—]z껕BÔ®_? S¦…°d©É+€W\¬dÕ-š—yd”'$èñD,YÙ*Ú¶-¥¤XÉ¡ÃZÎ;¯„/¦%"ÂÖÐj¸}òi¿ÿÀß»ÿñ˜(QË£#byæ© w—‰#Èlgß>?róTää¨øä£ã|ôI*²³U<èÇÓOUvçM4•ø/«âÙloà«O?>ή„½,˜w€û‡e³+a¯Ç«ú8^ë×t/‹‹³Ö¸n³ÙNx˜­ÛØZ%ÈS¡óE ˜C‡dSV¦`Þ|³WÙ„øqÇwö[a¡’—GGÑýê~ߺ•?&òKü~>ùè8‹—šX¸Èäõ]ׯ9@Ÿ›ò<¾ã´)G½>sÔ‹ÑìØ©cü'ÇÙ¼á?-OdéâDì6=KY™«S©t½æÍ73ë‡$fÎH¢¸Xɳ#£™;ç0ófÆé„U«<£……J~( ‹EÅÜyÞ߹ ;]™h󘼖­^c 'GEÿþ¹õ „õ»ÝÕ(¸is`åþÜȬÙfîèoaÛ¯ûYõÓA6­?@H°Ñc"))ñl©mèv|é•(ŠŠ”,]œÈÚUù%~?Ï?—Îï0ý›à:ë\“;ZP(ð¹íÒ3Ôlܨ§ý%\|‘«Qs×n:vôÎÔj<ùx¦»›³Æ8§e™{;¬^y°Îò/¼Mq±’ï¿Mbó†ìøc/×õÊgÖì F×Aqr´:§Œ‹/.fÓf=‹g?„kÖR\¬t__Á• ÷ðcq(UNVÿ”ÈÒE‡X½ò S'eß>F½}Êê®V9Ù´9á÷g³yÃ~‚ƒíŒÅ£g¿q?6V¬¬¼?íÜ©cô˜(.º¨˜øûYºø[ÙÇ{³ùîû fÏ1ŸîÝqF*+S0ô¾l6n 䟽~5–ë_œ[¼Äûž¾l™‰À@½¯Ë£>ÒÓ]¶êÁàøŸIOWÓ÷¦<´Z'×_—ÏÚuróT^ëp8 oß\Š‹•ü¸ÂHV–š ¹ñÆ|œŽzUC!„B!„øO‘ž¨— â)Y¶Üèó•“SÙ€ãçç$ ÀáWШ]ÓU_Õ»úÒé*—Õ5Nϯ§bµ*¸çÞæÜÞ¿%ã?e{‚»!Ø®ë•Ol¬•™³Í8«­vÎ\3J% ¾»²[щ~”•)¸ì²b´ÚÊ7ôí“džu¸ý6Ï'Øýüœøë\åÔ*ÏïY=ø•xHˆ®®Òªf µmSÊ£dq츆õ*ƒ` ´nUJ›6¥\p~ *•“fͬœÓ²Œ6mJÑ餦y>Én·+¸°} W\^Ä—_c·ûNi¸éÆ<ŒF; šqTkL›3׌Bwª½»É ­Ë»Mª2Æ^ófVƽ“ÂãgºÇn µÑ»w>yy*òlˆlÈvt:ᡳøà½àؽ÷¸ê»c‡®^õö%6ÆJ·®…lOБxÈsÌÀùóÍØí î©r¼¤¦j¼º%k* îí «c½ýûýøg¯7Þçî²L¡€ÇË”ñ†„8Cõ¿=›MÁòFùK–šP*ñ¸ç,Yb$;[Åðû³iÖ¬òœîqm={äóó/úë´! W¶ö-7çâïïäÜv%*éSÜ9ÿ¼ÒÒ4îòÓ¿ Æá€wÞJqwW­RÁ £Ò ³ñÝ÷ðâ¿ÌáPp×  S§…ÖX®[×""l,_nô¸§ïþÓŸÄCZnº1¯Î±Xm6K—™9+ˆfÍʸârÏî—çÍ7áççä†Þ®ß/}ûäRV¦`ùr£×ºœÎòõEÅü¸ÂÀÊU´Z'7ÝP¿ ¢B!„Bñ_#ýшzklwš™™jž~6Æç²Y?$Ññ²SÓM_¯žù¬XžÈ3ƒX·>ñŸ…1þ³0‚ƒí ’ÍCf¢*'*•pßàlÞy7‚øŸõ\UÞaQ‘’å+Œ\Ó½€ØØÊàKóæeèt>ÿ<k™‚׸Ǿ‹9± Íöí®ŒÁ¶mKÈÈôÜîcíÜ©£÷õ•c 5kæúL…t:'•up`µúÐ=üP÷?DzåF÷˜uUùû;¹íÖ\¾ý.˜Íñt¿ÚÕÖñd ¿lÑÓµka½ƒ>z‡{›VhÕª”V­J)*R²ûOòóU8ì›ë*“£ª×º}Q(\H§Ó5&]ZššÒ28A­v’“ãû˜ž;Ïì3k3,ÔÆèWÒÜÓƒîÌas¼žyóÌŒz>p5FÎoÂh´{tuW‘IX5ÈøÆ[=ZÙˆ~Þy%<ût'[EvÆEzwi‡böï÷kè*…'YÕñËî)£ÓbQ±9^O—Ξc–%ìp]¿|Û©c«VؽÛßk|Í“%8Ȇ¾üú¯Ó9 t=lP1]õþ´=A‡ÙlG¯wxÝÿÎ=·„Íñ®ŒC_Ý>ŸíÜ=(‡/¾ áÙgÒ}þ©:¦â–_õîcdÉRWF^õq+ô¹¹%Šò[w^ž ‡ÎmWʧŸó¸¯åæ©X»Î@ÏùºöÑ•]Š¶3¡©ÆñeûõËåq”–*é}}¾ûxB!„B!Î6À rààA’“ShÖ,®Þ2ë‡$ŸËBBNn·œÕµlQÆ+/¥ñÊKi=ªaízß}Äÿ>ãè1 ï¼U9FØÀ;,|úY?Ì rð–-7RT¤äÞÁÙë5íL›r”W^â½ÂyïƒpÂÃmôê™Ïû²iuNãF³²]A«ÿ·ÿ ÷Y¦úØ0U3 Ï@‘BN§ïÞÕWpn»R¦N ñÀ¸ëN ß~̼ù&woî\WFÞ=wÕ/û\Ýv sJÆŒâÇl6Z­ÿšŽ µf­·ÞŽàØq J¥k;i4Nl¶š×Ÿ’ªv×µªÜj¡½zjcÑb#ŸMG¥‚_·ê9rDËÐû<Ç (ÿ»´´òs33Õ¤¦ªq:ü³×ÏcÙÉ”›ë:¾LfïTÔ ó„§_Åøe?®0r츆Ø+ËW±Ù^c–e—ßCÂB½ï·ÁÁöò2§îç . úýÉsºjÖ{V–šÒR]º¶©q}YÙ*bc$ÀãË!ÙLÿ&˜/¿ áµWS}–©:¦b×+ q8`ùr£×8ŠUÝv[.z½ƒíÛøuk/<ŸÎƒdy•[ºÔHY™‚ž= È«Òeæµ×0‰ÄCZÎiéýûèæ>y¼ýN[·ðý·¾? !„B!„g à‰zS©T roƒ‚wJ•“ÈÈ“ÓUà‰ˆ‹³2ô¾lúßnaÀÀ–Ìgæù‘é¹4ôïgaÆÁ¤¦jˆŒ´2{®™–-ÊèÖÕ;“¡óE¬]u?ÿò'>^OüÏÌžÄÜyf¦N>ê6”VãjÍñX&×v/ðY¦¢ÎMáÁ²ù|4ë7º3«jÓ¦”K;³f­‹E…Ñèz’>2ÒJkóëý9¸2»ªf}¼úZK—¹û®ž}:ÃÝeÚä)!|øQx½×íËÁƒ~Œx"–ß~}„ÎWº»d=¯ý¹5¾ïÉÇ3k̨J¥r2`€…I“CÙ¸)×0g®€»ïö|T´ë|8ž\ÙUÜøOŽ® Þ[ççUpÖ=Ü`­åqB_ã •5QàTÑôú÷ËeùF–.5ñè#™,[fô9fYEwÄc¥VUñp‚Zs‚M°JƉÑ`gÒ„c5–ñ˜.áa6n½%—¹óÌ<1"Ã},TU1¦âÊUÞ«`{BéêZ3ÀžMd¤•œ×ßØŠ¯¿ æÎŒFÏß"ã?7Ê÷8‹ šyîÙt¯ùF£{îÎaÿ?®¸üÔôÒ „B!„Bœ‰d _ }õÝŽfž+ùºü˜°7Al±1Vºu-ds| +W)-UpÏÝÞÙ{¯($6ÖÊê5÷tµ1\•«:F¸²OlŒº Îw}·u«g0±°PÉ–z…§žJ·ßšËßû3§¼c_÷§îW¹2·—•_G+8ðã z½£Ö±hŠÚ³é ;v;$W ®\e8áïxM÷¬V‹—½–}>1”U«Oü3þëÎiYFÏù|?#È}¿¬®oŸ<üüœ¬ßÈú ^ã(ÖæÖ[r¹ª[!ó˜Ø°1Ð=¿"ûîáÙÜzK®×«oŸü(œáÆñØ#™„…ÛHHÐñÁ‡á(®:6¥A-L˜Êž=þ>÷¿¿“ÛnÍeÎÜ ôz;×õʯµ³Õk9vLCQ‘’ßÿàí:b¢­|ôáqw…:\R̯[øúÛ`®êZȾý~|üIwÜaá‹/CزEÏ…–`6UFJë»+²Þ¦~B\œ¥ÒÉ‚…&ŽÕÒ®m)‡µNÒi=¡ŒŽAwæ°9^ÏgŸ‡nãº^ÞÝžªTðÖë) (ŽÁ÷5çáY´h^FJªÆÝ m4Vg-[–jcÅOFºt.ä¢ KH<¤å£OÂ8ï¼öìñw—-*R²zMe£vÅwGŽh=Ϋ¯* (ÈN³fetêXÄÆMŒÿ,Œ[oÉ%3KÅ{ïGeó·Hqf©¿lâäÐÇ,»æš:u,bÆA´hnåúëòÉÏW2eZGŽhyqTº×ƒ U™íüõ—?Ó¾Ád²£V;éÔ±ˆ¸8W€çòNE¬øÉÈØ7"yâñLT*'‹›H)Ïî;‘ü¸û‡f3o¾™×^¤¨HI—ÎEäå)ù~F‹—šxÁǽUx{øÁ,W·×¹*:\â}ŒTŒ©¸d©kœßgjé>Ó—7ßHáÆ>çðÊ«Qü´ü :“%K„‡Ûè|…ïîÃo½5—éß³p¡Ég·äB!„B!„ž¨…Z­n’Ì;K®Š?­¹ É×4*€÷ú›‘>3ÏF>_9ÖÊs#ÓiÓ¦³ÙÎß'ññ§a,]fbþ‚Ê@FD„çžMçÁ²|~N—Î…´k[ÊÞ}~Ü;Ø÷XhݺòÞ¸d>›æ~ê\có¼8*á÷û^÷¸·Sxéå(Þx«²ë©ØX+}nòÃ葇³ðów2yJwßÛpeÊuï^Èk¯¦b04AúX:ƒ{îÉ©5ðz×¾ý.˜’5ƒï©}Œ¸ŸVùi%øù9‰-㑇²xà,@ÀØ1©Œx2†·Þvmð0c^Mãê« Ø°1©_„°u[óçnðvìÔ©ˆÇÍdÊÔPú hR ×õÊç$óã ¯½E¯ë[ñå´£t¿º€ÆêÕ³€ð0Ç“5$ÄÖ à‡RI½ÇšQ*]™eÿu5m£±æFáúnGÎÁ9-˼æ»Æjº€XC„‡Ù«û˜Q( 2òäì…Ú¶)=-ß_qjètZµ:9ç¹Nç Õ9e'¾¢  ¹F !„B!„âìñߌÐq‚ •üºUOB‚Ž/¾ æšî\{Mã»UB!„B!„B!„¨/ à áCF¦šGGÄ¢Õ:¹¹o¯½Z¿ì;!„B!„B!„Bˆ%Øäõ™01”¯¿ æ$së-¹§{óœê»O{ßÔŠ²²ÊÞcfòìÓM^ŸÒR~~Ò­ju6›•Ê‰BQ¿òee 4šú—oˆ‡‰eÏ?þÄo<@ddýùv»‚ž×·¢WÏ|&OQ  HNÖ0ôþfµ–yù¥4®é^à5¿>û`æŒ$œ8˜¨å…—¢›´þ[·0iJ(»wù“›§B«uÒªU)÷ Î᎖Ӳ=¯íÕšÕ?¤Y³²SþùÊÊLÿ&˜™³‚HNÖ V;iÙ¢Œ¡C³ÐÏâœ+,T2ab(K–IMÕ Õ:9ÿüž‘I÷« W :_QDLŒÉ’ÿM;wéx~T4ݯ.à•—Ó|–±Û Ø¥ÒÉœYI €Œ~%•ü“Nç}/Û¯g÷Ÿþ ¼ÃÒèì¥VçTÞ› É€ú7iÈo†Þ£Oö}qÎ\3/Ž¢Õ9e<ýTZ­“Í›õL˜Ê–-zfýp¥ŒÞ-„B!„â,"O©p²zçSäW\^„ÑXÙ˜´is ¥¥•é>º^YXëç<72Ý£q²&ÇŽkسÇßcÞ…íKjìšoÃÆ@LF;:ãtÂÚuÐâçï¤m›Rw½öï÷#-MÍå—±h± »]A¿Û]YKK—))UrsŸ<ŒF;µ$&úÑ¥sa­Ož¯ßˆÉdçÒÅîy™™jâÖ“–®&Èl碋ŠkÌ`¬oÝ+8ðÛoüù—?V›‚ÍËè~uþþ¾z/¾¸¸^Ç@c÷iCÔ·îÓ¿ `Æ÷IÄTƒoÀ€\®ëÝŠI“C|O6þþN¶m /_Ekó}6.¦§«Ù¹KG«V¥œÓÒóØÛ¹KÇÁƒZŠ‹•DEYéze¡W—dùùJ~ݪçÇ®óáç_ôìÛïç^Þ©S‘Ïqÿðcë¶òòT„‡[é~u!¡ÕÆxÛ¶-½ÞAX¸eËŒÄÅY¹®W>™™j–.7b£oŸþßq÷z† Éæ¶~-yóízöÈwoÿí :,9*zôðÌÌËÍS±m[­[—Ò²Eå6Üý§?©©²W_UPk·n;vèøó/üýtéRH¤Œí%þ%”J¸í–\¦L aíº@úöñ~/]j ?‹Çüâb%›6ë9œ¤E£vÒ®])]:žp@¤!çlC¯723ÕlÚ¬'-MƒÁ`§óE´n]Zß*ž•êû[ênÈ}ñ·ß°äªèÖµÐg ùÈ-{÷ù¹»Þÿ œ¨(+óçrÿæz_6=ǺuìØ©óø#„B!„Bü×IOÔè`b"ë7ldÈ}ƒO8ˆW“¦„°¦J·OkÖ<¦Î?Ä…í+£^Œ"3³²nM9Þ¦MŒé1¯¶1ð>ú$ ‹EŪyè‘8~ÙR9~ÐUÝ ÝA¨W™5ÛÌ•Wÿ³ž¬,5‡kIMU³í·23Õ,[fdæŒ$~ÿ=€W^bú—G¸ª›ï V~¾’Žc@‹»akÞ|3cÆF¢TBt”•ŒL5J† ÍæåÓ]w€ìl<ÇöQQVôz‡ùfeê¤cœ~É m÷“¹OR÷¬,5:ƒè(Ï€­ÉhçËiGÐëhµ® Ñ/[ô|>1”©“ÒãZï.!'L eÆAÌŸsØ=¯°PÉðãøýb¢­øù99v\ƒ^ï`âçÇèÔ±2âØ1-ŽˆuOW?.gýDÇË*ËÛí0öHfÎ Âl²eåp’§SÁ›¯§pûm•ÇðÇãÃ2ÛÙ·ÏÜ<99*>ùè8}FAŠìlúñôS•ã Þ?,›>7z\p~ ë7RP Ä\žµ±p‘ €§ŸÊðh”·ñÆë©*=æòi¿ÿÀß»ÿñXÿ¡D×6xæ© F<–éžÿÅ—!,ÿÑèQ¶¶1ð^z9Š¹óÍøû; ±ñêk‘¼þZj“_Bœ ýúY˜2-„%KM^¼âb%«ÖhѼŒË.­ t$$èñD,YÙ*Ú¶-¥¤XÉ¡ÃZÎ;¯„/¦%â‚Ø 9gs½™3×Ìo¹®y-[”’’ª!7WÅà{r3:õ¤Œ§)|kÈ}qS¼žI“C÷vŠÏ ÞÁºuÌŸ{€üƒYhݪÔë¥Ë;±n] ééòß!„B!„géˆFÔjï¾}|óí÷Øl'?CåÓ³+a/ æ\A‚] {=^T ­_sн,.®iǧ»s Å½îqo§ÔYþÜv¥$'kx×0uÒQ~ýy?kWdô+••Ú‰%WNØúË~z\[Àì9f4'¿þ¼ŸzçñÛïde©iÓÆ•ap0ѯÆÏÝÀµ¬][WYK®ŠÑc"iÙ¢Œ_6ïgÕOÙ¶e={äóÕô`t®;À¨£Ù±SÇøOŽ³yÃ~ZžÈÒʼnØm {<–²²kM=™û´!uoÛ¶”¢"%Ó¿ÆQ-yàÂö%œÓ²Ì¹rÏ=9h4N~˜äõ™%% –.3raû.¾¸²A}Ò”Pvè˜?÷0×`ÕOÙòó~š7/ã¹ç£=>³]»v%ìu7‚.[’èq^\ÚÁ³ë³¯¦‡0sVÆd³uË~–.>Äæ¸ðÂb^|9ŠýU²÷Ô*'›62üþl6oØOp°Ñc¢xôá,â7î'"ÂÆŠ••ôóÏ/áåÓ<¾ ¸ºbûg¯a¡6wð®¬LÁÞ½þ„…ÚhÑÜ;¤WÏ|n½%·Öl¹º|ð^²{;ô»=·Ö²«V˜;ßLlÿm/Ö`å‰|]žU"Ä¿A«sʸøâb6mÖc±¨<–­YHq±Òã\ÈÍSñðcq(UNVÿ”ÈÒE‡X½ò S'eß>F½Ø´c‡Ö¦¡×›;uŒÅE¿Ñu-ÛúË>†Ü›Íwß1{ŽùtJCî‹wtõ,0wžÙk=éj6nÔÓþ‚w7Øf“çžMç¶[½¯ã»v»zC¨øM$„B!„Bœ-$€'êt¢A¼¢"%Ë–}¾rr*ýüœ8ð÷wµ iԮ骯ê]}ét•Ëšzœ•ªòó+ž(¯Mx¸kûÌ›oâ»oŽÐ£G¡¡6š7/óOW°ãæ›]™_TLa¡ÒIqÉÅ® eZšš6å]„JÔºßÿÅ—!Œÿ,ŒÂB×ƨÆ´-à9ðÞ¸Þ|#ÅÝݨFãdàvìÒ5ºî‰‡´lØèê¶í¦*XmÛ”òè#Y;®aý†ÀÚî'kŸ6´î#ŸI',ÔÆ;ïFpmÏÖ¼õvë7RTä}Ù µÑç¦<6mäØqÏîZi$/OŽƒ³=æÿóƒƒ ÛWÂLF;_L9Êâ…‡<Žu¥Ò•áVÑ-¥ÎßYëy1ýë`b¢­¼øBº{ ,³ÉÎØ1©Øí fÎ6»Ë*®ãñ–›sñ÷wrn» •ô¹)­ÖÉùç•–æù|ùø“0RR4<ø@åøG™jìvˆŠjÚ@lUZm嶨k¼¯%å] ¾úrªûœnÖ¬Œ'ŸÈ¬ós„8“ô¿=›MÁòžÙ§K–šP*ñȲ]²ÄHv¶Šá÷gÓ¬Yåõ¼Çµôì‘ÏÏ¿¸ºÕ<z½™þ+PôÎ[)îT*xaT:áa6¾û^‚ï§RC1Vºu-d{‚ŽÄCžÇ×üùfìv÷ÜSçg®ßÈŠŸŒôèQPï.A…B!„Bˆÿ é‹FÔKE¯1Ýiffªyúٟ˪wýw*Œ{7½Þ{<–. t§¥Ñë5•Ëú÷Ëõ¦& ©®ºTŒÃ¥+Ÿ¶Z ""lî ¼¤$-ﾎNç uëRnº1ÏÀ«ÈÀ ²së-®ÆÝ}ûýÈÎVa³)8rÔÕ€V5hÚкoß@Û¶%ddzãíÜ©£÷õùËvèxêßÇÀëcS}ŽßÖÔZ÷¸8+?­HdÖl3«Vøöû`¾þ6??'·Þ’Ëó#Ó ª¬÷ýC³Y´ØĬYA<72Ý=ö\3AAv¯®îÎ=·” yøÑ8î”ס×;ÜÔu옆ô 5=z]m_Û1ìÜéÄ ²¹Ï ÎA` Ã}\êt¬ÖÚ³*'N eê!ÜÐ;ŸaC+•%%®÷UÍ°Û±CÇ„I¡ïáùôS2žÕÞ½þ˜Mv¯ÌÎêŒBœéúöÉãíq,Ybâž»\A‹EÅæx=]:zÍv¸®}¾ÆíÔ±ˆU« ìÞíï3KödhÈõf{‚³ÙŽ^ïðºnŸ{n ›ã]‡¾ÆX;Û5ä·N}ïÑ ½/º3‡ÍñzæÍ33êy×}Ñ鄹óMvŸc8V¯çɧchÞ¬Œ÷ÇÕo]!„B!„â¿Dx¢ÞÄ‹±2ë‡$ŸËBBN~לÕ8è‡Vã©Ó¢Å‰5^VŒÃS5£ª6ºò:”¿Oëç¨:‰³|q›6¥ìÛç Ò­Zmàœ–e\ؾ˜µk¹éÆ<ô#(ÈNhhå¶ü|b(_~B~¾•Ê‰NçD©¬9;©¾uÏÊv„>ü_8þ/Üg™Ì,ïc#7WÅž=þ>ËÛ¬§f£ÆÔÝd´óðƒY<ü`–»q|æì æÌ5³=AÇÒE‡Ð”KçŸ_B§ŽEÌoâ©'3Ðhœ$%iùí·y(Ë+‹óÉÇ3ÈÉQ1‰õQ©œ\vY1·Ý’Kÿ~¹uf“Õø=˿úutY×Æ÷÷¬Ö^4×±àçç9í¬¡*v»‚×^dÖl3w °ðÖžãQU㥥•3KJ¤¦º>?=CMV–š‡ÊâT°äª0ùžhÐTˆSÍh´Ó«g>?®0r츆Ø+ËW±ÙôëçÙavùµ/,Ôû~l//sê~6äz“•¥¦´TA—®mj\_V¶ŠØ àU×ß: ¹G7ä¾Ø«ga¡6-61òÙtT*øu«ž#G´ ½/»ÖÀëÜyfF‰ä‚óK˜6å˜\§…B!„Bœ•$€'äÀÁƒ$'§Ð¬Y\½ß£T9‰Œýøx“oë†hlÝ+˜Ívnî›Gß>y<÷|4‹—šX».zWf’͈'bY¹Ê@ß>yÌ™kF¥‚»ïòî&L«uòö›)Œz>øx=¿lѳ~C /Žbé2#ßL?âÕ5f}T4œ^Ó½€ÇˬµÌ‰((PòØã±üºUÏK/¤1üþl¯2aa64'Ç“+»Äë|EKàƒÙ2-¤^Ÿçh‚ÞT p8¼Æue q&êß/—å?YºÔÄ£d²l™‘À@½¯óÌjªxÀ×ø¤]1«›àšP]Sœ³£ÁΤ Çj,ã+0)ö[§±÷èºî‹*•“,LšÊÆMô¸¶€9sÍÜ]C÷™N'¼ÿa8Ó¾¡oŸ<Þ}'ÿ¦?>…B!„Bˆ à‰zS©T roƒ‚wâĵmãêZp÷ŸþìØ©ãÅÒhݪŒü%[¶ž®á†*]V®Zmàƒ÷’=Æ;JN©{³º4kæ ĪÕN.¹¤~™†gŠ†Ôýx²† ¹èÂb.l_â±L¡€«»²x©‰ãÕÆ»»®W>±±V~˜Ä7ä³`¡‰ž=ò‰®¥[R“ÑNŸ›òèsSv»‚ѯF2w¾™-¿ê}vyW—¸¸2 ()Qž´}”—§bÈ°f8¨eÒ„côì‘ﳜZíä¢ Køc»ŽüêÕM¦RéÊìs8ð`Ög¾ºÛ8~\ƒÓ‰G¦`õq …ø7èzeáá6V¬4pçÀþØÀ€þ¯`Gl¬ëús’ò~ýÕ5¦TLŒg£·R ÷ ÎfÛ¶¾œLF¦š{{g”•)ÿy(ëÖzÌW©œ\}µ+hWRâ}y®è†³¨¸æK·ÁààÒÅüö{GŽh=–(yçÝvÿéOcÙíðø“1ü³×/¦­1xWáŽ>›ZµƒÁ`Çn‡ädÏFà•« ®s… Î/¡¸Xɮݞc®^sâëâTS©àö[sùûoæÌuÝ ú÷³x•ë~•+ãxÙr£Ç|‡~\a@¯wÔ:­BQ{6ÝÉ #ÍäÃÂþ`=’IX¸„|ŽBÆd7l¥UœÈ>­çÇ"#¬øù9Q«ÜÐ;ÎÑ ºwèPLïëóY¹ÊÀà!Í4ÐBT¤K®ŠU« ,ZlâÜv¥ôìáÝçÀ;,|úYÿû(ŒÖ­KéÒÙ;‹N«uÈŒ‚xýµ4Ú·/F­‚´Œÿ<”ÐP¯ð~_E0÷½Â|wJ…“ŒL5Z­“Ûo«÷ê¹‘é ¾¯÷ kÆ+/¥Ñ¦M)IIZÆÊŸùscïÆ·óæ›ùe‹žŠIJÒ’”¤õ*Óµk!1åY‡ýn·°p‘‰å?).VÒ·O.v»‚¿÷ø3o¾«‹Q}•`óåŠXñ“‘±oDòÄ㙨TN/6‘Rž)T5Ž°=AÇÑ£•Ÿ_°\µÚ€Éä:ÂÃmî}0 .‹—˜x~T4o¿™Bx¸õY½ÆÐàsAˆ3A¿~¦L aâäPZ4/ã²K½³n¯¹¦€N‹˜ñC-š[¹þº|òó•L™‘#Z^•îñÀGuAf;ýåÏ´/B0™ì¨ÕN:u,".ÎuŽ7äœm¨û‡f3o¾™×^¤¨HI—ÎEäå)ù~F‹—šxáùôÓ½ Î'r_tg›ãõ|öy(áá6®ëå]æ`¢– Ã0›í„„ØÜ]mVÕ¶Mé¿.û_!„B!„8ÀµjŠÌ;K®Êhò¥Çµ à½þf¤Ïl¯‘ÏG»ÿ~ndz£x¿n àåÑQ^ógÌ bÆÌ À„9<½ÞAT”•”G£Wϼ=.…¢²›M€áòٵKÇ‚…&,4¡Ó964›gžÊ -]Í¢Å&º^Õ†] {Ñé ®Ï#gáçïdò”î¾·9àÊëÞ½×^MÅ`hø:+œÈ>±òܳé|û}0ãÞ‹Àfseãuêt€ØGƒëþÉGÇ™4%„™3ƒ<>? ÀÁÀ;,Œz.ÝçXrú÷³ðíwÁÜ{ï,€IŽñêk‘<ýl46›+z¤P@÷« øì“ãèõÞÛq@ÿ\âÖ³r•‘øx=:Ã+›¡SÇ"¾œv”·ÇEðèˆX÷üö”ðÍô#tèÐøÐ;]Aì„ :Ÿe&M8æà)•0mÊQÞ}?œ Íî¬ÃÀ@½zæóЃYÇï ;-ìþSÇÂE&6l D¡€zç1îd®¿¡¥¥•‘¶åøÕ½ñV„û﫺ºx]:òܳé|2>Œ»»ö³feL™xŒþ[¸÷ƒÿ­Î)ãâ‹‹Ù¹SG¿Ûs}–Q*aê䣌}=’qϯ¾’Æûjèbìk©¼÷A8Ÿ~æ¾®¾ûN2qq®ÏkÈ9ÛPf³Y3’óz$o¼‰£ü²meì˜T×rM¯±÷Å^= ³qþvÖðr¥*ÓÕ—U-SŸy$OÔèªn]Q«åù·2›|7¢ÖPª/¥bc­'¾¢Ó ¡u7›íî.:ë²ç–ÿh`ØÐìzmkgƒ·£^ï ¥¾¬^eÃÃl„‡5<Ãõdð÷wrNËúÕ[§sÐêœú•m(³É^ë˜_BüWétZµjxVz½×}’ÎYpuál0œœº‹†kÈ}Q!„B!„#ÑQ# Þ Q›ãõ:äÇ„I!„†Úy쑬Ó]%!„B!„B!„ÿR¡Bˆ&ðÒ+Qddh¸´Co¿•‚Ñ(™ B!„B!„B!GxBÑ6o8€Í¦@£9±±…B!„B!„Bå鮀Bü(HðN!„B!„B!D“žB!„B!„B!„g à !„B!„B!„Bq‘1ðÄ­¤DAv¶•ÊI` ½Þ᳜ÃGjÑhœDG[›¼99*òòT„…Ùpœø Eê»OÕàp(ÜÓ&³³É~º«/Nƒ” ee bcËP©öÞ¤$-za¡¶Óý5„8íÒ3ÔU>ãåïï "BÎ !„B!„BˆSIxâŒt8IË+££øí÷Uâe£_Icè}Ù^å Tô¼¾Íš•±nõÁ&¯Ï„‰¡|ým0ÿû ™[oÉ=Ý›ç¬Pß}Úû¦V”•Uð{4“gŸÎhòú”–*ðó“1Ù¨TNŠú•/+S ÑÔ¿|C<ôH,{þñ'~ã"#ëÈ·Ûô¼¾½zæ3yâ±S´å„8s½ðb4›ãõîéË.-föÌç»Zâ s2ï‹8®û‹B!„Bq¶’ž8©ní×Òã)þêÚ¶-åóñÞ æO>Þ=þ ¹7›Ž‹Q©œäç+9·]©Ïõh4NzõÌ'<¼æ ÷>gíZCËãâÊørÚQŸËÚµ+¥WÏ|¢œ¬aèýÍj-óòKi\Ó½Àk~}ö)ÀÌI8p0QË /E7iý·n `Ò”Pvïò'7O…Vë¤U«RîœÃ,§e{^Û«5«:H³fe§üó+”•)˜þM03g‘œ¬A­vÒ²EC‡f3 ŸÅ+8WX¨dÂÄP–,3’šªA«urþù%<1"“îW4®>t¾¢ˆ˜+þþ’%+þ›vîÒñü¨hº_]À+/§ù,c·+0°J¥“9³’ýJ*ùy®4ÖÁCšŸî¯- !¿us>Ù÷ÅŸV™89„ü°ÛDFX¹í¶\žE` \Û…B!„Bœ]$€'j”˜xˆfÍâP«˜$&jQ*¡÷õù>—ÇÆz!²²Ôüý·?=z0ú•´º>ÎQgæLzššÄCZ®ë•ÁàÝVs èŽ–Ó°ù·³Z$ÒcåòË‹|– 2ûîî²>ûàâ‹ŠP©›ö)ýuëyø±8b¢­<ø@QÑ623TÌžÄK¯D‘›«âáY§t{îÚ­ÃnçiNHxéå(/5Ñ­[!÷ͦ¸DÁ¢Å&^z9Š¤ÃZž™î.kµ*¸oX3vîÔÑ¡C1w²_ dá">ÇÇÿ;NŸ›òš¤^54„ø¯¸°}1…EJfÏ5óì3ètÞ÷²ÍñzvÿéÏÀ;,Î^juNå½Y¡ ¨“†üÖiè=údßçÌ5óòè(ZSÆÓOe Õ:Ù¼YÏ„‰¡lÙ¢gÖ‡QÊèÝB!„B!Î"À5:˜˜Èú rßà â…„ØxÿÝä:ËíÜ©#=CMjªë³” '«×x>E~ÅåE•I›6RZZ™îà ë•…µ~Îs#Ó='kr츆={ü=æ]ؾ¤Æ®ù6l Äd´Ó¡C1N'¬]gàÀ-~þNÚ¶)u×kÿ~?ÒÒÔ\~y‹›°Ûô»Ý•µ´t™‘’R%7÷ÉÃh´s0QKb¢]:Öúäùú ˜Lv.íPìž—™©&þg=iéj‚Ìv.º¨¸Æ ÆúÖ½‚Ó ¿ýÀŸùcµ)hѼŒîWàïﻡ÷â‹‹ëu 4vŸ6D}ë>ý›`f|ŸDL•1ø ÈåºÞ­˜49„Á÷dãïïdÛ¶òòUô¸6ßgãbzºš»t´jUÊ9-=½»t<¨¥¸XIT”•®WzuI–Ÿ¯ä×­z~\á:~þEϾý~îå:ù÷ïÀ?¶n /OEx¸•îWZmŒ·mÛÐë„…ÛX¶ÌH\œ•ëzå“™©fér#¡!6úöÉsgÕýý·?‹—š¼º›¼÷žzõnÅ7ßñôS¨ËªßÿÄÎ:úöÉããÿw¯gØlnë×’7ߎ g|÷ößž Ã’£¢GÏ̼Ü<Û¶кu)-[TnÃÝú“šªñ({õUµvë¶c‡Ž?ÿòÇßßI—.…DÊØ^â_B©„ÛnÉeÊ´Ö® ¤oïà÷Ò¥Fú÷³xÌ/.V²i³žÃIZ4j'íÚ•Ò¥sá DrÎ6ôzS!3SͦÍzÒÒ4 v:_QDëÖ¥õ­âY©¾¿u þ÷è†Üû-K®Šn] }šѲwŸŸûø°Ûáý‰Š²2î!÷ož¡÷eóУq¬[ÈŽ:ß9B!„B!ÄðD­öîÛÇ7ß~ÂA¼ú˜4%„5Uº}Z³Öà1 °pþ!.l_¨õb™™•õjÊ1ð6m dÌØHyµ÷Ñ'aX,*V­8ÈCÄñË–Êñƒ®êVèBý¸ÂȬÙf®¼²øŸõde©9tXKjªšm¿™©fÙ2#3g$ñûï¼òjÓ¿<ÂUÝ|±òó•<øpú[Ü [óæ›36¥¢£¬ddª)(P2lh6/¿˜Öèºdg«xä±8¶'舊²¢×;8tÈ°0+S'ãüóKNh»ŸÌ}Úºge©ÑéDGylMF;_N;‚^ï@«u‰~Ù¢çó‰¡L|”×zw 9aR(3~bþœÃîy……J†?ÇïmÅÏÏɱãôz??F§Ž•ÙÇŽiytD¬{ºúq9ë‡$:^VYÞn‡±oD2sVf“¨(+‡“´8 Þ|=…Ûo«<†?FÙξ}~äæ©ÈÉQñÉGÇùè“0 Tdg«8xЧŸªWðþaÙô¹Ñ3pàà‚óKX¿!‚%æò¬…‹L<ýT†G£|x¸7^O¥°Pé1ÿ“OÃøýþÞýÇú%º¶Á3Oe0â±L÷ü/¾ aùF²µ÷ÒËQÌoÆßßIhˆW_‹äõ×R›äøâTè×Ï”i!,Yjò à+YµÆ@‹æe\vie #!ALj'bÉÊVѶm)%ÅJÖrÞy%|1å('ÄnÈ9Û˜ëÍœ¹fÞxËuÍkÙ¢””T ¹¹*ߓØѩ'e³¤DÁÒeF.l_ÂÅW6¨OšJÂóçfãú¬úé [~ÞOóæe<÷|´Çg¶kW®„½îFÐeK=΋K;xv}öÕôfÎ bØl¶nÙÏÒŇؼñ^XÌ‹/G±¿JöžZådÓæ@†ßŸÍæ û ¶3zL>œEüÆýDDØX±²2~þù%¼übšÇwWWlÿìõ#,ÔæÞ••)ػן°P-š{g‚ôê™Ï­·äÖš-W—ÞKvo‡~·çÖZvÕjsç›éÑ£€í¿íeú¬ü1‘¯Ë³J„ø7huN_\̦Íz,•Ç²5k).Vzœ ¹y*~,¥ÊÉêŸYºè«Wdêä£ìÛçϨ›vìÐÚ4ôz³s§ŽÑc¢¸è¢bâ7º®e[ÙÇ{³ùîû fÏ1ŸîÝqViÈ}ñήžæÎ3{­'=CÍÆzÚ_PâîÛl²óܳéÜv«÷u|×nWo¿‰„B!„Bˆ³…ðD½œH¯¨HɲåFŸ¯œœÊÆG??'üý]­Bµkºê«zW_:]岦§G¥ªüüŠ'ÊkîÚ6óæ›øî›#ôèQ@h¨æÍË<ÇÂì¸ùfWæÄÅSX¨tgR\r±+H™–¦¦Mya‡µî÷ñeã? £°Ðµ1*‚1mËxN¼7.…7ßHqw7ªÑ8x‡€»t®{â!-6ººm»©JVÛ6¥<úHÇŽkX¿!ð„¶ûÉÚ§ ­ûÈgÒ µñλ\Û³5o½Áú y_6ÃBmô¹)M›9vܳ;ÇŸVÉËSqïàlùÿüã‡ÁààÂö•0“ÑÎSŽ²xá!c]©te¸UtK©ówÖz^Lÿ:˜˜h+/¾îËl²3vL*v»‚™³Íî² …ëx¼åæ\üýœÛ®„ÂB%}nÊC«urþy%¤¥y~'_>þ$Œ” >P9þQF¦»¢¢š6[•V[¹-êïkIyׂ¯¾œê>§›5+ãÉ'2ëü!Î$ýoÏÅfS°|…göé’¥&”J<²l—,1’­bøýÙ4kVy=ïqm={äóó/®n5O…†^o¦ã ½óVŠûÁ• ^•Nx˜ï¾—àû©ÔûblŒ•n] Ùž #ñçñ5¾»]Á=wçÔù™ë7²â'#=zÔ»KP!„B!„â¿Bú¢õÖØî433Õ<ýlŒÏeÕ»þ;ƽ^ï=K—Î… ºÓÒèõšÊƒeýûåzŒ S“Š†Ô€W]*ÆáÒ•O[­ 6w^R’–wßG§sкu)7ݘçàUdàÙ¹õWãî¾ý~dg«°Ù9êj@«4mhÝ·o mÛ22=ŠñˆvîÔÑûú|e ;t<õŒïcàõ±©>Çokj ­{\œ•ŸV$2k¶™U« |û}0_ŒŸŸ“[oÉåù‘éUÖûþ¡Ù,ZlbÖ¬ ž™îž?{®™  »WWwçž[ʆ<ühw ÊáŠË‹ÐëîFêÆ:vLCz†š= È®¶¯ƒƒí vîô âÙÜç„Nç 0Ðá>.u:VkíY•'…2õ‹nèÏ°¡•Ê’×ûªfØíØ¡c¤P÷¿ð|ú)Ïjï^Ì&»Wfgõ F!Ît}ûäñö¸–,1qÏ]® ˆÅ¢bs¼ž. =‚æ ;\×>_c‰vêXĪÕvïö÷™%{24äz³=A‡ÙlG¯wx]·Ï=·„Íñ®ŒC_c¬íò[§¾÷è†ÞÝ™Ãæx=óæ™õ¼ë¾ètÂÜù&ŒF»Ï1«Š×óäÓ14oVÆûãê7Ž®B!„Bñ_"<Ñ $99…fÍâêýžØ+³~Hò¹,$äävËéû;ø¡Õxgê´hqb—ãðTͨªM€®¼åïÓú9ªNâ,_ܦM)ûö¹‚t«V8§e¶/fíÚ@nº1ý ²Z¹-?ŸÊ—_…Ÿ¯D¥r¢Ó9Q*kÎNªoݳ²]¡ÿ·ÿ ÷Y&3Ëû²’›«bÏŸåmÖS3€Qcên2ÚyøÁ,~0ËÝ8>svsæšÙž cé¢ChÊ¥óÏ/¡SÇ"æÎ7ñÔ“h4N’’´üö[<”å•Åùäãä䨘¿ÀÄú ¨TN.»¬˜ÛnÉ¥¿Ü:³Éjüžåßaݺ@º¬kãû{Vk¯ƒëXðóóœvÖP»]Ák¯G2k¶™;Xxë Ïñ¨*ŽñÒÒÊ™%¥ RS]ŸŸž¡&+KÍÃeq*XrU˜|HO4h*Ä©f4ÚéÕ3ŸW9v\ClŒ•å+ŒØl úõóì‚0»üÚê}¿ ¶——9u?r½ÉÊRSZª K×65®/+[ElŒðªkÈo†Ü£r_ìÕ³€°P‹›ùl:*üºUÏ‘#Z†Þ—]kàuî<3£ÇDrÁù%L›rL®ÓB!„B!ÎJÀõ¦R©:äÞï”*'‘‘'¯ ½†úrÚ‘“Ú SXXÓ62µi]J|¼ž¢"%«×èÑ#Ÿ Î/áõ7"±Û8¨åÜv•cΚmæ“OøìÒbÞ—LËòƺ„w jqBu¯h ñX&×v/ðY¦êÓ÷®é^À§oòmÝ­{³ÙÎÍ}óèÛ'çžfñRk×rCïÊláC²ñD,+WèÛ'9sͨTp÷]ÞÝ„iµNÞ~3…Qϧ¯ç—-zÖoäåÑQ,]fä›éG¼ºÆ¬Š†Ókºðøc™µ–9J{<–_·êyé…4†ßŸíU&,̆Fãäxre—x¯(béâC|ða8S¦…ÔëóMЛªB‡wÀ¸® C!ÎDýûå²üG#K—šxô‘L–-3è ÷užYMøŸ´¢+fu\ªkŠsV£qb4Ø™4áXe|&EÃ~ë4ö]×}Q¥r2`€…I“CÙ¸)×0g®€»kè>Óé„÷? gÚ!ôí“Ç»ï$ãïßôǧB!„Bño »¼«K\\ ””(OÚ>ÊËS1dX3Ô2iÂ1zöÈ÷YN­vrÑ…%ü±]Ç~õê&S©teö9x0ë3_]‚ƒm?®ÁéÄ#S°ú¸…Büt½²€ðp+V¸s`l`@‹W°#6Öuý9ž¬!"Â3ØUq_ˆ‹müC6'óœmÖ¬Œýûý¸ðÂ’Fg%‹¦ÑØûâ-LžÊÂE&w—­]:rNKïà¢Ó ¯¼Åœ¹f,“§ŸÊ8Ý_[!„B!„8­‘ß!Î6¼;½Ú”=fÏ "$ØÆ%c4ÚéÔ±˜¹óÍ8Ю]e`ÄátE&ªtSæpÀ·ß»þ¶7>ÛèòN…èt-6a¯¶ž]»uŒÿ<”´´Óó\@E@ÆW†UCëžž¦æµ±‘¼÷~vIy¿þêS*&ƳÑ[©„ûg³m[_N&#Sͽƒ½³ ÊÊŒÿ<”uë=æ«TN®¾Ú´+)ñ¾•«Œ”–*¸§†ì»Ï&„2g®™‘ÏdHðN!„B!„@2ðDš"x——«bÂÄšïïhñ¿­¾V­6P\%QTäú{ñ“{Þùç•Ð¦MÝY?Õ9¢%aGe#ÿöí:”J'7÷Ík𺪢þkÖrë-¹î ‡ž=òùøÓ0Ú¶­üŽ—]ZD|¼ž÷? çÁáYde«˜<5”Ž—ñÇv$èHÏPjóÈBªƒÁÁˆG3ùð£p†?Çcdn#!Adž£PÀ°!Ù [i'²O+ÆÇùq…È+~~NÔj'7ôÎG§s4¨î:Óûú|V®20xHs ´iÅ’«bÕj‹›8·])={xwÅ9ð Ÿ~Æÿ> £uëRºtö΢ÓjÄÇ2㇠^-öí‹Q«àÀ-ã?%4ÔFç+¼ßWÌ}ïƒp߃Rá$#SVëäöÛ*ǽznd:ƒïkÆ}ÚñÊKi´iSJR’–ñŸ…òç_þÜØ»ñÇí¼ùf~Ù¢§C‡b’’´$%i½ÊtíZHLyÖa¿Û-,\dbùFŠ‹•ôí“‹Ý®àï=þÌ›ïêbT_%Ø|y§"Vüddì‘<ñx&*•“Å‹M¤”g U#lOÐqôhåçW,W­6`2¹Ž‡ðp›{ èŸËâ%&žÍÛo¦ncýÆ@V¯14ø\âLЯŸ…)ÓB˜89”Í˸ìRï¬Ûk®) SÇ"füD‹æV®¿.Ÿü|%S¦…p䈖G¥{<ðQ]ÙÎ_ù3í‹L&;jµ“N‹ˆ‹sã 9gêþ¡ÙÌ›oæµ×#)*RÒ¥syyJ¾ŸÄâ¥&^x>ýtƉÜÝ™Ãæx=Ÿ}Jx¸ëzy—9˜¨eÂÄ0Ìf;!!6wW›UµmSú¯ËþB!„B!N„ðDÔju“dÞYrUî@“/=®-hTïõ7#}f{|>Úý÷s#ÓÀûuk/Žòš?cf3f® Ì©àéõ¢¢¬¤¤h<½zö(àíq(•Ýl –Í®]:,4±`¡ ÎÁ°¡Ù<óTiéj-6Ñõª6ìJØ‹Nçhp}y8 ?'“§„p÷½ÍWæX÷î…¼öj*CÃ×YáDöilŒ•çžMçÛïƒ÷^6›+¯S§ÄÆ8\÷O>:Τ)!ÌœäñùÞaaÔsé>Ç’ tпŸ…o¿ æÞ{|gLšpŒW_‹äég£±Ù\Ñ#…º_]ÀgŸG¯÷ÞŽúçÿ³ž•«ŒÄÇëÐé^Ù :ñå´£¼=.‚GGĺ緿 „o¦¡C‡Æ7€îØé b'$èHHÐù,3iÂ1wO©„iSŽòîûá,Xhvg:èÕ3Ÿ‡Ìò8~Ýia÷Ÿ:.2±ac ÜÐ;qï$sý ­(-­Œ´Í(oįî·"Ü_Õ­ÐÀëÒ¹çžMç“ñaÜ5صÿ›5+cÊÄcôؽ„ø·huN_\ÌÎ:úݞ볌R S'eìë‘Œ{/Ü}~„„Øxõ•4†ÜWûCc_Kå½Âùô³0÷uõÝw’‰‹s}^CÎÙ†2›íÌš‘Ę×#yã­Hå—Åèh+cǤ2¸–k¬hz½/öêY@x˜ãÉž,òV÷çŸ:ìv°XT> ½/[xB!„B!Î*õmUQ4`žÂÇßU§«¿*Òm”>þVª*ÿ*«L««L«ª,×T™V—¿ªþ­©6˜cÉý¤¶/oµZÉËÍE­Ñ ÓéP©Tun°à &ÙA§“ÍfC­®oŒW¾Ï4–\ÙÙ*¢£¬c")Ñj]Ùi'Âápu™fµ)ˆŒ°5*xº4´î‹ŠÌL5þþ®`j]—€gŸ‹aíº@¶Äï¯5³ ¤DAf¦›]AT¤+s°.……JÒ3Ôè„„Øj­Oz†šü<!¡6Ì&{ë>™JJ$§hШDG×¾‹‹•$§¨ ±7y½-¹*ðC¯wЮm‰Ç¸]Bü—+INÖàçç &ÆÚ¤™§'óœÈÏW’ž®Á`°Öð rÑ´z_B!ÄÙkåªUtìرÎrN§“²²2Š ±ÙíDFFú,w¶·Ç¿¶€IDAT¶Ñ !Ä¿ÁÊU«›ôšd6= ¶ò—°V›®úwÅrG•i{ù´ WGAö*ËUþu”¿ðñ·³†—û+U™®¾¬j™úÌó x¢FõÞ‰3‘Ù仵®€R})•k=ñ ­»ÙlwwÑY—=ÿø³üGÆf×k[ûû;¼õz-õeõ*f#<¬á®'ƒ¿¿“sZÖ¯Þ:ƒVçÔ¯lC™MöZÇüâ¿J§sЪUóÒë½î“t΂« gƒáäÔ]4\Cî‹B!„B!„h‰Ð!DدçÐ!?&L !4ÔÎcdî* !„B!„B!„ø—’žB4—^‰"#CÃ¥Šxû­ŒFÉLB!„B!„BÑ8ÀBˆ&°yÃl6͉-(„B!„B!„B(Ow„â¿@¡@‚wB!„B!„B!š„ð„B!„B!„B!„8ƒHšB!„Â-=CMqQå3^þþ""l§»ZB!„B!„g à‰SÆé„ÒRþþ§¿›A‡ÊÊÎŒº€k»øùu9“””œ9ûèdû·¥¥®qÿ”õÌç..V¢Ó9Nwµÿõznü[/qz¼ðb4›ãõîéË.-föÌç»Zâ s2¯+8 T*¹n !„B!„8{IOœtñ?ë™0)”„6›“ÑN¯^<ûtº×ý7ßÚ’ÒRß‘€+¯,dì˜T÷ôs£¢ÙµKWãçMvæÍ>ì1ï·ßøx|ü¡ÃnWjcÀ OŒÈD«­l$Ú¿ßOÄ®±Íôz;ÑÑVºt.âöÛr ¨9átÂsÏG³ûO_}q„ØX«ÏrÇ“5|ôq6’›§" ÀA—Î…<ûLíÚ–ú|OA’ƒZ`³)3:•nÝ OÊ>›þM03gyms€W^â·ß|¾/0Ð΂y•Û|Þ|3S§…ÔúYo¾‘—¹§'iùßGalÚHa¡­ÖÉå—ñô\rIq“~OK®ŠáÄ‘Ÿ¯bÒÄ£´:§Ì½ì§•F>ú8¬Ö÷Ïžy˜  »×üœ<‡FídÖI5¾ÿ÷?ÿY(¿ÿ@Y™‚à`;}nÊãÉÇ3|®·12–}ûü¸õ–\F<–éµ|ç.ÏŠ®u#Fdrë͹îé‚%ã?cÙr#ééj”J8÷܆ ÉæöÛr½Þmêíؘë×þý~¼ÿa8?ÿ¢§¬LÙdç–[rùLz½÷5©°Pɇ…³d‰‘Ü<&£>}òxáùtŸåÅ™¯â8ë~u¯¼œæ³ŒÝ®`ÀÀ(•NæÌJjTdô+©äç©<¤ùéþÚ¢Þû œµk 5.‹+ãËiG†_C¶n `Ò”Pvïò'7O…Vë¤U«RîœÃ,'\ÿŸV™89„ü°ÛDFX¹í¶\žE` \·„B!„Bœ]$€'Nªµë <:"–óÎ+á½wS ¶ñ×ßþLšÊ/[Xºèf³«±ÜfS°çÚµ-õh,ªÐ¦gP«ãeEDÔÐø?cf*µg£eüÏz†?Ø ƒÁÎã#2 ¶³r¥I“C9zTË'w—-)UxHK‹æe\zi1……Jþú[ÇO+L˜Êä‰Ç¸èBï`ÒÞ}~Œ{7‚ŸÑ»2Ë>ëw츆;¶ #SÍõ×åsÑEÅ9¢eÑbÛ~Ó3ãÛ$Î?¿Äë}Ë–Ù·ß³Éά9æ“Àûó/Þ{?›MÁ9çx÷í÷##SÍ݃r¼–ùù{6®Y,*iéÔ±ˆ¸8ßL£±ò=ÇŽk0°µ“‘ÏdЪU)É)¦N á®ÁÍùî›#t¼¬ˆ¦2úÕ(v–QʪŽóò”$ÒrÉ%ŜӲÌçûÕÕŽ1‡6ÇòÆ[9¢%$¤æàÔºõ<:"ô·ee{Bß}Äo¿0sÆa †k¬E§ŽÅ)˜5;ˆç_ˆ&3S̓d¹Ë§§«pG ²sÔÜ5(‡óÎ-aÇNóæ›Ù¹ËŸ¥‹Õ¯Õê:Occ¬\~¹ïã"È\ŒkÌ>=YÛ±¡×¯#G´ º»9 %<öhf•ã%˜}ûüùî›$U.7ee †Üߌ?ÿôçÞÁ9œÛ®„]»tü0+ˆ#Gµ|ýå‘Fmsqz]ؾ˜Â"%³çšyö™ ŸÙ¬›ãõìþÓŸwX½Tõa…B2 þMÒÓÔ$Òr]¯|Ÿ÷ð°ÊëNC¯¡ëÖòðcqÄD[yð,¢¢mdf¨˜='ˆ—^‰"7WÅóh¬9sͼ<:ŠVç”ñôShµN6oÖ3ab([¶è™õÃázg{ !„B!„ÿÀ'Õ„‰!h4N¾ýú&£«¨[×B ÆŒdÁB÷Ë 7×Õ"~Å…<ÿ\zët§Åçü9sÍ*y½Zæظw#P(œÌžyØÝ8y×9<2"ŽeË ¹7›<ƒr:1îí÷ôO+ <ÿB4=ËOËÝÁÇ—G»²ÒÖÒñ²"né›Ë⥦ëþî{ddªyùÅ4÷÷W çž{›3æõH¯ì€y Ì´¿ „NŠ˜ñC–\fSÓdj«{ÃgGÆзO‹û®^ž’è(k½öQÕ}uë-¹u–›ñC‹Š/§¥ûÕ•AÜK;ÑûÆVLý"¤ÉxsæšÙ¸IÏõ×å³juÍÙ ýnËåî»rj]W^žŠÇŸŒaÿ~?2³ÔÜ}WÛ´NrrT>Ë[­ F¿åúÎß&qñÅÇ]_~̸÷"˜<%´AÛØ—ùóͨTN^z!^ŠfÓæ@®½Æ38ç{_+¹å¶–té\HïëóÜó7Dzs—Ž‡Èbä3îù={ÐãºVLœÊóÜÁ¤ÉSCÈÈT3îîèoàÎÎiYÆ{„óíwA<òpã|.¾¸˜÷ßM®wùúìÓ“½zýúd|ù*/<Äy纂ûýnÏ%,ÔÆgBYµÚ@ïë+ˆß}ÄŽ:>úð8·ÜìúÜþýr Ð;X·>äd ÑѾƒêâÌ¥TÂm·ä2eZk×Ò·OžW™¥Kôïgñ˜_\¬dÓf=‡“´hÔNÚµ+¥KçˆlOÐaÉQÑ£‡ç9‘›§bÛ¶Z·.¥e ×=wÛ¶ôzaá6–-3gåº^ùdfªYºÜHhˆ¾}ò<‚Ñ™™j6mÖ“–¦Á`°ÓùŠ"Z·.­oÏJÏL÷ÄÖ¦¾×Ðéß0ãû$bª\? ÈåºÞ­˜49„Á÷dãïïä·ß°äªèÖµÐg ùÈ-{÷ù¹»Þÿ œ¨(+óçrgÛ ½/›‡cݺ@vìÔqi‡¦ÍÄB!„B!Îdò«8©²³Õ„…ÚÜÁ» ­[•º—WÈËwŽfS㳎ÒÓÕ¼=.‚ý-O“çä¨Ø»Ï+»z4h)•ðèC®îð~Ze¬sý7ôÎç©'2ÉÌTóÃÌ ÷|ÆI÷« øöë#Ìú! ƒ±æbõš@ÂÃl ¹/ÛcÙ¥ŠùLúY°Û=[0&jÙ±CÇ ½óè{See –/¯»Î ñÖ;(0ú•´Ëäç©0™›.hXUÅñP½a¶e‹2T*ÈÎV5fµ^'iyóí^{5ÍÝ°|"œ¸2 ïdáÇ¥‰¼þZj­å7ÇëIÏpe_Vï\î–Í=wçÐ¥ó‰eWÚí°`‘‰.]Š¸¹oƒƒ Mõ~ÿ'ãÃ8ž¬á­7R=Ó+öAõ}¤Ñ8ig¥ @IY•ÌÓ-¿êÑéô¿ÝâQ~èlôz?­lÚc¸©¬íèKM×/«UÁê5\ީȼ«pïàl Xñ“çvœ5;ˆ6mJÝÁ» /<ŸÎÊ%x÷/Ö¯<0·ÄÇC"ÅÅJV­1Тy—]ZymIHÐÑóºV<ùt Ë–™9+ˆ!Úqk¿–¤¥Ø³\Ÿ|ÆãOÅzÍ?”¨åѱüøcå±ùñø0&L åî{š3iJ(ŽˆeÙr#ïjΤɡ<32†OÇ{vs;g®™kz¶fÌØ(~\aà“ñaÜØ÷^3§$žRYYjt:ÑQž×“ÑΗӎ0wÎawwä›âõîýëË[ã"xtD,yå]µæ¨4ÈÂÈg2¼ºÊ¼¼£ëz˜ž.Ï !„B!„8»HOœTW^YHrŠ†ƒý<æo-C­ó•AŠ¼ò <£ÉNI‰‚={üÙº- A 6¨çGzf¸õà`ïÀSE âŸüêþ _y bÓf½{Þ믥2ú•4®ìRwÐåï¿ý±ÛtìXäÕ Àót§w×góç›èsS_\Ll¬µA„º¬^c`á"Ÿ|tíH“ÑŽÝîêZð×­$Ò6I®¼Òµý6WÙ¶ü€Ý¯8ñì;›MÁ3ÏÆÐãÚ”g„(“ÑÎçãñä^]½úR1öYçÎÞßG¡pO'Ú=jüϤ§«é{SZ­“ë¯Ëgí:¹yuA÷îóãëo‚¸h6Í›{8/ïT„Zíds| Çü¼<{÷úqÉ%ÅøùU»JÌf»W–Fã¤Y³2öí÷Ãqkt²¶£/5]¿i).Vr¡n{ƒƒíÄD[ùûo÷¼ŒL5‡kéV~>íÜ¥cñëÖº¯…âß«Õ9e\|q1›6ë±X<Ã5k).VÒïöÊŒçÜ<?‡RådõO‰,]tˆÕ+2uòQöíógÔ‹Ñ ­B£©UN6mdøýÙlÞ°Ÿà`;£ÇDñèÃYÄoÜOD„++3¢wîÔ1zL]TLüÆý,]|ˆ­¿ìcȽÙ|÷}³ç˜O÷î8«´m[JQ‘’é_{]·/l_Â9-ËÜ×ú;ZP(`î<³×zÒ3Ôlܨ§ý%\|‘ëºf6ÙyîÙtn»Õ;[×n×õ­>÷W!„B!„â¿DerrrX°p16›­Î²jµš~·ßJPPPeF=—ÎÁƒ~ º§9X ³±g?Ë–yøÁ, EEÞºuŒÿ,ÔýT6@¯žùŒ{;…  š3¿vîÒñã #O>žé¨ µ£R9Ù·ß;H—‘é: ²²êw:Û ²“”Ô¸ UJŠësbbêŸc·Ã¢Å&:t(v%×÷¦<&O á`¢¶ÞÝdÕ$=]ÍK¯D1êùtÎ;¯„ÒRß©BV«‚ÒRGjé}c+WÙíÚ–òÁ{É>ÇîKØ¡ó9SX˜+ªdÝÜ'—?þÐñÆ[‘ìÜ¥£mÛRÒÒÔÌkæªn…<öHæ }Ope‹dg«øöë”^Wc¥¤j<º kjóæ›ðósrCoWVß>¹Ì_`bùrcÝG¾ÿA8NzлkËØX+o¿™Â˜±Q 0Ž.‹()U°d‰ £ÉλïxvÃicçN;ð[Áápe\–•)È/Pyeéž)NÖv¬®¶ëWÅC cW}üiúqë-¹\×+Ÿ°p{÷V^Û*®MÝÝœ?¶ R9±Ù Þ—Ìõ×å×Y'qæê{.;wêX¾ÂÈ=UŽÃ%KM(•pûm•A%KŒdg«xååLš5«¼Wô¸¶€ž=\]Nrùz²)®ûÈ-7çâïïäÜv%lùUOŸòùùç•ðÛïîòÓ¿qŠÞy+ÅÝeµJ/ŒJçÇF¾û>¸ÆîhEÓùL:[·ðλ|óm0×õʧk×B®¸¼Èk,ÓØ+ݺ²9^Oâ!­Ç¸£óç›±ÛÜswÝ]¯ßÈŠŸŒôèQp¿u„B!„Bˆ à AAAtëv%_óv{Í ê*•Š¡Cî­5x`6Û0ÀÂÿ> cú7Á˜Mv2³Ô\vi×TCª"`wô˜–—_L§}ûb TÌšmfÑbYÙjæÌ<\c7tã? E§s0tH¶×2ÎA÷î…¬[Èì9fîh ¨HÉ›oE¢TºëKà ;§qÝ9—¸•~Úú÷ýµis éjF’‰±† Z§ŽÅôì‘Ï+Œüù—?ÅÅJœNxpx6ÑQžûþÆÞy$$èxûƽ‚JåÄé„O? ##Ãu ²–ÕÿÜó%a‡Ž§ž‰ñ¹ìõ±©^ãDÖwŸžìíXUmׯâb×5C[~¼üú«ž?¶ëhß¾˜ëp]KJK+3ëòˆøêë`ô·0yÒ1 v~ÿ#€gŸ‹áégcøqYâ) ؈“£oŸ<ÞÁ’%&wÏbQ±9^O—Î…DUéâ0a‡ëXïz¥wVo§ŽE¬Zm`÷nÿSv<ÙÐë]ç“Nç 0Ðᾶët{ñöf³½Þá~ئ¹疰9Þ•qèkŒµ³Ý¸w#ÜÛ¹ª. ½‚žõ½†ÆÅYùiE"³f›YµÊÀ·ßóõ·Áøù9¹õ–\ž™îñ Õ ;sدgÞ<3£žwýNq:aî|F£ÝçŽUÅÇëyòéš7+ãýqõçT!„B!„ø¯žðÒ®m[†¹·Æ ^Eð®]Û¶u®ëw#øjz0¯¼œÆ}ƒ³Q©\ŒcÆF2ø¾æL›r”«¯ròzõÌgËÏû1쎗Q\¬då*[·øìFñ`¢–M›¹kPNåcF§ò×_-xåÕ(~˜DD„íÛu\Ó½€ˆkƒ‚C…Jõk0¬èž²¤´þA‹ù L¨TЭk¡;Ðm¥yó2-11òÙt¯. ïÔ«[ЇÊâñÇ<³Ø¾ü*„}ûüX¾4±Î1º‚ƒmlùy?:‡Ç5\P‚Ñàà·"˜9+ˆ§žÌ¨¶íÓ|füøùynÃÕk Œx"–›ûæòÍô#vl6_}̨£9tXËÈg<×½n} Ï†Çìõè¢47OÅÈQÑŒx,“K;xwEX“”T5……ÞÝæ6 ƒ²:Îu|—”4,pUß}ºt©‘²2={xd²^{M󘼲!ªšþu0* ®!3âx²†~ZkeͪƒîFÿM›yüÉ~ÙÀÌIîcé¾{sX·ÞÀ‚…&¶m  ]»ôÃOëäÚk\ÝQVod®ï>uï‹\{öøã‹ÍG`¾¾ûôdnǪêº~UŒ)Uظä’b4+ÏÆ-+S ÕVnÊmÔ¶m)¯V H^qy£_N㉧b˜¿Àäu.‰£ÑN¯ž® ú±ãbc¬,_aÄfSЯŸg„ãV†…zgÖWd{VödÓU¹×*ž÷…qí²²Ô”–*èÒµMëËÊV#¼êôC«ñ~H¤…q_r 5í<ü`?˜åϜĜ¹f¶'èXºèšòÏíÕ³€°P‹»~§¨TðëV=GŽhz_v­×¹óÌŒÉç—0mÊ1w¦B!„Bq6‘žð©¦ ^C‚w99*¾þ&˜îW0¬JV‰Ùlç½q)¬\e`òÔwÏÏÏI˜Ÿï®;¯¿.Ÿ•« ìßïç3€·p¡§n½%—šÄÆXY¾$‘?±çí¼ýf ×^SÀ…—´ã’‹ëÔÉÊRc±¨èÔ©qã±Utyü¸¦^å-WÝ=¯oå³Ì/¿è½ÆL»¾W>W3«ýžÝ[NÒò¿Ã¸éÆ<Ö¬­wÈfs5ØOÖ0g®™‹.*æÜv¥(•¾+öÑoE°ÿ€w7¥&“ÈȺ^ŸŽC¯wðî;)î@µÚÉCd±z/¾ ቙î€FÅö¼ó‹×ºª#ǽNQ¡’ÐsæšÝóÿ)ïzpÕjïñ£µÆï'Ϭ³«Ä†ªè:39¹~Ç€{×cŸÌ+/ñ¹Q¾Ç¶Z°ÐÌsÏzgmæç+Y½Æ@ç+ ‰ˆð½Ÿ¿šŒ%WÅ—_õÈعúªî»7‡ÉSBØö[€»kTµÚÉ×_aá"¿lÑãtÂÐû²Ð?—ûˆ#8ØîÕˆ[ß}Zášî|úññzoÇúîÓ“¹«ªëúUÑuffyÆâK/xf~fdª‰¨’õìú»][ïñ¢.»Ôµ_Û°8sôï—Ëò,]jâÑG2Y¶ÌH` ƒÞ×yf5Ut_\æ#Óµ"­Ö4}6°£ V©Ñ81ìLšp¬Æ25Ý“Îv_N;Rï.'z ­`6Û¹¹o}ûäñÜóÑ,^jbíº@nèíz`G¥r2`€…I“CÙ¸)׸ï¿w×ðpƒÓ ïδ/BèÛ'wßIÆßÿäd« !„B!„g: à‰Uâ5$xp츇¢}Œó¥Ó90?VÀ()Qp<Ùôç’ðÅ—<22¼×æºõ1ðx\rqYåïßüDú\''ÒÔ Ç9‡ÓÕjÿ»©ÿ»©8˜ætªð×ßô:?üµêzN›SsǪŽôýÕ±£:‚mÛÃ{È‹8xPƒþW®c§Nhµ  ;+†ã¬ìJG¯óÏ+CR’K—™qËÍEøãO#nº±8,Ø‘‘QqÓH¶&, œx´Éhxb• $²ŒÏ¡Cõ»A!’ÌL/vìÐá´ÓÜçQ¥–“•­Ášµ18ý4N;5´-"À…½Ëñå×Ö°›“n¹¹³f'`ÉÖà­çö,Ø{YQ€qO¥bñ'6<ü #G°—0ßT/‚Že•A<½^W¯àèe¤R›6!W‹éìÛ§Eq±ˆ6m_4œ:-ý®èˆÕkbBòÊr ¨%ùzª+,±k—gusÖ:䫯%â¶;ÛÂSeèJEfÍŽ‡N§àÊþµÏÅÛ·ëñÚë °X¤àƒwDDDDDDD`<ªƒO8OŽy½¾^ÛÅÅI¸éÆb,þĆQ£Ó1p@!ââ$ìÞ­Å‹/%A¥î¿ïp¢A ñõ7V<òh:†>`Ç駹PP Æ‡ÅbË_Üq[QHÀ¯ÒΊ!;wª}¨¨¶m½xcfî  ‚Ìÿ8¿üj££ó”ú¿ÿÓãÍ™ ðúìءëc ŠÀ¯DB•@Òê51ȯtª¬Ó÷ß[X1üÝ)§¸ƒ=è,¿üj¤))ø¯bXÐCyj¼37……"Þžu:‚ÿûGíÛõ¸²i=Û®»¦ÓžKÆwK-¸9°ƒM©ïeœx‚s߇ǣÂ%;àó X¾ÒŒÏ>·á”Sܸúªð€ÌŠ•1{@‡^\qy ø0dHF?š†û†´Á¨ùhßÎ {ˆwæÆã`– )™±5©:,'èév«BÒ/êè1#ŠÀÔÉ9¸wHÜ5 w.D‡^lݦÇ{ïÇ!!Á±còêW_}mAR’={Dî!zíµ%˜÷~–,±¢×ù¡yvìÐA€<5¾Æ]wâÓϬ˜ðL ÊÊDtíê„Ç­Â÷ËÍøê+ÎêæB÷*«Otcûv=–ŽÑ£ò‘”äÇš51˜370|n¤¹£­%Žc¥º~aÇÚc0èž61ÌŽÔ~Ý`ÄÌ·pÎ9ΰãøȨ|ü¸.w ÌÄèQùÈÌôâç_L˜ýv<Ú·óâš«N¯¿±=bc%|ñùÀE}:âüóÊ1kæA8"Î=¿3n»µ“ŸÉö©¡jn¸¡³çÄc欴këÅYÝÂ{q^tQÎîîÄücÑ®­}/sÀáPaöœxì߯ŘÇój6Ö&aÛ6=漫U‚Z­àìîÎàïñ9g;±ô{ &NJÁ°‡íE_~iENEï¾Æ|cß=¨Ÿ~fÄgRàtªpnO'JKUøh~,¾üÚŠ'«ÿ÷$5L×®.ôëÎüÎmqëÍÅHMñ¡¸DÄòf|ñ¥'èAŸKÂ{ßzKÖ­7aÆ HJòã²KÃóìÚ­Å›3a³Iˆ¯6Ôu¥:{pæ™uŸÃ–ˆˆˆˆˆˆèhÇÕI}ƒw•&MÌEûv^Ìz:vðâ̓óßU¦½?o?¦?Ÿ„ç_H ¦'%ùñØ£y¸ïžÈÃÞƱ±µ÷̺þºäå«1kvß“ d7öPÈ}UmݦÇÖmzˆ¢‚¤$?®¹ºCî+@ÇŽ¡æçÌdž Æ°í_y-1øüÁ¡ö`/9ÙÅ ÷bòÔd,\dÃü=ñ:wöà¹ip~ÅðœŸ}f\{uͽ”®¾ºÏ¿˜ŒÏ>·5{O«UðÞ¼ý˜>= ÚðáGz2þwS1Æ<ž1Àöý2 ¾_¹ÌKû8‚¼k¯.Ñ ãÕ×qïým‚yââ$Œ•!÷ÛÑZŸzÄô÷çíŠ{õ*Ç{ïîÇ´ç’ñò«‡ß'õ.ÃSãE¢òHV¯‰AAw. Ö±Ò©]ÜèØуå½6cb_¸/(a0ȵÎ7Ô¡½Ÿ,Ú‹^LÂØñ©ÁÞµ:‚o(Æ“còBz’µoçÅÌ7â™É)1*=˜÷–›‹¤l -qç­Û÷WÇŽ¼?o?žz:£ ÌɧV+¸òŠRLxúPXï½vm½øèƒ}ÿTjð=¨Rô*ÃÔɹœSêѱƒgœá–-Üp}äß • x{ÖL|&ÓžK¤)a„ããýxjÜ! PXëkLœ‹ç^HÂk3á÷²,`ú³ÙhÓ&ðz·ÞRŒ¿·°ä +Ö¬ —÷+Å´g³Ñ÷òŽ!½ÞëËf“°pþ><ýL &MI ~ߤ¥ù0ñé\ÜyGÓÎOJµ{õå,¼5; Ä¿‡€@àæÿãñGó"}iŸ2$%ú‘•­ÁðŠ ou[· Iakú=4 <"""""":®ÔõªŠP4!ÂóªËÕ•—GUž Ä*UU–ÕU–Å*ë5U–ÕªÏ5Õ–cŠŠK^­mç}>JKJ Öh`0 VŸ´,‚ø¸Ø#æ9¶ù­TT$¢  0Z||í«].rrÕ0$%ùj¼ˆÞ~¿€Ü\5dY@zº/êóê”—«{HX›„¸8©ñ¶¿?0¤Ô0o]c8*ääh 7ÈHKõÕ:<êÑ®°PDQ±ˆÔ­=aZ¿_@V– CæÖöP /O²rÒRý0ŽžýlmòòÔp8D¤¤øê4çd¾]’bII~X,GÏw 5=—K…ìl t:ééMû½êr©£F|¼›µéßg‡ yy˜ÍýÇôoÂÑ ¸X„Ý®†^/#5Õ‡:4‰ˆˆè8µlùrtïÞýˆùE×ë…³¼~IBJJJÄ|¼FGDÔz-[¾¢I¿ócmÖ‘Êø+_µåªÏ+×ËU–¥Še?IUÖ+UþÊDx®ÔðîR•åêëªæ©KZöÀ£+!6¶nõ Ú{ë”·¾Ôj%8Wk`2ÉèØ¡yöµ9©ÕJÄ!M›ŠÑ(‡õt4•lÖšË$""ª ÎÉ…àõ—‘ˆbÄTNWpYÑëàONŽvÕ©kŽ¶ÑñŽ<¢*IBfßËQÞçäÎ|£Ñå©\.$Lš‚˜o¿ƒàñÓË/íƒÜ7g„ç/+GfßËáËlƒý+–ÕXn›þWCðzƒËEC‡ päˆh>""jåR í?ÿbßÚÕð§DÊ%ãúõÁew·nÈZðQ´«N­TS·ˆˆˆˆˆˆˆ(€¡õ·ˆˆˆˆˆˆˆ({àQ«¦rº³,0W‹àñ@ûßX-‚à÷Ã>~ ¢]Rl,×\ Áï‡vLj……€_‚æÀ€XTR®îßÿ [­ðµi’^õNócþÏÍÏ !Úí!ë¼:òlù å}/‹vU‰ˆ¨ž¦?Ùd KwõìÒ[nnö××<1?å—\ UµßY).²Ù ý–¿X:5ÛNDDDDDDDÇð¨Uív$\VDîç pø°° F±3ß‚íÝ÷ r8 ˆ"ƒPEîΦ*)d³†¥K6[u1®^ƒäQ£ÃÒ÷ü±!8Uk#æÕ‹éÄ¿ôJä<õ)’ˆˆZ ͮ݀F–îk׶E^_,(˜~X Ó«#ç±ó7¦¥µ¦¶5xÔªùÓÓqpñ‚À‚JÉj,³,ZŒ¸×fÀÝ­ò¦M¯];€~Óf¤ßz{xÁ‚ÈJx²ÏWK]Ò‚sÛ…•ÕZU\Ø-zð8{÷Ž˜EŠv-‰ˆ¨ræÌ‚¯C‡¨½¾Rñãì}!ŠZkj9­©íDDDDDDDD ǵjŠ¨‚”pÄ|¦+yÏMƒ/óðÐNꜜˆù¥¸X¨³²E À©³²j| ï 'À>îÉh’zñefÌËç>óŒhW‡ˆˆŽ!¾6€ @p{øÓŠ´¦¶5œ*Ú jJàŽpÙh<œ&Ë°~8 HrHvÏ)§@årA÷÷ÖtÓÊUÑÞ“ú©¼€áŽxpÝŠAó—_A¤uº¿·"ö7¡>t(Ú{ADD­• Šq•l6Ãݵ+ 7B³ÿ@È:UYâ§?ÝÖ­uyŠ†ãµíDDDDDDDt”`<:&¸»u…qýOˆñ%ßs7ÄÂØÞ~AÿçŸÐmÚ1??pGº Àqã 0õ5’ƒüÉÏÀŸ”ãÚµ‹P-<$¦iÅJ¨\®à²Ê阿ú:˜æ9ùdx;w Û¶rÞ™˜¥K!%'AÑé ¨Õ(ïײÁÙlFÑÐ÷ò«H½oŠR"ô›6#þÅ—A@ÉÀQ8cDDÔô›6Asà`p¹2ÐfZ±²Õð'%ÁÕ³GÄíe› ºmÛa{ç]ÈVK Gw÷³àkè±U0zÒ Bêà{Pðäðvî;ýˆ›ñ´Û¶£¼_ßhªÁÑÜv""""""":0€GÇ„’Áƒ ÿëo˜—|ó’/ ô(4…#†CÌ˃ù˯Ðî‚‹°gÓFÈ\={ ð‘‘ˆ}ý ¤Ý`ù2Û wæ›H¿ùV~‹Õ=aòÔˆ½à’{"ø¼`ô¨ˆ<z:  ËG#þ¹¿‚,cßÙÝ!§§Š†ÜY¯Gìì·‘v×@€"Špö¾ö§ÆA6›[ô\Q˱Î_€˜¯¿ KO˜25øÜÙ«W¼ü O!þ…7ãàoLÞ³S‚”–”@­ÑÀ`0@Å#°ø¸Ø&9Aǃ¦¼g[UR±°þÔT(zýát§ŠV E­˯ݹ ²Éï Õ1<ª¬,C“ øý’“! Ñ®CÄü|ˆ¥øâ![­Ñ®ÕÛNDDDÔœ¾_¾Ý»w?b>EQàõzá,/‡_’’’1¯Ñµ^Ëšø;?Öf   €¿â!ðU[®ú¼r½\eYªXöPª,KU–•Š´Ê¹$ª?Wjxw©ÊrõuUóÔ%-{àÑ1E¶Z#^4 ™ß¥Z~÷YÝ¢]í–¡RÁ—‘íZÑ1JJL„”˜íjP=±íDDDDDDDÔ:ñ–Y""""""""""""¢V„<""""""""""""¢V„<""""""""""""¢V„<""""""""""""¢V„<""""""""""""¢VDí QËPçäBðzáËHD1b1?*§+¸¬èuð''G»êDMNp»¡>”).²ÙÜàrT¥ˆEE!i¾¶™ÑÞ½£›,Csà þ´Ôh×&êZÓ{L}èPàw¤M›h""""¢cxD\ÀQôúæ+ßã¢ÓE{7Y† (Pj¸hÛèýt¹¡ê~[Íq¡&!H ËP4šºåw»¡hµ€ªnÁ·;ð~„¦¯»×ø\Ôñ³!x½º7~6¨¹¤>0Úþžµ«áO‰”K3ÆõëƒËînݵà£hW¨ÉéÿÜ„´Á÷À>v Jhp9–… ÿÒ+!i»·ÿÝlí­ãª¬™}/‡/³ ö¯Xvä %ðÛÙŒíùæt¤ßýÖôKzôqè7oÁî¿7·økoÀ£V+㆛÷( ¤„x¸Ï8¥·ÝRR0¯ù³%ˆó@UÍfø:´GùE¡üÒ>š}û÷ò«0®[Uy9­®sÎFÑ°‡á>󌼙—_Yk]œû¸±!iú?þDÜŒ7 ÿãO^/¤¸8”õ¿E?)66˜Oûï¿HñHe=p?×][ëë'?ú8t[·Õ˜7fÙrØf͆vç.’r2×]ƒâ{î†Ó¨ó¤ÎÎFü‹/øz TN'dƒÎKû àñGCÎQ}‹:;iwß[ëkÛŸ|ÎÞ÷1î•×jÍŸµà£×h UI Òî½*Grf΀¯C‡àºÄ‰ÏÀðë¼om6xO> Ž«¯‚ç´SëTþ‘Î)¨ÊÊ~ëü~ØÇ…³×ùM²o•R†„ö¿p\s5Š| r&EuþÇ°,Xí®Ý€¢ÀŸžÇu×¢èþ{Ã.¤ n7âf¼ó—_CÌÏD®³º¡ðÑÑpŸqzÄãÿò+ˆYº ª’(:œ½ÎGÁ7þÎsI‚mÞ{°,XÍÁƒ€JÏ©]P0r\矖]´Û÷Ú ˜~ø¢½rL <§vAÑCÂuÎÙ!yëóýÜ×òrĽü*Ì_} Ui)d‹eW^‚Ç…l2EÜÛ;saùôsxÛ·Cî[oFÌÿ‹0­Z]ãaðµÉ@ÎœÙ;–Ô¢sN]=zÀ—žE_ó…bû¸1K€´ƒ£½»T!ß=¨hÙlpŸq:Jo¿ ¾ŒŒàºªm§šäOš×9çŒëB”gkÌ[rçí(¹óŽh‚¨(»îZ¸+ŽSüs/@ÿçŸÑ®R³©Ï{¬Q4j”÷¹RRb­Ù´ÿü‹ø—^†á×ßíÊØX”]Ù…#‡7ªWeK¨k›8¾ÞcDDDDDtxÔjivïDe—÷¨œNhwîBìÌ·`ýh>.ú84‹‹¡Ù³îîgÁ—ž±¸ÆU«aþl Ü]»"wæ HqqÁ²ÕYYH¿ù6@­FᨑðvìuNbß~iw@öûóà>«[0ù¥}"ÖQUæ€eÁ"à¼sCÒ«× å¡a€FÇ×ßš ý¦Í°~4†ß7"kþÁ‹ ê|;4{öÀyQox;w{ _fíÃÓX?œ˜¯¿ Ô§¤$l½å“O‘8þiø:t@áˆaP´Z×­GìÌY0üò²>þ°Î= ªSçå!ã·B,*BÉ­·À{Ò‰Ðmù –Ï>‡î¯¿pð‹Ï! :.‚ÏÍž=𧧇G*É6ÛásQZxœy|íÛG̯¨›î+/é© Ðýõwàµ=ÞÐã’“ Íž=÷®FñP, Áúþ(½åfäO|ºÖc~¤sZ)æÛï Ý±²Õ óâOš4€§Ù»¦eË!Ùl°ÎÿECî‹Ø;-þùa{wÊ®¸…Œ‚¢VÃøã:ľ9º­[‘óö¬*'LFê}À°aÊ/¹ÎÞ½¡>” ëû"mÀ d-˜Ï)'³ ~?Òßí?ÿ¢ôÖ[à9íT¨³²`›÷>Òo¿¾üRBBƒ÷1áÙé°~4΋z£xèN'¬ó í¾!È~çm¸ª|®UååH0š½ûà¸þ:xNíuN.,‹?AÚÀÁÈ™53Lê÷ýzô¥Þ}/t[·¡äÎ;à=ñèÿú–…‹ >p9sç„ï€,ÃúáGܘöìvÇNx;w ˦>”Íž=(¿´OÄ‹™RbíG©õiÌ9µsÄò}:ÀWñ\i†¯Ô|¾{<höíƒmîÓ«¡ß²î®]t~loÏh·#ïÙ)pÜxC ñæÿÁ×¾=â_xÖ?BÑût\‚çäŒÓ‘7ýÙºU€ãºëPzÛ- ÚŸº²|ò) ?®Cùe—´beù ž¢N,*BÒ˜±°,Z JJ=ÚŽxN«0¾ž.]à:»;¬/€ª¤²ÕŠ¦`ùl QDÁ!éÉq0®[çE½Cò¨ÊÊ`}ÿ¸Ï8‡^}9˜îì}!ÄÂBÄ|·ºmÛáér À´r 6Àqí5È{~z0ùÅ#ãæ[÷ÒË!*óçK Û¶ö§Æ…ôêpŸÝi#vÖlØÇkÐþivï†õã(ï×¹¯¿L/»ú*döë„iÏáÀ×_„œsí®Ýaì•÷ë‹Œn‚íýBx@ý¾¿¬͇~ózñy”]}ÀqÃõMFW¯:;'l ãÏ?C{yÓŸE⸧`^²?Vã>Œ4¤£_]Ï©nëV¨s…¤9/èդôjwî‚aèJð'%Âyá…â£}ˆŽK‘¾{ ?ÿ‚Ô{ïG⸧°ÕòuUÛNµñœzjð÷8fÙòÀÍ—^ŠÂ*m †2lø²ÉR"Ìß| _›6(¿´D{b¾ýR|<Ê®ì6„²˜ŸãºõPçåC6ÇÀuÖYðžtbÄ×ü~Öÿ̓âk½éÅôÃjH±±pw=3$]³o´;vÂuv÷FÿÞŠö×­ƒúP^ î=zÀÛ©c£eK¨ï{Lp»a\·š½{µ:Øv‰4$¶qÝzOpY6Cn¨©*á™IP¹\È}ëM”_r1 øþûøôDX-†õƒQ|ï=€,ôzM°$ú-AÌÏ;·u=Oª²2~ý ÞÎàkÛªòr˜–-?üÞ<çœàM6 m×W}>•Ç@·å/^üp^ЫÆ"©ü­ñœzjC4Qý0€GÍb×îÝX½f-¸³ÑA¼êÊû\Œ¸W_ƒª´´Ö|ŠFƒÂà۾Æ5k¡ÿóO¸»‚rba`øêÿ€ûÚµDbaáëa\½1_ƒ¼ž æÆ°þ'ˆùù(»¼_؀ŃA}à`ÈÉ•û!Ûêw!Hðz‘üÈ£(»âr”]ueÄ`ª¬ %·Þ_ÇaCeº»w‡é‡Õóò|. ¿þÅ ‡ãúëBÒKÞ…Ø™oÁ´lE0€WßãÒZiöíCüÔi°?5Ú={꼋C¯¼„ÌËúÁöî<6_`]Îi°»wC¿y  WÏž°½÷>Ìß~‡’ÛoküNJb¾ø®s{¢ìª+‘ðìt˜—|À+-… Iðu ¿åíXÑ;¶èðgÉðëo€Ò;nÉë9ý48Ï?Æ_~…ªÔ¼³ù48©¯][ˆ¹‡P2%wÜûø±Í2×ks«é=¦û{+RµÝ_Û¶Ü.¨³sàî~rÞz²ÅRNÒ˜'!Ú ‚Ë5ͧٳú-ÁÓ¥K0xW©èáaYü ÌŸ/ ðT*ØæÌ…~Ó&ì_þ}Ø܂χ”!C!È2ö®[Óàó”òðp8®½EC‡ õžûÃsW(=*Àk‰6qý>¥H>†_~…¢ÕB¶X @6›‘÷Ü´°ã‰á§Ÿ‘zÿpr«µ‰ˆˆˆˆ¨á6nQüûßxÿƒà÷û›´\Ã/¿\=ΩSþÊà’qÝú`š³âNÞªi`øãO@’àêQû?͂ǃÄISàîz&Õ.¸ë+†UŒø· À>á©»+/äK+T%%ÐoÚ ýŸBU^^kâ_x‚Ç ûÓãkÌ#[­(|d$×^¶N÷w ž‘†Ü«+UYYàBXµá ¾Ì6ÐîØÈrƒŽKk$øýH~ä18/¾Ž¯¯÷ö²Ñˆ²¾}¡r8 ß¼9l}]Îi%ËgKeý¯€ûŒÓáËÈ€yÉM²ŸÆŸ~†:/eýûCÑj= Xtò§¦Â×®ô¿o„àv‡¬3ü¾²ÑÏ©‡çüS••ܹ_¯cG@’ Ý¹#˜¦Û¶ÞÎ"å9í4ˆv;D»½Aû¨Û¾=PΩ]"”}jEžÿ ¦•÷½ ö§Æ… [¥Ýµ*—«ÎŸ£Hß_¢ÝÍÞ½p˜wO÷×ß0õu`^ÉŠcVª´¦•«P~Ù¥P´Z”]Ù?p§ýO?7èxб-ï¹iسi#ölÚvÃEcÙæ½ËÂÅ(8{Y_.ÁÞµ«á>íT$ŽíŽÑÞ}ª$TüV·Æ ¿(¸n=ŠïŒ}kVAŠ‹CâÓQ<ä~ì[ûüÉÉ0-;ÄÑoü‰ÏL†ëìîØ·n ~º{×­Añý÷!æëo`›37¤ø¸3 Û¶£Gaïo?cïO?"ïùéˆývýêÙô[þBâÓá>ý4ì[ûCà3óó:”Üu'¬͇eñ'Q>Pí=¦*+CꊂK>Åþ¥ß`ßêU8ôÚ+Ðÿñ'Ÿ™Vľ•+‚ßW5 íZyÈÿø“’àËÌ„v÷žàïhé-›ÌŸ–ß´rÄ¢"”ÞxC°gr}Ï“j*tÿüƒ¤±ãáo›‰¬Å ±÷çõ8ðí×(«Òoî6q}?IcÆB¿áwäO™„Ý›ÿÀÞŸ~Äþﾆl6#yä#PgçÔúzºmÛ‘2lÜݺ!wÆkM:d=ÑñŽ$>=Eß=8l}]¿¿*ß rL Òo¿7ߊÄ'Ç!õÑö¢>‡i5ó-¯7Øc¯2×TA\:¶(Z-d£²Ñ¥‰ƒ7¶÷Þ‡?- O<,[¶Zaz<I‚eÑ¢hï>!0Ä©~ËøÚfçѪ¤Û¼1ß~ö0lØÐr>Ê®¾Š^ï‰'@U^Ž²þW@Ñjá=ù$¨å³Û>øP>:úðo¦  pÄ0Hñq°|¼ ¤ø˜o¾ƒ?-Å÷ÝLs^Ð+ì&¬–`}ÿ@–‘?eÒáßHQDÁãBJL„õ£[¼NM!Ò{,æ›ï Úí(ö¼'º±ìò~(¿ìRÄ,ý>lÔ Å ~_¡–Žˆ•A%jjÄõþô4@Q‚×]q9d‹æ%_o.«dùäS@Pzëá!ØržüÉIÐþûTeåÈy{Ügœ)>ÞNáO>Üã¹¹ÛÄõù|höî…iÕÿþwS0øêëÐöñcQÞç’ž„Õiö@êýCàíÔ¹³g6éÐÌDDDDDÄ!4©Tñ2œ¦XT„„g§‡¤yN? ž“N®s²ÉP9‡U*”õ¿º¿·Áòùø AJJBÙUý j ¸Ý°Í™ w×®p~ׯàr@ÿU9J+þ–áÐŒ×àkÛêƒ;ó-Øæ¼ t>±°IcžDáÈáÁžBõa\ÿ’G>_f&ò§M­÷öU•÷ë ý¦ÍHxv:ò§N\¼UÄÍxêüÀ‚‚×× ãRI¿y3’GŽ¸.âÓasÐX>ý,âEG)!öqO6x_ ~‡uÞ{Èþð=ÈfsƒË©|o©œ‡{XÖ÷œ×­‡˜Ÿ2žãÊþ°½=–Ï¿hÔœ)ªÒR˜~XòK.»ê:÷\Hqq0/Y6¿ ¯C{8n¸¶wÞ…mî»P4ˆEEp\]pî»Jåý.Cìì·÷Úëpw=38ô¬qí0­\ ìÑWù~ÑîØÓ²åÊéÚŠ|4„Êå–!Ú `Z¶<ØÓ¯ò5k+[p»‘ŸÃÆ?îsÎ+§ü’‹k>S,(Dê=÷BŠ‹GÎ;o×úÿ5 xÔ"Ä«:ï…àõB—ÓÒï‘0y bV¬@ö;o‡ ßX]åP”U/ršV®BÊ°p\u%²çÍ…l1Cðûa}ï}$ ÍÞ½(52byæ/¾‚X\ û€;#®W*þ‘¯>¤`M ‡‚Üo§ŽpŸs6Ú\y5¬|ˆÂ‡ Η–4v<¼'œPã¼-µ±|úžžï)'#gö¬ÞQU¥ßz;´ÿü’V|ÿ½(zphHZÉ]w¸z-ÌK¾€aÃïðœx´»vAÑêP~Qo˜~X ¥"€Zßã<%¥Ðýß?× ¾ðžêÜœˆÃúÒÃïr6®^18¸ç !CŒ©JK‘ôø(zð¸»v­÷qÙŸïÇúžSóçKQ„óüó¡ªèÁéOKƒ¯m&b¾úŒ û\Ôõœš¿þ‚× ç%ËçE½aþ|Iȼp$¤ Í޽ș3®Š¡i5»w#eø(dÜð?øæË`6O—.(:±oÍFf¿þpŸq:T%%ÐîÙ Ç ×ò`að⢩ÐU\°õµkg¯^ðœòRðzùª]¸«ë9U´š`Ùrl,œ½zAÑj+ƒeG¾°&"åÁ‡ û{+ò§L ܱA¿¿*êå=¡3ìãÆ·ws ÆŽAòˆQ0¾$ø¤Ý±º­[QzËÍP•¾1ÁyñE0­\…˜ï–¢ôÖðàf×n@£ ¯g»¶ £S´ÏieYÓ«aúauä2¸¬ˆ"Ü=ÎAáðapw=3,¿}ü8”_viXzM‘æ"«¬!ôõP”ÃûXX_ûvË‘ââ‚y¤ÄDˆÅ%tkø\Ãr¬­E÷|níο°Æ<ªÂBÈéé-^·:ïCßcbAàóŸvç€ZËjE_Ñ®ôx#®<ž|PzË-°~8æÏ>ð,Ÿ|È2Jo»5´^ 9OKw„á¹CêÞÀ6q]ÕëóQñ]™^g²ŒÔû†@³ÿ7Þ6—!5 ð¨Åìܵ ÙÙ9ÈÌlÓ í­¾Œ ßw/Ä¢"Øæ΃qÝz8{_XëvÚ» ¤÷JÜëo@6™ÿì(?µÅ÷ÞÓÊU°Í‡¢‡Œ8÷–yÉÈ&Êû\ñõ*‡ÃÑdg×i¿ä˜ ¢§SHºÑçyçÁòégÐ<oçÎ0ñ%Œ«× pÄ0X>ýìð>V I¨ß¼ŠñS”÷¹$ôqEAü‹/Áöλ(»²?òžE¯¯±Nå—^ Ïi§…¤yº„_ŒPÔjä¼;æ/¾ Ìí¥((pJo¼i÷ÞèQq‘¢¾Ç¥’³÷…8ôÊKuÎ_øðÃa½ÄjâOOƒ#Rð¥Úú ÓŸƒªÜ )>>0ÌRåqÿ73­X íÿý7y^¼àû±â{}Ï©X\¸P.IÈì{yÄ×0þüKØÜ)u=§æŠ¹õ’±ló’/CÇ"pÑ^÷×ß(xlt0x†]*ó8Rï¹Ö…‹Q8ì¡Ãçg主ŸÓÒeP9ðœv½þ,‹ÎIF€Š!´Ìæà…=Çu×ÂqݵÁrÔùt©ÚPpu=§þÄDè¶nƒàñÀsòIÈ™{x$uÅkú“ÃÏߎH½ÿ¨ÊÊóî;‘築 ¶ï¯ÊϪ÷„¶sw Œ«¹jþÑ>§•¿ŸÎÞ†Ý P=µz:.®"O¥ ®j:U¶ZàOI®cé­„Z¼‘£ºàˆ êŠ÷^Å÷¿PmØDàð(u%ÈJ½òG¢h4Ífä¾9£Æu༠õœî@ðû¡èup\] znÏà°ÞDDDDDÔtÀ£!Š" ¼«ÁÁ»ê‚ÿøîÛwļ1ßæírž^0M½?¤””ˆ¥¤$¾Íóóá¯v÷³h/€~ó–À|S5ôΩ¼óXÿÛ”Ü~[Øúĉ“I‚}âÓPDªÒRˆ¥¥ðU.ªªœ?®²·–:;²ÁÛÛï„䫼(eZ±ÆÕkà9é¤Ã*oœRoƒ¨ÊË!BJˆSÑhõáû$ ºíÿ‡Ä§'ÂsÚ©l{51Uã‹ ª]eðîĽKB¤`PîH=ÌK¾€iù ¸»v…û¬nÁtFÔs÷„”í÷C·u½>â… ÃóDt?«Æ×tžÛþ´´@¯¬jC~ù–ÅŸ@URü‡:ã–Û‘qõuaÃŒ©‚ñ§ŸáOK HŠŠ=›ÿ{TÞ\ðØhìÙüGÈ|\±o΄å“OQ8jd‚wõ³l9Òo¹-l?msçAðxBZõ=.­Iö»ïD<î%ƒ²~Œ½¿ý\k‚$!aòT¨óòPrÇíÁ!Që{NÍŸE¯GÑð‡á¸æêGÉ]wæ”Y¹*ü­ÊÞwÅ÷ÜV¶ãš«Qve¨sz["pôn +K¿yK O›ÃiÍîÝH8–ÅŸ„ä5lØýŸÂqíÕ!ç¿üò¾P9ˆùæÛв7m†ößQvEäˆuQÞ¯/ °,íÁ¦r8óÍwðžpBÈ÷‹˜Ÿ”û€b0 kÁG ¾@éûKÑéPÞç~ý Ú;BòÇ, ÁYÙϸöGˆö8®»&â9*xWà\.ù¢AõS9^CÕ©JÁaÀEQ±Ú\gtŒ@‘#®’Íf¸»v…aãÆ`@¿’ª¬ ñÓŸĉš’ó‚ ¸Ü0®ú!$]•ý–¿àêÞ=8€J2ô›·‡U¬dZ¹2bù²Å¸©¢Ê°‚× ÓšµG®\eo9òçÆÙûB>b¾ú:l]ìÌ·`Z±ÇŠÊQ2*{ŽWóõ7°~ðQÈ܆õáíÜ Þ“N„~ó~ß²ÎòÑ|@–Qví5aÛ•]q9d‹ÆÕk`Zº,p#ÚÍÿ‹X÷æ:Oné=Vχ«g(:b–- y¿ö|æeý`ú~Yä:ˆ"­¹¯¾A‘‘2bTØgŒˆˆˆˆˆ‡=ð¨Y56x§*uÀ6w^`AòCo‡qõh€óâ‹Bzx€qå*¨fAåtBÿÇŸÐÿù'üiiÈ{1´çTÑûüèãH2…#†Ã×®Ä;lsçA•…¢!÷Gìa§©¸¸îíÔ±¶Fþäg2d(Ò BñàAðuhí¶í°½ÿü (óD0{რùÑÇ‘~çÝw/üiÐìÙ‡ØÙ³¡r8?ibØðu¥Ù½q3sÝIñq!Ã?VòvîÜ໢='žÝöÿCÊ°á(5þ¤$˜Ö¬…mî»p^Ð+tNz—cõÃ!›L aüq4ûöÃuÞ¹(zøÁ•§ýç_è¶ÿÊú_2‡^Ue×\øç^@ÌÒïkœ›-Áï‡ùë¯áOJ‚«Ç9ó8®½Ö÷?€eÉpœ—\ oçN°.X)ÖgŸ>P´Zèÿüñ/¼Éf ¹(ækÛêœ\$<; ‚ÛÏ©§@ûïˆùUøSSP4ô×+ýßM°|¼ 'A,(„çôÓ Ù»q¯¾)>E ið¹ñvî Ç ×ÃüÙçuz”÷ë •ÃØÙoC,.Æ¡ŸÉŸðÜ PçåÁqÃõ5^Àu\wmH¯Þú|ŽãºõH8…£F—Ù†_~…ííwàk׎Ša©ÌŸ}x­†©rö¾’Íó—_¡pÄð#ÎZ]ÂÔi0/ù{6m„l4"ù±Ç¡ÿãOìÙø mà`/öÿm½Ê¥èÑoÚM•ž•6ÓŠ•­9‹üII5+ÛlÐmÛÛ;ïB¶Z ¨Õpw?+8ì]ÁèQH0©ƒïAÁ“OÀÛ¹4ûö#nÆÐnÛ–S«VÙvŠÄס=Ê.ï Цˆù~9@»³b˜çß7"væ,€ûìîpݽEê\|ïÝ0ñ%&O…¢ÑÀsjh@ÂÔéP!8Ôs%Ç 7 væ[H~äQ{ëü‹Š#–ï>»;LË–#î•×PvUˆ%¥ˆ}küÉÉPgg‡:ªªœ_8þÙéðž|µ¾öí‚sè– ógKøÌ$¨œN¸zö„ª´Öù#æëoPðØ£-r [‚ë¼sáìÕ æÏ—@6›á¸ö(Z LËW væ,¸Î?%Uæ”6­X UEÏsàðpæ*A4ÏÉ'ÃÛ¹À>n,R߃”BÑûákӆ߇uþx;uDñ€ð¹÷½Žk¯å“Ï ›Œ(¿´OÄ›öšõ<5²M|¤÷X}>’͆¢!÷!îõ7òðp” ¸R\< ?ÿ ÛÛsàíÔeW]Yëîø:t€}ÜX$Ž ÏNCþ3›øDDDDDtübšMSô¼‹‹ÿü A€l2ÁÛ¹3Jî„Ò[n lÅ,[,[E§ƒ/#Å÷߇¢{ï†lµ†ä+»ú*(â^›Ôû ¤¸8Ž‰¢ûï\ŸŠž(Rll­õvö:9ïÎAüs/ îÕק÷¾öqcƒÃÖTÖâf¼¤±ã‚éÞN@î[ãQ~ÉÅ >~ú­ÛI‚X\ŒÄñOGÌS2à®ð|íÚ!÷ב0y*’GèMTzóM/<Ôç¸ lï¼ ïÛN(4¥·ÜÜà^†–ŠàMmsŒ8®¾ ñ/¾ óç_Ô+€g\³bA!Šª1èãéÒÞŽ`Z¹ª²2È11Èþà=Ľþbß~q3Þ d¸zœûøq¡sÞˆ"ræÌFÒ˜±H˜úìá¼ç‹üg&„ÎÛˆÀ¼q9ï¾ƒÄ Ï þÅ—‚wš»»vEþäg=D\þ3 ›L°|ò ¬æòñ§§#wÆkpU»9@·%УÐüù’ˆ=  ¬_¿^}¾¿|mÛ"ûƒyH|jâáϪJg¯ó‘?y½>^³ž.§ÔØûXQ«Q~Åå°,Xï¿…ÌMHÇ'ëüˆùú›°ô„)SƒÏ½zÕÀËŸðâ_xq3Þü~²Œ¼g§xîîg!gÎl$L›Ž”‡÷òöté‚œy£Ö«²íIyŸK‚<ÝŽˆ{íõõ†ß~ƒá·@€¿èá‡Z,€'%$ ûÃ÷‘8a"R8|SŒ·s'äÌö¾+:Ú]»`Z¶¦•«Ú$öqc6`0_èü_ö1CÌËCìì·;ûí@Ï÷ûï…/3úM›jíeT4tÔYÙ°,Y|"Ae8®½&\‘l6dÏÿ ÏLB”gƒ¿mþ´TØŸ’;no‘cØR½ñâ§?ˢŰ¾ÿ€ÀüÏ¥·Ý‚‚GG‡äM˜<êÔ&=v¸MY0zT0€ç:çlä¼= ÏNCü ó%‹"Ê/íƒü§ÇG;¨®ô–[`ýp>D·¥wÜ1OsŸ§Æ´‰ø«ïçã¡¡˜L°½='øùPÔj”÷½ öqc#Î vLÿw ?ý ËÂÅpsÊ®ìߨãCDDDDDuíÖ#Ô#Mˆð¼êrõGå•bU„ç±Ê_U•eu•e±ÊzM•euÅ£êsMµå˜¢â’WkÛyŸÏ‡Ò’¨5 ˆu¸ø{Ä<DzÕkÖ"--µNÁ»†õ-k:*§êœ\È}`¨Êöv«‰XXUq1¤””°ù#Âò暈‹=b°UQ¨óò ”—ßšV㓆: È2ÔyùP•—ß’\cÁJª’¨íð'ćØ#æ/u@Ÿ)Öèk,Áí†:'ŠNß*‚Ȣݱ¸þ¤$Ès´«CTgb~>ÄRG?×DMA,* ´lÖ#ÞØ¡ÎΆ&+þädøê0/³X\ UaaÛ6õ¥r8 ÎˇlŽ?1±ÉÛ ­‰àñz/j4𧤄ÍmÛXê¼<¨eð''…Í{×XÍ}žš³M\ŸÏêìl¤ÔÔà0›DDõýòèÞýÈ7ù(Š¯× gy9ü’„”””ˆùxŽˆ¨õZÖÄßù±6ëHeü €¯ÚrÕç•ëå*ËRŲ€ReYª²¬T¤UŽS_ý¹RÃ#¸KU–«¯«š§.i!ؚŽ·º‰ÿ1o.²ÑoÇ/¨R\\’Íç¨"ð''7Ûq¡£€JJÝß²Õ o=.ðË3¼ÍÌRôzøÚ·oöCTWRBB£{Eƒ”˜Úë–¨H±u¿éÉŸ–ZZÝËnæv™l6Ãk>>nÔPtºfý­õ'%IIÍRvsŸ§æl×çóA€?=½Ùö“ˆˆˆˆˆê¯~“ãÕÑѼ#"""""""""""jmÀ#""""""""""""jEÀ#""""""""""""jEÀ#""""""""""""jEÀ#""""""""""""jEÀ#""""""""""""jEÔÑ®Qk£Ù·²É)!¡ÉÊ$ b¾eÈ&#d«5rFY†æÀA( üi©5×ñÀ@V‚Ë’ÍZs™DDDÔ9¹¼^ø2ÒQŒ˜GÌχÊé .+züÉÉÑ®:µbÍÑv""""""":Þ1€GT… IÈì{9Êû\‚Ü™o4º<•Ë…„ISóíw<ž`zù¥}ûæŒðüeåÈì{9|™m°ŲËmÓÿj^op¹hèŽíÃGDD­\êC¡ýç_ì[»þ”ÈA¹¤1ã`\¿>¸ìîÖ Y >ŠvÕ©•jê¶0€G­VÆ 7…öUm6¸Ï8¥·ß_FF´«xD±¯¾óçK༨7Ê®ì9&By9d³9ò5Êû\))±Ör³æA–¡Ù½IOŽ‹önQ ŠáE˜V­®q½¯MræÌŽ¸ÎÕ£|ééPôº··±ÔH88Ú»Kõp,´ˆˆˆˆˆˆˆ(€”Íž=(¿´OÄB¤Äšo±sÄò}:ÀWñ\„hï.ÕñÐv"""""""¢ð¨U“âb‘?urHšáç_zïýH÷ö¯Z²N´ÀøÓOóòwœŸ~¼'žXcùúÍ[ Û¶ ²Þ×¹= 5Á?šý ýï¿@}òó!ÅÚ`\³6$·sgøÚf—ëÖ‡ ±)pwnÓHEá÷ÐmÛøýðµm ç…@Ñë›î5ˆˆ¨EŒ_‡ĢۺêÜC!iÎ zAÑ鎸m]iwî‚aèJð'%Âyá…â£}ˆŽKGcÛ‰ˆˆˆˆˆˆˆÂ1€GG×yçÂÝ­+ ¿o„:;þ´4€ù³%Hœø  RÁŸš Ñn‡ª¬ Ń¢`Ìãaå$ógŸCÑë!ÅÇCœ0ö O5º~ÆÕ«‘ðìôà²Êá@ÊCÃBò<þŠï9<,YÒ˜'!Ú ‚ËGš¯>ÄÂB¤<8 úM›àOMl2A»g/ü‰ È}k&<§œÜ´'ˆˆˆZÛÜyˆùniHZmsàÕ‹$!qÒdX.†lµÂŸš;}€ä?3Žë®öîZÛ‰ˆˆˆˆˆˆˆÂ1€GG'Aø+†T•” ñé ðu耬ùB¶˜!ø|H1 ¶y__¸»žÜÜ´b%ÌŸ}ŽòK.Æ¡×^¢ÕB³ÿR|¸ÑU+½ãv8þw óâKáo“ìÞ É£hµ!ËûV®€ È€Œk®oÒC•4f,ô[¶àЫ/£ìŠËÚ;6è¤<<û¿ÿ6¬>DDtìÈ{nZ°GV¤)0/ù¢ÉʶÍ{–…‹Q2p žx Š(BUR‚”‡†!qìxxºt·s§hZuÛ‰ˆˆˆˆˆˆˆÂ©¢]¢úÒîÜý–-ðµÍ„?) È2ò§MEþ¤ -ù€¥4Ý_…”óõ7€‚±c‚Á+_f {¨ÑõSÔjÈF#d£1°¬R—+ÕçÃS úÃÛ4átCš={`\û#Ê®ì Þ!<‹uVVØðžDDtlQ´Úÿ?bÓÎj{ï}øÓÒ‚Á;­VØŸA’`Y´(Ú»Ohým'""""""" ÇxÔª©œ.Ä, ÌÕ"x<Ðþ·–E‹ øý°h— Ç5WCðû¡Ý±ba!à— 9p …”«û÷?ÈV+|mÚ„¤W½ÓüX ÿs3ÀsBgˆv{È:o§Ž<[þByßË¢]U""ª§„éÏC6™ÂÒ]={ ô–››ýõ5BÌÏGù%CUíwVŠ‹ƒl6C¿å¯–N Ŷѱ,ì‚QìÌ·`{÷=¨(¢Å`T‘»³©JJ Ù¬aé’ÍVc]Œ«× yÔè°ô=lGÕÚˆ…yõâ_zñ/½9OAA}Š$"¢VB³k7 Ñ„¥ûÚµm‘× ¦VÃôÃêÈyìüii­©íDDDDDDDD ǵjþôt\¼ ° RA²Z#Ë,‹#îµpw놼iSàk× ß´é·Þ^° ²žìóÕR—´àÜvaeµVv‹|ÎÞ½#f‘bc£]K""j€œ9³àëÐ!j¯¯TüÆ8{_ˆ¢‡Öš‡ZNkj;QÃ1€G­š"ª %$1ŸiÅJ@ÞsÓàË<<´“:''b~).ê¬l@QBpꬬ_Ã{ °{2Ú‡¤^|™™óò¹Ï<#ÚÕ!"¢cˆ¯M ÜþÆ´"­©íDDDDDDDD §Švˆš„¸#\6§É2¬Î’’ÝsÊ)P¹\Ðý½5$Ý´rU´÷¤~*/ E¸#\gw‡bÐÃüåW$)dîï­ˆ}ãM¨Šö^Qk%€"G\%›Ípwí ÃÆÐì?²NUV†øéÏC·uk]^…¢áxm;%ØŽ în]a\ÿâ_| Å÷Ü ±°¶·ßû¬nÐÿù't›6AÌÏÜ‘.pÜxÌ_}äÇÇ ò3ð'%Á¸vmà"T ‰iZ±*—+¸¬r:毾¦yN>Þζ­œw&féRHÉIPt:(j5Êûõ…l0@6›Q4ôĽü*Rï‚¢†ÀŸ”ý¦Íˆñe@P2p@εý¦MÐ8\® ´™V¬„lµüIIpõìq{ÙfƒnÛvØÞy²ÕèÑÝý,øÚzlŒ…´ƒ:ø<ù¼;A³o?âf¼í¶í(ï×7Ú‡€jp4·ˆˆˆˆˆˆˆŽ àÑ1¡dð èÿúæ%_À¼ä (=Š Dáˆáóò`þò+´»à"ìÙ´²ÁWÏ(|d$b_iwX¾Ì6Èù&Òo¾‚ßßbuO˜<5b/¸¤Çž>/=*bÏŸžŽÂGFÂòÑLjîÀï‡ ËØwvwÈé逢!÷CÖë;ûm¤Ý5 ˆ"œ½/„ý©qÍæ=WDDÔr¬ó æëoÂÒ¦L >wöêUc/ÂSˆáEÄÍx#ø“÷ì”`ÏÝý,äÌ™„iÓ‘òаàvž.]3︻žíC@58šÛNDDDDDDDǃºÞ.+Ô#Mˆð¼êrõGå0žªÏb•¿ª*Ëê*Ëb•õš*ËêŠGÕçšjË1EÅ%¯Ö¶ó>Ÿ¥%%Pk40 Eñˆ,>.¶INÐñ )ïÙV•”@,,„?5Š^8Ýé„¢ÕBQ«Ãòkwî‚l2Á{Bg@u *+ËÐdg~?¤ädÈC´kDDDÇ1?b©þ„xÈVk´«CuĶ5§ï—¯@÷îݘOQx½^8ËËá—$¤¤¤DÌÇktDD­×²&þεYG(à¯xH|Õ–«>¯\/WY–*–ý”*ËR•e¥"­r.‰êÏ•Á]ª²\}]Õ§*— b^>ds ¤¸¸hW‡ˆŽ1êœ\^/|é€(FÌ#æçCåt—½þäähW¨É n7Ô‡ò ÅÅB6›\ŽªÔ±¨($Í×63Ú»wt;ŠÛrÁöyëÄö9E {àÑqOUVŽÌ¾—#mà hW¥EÙ潇̾—C»sWÍ™d‚ÏíªB³oÒî„]»£íÅ}Ðö‹ѾÛÙ°~ðaÄüGó95üô32û^Ž¸—^‰vUˆè”úÀPdö½ê|{y’ÆŒCfß˃䑣£]m¢f¡ÿs2û^óçKUŽeáÂÏLfßË!HR´wï¨v4·åƒíóÖ‰ís""""ŠöÀ£V+㆛B{ˆ*È6ÜgœŽÒÛoƒ/#£i^H£FyŸK %%Ö­.‚E£”÷g ô¶[àOJŠöájR–O?ƒå£ùÐýûÀ—žŽÒÛnEñ 5öØhNÉ#îÿþAÉ]wÂÝý,(¢•Ãï‰'FÞ ç´¾R†>íž½5®ßÿý·Mò:Rb"Êû\ï)'1ofßËQ4ä~8n¼¡Éö“ˆZ¿ø^„iÕê×ûÚd gÎìˆë\=zÀ—žE¯«q{û¸1K€´ƒ£½»Tõi;™?[‚Ø9ïÔZ^þ¤ psÀ¸þ'$Ly¶Æ¼%wÞŽ’;ïˆö!ˆŠ²ë®…»â8Å?÷ôþí*5¶Ï£‡íóplŸѱŽbA!tÛÿå—\ û¸'ë´M]Îi}yO<²Õ 0­ZU©Žë¯kòýuŸqzê.A³o?Ynò:Që¦>”Íž=(¿´OÄaÿ¤Äš/ŽÚÇŽ9bù¾PÙ·C„hï.ÕC}ÚNbq14{öÀÝý,øÚ´‰Xžd±~n³Â}æuV6 6À{҉𜸠íOI‰öîG?)),’- ŠóhÀöyt°}ÛçDDDDt¬cšÅîÝ{™ÙjuãÞbR\,ò§NI3üü RｉãžÂþUËCÖ n7ŒëÖC³w/ VÃÓ¥ \gw"\€4®[Áã .ËF#\ç[¯ºÄ¾5q¯¾Û!âÓ¡( 6@·ýÿ¿þÌL8{_ã¼Ú;¡ß´ ª’HÉÉpõìñÎaUY ¿þoçNðµm Uy9LË–C]1/ƒëœsàíÜ)t›ÒR×þ±¤¾¶má:·gä:üû/lsß…?=?ÿ’Í(úR†€ù‹/QvÕ•p^Ð+d;1?Æuë×ᬳà=©ÚÝ·ŠÓªàk“ï‰'B·u+ ÿ€¢ÑD̯ßòÄü|¨ss+N®ÓÊU!y\çœr¡¬¾çT$~þš}û ÅÇ£ü¢‹•ãºõðµooÇÃ} GŽ>osÕ5Ж:7=rOí®ÝÐìÙgï !x½0­úb^üéé(¿ø"(z}èùq:aøù—4z:<'Ÿ±|ãšµÐmßx­ÿû'ä¸x;u„¯];ѱ¯`ô¨:]œÖmÝ uî¡4ç½ ètGܶ®´;wÁ°aT¥ø“á¼ðBH ñÑ>DÇ¥ú¶Jo¹Žk®>b¹žSO þîÅ,[Æ (¿ôR{¨Ñu6lø²ÉR"Ìß| _›6(¿´D{b¾ýR|<Ê®ìÖž«Sû£‚à÷ðþ'h„”g¯ók¬é‡ÕbcáîzfHºfß>hwì„ëìîÁ AC‰ö×­ƒúP^ î=zÀÛ©c£eK`ûœís¶Ïñ}NDDDDÍê¬,@T!oÚ³(»âò°×Myx8×^ƒ¢¡CzÏýÐ<\W0zTÈݶíH½û^ˆÅÅð§¦@Uꀯ][¸»u +×üÅW€,£øÞ»ƒ;$ÂþÔxHIIð§†N:oY° Óžƒ¢VÃס=Ô¹‡Ÿ²«¯BÞôg¡TžA@ÊCÃà¸ñÈ&#,ó@JI˜› AQ`jJn¿-X®möÛ0­ú!¸lZõCÈ2ül1<§žÚ sª*-EÚ »¡Û¶²ÅÙlFüôç`7)ÃF pøÃð>ô`½ßŸ`Zºq3ÞDÎœÙH÷ÉH2ÄâbøÚµÃÁÏCŽ‰9|xss‘òа2Joº1ì‚T¥äG‡ÊÞÎ:ÿcXç\W8b8Š| Aõ&¢c“mî<Ä|·4$mßÚÕð§$7¾pIBâ¤É°,\ Ùj…?5š}ûÈf×]íÝ'ÔÜvj-b_ŸÙfƒö¿P•–B,*¡—_ ´±ÊÊ!B»k7 Gþ­¬sû€ªÔ´Aƒ¡Û¶=оQ«í{îŽXŸ”‡‡Ãyî¹È™ûvHºiÙrÄ¿ô ²>þ5x-Ÿ|ŽÔ×®-ÄÜCH(™Š’;n‡}ü؈­ÖŽís¶Ï+±}Îö95ð¨Ùüûßxÿƒš%ˆAø[1߃ª¬ ©<E¥Â%Ÿç^ˆù~’G>‚Äg&ãÐK/„±oå J`x“Œk®oP5 ¿ü põ8'$=ùÑǡߺ 9oÏ‚³÷…ÍþH»ã.$‰ý+¾{f\³–E‹á¸ñäO~Š(B´ ãæ[‘øô„°;Bå˜øSS¡ûç$ÛLä½ü"|‹Š ›cBê’ôä8¨\.d0®=EAì[³ûVøüHú¿þªØŸð¡ü©)aw1ë7þÄg&Ãyþy8ôú«»—ñ/¿ ÛÛsàíØEC‡Þ@a\³ž.]°÷ן![ÌÐ8€ôÿÝŠ¸—^AéM7BÑj‡^y ‚$A³k72nºŃ¡høÃ!¯/W»S¶>ç4nÆÐmÛŽÂa¡èá@ïÓòH|frè{¬!T÷e℉°O|å}. —ç^€mÞ{°|¼Å÷ßÌîkß{6m ¢¼=®îgáÐŒ×IBÂôçaýàCxOèŒÒ[nŽöi¶ÏÙ>ÛçlŸQSjD ˜èÈ*ƒx~¿¿ÉÊÔîÜý–-ðµÍ aóÍwív {(dâô²Ëû¡ü²K³ô{ˆ……!å(=d£²ÑÔáFg•£ Ö÷?€õý;sR†@ü /¡ôÖ›QzÓ‡ë·c ¿üŠò‹z/»M‹ï»bQb–~L÷gf"ïÙ)(|øA(<¤„x”õë U©#âÄìþä$hÿýª²rä¼= î3N‡o§Žð''W©ËNhÿýe—÷;üO¿  èÁ¡ðµÍ +WÇWÇ;óm|( }xè!A@áˆaâã`ùxAøqt:‘÷Ü´àÐ:¾6mPvÅåP••îl®gûœˆˆˆˆš[’ÔìÓOåt!fY` Áãö¿°,ZÁï‡}ü¸àCúM›î”íö2<'ŸÓòÐmÝç…4x?Ä¢"$<;=´ìÓOƒç¤“CÒô›6@ĹÜÝÏè¶nnþÀÛ±¼;@åtB·u+TŽ2’±¤8p ŠŠÂÊ‘-@QPôÐÐZÿ!ÔþøGÔsÚiáuéÚÚ;CÒ·  èêv—¨nÓfH6[Ø\ŠZ ÷gÀôÃjˆùùƒë¼:AŠ‹ É/U\Ô‹Šàkß¾Á種T¥ˆùù÷Cµ‹ ÎKûßså:'ôÎo).ŠZ 1Â9%"ª¯„éÏGœ·ÉÕ³G‹ôàÑ<1?å—\ö[%ÅÅA6›¡ßòW´Óq§®m§JÕ‡z«ä:·gØïXs’bcƒïgÙ`€¸à_±,ø|Á¼õiˆùù QÞ÷²°}ww=3â¾7'ý¦Ml6È&Sx›õ¤a\ÿT.dÑÑÂö9ÛçÍís""""¢p àQ‹hhO´Û‘<|dpYE¸{œƒÂáÃàîzæá|yÒîPkYQu¾Áë…:/¦¥ß#aòĬXìwÞT*ˆ…þªþS\©òãªw«ÊÊ8qLK¿‡à÷CÑjwµújéµXqaÄ}j—Ú_IIàumÖ°urÕ94*oÅÝ¥*§NŽÄÂBøÚ·‹¸®ê¾V=’5Âëª*.¨) <9õ¤ræD©>ï €¦™ª‚l ?îP©¥…v”ˆŽiš]»&,Ý×®m‹¼¾Xø-3ý°¦VGÎSeÞ#jum;U²‡òË. K¯k° ©ÈÆ*íA}}Aùí¬OûC,®h EøM–cm-º@às#xŒíóFaûœˆˆˆˆ(xÔbvîÚ…ììdf¶©ó6þôt\\1Ì‹J¸øaø/¥âfî¯GüÇ ÓT­¾ŒŒà;¶¹ó`\·ÎÞBQWÔÏë ÛNp–¶¯ÄLœð b¾ù¥·Ý‚‘#‚Ã)ÅÎ~q/¿Zk=¤„„Ú+Zq!AåÄž”žuVÔYÙðvêxä¡VCˆ°Ÿ@`(ž@Í‘Ëiis`ŽàõÕ·4"¢¨È™3 ¾¢öú•¿½ÎÞ† w)µœº¶*ÉVK“^oõiÔÒªïo¾ 7þ¿¢Ñ@6›‘ûæŒó±}elŸ¿Zk=Ø>o ¶Ï‰ˆˆˆˆÂ0€G-BE xW½‚w ˆª:]Äðeæ‹m6¸Ï<£E÷Í_1…fß¾ÀrFF`9+;,¯&;'$˜V® L@?áé¡Ô99®[ð.ÛüüðºT™Ï¢’»kW6üÆ aIBÚ€A(ë×%îø2Ò¡ÉÊ‚ Iaó*©sr• þ´Ôæ>õ?. ñ€(BÌÍ [§ýçŸhWˆè¨àk“˜»Ìíiñß^ªY]ÛNG³ú´?¤¸X‘ÛBêm5P!bDo¶Ïk8.lŸ…Q5¾¢ÚUïN<á„f{ÊÉèÍŸ/ [óõ7°~ðQÄ»9K$Ä|·‚½ \={@Ñh‚é!uùî»@}+çúP@Q Œ!D»1߶d©Áõóœr ÀðÛ†tUy9 ¿þ–ßqýµ€(Â:ï=¨ÊËCÖÅÎœýÆ?Bî°v^p—ÆU?„äUgeA¿å/¸ºwo•s¸( <'Ÿ ݶíPç¾H r8`Y¸8ÚÕ«Û>hC‹ .W´«BDÇ2A9â*Ùl\XÞ¸šýBÖ©ÊÊ?ýyè¶nöÐ1¨>í).þ”dè7oàñ„ä7­\±|ÙbæàÁ!õ¯¦5k\¹Êöœùsãì}!Ÿ1_}¶.væ[0­X‰cÛ瑱}ÛçDDDDDáØšUKï€À„ôÎ^½`þ| d³Žk¯¢ÕÀ´|bg΂ëüóP2àÎ`~ÓŠ•PUùǪr8s•‹)ž“O†·s§ÃyJ°ÍXüPçÛa\½šà¼ø"8Ï?/°ÊfCñ½w#ö­ÙH|z"Šï¸`°ô{˜—| çE½á:çì@9‚÷™gÂðÛo°~ð!\çŸíŽˆ{õu”þïFØæ΃á—ßà>í´Èó5/³ ÜÝÏ‚ñÇuˆ›ñ&×\ ±ÀŽøç_‚?5 ÚÒCó·o¢† öÍ™H¿ùV”Üyd«¦V#æëoà:·'Jo¹9˜¿øÞ»aþâK$Lžø§ûÔ.Ð8€„©Ó¡ ٬罪úžÓâ»!ù‘G‘6p0Jÿw# ¨`ùìs8/¹Ö÷?+ß²hqp¾§Ê9RbgÎ ®/zðÕ[åt´rÕáå’ÀüšýBêî¼ ¤ØØಷSG@`ýð#H±±­VˆEEPvY„€IDATgç hè;îDÔºé7m‚æÀÁàre Í´b%dk`ž!R\={DÜ^¶Ù Û¶¶wÞ…lµ@Q«áî~VpØ»‚Ñ£6`R߃‚'Ÿ€·s'höíGÜŒ7 Ý¶åýúFûÐW®‚ú`VÄu¾íQvy?€f÷nÄ|¿ Ý¹ ÿ}cð·Ð}vw¸ÎîÞ"u®oûÃqà ˆù’y…ÃÀ:Ä¢âˆå»ÏîÓ²åˆ{å5”]ÕbI)bßšr2ÔÙٵΕU9Ôbü³Óá=ù$(j5|íÛÁݵ+ dÐ@˜?[‚Äg&AåtÂÕ³'T¥¥°Îÿ1_ƒ‚Çm‘cØØ>Œís¶Ï‰ˆˆˆˆêŠ/=*äX\Œøç_,d“ ÞÎQr÷ À?ÍUîÐ-1ŠVÛ¼y°, Ü1ªèõ(½å°y"ä5íOGòðH˜: %&ÂþÔ88/èãÚa{g. 6àà'‹v\žŸŽÔ!"ö7ûÆ›€(¢xÐH ˆîÀïÉ_8üaø;k6'N Ô]£AÉ·£ðÑGBæ‘ýáûHœ0©<L÷vî„œ¹sàîzf‹œû†œÓ²+û, Áòéçð§§ÁþÄc­ÖÀû§Êùë‡A»cgHZÜk¯Ÿ7ô˜o©c%Æ 0l8|gvÖ¢!|íÛ£à‘‘ˆ{ó-$?úxEa"ÜgœÁ Dd¿1_–ž0ejð¹³W¯xùžBü /"nÆ€ßA–‘÷ì”`ÏÝý,äÌ™„iÓ‘òаàvž.]3ïý †‰Y¶X¶<âºò>—xº;C~÷ÀðÛo0üö èá‡Z,€WßöGÑÐ!ÐîÚÓ²åÁ‹òÎ^çÃ>n Ò †à m ÙÇ<1/±³ßFìì·¡èõ(ºÿ^ø23¡ß´)¬'_õ×Rgeòd ð‰A–á¸öš`O²Ù=ÿC$<3 Sž öÔó§¥Âþôx”Üq{‹ÖÂöy Ç…íóˆç”ís""""¢PB#òÕ”&Dx^u¹ú£rOU„ç±Ê_U•eu•e±ÊzM•euÅ£êsMµå˜¢â’WkÛyŸÏ‡Ò’¨5 ˆu˜¯">.öˆyŽe«×¬EZZj‚wu}Ö•àñîŽÖhàOI ù‡¶¥ ’¸«]‘áOK «‰:'‚ß_ZZÈ08ªRdsLØ?¬õ¢(ÐîÜ U©¾ví ÅÇÕiuN.Ÿþôô#G±¨bA!$›õ¨ž{ÇôÃj¤ }ö§Æ¡äÎ;¢]#|>¨ss¡ˆ"¤øx(:]´«DDÇ)1?b©þ„øõJ!jˆú´?ÔÙÙÐdeßœ _æe‹‹¡*,„?5 ŠAßäuW9PçåC6ÇÀŸ˜Ø¸¶^+ÇöylŸ×ÛçDG·ï—¯@÷îG¾ÉGQx½^8ËËá—$¤¤¤DÌÇktDD­×²&þεYG(à¯xH|Õ–«>¯\/WY–*–ý”*ËR•e¥"­r.„êÏ•Á]ª²\}]ÕÔQúÇ\Ñéàkß>Ú‡ PQ„¯mfòúS#QÉsã+"ðvî\ïmê3Á½rjk§û¿`}ÿ”_|QÈo†õ?<§œí*Ö‰¢Ñ{ÂE“”˜)11ÚÕ ãL}Úþ´4øÓÒê^¶Í³9Èf3¼æ&hçØ>€íó0lŸ…bšE´‚wDuåKK…ñÇaZ¹ …‡òàk› Æßa]¸î®gÂÝ­[´«HDDDDtÜ`ûœˆˆˆˆ(£,Dt\’­Vd}ôâ_~q3f@UꀇҮGÁc£ÿDDDDDTglŸ…bˆŽ[¾ûFÅD÷² ¨T+ˆˆˆˆˆŒís""""¢ÃØ&"xq€ˆˆˆˆ¨5aûœˆˆˆˆŽslµ" àµ"œ¨;ýMFH MV¦ Ióí€,C6![­‘3Ê24BÑhàOK­¹Ž²\–lÖšË$""ª ÎÉ…àõ—‘ˆbÄTNWpYÑëàONŽvÕ©kŽ¶ÑñŽ<¢*IBfßËQÞçäÎ|£Ñå©\.$Lš‚˜o¿ƒàñÓË/íƒÜ7g„ç/+GfßËáËlƒý+–ÕXn›þWCðzƒËEC‡ päˆh>""jåR í?ÿbßÚÕð§DÊ%ãúõÁew·nÈZðQ´«N­TS·ˆˆˆˆˆˆˆ(€dˆMÙh„ë¼s›î@* ¿o„nÛ6Àm[8/¼Š^ßt¯ADD-ª`ô(ø:t8b>ÝÖ­Pç Is^Ð ŠNwÄmëJ»s 6@Uê€?)Î /„”íCt\:ÛNDDDDDDDŽ<:ê¸Î;în]aø}#ÔÙÙð§¥ÌŸ-AâÄg• þÔTˆv;Tee(4c+'iìx˜?ûŠ^)>℉°OxªÑõ3®^„g§—UR’§àñÇP|ÏáaÉ’Æ< Ñ^\>Òxõ!"åÁaÐoÚj d“ Ú={áOL@î[3á9åä¦=ADDÔªØæÎCÌwKCÒj›¯^$ ‰“&òp1d«þÔhöí ÿ™ p\wm´wŸÐúÛNDDDDDDDŽ<:: ªÀ_10„¤ª¤‰OO€¯CdÍÿ²Å ÁçCòˆQ°Í{åýúÂÝõÌàæ¦+aþìs”_r1½ö ­šýòàîZé·Ãñ¿›™_ › dð^HE« YÞ·rEd\s}“ª¤1c¡ß²‡^}eW\ÐîØ´A÷ åááØÿý·aõ!"¢cGÞsÓ‚=²&MyÉMV¶mÞû°,\Œ’PðÄcPDª’¤<4 ‰cÇÃÓ¥ ¼;EûЪÛNDDDDDDDNí Õ—vç.è·l¯m&üIIA–‘?m*ò'M€l ̤h4(­¤éþú+¤Œ˜¯¿Œ ^ù2Û hØC®Ÿ¢VC6!e•*¸\ù¨>žbÐÞ¦ §ÒìÙãÚQveÿ`ð áYôÀ¨³²Â†÷$"¢c‹¢Õþý›vîTÛ{ïß– Þ€lµÂþôx’Ë¢EÑÞ}Bëo;Q8öÀ£VMåt!fY`®Áãö¿°,ZÁï‡}ü8@D»¤ØX8®¹‚ßíŽ ¿Í±¨(¤\Ý¿ÿA¶ZákÓ&$½êæÇýŸ›ž:C´ÛCÖy;u äÙòÊû^íªQ=%L²É–îêÙ¥·ÜÜ쯯9xb~>Ê/¹ªj¿³R\d³ú-5°tj(¶ˆˆˆˆˆˆˆŽ àQ«&ÚíH>2¸¬ˆ"Ü=ÎAáðaaŒbg¾Û»ïAåp@E( ŠÜMURÉf K—l¶ëb\½É£F‡¥ïùcCp8ªÖF, Ì«ÿÒ+ˆé•Èy êS$µš]»&,Ý×®m‹¼¾XP0ý°¦VGÎcçoLKkMm'"""""""j8ð¨Uó§§ãàâ• ’Õ1XfY´q¯Í€»[7äM›_»vý¦ÍH¿õöð‚•ðdŸ¯–º¤ç¶ +«µª¸°[ôàpöî1‹íZQäÌ™_‡Q{}¥â7ÆÙûB=8´Ö<ÔrZSÛ‰ˆˆˆˆˆˆˆŽ$õâË̘—Ï}æÑ®C|m2A€àöð7¦iMm'"""""""j8U´+@Ô$”Àá²Ñx8M–aýp>@äìžSNÊå‚îï­!馕«¢½'õSy-Âñà:»;ƒæ/¿‚ I!ëtoEìoB}èP´÷‚ˆˆZ+A9â*Ùl†»kW6n„fÿuª²2ÄOº­[ëò* ÇkÛ‰ˆˆˆˆˆˆè(ÁxtLpwë ãúŸÿâK(¾çnˆ…°½ýÜguƒþÏ?¡Û´ b~~àŽtA€ãÆ`þêk$?>ù“Ÿ?) Ƶk¡ZxHLÓŠ•P¹\Áe•Ó 0õu0ÍsòÉðvî¶må¼31K—BJN‚¢ÓAQ«QÞ¯/dƒ²ÙŒ¢¡ îåW‘zß=0þ¤Dè7mFü‹/‚€’¢pƈˆ¨%è7m‚æÀÁàre Í´b%d«àOJ‚«gˆÛË6tÛ¶Ãöλ­–@îîgÁ×&Ðc«`ô(¤ „ÔÁ÷ àÉ'àíÜ š}û7ã h·mGy¿¾Ñ>Tƒ£¹íDDDDDDDt<`Ž %ƒAÿ×ß0/ùæ%_@1èQ2–>Füs/~?Yƾ³»CNO ¹²^ØÙo#í®Eáì}!ìOƒl6·è¹""¢–c¿1_–ž0ejð¹³W¯xùžBü /"nÆÁߘ¼g§xîîg!gÎl$L›Ž”‡†·óté‚œyïÀÝõÌhªÁÑÜv""""""":ÔõvY¡iB„çU—«?*‡ñTEx.«üUUYVWY«¬×TYVW<ª>×T[Ž)*.yµ¶÷ù|(-)Z£Á`€(ŠG<`ñq±Mr‚ŽMy϶ª¤ba!ü©©PôúÃéN'­ŠZ–_»sd“ Þ:ªcxTYY†&;ðû!%'C6¢]#"":†ˆùùKð'ÄC¶Z£]ª#¶ˆˆˆ¨9}¿|ºwï~Ä|Š¢ÀëõÂY^¿$!%%%b>^£#"j½–5ñw~¬Í:@ÅC૶\õyåz¹Ê²T±ì TY–ª,+i•sIT®ÔðîR•åêëªæ©KZöÀ£cŠlµF¼h2¿KµüE»Ú-C¥‚/##Úµ "¢c””˜)11ÚÕ zbÛ‰ˆˆˆˆˆˆ¨uâ-³DDDDDDDDDDDDD­xDDDDDDDDDDDDD­xDDDDDDDDDDDDD­xDDDDDDDDDDDDD­xDDDDDDDDDDDDD­ˆ:Ú j*ªRÄ¢¢4_ÛÌhW HÄ|; ËMFÈVk´«ubQT¥H‰ ÆhW‡ˆè¸ ÎÉ…àõ—‘ˆbÄTNWpYÑëàONŽvÕ‰šœàvC}(R\,d³¹Áå´æ6h´µæcÃöy8¶Ï‰ˆˆˆˆZðè˜aY¸ñ/½’¶{ûßPj¸@ÙT.&MAÌ·ßAðx‚éå—öAî›3¢V¯Ö væ,X?øy/<Ç5WG»:DDÇ…Ô†BûÏ¿Ø·v5ü)‘ƒrIcÆÁ¸~}pÙÝ­²|íª59ýŸ›6øØÇŽAÉÀ .§5¶A[‹ÖxlØ>¯ÛçDDDDD­ xÔjeÜpShQÙfƒûŒÓQzûmðed„ä/»îZ¸Ï9ÿÜ Ðÿùg“×)qÜSü~ä=7­Nùc_}æÏ—ÀyQo”]ÙrL „òòFÝåÝœT¥dÜ|këݧŸ†¼ç§7ÉkyO<å}.?%¥Ö|êì´½´/öÿ|™m¢}ˆˆˆ¢.þ…aZµºÆõ¾6È™3;â:Wð¥§CÑëjÜÞ>n ÄR mààhï.ÕC}ÚNæÏ– vÎ;µ–—?i\m+ãúŸ0åÙó–Üy;Jî¼#Ú‡ *Z¢ ÚZ°}ÞòØ>'"""":~1€G­–f÷@Qvy?€Êãfß>Øæ΃õãÈ™õ\={óû“’àOJÈ–æù\¿e ¼'Tçü¦×A²Ùûæ (ê£àã¦á>ó €àõ"æÛï %ÄÃyÁo‡öMöR¥7݈қnýß’(J´Q« >”Íž=(¿´OÄ ÎRbbÛÚÇŽ9bù¾à«x®B´w—ê¡>m'±¸š={àî~|m"_€—,‡‡”lÖ`A• Æ ðžt"<'Ÿ G¼à,k‰6hkÁöy°}NDDDDtÜ: þc¡£ÑîÝ{™ÙêFþS,ÅÅ"êä4ÃÏ¿ õÞû‘8î)ì_µ¼Qåkwì„~Ó&¨JJ %'ÃÕ³Gð"CUú-AÌÍ…v×nH±±0­\u¸Žñqpwí\Öì?íÿÌ#$ÅÚ`\³6¤ds \gïI'†ÕEUVï¿ÁÛ¹|mÛBU^Ӳ凷;çx;w « ¿C6™àOJ„ù›oákÓå—öh/@Ì·ßBŠGÙ•ýŠ ´²Ñˆ¼é»ëÅ¢"Ä|û¼:ÓÂŽß®ÝÐìÙgï !x½0­úb^üéé(¿ø"(z}H~uVtÿ÷OHšçÔS#ã¦r8`ømLK¿žwíŽÁõ®³»s®":®Œ_‡ĢۺêÜC!iÎ zAÑ鎸m]iwî‚aèJð'%Âyá…â£}ˆŽKõm;•Þrs†Êóœzj°=³l9 6 üÒKQ8ì¡F×¹¾í•Jum;€à÷ðþ'h ?z_c}L?¬† w×3CÒ5ûöA»cg“´AD{ŒëÖA}(/P÷=àíÔ±ÑDz%°}Îö9ÛçDDDDD-ƒRFMslhf…·êÛe}üÜgukP½‰ˆŽ'¶¹óóÝÒ´ÚæÀ«IBâ¤É°,\ Ùj…?5š}ûÈf×]íÝ'4QÛ©5¤½RŸ¶“ªÔ´Aƒ¡Û¶’ͨՀ,£øž»#Ö'åáápž{.ræ¾’nZ¶ñ/½Òè6ˆå“OƒÃ‘úÚµ…˜{ %SQrÇí°¨<°}Îö9Àö9QSSE»tìú÷¿ÿðþÁï÷7}áBÅ[W´¹qÍZX-†ãÆ°÷ן°ÿûo±oõ*HqñH|z·;$ÿ¡W^Âþ•Ëeý¯ÀžMƒœÙo…ä-½ãöà:Éfƒç´SCòïÙ´%ï æ×oü‰ÏL†ëìîØ·n ~º{×­Añý÷!æëo`›37¤|9&þÔTèþùIcÇÃß6Y‹bïÏëqàÛ¯Qví5‡3‹"ŒëÖ£øîÁØ·f¤¸8$>=ÅCîǾµ?ÀŸœ Ó²e ?ªÀñOœ0ö‰OcïÏë±÷ןP'""""jR àQ³jŽ žvç.è·l¯mfÄátꟙ‰¼g§ ðá¡T\dâQÖ¯/T¥h÷ì ɯèt †À‚(B6ƒêC)jup(*UH~Ùh ¹c×öÁ‡€¢ ðÑÑM¦@¢  pÄ0Hñqaÿd€?9 Úÿƒª¬9oÏ‚ûŒÓ!ÅÇÁÛ©#üÉUzTŸeW_ E¯‡÷Ä */GYÿ+ hµðž|Ô‡ò}NÊú_ò>—_³øþ{ºþ =6UŽ¢ÕÖ^hÅqƒ:p~½!äBů/"¢ºP´ÚÃß½M¼±½÷>üii(xâ±`Ù²Õ ûÓã!H,‹E{÷ µ·t›· æÛï† Z®‚õl¯Ô·íóÍw𧥢ø¾{ƒiÎ zÁqõU-~.¬ïÈ2ò§L ôQDÁãBJL„õ£[¼NMís¶ÏÙ>'""""jzB“š]e¯!Ãiªœ.Ä, Ì£!x<Ðþ·–E‹ øý°×à!†¼;ÀÛ±TN't[·Bå(ƒ IKŠ¯[TÔbÇG·isàNà“O IWÔj¸Ï8¦VæêHL ®“-@QPôÐаá{ª“bcƒdƒrLLðâ…l0@ðù½®sÎ }͸8(j5Ä<ŽDDÇ›„éϾ°\…«g”Þrs³¿¾æàAˆùù(¿äâ°ßM).²Ù ý–¿¢}˜Ž;õm;Yç ëüð ‘ëÜža¿ïÍ©>í•ú´Äü|ˆ……(ï{Yؾ»»žqß›“~Ó&H6d“ ¢Ý²ÎsÒ‰0®ÿ *—ëp`ªbûœís"""""j àQ‹hhO´Û‘<|dpYE¸{œƒÂáÃ5D‹ª¬ ‰'Á´ô{~?­Š^øša¸Ï#íca!|íÛE\'ÅÅóT½@PyaÄ}j—#–/ !Û):mh9ŠÒè}ˆ8Y½JÕ$eQdš]»&,Ý×®m‹¼¾XP0ý°¦VGÎc/ˆÞ:NÕ·íd?å—]–Ò^hõi¯Ô§í$—Ò#´UäX[‹î#øÜÚayT……ÓÓ[¼nu޶σyØ>'""""¢æĵ˜»v!;;™™mê¼?=W Q£R.¾4Áð_‰žAÌ7ߢô¶[P8rDp£ØÙo#îåW[öÀ¨Õ¼Þˆ«TNgEMÄõRBBËÖ•ˆˆZœ9³àëÐ!j¯¯T½/DуCkÍC-§¾m'Ùj?%¹Ž¥·õi;UUYË+xë×ËIøP4Èf3rßœQcžÖÞ¾cûœís"""""j àQ‹EƒÞU¯à(¢ªYþ 6­\j ò'<2Ì:'§Å/#š¬,’67‘:'P©àOKmñzÕÆ×�—“Û÷™gD»:T¡¹ÚN­I}ÚNR\,@ÌÏ+G•±|E"oÄC‡_÷Ì6ÐîØ Ïi§6ùœ”-…ís¶Ï‰ˆˆˆˆ¨ep–ijv•Á»O8¡å^´òŸþw[CQEb0†\ívÄ|»4°¹,…oV1©»àr5iU\Áå†qÕ!éê¬,è·üW÷î­z”æÖ\Ljˆê@EŽ¸J6›áîÚ†¡Ù dª¬ ñÓŸ‡nëÖhïƒêÓv’ââàOI†~óOH~ÓÊ•Ë—-h jPðzaZ³öÈ•«­ Š@UÁçCÌW_‡­‹ùL+Vâ˜Åöù1ƒís""""¢–ÁxÔ¬¢¼‚CîÄ?;Þ“O‚¢VÃ×¾Ü]»‚÷™gÂðÛo°~ð!\çŸíŽˆ{õu”þïFØæ΃á—ßà>í´¹#d‹þ¤$×­‡õÃùðµk UY4ûöÃqýµð'7lø©â{ï†ù‹/‘0y*žS»@sà¦N‡"(|dd‹7Áí†íÝ÷‚Ï@“•Ø™³þô48®½¦Aekö€~óæà²þÏM!@Q©PvÕ•!Ûy;u œË^Déí·‚Ñn‡¢ÕÂqݵ-vlˆˆŽFúM› 9p0¸\h3­X Ùjø“’àêÙ#âö²ÍÝ¶í°½ó.d«ŠZ w÷³àkèQ_0zÒ Bêà{Pðäðvî;ýˆ›ñ´Û¶£¼_ßh:ãÊUPÌŠ¸Îס=Ê.ïÐìޘ;wô¿o ¶Ügw‡ëìî-Rçú¶7܀ؙo!ù‘GQ8ìa@¬ó@,*ŽX¾ûìî0-[Ž¸W^CÙUý!–”"ö­Yð''C]ëbµ¶A” ógKøÌ$¨œN¸zö„ª´Öù#æëoPðØ£-r £íó†aûœˆˆˆˆèøÅ5›hï h訳²aY²øD‚ Ëp\{Mðâ‰ýéñH> S§¤ÄDØŸç½`\û#lïÌ…aÃüdQH¹ùS'#iìx$L™Lóed ¬ÿ ®«”€ìßG℉H}àÁ`º·s'äÌw×3[츩\.ĽözHš:++˜æ:çì_ 0ü?{÷ßTÕ?pü“Ü$Mš¦IGº€‚( nõ§âx\ëÑÇ…{‹{  .Ü7"‚²\¸d>àQq²W mšîì{óû#mhH mi›*ß÷ëÕ¹çž{î¹#¹—û½çœÅ‹q—ž>uéS§‘·yw|@P}î9X¾ù–´Y_“ºè›H>‹™Ê‹.l·ý"„WöÉSIûô³¸ô†×1ÏÀðJ|€¬'Ÿ"sì‹ ¡Ó4J àùúõ¥xÜkdCÞMC¢Ëù÷ߟâ o´ë5L´LÚÌY0sVÂyµ' ६Zw`Y¼ËâÅ”ß|S»ðš{ïT~Ãu˜Ö¬Á:sÖÙsð < ×°¡ ¾]0“ß5ô”’2^{Œ×^'l6S~íÕ 1/[×’oÇuíìTu8(šü6Ù?BöÈÇ¢­ÑBù¸F §òâ‹Úe&ƒÜŸ·ŒÜŸ !„B±çÒíF¾ÆÒt >7œÞñ¯¾O}‚Ï:@ið¯¾Á´¡Á´Ò`¾±Á´¡î¯ágãÓiå•ÏílãƒÁ U••ŒF, JƫȪocO5oþ ò›¼kêIØ Å[Ñ…‚  ÁqÕWU£ÙÒbºð‰Ò4 ÛJЃ¨™hii­V¥¼¥Ìê°ÿãǯi.}m-Ji)áÔTBYY1ÇK!Dò)¥¥(UÕ„²³bZÈÑ–šsïd(*¸¥ˆPn.Á&ŒË¬TT w» 嶘[½îúêj %¥h¶4BNgâûÎ=ÜŸÿ}Èý¹¢)¾šõ5ýúíú%Ÿp8L ÀS[KHUÉËËK˜OžÑ !DÇ5³•ó3öÛ€ T÷§Á¦~®Ÿ¯5˜Vë¦C@¸Á´Ú`:\—VßßÿŽŸÃüE7©ÁôŽóæiJZ i'ÚÄÑÂ`èø§W(?ñƒ–nk|!½¾Ñåv—š‘š!7–‰hV+šÕšìj!„h„êt¢:É®†ØÃ4çÞ)TP@¨  ée;ÑnÛ‚f³°Ùv¿ ¹?ÿûûs!„B!Ú–~÷‹"Þß!x'„B!„B!„BÑIO!„B!„B!„BˆDxB!„B!„B!„Bt ÀB!„B!„B!„¢‘žB!„B!„B!„ˆð„B!„B!„B!„è@ É®€¢ý(åå諪QÙh©©É®ŽBˆvf(ÞŠ. ع(J˜AƸ7vZ^é#â=üpR}CöÈÇÍ[yÉET^rq²wARÔœõo|uû)ëñ'1ÿôS²«Ô¦äþ\îÏ…B!„íCx¢M¬]»ŽÂÂ. -?Å [¶Ðùü Q\.jO„ï 1nÜ„íãO°ü°”¢Ioá߯w›o‹ÞãÁ¸n¶ã¾åæè¼ôiïb\·ÍbiùvoŸn5§Ÿ†f6£SU Û¶‘öɧØ>ø÷·Q~ݵ­²-UçKÕyç¶ù>BÑv ÛJ0®[Gí vû§:.ëºè.ËvïN°îsX§KöæŠf0®]ŠBÍ)' ÷û1nØ€cüìS¦Rüê+xô@©¨À¸n¾~}c‚ ©éöíŸv|‡ €aK–%KìÛ ïȽ؞|åäÊÉ@KoyWœr.÷çB!„Bˆö#<Ñ&Ö¬]˼ù ¸lð%-âe?þ$ŠËEÙÐ{¨¸âòhzõ¹gSpéåd?ü[¦O@q»1ÿ´ ÿ~û¡ff`ýz6¦õPjO>1úP¥žqýzL«×à=ü0´ôô˜yÖ¹óP3øúô‰I÷ï×ÛGãrèt(n7©óæèÙæMÛ3†ÃXçÌ%”Ÿ¿Þ¤~ó-)+~!l4à8ï}noÙÝwÊÛ>Æ¡x+.¼ˆÌçÇRsê¿â®™V¯Á²d úªjB9N<ǃšW®aËR~ÿ#v[8 f]B!þ~Êî¼`÷î»Ì—²r%†­ÛbÒ‘{Á |}‰I7nØ€iÕj¼‡õC³ÛÙŠ«ŒÔ… 1l+‰Ô½ûì½Ûû²­Éý¹ÜŸ !„B!ÚðD›ù󯿘8éñôUU¤ÎžƒêtR1øÒ˜y¾>}pß~ZšªVL«×wÓÊî¼Ûç_ ¸\„F Å[É|ö9ŠÇ‹y“öÅWd>ÿ[¦O¾M^/÷ÖÛñõ=”¢·ÞŒI¯=q™ÏŲd Þþý±}ò)a³o¿¾Ø> ÐéÈ»iµ'Ÿ„j³‘öåW¨ÙY7m†§ŸÅuÿ}T¾d—û ”ŸGõ9çñÒ˘—þ¸ýªâ|äQÒ§½‹f·ÊÏøa„¡ôá©>ëß1å¤þo·ŽI+yòñ&=¬Bñ÷ç?´/¾ŒIÛ°`^ë<(næ5I$‡÷È#ðÚËK1*(Hv•bd¼0ÍáÀô×*ôUU(åål{æ)2Ÿ{}M-ŠÛiÍZÜ·‰.“>uÙ£'l0쾆­ÛÈ.-¥æŒÓ)óá÷žúªj .¿‚”_Cu8À`M£âª+Ö'ïæ[ðqÅã_I·ÎœEÖÓϲeÊ;øú¶¼ Åô÷ÞvGìÖeë6²+GQyñE¸†ß¨ì(äþ\îÏ…B!„íKŸì ˆ¶ú ^(jÖr)¿ýŽNUñöë Š7¿âª+¨ºà|ÂuóêÿÍ7žêÓOcý¢ÿ±aþ\ŠÇCà|àÁÝÞ_ßC åä`ûð#l~Dí ÇGíHQ°|÷=Je%ë¿YÈÆY_±aöLBd=ù†’’&­3¬<ÀiøÊ1a"éÓÞ¥ò²Á¬ÿn›>žÁúóðxÎû‡cZµ:¦ŒêóÏcݲ¥¬[¶4î|!„ÿ|%Ž^ªÏ>«UËnî5I$‘®î¶?Á}UÒ) © Qqål˜?53爇¨¸îZ6,˜K(7ëÌ™Ñìæ¥?â|øQ¼‡õcÃÂùl~ÿ]Ö/œOŵ×öég8Æ)>sìXR~ý²;ogýâoYÿÍÿ(yb ¯½Þ¼z¶óò8G<„ï Ù°`nä;óíB*/½û;“I÷½$ŒÆÉýy„ÜŸ !„B!Ú‹ðD›kIÏP\ @¨SóÞW32¨¸æêè›ËžGQ{Âñ˜V­Â¸~ýîmˆNGÍ™g`=Ó_aúóOªÏ9»Ñìúêj\Ƕ˜ë¶¥W_‰. uÞü]¯ÎëÃöù— (1oy;ÞšH¨ €²{ïŽ>Ñìv\#†£SUÒ§O)'¬(h©©h©©„M¦ÝÛB!þvÂ&Óöë@+oš{MÉaZ½óòå»Æu[˜òórÒ>ÿ"îϲdIûUP§C RsÆi„Íf½z¢¯­¥æÔ6™ôÞöíÁǤ·!Æ}×hVk´ ÷­CP³2IŸ25¦ø´Ï¾ T¹G¬ã9z ÕgœÞîÇÂ>qh¥#‰´PÊî¹ ÕéÄþΔv¯SSÉý¹ÜŸ !„B!Ú—t¡)ÚEs»ÓÔù|„MÍŸÇ{X¿¸4ÿþû‘öÕLL«×ìÖm·¶£úœ³q¼1ž¬'Ÿ&TP€·ÿáXçÌM˜7Ø¥s\÷dþýö"Òv”º`šÃªŠ¡¨ˆôwßǸaå×_íêʸy3Ji)µÇ‡¾¼y öÉñA#ïð~x»Õ[ÍȈžÏšÅ‚––†–šÖƒÑ¼)Ë~Fu8âÆ-  ø>ëÜy(¥¥¨N'Ji)ŠÛMíI'Æm»¯Ï! ·½-™—-Cu8ЬV—+fžß^¤.ú½×‹f±´k½šBîÏåþ\!„BѾ$€'ÚÍê5k(**¦°°Ë.ó†Í‘·bu~_³Ö‘hx-ÝDÞ¸Ý]½»ã?è@Rÿ·ò›nÜé%jVv|š==R—šš¸yÎÅ®«W/JÆ<ÓÝ™RæÀ:wÖ¹ó®Wq•íöv !„èøŒkÖ‚Ñ—ìÖµ]Ö/פŽIq¹È½å¶ètXQðõ?÷-CbÆ«ç>ŒÚÅ¥‡SÚ·U–Ú `¥ÓÅ®_§ƒpxû6ºÝ÷ê–°533šGu:Q**#év{ü:3íºùÞèü~ºuL£yôn7Z§Ní^·]‘ûs¹?B!„B´/ à‰v¡( —_vi“‚w°½kÖ¢æ­(ÁØuj¤ëÎpZþE2†w:»bð¥8&L¤úœ³š_—YE‚.Ì6Ïø€PŽСÙÓ 'x([Ÿæ9öÊo¼!qõ,'„⟧xÜ«»wOÚúåšÔ1…:ubó»u]Hêõ‘ÀÕNºNÕìéq-’:<ƒ] p–Þã©ËSwîÕÝé4-.¯.¤9tZ¸Yù h6[_Ûh5;»%¶¹?—ûs!„B!Dû’žhsõÁ»^={6yÿþû6™°,ýT5îÁ“mÆG¤}ù¥>@¨ÁʉŸWJKPÎí‰úÈð;>üQÜî˜.š©9ãtjš0fŠÒÔºÔQ33wùÀ&Ø¥sdœŸß!7ã(!„­K®ISXÑwØPk vî„qËtªt1ƒ^O¨ 53Ø~“·‘@TX§K T¶mÛýºvÁ´j5þhõ1)ۚܟ'&¿…BÑö–þðGy$Á`ó^ÀB!þÎôÉ®€øgkIð@³Z©=ù$— ûôwcæ¶m#ó™ç0ýùgܨ-ß}NUcÓ¾_LØ`ˆŽo ¥Û"emÚ“×:kv«m»qófŒë×ÇÕÀwðA-*S³ÙðõéƒeéRŒ7ÅÌÓ×Ô5æ RV®lµmB±‡Óé ¬%œ%×$‘,ž£Fçõ‘ºÃ8g†-[0/_·_¿èrjf&¡¼\Ì?/Gç÷Çä·ÎN|ߧ¥§cܼ9¦Õ—.À:Á®+WßÂKKü½ñ{ º`´O>›—ñò+X¿n½{ÑÖ&÷çìù-Bˆ6W¼B!ö4ÒO´™–ïê•Ý}'–ï“=ò1Œ«Vãë8JI Žño¢¸Ýl}õeÂ))qË幕ò®GK³’>ý=ÌË~¦úßgF xûõ ãµ×Qssåæ`Yò¶>Du8vÙMOS„rsÉ»i®ûï#ÔµË÷‹qLx‹`a¼jq¹ewÞNÁàËÉ¿â*Êî»—@}0nØHæØ1ýúµ'ŸÍkܸ óÏ?G§Í?-‹ù ¬×Ssúi»½½B!:ó²e< ¯¸lýz6ZݸO¡œ¼ú'\^s8Hùõ7o¼é>Î`Àׯ/Á.‘.±›sMSêì96oI8/Ø}/jN9ãÚµ¤}5 ÓêÕ˜XJÆ˯à;¬ÞÃúµK+®¾ÛG“ýè(ÂF#þöǸiÙ£ÆÖépßq[LþêsÎ!ãåWȽã.ÜCnØ'OE)¯HX¾ï°~XgÎ"óÙç©9ýT”Ê*2^y•Pn.†¢¢Þ'ªY!Ð{_ÂÁ½ºáëÓ€ÊË/ÃöÁ œ?‚ÞãÁ;`úª*쓧öég”Ý}W»ìÖ’ûóFö‹ÜŸ !„B!Ú€ðD›0 »¼ƒÈ°·L›L֨ѤOû”Èx.ûP2ú1¼G·LõÙg£¯ª¤Ó…GºÚÑé¨=þ8\#†Çä ôì‰ëþ¡d=ûùW]€¿Þl{öiò¯½?°ë îB°[7ªÿ}&y·ß‰¾²2Z÷mÏ>Óôñ>ðõëKñ¸×È=†¼›†DÓýûïOñ„7ðõ9$šfY¼çðqe¤OFúÔi„M&y@ „ÿPöÉSIûô³¸ôì‘£¢Ÿ=6À+}ð²ž|ŠÌ±/B(„NÓ(yld4€×œk’è˜Òf΂™³Ϋ=áøh/eÕj2Ÿ!f¾eñb,‹#­—Êo¾©Ýxjv6EoOÄùàCä_c4=ÐcŠÇ‹;ïÊo¸Óš5XgÎÂ:{žGá6”‚ÁW  †bò»†ÞƒRRBÆk¯“ñÚë„Ífʯ½š`a!æeËâZòí¸.Ö"ÒgÌ€÷TtšFõ¿ÏŒðT‡ƒ¢Éo“ýð#d|,ÚR/TkÄp*/¾¨]öaKÉýybr.„m+ Ýf !„ØCév#_ciºŸNïøWߧ>Ág 4øWß`ÚÐ`Zi0ßØ`ÚP÷×ð³q‡é´òŠÊçv¶ñÁ`ªÊJ F#‹¥ ãUdÕ·±§ …BšøŸà¦œ„úÚZ”mÛÐÔÌ̸ùæ¢ÓE—àrå7ß„ÞãÁP¼Õá@ÍÊl´\](„aKá”By¹­¶ý{ïw Þ¾})zû­ºul!l0ČҔÒR”ªjBÙYhv{«–-„B4‡\“D2(åå(enT‡}—c•ŠŠ0n)"”›K°°Ë®Ë®¨@ïvÊ/ l1·zÝõÕÕJJÑli„œÎíÝoþMÈýybò[(„±¾šõ5ýúíú%Ÿp8L ÀS[KHUÉËË‹Îk8^­Ç#Ïè„¢ƒšÙ ¿ù e8ì·5@¨îO‚;L7ü\?_k0­ÖM‡€pƒiµÁt¸.­~,„?‡ù‹nRƒéç5ÌÓ”´ÒO´‰¦ïšJ³ZѺwße>]Ý)¯¥¦Ø{×ùÃÁ®…m´ ÖѵMÖ :¨NgÕ_!„h:¹&‰dP32P3šöP.TP@¨  ée;Ñ.1Û‚f³°Ùv¿ $‘ûóÄä·P!„BÑZô»_„B!„B!„B´¾úÖwB!ÄžFZà !„B!„B!:$O!ÄžJxâÁwÈÁ¬ûa1áS²«ÀºÅßBúaB!„âŸHîÏ…B!„b÷HšâŸAQÐÒm„SR’] 2¦‰–ššìj!„B‘r.„¢•,ýáLF#&£1ÙUB!Ú•ð„B!„B!„’Œ'„bO%]hŠ$CñVtÁÎ’ÞUŽR^Ž¾ªÕ™-oý !„Hª¦\•ÒRôot:lN!”››ìª Ñêt>†m%¨™h6[‹ËÑWU£”—Ǥ»&{ó:¹?B!„Bˆæ‘xâoCç÷79oþõ7PxÒ)J]É®6/¿JáI§`='ÙUB±‡kÊõ1gè0 O:%ú—{ÛÉ®¶mÂüÓ2 O:Û‡3v«œôiÓb¾3…'‚NU“½yíBîÏ…B´‡@0ýB!ö$ÒOt\š†mÆGØß™ŒiÝ:t^šÕŠÿƒ)¿þ:¼‡Öè¢Þþý vêDØœxÌÔEß=ò±F—¯¼ä"*/¹¸U6#Ы'µ'O(/o§ùlBæs/°aÞìvعB!þ®²ž| ëœyÎvéLñ¸×ÎÛÕõÀ5l(JU5—]‘ìÍÍÐùœób[O*z4‡ßÁQuÑ…;wŽÎ³}0ƒŒqoì´¼ÒGÄ{øá@ûÞ;ýÝÔœõo|uû)ëñ'1ÿôS²«Ôväþ\!D,ýá‡h7šA â !„؃HOtXYO=cü|}úPv×héé×®Å>y*ùW]CÑÄ7ñzhÂe]÷Ýi٪Îïƒ0l)²d }{áïÝ`—ÿ™oŽªóÎ¥ê¼sw™/eù ØCÞÖBÑr†m%×­£vÐ »ýSÎF—ÝÕõ ؽ;õEÂ:]²7W4ƒqí:PjN9½ßqÃã'`Ÿ2•âW_Á; ?JEÆuëðõëK°K—„å©éöíŸÛñÞéï&”“C('-½å]qþÈý¹B!„B´ à‰6±ví: »`0´ìÓƒØ'O%¸×^½3‘pƒr<ÇM§ /!ãåW)~ãõhzÊÊ•¶n‹)Çsô@Â)ñoùú8€’1‘7|Ófβd µƒárSÂú˜—þˆ.Â; ?†â­¤Î_€ÞëÁß«Þ£âS6lÙBÊïÄ­3”?†qã&Lý…eñbt~lW>z=µÇ×Ö‡K!ÄßPÙ·ìÞ}—ùšs}l)Óê5X–,A_UM(ljç˜cP³³’½‹öHjf¥£I³|ûùW_‹sØlœ3+f^ÕçS}æ»,·¹÷NÍaYòšÕJ(ljí³Ï véBí P\e¤}þ9jV5§ ;”•ÒRR.ÂPRŠfKÃÛ·/}{%\‡.²èŒ›6£fgáxT£õ±Î‡š‘¯Ï!1éÆ 0­Z÷°~hv;»Cq•‘ºp!†m%‘º÷ïO`Ÿ½w{_¶%¹?¯#÷çBÑîê[ß !„{ à‰6±fíZæÍ_Àeƒ/iQO_[‹Îç#XØ%æá€ïÐC)š4`·n1éŽñHû⢴ æ%üOyse>?Cq1îÛo%gèý¨Y™(è¼>jNýÛž}:&êÿá|èᘴ’'Oø€,uÞ<²λiÈö™ŠÂšß~Ùíú !„ØsµåõUÅùÈ£¤O{Ín'”Ÿ‡qÃCéÃR}Ö¿“½ùðy¾Cû`ùa)†¢"BÉ®RŒŒÆ¢9˜þZ…¾ª ¥¼œmÏžÁúóðxÎû‡cZµ:Ù›/êéênû%Ù5‰§(¤.\DÅ•W°aþÔÌLœ#¢âºkÙ°`.¡Ü\¬3gF³›—þˆóáGñÖ ç³ùýwY¿p>×^CÚ§Ÿá7>¦ø̱cIùõ7Êî¼õ‹¿eý7ÿ£ä‰1d¼özóêÙ ÌËWàñ¾ƒd¹‘ïÌ· ©¼ôìïL&ýÝ÷’|0'÷çr.„B!„h_Àmjw‚x¥?ˆ.¤àÒËé|îùd¼øæeˇ"l2¡¥¦¢¥¦nƒ‡Sz¯—²»îˆvo¤¥¦RuÉŘþø3¶.Š²½.&ÓNË  h©©‘·­uºèrZj*šÅÒêÛ!„bÏÒ–×GÇ[ PvïÝѲ5»׈áèT•ôéÓ“½ù‚H§æåË v-ŒŽÕV/åçå¤}þEÜ_¢M›ÑéЃԜqa³™@¯žèkk©9õ_„M&½÷Å°­$šÝ1ém‡qßu'šÕ-Ã}ëÔ¬LÒ§L)>í³/äSqÍÕÑ4ÏÑ©>ãôv?ö‰“@Ó(ùH¤5 €¢PvÏ]¨N'öw¦´{šCîÏåþ\!’aé?`21É®ŠBÑ®¤ MÑæêƒxÍíN³ö„ãÙôù'¤OŽuÞ<2Ǿc_BÍ̤ò²Á”_sU»¿Eî;ü°˜éPnä!˜R^Þ®õB!²Ç<±=xÑ€w@ª.8¿Í×oܼ¥´”ÚãC¿ÃuPÍÌD³Ù0/_‘ìÝ´ÇÑ{¼¤ÍŒŒs§óû1ýµŠôéÓÑ…B¸†‹ëžÑ>y öÉñA#ïð~x»Õ[ÍȈžÏšÅ‚––  ÔMët•²ìgT‡ï}cÊ ø>ëÜy(¥¥¨N'Ji)ŠÛMíI'Æm»¯Ï! ·½-™—-Cu8ЬV—+fžß^¤.ú½×ÛaƒDr.„"d ‡aófJG>ÒnÛ6™â¦ÔwG·[=„Bãšµà-ä`·®í²~¥Ì €uî<¬sç%Îã*KÞÚC).¹·Ü+ ¾þ‡ã¾e¾>‡Äåw F퉃âÒÃ);o¡ÔÚ´Ô÷X:]ìúuº˜{-Åí&¸W·„娙™Ñ<ªÓ‰RQI·Ûã×™áh×m„È÷Fç÷Óí¨cÍ£w»Ñ:uj÷º5•ÜŸ !„B!Dûžh7«×¬¡¨¨˜ÂÂ.-Z>Ø¥ •ƒ/¥úì³è|þ…¤¿ÿî;oGÍÈHö¦ !„í®xÜ«»wOÚúÃuÁCϱÇP~ã ;Í#ÚO¨S'6¿[×…¤^ \í¤E”fO'”—ÛÄÒ;ƒ] p–Þã©ËSwîÕµºÓiZ\^] Hsè´Ý…F4›­/m4šÝ{­MÈý¹Bˆö6ïš-„BüSHO´ EQ¸ü²K›¼Kùe%–Å‹©úÏyh;¼1­ÙlxûŠqíZ EEò€@!„H‚`—Α±Ë|~|‡œìêˆ:aEÿ· µD°s'Œ[¶ SÕ¸qÕ ÅÅ ×*È@ÍŒÜ'*¥¥qå¶%,?¬Ó% *Û¶í~Ý »`Zµÿ´É˜pmIîÏ…B$ËÒ~ˆv£”`žBˆ=ˆ>Ùÿ|õÁ»^={6y™Ôo¿%ëɧqL|;nž.ļlYäáL^~²7¯Õ„M&ô^o²«!„Bl§ÓAXK8K³ÙðõéƒeéRŒ7ÅÌÓ×Ô5æ RV®Löˆ ÏÑG£óúH37&Ý°e æå+ðöëíVQÍÌ$”—‹ùçåèüþ˜üÖÙ³–¯¥§cܼ9¦ F] €uþ‚]W®~œ=-ñ÷Æsì1è‚AÒ>ù4n^Æ˯`ýz6•ÜŸ !„B!Dû’x¢Mµ$xPuÁùØ>˜AÆK/c(.¦ö„ãÑÒÓ1“>í]L«×Puá¨Y‘qNÌË–aÜ´9º|ýƒDë׳Ñìé„rrð虿v-i_ÍÀ´zu¤Œ–’ñò«øë‡÷°~-ÚfãÆM˜þ9:mþiYÌ¿a½žšÓO‹Y.ÐcLþIö¨Ñx….ÀP\L wï×E!Äž­¹×Çi)¿þ†ã7Ñìé„ |ýúìiQ_vçí ¾œü+®¢ì¾{ ôØã†dŽ}Ó¯¿Q{òIÉÞbRgÏÁ°yKÂyÁî{QsÊÉ@ÛÞ;5WÅÕWbûèc²EØhÄÀþ7m"{ÔÂ:î;n‹É_}Î9d¼ü ¹wÜ…{ÈÍ ûä©(å Ë÷ÖëÌYd>û<5§ŸŠRYEÆ+¯ÊÍÅPT´Ó±ÕT‡€¬ÇÆè½/aƒà^Ýðõé@åå—aû`·Aïñà0}UöÉSHûô3Ê]öaKÈý¹ÜŸ !D²Ô·¾B!ö4Àm¦¥Á;ˆ<ü(zg"ÏÅöÙçØ>œÊÍÅ}Çm”_}U4Í>y*iŸ~WNöÈQÑÏž£RV­&óùbòZ/Ʋx1å7ßÔâÿ”[/Æ9|D\zúÔi¤ODÞæÝñûö[1®]‹}ÒÛØ'EÞlV33q=ø@+!„{’æ^wTúàd=ù™c_„P¦QòØÈhÏׯ/Åã^#{ôòn]οÿþOx_ŸC’½ Ä.¤Íœ3g%œW{ÂñÑ^[Þ;5—šMÑÛq>øù×ßMô؇âñãâλò®Ã´f Ö™³°Îž€gàQ¸† ¥`ðè‚¡˜ü®¡÷ ””ñÚëd¼ö:a³™òk¯&XXˆyÙ²¸–|;®Ë°¥ˆô3à=¦Qýï3£<Õá hòÛd?üÙ#‹¶Ô äã1œÊ‹/j—}Ø¢ý.÷ç‘ý ÷çBÑîd  RUY‰ÁhÄb± 4a¼Š¬Ì={܇yóPPߤàÝ.OBMÃàr¡¯¬B³§ÊÉIöæµ)ÅíF_U…–žŽš™™ìê!„M¢”–¢TUÊΊKˆ¶¢”—£”¹Qö]Žýg(*¸¥ˆPn.Á&ŒË¬TT w» 嶘[½îúêj %¥h¶4BNçöî7ÿäþ\!D}5ëkúõÛõ áp˜@ €§¶–ª’———0Ÿ<£BˆŽkf+ÿæg8ì·5@¨îO‚;L7ü\?_k0­ÖM‡€pƒiµÁt¸.­~,„?‡ù‹nRƒéç5ÌÓ”´ÒO´‰£…ÁÐJ§—^y(ð0POÍÌ”B!þvT§ÕéLv5ÄFÍÈ@ÍhÚC¹PA¡‚‚¦—ípD»Äl šÍFÀfkë]Ô6äþ\!„B!Úœ~÷‹"^«ï„B!„B!„B!ö0ÀB!„B!„B!„¢‘žB!„B!„B!„ˆð„B!„B!„B!„è@$€'„B!„B!„B!D"ãtüÐ*uÑ×Ö’ùÌsØ>ù}UZz:5§ý‹²»ïB³Z“{÷½¤¬ü•â7^#عsÂl)¿ýNæ3Ïb^ö3úšÔ¬Li3g‘ùìó;ͳeê;¨\z†RW£ykN;÷›°}0ƒŒqoì´ìÒGÄ{øáqÇ lPÐìvü½zQ}îÙø÷ß¿ÅÛ™ˆ¾²’‚«¯E_]CñËc vïž0Ÿãñ¤¿ÿ!½º±õ•—æIï}ã'4º®Då·Õ1í|ÎyÛ[Þèt‘ïGv¾ƒ¦ê åäÄäßcÖë[­ºu£ö¤©tB\pN_YIÖ3Ï’öåLô••„SRð <Š²{ï!صp·Ža—ŸÎH8Ïsä¸F O¼`¿§–o¾%ã•W1/û](„–žNí pßvKÂÖLæ"s싘ü ] €š™IÍ©ÿ¢üæ£ß¡úcߜ¨ˆÌgŸÇ:Aä÷(5ï€þ¸o¿•@Ïž»µEûËzò)¬sæ5:?Ø¥3Åã^K8ÏÛ¿?ÁN›⺆ E©ª à²+’½¹¢vçÜè(2ž{Û‡3ðüß±Ôœv*ZZºÚZ4›-ÙUìpŸ„=šÃïàƒ¨ºèÂF¯‰Íf4P{Âñ¨9ñ­åRVüBî=Cñs4®û‡&\\§ªt:ÿBÐëØ2mJ‹_t²}ü ™Ï½À†y³Û~ç !„B!Ä$€'ÚÄÚµë(,ì‚ÁÐz§˜ýíɤ}úy¨ß˜ôéÝè++±}ö9•_—ÇP¼ãºuÔœr2(ÛJHŸ6ûÄIT]p>¥½¾ÅuÑä_y5)+¥ò’‹ ôê‰yÅ/¤O›ŽaÓfŠÇ‹[Æô×_dyË·ßA8 ÄÓŸÒ颋 MT^|¡üû8&È’þÞû8‡ ؽ;î[‡6™H]¸ˆŒ—_ÅòÝb¶Ly{§Ûº3úª*ŒëÖá;ä`‚{í•0O¸Á9`Ü°¥¢‚šSÿ•0o°s§èg¥¢"Rv¿¾»tI˜_MßœÓÓOC3›ÑƒŠŠ°O›Ž}ê4¶=ù85§ŸÖ¢íL$çIYñKd?4BÓ°¿ý:Ÿëºu˜V­&ÐcŸ¸l†M›1®[GÕ…ÿM|Ûñ¡e[SãÚu (‘ï ÷x0­^CÆ˯`g2›§O‰ &¶ä˜z?œ`atš†RV†uölŸ|JÕ…ÿ|÷êèB! ®¸ ÓRõß ðx†-[pL˜H§‹.aÓÇ¢fg·h;u¡¦?þ$г'žc‰›Ÿè8AÓ¿§Ö¹óÈ»iþÞûR2æ1ÔÌLR~ûŒW_ÇòÝwlþèCT‡#š?uÞ|ònF#ÕçžM(?󲟱¿3ËKÙ2yRôþËK)šôþýz·h?Šä0l+Á¸nµƒNHÔØY÷p=ìn(ؽ;ÁºÏá¿[‹×=Üõ Q¶¾46æ·Lt q÷ ~?Æ pŒŸ€}ÊTŠ_}ï€þ»½ÍbaëË/&œç?`t¶÷Þ§ìöÛ[â[¸[}CÊÊ•Týç¼Ýê¥ eù PÕvÚ»B!„BKþW,ÚÄšµk™7— ¾¤U‚x¦U«Ézò)ªÏ<Û'Ÿ6šO_]õëÙT^|–ï¿ÇöáG xõÊîíBL)/'gèý¤O—P^å7^ßâºØß™Œùçål{ê jÎ8€êsÎF³¦’:o>†¢âèxÎá#°ü°ãúõøúJÍé§Eƒƒ‰d>÷:ŸŸ-S&Ç–ÿ-¤öÄAX¿nüìÔo¿Å°u%cÃ9ìl3fPvÏÝqù”ªªHÝo¿u×cü´Ã1U33(õhLZÆ+¯‘ùÜó8&½dƒæÓêÿœsL•27Ï>—ôiÓqß|jv¶gòëo¸Få%GóûëGÁà+Èxõ5\ǵhõ•‘}îíewݱËüÍýžf¼ü a£‘¢·ÞDKO¬ë¨#ÑÒl8zÛŒ¨¸ârtÁ 9<@Ѥ·ð|P´Ç›ÈzüI2^WϦ~ï²Åå¢lè=ÑuTŸ{6—^NöðeúÔíG‘\ewÞÞhë߆RV®Ä°u[Lšçè­Ú•ªiõ,K– ¯ª&”ãÄsÌ1Ñï²hM>7Vü‚Áå¢öøã"Ó¿¬Ä²ä‡Q³³ö0 ¸ÊH]¸ö4[Þþý ì³w£ëhʹaܸ Ó_EÊ/-EÍp:ALž@q-¯•ÒRR.ÂPR©Kß¾öíW}M –ïè±Á®]Ñ×Öb9kûr‡}qòä4«•PŽÛgŸìÒ…ÚA' ¸ÊHûüsÔ¬,jN;õï×s+JtŸ`ùö;ò¯¾ç°Ø8gVÌ<ÏGêÂEׯƒÿþûã=¬_Â}˜ºpQLשZj*Þ#ˆÍ¤×Ssæ8ƽuîÜÈñØ­î]}ÎY±3t@8Œå»ï1/_AØ à9æh½bÏ›úsÒ²x1:¿ëì91ë¯ÿÎ!„B!D[’žh3þõ'½³ÛA<] @îwQó¯S¨9ý´ðÒ>‹Œ—R{Ò‰¨™d=õ ¦Õkvú`©žš‘Á¶gŸ¦ðÄ“q¼9Š+.{£·©uIŸþûDƒwõÊ²»ïŠI xŽ9šÚ‡Fà=bÙŒÜi=}}ûèÝ;®ÅŒ÷°~@äaV=}M •ÿ½€àÞÝãZvùúõÃ:wJI)ÿd¾CE³ÛQê6»Ë¸aY£Fãz`8¦uëvš×öÁ 4«•šÓN%íó/°}òewÞ;¼ ®¯®®I݃%ë˜Öžp™Ï=¾ªuöcCjV&þƒÂ0ëkôÕUÑ»i_~EØl¦êüÿÄä÷öïO Ç>¤}9³å¼êÈvhvG“ò7÷{ª¸ËQ³³£Á»zÁ½»Gç׳,ú¥´”šSNŽ ÞT\q9†M›[ÜšA_UEêì9¨N'ƒ/™çëÓ÷í·¡¥YÑ©ê1ŽâžÊ1~i_|“¶³1ðšEUq>ò(éÓÞE³Û åçaÜ°ÂPúðƒvw-:†´Ï¿ÀñÖD6Ι…íÝ÷Éx}\¤u16™âŽ_ú{ï“=2òÂF°[W”­ÛÈ®EåÅá~l@¦çFê¼yd?6&:­¯®Ž´Jn ìž»©¸j{—®éS§‘=úqÂÁî{aغìÒRjÎ8’1ŵÞË»ùªÿ}&å7\GþU×bܼy{ÙwÞ àe¼0ÍáÀô×*ôUU(åål{æ©È5°¦ÅíÆ´f-î[cë·§óy¾Cû`ùa)†¢"B@$(œwÓ .Á®]Ñù¼ŠŠñõëKñ+/Å]'s†Þ‡â*‹N76^Õ9gá÷¶O?‹ àé¼>RgÏ!ص+¾C]P§#çž¡XgÏAufcÜ´™¬gžÃ5üþ˜—þv<'cÎGEaÍo¿${— !„B!öÀmª5‚xYO>…ÎïÃ5b8柖í4oú‡*(ÀwÈÁ„rœd=õ ¶Qv÷MZ—–šJÍI'aŸ2óÏ?ã=b@³ë¢¸\ׯ§ò²Á@äívÓúõ¨6¾ÃúÅ]\>ЬýQqõ• ÓS~Y @`Ÿí]ÿiv;î;nk$äÁCc]þS¤üþúÊÊVi}§ …Ƚãn<ÇýÕçžMÖSÏ4šW_U…uöjNýa“‰šÓN%uá"R¿ùÏ1GÇæ­¬D³¥^é tÓ&4«•À¾½â‚*É:¦–ï¾ÀÛÿðV/[_SCÊÊ•„ ò no]‘òëozìCØdŠ[ÆàØ>œârµ¨Íú€®jOGçóaZ·}uÁnÝâÆùƒæO=GAúbZ³–ÀÞÛ[Á˜ø!n?šëºbM¤Óéš½î†R~ûªâí×7.p Ä< ÿ\%Ž¶–É~d$¶µZÙŽ IŸö.•— ¦ìÞ» + úÊJòn‚óþáø÷ßÿù; ôŠŒiŸ0Ûâz`µ'œš†RîŽÉk^¾爇ðöë˶±ÏGºVU²Ç<}ÒÛzö ê‚ó£ù›snT]|Õÿ9€ÂãêÒ™¢IoŬ¿áµÀ¼ôGœ?Šç¨#ÙöÂs‘±…Ãa²žyÇëãì½7å7\ͯ¥¥ÊÏ'å?ȹ8¡®…”<óÁÎQÊË#×àzŠBêÂE¸îJõYgÒõ¸A8GóìFWìÞßÁaY¸¥¢"¦[jëœ9è½^*Î>+n9ó?á=bë¿]DØbƸa—\FÖãORsòIÑ{Šús²óÙç¡óxØ4ó‹۹綾B!„B´/ à‰6·;A¼Ô…‹HŸ:-S'GÎì„iõRVüBùuׂNG¨S'|‡LÚ'ŸRvÇm ^'¬k­gÜ°1&€×Ôº7l"‹:]t 柖Vt¡šÍFÉèQÔž8¨U÷±¡¨ˆÌ±/¢:Ôœuæ®÷ëü¤}5“ÚãkR[É”òóò„-ƒTg6ÞÃãƒI¶÷ßG³ÙЃ7l$í‹/ñõë‹ëþûv».™ÏEq»)zkü.óÚ>û] m…Y{â Â#Â6ã£ø^u5 £à²+°|¿xû6feâºoh\KÎDZó˜ê«k°Oœù\ë!å÷ßI7ŸªÿžOÕyçîö~´,\„¾¼<2^i)i_EºÚÚúüsÑc­ ÐWVrFÞœOûü ÒfÎÂß»7å7\G¨n'öm- àÕ·À³ÎGæØÑWUGçÕžp<¥£EÍÈhñ6ºïºÓšµ\|)ÕçKÈ™MÊïöùT\s5žGEó¶nˆ¶VhM†ââHÙZ¿lñ÷6™¢ÁÖniéxk"¡‚‚h€"/¸F §Ëg‘>}z‹[ÊŠ¶§Ö½°`Ÿ<…mÏ>MÍ¿N‰Î«ï껞}â$Ð4JG>²=X¢(”Ýsi_~…ý)±¼fœaƒ!¦Å\X¯GKMm´ÞŽIoC8Œû®;·ß“ét¸o‚íƒHŸ25&€ÊÍÁüór={²yÒ[Ñõ©Y™±…ëtè‚AjÎ8°ÙL WO,ß/Ž¾è½/æ¥?&ûÐu8¦Õk0/_N°kaôE˜´Ï¾@q¹(}ôá˜.*kN9™´‘öåW¸†Ý‡š¹ý„-fÂõ»ˆ“UŸ}6æå+°~ùUþ7šnûô3Ðë¶Ö{½”>4"ÚËF°kW*¯º‚¬Ñc7Ÿªº@rôœÔé"½$ìä|B!„Bˆ¶"<Ñ.ZÄSÜnr†Þ‡û¶[ðxÀ.óÛ>ü€šckÕœv*Ù£F“úíwxŽؤõÖÿ]ï©mQ]"Á°¿5‘êsÏŽt”–†åÇɹë^r︋MŸ}L°k×VÙ·Æ͛ɿòôEoM@³Xvš?uÑ7äÞvÁÂBJGj•:¤¿ÿ–%KâÒÕìl\ÃbgúêroOÜ"²ò’‹ñõíêÈ>y öÉSâòz0€—9ö¥˜éP^.ÞwïçβäìÞ¢èí·šÔե탨ÙÙxê‚ÀZZžcŽÆ:g.úªj´ôíe(UÕ諪víJù ×£fe’òËJ2Ÿ{Ü»ïE³Ûã‚~ µö1UÊËcºðt þ}{'ÌßÜcjûäÓ˜îgÃf3UçœM¸ÁÃ1Ï™W7F—iÕ*¬3g¡«õÔ¥›êòùi‰ú€aó\C‡â?`?ô5µ¤OÛÇŸ ¸Ýl™:¹ÅoÙ«UçCÖ3ÏbŸ8)ÒkY¾CûPûÇÆäÕy½1ÛÚTMùÞE÷£©õÆ:Gö˜'¾PâÐ?&ÒVŒ›7£”–R{üqèËËcæ©™™h6æå+’½›öHM=7ÔºqWûì¼KļlªÃfµ¢¸\1óüûö"uÑ7è½^4‹¥ÍÏ”e?£:ø{ï“6ð|p¤;éÒRÔº—=€HWá0å7Ý×½æŽÔŒŒèþÓ,´´´èý¡f±  [÷€ýÍè=^ÒfF^¾Ñùý˜þZEúôéèB¡HP¶îÚi^é­"¸×^ñçLï}±Îúš”•¿îôggjN;•ìÑc°}òY4€§TT`Yô Þý åçÅ-è¾WÌyD»¯6­Zì]+„B!„1$€'ÚÍê5k(**¦°°K“òçÜ?œ@ÏžT\uå®3«*¶?%°ÏÞ„rr¢ç½G:]¤ÕSxúÚHà®áƒ¯fÕ¥î-ó@ϸ†ÝMö~8e÷%÷ÖÛ±}8÷í·íö>MYñ ù7Üá0[&MÄÐ;ÍŸþþdxˆÀ~½)~íÕ˜î†êôß‹0ýñgLZŵWS~ã ó¶G÷[CÁ­~t¡)¿ÿ‘x×UVÆ¥¹†KØb±>€³£è¸Nš†âvcùî{²žx Û»ï±yÆÑñÕRçÍOxZ÷ã’˜›úª*rî¹—ò¯ÇקÏ.‹iÕjRV®¤ê‚óÑל<ÇýÖÙsHûâKªþ»ýê–)oÄ´ø ôè¿ýèrÖ98^×èí¶8¦ Ç›ÑJJ°~ùÙŽ$íë¯)zãuÐë[|LKž|œêº@»¾²’”ßÿ ó¹çé|ö¹¿þ*Þ#6Öèê’»uÃ3p þ÷Ö+ÑyÐÔcZ{Âñ¬ÿæh6[LàÌ×÷Pô^/ÖY_cY²oÿ–=—5æ ÞÂuÿP*/¹¥¢‚쇡ÓàË)~í•èoR¸.è^lkª¦|ïÂæH ¿ye‹¿ãšµ`4Æ¥»µÎ "»¢”EºX´Î‡uî¼ÄyŒe%ÚO“Ϻwüì¿Ë2•27:¿ŸnGÓh½ÛÖ©S›ŸŠÛMp¯n çÕ·æRÜîØ@M]PÉׄmÕR-1ËÅ\ktºè8{*Åå"÷–Û¢ÓaEÁ×ÿpÜ· Á×çíùÊ"Ǹà’Á;-«¥´tµ'OÚ—_aز…P§NX¿ü ](DÕ9‰»ßLÔj¿>]ÿžB!„BtÀíBQ.¿ìÒ&ïl}Lê¼ù¸oBúûDÓëߌ5ÿ¼œpêûÔžp.G8ŒóIï}Êo¼÷­CvY~ÅÕMhiø7RÄ0®ß“èÙ3®‹ÏD [·A0HÖèÇcÒë[‡9Æ¿‰f6S}ÎÙèTÛ'Ÿ*(À}û­qeÙÞÿËâÅׯ'Ø­„Ñ •N—ð¡¢¾¦–ðŽÝ %é˜FM6ìfIñ´tšÍS¶¿woRV®D Å=TKYù+jvVtœzM=¦:ŸCQQÂÜúššHv1îfc [¶€¦ÅD“ÆÍ[¢iõ­Ì‹—PyÑ…qË8zT×C#š=~™ÿý ›LX–þª÷€Õ6ã#Ò¾üŠÒ Ô©S‹¶W칂]:GÆ óùñrp²«#ÚX°° ¦U«ñxÀ.‹ÚúÜvî„qËtªWCq1èõ ƒEë+ú&Bƒ……hG›ýFxŽ<‚PNÖ™3©:ÿ<Ì?-£êÜs}©É°­$AÚ6€FƒŒB!„B‘,úÝ/BˆÆµ$xP~ã ¬ûùǸ¿ú·¾Ëu?ÿˆÿÀPÊËI7ß¡}¨ºà|ªÏ<#æ¯ü–›  Øf|¼ÓuêT•ìGGa()¡òâ‹¢ƒÛ7§.iÙS{ÂñX¾_ŒiÕª˜u¤}é–°¾%^KX¾ûç°ð=­¯¾¼óàñÒˤ¿÷>îÛokR çŸÈöqd¼µÀÞ{·hù¢7ßHxT^q9[¦MaýâoH]ð?WÕgw.VŸy•—]©ÓŒ0””ÐíØãÉ»iH$ÀÒ@êü(n7ÞÃúŤ'ã˜êT•´/¾h“?© ¡TTÄ£ÚSNBïñöYlë>ó²Ÿ1ýùç.ÇkÚ™ìÑc(ü×é¤Î_;CÓ"ÇF§Ãׯo‹Ê€^yÙr¨ ô×3n؈RQÓâÀsÄB‘–œ;tsjùî{Òß}}ee³ƒw BÖž|ŠË…}‡Ö †mÛÈ|æ9Lþ}«¯®Ž”뺇ÓWUG»ÂƒÈØBÊãY‰8ÂZÂYšÍ†¯O,K—bܸ)fž¾¦†¬1O²re²·@´ϱǠ Ik0†i½Œ—_Áúõìèt[Ÿž£Fçõ‘:gnLºaËÌËWàí×o—c‹¶WßZ¿¾g‚†Ò>ý û¤wvý ]0Hõg$œ¯fdà=z ©óæcÜ°`×íã¿Øß~ÍjEq»IýßBŒ6â=òÊo¾q·êä¾ýVR.¢à²+pß~ÁÂ.X¾ûÇëoìÖê3NæM¿Ciitº¾ Ï´¯f¡:#ÕýûõÆ¿ÿþè‚Ar†=€NUñöë›ðˆêpD» 2®]KæË‘qÑԬ̘îëzôèÐ-'RgÏÁРµRCÁî{QsÊÉ1iéÓ§£¥Ù"-ÛÊË1ÿ´ óO?ìÜ™ÊË7e•»ÅöÁ‡1Ǹ!ϱǠ:Ø>þ÷­·ÊÍ¥êÜsH÷=ò¯½žªÿ^€fµbþé'2Þ––Fù×G—ocª¯ªÆ1~BdB a(uE¾?›6á9îÿðuäní£ÔÿC©ëS_SiÕjRçÎ#l6Sv×öñëªþséS¦’ýÐ#(enüˆqýz2Ÿ{5+“òë¯kq*.LÚg_{×=”_mäe€27öw&“²âª.üoL­9ßS533rLß{ŸÜ;ï¦rð%¨™™×®#ëégA¯§âš«¶WFQ(}ôaò®»Nƒ/§âŠË vß Ó¯¿á˜8‰Pv6eCïmñ¶–Ý}'–ï“=ò1Œ«Vãë8JI Žño¢¸Ýl}õåè8€Ù£Fc›ñë–-EKM%÷î{0ÿøë–. à²+Ðù-î2U´?ó²e7mo^L±~=Íž@('ï€ÄÝÅj)¿þ†ã7Ñìé„ |ýúF¿ewÞNÁàËÉ¿â*Êî»—@}0nØHæØ1ýúµ'Ÿ”ì] ZIåå—aû`·Aïñà0}UöÉSHûô³˜.ª¡mÏŠ«¯ÄöÑÇd?:Š°Ñˆÿ€ý1nÚDö¨1„u:ÜwÜ–ìÝ%ï‘Gà8Û‡3Ðl6ªÿ}&a“묯ÉxùU¼GIåàK¢ù­_ÏŽ –Õw‡jk4ö÷îM Ç>1ë©:ç,ãÞÀñêë»vÅw衉+ÊÏ#p »ŸP—ÎX~ƒ}âÛöîŽ÷È#â ôØÓŸ’=j4žGEÆ..&лwÜ VB!„BÑÚ$€'Ú„Á`h—à@ú6¨ý×Éæ©þ÷™¤Î›mÆG¸oÛÞ­¡ã7H+•@}¨¼ü2ª.8¿E-] víJѤ 8xçð‘D½ÏÀ£(}ô‘˜n}ãßIJ䇸22Ÿ!ú¹ü†ëðï¿?J™;Ò=D öí à™Wþ ªŠRQ±½;¨|i‡à¥Íœ3g%œW{Âñq¼Œ—_~›Í»t¦âÚk(¿úJ4»½M몸ݤÎ_€ÿým¥9WO!}ê4,ß/Æ{业•‰}òTR}SW˜‚爔Ý_Lй=Ž©RQAÖOF&tººïG*¯¼<Ò m‚ñcš#í³Ï£­êÂF#ªÓIÍ™gPqõUöÙÞ/l2Qüæ8|˜¬§žŽ¶fóõéCé£ïÖ8FÁîÝ)š0ž¬'ž$ëɧ£é¡œÊŠ«b»mÎ÷ÀõЂݺá˜0!Úr±~½[Ç>ÿ®žgàQ¿9Ž¬ÇŸ$ó¹ç·§{Lä!ãntÊÍeË´ÉdMúôw±O‰Œ[è±%£KøÀRüsØ'O%íÓÏâÒ³GŽŠ~ö Øh¯ôÁÈzò)2Ǿ¡:M£ä±‘Ñž¯__ŠÇ½Föè1‘–ÄuüûïOñ„7¶hOªÃAÑä·É~ø²G>ýMäã1œÊ‹/ŠÉߖ熚MÑÛq>øù×oé*ÐcŠÇ“ó®ÙöâódyémÔÌL\>ì]+„B!„Ø4õ)¬®iºŸNïøWߧ>Ág 4øWß`ÚÐ`Zi0ßØ`ÚP÷×ð³q‡é´òŠÊçv¶ñÁ`ªÊJ F#‹¥ Á¬ÌŒV9@W¡PC‚ß½P@ǧ¸\(•„rrÐÒmÉ®ŽèÈ4 Ci):57w—Ý£îIôUÕJKQ3¨™™­[¶×‹²u+aK*¡'è[·wi¥¼¥Ìš‘šµëº+n7úŠ Ô¼¼V?ôµµ(Û¶¡9Z? ¡”–¢TUÊÎjó&Dré««1””¢ÙÒ9»|±£-Ïèo¬Ã¾[/vˆ¶¥óû1ÑH(//nlÛv¯O(„aËÂFctŒßQÜnôUUhéérýBˆfújÖ×ôë·ëVËáp˜@ €§¶–ª’———0Ÿ<£BˆŽkf+ÿæg8ì·5@¨îO‚;L7ü\?_k0­ÖM‡€pƒiµÁt¸.­~ ‘?‡ù‹nRƒéç5ÌÓ”´ÒO´‰¦ïöjv¶X–ü€fµÊqbûìs‚]ºP;èWiŸŽš•EÍi§‚·…B!„B´1 à‰6±fíZæÍ_Àeƒ/i· žyÙÏä ¹½ÛM gô^Æõëñ÷Þ—­¯½B(76Жsÿ0lÌ œ’B(?磲í‰ÇqŽxˆ@ÏžMšÍ«SU²GÂaÂ&SÜñKï}²G>@°[W”­ÛÈ®EåÅá~lP«çFê¼yd?6&:­¯®&ï¦!1ë.»çn*®ÚÞ¥kúÔid~œ°Á@°û^¶n#»´”š3N§dÌcq­÷òn¾…êŸIù בÕµ7oÞ^ö·Gx/ŒEs80ýµ }UJy9ÛžyŠÌçžG_S‹âvcZ³÷­±õB!„B!Z›ðD›ù󯿘8év â髪ȻñfÂ&#›¾ú‚`aRçÍ'ÿ¦!ä ½Ÿ¢ ã£ù­_ÏÆöÁ <ÇÍÖ±Ï6›1®]KþM· ¯®}ì[ÕŽ×Æ‘þþ”_-îÛn½ÇCÞ7“5æ |ˆ¯ï¡ÉÞåB!Dœ’ÇGS:êQ²‰mÆG­V¶cÂDÒ§½Kåeƒ)»÷nŠ‚¾²’¼›†à¼8þý÷FDÇèÕû„‰Ø>ø×è=áÐ4”rwL^óò8G<„·__¶}ÕáU%{ÌØ'½M gª.8?š¿9çFÕÅQýŸó(×Gꜹ1é†-[0/_·_?4‹¥…¥ !„B!„ƒ´Àmª5‚w)+W’ñò«ñ3ôzʯ¿€Úÿ;_¿¾¤O™F°k7jO„¾ºǸ70nÜDÙ=w£¥¦F­úïIŸ2 爇0ýùªÓ‰uÞ<‚……„M¦¸U¹ï¸ük®#oÈm¸îŠš›ƒyÙÏd=þ$¡¼\*_šì]-„BÄ1/[†qÓæèt}0Åúõl4{:¡œ¼ú'\^s8Hùõ7o¼‰fO'l0àë×—`—H‹ú²;o§`ðåä_qe÷ÝK Ç>7l$s싘~ýÚ“OJö.­¤òòË°}0çà÷xð€¾ª ûä)¤}úewß“¿-ÏŠ«¯ÄöÑÇd?:Š°Ñˆÿ€ý1nÚDö¨1„u:ÜwÜ–ìÝ%„B!„Bì6 à‰6ÓZ-ïÌËW`^¾"Ñ ¢<ôzŠ_}çÃ’õød€š•‰kØýT¾$fÑ`aŠÞ™HÆ˯’6sª=ÚSÿEÅàK±½ÿA¤ÅAžG±uìódy‚Îç]§çÈ#q=<-==Ù»[!„ˆcŸ<•´O?‹K¯¿Nxl4€Wúàd=ù™c_„P¦QòØÈhÏׯ/Åã^#{ôòn]οÿþOx_ŸC’½ D+QŠ&¿MöÃ=ò±è˜Á¡‚|\#†SyñE1ùÛòÜP³³)z{"Î"ÿú£éûP<~œœwB!„B!þt»‘¯±4]‚Ï §wü«ïÆSŸà³Pü«o0mh0­4˜ol0m¨ûkøÙ¸ÃtZyEås;Ûø`0HUe%£‹Å‚²‹q?²23Zåý]Í›¿€‚‚ü&ïšz6•ÞëÅPTL8ÅD°S§¸`ÜN—­©a¯¾‡S{òIl}Ṅy Å[Ñ×ÖÊÍA³ÙÚp/ !„Ji)JU5¡ì,4»=ÙÕmH_]¡¤Í–FÈéÜå½V[žJy9J™ÕaGÍÎNö®B!ľšõ5ýúõÛe¾p8L ÀS[KHUÉËËK˜OžÑ !DÇ5³•ó3öÛ€ T÷§Á¦~®Ÿ¯5˜Vë¦C@¸Á´Ú`:\—V?†ÈŽŸÃüE7©ÁôŽóæiJZ i'ÚÄÑÂ`HÎé¥Y,öî¾Ó<úÚZ²ž|ŠPv6å7ßMOýæ[ü½{7ºl(?!„BÄRNT§3ÙÕí@³Ù4ã%¦¶<7ÔŒ Ô y('„B!„âŸGx¢M$+x×TšÕŠqÃFÒ§½Ç¥~\-=ªÿœ›ì* !„B!„B!„bÕ±£,B´¡­cŸ'ó¹ç±}òŽ7ß"lNÁ{Øa”Ý}§tÁ$„B!„B!„Bˆ¤‘žØciii¸†Ã5|¨*4¡ßt!„B!„B!„Bˆ¶¦Ov„è$x'„B!„B!„BˆBxB!„B!„B!„Bt ÀB!„B!„B!„¢‘1ð„ØqÃF4k*jvv«•©SU”Rhš5ÍnOœQÓ0nÚLØh$Tßx7m-VöÆËB!ꊷ¢ vîÔh÷ÑJi)z7:6§ÊÍMvÕEÖ÷NB!„B!ÄžNxB4 SU O:…ÚŽgëË/îvyz¯—ìGF’öùèüþhzí ØúÒØøü5µžt ÁÂ.lüzf£åv9õ t@tºü†ëpßvk²wŸBˆ.ÿú0ýñ'Ì#”—8(—3t©‹E§}‡Ê–©ï$»ê¢ƒjí{'!„B!„BDHOtXÏ9/¶€¢Gs8ð|U]H°sçdWq—2ž{Û‡3ðüß±Ôœv*ZZºÚZ4›-ñFµ'šãÜi¹[&¿NÓ0®]KÎ}Ã’½™B!ÚQÖ“Oa3¯ÑùÁ.)÷ZÂyÞþý vêDØœÒèò®aCQªª(¸ìŠdo®h†½“B!kŠå€IDAT„B!"$€':,ãÚu (Ôœr2z¿ㆠ8ÆOÀ>e*ů¾‚w@ÿdWs§¬ÿ[ˆêp°õ¥±„ »þºiK“Þ^÷t aƒ²Ë¼B!þY ÛJ0®[Gí ¾¢: ÄuÿÐ]–ìÞ`Ýç°N—ìÍÍðO¸wB!„B!D„ðD‡¦ffP:êј4Ë·ß‘õµ8‡=ÀÆ9³bæ)®2R¿ù¥¤$òÆùAèÕ«ÑòÍ?/'å×_Ñ̼GôGm…1~Œ7aúë¯H}JKQ3¤Î_“'УÁ®…ÑéÔ…‹bºØÔRSñyDëíÈpËKIùõW…víŠç˜£ ›Í­·!„íªìÎÛ vï¾Ë|)+Wbغ-&Ísô@Â))»\¶©L«×`Y²}U5¡'žcŽAÍÎJö.Ú#ýï„B!„BOxâoÇ{äøíƒå‡¥ŠŠ`û`·½žP~>ŠË…¾¦†ŠË/£lè=qåäÜ?Û6›Q³²P|׃ìvýRçÍ#û±1Ñi}u5y7 ‰ÉSvÏÝT\µ½[²œ¡÷¡¸Ê¢Ó»¯9·›¼‡`^¶ŒP~šÕŠiÝzBÎl¶¾ò2þýz·îBÑ¡8ÆO í‹/cÒv6^³¨*ÎG%}Ú»hv;¡ü<Œ6@J~ê³þìÍtü{'!„B!„BÄ“žø{Òé#ÿ*‘.$õ••8GB!þ9Jm‘•ýÈHl3>jµ²&’>í]*/LÙ½wVô••äÝ4çýÃñï¿?û${èÐ÷NB!„B!„ˆ§Ov„h.Óê5˜—/'صPN:M£tô(Jy-=2PØh¤ª.–²bELiŸ~@ÙýC£Á«`aʇܴÛõ  h©©h©©‘i½>:]ÿ·ãxxa‹yû2­8ÜqÝ:RüšÓNï Ò…gùõ×aز%®{O!„ÿ,a“iûõGiݱSoM$TP Þhv;®ÃÑ©*éÓ§'{óÿÞI!„B!„ñ¤žèÐô/i3#cµèü~L­"}útt¡®áÃ@‰v©TŸyºPÓªU(n7„TŒ›6 ”—Ç”›òç_hv;Á.]bÒ¾iþO`þégü={ ¸\1óûìɳ|µ'˜ìª !„h¦ì1O Y­qéÞý©ºàü6_¿qóf”ÒRj?ý×Y53Ífü|E K-%÷NB!„B!Ä?ƒðD‡¦¸\äÞr[t:¬(øúŽû–!qŒ2^~Ç›o¡¯®&¬(„-Ð'nΦ¯¬DuØãÒU‡£Ñº¤Î›OîíwÆ¥¯ûqI´;ªŽFqGÆÕËzúY²ž~6qž²²æ)„¢ƒ0®Y Fc\z°[×vY¿RæÀ:wÖ¹óçqÉ5¦½u¤{'!„B!„B´œðD‡êÔ‰ÍïNLèõ¨v{Â`YúôwÉ|~,¾C¥dôH‚ݺ`^ö3þ{Q|Á:háøä`p'u)ˆŽmWVGU÷`·üÆëñ{lÂ,jFF²k)„¢ŠÇ½J°{÷¤­?\wñ{ å7Þ°Ó<¢ýt¤{'!„B!„B´œðD‡Vô¨ÙÙ»Ìgýz6%&X¸½k'CqqÂüjf†-EÇà [¶4ºŽ@Ïž¸†Ý—ì]Ò,ÁÂB 2.Ÿïƒ“]!„ÿ Á.A§CçóË5¦éH÷NB!„B!„h9}²+ D«GÞ×RS·§iö·' Sµ˜ìþýöCïõ’òËʘtëì9ÉÞ’æ©€–àxïaý[ÌØ>þªÆÌKùe%/¾„aÛ¶do…BˆŽJ§ƒ°–p–f³áëÓËÒ¥7nŠ™§¯©!k̤¬\Ù”µˆdØSï„B!„Bˆ¿ i'þ|‡ö!uÑ7d=õ4W]‰â.ÃñúøúŠù§ŸHY¶ ¥´4òFºNGõ¹ç`ûäSrïJé£ÊÉ!uÁ‚ÈC¨vîÓúõlô^otZïñ`ûäÓhš¿wo=ö‰[¶~Ü™´/¿DÍÍ!œ’BØ` öä“Ð,4›ò®'ó™çÈ¿æ:ʯ¿ŽPŽó²ŸÉzêÐ騼lpŽ˜Bˆö`^¶ ã¦ÍÑéú@›õëÙhötB99xôO¸¼æpòëo8ÞxÍžiÑݯ/Á.‘[ewÞNÁàËÉ¿â*Êî»—@}0nØHæØ1ýúµ'Ÿ”ì] ñw¾wB!„B!öÀÿ•W\ŽyÅ/Øf|„mÆG„-f*.¿ ÷­· ””`ûøºý¬[¶ÍbÁ; ?î;n#ã…)¸$À vaëË/Ñéüÿ¢ …Ú­îÙŽJØ .çî{£ŸËî¼=a/Ô©î;n#ý)d=þ$„Bè4 ‡õCëÔ €òë®E3›Éxíu .½ €°¢à9ö\ C³ÙÚõX !„h?öÉSIûô³¸ôì‘£¢Ÿ=6À+}ð²ž|ŠÌ±/F¯1%Œð|ýúR<î5²G!ï¦!ÑåüûïOñ„7ðõ9$Ù»@4âï|ï$„B!„Bì šúº¬®iºŸNïøWߧ>Ág 4øWß`ÚÐ`Zi0ßØ`ÚP÷×ð³q‡é´òŠÊçv¶ñÁ`ªÊJ F#‹EQv¹Ã²23Zåí Zóm}e%ŠÛM(?Ÿ°Ù¼=Ýã!l26âò›V¯A³Z ôìúp¯²š†±¨B!ÔÜ\4‹%Ù5Bñ¢”–¢TUÊÎB³Û“]ÑDrï$„Bˆ¶ôÕ¬¯éׯß.ó…ÃažÚZBªJ^^^Â|òŒN!:®™­ü›Ÿá°ßÔ¡º?î0Ýðsý|­Á´Z7 ¦ÕÓẴú±$vünä/ºI ¦wœ×0OSÒbH <ñ¢Ùí ÆŒï²C~_ßC“]íö¡×ìÜ9ÙµBñ¥:¨Ng²«!šIî„B!„BˆŽI^™B!„B!„B!„¢‘žB!„B!„B!„ˆð„B!„B!„B!„è@$€'„B!„B!„B!D" ÛJP33Ðl¶—£¯ªF)/I v-Löæ‰$Ñ{½(%¥h¶4ÔÌÌdWG!„Bñ7&-ðÄ߆Îïozæp]0Ø1êÒÌü:¯¯yÛékF~MC§ªm¶_šµOB¡f#] ¤îÍÞÖ`4-ÙÕ;£iÍ;UµYç£.Hö @þõ7PxÒ)J]æÉ:ŒÂ“N‰þåÞvg²«-D›0ÿ´ŒÂ“NÁöáŒÝ*'}Ú´˜ïLáI§t˜û­¶ÖÜ{â=å›o)<é2Ÿ~6ÙUB!„BüÍI <Ñ¡ŠŠÈ|öy¬ó ¯ªBKMÅ; ?îÛo%гg\~ㆠdy‚ÔEß   åçSyéÅT\yEã+ ‡É½û^RVþJñ¯ìܹUꢯ­%ó™ç°}òi$z:5§ý‹²»ïB³ZãÊÎzêRçÍGïñ Y,x@Ù=wÊɉ+ÛòÍ·d¼ò*æe?£ …ÐÒÓ©tîÛnIØJ"mæ,¯¾†iõtªJ(7—ê³Î¤âª+ÑÒÒZ||œ=Œåû%Ûw¥AA³Ûñ÷êEõ¹gãßÿ¸eÒß{û[1­^@`ïîT\s5ÕgŸ¿UÅ1á-Ò§NǸy3èõøØŸ²ÛnÅ{Ô‘»¬Ÿ}â$ìS§ã9ò\#†·x;ÑWVRpõµè«k(~y,ÁîÝcç{½8^} Û'Ÿa(*"l4è½/å7\OíñÇÅäí|Îy1­]vèÙƒ­/<.¸ô²>|¯9íTÜCnjÑvÅÔE§#l4¢fgá;ø`ª.¼ î|ܺÔ÷-7Ssê¿âæ·äüj®ô÷? ýɤüùÁN¨ºð¿T\>8aë¤ÔE‹È|öR~û°NG`ß^¸o½ϱÇÄå5/_AÆ c1ÿ¼}M jFÞ#À=ä&‚{íÍgZµš¼!·n_P§C3§ÊÏÇ{Ô‘T{a³9:;mæ,2Ÿ}~§Ûµeê;¨žrÚNózŽ> ×°ûw{_Šö“õäSXçÌkt~°KgŠÇ½–pž·‚:6§4º¼kØP”ªj .ÛÉõSt8;^OŠÍáÀwðAT]taÌ=ŽíƒdŒ{c§å•>ò Þà uÑ7d|¬Ñ¼•—\Då%'{$EÍYÿÆW·Ÿ²óO?%»JmGÓ°Íøû;“1­[‡ÎëC³Zñr0å×_‡÷ðÃv{¶?!ó¹Ø0ov«U;îZ „FB99x@Õ…ÄÝŸ·”êtR{ÂñöëÝjõB!„Bì™$€':,Ö-t>ÿB—‹Úá;è@Œ7aûø,?,¥hÒ[øüÇظi.¸=å7߈š•…õ˯ÈzüItÁ å×]·Ó_‘=æ ,ß~á04ÒJ¦¹uÑä_y5)+¥ò’‹ ôê‰yÅ/¤O›ŽaÓfŠÇÛ^vI ÿó_”òr*ÿ{}{‘²|é|HÊŠlþèC´ÔÔh~ëÜyäÝ4ï})ójf&)¿ýFÆ«¯cùî;6ô!ªÃÍŸþÞû8‡ ؽ;î[‡6™H]¸ˆŒ—_ÅòÝb¶Lyô-kŒk(ÞŠqÝ:jN? ÍlF b(*Â>m:ö©ÓØöäãÔœ¾=xùüX2^~…@¯^”Ýw/¨éï¾GÎÐûÑùTý÷ü˜ò³ƒýÉxþïX*n¸ǃ}òT ®¹Ž¢7^Ç{äÖ-å×_Ézâ)t¡†î{ÑÚrx”¿ ÷Çž7:U%ÿªk0ÿøþ ê?硯­ÅöÑGäÝx3%£¥úÜs¶Ÿ»k×^OíI'&\W°s§˜iã†( ƒ^‰ò7‡qí:PjN99²m¦ÕkÈxùìïLfóô)1ÁÊ–ÔEq¹Èxíu쓧‚ª¢¯¬J¸lsϯæÊzêãÞ ”— f›S°ÎžCÖObúë/J“ß:{yCnÅ¿o/\ UÃ>y y7ÜDѤ·ðõëÍkþñ' .»Ín§rð¥„rœ¤üö;¶gú¿…lúd¡‚‚Èùâ÷a\·Žà^{áí{hdUU‘²|Ö9s±½ÿ[¦M!œ ¸è«ª0®[‡ïƒc … Û/﵃NH˜G_SMúÔé°“ï‘è˜ ÛJ0®[Gí vû§:.ëºè.ËvïN}{Ô°N—ìÍÍ÷î÷cÜ°Çø اL¥øÕWðè€RQù-é×—`—. ËSÓíÛ?;ìø9Ö",K–Ø·þÞ‘ûŸP^^²7?iB99Ñ\´ô–wÅùwõÔÓ8ÆOÀקew݉–žŽqíZ쓧’Õ5M|ß¡‡îÖ:R–¯hõ^^k««1ýñ'©‹‘>m:E“'µJwÁ¾ƒbëË/¶jý…B!„{& à‰6±ví: »`0´üË~üI—‹²¡÷PqÅåÑôêsϦàÒËÉ~ø¶LŸº=ÿ¨Ñè|>6ü!Á®]¨:û, .»ó’àÚk îA¤sø,?,Ÿ~=¾¾‡Rsúi¤}úY«ÕÅþÎdÌ?/gÛSOPsÆ鑼çœfM%uÞ| EÅ„ òp¼>Åå¢ä±‘Ûƒ:çÿ‡à^{‘õäSØß~'&ø˜ñò+„FŠÞz-=ïQG¢¥Ùp>ô0¶m¯£ª’õäÓ„òóØüÞ´hk»ÊÁ—’wÃMXçÎü|9¾>}vëx—Ý}¡¼í<Ì?ýD§ /!ãåW¢ÅåÂñú8‚]»²ù½iÑ`DÕΣËég’õôÓTŸuf´¥‘qíZìS¦R{òI1­ÏjÎ8“O%{ôãlúô£„õÑy}äÞy5§ŠíãOvkÛIï},ÿ[H퉃°~ÿvxúÔi˜ü‰ÚŽgë‹/D¤W]A§ó/${Ôh<Çm! feR2æ±&×A³¥5+s¨™”Žz4&-ã•×È|îy“Þ¡ô¡-ª‹}ÊTlïHÊÊÍ¡üê«Èxíõ].×”ó«¹Lþ‰cü›„:ubó‡ïEƒÞå7\OÞ[±}ô15§Ÿ†çè@äœr>ø0=b‚i5ÿ:™Îçþ‡Ôo¾‰ àe=õ aƒÍïM‹ê‚{u#ëñ'±}8ƒò›c[&zû»ßU•üën uá"¬sçQó¯SbòWŸuU^°ëýw× Ósïº5+“ò¶ÖÉWvçíq­IY¹ÃÖm1iž£FÏãÖ`Z½Ë’%諪 å8ñs jvV²wÑ)Ño¸åÛïÈ¿úZœÃ`ãœY1óª.8Ÿê3ÏØe¹þˆþ֧͜…eÉj jq‹ï˜ú-ùÍj%”ãÄöÙç»t¡vÐ (®2Ò>ÿ5+‹šÓNÞÇÕSJKI]¸CÝxcÞ¾} ìÛ+á:t¡–Eß`Ü´5; ÏÀ£­uî<ÔŒ |}‰I7nØ€iÕj¼‡õC³ÛÙŠ«ŒÔ… 1l+‰Ô½ûì½Ûû²-é‚A쓧Ük/ŠÞ™ó²ˆç˜£ë®Í¯RüFìµ]q•‘úÍ7(%%‘¡H Wüq2n܄鯿°,^ŒÎïÇ:{Îö™z}\„ÃX–,Á´j5:€`—ÎxŽ9:¦åzCq×Úp˜Œ—_!ó…É|îJFjÑqÒ{<‘uê„¿÷¾qy[z¾ !„B!ö<ÀmbÍڵ̛¿€Ë_Ò¢ ž¾ªŠÔÙsPN*_3ÏקîÛoCK³¢SUŠ‚¡¤„Ôù ¨¼ð¿ÑàŠBÑ;“âÊxŽ9šÚ‡Fà=bÙŒlµº¤O@}¢Á»zewßEÙÝwŤY¾_LØbŽëB²ò²KÉxù¬3¿Ž à)îrÔììhð®^pïîÑùѺ×ÔPùß îÝ=®«L_¿~XçÎC))m…#Ëwè¡hv;Jƒ–U–B QõŸscké6ª.¾ÌgžÃòÝ÷xŽû?Òf~ šF套Ĕ­fdP}úiØ'O‰¾I½£ìÇFƒN‡kØ}­À3nØ@֨ѸŽiݺ„yl~€ûŽÛcZ7ª™™¸†ÝGÊo¿µú>okµ'GæsÏ£¯ªjy!á0þÞûRqÅeÔžt"Öù ZTL¢ó«¹l}šFÅÕWÆ´XEQp=05'‡P~~4Ù:gŠË…ëa1篚͆ñ]zŽ9šš3N‹ ÞøúF‚|õÝà9öXR.j´•bK¥Î›OÚ§ŸQòäã1dñÏä?´/¾ŒIÛ°`^L`¼ÅTç#’>í]4»P~Æ  ¥?HõYÿNöæ À{äøíƒå‡¥ŠŠâ~›’-ã…±h¦¿V¡¯ªB)/gÛ3OE®;5µ(n7¦5kqß:$ºLúÔid~œ°Á@°û^¶n#»´”š3N§dÌc1Á%}U5—_Aʯ¿E~ó †È5àª+Ö'ïæ[ðqÅãcQÖ™³ÈzúY¶Ly_ß–·2Kïýhw¤Án]Q¶n#»r•_„køý6p£¯­Eçó,ì³!rm.š4`·n1é¶fà|èaÐë å磸\èkj¨¸ü2ʆÞ“7uÞ<²λiûñFQXóÛ/±õ©ª¦àÊ«Hùe%¡Ü\Â&Æ-[å8)~s<½wý‚:×^é™bñ’˜YÍ9NÊÖ­±õªÎ;7.˜-;ß…B!„{¦–õ›'Düù×_Lœô¡P¨Ù˦üö;:UÅÛ¯oÂq¨*®º‚ª ÎÌÌ?,…pïÀ£Ðƒ¤.ú&Ò½å’%ètÁãzð\ÃîÃ{Ä€V¯‹âra\¿ï‘‘1ÚRVü‚í“O#ãÛÕÔÄ-¯¯©‰‡P½ÃK⟩äñѬ[¶”uË–&ot78&L$}Ú»T^6˜õß-bÓÇ3X¿`¾ÀyÿpL«V'{óE=]Ý}F‚{™¤SR.¢âÊ+Ø0jf&ÎQqݵlX0—Pn.Ö™3£ÙÍKÄùð£xëdž…óÙüþ»¬_8ŸŠk¯!íÓÏpŒS|æر¤üúewÞÎúÅß²þ›ÿQòĘ&µomæå+pŽxßA²aÁÜÈwæÛ…T^z öw&“þî{I>ST§ó’°,Y7ßÛ¿L”úÊJœ#$Ø­ë.`ãWŸ³þ»EÔŽ oa^ösÌòU_ĺeK vëF(''ú»µnÙRÖý¿¾ŒW^%å—•”<6’ ÿ›ÇÆÙ3Ù2åm ¥.²wI§‹ŒûkØþÝhîq îµW´®g~±óõ5ó|B!„B칤žhSõA¼æ¶Ä3êÔ´7Ä6 ¯¨¤pÐIJ]‘1í4`·n¿òb“ºkͺhiitºèÌ?-#¬(èB!4›’Ñ£¨=qP4(/óò諪b[ÕiŠ»] €¾¦&:Ï}ט֬¥àâK©>ï\BÎlR~ÿƒ´Ï¿ âš«wÚ%T½Ôù Hûj&µÇ×âýÒíý÷Ñl6tÁ Æ IûâK|ýúâºÿ¾hµîŽé¯UqË+¥®È¿î²íi%%hiih ¦¿þ"óÅ— l{úÉèøN†m±]ÂJJp{€²»ïÄß{_t~ÿno[C™ÏEq»)zk|£y— ª6»uƒÞã!íóÄ|¼GÑ®?}u ö‰‘–«úZ)¿ÿNê¼ùTý÷|ªÎ;·ÝêQ¯)çWsŠ·lâq2n؈–žŽuî\œ#MCŒŒæ9ö¶=÷LÌX•õtªŠå Qª«I]ð¿È÷ôŠË©=áø¸¼¦Õ«£û]©¨Àòíw˜þü‹ÒGjZ+‚&²¿ý†¢"J¬Ã¶ò­+l26™"Ÿ[9xãxk"¡‚Êî½;Z¶f·ã1œ.gœEúô鸆Kö.Øã™V¯Á¼|9Á®…ѱÚê¥ü¼<áy¡:³ñÞò—6šE§C RsÆi„Íf½zbù~15§þ‹°ÉD ÷¾˜—þÍî˜ô6„øïºÍj–á¾u¶> }ÊTÊo¸.š?í³/äSqÍÕÑ4ÏÑ©>ãt쓧´ã‘ ò;¯i”Ž|d{ pE¡ìž»Hûò+ìïL¡ê‚ówkm©ôáɽå6 .½ÿP{ܱx:ßAŇušFéèQ»tŽŽ 6©úÏyXçÌ%eÅŠ˜nJÃC¤e_]@-Ñuµ!ÏqÿG°°0¦¥¯¯Oüûî‹yùò&oSÚÇŸ  ñvX4­ÙÇ©A}õfËÎWØÌó]!„B±ç’žhs- âé|>¦¦µÒÑ×Dº£Ëzò)ÜwÝiq¦iØ>ù”ì&ÿ†›Ùôŧ-zpÙìºTGêbk"ÕçžMñ+/¡¥¥aùñGrÜ;îbÓgG»ú¬=ù$ÌË~&û±1”Žz4RÇp˜Ì±/b(to© £å«UçCÖ3ÏbŸ8)Ò•`Y¾CûPûÇî²~©‹¾!÷¶;RºÃ8-•9ö¥˜éP^.Þ·oïaýP³2IŸþ.5ÿ>ÿ~½Èx'¯‹lgpûvê½>Â)‘Ί« ëÌYÛ@×µÞÒùèÂarî½ÿÁÅu»Ù,K~À>á-ŠÞ~ Ífk4ŸÞë‹©cS)®2rï¸+á¼-SÞAíÀÓW×{û óW^rñnuí¥”—Çtaà?è@üûöN¼ÍmXhÚùÕ\:Ÿ zŽíŠ¾ºßOÆK/S<îU¼ýû£¯¬$ëÙç#ݸEÉcñß']­‡üëoŒ¬Ë` üÚk¨¸æª„ë0ÿ¼óϱkO:1îa{½ô÷?HØBÍÎÆ5,qpSçóá7_Ÿ>í÷`^´™ì1Ol^4àп]ÆÍ›QJK©=þ8ôåå1óÔÌL4› óòÉÞM{½ÇKÚÌÈ8w:¿Ó_«HŸ>]( ¦î¸·Ož’0ˆå=b@»þN¨ÑóY³X"/ñÔD4‹%æ!eÙϨGÜøbaƒßÁGº/-Eu:QJKQÜnjO:1nÛ}}i÷žyÙ2T‡ÍjEq¹bæù÷íEê¢oÐ{½hK ×жjO8žMŸBúÔéXçÍ‹\£Ç¾„š™Iåeƒ)¿æªh OÍÈ úÌ3Ð…B˜V­Bq»!¤bÜ´ ˆÜoìïá‡á=ü0WÆMÑy}èêz­ÐWWÇto_ϸeKôû¡¯®ÆüãOØ>þ5;;flÚ¶>NÍ9ß…B!„{. à‰vÑÜ ^}ׇ:¿¯i+ÐGþs^uþbZUýçû†Í›)ùH4oÆ˯àxó-ôÕÕ„…°ÅúÖiýmZ½çbþé'Â3aS :§Ñe,ß}í@³Z©>ý4ÜwÞÓýg[§æœïB!„Bˆ=—ðD»Y½f EEÅvÙeÞúî* [ŠšTv}€#гGÜ<ß¡}°O™ŠqãÆðš]—ÌúºôLXØÞÍ&DÞ/~s¶>Ž¾ƒ$ЫW̱­þÏyñÛ±C0{Ìãèk=¨YY¤¿÷~4Ýôg$ fýz6¦ß§úœ³QN†¢¦/ÑC¤è#Aª&R3lüêó&çoé1 ›L;w¦âš«#çßø ¤.\„çØí´š[—ÛÅùM?¦ÁN¶lÁ°¥(áX…qû;+$ô÷Úá{­×ãës¦U«0Çwu©(øˆŒÙè=üpjN;•ÂNö¨Ñ×èú´ÔTûö¢dô(L«V‘ùâËT¾---šÇ}óÍT]xA³v¡mÆ 4«5ažâï§xÜ«­Ò rK…낇žciôp‚£h[¡NØüîÔÈ„^ \í¤ÍžÞ¬ëO‡`0 «{™gGúúà¡îÜ«ûý×5O¸^ÚB§í~P%l4¢ÙlÿÏÞ}‡7U½ÿ&7I“¦Ý“¡,·"¸ ®Ÿ[Ü p‹Šˆ¢âFDÄ…,*Kœ,Y-ÝMÓ‘&¹Éï´iCRhJK ¾ŸçéCî½''çŽÜî{ßsØõÖ˜z˨IIͱ՚…§M}nÆyÅåd]s=ÖOgRôÐ Ôøx¬Ó¦“ðú\ÇOÞ¨gñ´o€qõ2¯»aŸ>Wãõ’~Ç](ùùäŽóŠË‚¿mÓo»ƒØßE|_Ù%S0øQ ð'¤ûú:¶ý$„B!„80IO슢ЯïÍ ÞA °à70ýò+¨jØ'ˬÙÄ}ý ùßě™IÕ‘G ß±3¬.meuWy{X5e[Ü;à7ÐïØV—¦¦-»eéøu:J¯º2${P[QAÌo멨tÔíÜ >ÞŒô°ºý&#>‹%|øý$?9ëŒO)¾§?EìuKn¿µQÛª®šÀ§þß­!óÝ;Pøøc!ó^{×qÇÕÙîG`^¼„˜?ÿÂuܱ!åcÖ¯–ÀXx~ó‚…˜, kKÌ?H9ŠâBxîÎëíj°.Ý®\ðxHõBÈüš AûÄ÷ð8{__¯§êè£0®^ƒa㦰à~ëVR=LáÃRyê)û¼ªIöiõxqú­[÷±¦}WïñÕÀ}êêÚÓÊŸ1­\¶4ªJFŸ~”Ž>7ê="p<êwìŽÁX£æS“}©äçcûx2îÎ)»èÂÝÚ‰73“˜?þŒj»Çü¶ÝŽ¸ëÒà÷íN)(ĸf-åçžu¯BDâi“ËÉUvž-ǯhúÀ‚'+ýλHÔåä€Vü­¤&º Vª»%)[ÏÃY~&b€PÙmìÝFµ½m 6RuôQM>&es‹ùm=¦Ÿ~¢ôê«ðí–Ñè³X¨ìv<úÍ›Ñeg£ÆÇ“å½0 OÿÔŒ/½OmùýtÙÙ8/½$ìa}výõûbbôý8÷“B!„âà¡Ý÷*„سšà]—iõñ™Í”ŸJA¶iÓC–érsIxå5 ÿü¸«[7¼))X§MŽYW#î›@W€5ÙoÑŠ¶-þ˜Ê{õÄôãO6lmË×ám‰›7ŸÌk¯ëÞÐ>qšª*œ½¯Îófd€V‹qõZØíIrýÖm(%%xÚ„Iãß‹uƧ z AÁ»¦b™3w‡@pD£ª¤ Hòð!å”âb¬S§ãîÒ%8.ÆD£Á:=t›kNâ¾ø wçÎÁÌ“ÊOdËš_Ãþþýéû@]gõ`Ëš_)¹¥_£Ö%û½w#Ö郞oçÔO‚Ÿ༲w`Û¿:v›FUIñ41þÒíã@£ªÄ}õ5@‹füÔØýøŠ–óŠË@Q°Mz?¬Êø±ã0þòkH°¾ì‚óA£ÁöÁG!eµN'¦ßáMM 8} ö÷?$áµ×ÃÎGºœ]è¶oop¶‹.7ãO+ñ x³ö­;5Ó¯¿àêÞ­Þ2Z§30ÖOu×]ÚRg°›D¥¤dŸÇ,ü¾ˆ‹|K þË/è·mY¦-+#ñùƒ\Ñ”*Î8M¥‹ØºY÷t2®]Ge÷îÁÞ Ô„¼i©׬ESÚ½µyáˆõû¬ÖÀƒXuº1Ըݘ—.Û{ãj2¾}‘¿7=ÎDãñ÷ùÜ°eñcߎø Rkûý÷$Ž~ûn×B<Ôd\½:ò¦"éÙçÐo؈ë¤Qòò°O|¥¨ˆ]ãƳHüŠBáã‘:è!2oêCñwà7±|6 Ówßã¼ô<íjÇŠ]º ]'± 7÷Í|Ôä@ ®êˆÃƒ] FÓ€¢A‰]¾‚Œ¾·P4èÁ}ä³Äa:¿^Oùùç£?æ-´N'¹c^k—³÷Xf~†/ÆHùùç¡u:‰ÿJI ¹/½Ø$Çhs(½²7qs¿$îëoЖ—SvÉÅàõb>ãê5ßÓ?¬‹UÅQJüØqõ×yÍÕû-è§-ubŸ8)0¡zÑå»d)úíÛ©8û¬¬ÐhÄüþ1üQgúw€ÀØ5º@°Ì›”DÅÙg…¼¯!ÇW´<‡BñÝwÿÖX2¯¹ÇM7â³Ù0/^BÜÜ/¨<ådJ¯½&XÞÝ©#¥×]‹uÊTÐép^~Ú²2ìãƣǮƒ@¶oñ]w’ðúdô½ÇÍ7¡¦$£ÿw+öw'¢ñx‚ÁßíóÏ?Áí®©r¡Û™MÜüùhK>úHH÷™¡¯~ `O]†&…eÖl¶¬þ_l,©<Šñ×Ulùå'2úÞ‚¦Ê½ºLM¸z5úíµá56ó‚…øl®ã¼))Tž|RÄ÷ûìvb~ÿû»ïá³Yñët¸ºw >,RøÐ 2úô#ý–Û(|ü1Ü:¢ßº„1obøýÀâU‹]¸]„ <‡x€ÀoŠ¸oæ`ظãÏ¿¯]®ºSyB÷ýÒæ’ÛoÅ2{IÏŒ d¾u$úíÛIù<~†¢)ïìÝ›ø±o“úàà ¸4`›<¥¸$bý®ºcž7Ÿ„W_§ìâ ×è·ÇáMM t‘½‡ñÉjÆN|îy܇†_§ÃsHûຎ~}±ÌœEòSO£­¨ òä“Ñ––b›ü qs¿éºµ)½ö,3gÿÖXt99”÷ê‰ÏjE—“ƒuêt 7QzýµÁ®í]Çw%vÅw$¾ô2%·ÝŠRTˆýwqu;ãªUĬ^’Ÿx®NW×îN1üý7I#GQqúiñxsrp~xðswêˆÏb!î˯)?ë,¼™™˜~øÛ'Sq^z –Ïç»|•'Ÿ„ÏlŽz]£ÙOÚŠ Ì ÕN;JÀùÖR'XqÆé¨ññ-½…B!„ à‰f³/Á;oj*;§N&qä(¬Ó¦cû$0ž‹»SGòF=Öý`Ù…ÿU%qôˤ n¤;úÜv3Ä>ñ=L+ûÌ„×ß¾.îW0€m[<íÚ‘ýá$’ŸAòÐa™Z-§ŸFþ3O‡tçéißž]o¾AÒ3#IôP Ý11”^s…ƒ kcÁˆaxÚ·Ç>iR0# YQ»Æ¼2þqýï ª(%%µíØ£ÏÍûÀ«xòxÚdQrçß~kHKùÞ¯Šõ“©Á§¯Ý%gÂøˆ7ýòŸŽÏlÆ:cFp›{33Ù5æõFg¸ßhµì?–„W^Ã2ó3b¿]°C‡à¸ùÆð·8!Çßî*Î>k¿ð”’_˜Ðhð™Í¸;uÂqk¿@Pk·ñäʼxIXV"€åó¹Á\®ã à5ôøŠVÑý÷áMN"~Üx’G<¨_¯Çqã =ü ~]è%²àÉ!øââ°Vß¼P“ÉjDH÷·Å÷ÜÈÄ{÷]Rz$8ßݱ¹o¼FY„ F̺߈Y÷[õNPPí6\Çãƨ8óŒF¯gšL:¹yøßb›<%x¼Ö•ôìÈàëŠÓO¯7€—?üIG¿D˜7ÁëEãó‘÷ܳÁž«{7r&Œ'iÔó¤Ý[›å]uä‘äLzW×ãZzˆ½ˆ›7æ͸¬¼WÏ`/fÃÆ°ë”駟0ýðßwï~ à©IIdôÉÃG~÷=ÁùîNÉ™8!ì¸+î†M›0Ï› ´Tœ~C“Ñç4oHù‚Á¢äå?þâÇ¿x0ãÎÛñ´m‹qõê°L¾Ý?K·3ë¬Y0CEãóá¼ìÒ`OµÛÉžüIO=MÒ³Ï3ɼé ŠãÆ}®Y·»ÝNöÇÿú,_|‰å³YÁeÞÔTŠ|€âÛk$sÜÒãºß°ÌšeÖlü&#%ýúR4ð~”¼<,s>§ýg©Ó½|Ñ è7oÆöáGØ> dû©  2XÆGÞsÏ’2äIÒï ŒÁYuøaìó:wæ¥ËH»ç>Jn¿ÂGjܺ6p?)ù¤<þ›Ý´r%¦•+ƒÓ;§M‘k°B!„"* ½ «‰bž&ÂëºÓ»ÿÕtã©ðZ(uþÕÖ™ÖÕ™Vê,××™ÖUÿÕ}­ßm:®¸ÄñÚžVÞãñPêp Óë1™L( !1á¿ýŸ³%K—‘‘‘Þ à]CBmy9Jn.>»5!aÏ…ý~ô;w‚Û7+ ¿ÁФëU[¥ ¥Ä7%ŸÕ²ÇvëòòД—ãMÏÀoÚû˜}Jq1Jaj||ði網e×.ü¦Øu%¨q¹Ðåäà1Fÿ¯5Óx<è²sðëõxÓÓüÍÈïG—³ Ç733,p·;ÛR§Ã“•µ×}ª”” -.FMM íFLˆƒŒ’ŸRêÄ›”¸OÁu!¢ü-d·íul3]v6úÙxSSCÆd«·î’´EE þ]-­Ó‰./Ÿ%oròõÁçCWP€ÖQŠÏfÅ›’Rÿz:(EExÓÓCbÓVTà7ê½î*EEhKKñY­õþæÖ¨*º;ñ›Œ¡mPU´ø,{øíÝ@ô~BˆVà›ù èÞ}ïùøý~Ün7ååxU•´´´ˆåäB´^óšøœo·=”Þê?ðì6]÷uÍr_iµzÚ øëL«u¦ýÕójúùßýµ¿ž¿à*Õ™Þ}YÝ2 ™BxÀk^¯®a žò_`!„B!„Bˆƒð„â¿Cxa¯Ù­LCæ…Ðî­€ÑÐàB!„B!„B!„%ÚŠÊà´ßƒ75µ¥›.Z±æøí$„B!„Bü×IOˆ:4ªJÛó. ¼WOv}sŸëÓVV’ôô³Ä}ùšªªàüòsz±ë­1áåËÊi{ÞxÚ¶aÛ‚yõÖÛæÂKиÝÁéâþwQôÀÀ–Þ|B!Z¹ô»ûcøëo¶.[‚7-rP.eðbW¬N»Ž?žS>n馋Vª©; !„B!„"@x¢ÕÊê}Uh€¢Åg·ã:öJo¸OVVK7q¯â_{Ëg³¨8«e]ˆ/.My9>‹%òô:Ê{õDMIÞc½;'„ÆçC¿y3)iéÕB±%Ž~ ó¢%õ.÷´É"gÂøˆË*O: Of&~cL½ï/2¥Ô @Fß[ZzuE†ßNB!„B!„žhµô›·€¢PvÁùh«ªÐoÝŠ}â$lŸL!gÜÛTž|RK7sÌß.GµÛÙõÖüº½Ý|&Sƒž^¯:æhü:e¯e…B\t¹yè·l¡üœ^Q“ë¤à‰Á{­ßsè¡xª_û5š–^]…ƒá·“B!„B!$€'Z55!žü‘Ï„Ì3}ÿé·ßIò'Ù¶h~È2¥ Øï¾CÉË £‰ÊSNBm‚1~ôÛ¶cøçŸ@{òóQãíÄ.]RÆÝ©žvmƒÓ±ËW„t±é‹¥òÔSšnCúý˜~þ…˜ß¯O»vTœy~£±é>C!Ä~UøÐ <‡º×r1ë×£Û•2¯âŒÓñÇÄìõ½ eظ ÓÊ•hKxS’©8óLԤĖÞDÿIâo'!„B!„B„“ž8àTžz ®ã»búùtÙÙx32°ÌœEòˆ§@«Å›žŽRP€¶¬Œ’~})ühX=)O Å2ó3üF#jb"Êð rŸÛ»d IÏ=œÖ:¤Ý; ¤Lá£Pr[m·d)ƒG)( Nïm ¼h(EE¤Ý3ãêÕxÓÓð™Í¶ü‹79‰]o¥êˆÃ›v !„hUì'÷Õ×!óö4^TT•ä§ŸÁ:u:>› ozú­[ÁùO Çyùe-½ú‚ÖÿÛI!„B!„á$€'Lmà_%Ð…¤Öá yØp<‡ÊÎÉá³ZÐx<¤„}Òû”Ÿ®®Çßn^°ËÌÏ(ïy6¹¯¿Šß`@¿m;i÷Ü·ÏM+½ñœW_@Û³ÏÁÛ&‹ìß)ã7B¦·.\€Æï ëÒ+štS¥ ~ãÚµä¾ö eÿ»Ã† dô»´ûîgÛ7_†µG!ÄÁ#ï…QÁŒ¬¤§ŸÅ2kv“ÕmŸôÖ©ÓqôíCácàW´i÷ ù‰¡Ty$îN[zhÕ¿„B!„BNÛÒ "Z†›0®]‹§][¼))h|>òG$ÿéáø¬ñ€üz=¥Õ´˜uëBꈛû…O ¯Z§¿¢à7™@9Mëp ÚmaóU»½Þ¶Ä.YJê ‡Âæoùue°;ªÖF) Œ«—øò«$¾üjä2……ÑT)„¢•ÐoÚ z}Ø|Oûvûåó•Â"Ì‹—`^¼$r™¹Æìo­é·“B!„B!Ox¢Uóff²cú”À„V‹j³E –Y§M'áõ1¸Ž?ž¼QÏâißãê5d^wCxÅ øüá³=ž=´%#8¶]X]­UõÝâ{GˆEÔøø–n¥BˆFÈ™0Ï¡‡¶Øçû«¯1=Τøžþ{,#öŸÖôÛI!„B!„'<Ѫù-jRÒ^Ë™, ï…QxÚÖví¤ËɉX^MˆG·3üþœnçÎz?Ãݹ3CoéMOÛ¶@`\>×qǶts„BD-°Ç„BìÆÕ«Ñoßœ® ´™,Äg³àMI¡òä“"¾ßg·óûØß}ŸÍÈèîÞ O›@ÆVáCƒÈèÓô[n£ðñÇpwêˆ~ë6Ƽ‰á÷?(?ÿ¼–Þ¢òo'!„B!„â¿@xâ à¸¥Æu¿a™5ˬÙøMFJúõ¥hàý(yyXæ|Nû3ÎbËê_ð™LTž|E>@üo’qS €åiÛ†]cß"óšëÐx½û­íIÏŒŒ˜—òÈcÁ×… ŠÀóffRôàX?þ„ÄFƒ×‹Æçcë ÝñefP|×øŒFâÇ¿CÆÍ}ð+ =ΤàÉ!ø,–ýº¯„Bì?¶ÉSˆ›ûEØü¤gG_Wœ~z½¼üáO’8ú%Ƽ¼Æä=÷l0€çêÞœ ãIõ³­u8PŠŠð¦§ã7kçWTà7ðëtaå 7á3›qwîÚƒ¸WYŸ}v6x½¨©©øL¦–n‘Bˆƒˆ’ŸRêÄ›”ˆÏfké戒ßNB!„hNßÌ_@÷îÝ÷ZÎï÷ãv»©(/Ç«ª¤¥¥E,'÷è„¢õš×Äçüx»í  ðVÿ©€g·éº¯k–ûêL«ÕÓ^À_gZ­3í¯žW3–Äî¯ýõüW©ÎôîËê–iȼ’'*>›-âMÃñ]v+ïêv|K7{ÿÐjñdeµt+„B¤ÔädÔää–n†ˆ’üvB!„B!Z'ydV!„B!„B!„BˆVDxB!„B!„B!„B´"ÀB!„B!„B!„¢‘žB!„B!„B!„­ˆð„B!„B!„B!„hEt-Ý!„B±èrv¡q»ñde‚¢D,£ä磭¨ Nû1xSS[ºéB49Ë….75!ŸÅÒèz´¥N”ââyžvm[zõ8ÚÒR”â¼éiø †–nN-Ÿýöøõz¼é-Ý!„B!Ĉdà‰†¦ªªá…ý~4OëhK”å5•®èÖÓEyŸª6Ûv‰j›x½Qí#Û ­¤íQ¯«Ç>_K7Cì‰ÏÝñ¨ªQ·»¥×PÒïîOÛó.@—_Po™”ÁCh{ÞÁ¿Ôjéf Ñ,Œ«VÓö¼ °|6kŸê±Nòi{Þ­æ÷ÖÄöñ'´=ïbþø³¥›B[VNÛó. £o¿–nŠB!„â?F2ðD«¦ËÎ&áÕ×1/]†¶´_l,•'ŸDÑ ¸;w+¯ßº•Äç_$vÅwh<¼éé8n¾‘’[o©ÿCü~RyŒ˜õ¿“óîxÛb›2ŠSO¡`ØÐF¯g$Z‡ƒŒÛïDë,#gì<‡º¼²û¸ñX>ÿ]v6~½÷á‡QÜÿnÊ{žR6«÷U!Ù.»swîÄ®7^ NgÜÜw7ßË.º¢÷6j½BÚ¢Ñà×ëQ“q{,¥×_v<îK[jöOÑý÷Qváÿ–7æøŠ–õÓ™X?žLÌßÿàÉ̤ôúë(é×'bvRìŠ$¼ú1ü_£Á}XŠÞOE3ÃÊ×®#þ1׬E[V†O婧P4à^<‡,gØ°‘´kߨÑà3ÆàMO§ò´S)½²7~£1¸8nÞ|^}}ëµsÊǨññ´½à¢=–­8ã4 †<±ÏÛRì?‰£_¼hI½Ë=m²È™0>â²Ê“N“™‰ßSïû † F)uÑw×OÑêì~=ñ+Z|v;®c¡ô†ëC~ãXfÎ"~»{¬/ÿéáTžx"±+¾#éÙçê-ë¸é7ÝØÒ› E”]~®êí”øÂhŒ«Vµt“š….;‡Œ[o¯÷ºÑæÒ+ð¦¦Ô{þijÑïûD¯£¼WOÔ”äý²^B!„BQCx¢ÕÒíÜIÖ5×£P~î9¸Ž9ý¶íXæ|Žéç_Èþð}ªŽ8%yè0<‡JÑÀø b—¯ ~ì8L?üÄÎO>mã’qu9»ÐoÙBÙÅá3Ñx<è²³±M†mÊTrG¿@ÙŵÁƒ„×Ç?ömÜ]ºPøøc ú°NŸAÊà'ÐT¹)½îšú“ž{ÛÇ“©8«%ýïBSQmò2ìwß¡òÔSêm[Ìï¿“øâKh¼^t‡BSKyr81ë~@[zÜhT•ôÛîÀøë*ªŽ:ŠÒ«¯B[^ŽeölÒî¹¼‘Ï༲wí±»y hµ”ŸwnÄÏòde†Lë·nC))‰ôŠT>úÍ[@Q(»àüÀºUT`ظ‰ø±ocûx2;¦}¬lL[”‚âÇ¿ƒmòPU´ŽÒˆïöøŠVâK¯`Ÿð.Þ´Ô@0Ûƒyá"_áŸÈ{aTHyóÂE¤ HÕa](xr¨>l“?!­ÿ½dø>®îÝ‚e¿®"£ï-øl6}nÆ›’LÌbùl±ß.gûç³ðfdŽ—*ú-[ðr•ÝŽl£ÒRb֮üh1–Og²sê'øcmi)ú-[pwlH °.¿®öò^~N¯ˆe´eN¬S¦Á¾G¢uÒåæ¡ß²…òszEìöOM®ÿ&sÁƒ÷Z¿çÐC©ÉGõk4-½º" açðª*ô[·bŸ8 Û'SÈ÷6•'Ÿ€RR8—tM›ˆõ©V[ík» ×qÇ Û™iåJ܇u¡êðÀïoZZK¯~‹ñ¦¤pñYßgk§ñxÐoÙ‚®s§ˆËõ[¶ì׌óhŽ÷}á3™Ø5öÍý¶^B!„BQCx¢YlÞ¼…¶mÛ Ó5þKza4JA…ƒ¥ä–~ÁùÎ+¯ ãæ~$=õ4;§M©-?r—‹s>ÃÓ®¥W\NFß[0®üoD&†éç_Ðÿû/®nÇSvñEÄÍý¢ÉÚbûx2Æ5kÉ}éEÊ.¹8P¶÷ø̱Ä.YŠ.;'8††ý (ä=÷lmPçš«ñr‰£_ÂöÑÇ!ÁÇø±oã×ëÉ~ÿ=|V+•§Š/ÎBòˆ§°Ìš]ÛFU%qôËxÓÓØ1cj0ÛÎÑçfÒúß‹yñŒk×âêÚuŸöwá#ãM«Íü3®ZEæõ7?öí`€E)(ÀþÎ<íÚ±cÆÔ`0¢ôê«hsñ¥$¾ü2ÎË/ fé7oÆöÉÊÏ?/$û¬ì’‹i{þ…$zísgGl¦ÒEêCRvÑ…Xæ|¾Oë‰uƧ˜¾]Nù¹ç`^°0|ù”©]Ey¯žìzó`€´ä¶[ȼæz’FŽ¢¢çÙÁ )51¼çŸkp|–¸¨ÊGCMˆ'ä3!óâßOÂk¯cÿðcòG kT[lŸLÁòégÄüõÞÔŠo¿øñïìõ} 9¾¢eøûoìßۙɎÏfƒÞÅýï&mÀ@,³çPvñETœq:8¦’‡?…»S§`ZÙÿÎ'ëÊ«‰ýî»^âK¯à×éØ1cj0Pà9¤=‰/ŒÆòÙ,Šï ÍL¬ìv|èvWUÒïêOìò˜/¡ì„”w^~9¥×_»÷í÷ðƒç§>ü(jbÅÌÖ-¯ð¡AaÙ¿‘Ĭ_nWnȼŠ3NÇMÁ°q¦•+Ñ–:ñ¦$Sq晨I‰-½‰þ“"ÃMßÿ@úíw’<äI¶-š²¬ôÚkp^zÉ^ë­:ê¨à¹>nÞ|L+WR~Î9ÎøißÊŸñ™ÍxS’±|ñ%ž6m(?§JA!q_~‰š˜HÙEÇÕPòó‰]¾]^>>K•Ýºá>¬KÄÏÐx½˜V|‡~ûÔ¤D*N?­Þö˜/AÇÕõ¸ùú­[1lØHå ÝñÙlì ¥ ØåËÑåæÚ~ÒI¸;vØçmÙi¼^L?þ„nçNÐjqr®nLJíÏÚ7hP ‹0ÏŸ.¿O»¶”^H6zhwü~L?ÿBÌￃ׋§];*Î<#bݱËW„tƒï‹øð˜aÃFt¹¹TžxBàw§êÃyÅe Ñ÷Å—hªª(»è¢ƒ:¸+„B!„hÀÍbÓæÍ,YºŒ¾}njTO[ZJìÂE¨ÉÉ”ô¹9d™«kWŠ=€/ÎŒFUñ+ º¼› ¥Nf•é×Uh¼^J¯¾2䦱Ïj¡ôÆëIxå5L?üHÅÙg7oø|8n¾)¤n5>çÅa›üI0kiwIφ‚!7yO¿u+‰#GQðäP [¶D,cùl6E ÉnT(ò81üÑäÛ¼¹•÷:›„×^G[ZÚøJü~ª?Œ’[úR~Þ¹˜—.kT5‘Ž¯hYf>%·ß’±Š¢PðäPÔ”¼ééÁÙæE‹P (xrHÈñ«&%±uYxW†gžAÙ%…ï\ÝA¾šî ÷HQ¨èуØå+êÍRl¬Ø%K‰›ûy£_ $‹ƒ“}â$â¾ú:dÞÖeKB㦪$?ý Ö©ÓñÙlxÓÓÐoÝ ~Èj8ÎË/kéÕ@婧à:¾+¦ŸA—vnjiñoŒÁg·cøgÚÒR”âbr_y)pÝ)+G)*°i3Eßc2•¤Q/à×éðzº]¹$åçSvÉÅä=ÿ\H&²¶ÔIF¿[ˆùýÀ9_§ \n»5b{ÒŠSN!gbèC&æyóI|ùUv~òq ÕHÖŸ»#õ´o‡²+—$ÇH7Þ@ÁÐ'êl€ ÿMú]ýQò ðff‚χ~Ǫë®wÆEì*>fýzÒo¿ÕjC)-E[ZŠý dOþ(ôš]úŽw¥¨ˆ´{`\½oz>³Öñ&'±ëí±!½i¤ ~¥ 08íiÛ†m æ…}^Ü×ß`6ŠSO!ö»ïP ‹Ðÿû/º]»0ýü3JA!–/¾dçäZzw!„B!0ë7OˆøûŸøàÃñz½Q¿7æ?Ѩ*•Ý»E‡ªä¶[(½öš`ÀÌøó/à÷Syúih<bW|èÞråJ4ªöþ‚áOR0äq*O9¹ÉÛ¢ ÿ÷_*O ŒÑ³î7,ŸÏ ŒoWVö~mYYàfÄnÝXúõz€ó²KÃ×ë·@÷îNµ÷¸Íþü ­ÃÒm‘¦zÝÕ„„°òîŽ6ÄüõwírU>ÎYÕÑG÷ÍîÌ a™=‡ÜW^Šø4õ¾Ðx½¤>øgŸ…óÊ+"—q»1üõjbBÄ'é+Î>‹â{ï9à‚&¦~B¯h9n¼ü‘ÏPvÉÅû”ùéøŠ–qݺêõ ¯Ã›žFþˆa!ûÏTýýª8õT´æ ±|>Cc¶®âþwá¸áúðí¸bETÛÑôã (¸NèÞèuݦªŠä§ŸÅÕõ8œ»=d Ny/ŒbËê_زú—Èãîû¤°NŽ£oþýaÛçÌâßeKp}ÉO Å°acK¯¾¨¡©þá·L‹Sb—¯ äÖ[غtjBÉÃFPr×l]¶oj*æyµã/¿’üÔ3TžÐ­Ë—²ãÓéü»|)%wÞAÜÜ/°O˜R}˜1Äüþ… âߟ¾çßï¾%ïÅç”ÞÔŒkב£…wFÓJþ~ƒ­ß.eÛü¯Ù¶pÛ¿ø}v £_Žøžø7DzkÌl[4Ÿ-+ äöÛª»ó×ðŽp¼§ ~ãÚµä¾ö [—.fû—sÙ>ç34^•´ûîëþsëÂÁsg}ÝÌB`Œ^­ÃÆïçßïWPqöYX§ÏÀ¯×óïwË);ÿ<Œ¿üŠRXÔÒ»C!„Bq€‘ <Ѭj‚xÑfâérrðf6ì qýÖmhK´=ç<íÛ“óö› êf¬)Ûâ‹‹#ó†›0®Z_QÐx½ø,òF¤üÜs‚å½ii×®C[ZšUçó¡£q»Ñ–•—=ü †M›É¸ñfœW]‰79‰˜?ÿ"î˯(¹ãö=v U#vé2â¾™Gyϳ½]ê²|ú)>‹%06ÊÖmÄ}õ5®îÝ(xâñ`55éaøgCØû•ü‚À¿EµO9+yyøââð™Lþù‡„7Çâ×ëÉ}ytp|']nh—pº¼<’‡ùÏ>]›M¦(>ú0q_ƒíãO(½öš}úŒÖ$毿¨8í4ÔÄÚ¸Ü;°}îì°Þ$j”ŸníC: E>€åÓ™˜¿™× q<#ïú-[ˆ]ö-e—\Ò%µ»S'Šï¾‹¤gG»tYÈxÄ~“ÍÄ/—ã·æ¡×1Ç»di ÛW êØc‰›7]nnÈvB!„Bˆ½‘žhv âi\.ü††eéhËÝÑ%Ž~‰¢‡ dœù|X>ŸKÒð§HïÛ¿šÛ¨—Q·Åh‹íýp^y9o¿…/.Ó¯¿’òðc¤>ø0Û¿˜ìê³üüó0®^CÒsÏ“?ò™@ý~Ƽ‰.?н¥Æí Ö¯Úí”^Õ›ÄW^ÅöÁ‡® qß•ò³zìµ}±+¾#õñ´mKþ¨‘ÑïÐƼ2íMK¥òä“ñëk÷wå ÝQ°N›NÙe—»)ÒoÛNü;ëé©]Om¥ Là†³RPˆyÞüÚÐÕÙ[WßOÊcSuì1aÝn6ÓÊŸ±MzŸìÞÇg© m¥+¤ ¥’úà×íüäcÔn¡<­³ŒÔAE,ï¸éÆ}êÚK).&é¹çCæUs4U‡±|s¶v|EKãªc{£u–¡©ª"þ­±äLGåI'¡u8H|õõ@7nÏŽ$ï¹ð¼‚ô»ï |–NGñwPrÇm?øf-Æ5kCæ•ŸwnÄîŬŸÎÄ´reØ|5)‰‚!‘ƒ›— û„‰¸ºvÝ7æE³IzþÅÚàE•'Ÿ´_ú;Pòó)ïy6ÚââejB>‹ãÚu-½™þs´•ÄÍ Œû¥©ªÂðϬӦ¡ñzÁÔÝ÷¶ÉŸD bUžrò~=O¨ññÁãÙg2â©~0Âg2…üFˆY½Õn§êðÃBêðët¸Ž=6ÐEx~>jr2J~>JQQ 0³Ûº»º·ßxÆÕ«Qív|f3JAAȲªÃº»â;´••øL¦ýÚ®æRuØa˜/!iäs”]ø?ªŽ>¿N‡7µþ.|+Oí!ï(¸<Ówߣu:C~‡5ôx7®ZhOçNaÛ½&ãÞ¸v]H/Zž¶,=l`ßÕ<¼æ«ž®{ !„B!DCHOìÑñjº>ÔT¹öÚ@`®ôš«C2„J¯¾ Ãbûd Æ¢ò´S£n{Ôm©º;w¢`ÈÁÙ•'žHáƒI8Ëg³(ôŽ›o"vÉ2,³fcZù3U]:cØ´ ¿!†ò³z`^¼¿¹6³'ñù±OzŸ‚'ã¸éFP”’’FžŠÓOÇoÐVwqT7Hfï} ÿl`ûÜÙ Î*Š]²4bài˯+Cº\Ò––’òècßsw Ý{à3U/®è²ÿ¼™™ìüäãˆË"=­­ñz‰ùó¯ˆå‡cŸöiÝ1^4n7º¼<Ì_CÒ3Ï·`Ùï¾Òåk´m‰VCŽ¯ ݧ~càfš¶ªªA7IýŠMUÇ»ÝôÙläŠñ—_‰›3—‚'‡†Õå3Dzcæt´ĬY‹ýƒ°Ì™Cö¤‰aÙ¯¥W]IþÈgíª¨@·m;ö>$ýŽ»(8 l_évå -/ß{ȶÌþ¥¤„‚>MäûŸ~ÓfÐëÃæ{Ú·kDmÑ«éμx æÅK"—©3~”Ø?”‚Rï 8íW\'HÑýpu=.¬|ÁÐ!!=ß×ÀšJM&ôó5š@Ï 5ëXT„çöë©éª[)* ðJ×!Õf ÿÌxû~]G|o4UU´?íÌzËh‹Šðefî÷¶5‡ÜW^&eðØ>üÛ‡ã3›©<ý4×^SïïroRRؼšý·{¯¡Ç{M/‰/¿Jâ˯Fü\¥pßÎW~Sàw¬¿úw¨/x Wÿ.­s !„B!DCHOì77m";;‡¶mÛìµlMw•ºÙ ª»&ÀáîÜ)l™ëø®Ø>™‚~Û¶Fð¢nKBM[:Gl Ôv³ §ÅsÞ›€eöœÀ8c~?Ž>7Szå•dÜ~G ‹¡:( cÿàC*Î<Gß>µŸi·“7ê9Ìó`gBxÏï'ñ¥—±¿ûe]HÞsÏîq|¸òsΡêè£CæUy${¥Õ¢&%QvÉÅø,Òïê}Ò$  d–UœÕƒ³?Ã2ãSôÙÙxSS(|ð´eåØ'¼‹7+«v»''³þw4UUT~9kÇ©ÑU?9íMI®Þž[Ixõ5ÊþwæE‹ëì¼Àø‡ºìl¬3>ÅuÌѸ»t ٷΫ¯ _Ý€IÏ¿€¶¼51ëŒOƒó bæ 1üù'ÎÞW &'ã×éÐe7ìx î"ER5ogÛ7_6¸|c÷©ß`À“•EÉ·Ž¿‰“ˆ]¾‚Šµ7£mK£íåø‚†ïSOfº;ÑíÌŽ8VaØöN  «ºìö½Öjqu=Æ è²s»ºTªŽ ŒÙXy≔]t!mÿw1I#G‘3qB½Ÿç‹Å}XòFÄ°a oŽÅÑçf|qqÁ2E÷ÝGéõ×Fµ -³fá3›#vá)<9Æ5I7Èå¯Vô8³Þ<üŒ¢yy33Ù1}J`B« >öÐÏfêúÓ*ètaã•ÕÐVTT—©>öªÏÿš:ã רÛÃACh|û€ñëõø,v½5¦Þ2j„V« ­¾–FØ–†«øu¡Çš7#ì'¡Û¹“ØoW`úáb—¯ÀÅ÷ÝKÑ€{Ãë‰ô Vֻ͘=Øàã½ú\T|ÏÝTôˆÜcÅ6>±B!„âà'<±_(ŠB¿¾77(xÀ‚ß`Àô˯ÿ°ïöqˬÙÄ}ý ùßě™IÕ‘G ß±3¬.meuWy{X5e[Ü;à7ÐïØV—¦¦-»eéøu:J¯º2${P[QAÌo멨tÔíÜ >ÞŒô°ºý&#>‹%|øý$?9ëŒO)¾§?EìuKn¿µQÛª®šÀ§þß­!óÝ;Pøøc!ó^{×qÇÕÙîG`^¼„˜?ÿÂuܱ!åcÖ¯–ÀXx~ó‚…˜, kKÌ?H9ŠâBxîÎëíj°.Ý®\ðxHõBÈüš AûÄ÷ð8{__¯§êè£0®^ƒa㦰à~ëVR=LáÃRyê)û¼ªIöiõxqú­[÷±¦}WïñÕÀ}êêÚÓÊŸ1­\¶4ªJFŸ~”Ž>7ê="p<êwìŽÁX£æS“}©äçcûx2î΃ãßÔ¶;of&1üÕvùm=º;qÖ¥ÁïÛRPˆqÍZÊÏ='ê.^…ˆÄÓ&+0v™«*ì<-ZŽ_ѶÞPñde¢ß¹ª†u®ËÉ­6ø[IMe”ênÉCÊÖóp–_£‰ Tv{·QmoÛÆT}T“IÙÜj"Ñ–”„o›’4ªZoïÞÌLJ¯¿–Òë¯EëpÑ÷ìãÆS|Çma¿Ñu¶³./¿¢„Ùz¼{Ú¶ ”×éä|%„B!„8`h÷½ !ö¬&x×%BFZ}|f3å矇RP€mÚôeºÜ\^y ÃßÿÃîêÖ oJ ÖiÓƒcÖÕˆû&Ð`Mö[´¢m‹?&†ò^=1ýø† BÛòux[âæÍ'óÚëú7´Oœ„¦ª gï+‚ó¼ Õb\½6ìégýÖm(%%xÚ„Iãß‹uƧ z AÁ»¦b™3w‡@pD£ª¤ Hòð!å”âb¬S§ãîÒ%8.ÆD£Á:=t›kNâ¾ø wçÎÁÌ“ÊOdËš_Ãþþýéû@]gõ`Ëš_)¹¥_£Ö%û½w#Ö郞oçÔO‚Ÿ༲w`Û¿:v›FUIñ41þÒíã@£ªÄ}õ5@‹füÔØýøŠ–óŠË@Q°Mz?¬Êø±ã0þòkH°¾ì‚óA£ÁöÁG!eµN'¦ßáMM 8} ö÷?$áµ×ÃÎGºœ]è¶oop¶‹.7ãO+ñ x³ö­;5Ó¯¿àêÞ­Þ2Z§306Pu7_ÚRg°›DÜ UvëLä4ðGζñY,`ø/¿ ß¶=d™¶¬ŒÄç_ >p!DSª8ã 4•.bëfÝxÐɸv•Ý»{/Pð¦¥b\³MUh÷Öæ… #Öï³ZbÕéòPãvc^ºlïÓì9K­¢Ç™h<â>Ÿ¶,~ìÛDj-Ôøx¼i©Ä¬ÿ=8æsØêmS7Û_¿m;‰/Ž{ðÇg³áêÚ×q\¸Øo—‡Lkb~ÿƒª£ŽltVoå Ýñ›ŒXæ|Ž¦&›¯ZÌoë‰ó­ˆC!„B!„hI’'šUc‚w5 yÓ?‘ôìsè7lÄuÒ‰(yyØ'¾‡RTÄ®qcƒY$~E¡ðñÇHô™7õ¡øÎ;ðX>›…é»ïq^z žvµcÅ.]†®Î“؆›ˆûf>jr WuÄáÁ.£i @Ñ Ä._AFß[(ôž¶m0ýð#öwÞÅÓ¾=ÎK.–­êÒ™˜?þ$mÀý zoJ æ¥Ë°O|Š3N—FMH ôÊÞXg|JêCàèsjBúÍ[ãyhµ”Üq[°¼~ófÆƺSBº¬áîÔiŸŸD¶N›†/Î~?Jq1ÆU«1®Z…'+ G¿>Á}ä³Äa:¿^Oùùç£?æ-´N'¹c^k—³÷Xf~†/ÆHùùç¡u:‰ÿJI ¹/½Ø$Çhs(½²7qs¿$îëoЖ—SvÉÅàõb>ãê5ßÓ?¬‹UÅQJüØqõ×yÍÕû-è§-ubŸ8)0¡zÑå»d)úíÛ©8û¬¬ÐhÄüþ1üQgúwŒ«VAu—[Þ¤$*Î>+ä} 9¾¢å9äŠï¾‹ø·Æ’yÍu8nºŸÍ†yñâæ~Aå)'Szí5ÁòîN)½îZ¬S¦‚N‡óòËЖ•a7¥¸88v²}‹ïº“„×ß £ï-8n¾ 5%ý¿[±¿;Ç þ†lŸþ nwM• ÝÎlâæÏG[ê¤ðÑGBºÏl }õ{ê24iä(,³f³eõ/øbcI}äQŒ¿®bË/?Ñ÷4UîýÓeªhÆÕ«Ño¯Í¯ ´™,Äg³àMI¡òä“"¾ßg·óûØß}ŸÍÈ^éÞ-ø°HáCƒÈèÓô[n£ðñÇpwêˆ~ë6Ƽ‰á÷?cˆV-vá"tz0ðzHà¿)â¾™€aãFŒ?ÿ¼v¹NèNå Ý÷K›Kn¿Ëì9$=32ù~Ô‘è·o'iäóø5Š| ¤¼³woâǾMêƒS4à>Ѐmò”â’ˆõ»NèŽyÞ|^}²‹/ \£ß‡755ÐEöÆ2«É@K|îy܇†_§ÃsHûຎ~}±ÌœEòSO£­¨ òä“Ñ––b›ü qs¿éº5*½þz^}ÌnÆqÃõølVbþü Ûâ7)½®öÚ©Ú¬X§NÇøë*ŠzO»¶h<Œ¿üŠeÎçTœyFÈxvØ®Æ_~%á7q^|!Úò _xÛãæÆßê³X(î7 ¯¼FúwQ|÷]xS’1®^CâK¯€FÒ=½yÁÂ`†=ÔvÍj©x­:üpÜ:¶ô.B!„BÄ$€'šÍ¾Ｉ©ìœ:™Ä‘£°N›Ží“ÀøîNÉõ\X÷ƒeþT•ÄÑ/“6` ¸‘îèsSØÍûÄ÷0­ü9ì3^#øº¸ÿ]Á^´mñ´kGö‡“H~rÉC‡fjµTœ~ùÏ<ÒU§}{v½ùIÏŒ$uÐCvÇÄPzÍU~,¬#†áißû¤IÁŒ(dEíózÈøwÆõ¿ƒª¢””Ô¶c7Ž>7ïs¯nàÉo4âi“EÉwP|û­øl¶à²üaO‚WÅúÉTlMlÇ’3a|Ä›~ùO Çg6c1#¸Í½™™ìóz£Æ3Üo´ZvKÂ+¯a™ùYðIr5!‚¡CpÜ|cø[ŽãowgŸµßxJI ‰/ŽLh4øÌfÜ:ḵ_ ¨ilš0/^–•›a57Ä\ÇÀkèñ­¢ûïÛœDü¸ñ$x:P¿^ãÆ(zøAü»³Sðä|qqX«o²¨I‰ä?5"¤û[Œ±ã³X°¿û.©=œïîØÜ7^£,BP#fÝoĬû­z'(¨v®ãÇqã TœyF£×³FM&Œñóßb›<%x¼Ö•ôìÈàëŠÓO¯7€—?üIG¿D˜7ÁëEãó‘÷ܳÁž«{7r&Œ'iÔó¤Ý[›å]uä‘äLzW×ãZzˆ½ˆ›7æ͸¬¼WÏ`/fÃÆ°ë”駟0ýðßwï~ à©IIdôÉÃG~÷=ÁùîNÉ™8!ì¸+î†M›0Ï›yá"*N?‚!ƒÉès 7¤|ÁàGQòòˆÿñãß <˜qçíxڶŸzuX&ßۙuÖ,˜¡¢ñùp^vi0€§ÚídOþˆ¤§ž&éÙç‚™zÞŒt † Åqã ûe6Vñ·¡qUbûh2É#ž ί:ü0 Ÿx<ä9ŸÍFΤ‰$Ž|ŽŒ›ûçûcbpö¾‚Â…Ô]³òžŽ„·ÆÿÖØ`ù¢DíKÛﺟÑHüøw‚íñ+ =Î \ãë“ž1#/å‘Úßæ… ’žB!„¢Y5ô.¬&Šyš¯ëNïþWÓ§6Âk  ÔùW[gZWgZ©³\_gZWýW÷µ~·é¸âÇk{ZyÇC©ÃN¯Çd2¡4`¼ŠÄ„ÿö Ò%K—‘‘‘Þ à]CBmy9Jn.>»5!aÏ…ý~ô;w‚Û7+ ¿ÁФëU[¥ ¥Ä7%ŸÕRA¿]^šòr¼éøM{³O).F),BGMÜ{[Z me%Ê®]øM± êJPãr¡ËÉÁcŒ8þ_k¦ñxÐeçà×ëñ¦§5:ø%š‘ß.goffXànw·;0¥N‡'+k¯ûT))A[\ŒššŠ/6¶¥×Vˆf£ä磔:ñ&%îSp]ˆh Ùm{ M—~g6ÞÔT< —Y))A[TÔàßeÑÒ:èòòñYâð&'X¿TýÎl4UU¨I‰{}8Dët¢â7ÄàMM S:¥¨¥¸oFz°KÔ&áó¡Ïί7pmnʺ…B„ùfþºwßûC>~¿·ÛMEy9^U%---b9¹G'„­×¼&>çÇÛme€·úO<»M×}]³ÜWgZ­žöèöC­³Ü_ç__õ^ûëù ®RéÝ—Õ-Óy!$O4‹3N? ®é/ŸÙŒ¯¡ãni4›êÍ$ª¶xJ|o7”jÚíMmظXÁºããÈlŸÉ„ïC\Þo4≢|kâ×ëñ´kÛÒÍ{¢ÑDö QªÝìRMˆƒ™šœŒšœÜÒÍÿ1ÑüòfdÇ+mPÝÍ|þöY,¸-–}¯¨%(Jƒ‚ u×Õ庪 zX.jZm³þ_A!„B!šŠvß«"\Sï„B!„B!„B!þK$€'„B!„B!„B!D+"ì6µ¥›$„B!„B!„Bˆ:$€'þ³œÁòæàt·ã+™6åß–nV³©¬Ô2âé4¾øÒJUUmÖã¹ç8yû­-ÝÊʵX-’'„’F§°h‘¥ÞåmÚ¸™8a{K7S!„B!„Bì à‰Vçè£*)¯Ð2m†åc2ùÂÊ,_aæ·õF®¹º¤QÁ;€‡ºƒ¯5šÆÕq ùöÛ8ìv•·ßÚNwð¯¯B¬òrulÞbàÜsœX,á×Ȕ䃿;h!„B!„BˆƒðD«£ÕÂå—:?!‘E‹ã¸ø¢Ò°2sçZ¸²wIÈüÊJ-ß.7óïVzŸ.]ª8åär´Ú†|rýV­6QR¬Ð³gYÈ|G©ÂÊ•±tìXÅ!íÁ•+c1›}$§xùâ +mÚx8÷':æ~i%)ÑËÅ•¢Ñ„~FAŽo—›ÉÍÕc±¨œ|R;VíS»·m3ð÷?1@`Ì¿øx/K–Æ…”éÜ©Švíjƒ™k×™(,¨]×u¿™X¹2¿’’¼\q¹#ìs¢i»ß?ÿËúßx¼Ú·sÓãÌ2ŒÆ¦ *–8~þ9–Ü\qq>Ž>ÊE‡ámùù—Xª\N?½œ6Ä°lY®* Gåâ¬e뮪ҰìÛ8¶o×£×CÇŽUœzJùÛ²|¹™ÙzlVG]ÉQGºê-¿qc ?­Œ¥´T!%ÅC3ËIJ’ñBˆÈ~(/äa”ú4÷yš÷üÕšÎë†ï¾7³qc ŠÎOÇUœvjý¿3šãÚ.„B!„Bˆÿ à‰V©wïÆOHä󹶰^e¥–ù -´oç¦Ûñ•Áù«W›¸w@…E ;WáªÔ²å_‡îâÝñÛIMmüÄ×^Oæ—_cùã·¿BæoÙl ÿ½Y ˜Ï½÷ðêÉÄÛUþù'G©Bq±Âk¯ìä•×’)+S(*RØ´)†æë™>ÃÎÓϦpHû*rvéq8nº±˜aCw…ûjÑ’8F>—œv:í­kð£yÜ~[apú‹/­Lz?¥‹62uz<ãßIÄ_[3üa7z£i{Q‘ÂÝ÷´aÕjééÌf[¶Äœìá·wpÄõ·böÃFÚ’žîÁYª—¯ã²K¼ð|NHæák¯'ó÷?1<18—¡ÃÒÉÊô°3[OU•† Î/eÌë;CÚþçŸFúÝÖ†’YYn*+´äåëèÞ­‚&m#&&49g®aÃÓ(/×’”䥼\Ke¥–žg—ñÆk;B–ª #žNcÊÔxì6•ôtÿn5à÷kxæ©œˆ7×…¢¡šó¼ÞÜç¯Öt^ÿó/#ýïÍbÇ=V«Š†Àƒ<‡âæÝw¶Ó¶mh0µ¹®íB!„B!„øožh•:êæØc+ùv¹™’»½vœ¶…‹â¨¬ÔÒûŠÚ›‚ŽR…»îiƒÁàcÁ7›ƒ7Ñ/‰£ÿ½mxtpLÚ¶_Ú®Sü|»<Ž!çrÅå%œyv'†KgÈã¹\v©ƒ³ÏéÈ×ó,ÁÞÚµ&†K§{÷ ÆŽÙÝ®¢ª0êùTÞÿ0.]\wmI£ÚróÅ\{uà½gžÝ‘¶mÜ|üaèv0BoPÖ%D›8)‘OgÚþä.ÎéU†ÏEÅJHÙhÛþèà Ö¬5ñÆk;¹ðÀì?bèÛ¯-÷Ü—Åüo6…µ§¡Ê˵<14^=¼<:;XÏ_ZyàÁLN>¹‚«¯ªm‹¢øq:µ|ðQ‹æo"=݃˥áÞY|3Ïʼù¥\p¾3Xþñ!éTTh™;g3;²'ÆOHdôK)Lú »ï¬ ‚þ¶ÞÈ£epì1•¼þêNÒÓ=x½Þ|+‰7Ç&1êùTž±+Xþ½I‰L™Ï-}‹üXŠâ§Ä¡ÐÿÞ,?‘ÎQGºèÔI26„Óœçõæ<µ¦ózy¹–;îʧj˜úÉVºw«`Ñb frÇÝYÌûjs£·£B!„B!Äîö±cA!šÏ•W8ðz5|ùµ5dþçsmhµ„<ÕÿùçVŠŠn»µ(ä øžg—Ñ«§“ï¾t«¹?h4.¶.½ÄÑèç°..Ê˵\ta)ƒŸ#w‘›«–ŸôA><÷lN0P©(ðØ£y¤${ùèã„F·E§óë#660F’FKpºæo÷ñðRS™ŠOŽç…Q9Ütc1ii22ÿÜÆ×n¨•”(,_a攓˃7çV¯‰à´SÃÇ­9¡{óXøí7#íÛí}¬ ¦ïÅlÍL&qqµA4“ɇÇSÛoÖªÕ&ìv³Ùróà°Ã\,_È84™|û¥íV[às:u¬ ´EMÛW­ ì£Î]aekÆZ»ÖÄùç9iŒvíܘL>Þ|3 [Cϳ˂c$eezê}߉'T†LwìXELŒŸk¾ \ø¿RüþÀ¸‚¹¹:ªÜðsÅÅ¡ëóó/&RS½aÝ©i4 ^];vèÉË×ѳgYX&LB‚ŠÅâcíÚÐÉBl®škM]§œ\’ÝÕ\çõæ>µ®ózluÝaŸw÷]…aóZÛµ]!„B!„ à‰VËjU9§—“¯¾¶²c§ž¬L_~mÅëÕлwèS÷EE‡ÉIáãÜ%$¨ÕeößánŠ­½!§Ñ@LLè´¿NVa¡Žª* §œÖ©Þú ‹²2÷ÏM>&и£ŽÚûxtÑ´½°z½ôr /½œ±lAaã÷‘ͪ2aüv†<™Î £Sxat ))^Îéå¤oŸ":9x›ᘱZTœÎÐ›Ñ Yxvd*;vêÑjX½Þ×>ˆQA®Á]ÆV¯óâÅqœ²8òv,(Sµ"ÜÆM1ôáÝ·o¿ûÃÍt^oæóWk:¯×¬kBBÃÆÓmm×v!„B!„Bxä®°hÕ®ìíà˯¬Ìk£ÿÝ|ñ…•¸8矚APÓm—Û~Ó­¼<ÐS¬N߸±ÕöÄ×Uêõ~¬•·ßÚQo™HÉæÖÏŒ¦í57™ï½§€³{”E,¯²/N>©‚Eó7±þw#+V˜Yñ]Ó¦Ç3ãS;ïŒÛΧ—7¨¯ª!VW{SuÓ¦îEb¢—ßßÆÉ'•£­î€øð£ {¿NGÄÀõmC€³z”qß={,#„uMœ°­Þ V$M}^ßç¯Ör^¯ù͹½5^Û…B!„BqàžhÕN;µŒ”/_ϳpí5Åüº*–«®,Áh ½!˜•èJkg¶žÔÔÐbÙ9ñæÚdyö¡hµqu|>‚7ø€±ì«m[76ÄpôÑ®à ÂE4moÛ¶v,¸ãŽ«lHõvÔ‘.Ž:ÒÅÝwò×ß1\s]{Þ|+9âÞ¼<µÇ†Û­ÁáPèØ¡6ƒnáâ8T ÌçÔSjë((Ð…t‡Z#+ËMv¶>ìx@—™:¤¥>³M7 ¸\Úfß.B±7Ñœ×÷çù«åÏëú¶ï0º®ùl»Ôo0`y _Û…B!„BÑ:h÷½ !š¢À—9øã#ÓgØñùàÊÞ%aåzœÈèúâKkÈ|Ÿ¾úÚ‚Ùì£{·Šz?G£Ùs6Å¢¢ª°›7ß²ÏëxV2< s>·†-{slóìûg4—hÚ~â å˜L>fϱ¡ª¡7G×ýfâ7“ÈÍmü3?þËÈQ©¨»%ñÖ¥ŠŒ •®ÈYß.7‡L¯\‹ÏÇ[{ƒÖ_´ÚÕÙû$ îÖÚY=Ê(/×òíò¸ùååZ.¼äP®½¾]pžÅâãø®•üüK,Û¶BÊ—•iyîùT~[oÜ·%„ Íy½¹Ï_­í¼ðõ7á×äƒ29«gÇkØ|mB!„B!Dë x¢ÕëÝ»„ñ;.‰öíÜt;>ü)ÿ³Î*ã„îLþ$žöí<œw®§SËø ‰lÛf`ð£ya7éꊷ«üþ»‘ ï&b³©èt~Nè^A›6'îO<¡‚¯¿±2âé4ÜW€¢ø™3ÇFNuvß¾<[k¿">igøSiTTh9åä JKµ|<9ž9sm<öH^Kï‚&i»ÅâãÞþ¼ôJ ·Ýц{î. 9ÅËêÕ&F¿”‚F·ô-jt[¼ “ÞOÀéÔÒ÷æb“¼8Zæε±qc FØŽŠ“>HÀ`ìï­Û <ñd::Ÿk®. –«9æÞy7‘6m›ecûv]:W±e³·HOóãçŽÛŠ˜3ÇÆ ‡2üh.]»VRT¤ðú˜d**´<=bWH;~(›ú´¥Ï-mòx.:U±u«7Æ$±þw#ÿ;¿!„Ø¢½&5çù«5×ÏêQÆ©§”óîÄDÎ;׉Vëgê´xV®Œåê«J‚YzÙŽB!„B!„»“žhõ:êæØc+Y»ÖDï+ËhµðθíŒx*Q/¤ðô³©$&zyrH.}ûì904bø.^Âëc’ñzÁçÓðüsÙ´iø¼ë®-á·õ&fͶ±tY \p~)£žËæ¼ :PUÕ°1q"±ÛU¦NÞÊ°§ÒxúÙ4|ÕqÆŒ #†í⦋[z4YÛﾫ£Ÿqã¹áæ@š¢øéÑ£œáOîÂbñEÛ„ ÓO/ç…QÙŒy+™OgÚƒó““¼ ~4Ûn- {Ï£_Èᡇ3xôß@öH|¼Êk¯dsè!µãJpB÷ô/`ü;Iô¾ª=Z-œ{Ž“—GgóÕ׆?•Î9çu`â„íô8³ŒÄD/S?ÙÊð§Óxrxzp»deyxù¥l.»$ô8>¡{'lgä¨Túß›œÔ‘.>˜´®]¥kM!Äþíy½9Ï_­é¼®ÑÀø·wðÜó)¼ÿAãÆ'`µªô¿»€îð@¾¶ !„B!„¢uhhÔAÅ_ ;RWCZª“©ñ»H u””(Øl*IIÞˆeúôkË÷?˜Ùø÷Ÿ@ =®* mÛxÐé"çTVVjÉÙØÿ6kíþw»5¨ª&âz”•iÉÍÕë#=}ïã0æåëp–*$&y›åBˆ†ŠöšÔœç¯Öt^w»5ìÌÖ£Õ@ffýu7v; !„BLæÍŸO÷îÝ÷ZÎï÷ãv»©(/Ç«ª¤¥¥E,'÷è„¢õš7A“žóãí¶€2À[ý§žÝ¦ë¾®Yî«3­VO{ t¤§ÖYî¯ó¯¯ú¯ýõüW©ÎôîËê–iȼ’':&“ªš¯îCÝû^Q=,Kó´½¹EÓv­–®ÆšZb¢—ÄDoTïÉÈØ{{L&_HG ƒ¡¾ó2ÄÅùˆ‹kø>MIö’’]Û…¢9D{MjÎóWk:¯ ~ißðßòµ]!„B!„-G»ïU!„B!„B!„B!šŠð„B!„B!„B!„hE¤ M!ÄÒø·wàñÈ@DBq°óºB!„B!&ÀBü'™L>L¦–n…Bˆ¦"çu!„B!„BL$€'šˆ<ñ.„B!„B!„BÑ$€'Z5—KCQ‘EñçÃlöE,çóÁöíôz?ž&oGq±Bi©Br²—ØXß¾W(öª¡ûtûv=>_mÙfW±ÛÔ–n¾h99zÜn YYn%º÷nÝj Öì#9ÉÛÒ«!D‹ËË×QYQ;L²Ñè#5U¾B!„B!„û“ðD«ôïVC†¦óó/±øêĈÉ¥_Ÿ¢°òee ½Îë@Û¶n/ØÔäíyklï˜ÀË£³¹ìRGKožÿ„†îÓó/ì€Û]À»§>ßäí©ªOü»d€IDATÒãoéÍÒêx½ŦI¸n·½¾áå£qçÝYüù—‘Ë6’–Öð@¾ªjèu^ÎéådÜØûiË Ñz=68ƒå+ÌÁénÇW2mÊ¿-Ý,ÑÊ4çuÑç¿?p}B!„B!þ«$€'šÕe½ yŠw;Wñæá7Ìï “?ÿ4Ò÷æ"ºw¯DQü8ZëR±½ÞÏ9½œ¤¤ÔŸ!ðÂè-²Ô»¼M7'l¸¬K—*Îéå$=Š €€ìl=ýnm»Ç2O<žËY=ÊÂæ7dŸL™¼¿6m6ðØãMÚþŸVÆòöø$~[gÄQª`0øéСŠ>7sõU%-²=Ï>§# ¾ÙDÛ¶îýþù5Ün “>H`ÊÔx²³õèt~iï¦_¿"®ê]œ+/×òÖØ$>ÿÂÊ®]z ?GábÀ½ô8³¬qˆàä“*ÈÌô`4J–¬88­]gâ‘G3èqfCžÈXFU5\uM{´Z?Ó§nmTdè]8Ki¬7õm×Ò«-¢ÍoÆ\£›ûºøÍ<+cÇ%²qc ªª!-ÕÃå—;¸ã¶BââäÜ.„B!„â¿Ex¢YmÞl@«…óÏsF\ž•„(,ÔñÇFzö,cèܽ}&“o¯™3y¹:6o1pî9N,–ð›@)ÉõŠ®¾ª¤E6:GÃæ-²2=œxbEÄ2ñöÈÝ]6dŸ{L%Š®iŸÒ_¼8Ž»îiCf†‡;n/$=ÃKA¾Â´éñ<>$‡CáöÛ ÷ëö\÷› U '$<þD:sæÚ8ýôrníWD¥KÃì96"­ÿxø¡¼`YGCŸ[Ú²v­‰®]+¹áºœeZfͶqÇ]mxõå\tai“´«¾€†‹£ª¤¼BË´v”É~-[¾ÂÌoë\suI£³—:Z{mÖh$ê@Íoh¯ÑÍ}]œ>ÃÎCÓép¨›æc0øY¾ÜÌ[c“øá3S?ù­¶ÑÕ !„B!„ à‰f—˜èåÅç³÷ZníZyù:ví –ZŸ CŸ"?éÄ ¬ÖÚ›Iß.£ªª6Ý'6ÖÇi§–ïñs~(/äæd}vìÔóçŸÆyG媷k¾¥Ëâ°YUºv­Äï‡E‹-lÜh Æè§s§ª`»6lˆ!7Wlj'V0{Ž UÕÐûŠ@ÖÒÜ/¬¸ª´\rQ)V«Ê¦Í6oŽá”“Ë÷øäù’¥qØl*Çw­ Î+(бâ;3¹y:âí*ÇSYocCÛ^ÃŽeýïF<^ íÛ¹éqfFcä½Ç[Ù c ±û4 mû¤˜üñV2ëŒÁwÕUÎ=¿oK䦋0ý¬\K©S¡çÙΈ7óòt¬]g¢C‡*=$ôØ[»ÎĦM*+µ¤§{8íÔò°.ÉœN-?þd櫯߇ï¾7óφ˜àòN¨ˆ8îßÆ1ü´2–ÒR…”=Î,'i·1ÞV®ŒÅlö‘œâå‹/¬´iãáÜsœè˜û¥•¤D/_T̪ûã#sæÚº›¼ùÆbÎ9¿|ÏóÑUT?þ$žµkM\|Q)¯¾¼3XÏ-}‹¸¼÷!<32•^=Áí¿jµ‰’b…ž=C3ó¥ +WÆÒ±c‡´¯Ý†¿­7²k—>¤ì™g”í±[·5kL¬ÿ݈Ñèç”SÊI“±½ÄB«…Ë/u0~B"‹ÇqñEáÁï¹s­\Ù»$d~e¥–o—›ùw«½ÎO—.Uœrrù>D¢ùÎF{¾©QP ãÛåfrsõX,*'ŸTAÇŽU mâRCë@ïÑÑ\þ9–‡Â駕G 4oÛfàïb‚LJªÂ‹£SHO÷0sÆ–àož~}Š¸³/ŽcÍZSÈï!„B!„â`'<Ñj¼=>‘…uº}Z¸È2 0kæŽ>ª6Pñèàt jã¦ïÛoã6"-dÞžÆÀ{åµdJJ潉;ïnÃ÷?ÔŽtÆéåÁ ÔW_[™:ÍΩ§–³â;3……:¶ük`×.+Ž¥ @Ç_X™2y+¿üË'Ó™4qgœ9ˆåtj¹ã®6\ueIðÆÖ§3í ‘†V éò t”•i¹¥_O ÎmtÛŠŠ «V›HO÷`6ûز%†ädï¼½ƒ#ŽpíÓvoÎ}MÛ u˜L>2ÒC¶6«ÊÄ Û0›} Ñ÷?˜yslïŒÛNϳû„|ëí$&ÏÌéÿç•—k¹íŽ6üòk,™bbüìØ©Çlö1ö͜н6bÇýïÍ Nï~\Nýd+ݻՖWUñtS¦Æc·©¤§{øw«¿_Ã3OåpÅåµÇð«o$oWù知 ÅÅ ¯½²“W^K¦¬L¡¨HaÓ¦X;®à­·qÑÿB±±>Ž<ÂÅ’¥q”•i±WgmÌšmàù!7åSR¼<ýÔ.Ê˵!ó_{=™_~åßþ ©ËæÀ640Ÿ{ï)Îwb"_~e )»§1ð"3í~’½<9<§†ïj’ãKˆý¡wïÆOHä󹶰^e¥–ù -´oç¦ÛñµŽÕ«MÜ; ‹Â"…ΫpUjÙò¯Ãwñîøí¤îC;šïlcÎ7ÓgØyúÙÀ9ïöUäìÒãp(Ütc1Æîj–ñ4EdÑ\¿]aæíqIŒ™±ƒgG¥²xq3gü €³LáºëJèØ¡*쥻W°xqyyòß!„B!„ÿ-Òh5^u'ëVÿÍgŸþ ‚ëVÿòwänÁ¡% 7—µiÓ´ãÓ]{MI°îQ#söZþ°.Udgëyat*;vêyçííüøÝÍßÄÐ!µEç§Ä¡€~ú~=Ï.cÚt;z½Ÿ¿ÛÀç—òó/±êèÔ)a°isL½Ÿ»ac`Y—β%…¡ÃÒ8¤½›ï—o`þ7›XùÃ?ôêéä½I ¬^mjtÛœÁšµ&Þxm'Ë—nä›/73wÎfT¯†{îËÂíÞ·»©Í¹O£i{çÎUTTh™ô~¾Ý’Ž>ÊÅ¡‡¸ƒ™+7ÞXŒ^ïç“)ñaŸéri˜û…•£rqì±µ7ÔߟÄê5&fÎø—eK62ÿ›MüðÝÚµsóð#!ŸÙ¥‹‹u«ÿÞýâóÍ!ߋ㻆v}öÞ¤D¦Lç–¾EüôÃæÎÙÂòe9úèJ?‘Ά:Ù{:ÅÏ·Ëã¸íÖ"–/Ý@B‚ÊÐaéô¿«Ë6šêåëyµô#ŽpñÄàÜu@WlýCr’7¼s»5üý·‘ä$/íÛ…g‚œÓËÉe—:ö˜-·7£_Èn‡ÞW8öXvþ 3fÚéÙ³ŒU?ÿÍÒÅ™÷ÕfÞ¯Î*â@ÐáP7Ç[É·ËÍ””(!Ë.Š£²Rò]p”*ÜuO´ŠŸßlfîì-,˜·‰wÆm矌<:¸iÇÝ“hÏ7kך:,cŽ©dŲÀ¹ì§ïÿ¡ïÍE|ôq<Ó¦Û[zwü§Ds]¼öš@Ï3>µ‡Õ“—¯cÙ23Gé vƒm·©<ü`—_~_÷[ 7„šßDB!„B!Ä…<Ê*BóÙ¬9x½{_§ÓÑûŠËˆßc¹Š -_|i¸ì´SˉÜìÜÄ÷c4î éu~bc}{¬»n·LM=N¢ø‰ ÔYóDùž¤¤¶Ù§3m|óÕæ`÷RII¡å4‚—\Èœ8ö˜J/©í í¸c]|3ÏJn®ŽNÕ]„mÙl¾ÿ݉‰TTh¹íÖBÌf_0Ó¹:€ç÷Á £rhÓÆìnT¯÷sÍÕ%,\daͺÀXdiûæ-–.‹ãÒKJ¹°NVçNUô¿»§ŸMeÉÒ¸zǯîZðÉ'vßÓ¶­›ûpßý™ÍÖF!šÚ•W8X»ÖÄ—_[¹ñúâàüÏçÚÐj ɲýüs+EE Cž( mÛÚ@zϳËèÕÓÉüþÝjˆdojÑžo&}=÷lNðÁEÇÍ㫯­|ôq×][ÒÒ»ã?#šëbV¦‡ÓO+gù 3›·Bºž9ÓŽªj¸ñ†â½~æ’¥q|ý•ž=ËÜ%¨B!„Bq°žÏ駟Êû|„ªªõ–S…~}oÞkðc×<ð`ä›ã»wý·?Œz>³9<øqÊÉåût#ÐV,»²·#dl˜úÔÜH­¹éU3—©zÚãÑ`±øHMõ3ð¶n5ðü‹)˜L>:v¬âÂÿ•x5xññ*—]êÀëÕðφŠŠ¼^ Û¶‚€ÅÅJX[ÚöU«7V;wv‘_zú¨híZSXoõE>ž±+âømM-Ú¶·iãᛯ73ušùó-|øqï˜@LŒŸË.uðÈCyÁà3À­ýŠ˜=ÇÆÔ©ñ<üP^pþ´vâãÕ°®î;¬Š¥Ë⸫®¿®˜“N¬ÀlöoR7ÖŽzòòuôìYFÑnû:!AÅbñ±vmhfB¼7ø0™|ÄÅù‚Ç¥ÉäÃãÙsVåØ·“xçÝD.8ßÉ-ýŠ‚ó]®ÀûêfØ­Ycâ­·C#Ã=’·_Ƴúûo#v›–Ù¹{£­ÝÅ•2rT*Ÿn ðJJ–¯0sÊÉå!AóÕkç¾Hc‰žÐ½‚ù ,üö›q¿ð ºóͪÕ&ìv³ÙvÞ>ì0ËW2#±ö_Ío†^££½.^wm1ËW˜ùôS;>¸.úý0c¦ «U8†c]+V˜¹ÿLÚµuó⨆£+„B!„BL$€'ÂtéÜ™~}o®7ˆW¼ëÒ¹sƒêËÊô0õ“­—%&6~ÜÆÚ¸)ƒ>?/_Ga¡Ž»î,lªÝ¼G%[„é¾M…Ø߬V•sz9ùêkk0ë÷˯­x½z÷í‚°¨úÜ—œ~½MHP«Ëì¿ŸƒÑœo uTUi8å´NõÖWX¤•)¼ÝEó['škt4×Åsz•‘œäeö=˜‡¢À?™Ù¶Í@¿>E{ ¼ÎøÔÎÐaiy„‹ ãwÈyZ!„B!Ä’ðDDõñ¢ Þh?iiÍ×…^´&NØÖ¬Ý0%'7íM¦N«X±ÂLE…– -ôìéäÈ#\<õtªªaã&‡u©pê4;¯½žL·ã+y~T6‡T߬[½ÚÄÕ׵ߧ¶×Ü ¼÷žÎîQ±LݧïkœÕ£Œ×_ÝÙäÛ:m{ »]å’‹K¹ø¢R~$ƒ9sm,ZÇç×föë[Ľ²˜7ßÂÅ•2}†E®ï&Ì`ð3ò™}$+Ì|ÿƒ™%Kãxbh:s¿°òÁ¤m!Ýh6TÍÓ³z”qß={,³/ÊÊ´Üs_?þdæñÇr¹íÖ¢°2ÉÉ^ôz?;³õÁy'ŸTÁÜ9[ýR ã'$6èó|MЛªF>_xÀxo†B´FWövðåWVæεÑÿî¾øÂJ\œóÏ Íjªy Òø¤åå“Œ® Î »kŠï¬^ïÇjQyû­õ–‰˜ÑýÖiì5zo×EEñsÕU%¼=.‰eßÆÑóì2¦Ï°pC=ÝgúýðâK)Lx7‘‹/*åùç²1›þøB!„B!ÀõÚ=ˆ×˜àØw;ºüm½‘5kM ~,—ŽÜ8Ë´üðC,yyz.¨ÓeåüF¿2ÞQvŽ>ºŽ mÛ@ V§ósÜq Ë4l-¢iûÎl=K—ÅqÌÑ•}”+d™Fgö(gÎ\;w†nÓsÏq’•åá“©ñüï'ŸÍ²Ñ«§“Œ=tKj³ª\ta)]XŠªjúd3fÚùáGsÄ.ïö¦M7 ¸\ÚfÛG¥¥ }oiËÆMÞ~k½zFóP§ósÌÑ.~]ebãƘu“©Õ2û|¾Ðqss÷ýøMHð²s§¿ŸLÁ;÷½n!ö·ÓN-#%ÅË×ó,\{M1¿®Šåª+K‚YYóÏÎl=©©¡Á®šëB›¬Æ?dÓœßÙ¶mÝlØÃÑG»•,šFc¯‹×^S¸ñIÌšm vÙzÊÉå!câÕðûaÈ“éLŸaç¾{ x``~K¯¶B!„BÑ¢‘ß!þKj‚xFcŒïZH§ê Ç´éñ$&x9îØJ¬V•ºW2c¦Ÿºt© ŒøüÈDlnÊ|>øð£„ÀkµñÙF'žPŽÉäcöênõ¬ûÍÄo&‘›Û2ÏÔd"eXEÛö¼\ÃG¤ñ‹©D òÇcJef†ÞôÖj¡ÏME¬\ËÄI äè¸ù¦ð,·[Ão&±xI\È|Eñsæ™ Ë~z®é†³¢²þS·Åâãø®•üüK,Û¶B–••iyîùT~[o¤±Tî»?“¿þŽáÝw¶×¼«qõU%Œy+©µƒÅ¢¢ªzxÞ|K£Û\ãÈ#\TVjY÷[è€ î{ÝBìoŠW\æà?ŒLŸ¸\Ù»$¬\3Ç_|i ™ïóÁW_[0›}{‹V£Ùs6]s~gÏêQ†Ç£aÎçÖ°eoŽM >°"š_c¯‹Y™N?­œå+â˜7ßJU•†ëɾóVÓgØyhP¾ï„B!„B$O4@—Îy|ðc˜Œ»é_êPxklý7ﯽ¦$dü¶†š¿ÀBe@FEEàõœÏmÁyGî¢S§½gýìnÛ6«×ÔÞä_µÊò/€Vëç’‹K£®;Z5í_¸(ŽË.u3zõtòêëÉtî\»ŽÝŽ¯`Å 3/¾”·RX¤0î$ºw«à×U&~]m"/_Gr’7$ ©!,÷ö/à¥WR¸íŽ6ÜswÉ)^V¯61ú¥4¸¥oQt•Ö±/û´f|œ¯¾¶–ê!&ÆNçç‚ó˜L¾¨ÚÞµk%çŸçdÞ| 7õmÇu×”žæ¡Ä¡0…ÙslÖ¥Š^=ûâ¼æê^“Ì˯$Ó±c§œžEg0øY±"ŽÉŸÄóÔð\Ž:ª7xãÍ$’’¼œ|Røûj‚¹/ŒNᦊÑjüäè0ü\qyí¸W?”ÇM}ÚÒç–¶ y<—NªØºÕÀc’Xÿ»‘ÿßøãöÓ™v¾ÿÁL×®•lÝj`ëVCX™ÓN+'³:ë°÷%Ìšmã˯¬TVj¹ø"ªªá?|:3ÐŨ¹N°ùÄ*øú+#žNcÀ}(ŠŸ9släTg Õ#¬ZmbûöÚϯ XÎ_`Áf ))Þà>¸êJs>·ñÈ£Œ|&‡”/K–ű`¡%êï‚­AïÞ%ŒŸÈØqI´oç¦ÛñáY·gUÆ Ý+˜üI<íÛy8ï\'N§–ñÙ¶ÍÀàGóBøØ]¼]å÷ßLx7›ME§ósB÷ Ú´ |Ç£ùÎFëÖ~E|:ÓÎð§Ò¨¨ÐrÊÉ”–jùxrnéWÄ ùäæé˜=ÇÆigtbÝê¿1™|Q·çî» ‰1ú7>‘nn2Çzô(gø“»°X¢¯³Æ¾ìÓ¬L?˜Ç‡'0ê…T¼Þ@6Þ 'l$+ÓuÛ_{e'oOdÊ”øÏõqÍÕ%<úp^ıäââ|\Ù»„?Jàæ#g¼ýÖžžÆfàõ¢G ô8³Œ1¯íÄlߎW]é`ÅwfæÍ·²b…“É–ÍpB÷ &NØÎÈQ©ô¿7+8ÿ¨#]|0i]»6þèšµ öêÕ&V¯6E,óö[;‚<­&ŒßÎó/¦ðÙ,{0ë0.ÎÇ9½œÜyGaÈñ{ݵ%ü¶ÞĬÙ6–.‹C£ Î/eÔsÙœwAªªj#m“«oâïîégSƒ¯Ï8½<À;åär~0×ÞHæú›û¿m[7ãÇîàÊkÚ÷ƒŠ‡º9öØJÖ®5Ñû GÄ2Z-¼3n;#žJcÔ )ÁïGb¢—'‡äÒ·Ïžº1|/ŒNáõ1ÉÁóêóÏeÓ¦Màó¢ùÎFËnW™:y+ÞJãégÓðUŸ32<Œ¶‹›öpŽM¯±×Åsz•‘’ìeg¶žû«ƒ¼»[¿Þ„ªBI‰ñ÷@¿>EÀB!„BñŸÒл*š(æi"¼®;½û_Mº6Âk  ÔùW[gZWgZ©³\_gZWýW÷µ~·é¸âÇk{ZyÇC©ÃN¯Çd2¡(Ê^7XbB|“ì ‡ÜønmJ EE éž1‘**´ ì´}áóºLóx5¤¥z l)Ѷ½¤D¡ @‡Ñ¦îíðàÙ,ZÇ+6ì1³ÀåÒPP Ã«jHO dîMy¹–¼|æX‰‰Þ=¶'/_‡³T!1ɋݦîµîæäriÈÎÑ£×ùÉÈØóv¬¬Ô’£#1Qmòv—86nŒÁlöÑ¥³+dÜ.!f••Z²³õÄÄøÈÌô4iæis~gœN-yyz,•ääè3ÈEÓŠöº(„Bˆÿ®yóçÓ½{÷½–óûý¸Ýn*ÊËñª*iiiËÉ=:!„h½æÍ_Фçüx»í  ðVÿ©€g·éº¯k–ûêL«ÕÓ^©u–ûëüë«þ#Âk=ÁUª3½û²ºe2/„dà q²Û"ßDÝ[@©¡´ZÈÊòì{E- Ú¶Ûíj°‹Î½ùó/#_~eá–~E ÚÖF£?êíh6û8ÄìnPÙ”d/)ÉÑg¸6£ÑÏ¡‡4¬Ý&“‡6¬l´ì6uc~ q°2™|tè}Vzƒën¦ï,ºp¶Xš§í"zÑ\…B!„BÑ8ÀBˆ&°|…™-[bxëíD’’Tî¹»°¥›$„B!„B!„â%üÛ‡£ß±¿ÑHåÉ'QðØ#x=´¶î I0°zið™cñddà:ù$œ—_†/6vŸ÷“¶²û¸ñX>ÿ]v6~½÷á‡QÜÿnÊ{žR6ãæ¾èò ê­«ì¢ )poÈ<ë§3±~<™˜¿ÿÀ“™Iéõ×QÒ¯OH@,yÄS˜~\¹Ç¶nŸ5¿©iZ‡ƒŒÛïDë,#gì˜í^#vÅ ^}ƒ˜?þÀ¯Ñà>¬ E梨Ǚae 6’øÒ˘¾ÿÛÏfÃyéÅ zŸÙyŸÖ£ôªÞ”Ü~[£×Íôó/Ä¿1㯫Ш*jR¥Wõ¦øÞ{"‹ãæÍÇ>n<†›Ð¨*ÞÔTœ—_JÉm·â‹‹ –Óeçqëí{üì‚Ç nŸF}7³¾+W’<ì)üŠ–Ÿ|ŒÏf‹XNëpøÊ«Ä}=­Ã?&†ŠÓO£ð±Gñ´kR6Úó€uƧØÞÿÃÆM¸;JÉ·ã¼âò}jKcö©hÝG¿„yÑ’z—{Úd‘3a|Äe•'„'3¿1¦Þ÷ ŒRê £ï--½º" Y½¯ ÍžÔjð›ÍTuîŒóê«pwlK7Q!„B!„ $<Ñj•ŸÓ+â|m™ë”ipê)µ3}>Òï¸ÓÊ•”÷<›Š=ÐåîÂöÁGdôéÇÎ)“©:âð`q¥¨ˆÌëoD),¤ôÊÞ¸;wB·kÖi3H¿ýNvyòsÏ©·m¶&7÷‹@{Žˆe4•.¬Ÿ}F«¯£u:ÑÖ%b9]~ú-[¨8«îN–{Ú¶ ›—øü‹Øßÿ€òsÏ¡øžþèvå`Ÿô™}naÛ—Ÿš*ú-[ð´k‡ëø®hËˉùãÏ@Àåíñìû&UGÕè}¤QUÒo»㯫¨:ê(J¯¾ my9–Ù³I»ç>òF>ƒóÊÞÁòú­ÛPJJ(»ðëóde†®çK¯`Ÿð.Þ´Ô@0ȃyá"_áŸÈ{aTívÌÙ…~ËÊ.8¿É¹ÁJÓe¦<9œ˜u¿ ­r‡-7/\DÚ€TÖ…‚'‡€êÃ6ùÒúßKö‡ïãêÞ­v»lÛNæ 7á×j)îÞôtŒ«×`ûø ÿl$ûƒ÷‚ÙU»ïÓH¼^/Ówß“qÇ]¨ Å÷öGMH nÞ|âǽƒ~ûr_y)¤¼uƧ$†çÐC)8¿Á@ìòć釟ØùÉGÁŒLǃ~˼™™TžxBÄÏ÷Ùíµû´ßÆ°N›RT„ÖáÀòÅ—8n¼!¬ŒÆë%ã–Û0üõ7¥×]KÕÑG¡Û¹3ð½»á&¶Ïù 5))X>ªóðúâǾ»K  TÖé3Hüš*7¥×]Óè¶D»OEë§ËÍC¿e åçôÂg±„-W““ë}oÁƒ÷Z¿çÐCñT¿ö7C–©h>úÍ[@Q(»à| pÖåæb™5ëÌÏÈz¥×\ÝÒÍB!„B!DHO´Z…GμI}øQÔÄŠëdj™.´r%ÎË.%ïÅçƒóËÏ>›¬k®#áåWÈ™8!8ßöáGè²³ÙõÆk”Ÿ^mùóÎ%«÷ÕØ>ü¸ÞžaÃFG¿„óÒK°|>7l¹ñ×U$¾ü †?ÿ¿Ÿâ÷‘øâèz×Së d9”^Ù›òóÎÝëv‰Y¿ûRzÍÕä?óTp¾ûðÃIzúL¿üJy¯ž!ï©<¡;ù#Ÿ©Ý^óæ“úØ`ÒïîÏö/ç¢Ö šDÃ:e*Æ_WQÞ«'»Þ|#¨)¹í2¯¹ž¤‘£¨èy6j||ð=>KyÏ?·×º ÿ}â{x33ÙñÙŒ`‹ûßMÚ€XfÏ¡ì⋨8ãô÷>>¸ÞnᚊuƧ˜¾]Nù¹ç`^°0l¹¦ÒEòð§pwêÄΩŸº7Êþw>YW^Mìwß…ðÞƒ¶¬Œí³fâ®ô:¯¸5)‰ø·Æb^°0ìØØ}Ÿ6•¤ç_įѰsÊÇÁ¬ÂÒk¯!íÞÄ}ùŽ›oÂÕõ¸@aU%qôËxÓÓØ1cj0ÛÎÑçfÒúß‹yñŒk×âêht{LƒŽh¿¡u:1/XˆãÆ0ýø#–ÏfG àY>›EÌïPðä7ÝX».'t'£Ï-ÄOÁÐ!ÁùÑœ¿”‚ìïLÀÓ®;fL /¥W_E›‹/%ñå—q^~i°ÛËhÛÕ>”‡EÌþÝ]Ìúõèvå†Ì«8ãôà±Ö 7aZ¹m©oJ2gž‰š”ØÒ›è?IMˆ»>6n"óêkI|a4Î+.é¢W)($ö»ïPòòðÙí¸Ž9w—ЇŽÌ‹ãMN¦ê˜£ëý\ý¶íþù‡Êº×›É,„B!„Bˆ†k†ª„h>±K–7÷ ?2ýø¥»Ýx¯:æh*N;•Ø~D[Ý€»CJn¿-,HWuä‘øF´ÎÒˆŸ¯q»I}ðaÊþwe—^¹ŒªâÍÈ hÐl[8gïË÷¸NÚÒÀgùì »Ùeþ)h4 2¿¼çÙl]º8,xIùùçQ4`JAa ¨‘,ŸÍ èÁA!ãÞ©  yœ’ÛßõšeöçàóQrû­¡FE¡àÉ¡”^ÞôôF×ßXú­[I9Š‚'‡âiß>bó¢E(ßswÈ r5)‰­Ë–P4ðþà<ÇCìÂETžpB0xWÃqÓ  Ñ÷ͼý²nJqqàæë)'‡´ZJî¼#°nóÔÎ.+Ãqݵn>ët• àêÞ=Pg^~£Ûíw£1â¾ø MUåçKÙ…ÿ#fýú`–!å¾þ¿Ñ–¹RyÒI¸;u$îë½ï£zÏ_¿®BãõRzõ•!Ç‹Ïj¡ôÆëÑ–:1ýðc£Úí>'ûÄI¤Ý; äO).išÊU•äá#hsÑ%$¼öq_MòÓÏЮ׹XfÏiéUÕÜ;àêv<Ú²2t9»‚ó-3gÑîì^$uæ,_M›Ëz“øü‹!ïOñ4I#÷üà…íãɤÝ;myEK¯®B!„BqPž8`hªªH~úY\]ÃyÉÅ!Ë´ee@à©óÝy:tUÅ°qCp^Ù%SøÈC!A'Œ¥q¹pxbÄ6$Ž~ M•‹‚aCëmgå‰'ûÒ‹8úÜԠ샚 …jµ¡u80®^ƒqÕ*´ååË›VþLU—ΨIIè·n#î˯ˆûú›°ìŠ½q^;,vùòÆí·Ã_¡&&àîØ!lyÅÙgQ|ï=!Šh×­ lÏ“N [æMO#Ä°ˆŸÛœ4^/©>BÅÙgá¼òŠzË™~þ9° N=­ÃyÁB,ŸÏÅð×ßaeõ[¶ ­¬¤êè#Ö© x32ˆùãÏý²~µß£„°e5Û:毿‚ó|6E>€ó²KÃÊÇüè^ÔÝ©cãÛåw£1¬Ÿ}†7#×qÇ»vµÌš¾>¿ÿ»SLjãÅU}4JAJAýã;îéü¥ÙãvïX½ÝkhÚí>§¼F±eõ/lYýKÄ1÷…}ÒX§NÇÑ·ÿþ°‚ísfñï²%¸Ž>Šä'†bØ°±¥W_TÓååƒFƒ·º‹U­ÃAò°áxÚ·çßåËØöÍ—üûà Ê{ž}ÒûW¯ ¾×Ó©#†Í[öX¿aãF|qqx3öÿÃ5B!„B!ÄÁHºÐ ÛG£ËÎ&ï…ç‚ãÕð¦¥î-=mBÇŪ¹‘­E¬×øË¯è ‰Y³딩Tž|E÷ßV.vù ¬S¦±sÊd|fs“­—R˜ðÆb—.C£ªø }ûP8h (J°¼nÛ6*Î>‹äOc2¿^ÆãE¡øŽÛ(ô@ƒ>WMH@G¿u[ãÚ]PÌ6l5ž(ë7/^Œ¡ë.w—.ûðKx} JQÙïOÜc9ýÖmø¬VÌ‹“ŸKáƒëÖ¸Ýh¼ÉÇ‚æóæSuøá1 «÷.77d칺ötþRS]¾þ‰°Ýó«·{Qa£ÚÒTûTØüC0àë߇ïL$ö÷?À›‘AácëöÙl J›K.Ç:mZH—®bÿÓ:Ä{ÃßSvÉÅøMîx5>ù£Fâi“…ÏKѯ×SzõU˜-&fݺ`÷ºîŽ1}÷=Jajb1ë×c^²Œª# ¼çÙè7lÄݹsK¯®B!„BqО8 h\.ì&âêÚ•ÊÙqåçŸKüøwHxý \] f}Å.ûóÂE:ª(»K~æÙ`fTùyçRøèÃaÝ*EE¤ ~œ¢î§ê裚tÝjºëÔ:ËÈó:žvíÐíØAüØ·±Ox¨OK[Y‰FU1ýð#UGŶùßài×ýÖ­¤<1”øqïà9䜗_Ö ÏöÇÆ¢-.n\»+]:¢CIë,#uÐC—9nºW·@`B㪬®ßÐຒžŠ<.\ÑÀû÷)€gZù3¶Iï“ýÑûø,–½®£¦ªŠø·Æ’3a•'„Öá ñÕ×±N™JÒ³#ÿÏÞ}‡GQ¼ÿ^KîÒ{½(‚H~RDT¤ˆJSE¤ØAzQ¥÷&½ƒ(•ÞéåÒså÷Ç%—w$ò~žçnwçöfwöfü;3D}ñ¹å8³Ï£)û<êþ8€öÐ!Ò«>4ÃìäŒ2#Ã>?û÷£Û¿ßþËUª"ðÌ:-©žÆuÛv</±ѨLMÅï³± Tæû;Êá²g/ý? «T)¢Ç~î0öÈ‘|¯èÑ#­s'æ·QîË—Ø ‡›Üú9ü>‹Ëïû¬ó+*Òm¯u§3gpݸ Eö0q9ר"=Ãá÷Ü®þJ«S£¯‹“Üö2ª< Xæ“òža™»3ç¼6/w£LÅýËoÜW(I«W—¤W:û÷k®^EMJÓ&v÷£&ww´G•ôizèh®^£LݧP˜ŒÖ!ÄSZ¶ zÔk:£·7úžGa0àtæ ª¸80Ñ\¹X†àÍ‘Ó›ÚéüyÒ|}ðúy..[¶b ¶”¿^:*ŠÔfMJúð…B!„Bˆÿ à‰‚ûÊÕ¨ˆéÒÙáöŒÇ#¾wO¼§N§TËçH¯þ8ÊÄDœ.\Dßî%<,´öxºYä·ß LJÄéü<æÍ'¼M[¢¾GrËÖ4C‡“Y© =Þ¼ëÇ;ðCâÞíkâ.{HÏÌ åI²á­ŸÇsî/ÄõíƒY§Åœ½]a2rcÒÖ'æ³J—&òûo)Õ¸ 8€§HIÁì ñ7´ÓkvÃ=&¼óñ}z[—M9Oðç´È÷; œÿq«Lé{òý9½7]·mÇuÛvÇibbKî=¤Lnn$½ú `™çS™œÂµ…óI¯þ¸]Zï)Sñúég”z=f• ³NJûIÎp¾š H¯ñ.;w’ðÎÛøLøÍ¥ËÖ^ÂÒO!„B!„¸{$€'î+V`ru%¥YÓ|ÓÄõïGzíZ¸®ßˆR¯'£Z5"˜€Ç¢ÅÂÂ~.§WVzÍšèÛ¾@X‡ŽøNJ“Ƙœp_¹ —í;ˆë÷K—Y?—3¯öÈQÌ.KIiÖÔá!otÃ{ÊT®OŸj“ÎcÑb|&L$½fM¢Æ~FV™2h!´Ók6iszài.^D»ÿŠÔ4;¿ŽûªÕ¸nÛf홞!‚ÓÙsvA6Í¥KHìÀH{ª~¡ÏKzèDwà€Ý¾F#!]º‘ܲ‰]Þ(ô¾sdVªDÌ°!·M§¾ YYøŽýÒ6Ù½ ¼~ü “Vk àeV©‚ë¶íh®^µèr(Ó,Cƒæô`Ì,_³³3Nÿc÷½ª„4W¯yH̼ R¦9Œ^^v¿ ÝïûPddχde6[zv-YJ|ŸÞÄõ{ïŽój=W…üm@ÁËÔcù P(ˆ3ÊÒã$çÃG𜿷ßÖ[‡!ÌxôQœOœ@a0`VÛÞ:OœÄèç‹ÁA¯0õWf…òÄùØfÏø ¤?‘{Þ‹’—B•©” Šô ÒŸ@ðý(íÉ'IêÐ¥Ëp_±ýK/Z·¹nÞ@Ô—cÉ*•;°úúu»ý˜ÜÜ0¢Ž¸ŽëÖm¤×}“‡;)M›à²}§µü3+UD!„B!„w‡²¤3 Äíèþú €ôÚµòM£9ž®ÝñX¼Äö³,ó‰éÛ>oìÒíýŸ‰“Ðœ?o“^a4¢ýë0¨T,—ø>½¹pä/»×ɈýèC.ù«Èsã…½òaÏ¿h7̘:2—½¿c Ál]Ÿüܳ(ÒÓq¿éXµ‡¡ŽŠ"½æí‡xtþû|~˜ˆÉÃÝ:'VQèÛ·À{Òd»óè?úœÿù£ŸoÑöýR[P©ðœý3Ê”›mÞS¦¡ýó/Û!‹QÄO³^‰Ý»pmá|.îÿÝš>¹UKP(ðœó‹Í~”z=º={1b ,Ã'¦4n„nß>4—¯Ø¤÷X´Ìæ»À+(Ÿ  éÜEÞy÷Ìf¼§ÏÀììLòsÏÚ¤÷ž<%K‰Ðÿ®ï ð¿‚RÅÇã²}é5kôJGô/‚Ó©Sù–QAê/…ÑHÐ{ýð5Ú.Ÿ “Y¹²u^¼¢ä¥0eªÔë-½ûÌfËr’Þ:L"X‚ʪ"Λ)P ˜M7™ÜÝ-[üù§]ý¥LNÆwÜW8Ÿ8QÒGðЋýø#Œ~~ø}1uTTî†ìß¹Í0º&ž¿Ì@a´-÷Ì QGFáº};ÉÏ4 µi´‡ãt@L%}¸B!„B!ĆôÀ÷=Í™3·F1«tiÔ×oà÷ÅXédT­‚Ó©Óø~7Cpñ½m{žÄ¿Ûm÷·éÞƒ„žïY¡<ª¸x<,Äéôi’:´/r#”*:×;­ËŠÔTËq\¹b3übR‡ö PקÚ¹ ño¿…!,Í…KxOŸŽR¯'ú“Ñ6Ãÿé;´Çsá"ü>ýuL,iOÖFsþ>?LÂììL|Ï·íòäüÏ¿xO™†"+§3gqÙ¾T*nü0¾È6€¤öíp[³·õP¦¤ü|0ðX¼íá#Ä÷é]äùp²Ê–%¾WO¼'O!´c';¿ŽÉÓ×mÛq[³–´úõ¬½£òòüåL®n÷™Ú°W»ÝW߱̊Hêô  ‚ZþŶ(““ñš6U|<ÑŸj“>¾ßû¸ìÚMp·ˆï] AAhÀ{êtÒž¬CJvCi^9eêˆÙÙ™„Ý‹vÞK—Â{ÊT‚{õ!¡GwÌ %žó ûc?±°éÙ¥9Ÿ)–¹îŒ¾>6×wXäž9…ým”Ûšµ(²²Ð?ÿ¼ÃíFooÒþ×—í;Ð\ºDVéÒ$½Üù ðý ªØ82¯†æâE|Æÿ€Ñׇø^=î« õ—Y¥Âäî†ÇÂŘ5RZ¶D‡÷ÄÉ(õz"'N°I_ؼ¦Lý>‹ûŠ•\8ü'&?„ö¯C\øs?!]»£ÈÈ,Ð0¸âþ =|Í•«Öåœ@›ëæ-˜<-÷9C@iõê:ü¼ÉË ç“ã5ë'Lž˜ÕjÒk×"+{žÎØÒ¥ÁÝ{;äc2+V@sé2>'átòoRòÌ'+J†ÉØÃì7ÿ‘£¹>m é5kà²g/¾ß|KB7QÅÅâ5céµj¢=tçÇQEGcôó…‚ÌŠðX´eZ©ÙC§Õ¬Y§C÷û¾[>¨ „B!„BˆÂ“ž¸ïåôþ0z{ß"‘Šë3§0x(~ŸaY§PöT}¢ÇŒ²Ú2­n]n̘†Ïø øÉ ¦½½‰пPà ÞÌéÂü‡´[ï|üþÇs{"èÛ½„Y¥²½Ÿ‰“:̺=³R%nLNJÓ&6û1k4Düô#þ£Çà=uÞ“Œ¹é'N°™ÌúÝ'Oâ|ò$f• c€?ÉÏ·!áí·È,‡s')•Ü˜>ŸïÆã¾l9.»v[Σ1Ç‘øÆëw´û¸÷ßÅàï‡÷´éøþÄzü‰¯¿FÜÀì†ðšõS¾û3¹ºÜ“@̈a˜ÜÜð˜7·5k-çÅÏ—è1£-ÁÛ<2Ë—ãúìYøCÀG–!Íj5)϶"zä‡Aªœ2uxœîîEàé_l‹*:ïé3 îñŽ%ß>>Ä Lb×.6iµ'N‚ш*!Áá5Øå"ð ûÛ((e˳ÏoËüÏCÛpÙ¾÷+‰ëß³“ך…ÿ¨1ø~ó-d¡›^£ÑŸŽ±4p;P ú ,ål0â1¡µ÷Kfùr\Ÿ9ÝnžÊÂæ¥0e*þ{<ç-°ÖAyù}ö¹õ}jÆùð¢GÀ÷ëoð™8 &Q_|f à¥×®Åõ™Óñ;Ž ¾¹½p3{Œë³g‘.C´Þ’[µÄ­i\·mÇ}å*ô/¶%±{7´ÇŽã¾b%î+VbÖiIèÖ•¸~ŠÂ}ÕjÊü¯±% ¯Ó‘Y±ÊÔTÒ«?žøW©Hiô4î«×Èð™B!„B!Ä]VЮ ŠB¬S8xŸwùæWÎ0žJï€*Ï¿Ê<Ëê<˪<Û5y–ÕÙ¯¼ï57-»Å'$Ž¿ÕÁgee‘”˜ˆZ£A§Ó¡*À°}¾>Þ·M#, ßæÖ”‰‰¨cb1øùbòô¼}ú´4T7n`òô,Òvw“*!UlFïÛ6øƒe¸;udFO»¹Öî5EVêˆë˜5 ÁAEê•/³õõ(²21„†: Üݯ™™¨¯]µÚ2—Ûm΋:* ¥>Ù2ÙMó»ÝÓ| ¨oÜ“ChˆÝ|‹÷ZaÅI™¤GÑÛë®×9õ‘Yç‚!(ð®æå~+SñߣŠŽF•¤/ðýWÜ”‰‰¨ââ0cÖjsק¦bvrz î¹B!„¸ÿlØ´™Úµkß6Ùl&33“Ô” F#AAAÓIBÜ¿6Þå:ßÛ˳? ²_F ë¦å¼ïs¶›ò,³— €9ϲ1ϲ9{]Î\7¿7çó²Ržå›·åMSu6ääâ?ÇäéIf!M:¦²eK:Û–¡½¼ žwww2ÝÝK:Û€¥g\VéRųs…CHáç:»˜œÈ*Äõe€*L^î·2ÿ=Fÿ˜DžÉÓÓaÀÕfnÂî=®ÖåZ5ÓX´àbIg«Ø¤¥)ýIk×y‘‘Ûëñ™æz¦N¾ZÒÙB!„B!„B!D6 à‰ûÎÑc:>B£§“64Òa£QA‡ŽeP*Í,^x •Ê\èï>ìú$»–.éÃ.vß÷gÙrOš4N¦Më$ÜÜL$§(ñp—xBñ ùòë¶nuÏw{xx&?μRÒÙB!„B!„w@xâ¾S­j)©J-ñâƒÑèt&»4»÷¸rü„–Ž/')xP¾\¦õ½BQ´}RÙDûq¶/K—y2jÄ š7KÆd‚¸x•MÚÂæ}ÐàŽÕñÃøk<÷¬%0{úŒ3]»•¢Ï»alÚpÎ.?•’¢dèð`š5Õóí×Öý¬]çAÿB©W/•—;äæE¥2£×+™ó‹[7#88‹ôt}ß cÃF6nJ¢UK½5ýaÁ¤¦*Y³ê<•*ZzOLŸéË×ß0{Ž½ÞÉ ‚?¡eÐÇ!T< ß_#88 ƒAÁ¤É~LšâÇØqŒ}Úþ§Ù¾,XèM÷®q þ8 •ÊLB¢ŠÞ}Ã<4˜ª¥S±¢ôØBMqÖëÅYÝOõzJŠ’·{†a2*X8ÿµk¥°u›;ïõ åí^alüí|‘Ï£B!„B!ÄÍîp`A!ŠOû—1¬[ïa³~õO”Jlžê_½Úƒ¸8=ÞŒ³y¾i“dš5Õ³÷wË°š÷‚Babë…çÑjÍÈêÕž¼þª¥A-!AÅî=®Ô¯—bmœ8|Ä€OÙÏ[S§v*›6»sü¸–2¥o?WÐÝàãmÀÕÕ4ÓéL¸¹åÑt:YY¹ãf:¬ÃËˈ««É¦ñà‘GÒÙ½ÇÒãP§3Ý“¼{xZ¾§b… ›@›#…Éû¡C–2ªT)Ý.mÎ|@GêhÙBOQ”.‰NgbÒ$?²24m’l#),4+ßÏ=Y'Íf¹B… œÍœ=›ðU(à¹g“0›-ó FFªÉÈT€Ù˜‹·=žƒê 4Ø §¦PX‚zy]½ª!*ZMÓ¦Év=a||Œ¸»›8zÔ¶!Y!ÀÒ›+ç^“Wýz)6½»Š«^/îúëþª×]²÷j÷}½zÆÚ­»ßîíB!„B!„xðHOÜ·<<Œ4o¦ç·õ\½¦!,4‹uë=0´kgûÔ}\œ¥áÐßÏ~ž;cvš{w¹ë\rä pv¶]6ç逫&#CAýóÝ_lœŠ°Ð{ÓȧPX2Wµêíç£+LÞc³Ëè›oøæÛ‡icb‹^FžFfN¿Â°Á|ùu_~@@€æÍôtíGùrŽƒ·~®w#z½mcô–­î|öy W¯iP*-XÆŒÁ`?‰QLŒºÀCÆÅfó¶mnÔßæø<ÆÄHU-„°wöœ3Nûa‡Ë”¹ùábª×‹¹þºŸêõœcõñ)Ø|º÷Û½]!„B!„i÷µöíY÷›kÖxÒ»W k×zàæf¢å3¶=r†íÊÌ´otKI±Œ«Ömnµ[1Ý…]j4f<ÜL|5ß4Ž“Å­ ßY˜¼ç42÷íC“FÉÓz{¹õꦲuÓ9NœÔ²g+{öº±h±7K–z1cÚþ×0¥@û1¸¨sUÏs¦ï{aøú˜ûóeêÕMA™=ñ£U±û¼ZÃàüÎ!@ãFɼÛ'æ–i„"¯g^Î7ˆåÈÝ®×ïEýu¿Ôë9g¦n¿ïíB!„B!„xpHOÜ×<•L@€õÝy¥c<r¡Cû´ZÛÁ°0ËPZ×"4Ú6ˆE\·Ì7–U°/u@©´Ì«c2amàlæ²+ªR¥29sÆ™jÕÒ­ „ŠÂä½T©Ü¹àžx"­ »/²ª¥Sõ±tzõŒåßSÎtìT†I“ý6ôFE© ɽ623$&ª¨P>·Ý–mn0 _4OÕÏÝGLŒÚf8Ôaa™DDhì®° ™©VCPå;ÃÃ3Q( =]YìçE!n§0õú½¬¿J¾^·ìïÊU'¼½m5:ÆÒÛ.0À` X>È÷v!„B!„BÜ”w¾ !ŠJ/µMä￵,^â…ÉíÛ%Ø¥kô?K®µëˆñ¦N|TÎ $$‹´tǽ&vívµY>pÀ“ ªWÏm 5gwÚpq±êìç9>o­q£dRR”ìÚíf³>%EÉsÏ—ã•WK[×¹»›¨Y#ƒºpù²“Múäd%_Œ äø í”BPaêõ⮿î·z`ýû{r¿¡4nZÁæö ßÛ…B!„Bqxâ¾×®]Ógú2ešeJgR«¦ýSþ'S§v*óæ{S¦t-žÑ£×+™>Ó—Ë—<(Ê®‘./o/#'Oj™9ËOO#jµ™:µS ·6Þ}ìë«>–Μٗ©QC†ÖBÜ…­×‹³þºŸêu…¦O½ÊãøyŽÓ¦ûàáa¤w¯ú¿o;àƒ|oB!„B!Äý¡ QE!Ö)¼Ï»|ó+gO¥ƒ÷ @•ç_ežeužeUžíš<ËêìWÞ÷š›–ÝâÇßêà³²²HJLD­Ñ ÓéP©T·=a¾>Þw¥€E~9’–¦$"Bƒ³³‰ÐÐ,wq÷iiJ"®«ñõ5âåi¼óÞD¯W¥ÁÝ݈¿¿á®æ½¸&ï&“e8Ò,ƒ‚ @:]ÑwŽÄƪIHPáéiÄÏÏà0M—n¥ø}Ÿ+gOýXò“ž¡ Txjµã>•iiJ®ß°”¿§Gnùgf*0#9YId¤ÁÁ·Ÿ‡1*Z>I…¯Ÿ¡X®1!„(¨ÂÞ“Š³þºŸêõÌL×"4(šÿ¾‹z…B!þK6nÚDíÚµo›Îl6“™™IjJ £‘   ‡é¤N!î_7m¾«u¾·—g 0d¿Œ@ÖMËyßçl7åY6f/° ¤g̳ݜç_Sö ïÍù¼¬‡”gùæmyÓd é'þst:åËgß¾ËeÞùŽòáînÂݽxò^Ü “w¥›¡Æî6__¾¾†B}&$äöùÑéL6=8r89åW/ƒ›› 7·‚—i€¿ÿÂå]!ŠCaïIÅYÝOõº““™²e þ·Àƒ|oB!„B!DÉQÞù.„B!„B!„B!„w‹ð„B!„B!„B!„¸ÈšBˆ‡Òô©WÉÊ’‰ˆ„â¿Bêu!„B!„Bü—HOñPÒéLèt% !„w‹ÔëB!„B!„ø/‘!4…B!„B!„B!„¸H-…‚–é•+W0™rƒÀž^žxyz–töE ¸~ý™™™„……¢R© õÙK—.ãâê‚¿Ÿ_I†%.*:š´Ô4ë²VëL```IgK!„B!„â¡"ChŠûÒÅK—xýn<^£6O7iFƒ§›P½f~žû‹ÃôÉÉ)4kÑŠÎ]»K~&O™F³­Ø¼ekIŸš‡FAË´åsÏÓ¬E+ëë§Ù?K~222Jú”Ü— fsÁ{Ñfff*}a¼Ó«7ÍZ´"::¦PŸ34kÑŠ#Gç©âññàa6õêûý?,é,‰ûPqÞM&F£±¤Q!„B!„(QÒO«¶í:Ø<ųJ•*2é‡ñvëßïÿÿüó/]ßèLíÚµP©Tèõz©\Ùá~45Í›5% À?ßïúòëoغu{¾ÛÃÃÃøqæt‡Û*W®DófM  *éSú@‰ˆ¸N·7ߺeš¡C>¦q£§íÖ¤LÌû³ÉĹóçùxÈ°»šÿý0uúLŽ;NbRNNN”/_Ž._çåíKä|6iÞ‚Í~£T©ð{þý9233™=g. .&""µZMÙ2eèÖ­ Ú½„B¡°IŸ’’Âä)ÓX½v-7nDâääD•*ò^ß>4zúw-_õêÖ%44­Ö¹ÄÎÅéè±ã|4h0žþÆv˜Æh4Ò¡ã«(• /œ_èިÇ FŸ¤ s×î%}Ø¢ ó·NQîÑÅ}_Ü°qS¦MçìÙsF‚yñÅx»Ç›¸¹¹•ôéB!„B!î) à‰|?R¥ÂQ«‹~™œ?¥RIËÏ8Üj·.66Ž¿ÿþ‡¦M›0|Ø}N§cÚ”I·LÅù x¦y3ÜÝÝí¶øç(z¹Cû Ø<è²²²8áa¡¡<ùd‡i¼½¼®/H™T¼*uá©oeÛ¶íôìó.¡!!¼ýÖ›‡„Í¢ÅK2l‰‰I¼ÕãÞ6l;~£ÑXl=Ø jÈÐá¬Z³–† ðf·®¤¥§±rÕj† Î¥‹—øákÚ¬¬,ºtïÁѣǨQã ^ëÔ }²ž+WñvÏÞ|ÿí×´~îÙ»’¯üBüWT«ú)©©,Z²”ôG§ÓÚ¥Ù½g/ÇOœ ãËŠ¼(_®œõýÍyq+Ìß:…½G÷}qñ’¥ >’òåÊÑ¿ß{899±{÷&O™Æ¾}ûY8ÿ”J|5î‹Û¦;zôQÑÑܸq¥Ba7deÝ'ŸÄÃ#·Aj×î=6C8¹¸¸Ðà©ú·üž°iœÌÏÕk×øçŸmÖU«Z•  Çóíع OjÔx³ÙÌÖmÛ9{ö,ÎZ-•*V´æëÌ™³DFFòä“uX¹j5F£‰v/µE¡P°fí:Ò32x¾uk<<Ü9wþ<çÏ_ ~½º·|ò|ûŽxzzP³F 뺘˜XöìÝKdTÞ^^<þxµ|{04ï9Ìf3þɉ“'É2(Sº4žþZ­Öáþ«W¼@×@QË´0 š÷Ùsæ0ï×9„†„X×wèОgZ>ÇÔiÓéüú«hµZ8H’^OÓ&6.FEEqôØqÊ—/G¹²em¶=vœsçΑ––Fpp0 žª³³m2½^ÏûðÛú ìý}§Ïœ±n¯S§¶ÃyÿΞ=ÇþHJÒàO£§ŸÆÏÏ×&ÍquuÅ?ÀŸµk×Î3͛˚uëðóõ¥Mëç¬øÿý«Ö¬¥y³¦6Ö7^æ-ŸcÎ/¿Ð¿ß{Ö:ã×ù 8zômZ?Ç÷ß~mÝO÷®]x±ÝË|úù4kÚÄzþ>LB|M›6±ÉgbR¤B…ò”-Sƺþø‰ܸi“öéÿ5´;‡y9r”'O¢Õê¨_¿.A2·—x@(•J^|áy¦ÏœÅÖmÛhÓú9»4kÖ¬ }»mÖ§¥¥³k÷n.^º„F­¦råÊÔ¯W÷Ž"…ùͶ¾Éˮݻ‰ŒŒÂÝÝzuëR¡Bù’.ŽûZAÿւߣ s_~ÄfÿÎ_ wß÷Ðï}úöée]?ëÇÙ¬ûm½MÚ=;·çh2t8K–-G«ÕâçëˈQ£3jÄ]¹¾„¸Úµ{‘é3g±zÍZ»^ZZ:›¶l¥LéÒÔª™['>|„¾ïõ#6.ŽJ•*’ž–Î…‹yôÑG˜5}*wÄ.Ìo¶(õÍâ%Kùä3Kp©l™Ò\¿Ibâçt~ý5F*=ï¡ÂÜwíÙÃÔi3ûù§G0ølì8¶mÛβ%‹Ð''Ó©Ó+T(_Îî¥'k×fÛ¶íDEE—ô)B!„B!î)‡FÜVNÏ`0ë÷Løþ[Žþ“åK– Á±ÃÚ¼«RÅæ3Û·l¶n ¿»s‚½Ò±ƒußc?ÿô¶é©\™ˆˆë|ùõ·\½vS'óÇÞÝlÝ´áÃr‡öS©U$$&‚ÙÌþß÷дIc-^‚F£á½»iÕ²ÿü‹ØØ8*V¬À¹óòýÞ3gÏP¹R%>reË”á÷Ý;Ù´aöí¡YÓ&ü4ûg>Rä¼ <”#GòÃøïؽcÖ­aͪå Fú¼û>™™™wtÞ‹³L “÷J•*’ššÊìŸç`2™löS­jUÊ•-kí¹òú믢Ñh˜¿`¡Ýw¦§§³fíZªU­Jõê[×O>“ÃGŽ²lÉ"vnߦ ëØ·w¥K—bàGÛ|gåÊ•8vøOk#èÚÕ+l~5kÑ´Icš5mÂÞß÷qñÒ¥{’ïÂÖ7³çÌÅd2ñÅgŸX P©T|r„~>t¸Ï1£G:œ¿ín+lÞÃÃÃÙ°~- -fÓ¦ÍÌýu?ÏýgggÚ¾ð<}8oïÜk÷Ín]Y¹j5 .fà‡¬ë-YŠ···ÝPw<ò;vî¢gï¾¼Úéê>YWWWk#uQ]½z•¨èhš6mBÜMeíã・»;GÚq}¼½­¿ N‡››...Ö嬬¬[~甩ә1ëGZµlA÷n]­ëÓÓÓlzØ9r”ÉS§Ù|þãÞ“ù¬N:—§§]ÏΛ{0 q¿kÓú9>;ŽÕ«×òú«– HBB»÷ì¥~½º6AóÃGŽ8œK´NíZlÚ¼…ãÇO8ì%[ Sß:|///\]]íêíG©Ìî={IKKC§ÓÝóÿ`(Ìß:½Gö¾Øé•—Ù½gK—.gÐG–ý›Íf–,[†‡‡;mZ·¾å1ìÙ³—÷û@éR¥øjìç%}J…B!„Bˆ{Nx¢PΞ;GDÄu›§øo',4”…óu¸Í×קŽáX|§AS!î5wš7kÊoë7põÚ5ÂBCY·~ƒví^²Ig©üýüìöããã“&þö_z—¦¾‰###ƒú žÎw±qq„…†Þ³ü?( ó·NaîÑ…¹/6oÖ??V®Z͇ôG¥RñÇþ\¾|…n]Þ@§Óæ›ÿ%K—1|äh«ò(3§O“zZ!„B!ÄCIx¢ÀT*ݺ¾Q¨à€R¥$((°¤³oõãÌiÅ: “¿¿ÿ]Ý_Å سg/©©©lÞ²•¦MóX•*Œùä3ŒF#gÏã‘Ê•¬é.ZÌø ©U³&ãÆ~FÙ2e8|ø/wzí–ßu»¼ç4öíÓ‹&9L“÷éû=̈́�ëçº0Šš÷^^^<ߦ5mZ?ÇÀ>fÕšµlݶV-[XÓtëÚ…¾ïõcã¦Í´iý‹—,E¥RñÚ«öÄ999ñù§côчìÙ³—ß÷ýÁö;:|$kÖ®cÎìí†Æ,ˆœ†ÓÆžæÝ>½o™æN$''ÓçÝ÷ùcÿ†|ü=Þìn—ÆßßFõˆëºzuë²fÕ ¾þæ;¦ÏœU ï3™MJw+ …“É>y»†BÜÚ·{‰u¿­gÍšuôîõk×®ÃÍÍ–Ï4·I—ó0€£ùISR,Cª5wÿÏÁ»ñ›Õh4x¸»3uòÄ|Ó8 LŠÂý­SÔ{ôíî‹*•ŠÚ1uÚ vîÚMÓ&Y¼d)¯å3|¦Ùlæ«o¾e欟hÓú9Æ}ñZ­¶ YB!„B!þS$€' $'x—3L£¸w*U´ÌƒwüÄ Ž=ÊàR¡|ôÉÉìÛ÷QQÑ´j‘DÚ´y _9Ö&Øqýúç¥T©R¨Õjžx¢zIŸšbËûµˆvìÜÅãÕªR­jU›m …‚§=ͪ5k¹vÓ|wÏ4oFXXó.âÙV-Y¾b%Íš6!$$8ßïòôð õsÏÒú¹g1 1Š%Ë–³ïý‡¼»ðð0 ééÅVFIIzºvïÁÙsg™:y"Íš6q˜N­VóxµjüuègÏž+Ð0™J¥£ÑˆÉd² `d¾ÛñññæÚµÌf³MOÁ›ç-âAÐà©ú°~ãF^éØ¿¦CûvvÁŽ°°0ÀR¯Ú>L“s_ÏNSÅù›-U*œ3gÎR­ZÕ"÷JwGQt|™iÓg²bå*ë­õëÕ¥\Ù²vßa6›6b‹—,åÝ>½éßï½’>l!„B!„¢D¾{‡xèHð®dU¬` à-Z¼_ž¨^wêԮ͒eË1™LTÎÓÏ”=üXÎœB&“‰¹¿Ì³¼7½WÄ“uj£ÓiY¹j5F£ÑfÛ±ã'øaÒd"##Kä<ådõ°*lÞ£"£5ú¾üê[»´ü±€Ð›†mS*•téüäÇÙ?Ã_·û|ff&?LšÌ¶í;lÖ«T*ž~ú@îüqyå Ùš––ïypww§füóO._¾b³-99™/Æ}Åñ'Š|žF#ï¾ßObÖŒiùïr¼Ü¡='O)ÐþÝÝÝ1Däéµ°qÓæ"ç9ÇcUª––Ʊã¶Ç¿yËÖ;Þ·÷šJ¥â¥¶/ð÷ßÿ°xÉRL&íÛ½h—®Ñÿ°vÝo6ëM&¿­_««+µkÕÌ÷{ Å-{Óço¶q£§ÉÊÊbÕê5vÛ&M™j}`E¿¢ÞÃBCiØ »÷ìeã¦-dddðúk¯:üŽ‰“§°xÉR>Ð_‚wB!„B!ÒOÜÆÝÞ%%&1yÊ´|·¿Òñe›ùÛ jÓæ-¤å d¤¦Z†ËÛÐWåÑG©˜Ýƒ­0._¾Âá#G¬Ë‡¶ù,ÁšçÛ´.òy)¨œüoÙº¶/´±öphÖ´1ßO° +V)OùÔªYƒ={öòÕ7ßòv7‰‹eÚŒYÔ®U“¿â¯Ã‡‰ŠŽÆßÏϦRA¸»»Ó·w/¾ùn<=ÞîIŸ^=ñðçðá#|ýÍw( ºwíRäc½“2Í™ç·õë ÀÙÙµZM«–-Ðét…Ê{OвÅ3lÜ´™Î]»Ó©ãË‘˜È¦Í[X¹j5T®ì0xÕñåL˜8™o¿O… å©_¯®]'''öìùyó0fÔHªV} µJÍÙ³gùaÒdüü|©W÷Iûk!;˜ûå×ßÐùµWQ*DÇÄàääÄK/¶µ¦øá:wéF—î=6äc*V¬À¥K—ùaâ$Nœü›gó ûYXK—-ç÷}P£Æ\ºt™K—.Û¥iÐà)BCBh÷R[V¬\źßÖ“––F›ÖÏa4ùûŸYºl9*• ×<Áæ'ëÔfý†Œþä3Þ{·/*•’U«ÖpýºeÞ<3¹ÚC‡såÊUërNÀrÓæ-xzz`-ƒíÛ±jõ>4˜Ï?C@@Ûwîdó–­…þ-q?h×îE¦ÏœÅ”i3(Sº4µjÚâ7nDÚµ˜7!eJ—¡Å3ÍÑëõLŸ9‹Ë—¯0xÐG6|ÜÌÛË‹“'ÿf欟ðôô@­VS§v-ÂÃ-=¼ ó›-¬7»ueé²Œó ©©©Ô¯W¤¤$~7ŸUkÖòñGKºwr_ìôÊËìÞ³‡‰“&À3͛٥9wþ<“§Xæºóõõ±µ™W¥Š¸ÞÿB!„B!ĞȗZ­¾+=ïù~ÂùnoÚ¤q‘xc>ýÜao¯?úØú~à‡ŠÀûcÿ~†i·~Þ‚…Ì[°°aîEÏÕÕ•àà ®_¿Á3Ísç6jÖ´)Ÿý…Baf G÷n;vœå+V²|ÅJt:-Ý»ue@¿÷‰ŒŠbåªÕ4ø_cŽþNWèüôêùÎZ-Ó¦Ïàµ7º–@o£FO3jÄ0ÜÝÝ‹|¬wR¦a¡¡ ü ?sÏØ/¿Æ`0`2™¨S§6aÙ= “÷ñß}ÃÔé3X°`‘Í÷»¸¸Ðñå øùäÜÜÜhßîEæþ27^ÏÎÁ©“'2bÔhú0ƒÁXzº4zúLÿ=®®®vŸéо{öþÎÆM›Ù³g/:Ö®7CÚµøqæt>;ŽÞ}s{1T}ì1æÌžEO¹ŒŽ=XæT<|øH¾Ç–ÀS*•Ìœ>…q_}Íò«¬½ÝÜÜhÞ¬)ï¼ÝƒJ+Z?Ûé•Ž?q’+W±cç. ­Z¶`ìŸÒ¢Uk222¬içÍ[Àª5kí¾ÿ“Ï>·¾ÿ_ÆÖ^ýzuøAÆÿ0‰W;[‚µ¥J…3}ÊdÚwìd-!åË•£zõÇ9zôí^zÑa¥RÉŒiS=æSÆ~ù•õ÷áëëÈaCéÚ¥ó-¿cô¨|ùõ7L˜8ÉZ¯Žûâ3k¯0¿ÙÂòòòbá¼_9æ>ùì L&KOÀ`FNç×_+ò¾Eáõ¾Ø¼YSüý¹Áûïöu8ê‰'1$$$8üû  [—7$€'„B!„â¡RÐ.ŠB¬S8xŸwùæWÎ0žJï€*Ï¿Ê<Ëê<˪<Û5y–ÕÙ¯¼ï57-»Å'$Ž¿ÕÁgee‘”˜ˆZ£A§Óh_ï»R@%É`0 VKŒ÷A•˜H\\!ÁÁ6s"¥¦¦âäätÇek2™ˆˆˆ Ë` (0°HÁÀ’Rؼ'$$‹VëLppðmë€bë¶íìÛ³ó–=[À2TfLL £‘à  œo›ÿ””¢¢£quqÁ××÷–ù‰ŠŽFŸ¤Ç×Ï/OÏ<ë–c¸~ZMHHÈ-ó––FÄõëøúÞý|'$&röì9\]]©\©¢Í¼]Bü—¥¥¥qgg'BCCïjÏÓâüÍèõz¢¢¢qwwÃßß_zÍ–°ÂÞ…BñðÚ¸i3µk×¾m:³ÙLff&©))ŒF‚‚‚¦{XÛè„âAp·ë|o/Ïþ@2`È~¬›–ó¾ÏÙnʳlÌ^6æ<ËÆ<Ëæìu9sˆÜüÞœÏËzHy–oÞ–7MAÖÙèŒÈ—ïl^žžQoP*(¥RIXXXIæ=É»———uˆÎÛùçßS¬ûm=Ý»u)йÖjµ…>®®®”uÐCÏ‘üýïÞÉ»Z­–reË(­N§£|¹rÅ’/OÏ[Îù%Ä•N§£|ùâù]ço,C8ßIoqwæ¾(„B!„Bˆ¢‘BÜ»÷ìáÂ…KLž:???úôêUÒYB!„B!„Bñ€’žBÜC† ::†š5žàóÏ>ÁÃCzŠ!„B!„B!„( à !Ä]°{Ç6 ¦¤³"„B!„B!„â§,é !ÄB¡àB!„B!„Bˆ»BxB!„B!„B!„BÜG$€'þ“.]ºLtLLÒ¦§§séÒeôz}¾iâãã¹té2©©©%}hB!D‰{«B!„B!Ľ#<ñŸc4iÖ¢#FŽ.Pú¿¦Y‹V,]¾"ß4“§L£Y‹VlÞ²µ¤O!„¸çäÞ*„B!„Bqo©K:â¿­m»¤¥¦Y—•*%Þ^^T¯þ8_{•°°°’ÎbT®\‰æÍšTÒYBñ“{«ÈOε1dð š4nd³íÙ6/𿆠:xPIgóѬE+zõ|‡—Û·+é¬!„B!„xIÞ|ë† ÁŽ­›l¶ÅÄIJgï^"£¢ðöòâñÇ«ñHåÊùîÿÈ‘£œ8y­VGýúu Ì7­Á``÷ž½\¹r??_þ×°A¾i¯^»Æ?ÿük³®ZÕªÙïÿܹóœ¿pÆž&33“-[·EXh(M›4F«ÕÚ}Æh4²÷÷}\ºt ___š4nŒR©`×î=”+[–òåË•h¹ !„¸ɽUî­ù äÈ‘£8p°@ÁÑ´´tvíÞÍÅK—ШÕT®\™úõê¢TÚ>çW”ò(,³ÙÌÁƒrâäI² Ê”.M£§ÿg³ï˜˜X9Bà ø}ß>.^¼H›ÖÏÈŽ»¸pá7¢l™2ÖÏüó/2ÒÓiØ°§ÏœaçÎݤg¤S­jU7zÚ.Ûwìääßð÷?ÿÚ óZ¡Byë¾sòR¶L*T(ïð˜öý±ŸÔÔTš6iŒB¡(®bB!„Bñ$9™Õk×Ññå|ÿýôÉÉLš<•-›Öãíí Àø 9uú4CbøÈÑ„…†r-"‚ŒŒ ZµlÁÄ ßÛ×>8½^À¯óæóë¼ùÖmú½Oß>½Ðj8h0eË”aåò%vÇM·7ߢÁSõiÖ´II_B!„B!02„¦(1J…åòS«T$$&2|ä(Ê–)Ãï»w²iÃ:ìÛC³¦MøiöÏ>|Äæó›6oaɲå4mÚ„Cÿ`ǶÍlüm-?ÏùÅá÷M˜8‘“'ÿfà‡øsÿïìÛ»‹o¾Ç´é3¦¥cŽþ“c‡ÿ´ëåp3•Òr #Fæ“Ñ#Ùÿûþ±—7»wãÂÅ‹ü:Mú&NâäÉ¿yÿ½¾ü•÷Æ2z̧6çF!„( ¹·Ê½533“n]Þ`ç®Ýü{êT¾é“’èÙç]”*%›7üÆš•ËÙ¼ñ7fL›ÂéÓg4x¨Mú–Ga <”#GòÃøïؽcÖ­aͪå Fú¼û>™™™–|¨,Ïîع‹=»¶3hàœ<ù7‹—,eïîŒ6„Ĥ$›¡dU*%z½ž9¿üÊÖMØ´aØG£§ÿdž›Ø¸i³M^~ß½ƒ¯Æ}Àè‘í×ì±ÃÒó·¬éÜÜÜhßîENœ<ɱã'ìŽiùòFÞèüú=¾ „B!„Bü<-â¾söì9Ž=JéÒ¥Àl2ñåØÏùô“Qxx¸ ÑhèørŽ;f³ÕkÖ0bè`œœœ(U*œ÷ßëëð;׬ý`z¾Ûðòôÿòüóm¦W©T¸¸¸àââbÝÿí´~îYš7k €B¡ Wv#Ï¿ÿÚ6 ­_¿‘ÞíÓÛº®e‹g¨U«fIBˆ”Ü[åÞ `2™xµSGÜÝÝ™1óÇ|Ó­^½†¸¸8z¼ÙR¥Â­ë›6iL³¦MØûû>.^ºd÷¹‚–Gaœ¿p;wѦõs<÷l+ëúJ+Ò»WO®^»Æö;­ß Фq#´Z-Õ«W,=©^ýq»ùþŒF#=ºw#88­VË-=Poàét:ëõéääd½f]\\P«m0éÖ¥ J¥’ù l˜f³™%Ë–N£§ÿw—KY!„B!ÄÃ@x¢Ø¥¥¦±aã&6lÜĪÕkøú›ïèøêk Ffmˆñöö¦í Ïóxµjœ>s†?öïgÏÞß¹|å ñññ6û=uê4^žž„‡‡Û¬¯Yã »ù¤Í²jµÚ&ïIIz¢¢£yôÑGìæ—y¦y³{S(B!hro•{ë­¸¹¹ñZ§WX÷Ûz®^»æ0Íá#GËЫ7«S»Çô*+HyÖ¡CG¨T©"Ñ116¯œ¹åŽµ 6— /€‹N`îÓEç@fV–Ý÷ùŽÎu÷®]ضm;ËW®¤[—7X²d:–ÚßѾ…B!„B<¼$€'Š]Xh(K[†R)•xzzÚ4ÚäX¸h1ã'L¤VÍšŒûeË”àðá#¼Üé5»ô …“ɾq&ËÁ×9;f“É>}¦}úâ”3‡Œ£|Þë¼!„x0ɽՖÜ[íøûÓö…çY²tïõímw}ä,çÌ-—WJJ*jÍýW!44„W²‡kÍëæ›N }ûô¢I£F÷åíí],çÉ`4â¢VÝÑ>ê׫Ë#•+³`Á"ºuyƒ¤$=6mæŶ/àé ¨,„B!„B„ðD±Sª”Ÿî¾Ù¦Í[øú˱6s±D\¿î0½7×®E`6›m‚ åãciô‰ŠŽ¶ÛvõZÄ==~~¾¨T*®ß¸a·íïÿ½§yBñ`’{«-¹·:öö[o²tÙræþ2Ï:bŽ°°0®EDX‡ŸÌ‘s}„g§)ªÊ•*1|ØÛ¦+UÊ2¦Z­æ‰'ªÛùˆŠŠ&$$غœ™™Ibb"Ê—»ã}wíúC†gÿœ>}†ŒŒ ÞèüÚïW!„B!ÄÃK&d÷ SöPG...¹ëL&æþ2ÏòÞhû„ÿcUª––Ʊ›ægÙ¼e«Ý¾}|| äÈ‘£dddÜ”~Ë==NFC•GåäÉ¿¹~=·¡Q¯×³`áâ{š!„ÿmro}¸ï­åÊ–¥YÓ&ü:o>NNN6Ûý¯!k×ýf³Þd2ñÛúõ¸ººR»VÍ{’Ï'ëÔF§Ó²rÕjŒF£Í¶cÇOðäÉDFFÞñ÷ìÚ½ÛfùÀƒ˜L&ªWÜ.mÎùJMK+оÛ>ß__-^Êâ¥Ë¨S»T®|OΟB!„Bˆÿ& à‰ûF­š5øê›o9sæ,ìßÏ›o÷´6ýuø0QÑÑÖ9M:´oÀGƒsðàŸ\ºt™ŸçþÂæ-[í†fèЮ‰IIôÿ` ÿü{ŠObøÈÑÄÇ'Ø¥½|ù «V¯±¾: À¡C‡­ëÖ¬]Wäcíñf7 otíÎô™³˜9ë':t|•æM›”t1!„ø‘{«Ü[{¾ý ‰‰DDØöºlܸuj×bÞü…Ìýe7nDræÌY ÊåËWx¯o›Àoqrww§oï^\ºt™o÷äÀƒ\¸x‘å+VÒ³W.\|ÇyQ©TÌž3—å+VråÊöìý¡#F¢V«éè`˜Ï Ê£P(˜û˯¬^³–»v³rÕj¦LîpÿNNN¼úÊ+¬ûm=ÿüó/ot~ýžœ;!„B!„ÿ]2„¦¸oôèÞcÇŽ³|ÅJ–¯X‰N§¥{·® è÷>‘QQ¬\µšÿḵâÓé¨_¯.?èÏø&ñjç.”*Îô)“iß±ƒÁfÿ}z÷äì¹slظÉÚ“ aà 6˜Î]ºcÈÊMÿÇþý >Ò.ó,dÞ‚…€¥¡æù6­‹t¬mZ?Àü…‹Xºt9¡¡! þø#¼<=™=g®ÃFR!„¢°äÞ*÷Ö5ž v­šüù×!›õJ¥’Ó¦0z̧Œýò+>ùìs|}}1l(]»t¾§ùìÕóœµZ¦MŸÁkot,A·FžfÔˆa¸»»ßÑþM&_9ŽbÐÅ‹€e^½ñß}C¹²eíÒ—+[–?èϤÉSù`à k~ž¨^>½{:üŽ×_•i3f@ËÏÜÓó'„B!„⿧ -ŠB¬S8xŸwùæWN/@A^Jm€IDAT¥ƒ÷ @•ç_ežeužeUžíš<ËêìWÞ÷š›–ÝâÇßêà³²²HJLD­Ñ ÓéP©n?ѽoö¼0¢ð‰‹‹#$8­Vk]ŸššŠ““jµÚ.ýÙ³çpuu¥r¥Š(•·îXz-"‚ˆk–ù^òÎt?غm;={÷eÔˆaòä¶Bˆ»Fî­ro½•´´4""®ãììDhhh‰;M&d ¢ÓéîxŸ]º½Éïûþàì©¿ˆˆ¸NzF:¥ÂÃí®ý›eeeqãÆ ”*~¾¾8;;ç›öü… ´|¶ ï¿×—÷úö)±s(„BÜO6nÚLíÚµo›Îl6“™™IjJ £‘   ‡é¤N!î_w»Î÷öòì$†ì—Ⱥi9ïûœí¦<ËÆìe`γl̳lÎ^—3ÏÈÍïÍù¼¬‡”gùæmyÓd é'î;^žžxyzÚ­Ïoè$/OÏBÍÑBhHH‰ã?ÿüËì9siÚ¤1­Z¶°®ß½g/Uª–n÷™ÅK¼øégΞu |ù z¾K»—ìó™©°œ‹…ÞDDhP«Í”-“I·nqth—`°¸9/Ž¬ZqÎT¤c½YB¢Šo…£×«˜:å åËe:Lg6ÃÀB8~BÇO³.–•oºŸçú0g®W¯jÐjÍÔ¯—Âà#mö}7®¯ÛٳוÉSý8|X‡Á ÀÓÃHóæÉ|Ð?ÊaOš5k=˜1Ë—sçœ1fñB›$Þy'Oc‘Ë4Çî=®|÷}'ÿÖ¢P˜yä‘ ô‹¦q£ä»R–9Ö1dh®®F–/½h³íßSμß/ÿóÞ»W /½èøwôîûaœ>íLÛéÛ'Æn{Þ2U(ÀÕÕHHHõë¥òÒ‹‰¸¸Ø_³ ‰*¾ýΟõë=HHTáìlæ “òq¥KÛ^‹yëRg­ ?5j¤Ñ¡]"ÁÁŽ¯Ç =˜2Í—³g1fñ⋉¼Ý#7·»ó÷VÎý ÑÓÉ é0Ѩ CÇ2(•f/¼T¤Èða7Ð'Y¢ì»–.éÃ…P˜¿u""4t{³Ô-÷7tH¤M=½ÿ€ S§ûqü˜–Ä$NNfÊ—Ï Kçx^îpÇù—zK!„B!„È%<‘¯óç/PªT8juÑ/“óçP©àÙVI¤¦*9{Ö™ISüøåWo/ºh l”+—É3Íõ÷³}‡.:á’'p§â•WK«¦Cû*UÊàÆ 5 yÓý­RLžx•Ïäî/*RÍù N<Ó\»»}#P€nP#=CÁù N”)IÍšióâ¸ÑàÄI-_~€Á  \¹ »í{öºÒãíR¸»y·o >>F6ntgê4?®\qbüw׬i}¼ ùž—S§Ù±Ó ç;èéuýº†óœx¾MZ­‰¬,×"4,XèÍüÞ|ûõ5žo“dM?~‚?“¦øñHå † ‰ÄhT°h±ƒ‡‘¡äÕNñ6û24˜Uk¦»ù4þðÁ=¦ 3Cé0Í©ÓÎŒÈÞß]-½Ù2óï"õŸ@fÿìC‹gô¼Û'†ë7Ôü4Û—7º”æ·uçñò´Âîôúº­ÛÜéÝ7ŒGMçËq×ñõ1pòo-S§ùñû>Ö¬¼€—WnPnÆ,_¾ú:€*UÒù 4™Ý{\™>Ó—½¿»²lÉ›s…)S€Í[Üéû^<’Ψ70ü:Ï›ž½ÃøuîeêÔN½+噜¬äƒ¡\½ªqø‰¶ÔM'S©¢ýï²T)ÇÜ Ø°Ñ//#¿Îó¦WÏ»„7—iJŠ’“ëذуÉSý˜6å*WË-kƒAA×î¥ø÷_g^í”ÀãÕÒ¸zMÃO³}éôZiV¯º€¿_ntþ¼J%´l¡'#CÁ¥KNü0ÑŸ)SýødÌ ^nŸ`“ŸÅK¼:<˜òå2éß/''3»w»2yŠûö¹²pþE”Ž/yq«V5”T%‹–xñÁ€h‡3ìÞãÊñZ:¾œPäú2ï …ô€zæo¬,K½šÅ“O:®‡½óÜ+¶ms£gŸpBC²xû­X‚C ÄD«X´Ø›!ÂILTñV¢?x"õ–B!„BaKx"_çΟgûŽtíÒùŽ‚x>>Æ~~ÝfÝ”©~|7ÞŸ¹s}3ÚÒ;­ÁS)4x*ÅîógÎ83{Ž}ûÄØôØûy®×"4Lúá*­Zæ¸Z¶Ðób»²Ì™ëcÀË1ðè|{ZݬNT»¼ßNZš’> ¥Më$V®òt˜fì¸@ 3‹ä0_}%ž^}ÃY»Îƒ®oÄQ£†¥±?<<‹F9üž^,Kýz)´l‘Äúø£(‚‚rƒFÒñÊ«e˜4ÅÏÀ‹ŽQ3m†/eJg²lÉëÐY_NàÙ6åøú[^z1Á:\ãßkYµÆ“æÍôL›rÕºï7^§yËòÌùÅ›þý¢í†k6Ä6/Åañ/vîr¥Å3z6m¶ï­0tx0ºpᢵk¥òB›DV­ñÌwÇOhùyŽ¯tLàóOs¯™ÇMgÔ'Aüù§ Í›Ù^E¹¾ bò_43s¾lí=×°A în&FŽbù OÞìX®£ñüyì±t–.ºhµk—8Þéζínüõ—‹µq·°eš–¦dä¨ *UÌ`É‹ÖkæÙg“x©}öìu½k¼Q£ƒpu1ñè#é\½æd·=Io‰ºuhŸ@ËúïwÙ2/T*3C>Žäã!!ìÚíF“ÆŽ{Þ\¦6ºóÑÇ!¼Ó+Œ ëÎ[§Ë–{rò¤–Q#nðFçÜ ÷“uRéÜ¥4S§ù2r¸m+___‹°.Ÿ:íLï¾a L™R™Ô©c9F#|õuÁÁY,[rÁÚk¥[—8Þéζmn9ª£f ÇÁcqÿR*áÅ™>Ó—­ÛÜhÓÚ¾î_³Æ€öílÖ§¥)ÙµÛ•‹—œÐ¨ÍT®œAýz)w9tXGB¼Š¦Mm‰I*p¡B… Ê–±ÜçpÁÕÕ„€µk=Ïâ™æzbbÔ¬Y矯6­“ìzñÆĨٵەÈH îîFêÕM¥B…Œ‚fñ¡T˜¿uªWO³©[ò3{Že”„y¿^²yȤC‡DžiYž©Ó|éüzZ­™ƒ]HHTÑ°AŠÃ@óåËNœ:íl½>¤ÞB!„B!ìÉs¬â–N>Íœ¹¿b0î|gy4Ëd$&Ýz",“ >LxX½Þ±}ª»Bù Þy+Ö.HWõ±t´Z3Iú’¹¼?û"…†s<¼Y|¼ŠS§yª~ŠMãšR ½ß± Í·a“Çm¿güþ\‹ÐðÙ'7ŠeÞ¬Z5Óðò4’”˜[Fýå‚Á àå—læ½ñð0òÆëq$%©ø}Ÿí˜ov£wOÛ²sq1ñX•tÒÒ”$'ßûrºxɉO?dÔˆHkÃòÍ43žNfîÏ—Y8ÿî·ºkÑbo èß/Úf}Ó¦ÉìÞqÖ.xWœââÔøû솾¬P>ú=GR’’·ßŠåÃÑvsÖªe å¾r¦L·lu#:FMß>16׌¿Ÿ=;Ï2à¦óUT«×x°q³ã¿»†S>s2%%Yò•·÷áí°|¥'õë§ò|›$ÜÝM,_áYàÏ·j©§ß{1ÄĨ™¿ÀÛºþ·õhµf^é˜`“¾^ÝT*VÌ`ýúÛו+e0áûk˜L0iŠŸu½>YE§N |8 Únȹ'³ƒ¥QQòü΃ª]v`nµƒ ÒÒ”lÚâN™Ò™ÔÊÓ»÷ðaÍž)ÏûýCY»Îƒ ½éÚ½mÛ•%2òή…ñüy×ÁдÎ;Ñ»o¿ý–{-ÿƒ?“§úñÚ륙:ÝÞ}ÃX»ÎƒŽ¯–fê4?|Ê„ümö³x‰›U`äè`~[ïÎøüy¶M9Æ|„Y:ÞS±±jt:!7 ÛëéaäÇ™—Y²ø¢uð]{\­åëÈgcéÝ7Œ¤ì¿¥ÞB!„B!ìIOÜVqñr‚<õê¦Ü2Ý‚EÞ;®cø°v½´^x>‰AEÙõ8xÐ…ôtõž¼;½z cówV¬ôdüw×Ði|r‚>>öA„œÿþë|Ëï9uÚ™Ÿçxóf·8»¹²î–þÑ’¨¢^½Üó¨¿eÞ3³ó®µ®«R%¡ƒ#©^Ýö‰ù¬,ÿžrÆßÏP¨`ÊÝ`0(ðA(M›$Óá¦aó3êÇEòTý”í÷À*WNÇßÏÀ¥KN¬]çÁoë=¸qCsO੧Rˆ¸®áÜ9ÛëhÿAÀöwh`@¿hžþŸmï“ ~ÿÝ­ÖÌãç–_aËô@öw6x*…„D›6»³jµ'ÿä¹NîÔµ £Æ3tp$+æß+'ç ‰*Öñ×!))ùß ÷ìu#*JM›ç’pr2Óâ=[·¹ßöჼڽ”À®Ý¹Áí“'µTª˜n3ßeŽÇ«¥£&:æöÕÕª¦S¡BûXê=/O#?ˆâŶöóù;n9ï·:OâþV¾\&Õ«§±k·+ ¶×á–­n¤¥)mæ#MLRѳO8J•™Íγfå6o<ÇŒiW8}ZË Á!…ÍB‘©Ufvív£Ç›qìÞq#ÃGÓ»g,{vž!0ÐÀú¹=¢Õ1|d0?žÆžgX³êû?M×7âøåWo-ö*éâx¨Tª”Ajª’Ù?û`ºéOœjUÓ)W6Óú7Ù+-ó¡.Yêe·Ÿ¨h5;wºRõ±tªgß_¤ÞB!„B!ìÉ£¬¢@r‚xENS¯WY‡]JMQò÷?Z¶mwãÕNñ¼Ü!!ßÏ¥¦*ùa¢O>™ÊÿÞ:ˆrðObcÕ>¢cþ/ê×K¡ßûwÞ³çÊ'‡O+•ðܳ¶C—EE©2,˜AEñè£édd8îççgD¥2súŒ}.§Á>6öÖçø«¯pq1óÎÛEŸkæf‹—zâîn™ïÒ%'ÖýæAÚ© šÛ“08ÐòÔýéÓò÷¸Û6¾ïÏõë†vÜKqë67<=í{TθãaÓÆOð'.NÅÜŸïîЕ—.khÚ$™Q£ƒ˜·ÀÆLV–• Þy;†Ø_…¹¾ cÐÀ(Îs¦Óë¥éØ!?ÿü£eí:z¾KÃ|~O11jŽÓr#RÃÊUžüó¯3_‹°™3)?ù•é¥KNxzÙºÍá#ƒ1™,Á>€Æ’ùaü5\\L·Ý~ŒFøp`õê¦ðÚ«ñ·L«ÏºMøÁí;Ü0-ùpr2Ó½k ˆ²›Ûné2OœÍ´ji)6­Y¶Ü“uë™jW‡…fÑ°A »÷¸rþ‚“MÝ´l™F£‚×_»}*õ–B!„Bˆ‡™ðD5ˆ¯âó/mÖUá‰êit}#î–yÕéL4j”¶mn,ZìeB/5UɧŸ¡Tæ89zLÇÎ]nôÇÝë½öÃDÛaË‚‚²¨_/užaëÔIÅ××ÀÂE^¼Ô6‘*UÒË\6Ógø·Î;Xæ?œ1Ë—V-õtïæø\äpý€~ÑwÀ;pÀ…gû0ï—K¸»=ht³´4%F£‚ß÷¹R­j:[7£téL.^rbÈÐ`¦Nó£\ÙL›Fu(øõUX^^F:tHàÛïü™=Ç/O#1±jjÕL¥q>s·>¢£w_ËPx>>FF´®nåVeª×«HÏP2q²?μL½º©$$ªøþ{æ-ðæ“Ï÷Eу©S¦ùqåªÓ¦ž¿mÚœauõz“'^£LéL®\Õ0iŠÓgZ®ß¼óM&&©ØºÍfMõÖúä©ú©øøY¶Â³À<Wqñ–è`Zº%9CŠž>ã̆îÖž€ÎΖïJO/X'yWWË~RSoÑ“p+ï÷¥t©L¾{û:UÜßÚ´Nâó±¬^íi à%$¨Ø½Ç•úõRÎ3Äáá#¹½`oV§v*›6»sü¸öžð|¼ Ö{°NgÂÍÍd þèt&›{È¡Ã:¼¼Œ¸ºšìz¤>òH:»÷Xz:šcíaW˜¿uÑÑo@¨ÃýŒ}¯ìjÂóذþ< y±i“;sõáç¹>8;›iûB"}…·wîß%^‰g÷W–.õbÐG–ºÕl†%Ë<ñð0:œÃ1/©·„B!„B<ì$€' åì¹sDD\§T©ð¦T©L¶m>XzžDE©Y·Þƒ1Ÿ²i³;?ͺl7 ¦Ñsñ¦|¹L6¸ý†ßAb’’óçùež7϶)Ï7_E8 >œ=猓Æ~غ2æB{¾Me·^¡°ýü?ùrú´3ëÖœ/Ð|t#‡ßàäÉ2 Ìü…Þ8tHGãFÉfݲGÒìŸ}P© ómž\¹S»¡8{¾Ë»}b¦ß³ó,AAY˜L§fß>Æ}ÈÂÅ^¬^q??ÎÎfÆ}q>ï†Ñ¾cjÖHC£1óç_.t}#Žé3}óͻѨ`Ô˜ .òâå ·œ»oŲ øûÙ'ÝÝí×mÛîæ°áñÈ_§lzS%&©øpP}ûÄP³Fw“Ri¹L&˜2éª5°Z¦t&¾¿ÆÿW`ÁBo»^A¯¯Â–éãùi¶ÆFÒ¥s*•¥qäè :w)ÍÌéWì†Ì¨ûd*Ë—^$>^Åž=®ŒÄòžÌþñ2Z­}ž R¦J•™Œ ŸŒºA½º–áX½<Œyƒƒº°r•'£FDÚ4À´LÑ1eª?ÿtÙÚÀ|+ƒFñÞ»1øú¬uN… Ô}2•V­Ëñó\ÞícÍËš5df*hÖ4Ù:O@“ÆÉ,[îi׫äV’S”¸e7¦çÔ?9Š²e2ù_êU³\—™™–õ9¼ÛÉ ü9j¬ËvÃGñX•tfN¿zχ­wŸ‡‡‘æÍôü¶Þƒ«×4„…f±n½ƒ‚víl뙸ì^ÑŽzsæ ‡œw^Ìâ¦ËsP(l¯s…›yíbcÕdd(¨ß b¾û‹S*¼›æoÄDÿüãxXcÃMåxzéùv,=ߎµ,òfñ/Ö±fåë|ªÍ›%ãïg`å*O>üÀÒÃùý®\¾ìD·.q· ¼J½%„B!„BHO‚J¥¢[×7 ¼»™““™°°,z¾K|¼ŠY?ú²k·Ù~ßçÊ>è_°a0szeÕª™Æ‹miס ƒ‡Ó´‰ÞnŽ©g^.ð0LZ­‰  ¬[¦¹xɉo¿÷ç¹g“ز5wîƒÁÒèu-BÃâ%^<þxT¶ä3,4‹u«Ï3o¾7ÿü«ÅÍÍÈçŸ^§Iãdª=Q™'ª;0éõJ6oq§^Ýo=´^‹æzªW³ÝOÕÇÒo{ÌJ¥¥¡÷…ç“pw7ñvÏp~œíc 45iœÌš•X´Ä‹ˆ Y|øAÉÉ*¦Ïô%<Ìþ|%'+éónìweÈÇ‘ôxóÖ½ýýŒ·=ï9BC³xåå»õ7’ÆŽ 5E‰Ÿ¯ÅK¼¬ëÿ=e ˆmÚìÎßÿ8Ó¾]"…åìlÆÕÕD€¿Á®Wd@€ð°,.]¶Ÿ ¯ ×W^)Óøx?Ïñ¡ÑÓÉtïš{ž½¼Œ|9ö:7¹3m†¯Ãž‡‡‘dz÷ßèédžx"~BùyŽ½zÚ×ZÐ2õõµœJ•m{N*•P£F§Ï8¡¡|ùÜí)S³ åÑGÒ¹tÉÉ:<%X‚YY /ñ"88Ë:¯››ÉaÏ\ žJaÉR/®\ÕP){ž¥¥Ë¼8ÈñaËWx1ðƒ(n'6VMB‚Š:u,L΄»{n¢—^L´ îÆdGP°yGÏœuB£1b{-™ÍðÕ7ÌœåK›ÖIŒû"Âa V<˜Ú·KdÝo¬YãIï^1¬]ë››‰–ÏØ>¸¢RYÊ<'0œWNðW­¹û×…é.ìR£1ãándêä«ù¦)È0³£Âü­Ó¸Q2¾¿Vèïðò2ò|›$Ú´NbàG!¬ZãÉÖmn´j©,×^‡ LæÇÎ]n4m’l½ÿ¾–ÏCHRo !„B!„¹$€' $'xW¹R¥»¶ÏœÆæ‹yÞslÙb „5mªÏ÷óS§ùa2Aß›zi4fjÔH㟵\¾ìtÇs¦ÝNd¤µÚ̦ÍîlÚìn·ýôi-Ÿ~È€~ÑÖX¾nÎûÞß]1ùö۽nj M›ä? bŽ·ßºóùñBC³Ëè¢mU¨Á°!¶s}7Þ2g'l󞔤¢k÷Rœ=çÄÔÉWiv‹2-ŠÊ•2>,ò¶énÜЙ¥àó±¶Ã¹æô‚šù£/Z­©H<€ÇKçØ1F£ÂÚ`ž#5M‰î.4@¤L¯^Ó`2AHˆ}`0'ptíjn0ñÈ7»Óú¹$»``Ý'-§“ÛöÌ(L™V­’ζmn\½ª±›K/-Í<ÐÞÔ £ ej2ALŒŠ˜Ÿ~n[¦JL&øôó@6H±ð“Tè“”„åd†Ü^l§N;s⤖§ÿ—LÛì{òŽû2€•«<ø ”]â›­ûÍ2ÏaÃ_´À`a…†d¡TÂáÃ.v ê—.9‘ ² $gf*˜9Ë—74|ÿ­mŒý,×[PPî侮eúl«$&Nöãç9>Ô¬‘»½^Éî=®ìzŽ„J…Ãß@ûŽe8Þ™ÃÚnïøJ®ßP³mó9üòôÚ‰ŒT³g¯¡!Y„dÏ–Óûî­q½ï So !„B!„ à‰[ºÁ»¤$ËP™£ex¸­ÛݹrECÓ&É4¸©ñÛhTpþ¼Õª¥ßr>¹÷Þ¦k÷Rtí^ŠÞ=c©P!ƒ¸85óxqê´3/wHÀÓãÎæLùç-“§ø9Üæìlæ­EëåVºt&“¦øñN¯pÞê‹Bóæ{³ïW~•oÏ›3gœQ( \¹»ß«pÁ"/ÜÝL˜Í–€Ü_‡\ø뎰°,Þìf9N•ÊŒ»»‘ ½ÑhÌ<ÛROlœš&ú¡×+™2ñ†Í>—.óâ÷}®Ô¨‘f7ÌaŽ Rì8s~ñ¶Îv³† S¨þøÝÃΑí;܈ŽÎ­"Ïžµ µ¹aƒþÙ=ɪTI·öZëØ!… ½øäÓ@bcÔ<ùd çÎ;3áœÍôìi­Çõåãc¤Cû/ñbÀ‡¡t퇑óçøæÛ”JxçíÜýÖ®JÆ)¬YëRi¦õ³I8kÍ=ªcÆ,_t:¯vÊml-l™V¬˜Ákâ™·ÀÚÌK/&¢OV1eš/ññ*Æ~~½ØË2GŸ>1|80„×:—æ·c ËäÂg¦N÷E¯WòÙ'×Q(,Ãß®^ãA@€zuçÚ¶MdöV¬ð´ àå”if–‚3gœÙ¶Ý • &ýpÕ&hØñå~ïÍÈÑAÄƪ©þx.:ñýx|} ôîe_öI‰*&OñÃh²K¶lq'!QÅ»}bhØ07çÎ;1yŠ?^^F|o26G¥Š<‘Ý[ö¥öeñö6²rù7+Oƒ§R˜6å*z½Šú *òj§x› ½¸?´k—Àô™¾L™æG™Ò™Ôªi_76nœLÚ©Ì›ïM™ÒY´xF^¯dúL_._vbð ¨[λêíeääI-3gùâéiD­6S§v*áá–ßø“uRY¿ÁƒÑŸñÞ»1¨TfV­òäzvï¾;é7÷f·8–.óbÔ˜ RS•Ô¯—JR’’_çy³j§Ã9DEñ¨Q#–-ôlÜäN箥éÔ1à ,UlÚìÎÊUž½c¬<ÆÌÏ?]aäè &Oõã‡I–óY¹R“'ްΫ–Wq]_ŸŒ¾AÙ2™ü8ÛÇÚÓ |¹L&O¼j3ÿR “&\eÂD-öbÕjK¯K…<•ÂGFÙ uV”29"77¿d7ºøùYzq¾Ü!¡¸ŠÐNN/È&ú1xh°u}åJ̘z…¦Ù ÏÛw¸«æÍîqùYõ±tÊ—Ï`Ówëð›[¦*•™€Ë\’=ߎµ™ã,óÎùé2#FóÕ7˜²ã'5k¤ñù§×Î땨âû þ(–ÞrO<‘F—7âíæ3 ²þNBB²=ò_/ò¾EáÿîS§û²`7~”;7¨‹‹‰Ž/'0h`ó)6o–L€¿kÞÏòÞLê-!„B!„Â^A[U…X§pð>ïòͯœ–O¥ƒ÷ @•ç_ežeužeUžíš<ËêìWÞ÷š›–ÝâÇßêà³²²HJLD­Ñ ÓéPÝÞw¥€J’Á`@­.hŒ·è twCZš’ë7Ôxyññ¹³^w÷’Á àÆ 5&“‚ÐЬjŽŸœsî¢3Tôù“þ‹ôz%‘‘<>¼½K¶ÎHJR­ÆÛÛð@Õ_âÁ“–¦$"Bƒ³³‰ÐлûLKSq]¯¯Ñæ¡»E¯W¥ÁÝ݈¿¿¡Dëa©CcbÔhµ&‚ƒ³(ÀŸÆB!„xHmÜ´‰Úµkß6Ùl&33“Ô” F#AAAÓ=¬mtBñ ظió]­ó½½<ûÉ€!ûe²nZÎû>g»)ϲ1{Ù€e  cžíæ<ÿš²_8xoÎçe=¤<Ë7oË›¦ ëlH<‘¯‚ïJžNg²é%ô Pg2Dê9¿ÜÝM¸»ßýaN‹ÂÛÛXà•BÅptr2ß7׌——Ñ:ç[Ióð0âq‡Ãý Q:É®7è]Ýw¹âû}ßOõª¸¿êP!„B!„â¿Jyç»B!„B!„B!„BÜ-ÀB!„B!„B!„â>""Âî=®ÖåZ5ÓX´àbIgKÜg228;Og2Ùl¹¿!„B!„+ à‰bÕ¶]YëSü …¥1ÛÏÏÀÕÓxíÕx?Ñ¿ÿ€ #F£T™Y8ÿ^žF‡énÜÐ0a¢Ûw¸£ÆÕÕD•*éôíCÆ)·ÍßC9qBKï^1¼ôb¢Ã4ÉÉJ:v*ƒÁ `äð·ÝïŒY¾,]êE™²™Ì˜zÅašÅK¼˜õ£o¾û˜:å åËepæŒ3}ß ³nS(ÀYk"$8‹† RèÐ>­öî4p™Í0𣎟ÐñӬ˄…eÝ2ý_‡t B£FÉ é0Ñ?Îöeþo®^Õ TBµªi èMöçräè þøÃõ–ß¹jÅ…»JHTÑã­pôz•Í9w”•ÚŒ—§‘Ê•3èÐ>ª¥ç»ßøxoõ G£¶\¿ùÙºÍI“ý8ù·“ ÂóèÚ%Ž®oÄ8 æHa~wGéøhPÈ-÷×·o mŸÏý}df*˜=LJ ½‰ˆÐ V›)[&“nÝâèÐ.Á.ï×"4|ýMÛ¶»‘šj à=Ó<™Áƒ"ó­ bé2/fÌô½ešO?¹NÝ'Sø÷”3ï÷ Ë7íÍõ@a~§y?óÓÏ>œ=ë @ùòô|;–v/ÙÖ/…½Ö¿ü:€­[ÝóMžÉ3-õMÞ:C¡WW#!!YÔ¯—ÊK/&ââòß þWåü^=Ì°¡ùÕ¹ :t,ƒRifñÂKE € v}’åI‹Î]K—ôa‹B(L]¡¡Û›¥n¹¿¡C"iÜ(Ùº¼ÿ€ S§ûqü˜–Ä$NNfÊ—Ï Kçx^îpÇù߰у)Ó|9{Ö£QAP`/¾˜ÈÛ=bqs“ºK!„B!ÄÃEx¢X?ï„J϶J 5UÉÙ³ÎLšâÇ/¿z³xÑE»p€…‹¼‰‹S‘¨bíZ:¿o—&.NÅ+¯–&&VM‡ö Tª”Áj.ò¦û[¥˜<ñ*-žÑç›·¹¿ø°z` äägí:NŸqÆËÓÈÂÅ^· à™L0÷oÒÓ•œ¿àÆ™3ÎT¬˜a—îò'Î_pâõWã6H¹»ç®KÏPpþ‚åÊfR«–%‘”¤âÈQ[¶º³x©K^¼ã§àOvfì¸@öþîŠÙ ™ùGÒÒ”,[îÉ·ß ×+yä‘ü«’Ͼâ—_½iÒ8™¾½cHIU2ož7=Þ.ÅO³.Óà©Üóyýº†óœx¶U:ãã¹›OãÌÑc:23l§ÍÉËóm’ÐjMde)¸¡aÁBoæ/ðæÛ¯¯ñ|›$›Ï˜L°{Ÿ|ÈåËNøúæœÚ°Ñƒ÷ú…R±BÆDââbbí:>û<¤Dï¿]äã*ÌïÎÇÛÀ3ÍÿNNvfÇN7œoê8dh0«ÖxÒ°a ov‹#-]ÁÊUž Ì¥‹N ü0Êš6*JM‡—˯æÕNñ<úH:GŽêXºÌ‹£Ç´¬Yy¡È¥„ç/8Q§v*áᎃ͹ûŽ‰Vsþ‚M'SÉÁï²T)Ûº¨0¿S€ñü™4ÅG*[ÊÔhT°h±ƒ‡‘¡äÕN¹õXa¯õ¨HKÞŸi®·û^€ÿÜk-§Î(S:“š5ÓHIQròo6z0yªÓ¦\åñjiE:ç¢dU«šFJª’EK¼ø`@´Ã‡vïqåø -_N(r}™÷¾¬PH¨Iaꊬ,K]šÅ“Ù:ÜÌÛ+÷ªmÛÜèÙ'œÐ,Þ~+–à1Ñ*-öfÈ°`U¼Õ#¶Èy_¼Ä‹¡Ãƒ)_.“þý¢qr2³{·+“§ø±oŸ+ ç_D)³w !„B!„xˆHOäëüù ”*ŽZ}g—‰±Ÿ_·Y7eªß÷gî\ÆŒ¾a³M¯W²i³;_gß.,[îå0€÷ó\®Eh˜ôÃUZµÌ @´l¡çÅve™3×'ßÞ™3Î|ùum_HdÕjÏ[æér/ª>–N:©Ì›ïMB¢*ß{wåÆ _‹`È°`–­ðdð (»tú$K Ô€Ñùîëfµj¥ÚœG£ÞîήÝnlÝæÎsÏ&h?7:<˜ƒ]¸pщڵRy¡M"«Ö8>'þåÂ7ßúó÷?ZÌfè÷^ ã¾ ÈwßçÎ;1o¾7­Zê™ôÃUëú¶Ï'òLËò|16ukÎÛ}nØ(‚‚nÝûïN-^âÅÎ]®´xFϦÍù÷Vøø#Û¼üuHÇ+¯–aÒ?k/)IÅ»ï‡ræŒ31±j^{5žNfâã†M&ø|l¡!Y,]|ÑÀêÐ>×»”fÚ _:uŠ·ih-¬‚þîÂóøh ý5š–¦ä…ËR¿^ -[ä^[ÿ­eÕOš7Ó3mJn™¾ñz<Í[–gÎ/ÞôïZmiôŸ6×è5c¿¸ÎËíx¥cåÊfòå×ÌýÅ›^=‹Þà Ðé•Ú¾xÛtIz•õ<·l¡¿múÂüN£cÔL›áK™Ò™,[rÁPïør϶)Ç×ßúóÒ‹ö½e {­ü0ÊáCŽÔ©c[glØèÎG‡ðN¯06¬;—WÁêqÿP*áÅ™>Ó—­ÛÜhÓÚ¾Þ_“ý`Jûv 6ëÓÒ”ìÚíÊÅKNhÔf*WΠ~½”;ˆ:¬#!^EÓ¦É6ë“T8àB… ”-c¹fpÁÕÕ„€µk=Ïâ™æzbbÔ¬Y矯6­“ìzñÆĨٵەÈH îîFêÕM¥B…Œ‚fñ¡T˜º¢zõ4¾qÛt³çø0ï×K„†äÖ[:XîéS§ùÒùõ8´Z3º¨¢aƒ‡æË—8uÚÙz}ðÕ×g±lÉëCݺÄñNïp¶msãÈQ5kÈÃB!„B!ò«È×¹óç™3÷W †¢òÓ¬™¥ñ<1É>À±f­' ZµH¢õsI?¡µG—W…ò¼óV¬]®êcéhµf’ôŽ/ïÌLý?å¹g“hû­ƒ^çÎ;q䈎V-“hó\™™ Ö­óÈ7ýÒe^¸ºšhÓ:‰OýŸ½»âê8üÛÝØÆàÅ­P¼@hq(Z X ¥xK[ mùZŠkqwww î4!îÉî~l²dÙ $A‚œ÷yò$3swæîÌìÌæž¹çƲn3mäQÑ* ptÈ~ºJµké{¯EFfP9KKµjÆ0oΖ,ºƒcƽ¡´ðöN¡¿vï¸aÒ@ü¤­[Ñj¡S‡0£ù..>ý4Š+W­¹`•íºg×­ÛVü:*? 24,gV…òñ8;iˆJ·Ïuè{zµmÁ¦õ7ùÓç®Ãÿ´š,iÞ<¨÷™BÛ‡“”¤xj ´ìzÚçîIãÆ{p?Ð’ß~yhÒ˜þe—0z=t³µÕR²DññJbbö±C­ÖÒüó£ò;…ag§eËÖŒ?O/ZTj@.³«¬|NOž´%%EAË–F½a5tø"Œ¨(‡Û=s=/S£†Ñ|÷M(¡¡,Zì’£uÙ×,õº»Î̃ññJ¶íp _Þ$*”èð÷WSïÂ|Ûׇ Y¼Ä…N]ühÚ,?AAÏ÷θ=øÚLjÚ€›Vô꓇M›ÆÿïÁ¤)î´û"/S¦¹Ó«O6lt¤UÛ¼L™êN¿þ>ü;ÞÃh=Ë–;S»^!Füœ›M›7Þƒ>-ÀÈ_½ÐIçÀWêÑ# Ôj} ïôœ5Ìšq‡åËnÆrÝwÀÎp|Íùmt.zõÉCTêý(:FE›6ôïbÒã¹rE}ïÀà`yîP!„B!Ä»Exâ©®\½úR‚xi ÙU«˜¦£\¹Ê ïdÊ–ç“õ¶U«M*›4ŽbàÁ&½Ž·%!AAÕ ÒAýñ—' ‰ ~ñô ÀÊ•Î|òqeÊÄ“'O²Ùº€>(²}‡ >ŒÆÊJǧŸDbÁƒö¦e#•88hP*õ©ôŽ³åÂ4š¬ |vøˆ-*T®—¥×¥7ò§‡ ÄûÕž=f`åÊqü=ö>:†áîþìsâÂEJ•2/.-…ßÅÔ2¯JJŠ‚~ßûP·N -R{„eÅ¥K6DDª¨Zõñ>wrÔ0qü=¾ý&ÄlÊT“ýrAŸ¶³´™ýR:m¿\²~æz²êiŸ»ô®\µfÎ\¾ìFÞ¼ÆÎ%2(ˆ2eŒ{A$'+¸|Å÷£YLŒggÉçÔÒR‡Ÿ_W¯Y£}EÃ¥.µDDªð÷Wsò”šØXó·Â¬|N£Sƒ–®®¦Á¾B…ôûðòåW{®›Ó,5ºoÎEö,D™2ñìÛoGD„q0~ÇN{âã•Fc.FF©èÑÛ¥JÇö-7Y¿&€í[o0}ê]®^µaà ï¬V!Û,T:öí·§ë—aìßs WW ÃFä¦WGØ{\¹Rؼõñà gΨ6"7ï½Ͻ×X¿6€£‡®Ò©Có¸°t™sNŽwJ‘"‰ÄÅ)™=ÇÕäº]ºTò'®õ­[éÇC]¾ÂÙd=Á!ìÝkG©’ ”yO/qvÒ0àû`>kjÚ›úì9ýµ33÷W!„B!„âm"²ŠgJ âuêØ>[é4££U†´Kq±J.^²a×n{Ú¶ §e‹£²×¯[s欚ž=¡P@} oÍ:'úŒ*ƒŽCÇOØòè‘þ§Õ,ZìLµª±|÷­ébûöÛ³h± KßÆÎîéQÖ¬u¢\¹xÃøZŸ~ÅÔénܸie’šjÃG’’4m¬o|jða4ÃFèXµÚ‰Z5S‹EE«P:ùqøÈã†t7·†¢IcÓž×®[öcD„Šƒ‡ì¸rÅšß~y@Á‚¯g£VP°ööZÔj-W®Z3a¢––:þùß}CzHs½?vî²ÇÉLÊÂbEŸ;mÚ¸= S1o΃L•_¶Â ýx·o[±q“#•*Æ1lHP¶ëÖ‹ÀÓ#­¾í«ï½2 °!-YPås½Ï¬|îžôç_žØÚêøª{æS[þ3΃,2Èx¿xy¥p挚È(NŽ©V aa$%)ˆŽ1^–Uþ§ÕfÇúòðH¡Jº@~tjïßñîìÞcoÄYYéèÒ)Œïû_c²ò9ÍKÜ®^5 ¼†„è÷£0Ó ØË<×ÍquÕàâ¢áöíWßóU¼8Í?äÌ57;òEÛÇ)¦×­wB©„Ï?{Y·Î‘°0C‡„óX·N õêêSߺ­3ñeS(ôÁþ&#±±ÑQ¬h‡ØñÉÇQXYé(Q<ã'l ågÏÕŠ~ÿíáÁ• ~̦͎Ì_àJ›Ö9}8Þýûsô¨-¿ÉÅÜy®|X?šêÕc©R9Îd,Ó<>ÉÔ¨Ëþv†q|Ó¬\éŒF£à‹váÏÜæî=ölÞâHݺ1™N *„B!„B¼-$€'2åy‚xáá*FýžËh^™÷â)^Ì´qzÅ*}ï¶ÏÒgõé'Qü6*ÙSóƒ³Ûøå×\\JíÝÒ°A4ƒ™¤` S1pPnúõ 1ôþzš}ûí ± OïPüO>ÑðV­r67lÅJg<ÜS¨–Ú“ÍÞ^K­š1ìØé@T” ÇtŠè(‘Q*òæM¦w¯;¸¹¥pîœ ó¤ÿ>89iM‚~§O«9}Zm4¯aƒh<=_|ŠÓ%!^‰µµþ8„†Z°e«ƒ!½VZšÁ„ÓÞO?ô2»¾~ß…"_Þ$ HHÈZoÌ'eås—Þ™³jöWÏP£söi&OqgúL75Œ¦Kgãt©5ŒÂß_ͨßs1zÔT*:ü;ÁÃØJNz¾÷º`¡ š¦„|¿Z,U*ß1L§¥ÕŽV1iÂ}òåMâî=K&NvgÚ 7£ÏuV>§•*Åáæ–Â’¥Î|Þ4’%ô½+ïܱbÚtýº““MßgVÏõÑcr™}ø ZÕØL2ìlµ„…g?í®ÈyŸ~ŨѹX·ÎÉÀ‹ˆP±ÿ€ժƒ;]ŠCÿÓú€Xõ÷M{ÞVªǶíœ;góJx®.)†sX­Öbo¯5Ôj­Ñç䔿gg vvZBB¿{+–Àþú‡æÆX{×eåZáZÍwý|Ì®gäÏ c€úú&³eóM–,ufÛ6æ-peÎ._6î Ôã«G&å^&++-ÉÉúsÅÕEÃ5b±L à%&=b=iõÊ<ÜMƒGfÆ"ÛµÛÞlÃãé“WŒzSEF©è?Л>½C)_îÙÜ4ö^ÇË+­…Ypø°-cþÌÅ’eά[©T¢¦ûEÿž“’(:>¨¡oXwpÔ’¢@§3¿_²rL3û¹{Òì9®¨TÐ>=#4?ôbÉRgZ¶ˆ0;^^ÇáìÚíÀªÕN;fKÑ¢ \¿aµ•Ž:µ£Ù¹ËÁ¤‘9³Ç4͈aA&ca†àqš‚ùæëPÜ\S ï½P¡DªTŽ£Ñ'˜3Ï•¯û„‚YùœZ[ëóûz‡æ­òQ¾\<––:Nœ´¥S‡0¦Íp3é¡Y;׮߰ÆÊLð8_ÆrŒ‰Ubo'7™££†úõ¢Ù´Ù‘{÷-Éã“ÌÆÍŽ¤¤(hÖÌ8aXjÏO3ת´”¯aa¯îë ú‰q?ÓN ŒÆµ{ôÈ‚ÄDÕªÎp}ÂTäñ‘óùIY¹VDFª¸tÉ|Šß”'­f™­3õëEãêª!"BÅÎ]h4P¯AA³ïåÐ!;j¤^V¬Ò¯sÉRg–,u6)»j“Q/}@ ½âÅðõM2Ô+#¶¶ZŠKàÑ\»fÅ„‰tîfÔë°AýhÊ<ÑÓ°TÉ^%ÎW“˜¨ xñfÏzÜ*4µ7…§g²éëÜ5xy%gj>>É´na2ÿÉ@Òè1žÄÅ*qwKaÙrgÃüËWôûzÛv.^²¦y³H³ÛQ*õ àMGáà ¥{_fÍvåÇ‚ɪ´ô¡¡¡*ŠÃh¿ý$Š?x³v½;wÙÓ¨¡þ •JG‹L™êÎÞ}öÔ­c¸ÿ¶Ëà!þëÉŒ™n|úIc~ÄÆæÅŸŸB!„B!Ä›@x"ÓT*;uÈvðîIic}ÝJ‹iå*g øuäÔjãÆšSþj.raã&GCê§)SÝÑj1Jq ú¿råâ¹tÙ†;w¬(T(‘û–¨ÕZC*»4Z­¾AsÛvví¶§X±D\]ãY·Þ‰äd]:‡™H"#Uüò[.V®v¦FX4k×9âãÌ÷ýLÇÝ[¾Â™#Gm ¸eEþ|IètjBa¾á1&F•¥Þ1ÞÞ)œ=wïYQ¼Øãºvï–ùñË^–’%عËK—l([Ö8ðtÌó(Z$‘aCŸ=ÝÇ–$%+5Ú8­dZº¶³Ü°±ÑfÀKÏÇ'õܽ•½qÄJ¦¦W¼pÑÆÐûÎd¿”0Ý//â˜>ù¹Koÿ{Ô­óÔuDE©èÔÅë7¬˜2éõêF?µ¼……Ž–-"ŒÆÞ‹‹SröœšÕM·•ÙcšU‘Q*¢£”ä1H‹‰Ñ2Òzf÷sZ¨P"C×ýïqú4¬åÊf¾çç˲q“#5̤So–êïÇàé™Âæ­´nÎÉS¶´haìH;ßïZšæS0\Î,}zZ-F½zŸwOÐ÷$¾v͚ҥ̎s)^û–ìÙkÏ{¥ã)]Êøþ¤P@ÍZ±¬]ïÄýûÆǽu«¦Nsgõ'CÊÖjUcÆÄK£ÓÁÐá¹Y¶Ü™¯{‡Ò÷»„B!„Bˆw™ðD¦¤ïŠ)òü+CßØ—Ö\¨@"áá*ví¶§Bù8³ã8Õü †¥ËœYµÚÙ°üÀA;ŽŸ°¥Q£(£§Ì5'OÚ¢RGj/¦¯{‡šM3¸o¿=_vóeàÁtéô¸ÑŠUNØØèèûmˆÙ1d–¯tbûbb”=fGh¨~¬¼¦MLƒ?vvZŽµeÕj'ú÷ !8Ø‚šu SºtWo¢¬˜óß³óÿëÉ´n,_r‹âÅ3L\»V?VcÁ‚Ù«{… ñx¸§°j•3]»„Ò,Zâ‚¥¥Žúõ£³µî§yòs÷¤cÇõceUª÷”uÀ×ßúpùŠ5sþ»C•ÊOïɵe«#3ÿsåבÌ3g¹‘˜¨ÈTÀôEiÕ:Z°kû £Ô§AA8hw2Þ©c‡eõsªÑ(ø¶¯®®)ü:ò¡a~x¸ŠÅK\(V4Ñ0.^N¹xцÇ»ã訡u«Ãü°0J%†uYè{>9jÐé ô‘jó½EÎQ©àó¦‘L›áƲåÎhµÐ¼Y„I¹ZÄ°p‘ 6:¥ÖjaÓf} ÛŠ2þ+OïMçà A£À@K£àøÖmÏýk׊áâEÖ®s¤ÙçÆ׊‰“Ý)R8Ñlú\ñâYðÓÏ^T­ÇÜÙ·MÒ9¢¿¤=à’&O25ªÇ²ÿ€=[·9’˜¨à‹ zßM˜äβåÎôïB¯ž¯.Ý·B!„Bñº’žx¦ç ÞEEéSö¤h 4Ä‚»¸{×’ºub¨^=–¹ó]INVФq”Ùu¸¸h¨ùA,»vÛsë¶ùò&ñÍ×!têâG§.~ôêñˆB… ³`Ñbg®\µ¦e‹œ³>fÊ¥Ë6\¼hÃ'G™ Þ|Ö$’ÑäbÓfGvï± IcóˆÚµbpvÖ°f­ý¾ !W®Z4`é2gº~åG»6áØÙi9yJÍŒ™nØÛkMz\½jmØ ‰ îß·dë6¢¢T œíÆõÝ{ì y|)¸~]ŸpËGгr¥:>þ(*Ãõ|Ö4’]»íYµÚ‰ïû†PµJ³¦ßåïqü4ÒËPÎÅECÿ~!ÙN7¸r¥¾wUÓÆ÷ jÜ8Š?Çæbé2g.\´¡dÉ„ {’YXèøä£(.váð;ª¿Ë/??ÄÍ-…… ]è} O꾆jÕb>$ˆ|yM×u欚3gÕ†²ÎÎ)T(Oû/©U3s=öÌ™1ËcÇlMæÿó¯‡áïÞ½B)U2€+† ËmRöì95gÏ© ÓÍ›EÒý2ò!vvZ–.wfá"@ÿDþ¤ ÷¨QÝ|¿3ÝȈ­ö•ð&Mv7ümc£Ã×7‰ž_=¢[·G8;=›Û/OΟ;ûŽal»ÏšF’”¤àïq|ÕSŸ–ÖÁAËw߆˜í-šU™ùÜ=éQ˜ µZûÔñ†NŸÑg5þþj³e¦LºgàåÏ—Ää‰÷ù«ßõóÀÚZGëVá ôbß·ludËVóËê׋6ðÒ>Óã'¸3hÈããR´H"ӧܥî ÏYýœþ<â!)) .raÞ|W LdÖŒ»Ž9÷2Ïõól8Á•J‡§§~üÆÝQ°`b¶×)^/ $Q¦L1m9îio>99™¨ÈH,,-Q«Õ¨žÌd†›«Ë 9@9i÷ž½x{çÎdð.û t/B|¼’-pvÒàêšõ^w9E«… bã”xåJyj/ˆ7]B‚‚À–ØXëðöÎþxKo­îß·D£Uàãl¶ñóm ÓéÓRÆÄ*ñ΂Z³çzD„ŠG,puMÁÅåé׌¬~NÓ®G¶j^^r®‹×G|¼’À@K¬­µøø$› ä?׺Xàæ¦1z¸áE‰ŽVl‰ƒƒ”Zw‘u*BC-°±Ñ’;w2™øj,„BˆwÔÖmÛ¨X±â3Ëét:’’’ˆ‹%E£ÁËËËl¹wµN!Þ[·m¡×|g§¾@ ’ú£’Ÿ˜NÿwÚrmºiMêt úDAštËué~kS0ó·.ƒÃ[J7ýä²ôe23ψôÀú Fu,,ÞŒSD­ÖR ÿë7ܳ(•úT}ïÝyŒ^6¥C*º·™B¡?×såtER9;k c¾=KV?§oêõH¼ýÔjíKë©Vk_꘦Z¤÷èë"+×P!„B!„BdòùW!ÞVoJðN!„B!„B!„âm"÷úâãã ÁÁÁWWל~{â•””ăæåÊå‰Í+¯Ë;w±¶¶z­¯ó ãêꂃƒCNW'GÉ5L!„âÝ")4E–%&&f©¬V«Íé* ÑhHJJÊéj¼Y}ŸY9¦o²„„tº7¯·¨V«%!!!§«aÿúÔ%+t:ÝKÝYýܽNÇT¼;¾êÙ‹z ša™ ¥^ƒF†ŸoûöÏéj‹wسçP¯A#®_¿ñBÖwàà!ê5hÄ_ÿû'§ßÚ[á]ùù¢]¼xÉè:[¯A#NžòÏ‘º|Øècú ˜Ó»ä©Nžò§^ƒF¬Xµ:§«’ãä&„Bñn‘x"Sîò÷?ÿ²gÏ^"£¢°µµ¥ZÕ*|ßï;Š)bT6&&†ñ'³aã&‚ƒƒQ*•+V”.:òùgM3ÜÆô™³X±bùòçcú”IfË4mÖÂÐ+@¡P`ii‰»»eË”¡]ÛÖxzzš¼fç®ÝLœ4… /¢Õjñõõ¥SÇötêÐ…Ba(·eë6þþçߧ‹àââ’áòï äüù ôêù•Ñ{½ví:}¾ùî©ënÑ¢_uëšícʸ'°s×.BCaooOéR%ù¦Oo*W®dR>66–±cݺõDFEáäèÈ'Ÿ|Ä? ÀÎÎÎP.0ð¿ìöÔmü#µkÕ`ÄÏ#9räØS˯]½µúŨQÁ?$o^?£²ü5–;wg¸-_ß<Ìš1Í첓§N1dèjÕªÉA/¦äøñü3~'OžB£ÑàáîN‹Íø¦Oo¬¬¬ŒÊþÇŸ0»{{;V­Xf˜ž¿`!ó,z궧O›L¾¼y Ó÷ùkìßìÚ½‡¸¸8Ôj5֯ǠÌ~î2kÅÊÕLŸ1ó©e~ýå'ªT®lZÇL\3@ßÐ1iÊTüýO“’’‚“£#õë×ãû¾ß=mžþsªP(°³³ÅÛÛ›jU«ðùgM±µµ5Y÷ÇAü;a"»÷ì!4ôvvv”(Qœ>={P£Fu“ò×®]çϱÿãà¡Ã$%%áìäD“&ŸÒ¿__£Ï]vêÒ¸éç$&š"¾ÿ~5~1,ÛÇI¼^žçZUµJ|||°±±ÎðõÆ":*€öºäôÛYþ{’µ5îî”+W–Íš‘;·—¡\ll,»v`î3M®)gÏ燃xÿýjü4|(ðêïï/‹§‡õëÕ¥d‰â9]•7’V«eåê5Ì_°€€âã°³³£\Ù2ôîÙÃìwΗmðÐᤤ¤ð×£sl¿dõº\¤HaV,] Àº ˜7aŽÕ=;ïóÉï‰K—-gÖsŒþ/x­Y»ŽÆgïî/lÙùÞ–]oÚ5,³÷%!„BažðÞr7oàçç‹…Eöõ½û÷iÙª-!¡¡4ø°>ï½Wš;wî²fí:Ž?ÁÂys(‘ú„F£¡S—®\¸x‰îݾ¤RÅŠÄÅűdé2~øq0¡¡èÞíK“mhµZæÍ_@BB"7¸ví:… 2û~T*5j@\\ׯß`âä)Ì_°eKp¶lÝÆ7ßõ£p¡B <[[56nâ·Q£‰ŠŒâÛoúÊFEEq3 €²eËP ~³ûâiûqÞü…¬[¿ÐÒKHLàf@ùòæ¥|ùrf_ïãíícKûŽ¹uë6Í>ÿŒR¥JòàÁC–.[NûN]˜>u²Ñ?ÒIIItú²çÏ_ Cû/(V´gÏžcÑ’¥Ü¹{9³fÊ&''s3 €<>>6ʸ8;þ~ðà!7ø¨QCÔjµÙò*Õ‹ëü;løOœ9{Nÿ¾ž^¤¤¤Ð©KW._¾BÛ6­y¯t)îݿϳçÒ¦]{Ö­]…‡»»¡|pP07ø°~=³éy<=½puueëÖmL™:»wï1îï±Få¯^»FHh(íÚ´6Y—õ õ àÃúõÌnw÷ž½ܺ…mºcL‹–m §m›Ö/V”Ógβbå*Îœ=Ëú5«²Ý0ÁÍ€*U¬€¯¯¯Ù2ŽŽN&ó2{Íعk7½ú|CñâÅøcÌ︹ºráâE¦LΡÇY¿fΩçï“ŸÓØØX.\¼Ä–­Û˜4eS'Oä½Ò¥ ë £uÛ/}ôˆÍ›Q¤Ha>|È’¥ËéÒí+&Mø—Ö7”¿sç.mÚµG¡TÒ»W¼sçæ”ÿiæ/XÄÕ«×™?÷?ÃCY­KJJ —._¡h‘"fÍÌíñæÊε*ÍÐ!ƒž¹þô÷Ñôºˆ×ßÍ›(•J6øÄÄDnß¾Ãø “˜þÎöªïï/K™2ï1uòÄœ®Æëϱÿcæ¬Ù”/WŽúãèèÈ›7Y¸p1»vgþÜÿ¨P¾ü+­Óé3g(Q¬XŽî—¬^—mmm)[¶ 'NžÊѺgç}šË:žú.&&&§«ùT§Ïœ%E£y¡ëÌê÷¶çñ¦]Ã2{_B!„æIï-wãæMvïÙK§Ží³ÄóÇ_„„†2dÐ@¾ìÒÙ0¿EóÏù¢CgFŒüÅðéþ9sö_uëJÿ~} eëÕ­CÝ2yê4ºuíbÒ xðÐ!> âÏ1¿3xèpV®^Í ?˜­«« £Gýj4oò”iü=î_æÍ[ÀÈŸGúþQ£ÇàãíÍŠe‹ †Í›ñEÇÎL>ƒ6mZ™üCÝì³Ïh׶5YqíÚuþøk,M›4fíºõ–«T©¢IÝ_„eËWpãÆM†D—N ó?jØ€¦ÍZ0gî<£Fýù rúôþû'M @ófŸckgË®Ý{ |€·wn£m”)óŽù=Óu:x^^/w,eËW°wß~|XŸmÛMŸ¢]¹j5.\ä§áCéÐþ ÃüÊ•*Ò¾c¦LƈaCM^7 ?“ž|O:qòcÿ÷7/]F§ÓñÝ7_3æÏ¿^Ø{=æO K/0Ô¥mëVôìó 6n¢S‡ö”+WÖP>** ïܹùaÀ÷Ï\wõ÷«Qýýj&ó¯]»Îì¹óèÓ»§Q¯º©ÓgÊèß3ü“ݺUK äÏÏeÞüôìñÕs½ß6­[Ñ´IãL—Ïì5cÒä)XZZ2oÎ89:P£úû8Ø;0â瑬Z½Æ躦ŸÓ-[·ñÃøªg/¶l\oøÍ™7ŸûL?ŽF Ê7lð!Ÿ5kÉÜy ŒxãÆO :&†µ«WR<5ÐÛìóÏðpwg¤ÉlÛ¾ƒ† >ÌV]"#£¨R¥R¦ÎñvÈ̵ àÜùó<|d4¯æ5°¶¶~æk3ëúõ=vŒ¨¨h<==¨U³&îîn9½‹ÞInn®F÷ë+W¯Ò«Ï7 6‚|~~TªT€¦M³eë6æ/XDãO>1&MžÊÕk×=êW“ïðrïï‘QQìÝ»ÈÈHòæÍËûÕªfXvÏÞ}89:R®\Yt:;wíæúõëXÛØP¤pa£û\\\6z}Š7úhµZvíÞƒµµÙ^ÔgÎœ%8$„J•*âìôø“„„öí?@À­[XZXPªdI*Uªh6ž•º¿N’““Y°p1òçgÑ‚¹Fÿ[Ôªù­Û¶gÒä©ü7s:¡¡ð?}šüùòQ¨PA³ë;|ä(qqqÔ­SÛh?EDFrüø ‚‚‚R3J”¢`AÓkÝ™3gyðð!7nÜÄÅÅ…í;v–¹¹¹R¾œéCs:ŽãÇOpþÂ’SRÈ—7/µj~`4ö\ZÝkT¯Î¡Ã‡¹uëŸ~ò1¹råbÏÞ}P»v-òçËg²þÌ^—³#4ô$(8ggÞ{¯4ÅŠfüàXf÷#€…aŸžÂÏÏ—F ší±›’’Âþ¹{÷îîn|Ág1Mbb"{÷íçîÝ»XZZQ¨PA³×Ž;wîråêUŽ=Jbb¢Ñù¢T*©W·ŽÙõgåþ–ÙïmgΞãQh(uS·{öÜyŽ;ŽN§ÃÝÝÍ(›Ë›~ Ëì}éè±cDGÇP»VM“¶‹Û·ïpõÚ5Š.l’E%4ôûöï'(({ªV©òÜç®B!ÄëBxï€+W¯2wÞ‚lñ"£¢Ø¾c'žtêØÁhYùråè߯/öövh4T*aaa&_˜---ñóõãØñã$%%™4®X¹;;;>ýäc6lÜĺuø¡ÿ÷¨TªLÕ³^½:ü=î_"£¢ óüOŸæÁƒ‡|÷í×F½ƒ ÛÁ±cÇÙ¹s7mÛ´z®ý›””DßïðñGhüé'O à½,ÞÞÞthÿÍ?ÿÜh~É’%P«Õ‡Í_²t9… 2ïÒüøÃ~üaÀ+¯vܺ}›_Gæ§áÃ0[fÓæ-ØØØкUK£ùU«T¡páBlÞ¼Õl/3´ ÞÞÞ|Ô¨Ÿ|ü*•ò…ðÂÃùrõ*5?¨aÔ¤T*éõUwvíÚÍ–mÛxÑQÑäËŸ/ÛÛÔjµü8x¾yòÐó«îFË9ŠZmCóÏ?3šß¹S&NžÂ–­ÛŸ;€—U™½f„……ãáînÞ¥)”Ú€þÌm5jØ€{÷î3æÏ¿X´x)½{õH]GA¾êÖÕ(HPªdIlllˆŠ~|=JNNfûŽT®TɼKÓ¡};&NžÂæ-[Mx™­KÚ¶œœ_éqo†™³f³qÓf£yöî~!AFÃÏ¿üÊâ%Ëpvr"wn/nݾN¿Žüé©©³Å«Q´Hþýç|Þ¼'OaîìY†e¿Žü™ã'N2xØpÖ­^ÉÍ€¦L›N­šвEóWZÏ .ÒéËnDDD;·QQÑäË—— d.ø{Ü¿DDD°móF¾êÙ›C‡–}P£†Qòƒ‡éÕç£×·lÑÜä¡*¥RÉô³8åïÏÎm[L‰“““éÖ£:­–ƒû÷æŸ=wž^}¾!44”|yóŸO`à*U¬ÀÔ)“LîAY©ûë$66–„„³Ù=*”/Ï‚y³ A-k Dþ|ùX³j¹Éº‚CBèüe7ª¿_Í(p²fí:Füü ¹s{MpHMÊc~7Úî”iÓÙ±sÇŽçرã†eïW«Ê¼9ÿm3,,Œž½¿á”¿?¹s{aggG@À-<<Ü™>e²!£Èõ×éÕçºu튫ˆŽ‰a݆´jÙ‚þù—è˜&NšÂŽm›ŸšZÿEZ±r5#~‰R©Ä;wnBBC‰‰‰¡KçNfS·ge?¦¯‘¿ŽbÑâ%äöòâÁÇüöËÏÏu-ظy3ã'Lâï±2ò—ßptr":*ŠˆÈH¦Ln2Æ0þš R©¸rñœÑº_Äý-£ïm6nböœ¹ìÙ¹%ËV0mú ÃXÝVVVFëÛ®aÝ—¢¢¢éÕçztïfô@ZZÚç””dÖ¯Ye´®eËWðËoúà`þ|yyð0ˆÈÈQ´ÿ¢#† ‘LB!„xã½þynÄ ‘ÄKIIÉÒë.^¼„F£¡bÅ fƒiݺv¡MëV†e•+UÄ‚ý•‹ŠŠæÊ•+”-[Æ$x—$lða}¬¬¬øô“  áÀÁC™®gÚ? U«<'ëÂ…K”.eš®¤tj “‹—.>÷¾ý㯱$$&äèøR |ÈOÇâèhœ²çÆ›ÄÇÇ¥Ï %àÖ-j¼ÿ> úsíºõìÚ½çµOy“&%%…~ßÿ@Ý:µiÑüó Ë]¸p‘"… ™Œð^éÒ„„†š­:T®\‰¿ÇþI§Ží_x/“´ãàêêj²,-8~ùòe£ùiãj4nÝâÈÑ£ÜÌ °iÎâ¥Ë8{î<Æ2iÔ‰‰‰ÁÙÙ¥Òø–aii‰ŸŸ/W¯]C«Õ¾Ð}ð4Y¹f¼ÿ~5<àÆ›Fó×7ò¥¿fÛ·nzj=Ú´Ö?ô³bÕ*“eÛwì$<<œæÍ›¾ÏÆÄÄУgot:kW¯`ëæ ìÛ½“ ÿþÉ“§øy¤iæ…¬Ôýuâì쌧‡Gçè1Óñ«V©b[ÖÞÞžæÍ>ãü… œ=wÞ¤ìªU«Ñh4Fbcc2lµj~À‰£‡Øºi‡ìeÜßcY»~«×¬5ZÇ¿ÿüÝ;¶ðÉÇŽñYÿ̘6Åd› áô™3Œ÷7û÷ìbËÆõ¬_» MŠ†Þ_kH ©Ré¿íÙ»ûv3pÀ÷\¸p‘eËWppÿ†LdT‡}%û="2’a#~"¾|Ú¿—m[6rìðêխóçàïÚ¨|V÷#èÿ¸sçÇbÏ®íìغ GGGÆüñÉÉÉÙ®»J©ÿqÌ1yÒxvïØʉc‡ùîÛ¯¹Àø‰“é„ \¸p‘ýûqâè!ÜÇØ?Ç0uÚt³ë”{w³o÷N–-1ñm¼†™»/}X¿]:wbƬÿ8rôñç맑¿òàÁÆÿó·q/Æ3g6âgÞ{¯4öîbýÚÕ=´ŸNÚ3ÁB–.[ž©º!„B¼Î¤Þ;$;=ñþ¨ÑsÕåIÉÉÉ ñ*•Š®_v1Ì¿}û oXiÓ®='Où£R©HIIÁÁÁ?F2éQ”;wíÂÉÉtì²bE‹>wJ“qÿN ,,ŒysfeX&))‰ˆÈH*xèÇaÙ°q[¶n£DñâôîÕÔÔ©AAAFãà½ÜÝ=P©T\½vÍdYZÀñÑ£0üääd¹{÷ ?ú”[·o–-R„¿þmxªÜœ¸¸8ÆO˜HåÊ•ø F “å^^^œ9sÖ$L£Õj '))‰è˜“§s³Âÿô³ xx¸S¥²q-+׌¾çÆ›´ù¢­Z4ÇÝÃK—.³aã&ztï–az¡'¹ººâââbøü<éø‰“›6oaøÐÁFåd¥î¯›_FþÄ×ßöå‹)]ªuêÔ¢Fõ÷)óÞ{&×—Î;²`áb-^Ì{¥Gæët:–¯\…¯¯¯Ñ}ûÆMýØj*”7zøêÓO>¦lÙ2x=q^Z[[c“:£…JõÔñxo°gï>š4þÔè;w‘Â…éÕ³¿ü6ŠÝ{öÒ°Á‡†;uj×ÂÆƆ2eôée«U­‚µµ5eʼè¿C¾ :­–?FÂ×7áa=KKKZµlÁŽ»8}ö¬QV†¬îG€ÄÄþúc´aý¾¾¾|üQ#.Z̽û÷ͦ ÍŠ:uj}ŸëÓ«'‹-aëÖmü4üñ=bý†Mx{ç¦G÷n†y5?¨AãÆŸ²`á"ãý¢ÓñU÷®(•JŠ.l˜ßá‹vü5öoNŸ>cTÞ  …Ñ5!#/êþ–ÑwÈ\©× ñï?ÿ3:/ŸL_ü¶^ÃÌÝ—~ü¡?§üý0pÖ­áàÁC¬Y»Ž¡ƒ4:ÏfχV«å÷ß~1öT*?À¦Í[˜¿`mZ?_¶!„Bˆœ&¼wLVƒxñ©OÃY[e~œœJ+R¯n6mÞÂù ˆO@§ÓÒ½kW¼s›W¬\‡»;ÕRÇ*°··§VÍرsQQÑ&½ÊÂÃÃÒŸ”y¯4Å‹(ââõu·¶F§Ó±eë6º}Ù…|yó¢P(ŒžBO³|ÅJ³O{¸»3lè`ÃtXX ¦_ßo3=(ù‘£Gž&L£R©^h/!!ïúõçø‰“ :Ĩ~ÑÑú†ýÿæÌ¥EóÏ™:eööœ8y’ïüHßï°iÃZòåÍk´NÿÓ§ù®_³Ûùó£1@ÿ¤¤9ý¾ûö¹xÇŽgÖì9,œ?‡ ËÎÝÔ§K¯^»Æ–­ÛˆKo•º¯M^;zÌŸf²ÕªVy%ÿªÕ6ÔªU“]»v³tÙrC и¸8~ým4J¥Òèiè´ñÏnß¹CŸÞ=©Z¹2–––ìÞ»—)S§Ó±ó—lÚ°Öh\»ô,ZÌ£Gaüï¯?Í.ÿ¨aüýO3ê÷1Œõ+*• NÇ¿&¢OÏšœ”ý§³Aßxñdà èS`=ÀËÊ5ÃÙÙ™-šñ¿¿ÿaöÜy8;9úèÊ—£víZYª£­-aáæSnþòëo\º|Ð÷ˆ4pööö†åññúóÑ*õ|Ìâ…ó ÿ”]»vsçÏÓ¦u+C` nÚlß±“›6›ŒQçççË®íút9III³qóFþúÛ¶oç¿™ÓQ*•†'N“’“Q(†žEŽ¤¤¤ ÓéLÒyz¤?ÇÛ¶ï˜áúBŸhX~™uòçËÇÐÁ?2tðܽ{—»÷0ÁBþ÷Ï8îÞ»g”‚µK§ŽìÚµ›UkÖÐ9u<íåËW¢VÛÐ≱՜™1m2C‡ÿÄå¿ÆâééIýzuèÔ±ƒÑ¸ÀYõ(LœÆþïÆþï³eB_¯lmõþiÇËð@cê÷ö´ñÊÒ{Y×剓§0ë¿9DGG£R©P«Õ(•æÿÈÎ~t23†®"uýfÞf–¹¹™öÌrrÒ¢cô¼ÈˆÔ뀙¾..Îf×»cç.~5š{÷ï£T*Q«ÕXZZfy؈'½èû›¹ïiÿÿ•z‡¯aÝ—¼½s3|Øúÿð#öööŒù}”Ù×?zFbb"Õª×Ìpžû!„Bˆœ$¼wŒJ¥¢s§™ ÞÁãÔ™÷ïfªü³çɬ™ÓzpÕü ;´gê´é;~ÜУfŪÕ,YºŒ%K—™¬oÕš5&¼ô¬¬¬È“'=ºw#<<œ™³f³oÿjתiHUBñbE™=ëñØ èf7×#éÛ¯¿¦]ÛÖ<Íê5kÙµ{}¿û†å+Væ§=!~úô–Ù® ~½ºFO³ÚØØàå•‹ÌjP¿>ežx½TÉŒÿQºví:ݾêILL sþ›Iµª¦õn©õ)Z¤ˆÉ² åõA1sikתɿÿü/Óu÷p÷Èô{õññ¦õFÀäéÛÑcþ .6w77–-_a˜Ÿöäþ¶í;¸xéÍ›}ŽZmƒƒƒƒáiÌÏ?kj4|hˆ~~.3çÀ¬SŸ«‘èi2{Lóøø°qÝj.Z¥˗±··cÔ¯#©S»¥ËV lj:'Ð?ÅœQÐÖç—ßFqíºùq:>ÌÇA|ß÷» ëlaaÁœÿf°zÍZ>‚N§£sÇ´hÞœ/»uÇÕÕÕäÉÖÌÓ4NNŽ™:_²rÍgÎÜyÔªù]:=n”pvvæÑ¿³uÛv¦NŸ‘©Þ£GaDDDPé‰'ÈÓ¤=½_¡|y>kÚ„f-Z1hÈ0êÖ©••ÕãëQêy7øÇŒ^jö\Ìl]¬­­ñ°6ßSºÁ‡õÙºm;×®]—Þ[æe^«2Ã2µ‘ºv­š>Xbi¦![äŒkׯciiiÒ[bÔè?xø0ˆ¥‹°s×n¦NŸAƒõDJ/+÷÷ÌJ»7èÌŒ§šôŒñ·ÒRb¿H… ¢|¹rìع‹ˆˆY¹z5^^¹¨[§¶QÙ´s|òÄñ†ký“|}Íï~uÕ|}}éܱÍ?ÿŒ­Ú²|ÅJ~èß϶¹ZÕ*+Z”Å‹—Ò¹c¢¢¢Ù²m;Ÿ5mb6õvÕ*UعMŸÅãÀƒ8x˜¥ËV°|Å*¦Od6Õwf¤ÕúôîIZæ{࿈TÓ/㺼dé2Æý; åË3fôo†Þpþþ§iÙ¦Ù×¼¬ý¨Hí1inìcMŠÀl–sßÿÒ‚l©v=í:`.ÓÃ7éóÍw¸¹¹1oÎT­RÙУ³x©2<y{ÖwÈ—‘ÊÿM¹†et_Òjµ¬^³kkkbbbX¿a_´kkòzKKK˜2iB†Ûx݆JB!„È* à½CÒ‚wæ7)U²$VVVœ8qFcÒsfÕê5lÚ¼…ŸNîÜѧry2o?@.Oýü{÷îS¥²¾çÏÚuëðñöæû~¦Áƒå+VqäèQnÝÊTÚ–´/þiã•,Q€ /™ü“zîüy£2Yu?0µZÍ´é3æ§ý3»mûvíÞC±bÅLÒÑdE÷n™ïÝwéÒe:v銽½=+–/ÉpŸ*T+++îÝ»g²,.^ŸvôU§)Z¤ˆQzÒŒ<|DRr2£Fÿa4?­WÓŒYÿaccCófŸP¢xqÎ?OJJŠIc¹ópwwË0­äË’•cêììLŸÞ=æƯB!ÄëBùü«o‚ìï@ßàûQÄ„†šôv bìßã¸|åŠáɶâ³ÏšÐ´Ic“ŸÎôivV­^óÌzj4Ã?G…R°+T(‡»;«V­1ù'nÑ’¥XZZR¿~Ýlíϯ{÷âÜé“&?iOÿ ü¡?çNŸÌôØxÏ+8$„®_õÄV­féâO xZ[[ëÓí9ÊÕk׌–mÞ¬OMšÖïu3ç¿™f÷{×.X¾d'Ž2”ÿ¨QâââX¿a£ÑzüýOsùÊ•:ÞÄ‹6îß ´mßÑh\4NÇÔiÓ±¶¶æ“?2Ìß¼e+µë5`¤É&ëY¾r ›Òœc'NàèèðÔkÖ­ÛhѺ­aŒ·43gÍ&11Ñ0}Ù²zÍðñöF©TâïÆäIñÛ·ï‘áÅé]¼x‰ÇOÀÑÑÁ0!Àƒ‡øwÂDnܼiT^£Ñpò¤?*• Ô¬­õéF>lxÐ!Í’¥ËÐét™:3ªË¨Ñchøѧì޳ר¼V«eÕê5( *U¬`¨_Hh¨!mQÚtÚ8}III„„†fiL>ñöR(huZ³Ë(_®ÇOœ09¯cbbø}ÌŸ†fDΉˆˆàÇACøª[WÃü¨¨hÕ?€5àû~€þZ5ú÷_‰ˆˆ`øO#_YÓ¨:zÔx âØØX9’#ûíãáèèÀ®Ý{Ø´y+F×Ý4µkéS·¥õOoíú ̷ใ ¯‹C‡ñç_ÿcîÜù&Ë’““9åïR©$·—ñƒ3MŠ››+K—­`ÙŠ•TªXbE‹š¬ãÈÑ£ŒýÆh~±¢EñöÎmß:½´†ÿ´‡Ð2R¹REÔjÖ¬]g²þ³çÎ3~â$‚‚‚rd¿¦uN3×ó @›šÃ2}út­V˼ù õkŒ_—ý˜Y%ŠàÐaãÏ¥F£aÿþXXXP¼xq“×íÛÀh:::šó.P¢xqC0WWW¼¼rqúô“ï Ûwì0YgÚþJ¿_æ̧¯“Vƒ9VVV$<ã|yQ÷·Œ¾·½ ¯ó5,£ûèÇ;Ÿ0q2;v NíZŒúu$ž|Ó·ŸÉ0µkÕ$99™µëÖ›lcâä)†à·B!Ä›Lzི¼K3ð‡þ>r”_~û«×®SµJe‚‚ƒ™9ë?˜>u²aÌ¥íÛ±bå*~ù 11±”+W†Ä„D¶lÛƺ ©P¾<S‘W¤š4þÔìvkת‰³³3kÖ®£ßwßR¢DEE3sÖlR4)„†„²s÷îÞ½KÝ:µ©žÚH¥RñãÀ 8ˆ®Ý{йSG¬¬¬Xµz äëÞ½2Lò²\ºt™I“§š]fmmM·®]²µÞ1üEpp0Í›}Ξ'ðÓ|þYSÃ?Èß÷ûŽ}ûСSú÷ë‹ŸŸ/‡aÚô™äÏ—/Ãc’sçÏÇÞÎüx85jT§Ì{¥³¸Æ¬kÕ² -fÄÏ¿ðèQeÞ+MÀ­[ü3nxøÚu?¤ë—]üã\¼t‰Ï›·bèAtéÔ‘½ûöÓ«Ï7Œû{,Ÿ~bzÞˆ7Ë)îÞ}Üã:­!rÛö†ñ‡<==ͦ\ýù.\dÆÌÿprrÄ‚J+ΧýûѾcg:véÊÐÁ?R¸p!nß¾Ãø 9á"¥Ž)^¨È(&MžŠF«!00;vÉ×½{Q£FuC¹_~EPPsþ›iÔó¾Bùò´ÿ¢-óæ/díú 4}âšû2îï~~¾TªX½ûö3~Â$š6iLè£Pþøóxçö&*êJ–×™&..Ží;v¦##£ýg!}£oÍjõ³±±á³¦MX¶|%vv¶|X¿žÙTlÕ߯Æ5j°rÕjø¬i,­,Ùºm;“&O¥Fõ÷éÔ±ý ;¾9©MëV¬X¹š “&øàõëÕÅI7f‹€IDATÉÑ‘ÀX¼dׯߠ]ÛÖ¸¹÷Ü´²²¢mëÖL™6FÃøq›]Jr ³çÌ%::ŠN:àæîFtt4ë×oäúõ üÁtl]'GG<==Ù·ÿóæ/$_¾¼ÄÄÄpûöš}Þ”\¹ôé^èÓ«'cÿG×î=èݳžøûŸæ¯±£P(ŒÒm¿JΩã<Îüo6wïÝקtt0|/¨P¾äϱÿ£{×/yöˆ©ÓgR±ByNž:ÅI‚CBðpwG¡Pdk?fV£† û÷8¦MŸI\leË–!::†UkÖpëömZµla65ê©Sþü=î_š6nL|B<ý›ÄÄDÚµ3­E³fLœ<…¾ßàÛo¾F¡€ a²Î åË0}æ,|}}Q*¬Z½†»wïQ´Hnpëömr{y\¸p!._¹Âo£FS£Fu’’’|ð€’Å‹¥¹ÌÎý-³ßÛ²âm¸†eö¾ôèQ}¿@‘"… 穃ƒÿüï/Ú|Ñ!ÃF éðeçN¬X¹šŸFþB\\ÕªV%**Š ±vý³cÏ !„B¼i$€÷–³°°x®à@®\¹X¶d!¿ŽÍ’¥ËX¸h1 ÿççÑ¿Sýýj†²òçgùÒEü5öo† nèõbmmMófŸ1xÐ( ÂÂÂؽg/%K–Èpœ >ù¨ /á𑣆íDDD0æÏ¿}Ï;;;Š.L·/;Ó¦u+£@ÄgM›””Äßãþå«ž½ý?ß}ûu†ã¼Lç/\àü… f—988d;€wúŒ¾wãÊU«YiæéIÐÿÃÀË—7/ æÍfØðŸ2l GíƒÕõë/ØØØ<÷{1ó¿ —ÙÚÙ¾’ž••sÿ›ÉðŸFòçØÿÎÇòåÊ1êבÏ5&B@@€aߥwöÜyΞ{üDnófŸg+¥ËçŸ5%8$„©ÓfÐ¥ëW€þÉä´ Ë“ïsÎ왌ó'‹—,eþýÙ¶¶¶´lÑœA0j¸H‰F£Áõc¾äÏ—ÉÇ3ò×Q|×OÿÏ´µµ5­[µ`È _ȱڲu[¶n3»¬~½ºT©\)[׌_~Aþ|ù˜5{¶¡—.@Á˜4á_³ãߥ}NU*žž4iü)=ºw£`AãíV­R…YÓ§ò÷¸ùi䯆ù...ôï××$]jÁ‚˜;{&ÃGŒ¤ÿ?Õù§ÃÍQ3[—‚ 0wö,Æüùþõ¸aÃÓÓ“|O÷®™OÝ*Þ. .fíú &óùm”áïjÔÈ0€÷óOÃù㯱ü;a")))hµZÆüþ›!€W©bf͘ƨÑcèÕçÃëJ•,ÉÜÙ3)—.ݯx5""#ùçßñ( œSS¢uìÐÞèz·k×nÖ¬]GófŸ›MƒüCÿïÙµk¿üòÕªT6zhäeÝßÿús _õèÍø‰“?q*•Š.;âáîÎè?þ"9u¼¬¬ 5\sÓ;zìG=îñ·béb“1ÐÚ¶nͼù IHH ým3ÜÆä‰ÿòû˜?X¼t³S{ÿØÛÛÓ®mkÈ~°äuãììÌ¢sùçß ¬ß°Ñè;g®\¹ð}_ºwëjöµ_|Ñ–©Ógàéé™áøŠ5jTçÑ£˜0i +V>^·‡»;ƒþ@×/;›}ÝèQ¿2xÈ0£ëZžbÖŒiÔªùáuýû}Ç›7™3o¾þ= ÿŽ=ò§áFuÉÎý-³ßÛ²âm¸†e澤ÕjéÿÃ@¢c¢Y0ŽQZÍråÊÒï»oû÷8ªT®l¯ÞÙÙ™% ç3bä/üòÛï†ÿõ¼½sóóˆa´ÿ¢]Ö**„BñÊl·Eæ)Ìü~úÉŸ´4žJ3+UºßÊtÓé¦Ué–[¦›¶HýIÿ·åÓöá‘ãžöæ“““‰ŠŒÄÂÒµZ©Æx7×çýE07ö×óˆåaP.ÎÎÏ%%%…û÷Ñ¡ÃÇÛ;Ó}¿ Z­–û÷ï£Ñjs¼.¯›ÐP"#"ñôôÄÑ1g.^…¨¨hBBBpqyö¹û:IIIááÇhµ:||¼ŸyýIIIáAê˜(^^^/ô\×ét‹wnoÔêçô¾JááásLá›4üèS¾ý¦ßôéýÌõ?zFDDNNN™ê¹¤Õj &99WWÃXm• $9%¯\¹^ùØÏÙIXXÞ¹s=l‡•••Ùó-«û1«õ ÁÊÊŠ.Þ0­T)qqv¦L™÷hß®-yòäÉé*fJÑ¢E¨_¯.¹½¼rº*B!DŽ{ºÈHÚ¹1xÐ@êÔ®e´ì£O›ðA 40§«ùƨנ={|EËæÍrº*B!„B!ÞAÒïqófÁ!!T¨Pž ÊS¢xq’’’˜9k6}Ú„ÃGŽæt3¥e‹æL<‘Ê•+åtU„Bˆ!÷t‘‘›7¸À¤)SÍ. Êé*¾1ÒR¼ê´Úœ®ŠB!„Bˆw”ôÀ{‡¸ºº0zÔ¯Fó:̗ݾbðÐáìÙ¹ÍhYhè#Ãù °±QS­Z¼råÊ°lJJ ûäîÝ{¸»»ñAê–½wÿ>—.]6šWºT)¼¼L×ãÆMnP»VM’’’رsAÁÁäññ¡nÚØØؘ¼F£ÑpðÐanß¾››uj×F©T°oÿ äÏOÁ‚rô¸ !„O’{ºÜÓ3’+W.NŸ>ñcÇ3O`ßþýܺ}K Š-JµªUP*ŸóËÎñÈ*NÇñã'8áÉ))äË›—Z5?0Zwhè#üOŸ¦Fõê:|˜[·nñé'“+W.öìÝG@@µk×"¾|†×?q’Ä„jÔ¨ÎÕk×Ø»w? ‰ ”.UŠÚµjšÔc÷ž½\¸x€‹—.¥y-T¨ aÝiuÉŸ/… 4ûž9J\\uëÔF¡P¼¬Ã.„B!„â-$¼w\õ÷«Q¾|9Ž?ÁýÀ@|¼½X±r5#~‰R©Ä;wnBBC‰‰‰¡KçNfS/ 2Œå+Waccƒ»›Ãú™‘? 7»Í¨¨h:tîÂ… qvvÆÒÂVK÷®_š-¿oßFü<ÒhÞÿþúƒ¦M›”ݸy3ã'LbÖŒi :&FKDDùóåcõÊeØÛÛÊGFEѱó—\¸p'GGø}Ì :„>ß|Çwß~Í7}zçôaB!žIîérO¨Vµ ‡eÚŒ™Ï àùûŸ¦Ï7ßñ(,Œ"E “Ÿ@À­[/^Œ™Ó¦+]à6«Ç#«ÂÂÂèÙûNùû“;·vvvÜÂÃÃéS&S¢Dq®ß¸N¯>ßЭkV¬XEtL ë6l¤UËüóÏ¿DÇÄ0qÒvlÛŒ‹‹ ãþÀ•«W2h ÃFüLî’˜˜H£† ˜ðï?FÁµï $::€ ±`á"ò~ß}KŸÞ=°±±fÀÀAäÏ—5«–›¼§à:ÙêïW£^Ý:9}j!„B!„xÃH MR¡? ,T*""#6â'òçËÇ¡ý{Ù¶e#Ç ^Ý:ü7{þþ§^¿mû–¯\Eݺu8uü{vmgë¦ Ì™;ßìöþ0 .2 ?N=Äáƒûûç¦N›n¶|ëV-8낳þ'Lz{ÖhëÖo`øAXYYàççË·ßô1»Íõ6áí›Ý7€Ôü j¶¼J¥ÂÖÖ[[[ÃúŸå“?¢~½º( z¦6¶\¾lܵyóV<=<øºw/ü† >¤B…ò9}h„Bˆ,‘{ºÜÓ´Z-mÛ´ÂÁÁé3feXnݺõ„……ÑõË.øùùæ×­S›zuëpðÐanݾmòºÌ¬¸Àž½ûøô“ùø£F†ùE ¦WÏÜ»ŸÝ{ö¶ P§v-lll(S¦  ïyhmmM™2÷§ÑhèÚ¥3¹s{`ccÃàõ=PŸ à©ÕjÃùieee8gmmm±°0N`Ò¹cG”J%‹0u:ËW®Â××—Z5?xÁGY!„B!Ä»@xïø¸x¶lÝÆ–­ÛX»n=ý›VmÛ‘’’ˆaC "...4mÒ˜÷J—æêµk9z”qçî]ÂÃÃÖ{åÊUœœðõõ5š_¾\Y“:‡„FéR¥LÆ1W>»ªT®l4íêꊅ……QÝ£¢¢  ¡xñb&ã¼|X¿Þ«9(B!D6È=]îéOcooO»6­Ù¸i3÷îß7[Æÿô@ŸzõI•*Vàœ™^e™9YuêÔiŠ)LHh¨ÑOÚØrgΛý|ý°U« é>mÕ¶$%'›l§r%㔢… ÄÚÚšëׯg»î~~¾Ô®]‹ 7m˜ôØ1nß¾CûvmLÎI!„B!„"3d ¼wHHh(_Û×0­R©¨Z¥2}¿ý†rO4´Mœ<…YÿÍ!::•J…Z­F©T˜]oDd$NÎN&óMæEFDàädZÞÅÅ´|v9›Y¿R©D§Ó¦£¢£ptt4)ëå• !„âu%÷t¹§?K§N˜=w³þ›ÃOÇš, ÀÃÝÝd™««kjÓ \fŽGš]»÷ð]¿þ&óOŸ<†*5Í+À£°GŒýß?Œýß?fßOè£GFÓ¶¶úÀ]ZðØÚÊZ¿ õÔ6Www7“yŽDGÇ<×¾îÒ©#»vífÕš5tîØ€åËW¢VÛТEóçZ·B!„Bˆw—ðÞ!y||X¾LŸÞG¥TâäädÔx’fÉÒeŒûwÊ—gÌèßÈŸ/þþ§iÙ¦Iy…BVkÚH’læÉç´FVkZ>É´üË”6–‹¹z¾êº!„Y!÷tcrO7åéáAÓ&Y¾b%ßôéer~¤M§-—^ll–Ï÷¯‚7­SÓµ¦÷dM+KKúôîIZµÌ®ËÅÅå¥ì§[ Õs­£ZÕ*+Z”Å‹—Ò¹c¢¢¢Ù²m;Ÿ5m‚“™ ²B!„B‘À{‡(UJ³OY?iÛöüõÇh£1Q<0[ÞÕÕ…û÷ÑétF 2æR6¹ºê_‚CBL–Ý»øJ÷‡»»*•Šš,»xùò+­‹B‘rO7&÷tóºwû’+W1oþBÈiòäÉÀýÀ@CúÉ4iç‡oj™ì*Z¤Æ~f9??}:L Ê–-óÒöGppÞÞ¹ ÓIIIDFFR¨`ç^w§Nž§Õ2oþBýßã'íK–(A||èV«VM~>‡çZ¿V«å¯?ÆÐÀ@ÞºèÇÕ÷÷X äÏoR¾@þüôÿ¾/'Máû õ)[¦ ½{õ0»/¾hËÔé3ðôô¤aƒ_éþB!„BñöÉlK†" ófþN?ýäOZ/@¥™¿€*Ýoeºi‹tÓªtË-ÓM[¤þ¤ÿÛò‰iûðˆÈqO{óÉÉÉDEFbai‰Z­F¥zö@÷n©ã¼É""# Ã;wnlll óãââ°²²Â¤üõë7°³³£h‘Â(•Oïày?0ÀûúqWÒËó:عk7=zõá§áCå j!„o<¹§Ë=ýiâãã |€µµ>>>9ìÔjµ’œ’‚W®\¨Õêç^gÇÎ_rèð®_¹@`àðóõ59÷Ÿ”œœÌÇQªT¸»¹ammaÙ›4üèS¾ý¦ßôécûP!„xlݶŠ+>³œN§#))‰¸ØXR4¼¼¼Ì–{WÛè„âMð¢¯ù.ÎN} %õG$?1þï´åÚtÓšÔé@—nZ“nZ—:/mœ‘'ÿÖeðcxK馟\–¾Lfæ‘x"CÎNN8;9™ÌÏ(…‘³“S–ÆJññöÆÇÛ;Gßã¥K—™=wuëÔ¦QÆùû D‰â9Z?!„âE{ºÜÓŸF­VS°`œ® ï˜'Ož—º oïÜ™.kii‰¯oæ‚Òÿó/66Ö´kÓæ¥Ö_!„B!Ä»Axâ–Û;7{÷ícûŽ“7¯ÇŽgñ’¥”+W– å3ßx)„Bˆœ#÷t‘îݻDž‹—Ø°q[¶nãÇàææšÓÕB!„Bñžx§9;9±hÁ<þ÷÷8þ0¨¨h\]]iÞìsþÐ?§«'„BˆL’{ºÈ ‡eðÐá8;;3 ?ºuí’ÓUB!„Bñ–žxç,P€ÉÇúqWž5ÎB!^OrOæL›2‰ää”—²î–-šÓ´Ic¬¬¬rúm !„B!„xËHOˆt¤¡O!„x;È=]¤Q«Õ¨Õ/oý¼B!„Bñ2HˆB!„B!„B!„¯ à !„B!„B!„Bñ‘žB!„B!„B!„¯ à !„B!„B!„Bñ‘žB!„B!„B!„¯ à !„B!„B!„Bñ‘žB!„B!„B!„¯ à½'NœÈé*!„B!„BñN“6:!„o2‹œ®ÀÛjë¶í9]!„B!„B!rLÅŠsº ÒF'„¯ÈëpÍÛHï%U!„B!„Bˆœ%mtB!Þd’BS!„B!„B!„Bˆ×ˆð„B!„B!„B!„xHO!„B!„B!„Bˆ×ˆð„B!„B!„B!„xHO!„B!„B!„Bˆ×ˆð„B!„B!„B!„xH/“t:áG!„B!„Bñb¤µ·e¦íMÚè„âÍ–•kþ»Nx™$'’B!„B!„/‡N§CGæxB!Þl™½æ¿ë,rºo VÉÉXZZ¢ÓéP©T(Šœ®–B!„B!„o¤´†Û””R’“IIÑ Ñhžúi£Bˆ7Sv®ùï: àe’B¡D«Ñ€¥¥¥|9B!„B!„â9ét:R’“ILJB§Ó=³½MÚè„âÍ•Õkþ»Nx™ R©ppp ..Ž„„’““P*•(’T!„B!„BˆìHK¡–ÖÃÞÎ…2ãö6i£Bˆ7WV¯ùBx™¢P(P*õ‘`­V›ú[‡R)ùY…B!„B!„ÈN?þ‘F£A¥R¢P*±°È¸¹RÚè„âÍ•Õk¾^¦( llÔØبsº*B!„B!„B¼“¤N!Ä»Dú' !„B!ÄkîÄñãœ8~+KK£yV––†y/ªŒB!„Bˆœ'"§kóvR©TØÛ;`gk ¼{û\¡kµ'GGâççGÞ¼~9]-‘IvvvT¬XÍ›·ðèÑ#‰C£ÑätÕÞ) XY[cggg|ÇÇÇ˱È掅B!„B!„"s$€— ±11ܸyƒdÜý•pw÷ÀÍÍ•›7o¾“ûÜÒÒ’˜˜XòæÍ›ÓUYdggÀà {šÓÕy§YXXà㓇ÈÈH""Âsº:ï4 òäñEúp†B!„B!„âÙ$€— 7nÞÀÚښ… acc“ÓÕykiµZÂÃùs÷.ááa¨ÕêwnŸ'$$pçî]Šw Ûá[*11?¿Â8::¢T*sº:ïœÄÄD‚‚‚¸{÷:///99$íXÜ»w— IOø §w•B!„B!„â9Iï[¶|%ÓfÌ4™Ÿ/o^:vø‚O>þ(§«øVjÞ² Æì²6­ZÒ¯¯>(”v|þ÷×T(_ŽÏ›·Êô6öì܆Z­Îé·jâÒå+œ9{ŽF 0øÇ ó=ÜÝy¯t):´ÿ⩯‹‹ÃÊÊ ‹g_.âã°°PaiiùBßC||VV–¨T*êÕ­“3;2‡ÄÅűoß>®]»f„vrr¢E‹oD /$$„›7o¢ÓéÞØÞ¼yóÐjµFó nnnT¬X‘"EŠd{Ýqqqܼy“%JB©TR¾\Y ü²e˘”4y kÖ­ãáà  >>>´iÕ‚ž=¾`È°ܺ}›Eóç½6<<œÖmÛÓ¦uK¾ìÒЧûl×¾#íÚµÁÞΞ‰“§pïÞ=š6þ”ÿý“^}¾`ʤ 4hô wïÝC¡PРÑ'†uÏùo&[¶neÉÒå̘6…¼yýŒ¶˜˜HË6í(ó^i~ùsN¦ ­_¿ž   Ê•+Gñâűµµ%::š‡réÒ%RRRrºŠïGGGjÔ¨€V«%22’³gϲeË€lñ<<<¨_¿>oH*[!„B!„B!ÄË%¼òÞ{¥©Qý}Ãt•Ê•èÖ£ -1 à%&&`mm©ukµZLÒr¦¤¤’’‚ÍS_¯ÑhHLLÌtZÏŒ¶÷ºqttäÓO>Îty•Je¶üºõ(]ªT–Ö•“ äχB¡`݆ 4nü)Å‹}jùääd:uéÊ™³giÓº•+U$22ŠÿfÏ¡]‡N,]¼€Ò¥J””D‡Î]8}ú Ÿ~ò1Ô¨Žµµ5—.]æ”ÿiÃ:}†þýúÒ«çã@Ø‹nÞ¸y“MÖR°@§–ëÐþ -YŠ…Je’ÔÁÁjU«°rõjúõýÖè<^¼dnn®|X¿^ÎœgH Þ;99eú5)))9r„Ë—/‡B¡ wîÜÔ¨QÃhµøøx:ÄÝ»w‰ŽŽF§Ó¡V«)V¬ÕªU3 ÚpàÀêÖ­K@@/^$!!ºuëRªT)RRR8vì—/_&&&…B££#%K–¤bÅŠFõ‹gÿþýܸqÃp©U«yóæÍéÝm...&é5wíÚExx8Í›77Ù+V¬ dÉ’”/_Ч¿Ü³gµk×Æ÷½e###Ùµk÷îÝC§ÓáééI:§–½ÿ>‡æáÇhµZÔj5%J” jÕªFÁ¿5kÖ V«)S¦ ûöí#((;;;¾üòËœÞÅB!„B!„B¼s$€÷šHII!>!}/£³gÏK§_;wnbbbÙ¼e+þõ?´ -[>>äΛüù󛤭=sæ <àÃ?¤xñâ†ù… bÁ‚|HµjÕ¨T©’ѺÌñöö¦víÚ†i777Ö­[ǵkרP¡BNïògŠˆˆ`íÚµÀã1ð(S¦Œ¡7ÝËtòäIbccùä“O(X°  ÀÊÊŠ#GŽðRRRعs'ÎÎδiÓÆpÜ .Œ­­-G%00Ш'vTTõêÕ£dÉ’9½«…B!„B!„x§I/‡L6%K—‘¢Ñp÷î=BCCqsuåë>½P*•$$$p?0„øt:ùòæåüù „……ãêêb´Î¶­[™lG­VËá#G ÁÁ';~‚ˆˆ¾êÞÕdœ½Ïš4fæ¬Ù;vÜ$€gn{¯3…B•Õ›5ÞÖË R©(^¼Å‹£zõ÷ù¼y+V­^c।¤àçëûÔ4˜iA­V‹åsô`K š£VÛdaMO¿­[¶`âä)ܾ}OOOÖ®[Oõêï?3Uáë FxzzrñâE¹xñ"/^D¥RQ¶lYÞÿ}CpþÊ•+¨Õj£à~_ª)X° —.]B£Ñ R© ¯ÑjµDEE‘˜˜ˆN§ÃÞÞ€   “^©R¥Lz,^½z›L¯ž·/Ož<f{ª½®ÒRe¦—’’BDD &=à^´€€(ðDïÔ²eËrìØ1£ywïÞ%>>žªU«š·’%KrôèQîܹcÀ³¶¶69„B!„B!„¯žðrˆR¥B¥²ÀÒÒ’òåÊR¢Dq>þ¨N©)ä……ñç_ÿcÿƒh4“×ÇÄƘðÌ?צU+víÞK¿þ?àæêJÅŠ¨T±"õëÕA­Ö§¼ ¸u €Å‹—²nÝtèƒ*:ÝãžW¡™¬ûMïÎÏ×—‰ãÇåt5^+¥K•ÂÚÚšÀ órçÎM\|<ݺvyæë}|¼ ¸u NgÔÃóIvv¶ÄÅÅ™Ìø0è…¼Š§.oÓº%“§Ncɲe(P€èèè7*]¤HŠ)‚V«%,,Œ[·nqêÔ)Nž<‰ƒƒｧ®‡……¡T*Y²d ` E£Ñ½½=Z­–C‡qþüy³iÍÍKKµ™^xx8Fc©=Í“i2-,,P©T¤¤¤äônÎgggC/Æ4AAA¬ZµŠµk×Ò¶mÛ§~žWTjêã'·aeee< Àßߟ .i?ù¹ttt4<@"„B!„B!„È9ÀË!_uëJêïg¸|Ðàa\¹z•èOÅ prrD¥R1wþfÏ™gè’ži%o–-^ÀŽ»8zì8'Nœdë¶íL6éS'ãããms©jÕ*äöò2YÇG R @þLmO¼~=Ò7⻹¹š,;}ú ‰‰‰”(ñ¸ÇMƒëóßì9¬[¿&?}êºëÕ­Ëì9sY»n=Ÿ5m’a9¢££ ¸u‹üùòæ¯_¿á…¼G[;[‚‚2æÊ•‹zuë°rÕ¼sçÆÃÝúõê¾”ýý2)•JÜÝÝqwwÇÏÏ%K–péÒ%CO§Óagg—aúJÀîôèÑ£œ:uŠòåËS¬X1ìííQ©T²víZ³½#ͨÓé²ðÉ(¸õ´Þ˜¯»\¹rQ°`A._¾LPP^f®£/ê½>m?¹oÓþÈ›7/f_ãææf4mi)½”…B!„B!„xHï5ÊÙsçhÛºM›46ZœåõÙÙÙÑ´Icš6iŒN§cëöüôó/Ìž;—aC‚v… 4Ùžxó]¿qn_õ¤aƒ|P£:yòøŸÀùóçùoÎ<¾ìÜÉP¾wϯضm;ƒ‡çæÍjÖ¬£ƒ#pèðaîÝ»oèÉØó«îlÜ´™ÁC‡sçî]j}ðVVV\º|™ /2|èú1³þ›Í÷ý2 ?ll¬Ùºm[·o!ï±Ì{¥™;ï £~C‰ÅQ*•|X¿žÑq_´k˶í; £w¯™î1öºòôôD¥Rm˜çàà@JJJ¦ÒY^»v wwwjÔ¨a4?666Kõppp ""♽0ßviÁÍô=Ú,-- H¤“ííØÛÛ›M7ªÑhˆ5z°"-hçææF©R¥rz !„B!„B!²@x¯¡´ÞŠ'zY„‡G°gï¾çZ·B¡ á‡õ=悃C¨Vµ*VVV,Y¶œ?j$=0Þ2yýòÒ¨aCöîÛÏšµëŒ–ùúú2lÈ >jÔÐ0ÏÙÙ™eKñóÈ_™½ eõšµÌ™7NÇÎm[È›×ÏPæýjUñóóåÞ½û´jÙ"§K¦ÄÇÇÒݦ÷ðáC4Ñ8u äÔ©S\¹r…¢E‹>uÝÜΟ?Ÿ¥:(P®\¹B±bÅrz—判¤$îܹ§upp 11‘ˆˆœ ó¯^½šímùúúráÂ|Ø$­±Z­æý÷ßgÿþý¬X±‚Š+âââBRRaaa\¾|™*Uªàó†|„B!„B!„x—Hï5õÛ/?3xØp~ù+ OÏÖ¢Ù縸¸0eÚôL¯'W.OV¬ZÍü…‹ ólmméÔ±mÛ´2Ìk׶ ŽL›1“5Ì·°° \Ù2äÊå™Ó»D<'¥RIîÜ^äÎí•é×8::d:pëéᧇÇS˸¸¸P©b…yÿ -&&&†ö_´Ë‘íg‡““… æÖ­[\¾|Ùh™££#5kÖ¤pá†yjµš–-[²gÏŽ?αcÇ Ë cå¼ÿþûDFFrìØ1C9???êիǺuëȬ´mîܹ“£GrôèQ@¾/^<ÓëySÄÄÄpàÀô¥¥%®®®”/_žÒ¥K•õôô¤J•*?~œÕ«õg5jÄòå˳µ}'''š4iÂÖ­[ ÇÉÚÚš:uêpâÄ “òåÊ•ÃÚÚš#GŽ°qãFÃ|•J…··w†cã !„B!„B!rVf,RdažÂÌß駟üIË©4ó·P¥û­L7m‘nZ•n¹eºi‹ÔŸô[>1m9îioþäÉ”/WNgHoù*h4nß¾CLl yóæÅÉÑ1[ëIIIá~` áá88Ø“ÇÇkkk³eu:·oß!""GGG¼½s›ôêx™”J%×R{³äÄ>Ïi ……BÁλ(Uªä;›’ðEš0i2W®\eÇÎ]”-óK-x©Û[±b%^^¹(Y²$Z­ö…¬S§ÓCll,Z­{{{Ÿq=HLL$,, …B½½½IÈ4QQQÄÄÄdjÏKdd$–––899aeeõrvò3¤}Ž._¾Œ‡‡nnn/ìXdG||<áááX[[ãææöBÖ©Ñh E§Óáîînƒ/#:Žððp°¶¶ÆÑÑñ•¤KN,Ü=<ðð‡A„B!„B!ij¹8;õb€”Ô üÄtú¿Ó–kÓMkR§S]ºiMºi]ê¼´Ä'ÿÖeð“&ýô“ËÒ—ÉÌ<#Òï5¦R©(P ÿs¯Ç‚¼~~äõó{fY…BA¾|y¼9ýö…x!M§ŽèÕ£{NW'[ Yê-emmm4FZFŸ;p—ÆÎÎ;;»ÛO¯+µZmvÃç¡R©È•+W¦Ë+ \]]szW!„B!„B!2IxBˆ·ÚèQ¿æt„B!„B!„Bˆ,Q>ÿ*„B!„B!„B!„/Šð„B!„B!„B!„xH ÍLÒét†ñò¤ß¿²ÏÅ›LÎÝ׃\G„B!„B!„o" àe’V«E«ÕJ#ð+ðöî:,ªå àø—.D@Å ãÚÝÝz¯u½vwwww·b·b^»± [°)éÝýý¬¬»(‹÷çûyžëΙ=;gÎœ3{Ï»3Wÿc`h(cÿëT*J¥…B‘ÜEù-Å¿Žä\$/¹§ !„B!„B‘4ÀK$…B¡~,~¬¸€ÝïX熆†¿UÀòÿ•J¥B¡PHÐ(™Ä¿Žâ‚wr.’‡ÜÓ„B!„B!„H à%Âÿœ=ëžÜÅøíH‹ÿ*_|||“»xõêurAÄ’s!„B!„B!â«Z­Zrá—&¼DhܸQrAñ!÷ !„B!„B!„HØŽ;“»ÿ ²0B!„B!„B!„¿ à !„B!„B!„Bñ ‘žB!„B!„B!„¿ à !„B!„B!„Bñ ‘žB!„B!„B!„¿ à !„B!„B!„Bñ ‘žB!„B!„B!„¿ à !„B!„B!„Bñ ‘žB!„B!„B!„¿ãä.Àÿ“ÃGŽ&w„B!„B!„B!’EêÕ’»ÿ7$€÷IãB!„B!„B!ÄïF9}_2…¦B!„B!„B!Äo&$$ä»îO8}_ÀB!„B!„B!„â"mZµ¤hÑ"Lî\¹’»hÿ»÷ìeÎÜùœ>y,¹‹òŸȬÙs8xð0˜™™Q®l† LæÌ™´ò?q’…‹–ày÷.J¥’Œ3Ò¦uKÚ´j‰:ßú Y¿aÓ?{ù²ÅdÉœYýúé³gÌš=—3gÝùøñ#¦¦¦/^Œ¾½zR°`­÷»Ÿ;Ï¢%Kñð¸Att46)SRµjú÷í­5º-,,œÕ®kؾs¯_¿ÆÈȈ,Y2ÓªE šýÝCCÍß½}ûŽy ròÔ)üüÞceeEž<.ôèÚ…²eËh•åÑ£ÇLŸ9‹sç/‰­ õë×e@¿¾ÿÉQµB!„B!„ÿE ëâÒd$ÞÏ!¼ŸÌËË###jÕ¬ÄL©øìÙ3V®reã¦Í,_º„R%K$w1¿+ –.^˜ÜÅø­œ>s€YÓ§‘7ožD½§IãF4iÜè‹yœ³eSÿ;~!¹¼ïÏÝ»÷¨\¹#G Kîâügݸy‹h…"¹‹ñŸM›v¸ÿÿ4û›?òçãå«W¬v]K³æ-Ù»g—Æ´¨‡¡WŸ~äÈžÆbiiÁþÿ2qÒ‚ƒèÝ«‡:o¶lÙüBtòÔi¼Ÿ>ÅÒÂBöòÕ+7ýccô닳s6^¿yÃòå+ù§ekÖ¯u¥h‘ÂêüÇOœ¤[^¸¸äfÚÔɤ¶³Ãóî]–,]Îù Ø·{¶¶¶@ÌtÈ}úõçÄÉST«Z…íÚÆî={=v^^^ס¿¿?ÿÓ¿÷ïiܨ!9sæàíÛ·lÙºv;³hÁ<ªW«ªÎÿüù š5o‰¡!Ý»uÁ)]:®{Ü`ý†M<|ø˜õkWÿ÷!„B!„Bˆÿg_i'A¼ŸGxÉÀÎ.S&MÐH;wþí;vf؈Qœ:~Dó 1Ó¬>}†Ç^^8ØÛS¾\9R§¶Ó¹__ΞuÇÇÇkë)R—Ü Fzüø —._&((GG*”/½}j<*•ŠcÇO1crçÊÅí;w¸zõ&&& îÿÌYw"""Ô¯---)Sº”V>_??nܸI¦LÉ•3§Öö“§NP±Bùo{x«g=>zô˜ë’6MJ•,££c‚»¿yë6Ožåõ›7ê<öö#p^¾zŽ{÷5ö“?_>Ò¦ý~kJ%¦}éëæÍ[øøúòöí[ ´:•Å‹“2¥µFÚ£G¹tù2ÁÁ!888P¶LiÇzüÄIìR¥¢P¡‚éOŸ=ãÑ£Ç+VT½†¡¿¿?×®{Pàü¤Nš³îçxøèv©ì(_®L‚mæÆ›ÜñôÄÜÜ‚R¥Jö;®ãåç÷÷sçxçãC*[[þø#¿Î‰ÏŸ¿àÁÇ\¼t‰ˆˆ:444¤JåJß\ƒ˜ûÇù ¹yóFÆFT(_.Á’ú^wÏŸ¿àÖíÛ|øðÔ©SS¢xñ¯#•JÅ•+W¹ãéITt4Y2g¦Bùr˜››Ó1îÜ冧ç]ÆŒA«–-ÔéÅ‹¥eëv,YºŒÑ#c¦U*•Lš2•ôNNìضY½ÞdãF iѺ-K—¯ Y³¦êuË”.¥ó¾ùèÑc\×®£G÷®õ³qÓfXµbÊ—S§.Tµê²|å*Þ¢ÅK011aÝšÕؤL @Ù2¥±NaÍè±ãØ嶛öíÚpáâ%NœsÆÑcÇiä™5c ê×û¦ºŽ;ÆĶ/}-Y¶œcÇO¨_;~Bã5€ÛÎmäÏ—O]–‘£Ç²}ÇNH›6 O¼¼‰ŒŒdðÀþ´kÛFã½Ý{ö¦t©R¸®Z®‘~èðfΚÖMÔAǟЭG/ÆÍž=û¸ÿàúœ¦H‘‚µ®«(ðG~ý >’í;wannŽ}êÔŒ3–qcF}sìØéÆè±ã044Ä)]:|ýü ¡]Û6 ª¹^Øñ“'™4yªúuüöcddă»·¿¹< <”£ÇŽãà`Ï‹/™5{.£G§e‹æê|ú^wã'NbÃÆÍØÚÚ’*•->>¾„‡‡3xÐÚµi­‘×ßߟ®Ý{qÝÃtéÒbee…·÷SìY¾dq’¯;€ÂÜÜœ¿›6ÑH/Y¢9rdçàÁÃêžÇ¼yó–>½{ªƒwqõÔºe ._¾Âñã'ù§YÓ?O©T2dØp2fÈ@×Î>;ÎZ¬¬Y²`dd„¿¿¿V~{{uð.Nvçlû°°0§K§Ž4mÒX#¯¥¥%¹sçâÌYwÂÃ#Ô¼ìÎÎtîØA#H/o^ÌÍÍ R§EEEqôØqŠ+¦õƒV-›³pñ:¬À377cÜ„IlÚ¼EÝ'L?ö«#Š…B!„B!„¦jU«HPîbøí»ß‹¡AÌé062ÒH߸i ¥K•Äãê%ÜOŸdÙ’E2gÞ||W®^cì¸ +V”ógO±kÇ6Î=E×ÎØ»o?ËW¬ÒÈ¿Úu-›·l£]›Ö\ºàξ=nœ=}’üùó1tøH=z¬‘ßÈȈ§Nñôé3®\<Ï©G9vø_lll˜1k‘‘‘ùO;Ê-«Üò¸JÆŒråÊ©®ï¸›ìÕKçÕi·<®²pþ\÷üÝ´±zÛç£B¿•¾íKóæÌâ–ÇUvíØ@ûvm5Žó–ÇUòæù4uèÒe+ؾc'ݺvæÜÙ˜kã‚ûiŠ-Âä©Ó¹zíz’Ëb{½Î_°’%‹kœÓæÎ[ ‘ÿÈÑclß¹‹Ê•+qýÊEN8Êá÷³fíúo®ó€À@FŽCÖ,Y8ö4GàòwªT®Äj×5xxÜÐÈߪEsny\%k–,8::jÔßk—¿¹<W¯]'44”KçÝ9~äGÀÞÞž)Ófàëç§Î§ïuçî~Žuë72lÈ .?Ëá÷såâ9šýÝ”ÉS¦ñôÙ3üƒ‡çÆ̟͛;›³§NpèÀ>öíÙ…"ZA÷ž½µî_úðô¼KÎÙÕ«øþÈŸ_??õ±zzÞP—ãËŸ?&íî½»_ü¼Í[·qëöFŽªñ£ €Ò±£õΞu×H¿ví: …‚’%Jhåýæ Ožxi¤_ºr€’%Š«Ó *Ä ýµÖô àŽç]\\rkŒz­_¯.ƒ ÐZïÊ•«„‡‡S²ø§}{y{FþüyµŽ×ÎÎŽôNNܽ{OkÛÍ[·yþü¹FŸ”2eJ¦N›ATTT’Ï©B!„B!„ÉMx¿ˆÇŸpãæM2gΤ5]\¦Œèß·F±‚*•+‘=»3žžšy×®[J¥bÈÀXYY1£:úöéEêÔvlØ´Y#¿ëšµ¤wrbèAê}ÛÚØ0vôH ›·nÕ*ghh(3¦MQ?¤Í˜1#µkÕ$$$„—¯^iäµ°0ÇÒÒKKK¾6óez''¦O›Â…‹—X¹Ú•ÈÈHú Hj;;fL›ò]Ö=Jl=fΔ‰)“'Ò³gwu^{ûÔÔ¨Q  `¼½Ÿjä¿ÿ>ÖÖÖäÏ÷éÁ³MÊ”¬\¶„=n;´^ëS}ªë;n¿ê4KKK­)=ŒŒÔÛt¾ERÚWb™™™aii‰¹yÌñ˜k§¥¥¥ºÞU*k×oÀÎÎŽÞ={¨Û’¥¥%Ç A¥R±ió–o>ÞôNN:ÏéýûšS”îÝ·€QǪ뙼¼½9uú uëÔÖÉ—3GºuíÂËW¯ÔSõê+22’€À@b§¼Üà_zöîËâ%ËÔéïÞ½ÀÇÇG”J%={÷¥gï¾<}öL=mæ»w> ~^hh(ó,¤xñb”+[Vk{½:µiþÏߌŸ8™a#FáºvS§Ï k÷ž”+[–î];kä<°?… ¤Y‹V̘9×µëC—n=ø§Ùß”(^ +++lmm¿¹,ÿUIm_?³çÏñ÷÷§fꘘ˜hlË+)R¤àöí;ßü9‰=§<ÄÖÆFkTjáÏÖÛKŠT©RÑ ~=¢££yøèþþþDG+xþâ{þdÙ²eUeâ(ð€Æ(L}¯»¸iûD§í)[¶ Ž˜››k­iwýú ræÌ¡1ê>M5yóæ-­é#,vd`\püá£G:|„CcÓc‚´áá±ùÃÔùU*•º/èؾY2gÆÀÀ@k´a|6mæý{f͘®s»¡¡!uj×âömOvîrÃÞÞž>ÆÑ‘zukkLÛ `kkKãÆ ™5{®k×akcƒßû÷)\ˆŠ_˜¶xËÖm¬Y·^}.FNÎ9Ì?~ÂDuеFõj <)R|ªÇ°˜c6­Ç‹/síúuòåËK5ª`fj¦±¦jœ/õIþþþdÍ’Eïs*„B!„B!į@xÉÀ×Ïž½ûª_Q²DqúöîE!ñmll´Ò ´Guùûû“5kŸ÷€ÓßßGÞ¿Yéĉ“”:qRç{â¯_÷©,¶Úe1Œ 8ªTß^7ƒöçÔ©Ó=vœ^=ºóGþ|ß¾S=ë1$$„ÑcÇóïÁCDGGcjjŠ¹¹QQÑ:÷Û»gw>|øÀÎ]nœÞûÇ´µ™³æ0sÖûó{Ÿ´öhj ‹›®1k–,”+[V=dÜÔœq¼¸Q—‘QQ¨GÑY§´&::•J¥5R6ŽB¡`Ýú 8gËFÙ2¥uæ9zì8=zõ¡^Ý:¬u]EÊØý®^³–ÁC‡ãýô)úõU矛F9Îù xûöýûöI°<óæ/ÄÊÊŠ©“'ª¯1ccc:wìÀÑcÇY¹Ê•^=ºcjjʇX³vÊ—£]›Öê}ØÚÚ2mÊd9ÊÒå+tðÒ¥KKºti)PàjÖ¨Îè±ãXµÚ•šÕ«éü!JÜHÇ"… ógƒú4lÜ”¡ÃGR¹RELMM?ÕKl}}ôõóSסB!„B!„¿ à%C#C£R¾U† éyõê …B+ øúÍ qrJ@ÆŒb§j‹ `ÁÉ]%@̨­~ýñÇù5b8ÿÓ‚á#G3îìŸZŽ£ÇŽ“.]ZÆ­|xýæÍßg“2%uj×¢NíZ( FŽÃö»¸pñeJ—J–:M.¿Rûʘ!=¯_¿ÖÚŽ¿ÿò6ÒÓÀÀ@gÀO×\ú²³KÅ«W¯Q©Tíë{¬×uäè1fL›B¦LŸ¦èüZÛý‘t­ç·\ü©5“zÝ™˜˜P¶LiÊ–)ÍAÙ±Ó¡ÃG°iËu +SìzxÆÆÆ?¤=æqqáö;DGGk%nßñÄÞ>µ:(—7O<ïÞÓZÃîö;y>wìØ *W®˜`Yž=Nº´iuÈÓ8:âu__2¤OÏËW¯P*•ê~!¾¸Àä«—ŸÚå¾ý¸yóýúöV¯³§DñâlÚ¼•»÷î©xK–.G©TÒ£{W­sV¨PAîÝÀóç/ÈžÝgçl˜™™áy÷žVYxùò¥Æú…B!„B!„âÛ8qŠÔ©í¾}G±Ê$0k”HšßkXÐÿ¹òåÊαã'4Ò_¾zÅÍ›·(V´(X[[S¸P!®\½Êóç/4ò‡„„0yêtõÃäŸA©T2`Ð`ÂÂÙ3käÏÇÁù÷à!6nÞòÓÊ¡R©P©TXZXj|ýü8pà`lYêôÈÈHæ/\ĉ“§4öcddDùò徸žÕ™J•Rç¶_©}ÙÙÙ‘7o.^º¬µþÙÁC‡Q*•Tˆ=WqR¦LÉË—/QÅ›ƒ/22’S§NsyòæÉCXX·>[wïè±ãß¼oelyã¯s¦T*Y·~cÌ¿ºÏ—©©)áaaßüùºxy{óâ…fp?@èÑ÷ºؾs®kÖj}^åJ1#ìâÖT(^¬(æìÞ³…Bs?·nßaþÂEê bRÔªYÐÐPöí? ‘îáqƒûhžŠ)Œƒ½=»víÖu¹iËVLLL¨Zµ²ÎϹ|õ*)SZ“+gÎË’1C^Ä®A_tt4wîxbnn®þIz'' ñð¸‰R©Ù6ž={N@@€ÆZÞOŸ²fÝz­ã¸tù2iÓ¦ýtžÏgÞ‚…<ñòÒÈ«P(¸vÍ###c‚¸fffTªXó.hÝ3¶l݆J¥’žB!„B!Äw–œK“xÿG:ulÛî=Œ›0 òåËË‹/˜8i* ìßW#ÿÀýhÙº-­Ûu`Ä°!äÈ‘gÏž3ÁBîxÞ¥VìÚDIqäè1Âââ¦ðܳwŸ:-‹ 9rd`ñÒe¸Ÿ;Ïü¹³É>fÄTÛÖ­8þ“&O¥pÁ‚¸¸äþáuh``@¡‚¹xékÖ­§\™2<|ôˆ9sçÓ¤I#V®råÂ…KäÏŸ[LMMqw?ÏÆM›7f4ùòåÅØȘÇ3á"ìíSS²Dñ^î¤xþü7n¨__¿î¡ñ_CCCêÕ­£óý©lmñô¼ËŠ•«±±I‰±±1ÅŠQ?ðÿ‘íK_ƒú÷£}§.ôìÕ—Ç’6#×=n0eÚ Ò¦MC›Ö­4ò/V”C‡0kÎ<êÕ­MP`‹–,%Mš4¼zýZ#°§¯Æ²gï> ʤ ãpttääé˜uuM7©"… áî~Žé3gÑ©C{Þû¿géò•-R˜kׯsÍÃ__ìí5>+GŽìÜð€‰“¦P¶l"##yýæ y]\(V¬h’Ë£R©H—.-»õ`Ôˆádʘ3gϱfízœ³©G¦ê{Ý<þœå+V¡P(©R¥VVV¼}ûŽ¥Ë–chhHxÁkkkztëÊÌÙséЩ Ý»vÁÁÑ̘9)$õÕ´Ic6lÚÌè±ãyÿÞŸäÇûéSæÌOêÔvtëÚE×ÈȈ!ƒ2pðP:têBÛ6­155e—ÛnÜÝÏѳ{7‘‰q ^^ÞäÏŸï‹í¤K—N 8˜N]ºÑ¯Oo²fÉ‚ß{?V®råå«WtíÒY½Æž5dÛöô0ˆ6­[bgg‡——73gÍÁÐÐÎ:¨÷ýO³¿Ù¶}'OåíÛw-Z„¨¨(Nœ<É–­ÛÉžÝYcºÍ^=»Ñ¦]GÚ´ë@·.ÉžÝÿlÚ¼…Ò¤q#lR¦Tçïק7§Ïœ¥m‡ŽôéÕ“tiÓrñòe/YFñâŨ^­ê7\B!„B!„âsuxö+~ Àû?â`oϦõk5f,»vW§çÈ‘×U+´Ö%*V´«V,cÒ”©tëÑKž/o^Öº®Ô¹ŽQb›0I爖ƒ†¨ÿ=p@?räÈÎåËWX°p1M7Òa1mÊ$êÔÿ‹^}ú±Çm‡Ö´m?ÂØÑ#éÑ»'Mb¦ù=jåË•åÔé3,_¹ŠK—/³sûV–,ZÀ¨1céÛ ÑÑÑ@L@¢Bùr,˜;秔9).^ºÄð‘£µÒ7nÞ¢õhjjš`oì˜QL›1“y R©dêä‰êÞl_ú*[¶ ‹ÌcòÔé4l܈ N–)]š ãFk† Ì;–.[ÎÒeË177§KçŽdÊ”‰ëDDD$¹,¥J–``ÿ¾Ì¿ZÆ2eÊȲŋhÔ´™º %E‡vm¹uë6»Üv³Ëm7æ´kÛ†~}zóÎLJÝ{öR¦\Eny\UÆЯO¼¼X³n=kÖ­b‚;ãÆŒJrY”J%J¥’¢EŠP²Dqz÷éG@` ..¹Y0oŽÆT¿ú^w}{÷"22ŠÅK—2uú õ~rçÊÅÒÅ µ¦ÊìÚ¥3fææ,]¶œæ­Ú1Á´ Ê3fÔ¬­­“|¬¦¦¦¬]½’QcÆ1}æ,õh¶Â… 1iÂ8­)“ÿlPŸÈÈHfϧ¾W[[[Ó§wÏ׌ D¡P`÷•µúÔ«‹¥…sç- cçOSWÚÙÙ1 __ºtüØÑdÍ’…U®®ø÷ :Ý9[6-˜§s°·gýZWfΚÒeËQ,V¨¿i“ÆôíÓKcêÎ’%J°jùRfÏǘqÔé©R¥b@¿¾têØ^£,ÎÎÙX뺒Q£Ç©û cccêԪɘѣ¾9À-„B!„B!ÄIbŸ†è‘f ãßñ_þ7§¡ŽFñþkïµq¼×Fñ¶›Ä{mûÿß&Ÿ½Nñ! pî—ÞÖ&%‰qøÈQjT¯öÍ'å{øðáïßûcck“¨õö||}  &µ}jõ—ßÝ›7o‰ŽŽÂÉÉI#ÐŒµu ­‡Éáááøùù­P.mZõ(ñkµ¯7oÞòñãGÒ¤qüjÐ& €÷þþ8¥sÂÂÂü»–# 0ÇŸ`eeE®œ904ü~3âïïSºt˜›*whh(¦¦¦Zë´Åñ÷÷'0(›”)±³û~s_CÌŽ/_½ÂÄÄ„ôNN æÓ÷ºS(øùùòGG‡¯žS¥RÉëׯ‰ŠŽ&mš4Ìï!((___R¥²ýj*•Ê˜uK•JÒ;9é\·î[„††òæÍ[Ì-ÌqJ—î«°¸~#UªT_û<::š7oÞ`llBš4Ž_m¿aaa¼yû[›Dµ-‚ƒCH›6Í/û#!„B!„B‘4;vì jµ„ã)©lmú!@t쟈úìuüÇmWÆ{­ˆ} ¨â½VÄ{­ŠM‹[cæó«ø‹ÿõçÛâçILš àýŸð„B!„B!„B!~5ÀK0MÃ÷ò!„B!„B!„B!„øfÀB!„B!„B!„â"Á÷–,Q‚ôéÓcnnöÓÊû³ÄÿÎcfn†ƒ½=… ¤qƤK—Vç{ô9§¿KûB!„B!ÄïIx?™——7FFFÔªYˆ™véÙ³g¬\åÊÆM›Y¾t ¥J–ø©eºqó&yrçNîªùåÊ"~žðˆp¼¼½É–5+EŠ 2"/溺X¹šÍ[¶±qÝòæÍ“äÏ(ðG~ŒŒÌu·nßF¡Pè5Ä‚¥‹þò$Fpp0Íš·ÂËۛʕ*R¸p!ž={Î.·Ý\½zm[7é â>s€YÓ§%ꜜ9s[[[–,Z€±qòu;>|àٳ稔Êd+À¡ÃGèÕ§9²ggÄ°¡XZZ°ÿÀ¿Lœ4… À z÷ê¡‘â䩬߰‘J+У[>††²qãf:têÂê•Ë)Sº”:ott4mÚuàþýüÓìoþÈŸ—¯^±Úu-Íš·dïž]8ØÛk•ÉûéS>‚­­-6n¢k—N:§sü‘eyþüÍš·ÄÀÐîݺà”.×=n°~Ã&>|Ìúµ«5‚&úÖã¢T*iÛ¡7oÞ¢A½ºïÜccc®]÷`ÇÎ]\ºt™=n;°µµÕùþÇþ”r&//o ©Q½Zì÷çÌ_°ˆÅK–1~Ü­@º>çôwi_B!„B!„ø}I/ØÙ¥bʤ içÎ_ }ÇÎ 1ŠSǨÓoÞºÍ{??*W®À­Ûw¸|ù *• {ûÔüõg­ýûøúrö¬;>>¾X[§ H‘"¸äÎ¥•ïæÍ[¼yû–'O¼H•*GWoKÚŽÂ… i½G¥RqåÊUîxzM–Ì™©P¾æææ:5 0³gÝyõú56)mÈŸ?/ùòæM–²¼xñ‚ó.¢P(É—//äÏ÷]Îç‹/¸ÿà!Å‹Ã&eJ^½~͉'ùøñ#¶¶¶Ô¬Q]ëÁ­Ÿß{ÜÏã©lmùãüäÎ¥}Žž<ñÂËÛ›ŠÊɱã'xçãC†ôé©\©¢ÎcU(œ;gÏž‘:uj*U¬ˆ¡¡gκ“-kVœ³}ó9½rå*ïÞ½#EŠäÏ—OkŸŸ»rõäÈ‘,™3'˜¯H‘ÂZ×Æî={8x(3gÏÅuÕrmáááœ9ëŽ÷Ó§˜“/o^Š+ú]FFDDDpúÌY^¼x‰‰)Ù³;SºTI­|ÁÁÁ\¼t™b®å‡©·+VTkM¤3g݉ˆˆP¿¶´´Ô|¨ëíÊU)[¦ Úçãùó{{ , Q6ˆ¹'¥JeËÉS§5>?gŽZ£dôm_?áÒåËãèè@…òå±·O­•ïä©ÓxÞ½ ÀÝ{÷5î1Ÿ×_|þþþ\»î‘¡¡ú>ü-”J%“¦L%½“;¶mÆÒÒ€ÆÒ¢u[–._A³fMqtˆ•ùÄË‹›6S³FuΟ«ÞOƒzu©V£6“§LãÀ¾Ýêô»Üðô¼Ë˜Q#hÕ²…:½x±¢´lÝŽ%K—1z¤öÔ;Ý022bØA 6‚3gÝ©T±‚Fž]–¹ó·ê>«á_â`oÏ‚E‹9rô5ªWKR=ªÄÜ#OŸ>Ãc//ìí)_®©SÛ%ùœ^»îÁÍ›·hÒ¨!S&OT§7jøÒ§göÜylݾƒ.:ª·Ý¾s‡·oßiì§|¹²˜™iÂ{úì=Nðó3fÌ ³ÿHìµç{·õ8©SÛ1}êdõëÒ­G/FŒM–L™(V¬h’ÎéïÒ¾„B!„Bñû’Þ/¢LéR.\ˆ+W®òêõkÒ;9°ÿÀ¿¸®YË©ãGزmË–¯Pð155Õ àmܼ…ÉS¦allŒs¶¬¼}û__ê׫Ëô©“5F¿,Y¶œcÇOpùò._¾¢ÞVºTIÖ­Y­±oºvïÅuÒ¥K‹••ÞÞOqp°gù’ÅäÉ㢑ϾýŒ3Ž?boŸš?NåJ™?w¶F€èG—eûŽŒ='''Þ¼yCÿþü.çîá£ÇtëÑ‹©“'ac“’þöišÔܹrQ° ­úõŽnŒ;CCCœÒ¥Ã×ÏÚµm£D8pð ó,bÕŠe 1 …"…BI@@Y³dÁmç6R¤H¡ÎDë¶íñô¼‹MÊ”X[[3yê4FN^}èÓ»'½ztOr=îÞ³—ÑcÇ.]Z‚ƒ‚ññõ¥A½ºLû¬}Å7sÖ®]¿ÎÀýèÚ¹“^õÛ ~=FË£Ç4ÒoݾC·½ðóó#KæÌ„…‡ñúõŠ-ÂÒ%‹°I™2ÉçôÞ½û´íБ€€@2dHOXh>¾¾-R˜µ®«4²¿|ùJc-·ÑcÇiìk˦ UgðÐaøù½W¿Î”)#'ŽÖ*Çww–,]ΔIhÒX{­Æ‰S¦râÄIvnßš¤zqÛ½###­éëÕ­Ãü‹8ë~_??ìíµŽ oÿ¯+U¬ÀŠeK8~ò$“&OUo ÖzÿÐÁƒèØ¡úµ>íK¡P0vü6oÙ†­ éÒ¥åé³g¨T0aÜ­{cÿƒ `ÃÆMlظI½­_ŸÞ Nyïþºõè…©©)woßHr›ŠãqãoÞ¼¥Oïžê €­[¶àòå+?~’š5àðá£(•JÚ´j©±ŸT©RQ·n6lܤ½ ðïÁC˜››ówÓ&ùK–(AŽÙ9xð°VO¡P°k÷J•*I½ºu˜8y*»Üvkð~dY¢¢¢8zì8Å‹ÓúÁI«–ÍY¸x VXô­ÇøÇúwó–<|øˆ”)­yûö¶66¬[³Zë~—XïßÇ\ËÙ²iš[¶hN±bEÉ•3§FúÊU®ø÷ Fšû铤M›Fk‡aæ¬9 ~~ËÍ;z¤Æ1êsmÄùÞm=!¹rædÞœYüÕ¨) /a­ë*@ÿsú»´/!„B!„Bü¾ “»âCƒ˜Óaoڲܹbú­r]ËÚuë3jî§Oræäq¶mÙ¨ñþ+W¯1vÜŠ+Êù³§ØµcçΞ¢kçNìÝ·Ÿå+ViäŸ7g'Å êÔ®Å-«ê¿¸‡ðñ :œ7o2îlΞ:Á¡ûØ·gŠhÝ{ö&22R÷ö; 2Œ\9sröÔ .ž;‹ÇÕËôìÞ'O1eêôŸV__ÆŽŸHúôNœ>qŒ“Çãqõ~~~ܾsç›Ï[®ØstñÒ%N³¦M8rèÎaß7räÈ®ÎÈÈÑcÈš% çÏžæÈ¡\¾àN•Ê•Xíºû62Œi £ÆŒeüØÑ\:ïΕ‹çhß®-ÞOŸ²aÓfüó,ÄÓó.½{õàÚ•‹œ:q”Q#†3vÜ6–”züøñ#ÃGŽ¦Bùr\½tžÃÿîç¼ûiæΞɞ}ûqÛ½ç›ëR—À  ÂÃ#H“æÓƒíºtíŽJ¥bÛÜÏ™“ÇY0oW¯]WoR 1ŠÐÐPöíÙÅñ#‡8ï~šAûsõÚu\×®Ó:ÿ·<®ªlû÷ºi´ßÂ… jíÿä±£êí3&¼^ÞßM›```Àö»´¶ùøúrúôòåÍ«žTŸzyýú >¾¾¸äέ3ØY¼x1”J%·oÝÖ8Î[W©Vµ W/×8Öø£²Zµh®N·µµåüù4òÞò¸JÛ6­Ôùõm_«]ײyË6ÚµiÍ¥ îìÛãÆÙÓ'ÉŸ?C‡Ô±tþì)õ( ±£Gj”£KçŽü,žž÷ÈŸO{pþØQÁwïÝý”?vÔ`¾|Ú#—ãFß½{/Þþï’3GvLMMuäϯŸ¾~~éîçÎãããCÝÚµ155¥zµª?q’À  ͲÿÀ²xy{FþüÚû¶³³#½“ÓgûÖ¯ãlÜ´…Ò¥Jâqõî§O²lÉ"™3o~’ÏiŽÙ100`§›¯^¿ÖØ–2¥5ÅŠ!eJÍõgL›¢n_û1I—Nyp÷¶Æßí×)R¸0æZÓPê{m$‡üùò‘=»3—._!<<Hµñ›´/!„B!„Bü¾$€÷‹xüø 7nÞ$sæL8::ªÓÓÄþ{ÃÆML›2‰–-š“6mœœÒiME¹vÝzT*CÀÊÊ ˆùµxß>½HÚN+Øcff†¹…4´´´Tÿ}>——·7§NŸ¡nÚÔ®USž3GºuíÂËW¯4¦Ç[íº…BÁÌéSI—.mÌgÓ§wOþlP_k²Y–#GŽA·®]Ô£,,,˜êüï||H‘"bòÇLÅI@` ±éûüKÏÞ}Y¼$fT‡ÏòÇÙ±sfffÔ¬Q-¶ÎkÉš#Ä~dYâ× ÀœyóéÙ»¯zªSGÞÆ+·¾õ'SÆ ôïÛGÝfªT®DöìÎxzjcË9[6:uhÏãÇO¨\µ:uaÝúçôwk_B!„B!„ø=I/øúùѳw_õk###J–(NßÞ½(ôÙt{q±<]S–}Îßߟ¬Y³èÜfgg§Î“”Þ{ÿ˜5~fΚ“àZ<~ï?­éåç÷^cêÈïIß²1#>g›Êö›x1 H—6-©SÛ}5çÂÅKXµz ÁÁÁaaa¡¡Áߣ«ì†††êõ‚‚c¦»K©c:D]ë*é[6)S²bÙbFŒô3™6c&ŽŽŽT­R‰6­[á¬cý'}9;g£RÅ (JV¹®!Mš4ü»ÖqkNýÓ²u‚ûòû,€¥cÇO0qÒ^¾z…¡¡!˜˜˜|—›úªZ¥2ööìÞ³—ýûbddÄÅK—yþüm[·ÂÂâÓZ’úÔKÜûâ?´Ž/""R#ߦOûzÿ>æš=qâ$¥NœLà8ß'ês¶¸€WdT”+[ë”ÖDGG£R©4‚ª¦¦&DEE`—*åÊ–ÅÄÔ &°Ì§ †©I̾ãògÍ’…re˪§ ŒTçÿ4Âqß¾ýDFFR¥r%‚‚‚Õé•*V`ç.75í~dYâê%.Á‚°´´$S쳑‘‘#3õ­Ç86:î¥ßg2‚’%JP²D ”J%wïÝãС#lܼ…½ú0kÆ4Ô¯÷ÍŸqøÈQfÍ™GãFѹc­íÿ¥kããÇÀ§@ž>çôwl_B!„B!„øýH/dHŸžíÛb¦³424ÄÆÆæ«Sh9ØÛu¿ÆÆÆk–Å÷ wc“$•ÙÔ$æ}=ºw¥R… :ó¤J•J£,?*Ø¡oYâF4*•*­|qó¾{‡¯Ÿ£-[·1wÞŠ.ÌÔ)Éš% 7hÒ,q£Ô·^ž®cŠŠÔNÓ·!æõñ#‡¸ã鉻û9ÜÏ]`ë¶lß±‹åK©r&U¾¼yéß·OLùÌL™¿`Û·ï¤c‡vùLb˾xáüÒ_Z[îKž<ñ¢G¯>¤NšukVS²DqõˆF—|¾éø’ÂÈȈƲdérNŸ9KåJÙ¶}ÍãMŸ©o½¤M3µí›7ouæ‹›z.]:ÝSlþ‰m_qÇY±ByébuÕů&î¼øùùâ’;®«–«·Å‹øÓ(;88pûŽ'¸¸äÖÈŒutŒÙ§……9ÖÖÖêÑ—ýÙ@cêQ?ߘô4ñö¿c§ÕYÞ]n{Ø¿ï/‹º^bÓ? æëç§Qn}ëñg244$_Þ¼äË›—úõëÒà¯Æ,[¾ò›xžžw8xÅŠeâøq:óü—®Gcbb¢ž®WŸsú;·/!„B!„Bü>$€— ÓW† éyõê …B+ øúÍ \ïêk2eÊÄNÇYðëAŒ Òóúõ”J¥ÖtŽ/_¾ÄØØD稰Q–¸Ñ‡>¾¾êõøâ¼zõ:IeHª#G0cÚéEãÖúöö©122R¯YßÝû÷µÒô­ÇøâNwíÒ™ûдY .ZúͼøºuéÌ¿1gÞ|*W®¨¿ì©lmõ.û×;q…BA¿>½(]ª¤:ÝÏïýw øêãï¦MXºln»÷P¬hŽ=F©’%4êDßzqJ—;;;î?x@HHˆzúÄ8×=<044$ÿgSÏþ _k_3fˆÂ.⻟ÿ-ož˜õÊ<ïÞÓº^nß¹£‘ oÞ<?q’{÷îk«:¼5Ðò¸¸pû΢££µÖö»}Ç{ûÔêÀǹãéIùreu—¦N›Áî={èß·7†††?´,ÎÎÙ033Ãóî=­rðòåKi¤õ­Çéø‰“¼xù’¶­[imË™#NNéxùêÕ7}†»õÀÑÑ‘Å ç'¸nãåÚxðð!OžxQºTIõh7}ÏéïÒ¾„B!„Bñû’y}þ”/WŽ°°pŽ?¡‘þòÕ+nÞ¼E±¢E±°°ÐØ÷à,4,ì‹û.^¬(æìÞ³…B¡±íÖí;Ì_¸H=bb~ýÿñãGÎœu×ÈûñãGj×û“¿ÿi¡õ?ª,ùb(_º|Y#ï•«×ÔÓkþ,ÊØ)/---?¥)•¬[¿1æß e’÷mbbB<=ïjŒª fó–mß\/]bÒ”iZysçÊ…“S:õšAºô8˜ê5ë°uÛv½ŽgòÄñDFF2dØ”ÊOuS±ByvìrÓzßž}ûY»nC‚Á¶/ÈPÅ~Nüs°fí:J…Î÷%¶ý&E†ôé)[¦ gÝÏqøÈ1"""hÑü­|úÔ‹õëÖ!**Š5ëÖkä½|ù ÷î? téR?äǺèÓ¾¬­­)\¨W®^åùóùCBB˜­»Õ©CöìÙG¿ƒ:x … Äßߟy Êø±£ZYªU«Êä©ÓY¸h éÒ¦¥PÁÜ»ÿ€ÉS§“9s&üý?ü´sT¤p!ÜÝÏ1}æ,:uhÏ{ÿ÷,]¾’¢E síúu®yxàã닃½½:ФíÛÒ·ÿ@ZµiG“&040dÇÎ]T­\ ×ØT}ë1:*×5k ¢M«V¤¶Oóà~ß?~ÂàA,׫W¯ñòö惞ÓÂ… ÑüŸflÜ´™Õ®kÕSi–)]Šre˲s—)­­ù³A}LLM8|ä(‹/¥l™Ò´iÝRç>mmmø÷àAÒ¦qÄÌÌ cccjÖ¨Ž……E `ùÊUd̘CCv¹íæÅ‹—äÊ™o/ož>{Fº´i5Ö@Ê‘=fÍÇi3fÒ²ù?àë燩©©ÆÔnGŽ#,^)nzÛ={÷©Óò¸¸h­!Ùìï&œuwgÁÂE8::R­j­cÓ·^ºwëÂÁÃG˜¿`>| XÑ¢<{þœeËW`iiÉð¡ƒõnƒI¥oû8 -[·¥u»Œ6„—ˆ§T€IDAT9²óìÙsæ/XÈϻԪQ]ë3²gwÆÀÀ€uë7`—*666|øðׯßн[å ÃËÛ[c}¬oaddÄÁ8x(:u¡m›Ö˜šš²Ëm7îîçèÙ½›Æô§9sä qÿؾsffæÔ¬Qàà`–.[N@@³gN×ØÓ&Ù°i3£ÇŽçý{ ü‘ï§O™3w>©SÛÑ­kÌqFGG³wß>)Y¢¸Î²6hP×µëpsÛMÙ2¥XYâôëÓ›ÓgÎÒ¶CGúôêIº´i¹xù2‹—,£xñbT¯V5Éõø#õíÕ“k׮ѥ[OÚ¶iEáB…011áѣǬv]ƒB¡Ðh_×=>Ú9êЮ-·nÝf—Ûnv¹íÆÂÂœvmÛЯOoÞùø°{Ï^Ê”«È-«Z£%£nÚ@Ì;v‘>½C‡ ÂÖÆ׵봂‚úÔcÙ²e˜6e -Qܘv7tð :´oûCêlЀ~?qBk*ÍÅ ç1yê46oݦN¦H‘‚æÿüÍà 3¤OÏÀþ}Y·aS¦Í ::¥RI±bEÉ>=ÅŠ¥{·.,[¾’†›bhhHµªU˜5c:ÿ<Șq¨Z½«V,ÓxhÞ¸QCÜÏç𑣸»ŸbÖiú|¤Ü¸ “4F6Æ0hˆúßôÓ àU­RG^½~Mïž=\7SŸz±³³có†uŒ7žõ6±vÝ f ËqcG“3GŽrNuÑ·}+Z„U+–1iÊTºõè¥NÏ—7/k]Wê¼ßeËš•ýû²pÑúŒ NQ°@x?Ÿ êÉì¹óÔ÷jkkkúôî©sݲñãÆ`eeÅÖíÛÙ¸)fýÔ éÓ³hÁ<Ê–)­‘×ÔÔ”µ«W2jÌ8¦Ïœ¥¾÷.TˆIÆ©GTžçôwi_B!„B!„ø}%vˆi:þÿõçqO uüÛ0Š÷_Ãx¯ã½6Š·Ý$ÞkãØ¿øÿ6ùìuŠs¿t𶱿ˆÿšÃGŽR£zµo>)ßÇxÿÞ[›DM§T*y÷·¨¨(ììRi­‡õyÞׯ_MÚ4i¾h áÝ;,--µÖ û™e‰ŒŒäÞý R‘3gŽ$Ⱦ—€À@üýýqJ—sssuzhh(¦¦¦ ®o”TÇOœ¤K·Œ5‚V-µ§/Õ÷œ¾ïO@@666ØÛ§N¶zˆˆˆàÕëטš˜6mÚïVwaaá¼yû†Ô©Sc“òÓ= 22…B‰……¹Î÷}üø__¬,-I:u‚¶_­^ƒ‚ðõñÅÖÖ6ÙÏ©¾íËÇ×—à `RÛ§þâô‚q¢¢¢xûö-†FFاN­1’ògR*•1ë–*•¤wrÂÄÄä‹ùÃÃÃyýæ æfæ‰ZÏ4((___R¥²U¯ú½üè²øøøBÚ´i°²²ú®õø#EEEñîÝ;ÂÃ#pptиw$}¯_…¾çôwi_B!„B!Äÿ‹;vPµZÂñ”T¶6} :öOD}ö:þ¿ã¶+ã½VľŽTñ^+â½VŦŭáôù¿U üʼnÿúómñó$&MƒðþOxâ÷tïÞ}\×®£r¥ŠÔŒ7MÚØñÙ°q[7oPO)„B!„B!„BülÀK0MƒL¡)Äÿ‘tNé8}æ GçÝ;2gÎÄåËWؼe+… ”àB!„B!„Bñ ³v¡¡á7îQ!„B!„B!„?“<Ùâÿ˜ï„B!„B!„Bˆÿyº/„B!„B!„B!Ä/DxB!„B!„B!„BüB$€÷óññáÙ³çÉ] !„B!„B!„Bð~c¥JõšÉ] ÂÃÃؾ•J%QQQ?lß …⇕ýW¦ß9ŠŒŒüae‰ŽŽF¥Rý°²DDDèµïÿjз^ôÉÿ+] …â‡ÝÄ÷ó#ûððp”JåÛ¿>÷ŒMŸzŒˆˆø¡õò«P©T?´}ýh¿KŸô#éÛè{müÈï?ú;B!„Bˆ_‡qràwÓ acR¥JÅšU+4ÒŸ>{Fç.Ý©X±ÇNîb&‹G3}æ,ο@dd$¶66Ô¯_—ýúbee¥‘¯G¯>`ee‰““¥J–à¯?`ii©sÿÛwìd݆½z’)SFu¾›·n3hðÐ/gÝhP¯®úuXX8«]×°}ç.^¿~‘‘Y²d¦U‹4û» ††š¿OP©T¬Y·žµë6ðòåKÌÍÍ)U²C‡ Â9[6­Ïûøñ#3gÏeïÞ}a“2%uêÔbÈ íb®r]æÍ[yùò%†††äÏ——~}ûP¶LéiùÊUìر‹,Y³°|É"yª×¬óÅz)W® £F ´Û—¡)¬¬È’% 5ªW£ZÕ*h¼ÿíÛwÌ[°“§Náç÷+++òäq¡G×.”-[&Éç4Nb¯ÏÏÕÀAC¸}Ç“Õ+—‘!C­<ú´õ¸}nظ‰›·ðä‰*•Š éÓóן èÒ¹#æææê¼ñëÑÐÈkkkœ³e¥RÅŠT«ZE«m%åž_@` :v&88„%‹h´G}Ë¢‹ëÚulÞ¼•Ò¥K1vôHm 6&,4 3s3ìí)T¨ 6$]º´y_¿~CÛö¿øYÇ ¡b…òZé‰iëø~ ¾š6kAtt4£G×Ùn!&5oÁBöìÙ‡¯/FFF)R˜!P ÀI®—8úÜ3tŸ>½{R§v-­íIi_úÔcHHó.fÿñññÁÐÐܹsÑ®Mkþú³FÞÏû$#c#lmlÈ•+ýE¾¼y,cÏÞ}yøð ê×£G÷®:Ï}\Ÿ”ÆÒ¹c æGH·nÝN0oJ›”ìغY#ÍýÜy-YŠ‡Ç ¢££±I™’ªU«Ð¿ooÒ¤I£³,‰é×oØÈú ›¾XöåË“%sf­z411ÁÖÖ–<.¹©W¯.äϧóý?ªOÒ··mßÁÊU® æÓ·OÒ÷;>ý#è×€~×FÜþõùžqõÚuæ/XÈÕk׉ŒŒÄÎÎŽ:µkÑ»gw­þ"222æ^±e¯_¿ÆØؘ¬Y²Ð¶mk7üK«o÷õócî¼?q?¿÷¤H‘‚üùòÒ«GwŠ/¦Î÷ùug``€™¹NéÒQ¶Li7j¨U/B!„B!~ àýd^^Þ88k¥GFFâåí‹Kîä.b²xþüÍš·ÄÀÐîݺà”.×=n°~Ã&>|Ìúµ«Õ'Â#Âñòö&KæÌ.\ˆ?ây÷‡aÑ’e,]¼PëØŒ™³Y¶b%iÓ¦¡S‡ö˜™›qôØq¦NŸÁƒ‡™1mŠ:oPP^ÞÞ,X€lY³ê,¯±ñ§KgÛö 9çlÙèÛ§¦¦¦œ=ë΢ÅK¹pá[6­W?dÀËÛ›bE‹1cFûN™ÒFýï7oÞâåíM­š5°°°Ð™ßÈèÓ|Ÿw>xy{S­j¬­­µò::8¨ÿ­o=úøøиI3ü?|àŸfã’;7nÞbÇÎ]ܼu‹}»wi<Ô¼ÿà7o©‰)-[4']º´Ü½{»Ü8}ú ÿîߣúÙ¥²¥ZÕ*:ïÁÇœ:}3SSušR©¤O¿þœ8yŠjU«Ð¡]BÃÂؽg/£ÇŽÃËË‹‘#†iìgòÔ鸮YKõjUéÙ½oÞ¾aµëZZµnÇ¿öbkó©Þ###iÓ¾#wîxÒªe rçÊÉ­[·Ù´e+Ï_¼Ô ÀOœ<•õ6R©bztëÂÇÐP6nÜL‡N]X½r9eJ—Ò:.¥RɺõÀËÛ›G“#Gv­| ÕKpH0›bƒ2qâÚW‰âÅÉ”)#J¥’÷ïßsôØqöìÝG‹š1nìhu~þþ§~ïßÓ¸QCræÌÁÛ·oÙ²u;í:vfÑ‚yT¯V5IçTßk#þùž2u:çÎ_@¥R‘ÀÈ}Ú:ÀÔé3YµÚ•Úµj2°?Œ9}æ, -æö;¬\¾T«‹-Búôé àØñ“ìØéFáB…XºxvvvêüúÞ3>7rÔnÆ>@ŒÐ<^}Ëò¹;žžL›>“èèh²eÓ.›——7†††Ô¨^ˆˆž={Îü‹X¼dãÇ¡I£†ê¼QQQxy{“!}zÀñ¥²µÕJKl[קˆoÿyøè¶66lÙ¶]gO©TÒ¡SW.]¾LåÊ•¨T¡oß½eÍÚõ´hÝ–m›7’'K’êô¿g@Ìö¥Ë–³aãf A:ëTßö¥O=* Ú´ë€çÝ{têØžbE‹Ê–­Û4d~~ïéÔ±½zßq}R½ºu077'**ŠW¯_³yËV6mÞ¬Ó¨WW;¨âýô)‡ÁÖÖ– 7ѵK'΀vŸ¤Kz''õ¿‹)L?ظy FÆšû?~â$ÝzôÂÅ%7Ó¦N&µžwï²dérÎ_¸À¾Ý»°m¿úöÙ²eKð^}òÔi¼Ÿ>Å2^¿o751áí;6mÙŠëÚu4û»)ãÇŽÖ¸7þÈ>Ißz|þâ%^ÞÞ´ø§™ÎaÄ¿ëÛ'éûGŸþôëô½6@¿ï'Nž¢[^˜˜˜Ð¸Ñ_ñ®Ó\¹r•Í×iÔå°á#Ù³o?eË–¡}Û6„…Ç|ç6|$Ïž>cà€~ê¼?~¤eë¶<}úŒ†ýI¾|yyóæ-[·m§e›v,_ºXýC‹¸¶ž-kVŠ) ÄÜsnܼűã'ضc'Û·lÂÌÌ !„B!„¿.†:þŒˆ &€i¼?3À°,+ 2öÏ°‹ý³4€Èdœì@n (Š¥r@E *P¨4Í€@ ÐçC@ êK‰uèð‘¯æÉW °ªRÕêZé>T9çtQõîÛ_k›¯¯ŸÊm÷ÕÒå+T[·mWÝ»ÿ‹Ÿñ! @uäè1Õú Un»÷¨?~¢3_«6íTÎ9]T*•JõâåKÕú U«]ר.^ºôÅý+•JÕ‘£ÇTGŽS&¾~¾¤ß€Aª¹óªîÞÓ<¶¹ó¨œsºhÔí­Û·UÎ9]TC‡ÔÈ{ðÐaU¾…T%J—U}øðA~ïþ}UŽÜyU*UÕHŽŽVuéÖCåœÓEuúÌYuúÖmÛUÎ9]T7mùj¹£££UEŠ•T•­PI¬±­S×î*çœ.ªkׯ«ÓV¬\­rÎé¢Ú½go¢ê¥cç®*çœ.ª7oÞ&*ÿƒTÎ9]TŸ<ùj^}ëqÜ„‰*çœ.ªm;vjä_¾b•Ê9§‹jÉÒeé»vWeÏ•GåéyW#}ÕjW•sNÕâ%šùu SU­^KÕ²u[•R©T§»Ÿ;¯rÎé¢;~¢Fþ?ªJ•)¯rÉW@¡q¬ÙsåQ 9Z#ÿñã'Te+TR=v\#}媘ó´gï>ô©Óg¨ª×ª£zõêµ:íñ“'ª¹óªzô꣑×ßß_U¤XIUíº tÛ™³gUÎ9]T;w¹©rºäSM™6=Qç8þ¹.^ªŒÊßß_–Pûòó{¯*]®¢*{®<*__?uú¬9sUÎ9]TÖÈûΕsNUó–m’|Nõ½6†¥ªZ½–Ê9§‹êïZ|µ-ëÓÖƒƒƒU9]ò©6ù[k[ï¾ýUÎ9]Twîx~±###UsæÎW9çtQµnÛ^cúÜ3>·uÛvU¾…UÝzôR9çtQݽ{Oc»¾e‰/44LU­FmÕ€ACTÎ9]T]ºõÐÊ£«OºÿàªRÕꪹóª._¾¢NúôY‚ýÔ—$¶­ëÓÄרi3Uƒ¿«&NžªrÉW@õ! @+Ï¡ÃGTÎ9]T ÑH¿qó–*{®<ª6í;&¹^T*ýî6nR5ø«±*§K>U¹Š•U3fÍùbûÑ·}éS'OV9çtQM›>S#odd¤ªl…Jª‚EŠkÜ{ê“®^»¦rÎ颪^«ŽÎ2͘9[•Ó%ŸjÇÎ]*çœ.ª'OiåI¨OÒ×ÖmÛUÙsåQ]ºtY#ý¯FMTyòÔúÞ²qÓ•sNÕªÕ®_-KBýcB>|¤rÉW@µ`Ñbt]õèïï¯N_¸h‰FþŸÑ'%¶G§rÎé¢ó:ûœ¾}’¾ßy¢«Ô·Ð÷ÚÐç{Fdd¤ªT™òªœ.ùT7nÜÔÈw®§Ï˜¥Nóô¼«óþñãGU©²Tù REEE©ÓW»®Q9çtQ­^³V#ÿ;ž*çœ.ª6í:h”[W[ŽŽVµëÐIåœÓEuà߃ßt>„B!„B—íÛw¨¶oßñŸ Ð'6†Ó&6¦Ó,6ÆÓ 6æS36T16&T:6FT$6f”?6†”;6¦äcÊsrŠA9ÆƤââS¶ñâV)bcY–±±-óØXWüØ—I¼¸˜Q±3]1¶¯’5ð~q;vºQ¾RFŽËÎnL™6ƒz 2yêtùwïÙKùŠU0hë7nbúŒYÔ¨]—­•ßÜÜœ}ûP­Fm–­XÉì¹óhѪ-C†H°LJ¥’n=zÑ­G/¼½¼¿ù£¢¢8zì8Å‹Ã%w.m­Z6ÇÀÀ€ƒ‡u?5kT§O¯^øù½gÓæ­êt·Ý{Q*•têØ^ýëz###ÆŒI‹šá”.]’ÊB³f3 __­_¢/Zßo®£Ÿ)¡z¼pñæ4úëOümÛ´ÂÊÊŠC‡j¤-R„žÝ»iŒj(V,¶^|¿^/sç/àÕë×L?Ncä……9]:u¤mëVù---É;‘‘‘„‡ZOfë¶зO/ü•+Wâì©T­RY#}ËÖíäÈ‘úñ¦ì2h ‡ÿÝ“Ó§örøðQ”J%mZµÔÈ›*U*ê֭ÇñòÖ¾NvìtÃÊÊŠºujS¦t)öîÝŸèuŠNœ<Åž}û>tH‚Ó2Æ—:µ üJ¥"(øÓ(ŸìÎÎtîØAc”@¾¼y177×È«ï9Õ÷Ú011¡Bùr¬[³š-›6`2e¢ê"1ƒ‚P(dwvÖÚæì3­™ÿÿ/îÃÄÄ„¾}zQ©bοÀµë׿¹\OŸ=c¤)Œ5’¬Y²$ú}‰-ËÄÉS000Ðú5¹rædÞœY(•J.^òÍÇ™˜¶žÔ~à‰—7nܤfjÔ­]‹ÈÈHøW+ß…‹—böÕ¢¹Fz?òS¦Li.\¸HPöèøÄÖ‹>÷ •J…‹KnfL›ÂÑCÿ’/ožo®ã¤Ö£¿L»Ïž]óÚ011!SÆL„„„$jý¬"… ckcCŽQ„ …‚]»÷PªTIêÕ­ƒµµ5»Üv·cŽÏÇLJIS¦Ñ¸QC­Q¢þþp°·Çæ³{Kö¸{€ÿ‡¯î?¡þQ¥RÉaÃɘ!];wúê¾S¥Jż9³°·OÍÊÕ®ëÌþŒ>)±õŒ)uŒ|N¬„ú¤ï!¡þQß~@ßkCŸïgÝÏáãëKõjUµ¦ïmß®--šÿC©’%´Ò»u鬑fiiIÞ<.„……¢Nwrr¢UË4úë/üyóæÁÂÂ"QßKŒŒ¨X¡BLÝ~ßs$„B!„"ñ$€÷  däè1dÍ’…ógOsäÐ._p§JåJ¬v]ƒ‡Ç ü?~døÈÑT(_Ž«—Îsøßýœw?ÍÜÙ3Ù³o?n»÷h}†J¥bé²ìÛ½‹³§Npé¼;ÅŠeç.7nݾóSŽÓËÛ›°°0òç×^;ÇÎÎŽôNNܽ{/QûjøWÌš$gΞU§Ýºu €’%JhåO—.-ãÆŽÖz@“X¶66 ìß—?Ô×ÚvëvÌ”xº¦ŠûÕéªÇlmmµ¦<411!S¦Œ<|ô¥R©NïÔ±=}z÷ÔQ/1í*Gö/×˃‡Y³víÛ¶!sæLÛ *Ä ýµÒ¸ãy—ܤLùéáâåËWÈ•+'öö<{öœýþå߃‡xûöÖçúúùáýô)eKǬtóÖmöìÝlj“§4Åñ¼{€|ù´ÛoÜkŸ·ßÀ  Ž;NõjU155¥nÚøøúâ~îüWÏMDDãÆO¤P¡‚ZsÂí;wprJGæLŸê¬~½º 4@ëœ^¹r•ððpJƮŘ”sªïµ1nÌ(FŽFéR%uLúpJ—Ž¬Y²p9ö¸>?VKKKòçË—¨}5Œ `Ÿ9ëþMeŠŽŽ¦_ÿAT®T‘ÆþJÒ>¾T–£ÇŽã¶{sgÏÄ" ëåÏ—ìÙ¹tùŠVé#±m=©ýÀÎnÔ©]‹þ C† :ƒCq×®vÀ;‡³3 …‚G%©^ô½g´lÑœ)“&P¿^Ýï>-¾õX¼XQŒ9ë~N#oPP0< `Á‰*ã½{÷  ¤dIí~ÖýÜy|||¨[»6¦¦¦T¯V•ã'Nôýƒ'OÅÀÀ€Añ¦ŒSºt)^¿yÓ'^é—®\ d‰â‰ú ]ý£.›·nãÖí;Œ1ô‹SèÆgiiIêÕ ÆãÆ àçôIúÔc`` ÖÖ)044äÍ›·\¾|OÏ»‰þ $Ü'}«/õúöú^ú|ψ[sP×õb``À¸1£4¦ΓDžáCkû¢¢¢¸ÿàöö?P«Q½cFÐøðä‰aaa‰þ^záâEŒŒŒ(û#!„B!„?Ÿ¬— ‚‚‚Y¹ÊU#Í×ÏO+ŸJ©dÚ”Id̘Aý?á&&&4mÒ˜cÇOpãÖ- *¨ÎÿÄË›ÈÈHŠ)Œi¼õÂêÖ©MÁ‚H›&ÖgDDD0h`uËÒÒ’Ö-[påÊUîÞ½«µ–Ä<\èо€ÆzWIåã㳯Ø5«æ̛ϓ'^4¨_jU«ààèÀƒµ/;;;R¥JųgÏÕioÞ¼b~‘ü³œdÁÂŘ˜˜0gÖ u›~÷NóÞþýˆŒŒ¤AìÆêÕª2rôXv¹í¦Bùr_<Þµë7ðêõk¦O›¬s=0ˆ èøø€J©ÄÇ×—C‡Ž°`Þ\íàÊÕk¼ÿ7Ù´y ¥J–Ьû–s _¿6~æΞI§®ÝiØøoêÔ®…©©)îçÎqëöfL›¢ñðóKâFoÄ¿6’bî¼øûû³nͪ$ï#¡²øøø0lÄ(€‹Kn"""’²{²;;óøñ^¿y“àÚk_“ضž”~@¡P°{Ï^ *¨^S´níZ,]¾‚'^^í+mÚ´<|ôXkýѸþ÷ýû/ÂL¨^ô½güHúÖc† ˜4a£ÇŽ§C§.”*Y’ðˆpöîÝOJ›”L¶ïØɥ˗µÒìí¿8%»û9z÷íOæL™˜>e’Î<6nbÃÆMZé¥K•ÔÀ3n‚ÎýôëÓ[çì)S§cee¥•^ªd šýÝ4IõX«Fu<… TO­wêôŽ;Ä<àNJ½è{ÏHªÄ´¯¤Ôc±¢E©R¹ÿ<ÄOOÂÂÂQ©”têЧtº ó,Òx6mJ•,‰±‰æ×ÊÀ  ŽŸ8I•Ê•Ô÷“Ò¥JaggÇN77¼‹—.qñÒ%­t##£/ðæ/Xˆ……mÛ´Ö¹ÝÖÖ–Æ2kö\×®ÃÖÆ¿÷ï)R¸+VÐë\|Þ?~næͼïϬÓõØk K˸ëú#ðsú$}ê18(˜À  2gÎL÷n]IÚŽÛ·ï0{î| ‚ÖQôí“ôýÎsL_ïõí{mèû=#,,î{iÒGà.^²Œå+WQ³FuÚµmóżáááôé7€+W¯1jÄp?λqã&7nÜÔH«Q½Úwù¡žB!„â×–?>ÂÂÂt>_K,•JEppðWŸ ýI/dȽn;5ÒžeÕŠe”)] ˆY?­Wï~üÙ° ÿîߣò%q÷]_jsÏ bÀà!ôèÞ•Â… }Ó±ë*˪ÕkxøðöíNp„æ·ìbÖCºwï¾Î÷DG}ZkUŸ¶ž”~`ç.7ŒŒŒ([¦ŒzýºôNNdÎœ‰Ý{÷1 _õõŸ/o^ºwëÂâ%˨V£6 üA@` O½ŸÒ¸á_lܼE8Ñ·^ô½g$UbÚ—¾õøêõk6nJú é9vä :tæ¬;={÷åü… lÞ¸^«-¹Ÿ>IÚ´iP*•¼÷÷çÂ…‹L>“-Û¶³×m'öö©Ø·o?‘‘‘T©\IcÁJ+°s—^ÞÞZ£;ëÕ­ÃAµŽóKÍù‰—gκóO³¦ þbòÔé¬v]ÈáCiݲFFF0zìxZ¶nËŠeK(_.q£å>ïãS(¬[¿çlÙ(›„_~kûÒ·OÒ··lŠùÁLüõåræÈAž½èÙ½›ÞeB!„Bñí$€— ´ŒX¥Ð~´eë6æÎ[@‘Â…™:e"Y³dÀÃã†Î`ĬóvüHÌ/…ÝÝÏá~î[·í`ûŽ],_ºHï©œ~†¸‡%~¾1Ó˜}>ºÏ×Ï4‰üðû÷þP,ÞzNéxùê¯^½ÖkºÉÞ={ê ‹J¥búÌY¬X¹šºuj3uòDÌ¿°î”MJÒ¦M“¨}8Ø;è•ÕŠ¥ß4=¡®z466fÍê¸íÞÃù Q©T´mÝŠÆѾc'ìììtH>ÂÀÁCÉ’93Ë–.úê”QÁÁÁ=vœ’%Š“&Í×9]º´¤K—–þ fêŒ;ŽU«]©Y½… ÄÌÌ +++´®;GGG2fÈÀ³çÏÔi©c§ Ë•3§Ög)p‰?ušƒƒ·ïx‹Kn\W-Woó‹šÏÑñӃȻbÖìÚ²u[¶nÓúŒ]»w'ÀÛé憕•U«TNô¹´µ±¡TɬZ¾Œb%K3sÖlvíÐþܸk£HáÂüÙ > 7eèð‘T®TQ+p¢Ï9Õ÷ÚÐWbÚúñ'¹yë6ƒ P?´pΖáCÓ¶C'¶lÙFï^=¾úy?Ð9š*1÷Œ)S§ú1ûÔ©Ù¶}‡:ýþƒ˜ÑGŽãî½{4jøõuñ>/ËÓgϘ5g.µkÕäØñê|ÑÑ1kS½zýšmÛwðÇùÉ+×W÷ÿèñcLLL´ÎoÅ å™7gÖW߯O[×·àø‰“( ªT×=*ëüù Ó"öïÛ‡bE‹ðïÁÃóGþü,š?O]¶Œ2|õ˜tÕ‹¾÷Œ¤JLûÒ·W»®! 0U+—k´éòåÊÒºUK–.[Îå+WÑdhhˆƒ½=õëÕÅÚÚšN]º±ÊÕU€Û»FáÀÁCu¾—Ûöï«‘fnn®Wà涕J¥}îǬY»Ž åËÑ.ÞÈ2[[[¦M™Ìá#GYº|E¢xºúÇøÎ_¸ÀÛ·ïèß·^ÇG}]ÇþáG÷IúÔ#hîâsÉ‹Œ3ðèÑã/_bú$}¿óÀ×ûG}û}® }¿gÄÝ;^¿~­×1†„„нgo.^ºÌ°!ƒtN…ߣGéع+!!!¬Y½’R:ÖÜÓÅÒÒ—ܹ˜6e=bÁÂÅ´mÝê«£ò…B!„B|Àû…9z €Ó¦)Ó§5{^¿yóÕ÷æË›—|yóÒµKgî?x@Óf-X¸hé/ÀsvΆ™™žwïim àåË—_œ6+¾ÿ léO¿z/\¨—/_áÒåËZ¼¸_dרQ¶­[%©ü*•Š£Æ°mûzvïFß>½’»J¿™®z„˜ ^“ÆhÒ¸‘:-44”[·ïèi°Ëm7C‡¤\Ù2,˜7'Q#\κŸ#""‚Ê•*%˜gßþܼy‹~}{k*Q¼8›6oåî½{ê5"óæÍí[·Q(Zë턆…©GiBL ËÔÔ”—/_j}nhì´Wñ•yóæáø‰“Ü»wŸ‚ hä¿}çŽ:Ä´·={÷’Þɉþý´înß±‹‹—.áýô©:`ÇÏï=7nܤzµªIšv+eJk¬­­yúìÓCÄ%K—£T*5¦ „˜µ6 *Ƚûxþü…Æu£Ï9ýU®çÏc¦vJ—Nk›cì”Á/_½JԾ⮤Îåýöí;"£¢˜4EsƸ3+V­VO/§oYÞ½{‡±±1GŽS÷ñ=|øˆ “¦Ð¯O¯¯ð<|È“'^”.UR¯Ðqômëúö{÷ **ŠvmÛﳩïƒ?q;Ývk­kV®lY­~ðÂÅKØÚØ5k–¯—®zÑ÷žñ#é[êkÃIûÚHäyùò%ž±W-}ìHÀ§OŸ©ëꎧ'åË•Õš:m»÷ì¡ßÞêLIuôøqlmmÕúòÕ+”J¥Îã´°0ÇÚÚšW/õ»|Þ?Æ9v,&x^¹rE½#22’£ÇO"E üÓŸüÈ>IßzT©Tøúùa``€ƒ½½Öö„G&~NWŸ”T‰éõíô½6ôùžQ8ö»ÉÅK—i¡c¦1cÇ­P0~ìhõ¾‚‚‚iÓ®Ÿr”Â… Q´Há$•eÍê•Ü¾qMë¯C»¶lß²‰«—¾¾x°®²”(^\ç¾ãöW©bn߸FûØÏJH@@C†Ž sÇI:N}Ûº¾ýÀŽ]»077§oïžZûnݪ..¹9zì8!!!@Ì4y­Ú´cëg÷€K—cÖˆkРžÖC÷ÄÖ‹¾÷ŒIßzÌ;êðÚµëZûŠ»6â¦ßüš={bÖ8‹»ÇľëØ¡½Î6P·NmÞ¾}Çù ¿é˜ýýýyòÄ‹"… %8•`z'' ñð¸‰R©ùÝéÙ³ç1Ç™Pÿßå«WI™ÒZ爹/Q(Œ›0 Z¶hŽ…EÌHåÙ'é[>>>”«P™n=zi}×)©Ó?êÛè{mèó=£T©’¤wrâÈÑcZß©Î_¸È–mÛ Tß“ ={÷áþƒ¬\¾ô«Á;__:t…[7oHrðîÝ»w\¼tSSS2fHŸ¤}!„B!„ø62ïV¤p!ÜÝÏ1}æ,:uhÏ{ÿ÷,]¾’¢E síúu®yxàã닃½=DGEãºf-ÁÁA´iÕŠÔö©cØì;ÀãÇOc¶¶¶:ÆÇ]§¡¡¡\½vkׯ“ÞɉÙ3§é]†oõ#ËÄ¢ÅKQ(¼~ýšcÇNHÏîÝ´F°%VRÚzbû{÷p÷î=êÔ®•àË֯ǔi3ø÷à!š6iL–Ì™yóæ-'O!<<‚|ùòpÿÁCfÏžKºtiéÑ­«Ö>ô©}îžžwñ¼{WýúŽ§'ó ßØ8æ½½½=•+ULRÝëÓŸ¶jÙœ;w1fÜxBB>R¨P"Â#8tä{÷ HáÂÕÙ¼u+Ö)¬Q©T|øðk×=¸vý:2d }ÛÖDGG³wß>)™Àð½ êáºvnn»5FpÇõIº˜™™Ñ±ƒæ´q÷ŠÙ³'X'vvv4nÔmÛwÐoÀ Ú´n‰^^ÞÌœ5CCC:wÒV'¶Œ£P(ðòò&þ|‰ZƒríúõXYYáïïÏé3gyöì9eJ—¢wÏîIn_úôIúÖcš4ihܨ![·m§Cç®4oö7VVV\»~+W‘"E ­Ýø>)~½èó'1ý£¾ý€¾×†>ß3ŒŒŒ˜4a»t£U붴o×–lÙ²rÇó.kÖ®ÃÞÞžáC‡¨óïع‹ó.R¨PAž={®sJÞ2eJ«§æœ:m>>>4jø§NÖYýÙ“xëÇ>|ø•«\çÕ«×>r„  `†$Óg !„B!D2‘Þ/¬C»¶Üºu›]n»Ùå¶ sÚµmC¿>½yçãÃî={)S®"·<®baaAÙ²e˜6e -QÿòÀÁÞž¡ƒÑ¡}Ûä>¤9;gc­ëJFÇ€A1-Œ©S«&cFÒù 쎧'w<=122ÂÑÑúõêÒ¥SGœµYÞ§wOììY²tcÆŽb¦ lÙ¢9ƒöÇØ8i—Â;ž( >r´Îýb¸™™™ñwÓÆš f ¸©¨fΚ£ós]rçÒÀ{ïÿ ‹/®“æ`oÏúµ®Ìœ5‡%Ë–£X3ÀÔÔ”¦MÓ·O/S&&&¬Y½ŠÑcDZhÉRæ/ŒÉŸ+gN-˜GÎ94öŸ%sf6¬se䨱êójhhH¹²e˜4a¼VÙƃ••[·ogã¦ÍdHŸžE æ©LûûûsòÔiòæÍ“àšmqm~ãæ-\¸xIcž÷ïý„׊oßþêщ&&&8:8Р~=:wì ñ€³d‰¬Z¾”Ùsç1fÜuzªT©Я/:¶Oò9Õ÷ÚX±j5—/_ÑÊ3gÞ|õ¿»wë’¤ž‰‰ ×­aÞü…,[¾’ù ```@ÉÅ=r„zí°øâ®S3332dHO×Îèر=¶66z—á[ýȲ2gÞ| °µµ¥`Á´nÕ2Qëé’Ô¶žØ~`glp°AÁA€zõê2}ælvîÚMÓ&cFa¯XÆà¡Ã™0i2sþË”.Å„qc°‹]g,©õ¢Ï=ãø‰“Ì_¸Hk{öîcÏÞ˜QlE NrOŸþ4[Ö¬lߺ‰3g3|ä(õè43335ü“aC‡èìãØÌÍÍɘ1ƒF›§O=¦NmÇÆ›éî~ˆ H•*U’QÇé\4±}Òçõ¢‹®ï<‰éõíô½6ôýžQ¶lÖ¬^Á”i3˜=wž:½b…òŒ1\cêÎ7o1k`{xÜÐy|K-PðnÜŒ!¸s—›ÎÛÔ¬QCã{ÒÍ[·¹yë¶ú|ÚÚÚP¤paZ¶hN…òåB!„B‘<¾þóà„ó%”f ãßñ_þ÷dÇPÇ¿ £xÿ5Œ÷Ú8Þk£xÛMâ½6Žý‹ÿo“Ï^§ø8÷Kok“2Q•tøÈQjT¯öÍ'åsøûûã”.ÆCšÐÐPLMMuŸÞ¿÷' ¿ÿ•ùøøBÚ´i]‘T*•Š7oÞI†ô铸û©T*|||ùø§tNêi¾’Ktt4oÞ¼ÁØØ„4i¿º–Rpp0ïÞùÒ&¥Î Íç|ýü ÄÑÑ‘”)­¿˜7<<œ×oÞ`nf®sÝœ_YXXoÞ¾ÅÖÆFg0ãÿ…R©ÄÇÇ—?þ{Œø>~d?È{¿÷¤¶OýC‚±úÜ3~4}ê1::šW¯^£BEz''‡ûÿo>|øÀû÷þ¤J•ŠÔ©ÿ[÷»_¥OR*•øúúò14”´iÒ$zšì_¾ý€¾×†¾ß3üýýù@º´iÿSõ(„B!„øÿDXXØ7=Q©T«×hOÌ„;vPµZÂñ”T¶6} :öOD}ö:þ¿ã¶+ã½VľŽTñ^+â½VŦŭ»ñù¿U ü©« ÞëÏ·ÅÏ“˜4 Àûð„B!„B!„B!¾' àýÚ<ïeB!„B!„B!„Bü<ÀB!„B!„B!„â"Œƒƒ=–––É]ñð!€4i177Oîâ!„B!„BñŸ"#ðþÏ :‚*Õkªÿz÷ÜE"$ä#Uª×¤e›¶É]"##Q(‰Ê{êôª×¬Cáb%¨X¹¥ËV _ÂÜ»w_+oXXC†àBE)[¡å+U¡hñRtëÑ+¹ù—žè¼ …‚ÈÈÈä.r’Ê¢OûŠ«•J¥Wþ„ܾãI•ê5Y·nÃO©›ˆˆˆDç]´x)Uª×äè±ã?¥lÿJ¥’èèèDçOÎö¥oY6lØD•ê5¹yëÖw®5!„B!„B!þÿɼŸ¬AÃÆ#ä HaeEÎœ9ù»Ic ,ðMû9b(ÁAÁ´lÓî‡C•ê5éÚ¥3M5LT~cªV©Œ££Ã)ObDGG³båj¶lÝƫׯ144$þ|ôéÕ“òåÊê|Ïû÷þôèÕ33S@–Ì™Q*•ãà },³çÎgç.7*U¬@Ý:µI‘"!?’ÒÚú§ï°£ˆŽŽfÆ´)?ý³ã{ôè1ÓgÎâÜù DFFbkcCýúuЯ/VVVZùŸ8ÉÂEKð¼{¥RIÆŒiÓº%mZµÄÀÀ ÁÏq]»ŽÍ›·Ò§wOêÔ®¥µ½zÍ:_,g¹re5bx’Ë¢P(X庆M›·òòå˘ö•//ýúö¡l™ÒZŸȬÙs8xð0˜™™Q®l† LæÌ™¾¹¥RÉN·Ý¬ß°ooo±²²¢PÁtïÚ…âÅ‹%øÞ\¹rRµJeÒ¥MûÓÊ›œâÚdéÒ¥;z¤Öö}û°|å*ž<ñ"::š4i©_·.;wÄ&eJ¼¿RûÒ·,B!„B!„Bˆ¤‘ÞOæåå‘‘µjÖb†¾{÷Ž]n»Ù±sÇåï¦M’¼çlÙÔÿþRÀ#©>|øÀ³gÏQ)•‰~……K/üîeÑÇÀÁCÙà_\rç¢i“Þ„| aÇN7:tê¼9³¨]«¦Ö{.^ºDDDúõ¡}»¶_ýŒ3gÎbkkË’E 06NÞKëÆÍ›äÉ;YËðüù š5o‰¡!Ý»uÁ)]:®{Ü`ý†M<|ø˜õkWk´ÑC‡Ð«O?rdÏΈaC±´´`ÿ™8i AAôîÕCë3|ýüXºl96nF¡P¤³,ÕªVÑ™Ì¦Ø K|ú–eâ䩬߰‘J+У[>††²qãf:têÂê•Ë)oÿÑÑÑ´i×û÷ðO³¿ù#>^¾zÅj×µ4kÞ’½{vá`oŸäzü‘¦ÏœÅÊU®.TˆÁ2eJžxy±qãfÚvèÄúµ«)R¸°Î÷6i܈&ý”r&·;žžL›>“èèh²e˪µ}ùÊULŸ1‹nÜ´™í;vqïþ}Ò¤q¤SÇ,]¶<Á² Ø_gú€ƒIÚŽ>ñrú–剗7m¦fê,œ?W½ŸõêR­Fm&O™Æ}»Õé;w¹áéy—1£FЪe uzñbEiÙºK–.côÈIªG5ƒ˜œ>}†Ç^^8ØÛS¾\9R§¶KòùŒŠŠbÃÆÍdËš•MÖj©+”/Çßÿ´dÑ⥬^ùé<¼|õJkºÙüùò‘6­öºœOŸ=ãÑ£Ç ~~ÆŒÈ+—VúãÇO¸tù2AAÁ8::P¡|yìíS'¸ŸÑÖã §ÿ€ÁÔ­S›Ý{öêØÆÜy È›7;¶nVßÚ´nIç®Ý9qò×®]Wfü•Ú—¾e‰c€!!!=v_??2gÊDåJ5ú9!„B!„B!„& àý"²gw¦h‘Âÿcﮣ›Xþ‡¿ëF…Ò×B¡¸»»sqwwwwwww)îNq—â-P£F=Ùç´K—¤’¢ßç7¯sr.™nfg&“Üýdf¸xÉOŸ>“)SF<|DÏÞ}ñõõ%KæÌ„…‡áåõ‰bE‹°bùÒŸºùL‡Nyðð©S§ÆÔÔOOOœœÙ¸n-ÎÎÙù Fp°fyÎ-[·±eë6ùØÀþýèÝ«‡"ÿ°#ñõõ“ŸgÊ”‘³§Nh•ã¢»;ËW¬búÔÉ:gèL™>ƒ³gϱw÷N9Íßߟ½úrçî]Ò¦Mƒ••oÞ¼ÅÑÑUË—‘;·«œwŸÛ~zõ许aœ%sfԯǎ»8wþ¼< /îu,[¾RQ Þ» À™sç˜:m†|,88XkÏ»Æҥó÷åLŸ>{F×î=ñññ%Cúô¨Ôj>~üH®\9Y»jNNNŠ¿ßµ{“¦L k–Ì|úü…ÀÀ©´iÝŠqcF)‚~ËW®’ƒ7nÜäÆ›ò±Ò¥J²iÃ:}A­VËåÞ³sûO/åÅ©Óg(^¬˜ˆÕ¶M+–,[αã'äÀÀÝ{÷øôé3ýûõ‘f ™EÚ®Mknܸə3çhÙ¢  ¸ºæ¢SÇöÔ¨^M+hšgÏçÀ¡ÃÌ=“”)SÊéú–åĉS¨ÕjÚ·m£8Ê”)©[·[¶nãõ›7d˪™‰uôØqÌÍ͵fÚ–,Q‚9²sìØ 9À¢o=ÆR©T4oÕ†çÏ_`ccÍçÏ_°³µeÓ†uŠ÷†>¾}ûFxx8™2eÔšaZ¤pa¶lZ¯Ä¿èθ isgϤAýzZç?~â$sæÎ÷õÛ´n¥XŠR¥R1aÒd¶ïØ…­-iÓ¦áí»wHLž8ž†ÿ5Ðyž_Ý×4eÚt 3z¤Î^PP]»t¢HáÂZ¬"E söÜy‚âŒ?ÿRÿÒ·,±Þ½OÿƒQKjT*5¸äÈ¡ ‚ ‚ ‚ ‚ ‚ dø· |çí탼¿ZHHÝ{ôB’$¸íáıÃ\¸{‹íÛ*^sìø‰˜ššrùâyNŸ<ƹÓ'8vø Ÿ¼>1sö\EÞû÷0fÜòçχû…³:àÆõ+—h߶ ›·leç®ÝŠü çÏåÜiM´NíZŠr¬^¹ü§ú‹>^¿yCXXùòåÑ:fooOútéxüø‰œæá¡ùw¾¼yµòç˧I{ü䱜֦u+¦OLýzu133Ó»|Lœ4…B… R¿^]Å1}Ë;+5o^íkÍ›_q­qÉ‘SSSùóáã닯o²ê1ÖÖm;(]ª$wo]ÇýÂ9V._J@` ó.Ò»®bÙÙÙáäèÈõ7¹~ã†Öñ’%J:µrf]ófMäþ÷ã¬ãuïÚ…g*ïÝ¡HáÂXX˜kí¹¹nýF¶ïØEÇöí¸~ÕCܸtáùòåeĨ1 Îæû]N>ƒÛþ,˜7 ³˜R§NÍÀþý´öÞT«Õ\¹rsssòÇëþ¥þ¥oYb-X´„É“&pýŠ;7¯]¦SÇ<ñ‚mÛw"‚ ‚ ‚ ‚ ‚n"€÷fÖì¹<}öŒzuëÈK9:|__ú÷í­X:®VÍT¯V•£ÇŽãïïŸì×­R©"“&Œ§Qœ™*… Â5W.îÝ¿¯•ßÂÂB¾)ljjŠ¥¥¥üе盅…¹|<¡Õ>3¤OOÙ2e¸s÷.¯ß¼QÛ»× •JEëV-ä´×oÞpþÂEêÖ©­Ø»Î%GzöèÎGOOÅŒ¬OŸ>akcƒ•••Ök§OŸNÎ÷:---åÙ1fffŠkµ°°óË醆Š¼ºêæéÓ§¸äÈ¡XÎ0{vgŽÚÏ”Iy×oÜ„Z­fÚ”IØÙÙš%<‡‚“£#›·lSä733Ã<¦|ÆFFŠr$è200 s§ŽtîÔQk`rx{{ÈËLÎ_¸ˆ>ýÈKz::9òùËùÕj5}ú  O¿¼}÷N>Ç—/Þ?]®X7oÁÓË‹!ƒh-[ªoY¾x{“"E ,,,xöü9}ú `àà¡Šëÿs­‘‘‘ÊAúÃGŽÒ§ßy–§ãùõ­ÇX™2f`Ѐþò>jU*W"{vg<<ó3&MOTT­Ûv aãf,Z²”;wï¢R©tæ7ŠÓu”â200ÀÈÈHñ?qwîÞeîìYäÉ“[‘ý†¤O—ŽÇÊ×igkË„qcP©Tlß¹3Þ×ù•}=–··7#GeØÐÁ¸º&mÿI__?Ξ=Ƕí;iѪ-wîÞeÖŒir{ÿտô)K\õëÕ¡j•Êrý÷ˆùÁGl@PAAAAmb Í¿àãGOŠ–( €Z­"(H³\ZÍÕ™8~¬œïÎÝ»dËšUž1ËÕ5'Nžâá#*”/—¬r/^ŒâÅ‹áëëÇûï GR«MPQ¥RÉ7Æ·Í›rÉÝ={ö1lè`@³Lâî½{±±±¦n:ßëåÎ=\\rhÕKì¾p÷ï? FõjDGG£R©â ^Ŧ‡‡‡ÿ‘ëÈ•+gΞcòÔiÔ©]‹üùòall¬5{ 4}ÀÎÎ+++­kÍ•+'—Ü/¦*&‡¡¡!#‡ýeצ©OÓ˜ú½ví·ïÜ!oÞ³··ÇØØø§~€"‚ ‚ ‚ ‚ ÿ¿¼¿À:E ZµlhfÙ…„|c÷Žm(_‘ÏÏO³\Ë6íâ=—ïA}¼|ùŠÑcÇsûÎ@3cÎÌÔŒo¡¡¼NªV©Œ£ƒûdð qíú Þ¿ÿ@‡vmåY‰~þšz™3w~¼{fùÆÔ±±1FFF:ƒ€œnÏrw¿ÃÂys6b7maã¦-XYYQ®lZ4oFÙ2¥yýüü‰ˆˆ T™òñžÏÏߟ éÓÿ±ò'EìMý¨¨( ,€¥¥%™b–RŒŒTÌÈŠýwdT”+«Y^ÐÚÆšèèh$IJÖR™º¸í?H@@íÛé´è[SSù:íS¦¤\Ù²˜˜jfoFÄ,å›ßÔDY/Y³d¡\Ù²ò†‘r~SEY’Z±lmmµÒ ~Í„ë¬Y²0zäpF·8sî<›·leîü|øø‘iS&ýôkœ8yŠ¹óÒ¤qCºué¬uÜÏOø9{ö¥ÎžÓyŽ¸ûoþnk×màùó9´_kFgBJ/ξ=»øúõ+îî—?q2ûÜö³~íjyLú—ú—>e‰ËNG444D’¤?ÖF‚ ‚ ‚ ‚ ‚ð¿Fðþ[;[ è@™Ò¥hݶK–-×Ú£,v ÇeK)–T‹+¡½åMç®ÝñöñÑ,£Ù°|øC箸»_þ£ubddD“&X¾b.^¢r¥ŠìÚ½€Vq–Ï0©—Þ½zP©BçK™2¥üï´iÒðÑÓ“ÐÐPy©ËX±K!¦K—î]kºtiÙ²i===¹xÑ+W¯rñ’;ÇOœ¤_ŸÞôëÛ[Îkbb‚µ5Ë—.Ž÷|Ž¬ìIÛ_}}4æg<ùøú’:Îò…r~_\sådýÚUò±OŸ>kòü¢å÷º¹aee%/éoÙ“XGGG>ò ""W×\Šü±v''Í9-,̱¶¶–gS6ü¯ ã,a[_±u£o=þi3f¤C»¶4nøMšµd÷ž½ z¤Èó3|}ý¸wï>Õ«UwFŸ¾eÉ“'7gΞãÉ“§ZýQÎgÿ¶Ü®®<|ôˆèèh­ý>òÀÁ!• Ô·§qíúuš5m¢5£ÊÚÚš"E óêõk<½¼’Àóöö¦[ÏÞ899±lÉ"{kd̘!f)Óˆ_>6êëË—/sòÔiNž:­uüùóLž:ýû’+gNîݻωS§¨S»yóäQä]j2n{ÿKýKß²‚ ‚ ‚ ‚ ‚|¿fM5᧌>G¦L›Ž···œ^±‚fÙÄ=ûÜ´þæÀ¡ÃlÜ´E^ÎLÔ’Zç1uÌ^wVVÊiîî—yõú5*•Jëïb—S ûåõ!}zÊ–)Ã%÷Ëœ8yšˆˆZ·j©•¯x±¢XX˜³ÿÀA­2>xøˆEK–òåË9­Aýz¬^³N±d[@@ÆÎÖ–J+ð'¼ÿ³fóöÝ;Eº­-… "::ZѦ+”'**Šikɲå:Éi#•JEõšu¨^³Ož>ûéë433£RÅ \¹z•÷ï?(Žíع I’"E ãèàÀ¾}ûµúô¶;111¡jÕÊIzí„ܺ}€bE‹Ä›Gß²Ô¬QvìÚ¥ÈÌ¡ÃGÉéâ‚s¶lrz­šÕ åÐá#ŠüwïÞãé³gŠzÑ·§+W®0kö\6nܬu,**Š;wïbhhHÚ4i“uþ°°pºöèExXkV­Ð¹ìb,kkk *ÄÍ[·´ê%$$„i3fÉ¥ýê¾^¢xqÞ»­õ¸uý •*Vàá½ÛtêØÐ,K¹zÍ:Ö®Û u®ë7n&M9í_ê_ú–EAAAA„ä3ðþ¶66Œ;š¾ý2fÜV­Xh–×,W¶,{÷¹acmÍ êcbj‰“§XºleË”Žw/ÐÌÜóðxÌê5ë°µµÁØؘbE‹1cFräÈŽµµ5GŽ£RÅŠdHŸžËW¯²mÛԯǃ‡¸xÉR%K`ee%Ÿ3{vg Ø´y ö)SbkkËׯ_ñòúD¯žÝå|'O&,N)4f_½¸¨Ü®®äÈ‘]QæÍ›rÉÝÅK–âääDµªU´®ËÚÚšÞ={0gÞ:wíN¯ÝqträîÝ{Ìž3:¶ÿ¾o`µªU(W¶,—ÜÝéÚ½'ÿ5¨Ï·oßX·a#_¿~eæô©XXXü‘¶¶±µaûŽ]ܺ}‡aƒ‘9s&¢¢¢¸yë6û¤BùrX[[Ëù;uhÏž½nŒŸ8‰ÐÐPJ•,IPP[¶nãÀ¡Ã :Dgrrrââ%w6mÞJ–,™ áÝ»÷4jØ€Ô©Së,Ûë7oˆÿ%×:°?.\¼D‡Î]èß·iÓ¤áÚ,[¾’âÅ‹Q½ZU9¯‘‘Ç aÈ°tîÚíÛajjÊ>·ý¸»_¦O¯žŠed=<ãñø±üü‘‡·ïÜÁØX3SÑÁÁÊ•**ÊôüÅ @Óã£oY\rä I£†ìÞ»33sjÖ¨Npp0+V®" €ysf)Î߬i¶lÛθ “ðóó§@þ|¼yû–ù ‘*•=={tWäק§Í›±g¯‹—.ÃëÓ'ªV©Œ­ ^Ÿ>±}Ç.^¾|E«–ÍI•ÊЫïÞ»'ÿ}ìl×Øÿ‚f´zuë0zì8<<Ó¡][^¾|ÅË—¯¯ojjJ…òåäçC¤M»´ëØ™Ñ#‡“#GvÞ½{Ï¢ÅKxäñ˜Z5ªÇ{-¿º¯ë£hÑ"”-[†C‡`hhHZ5137çþý¬Z³ sZ¶h&çÿ—ú—¾eAAAA!ù ~"_|i:þ÷ùØY€†:þmÅù¯aœçÆqžÅ9nç¹qÌ#î¿M~xžâk@à‚„.ÞÎÖ&I•tâä)jT¯–`ž|‹àèèÀÙS'´ŽuïÙ›3gÏ1{ætyߢ°°0¦Í˜‰Ûþƒ„ÇÜlN‘"6`ØÁòR‹ºœ;™³çðñ£'ÑÑѨÕjfL›"/Óyâä)FK`P®®¹˜7{‘´ïЙÀ  ºuéÌ°¡ƒç]±j5K–.—ËcddDÁع}‹œ§LùJŠYpº <ݺ*ÒT*å*TÆÛÇGk?¸­ß¸‰+Wáçç/—£B…òŒ;šô?ìiÊŒY³Ùçv@.wš4©"¿R§NMÛÖ-éÚ¥³¼Ôë®Ý{5f\‚ç355åñÃ{T¯YG¬ébgg'Ïj‹å~ù S§ÏàÅ‹—rZÞ]:­@ÌŸŒ¯Ÿf¦f¤Ní”èwÁÁÁx{û`mGGÇDË®V«ùòÅ›¨¨(ìíS’"EŠ¿v­ÞÞÞ‡&MêD? Ôj5žžž¨ÔjÒ§K‡‰‰É_+·¾e‰í_æfæ¤K—øR’AAÁøøø2¥ööö¿´w½øúú„­­bìø¼}| &•Cª—Þü×H’„··7áá¤K—öªé[AAAAáß#x"€÷ã1ÀAAAAAAø‹Dïßà&–AAAAAAA„?GðAAAAAAá"x‚ ‚ ‚ ‚ ‚ ‚ ‚ð£OÙõ鿳,ÉÉÿ¿êwöõ©,¿ó}÷»Ë®ïØû;Ë$I¿íü¿OŸÏöèèèß:®GEEýÖÏ0A·ÿ+Ÿ‚ ‚ ‚ ‚~Œÿvþ¯iШ )S¦dÃÚÕŠô·ïÞÑ­{/*V¬À¨Ãþv1ÿ¸ê5ë$x¼\¹2Œ=J~.I[¶ncëö¼zõI’È>= ÿk@÷n]077Wü}HH‹–,ãð‘£x{{chhH®\9éؾ ÿkhùÖoÜÄöí;)]ºÆQûÝeñôòböœyœ=wžÐÐP,,,¨Vµ #† ÁÉÉI+¿$IlØ´™›¶ðñãGÌÍÍ)U²#†Å9[6­ügΞcÉÒåx<~ŒZ­&cÆŒ´o׆ömÛ``` ç7a"×®ÝÀÄÄ;;;r»æ¢^½ºäÏ—Wg½=~ü„9óæsçî=BBBH•Êž²eÊпo2eʨÈ;zìxnÞ¼¥ó<)RX±oÏ.EšJ¥bíú lÛ¾“?bhhH¾¼y8 ?eË”VämШ a¡a`bb‚ƒC* (@«–ÍuÖãñ'Y¶b%/_¾B¥R‘&ujþû¯>];w"EŠŠ¼ááá,\¼„áíパ‘EŠføÁ(?Þ~%IC†çá#Ö­YI† tæóôòbÞü…œ?À  ,--)U²ƒö'§‹‹VþÝ{ö²iËVž={@úôéiݲ;´ÃÈȈ„$ÔדS–oß¾1gÞmšœ1CßÏö]»÷°nÃF^¾|€³s6ºwíB£†ÿ)ò%gÌ cÙŠ•­›šÓfÌbý†T¯V•>½zòéó'Ö­ßHÛv9zä âÆÓñ'éÛ 9²ggôÈXZZpøÈQ¦LNP`âFÖ§OŸyýæ µjÖÀÔÄ„Ï_¼Ù¶c'ë7n¢EófLš0CÃï“zŸ>{FóV­151¥MëV¤M›†ÇŸ°wŸ.\äèኛ”Ï_¼ÀÇ×—V-škÕ±™¹™VÚ”i3ؼe+•*V wÏî| eëÖítîÚukVQ&NŸyýú FFFÔªY€ÐÐP^¾|Å’eËÙ¼e+»vnSÜ Úµ{£ÆŒÃ9[6ôï‹©©)—.¹³tÙ ®^½ÎŽm›åkU«ÕtîÚƒë7nP¹r%*U¨Àç/ŸÙ°q3­Ûu`×ö­äÎíªUþgÏŸ3}Æ,._¹Š$IDÄ3Ã磧'M›µÄÇ×—êÕª’?>Þ¿ÿÀþ¹qó[7mPœöœy¬\½†4iRÓµs'ÌÌÍ8uú 3fÍæÙóçÌž9=Ù}]ß²DFFÒ¾S=ò m›ÖäÊéƒÙ¶c'ï?|Tü!((ˆ×oÞP°`E &.cãïYÞ_¼yýæ ÕªVÁÚÚZ+¯“££üïðˆp^¿yC¶¬Y)R¤°üz÷î?àô™³ìÚ³—Ý;¶af¦égÙ²e‹wL:wþoÞ¾ÅÒÂBNó÷÷§yËÖøúùѤq#\\rðùógvìÜMÇ.ÝXºx!Õ«U•ó¿{÷ž€€êÔ®¥ó52dH/ÿ; €×oÞP¢xq2eʈZ­ÆÏÏS§Ïpàà!Z·lÁÄ ãäüß¾}£M»¼}ûŽF ÿ#oÞ<|úô™»vÓ¦}GV­XFÅ åãí›6oåà¡Ãš× Ô:®Ïû.v̨W·æææDEEáéåÅö;Ù¶}sgϤ^ÝïA•[·ïж}GìlméЮ-ŽNŽßÇŒ‹—8|ÐôéÒ)Ú4KæÌ.\ˆoß¾áñø ÇOœdéò•¬X¶Dq£Zß±WßñëGcÆŽçþƒ‡š÷A„ö{{ä¨18t˜²eËЩC{ÂÂÃØà #GáÝÛw <0Ùï }ÚTßþ¥o›‚fŒ¼ä~™IS¦òþýR¥²×YN}Û4îg’Eœ÷c\FFß?“ôýž¡O›ê;fèûÙ¾`áb–,[N®œ9=r8*•š»v3lÄ("""iÙ¢Y²ÛT¥RѱsWnݾC¾¼yiÖ´ ß¾}cßþýôèÕ‡iS'Ó´q£?Ò¿~”Øg’>ý ô{ãÚ±s7þþþrøðÚ´nõÓe9{î<={÷ÅÄÄ„&’.mZîܽÇæ-[¹yóÛ·n’?Ûbë±XÑ"d̨ûÇ66ß¿Ûéû}íG‰_‚ ‚ ‚ ¿Ç@ÇÃPÇÃMPÐ0Lã<ÌsÀ°¬€€MÌðy8N@j Èdœì@. 7(Š¥r@E *P¨4-€Ö@{ 3Ðÿk@ ”Ð#©ŽŸ8™hž¼ K•ªV×Jöü¹äìâ*õ0H똯ä¶ÿ€´bÕjiç®ÝÒ“§O|¯ÒÉS§¥Í[¶JnûH/_¾Ò™¯mûŽ’³‹«$I’ôáãGió–­Òºõ¤kׯ'x~µZ-}–Óüýýåô%K—+^³[^Röœ¹%ÇŠôµëÖKÎ.®Ò²åʲW¯UGª]·A’úÅËW¯¤¹òH½ûöW¤ûûûKEŠ•Ô:O|ﻥËVHÎ.®Ò¸ñå´èèh©H±’RÙ •¤àà`Eþ®=zIÎ.®Òí;wä´ã'NJÎ.®Òà¡ÃyïÝ eÏ™[jß©‹"}äè±RÕêµ$gW©yËÖÒ ÁC%gWéå+ÝïÓÞ}ûKÎ.®ÒÚuëé·ïÜ‘råÉ/5nÖBN{òô©”#W©B¥ªÒׯ_×Ô½goÉÙÅUºpñ’Î×I¬¯ë[I’¤5k×IÎ.®Òƒ‡é3fÍ–ª×ª#yzzÉi;wí–œ]\¥­Ûv$©$Voq=xøPrvq•FŒ£HŽŽ–:vî*9»¸JGŽKô<ÏŸ¿\ó/]¦HŸ;äìâ*;~B‘þðÑ#ÉÙÅUjÕ¦½"½t¹ŠR‰Òe“t«×hêpÿƒŠt__?©t¹ŠRöœ¹%_9}Ýú ’³‹«´nÃFEþG<$gW©}ÇÎ ^_î|¥AC†é<‡¾ï;]c†$IÒ­Û·%gW©z­:Šôf-ZKy –>zz*ÒcûÑÂÅKmÓcÇOHy ’J”.«xè;öê;~ŵs×n)oÂRÏÞ}%gWéñã'Šãu¾Ç¾}û&•*[AÊ[ ¥8Ÿ>ï }ÚTßþ¥O›ImÛw”J–.'eÏ™[7a’T³N½xû¾¾m_Yô¥ë{†¾mšPýë3ôùl÷öñ‘ræÎ'U©VS WÔoér¥BE‹KaaaÉnÓM›·ÈýQ¥RÉé~~~RÅ*Õ¥ü…ŠÆ[7¿ºÅ•Øg’¾ýK’ô{cI¹ó”¦Í˜%Õû¯‘ô_£¦Zyô-Kdd¤TªLyÉÅ5¯tïÞ}űØñnÖ칉Öc|ôý¾Wrûº ‚ ‚ ÿ»¥ÏŸ?KÁÁÁÉ~Ižžž’¿¿‚ÿ×îÝ{¤Ý»÷$—úÇÄpÚÇÄtZÄÄxÄÄ|jÆÄ€*ÆÄ„JÇĈŠÄÄŒòÅÄrÅÄ”œcbL™bbNébbPN11©Øø”]œ¸UŠ˜X–eLlË<&Ö7öe'.fOìLWŒ-Qb¼Üž½n”¯T…1ã&°w¯ÓgΦ^ƒFL›1KgþýR¾bÎæ­Û˜5{.5j×eðaDGGkå777çÐá#T«Q›•«×0oÁBZ·íÀð‘£ã-“Z­¦gï¾ôìÝ—7¯ßü¶k?{î<fԈእ„ƒ‚P©TdwvÖúggÍ,*ÿ¯þrš¿¿æßÙ³+󛘘)c&BBBâÝßhÊ´é0fôHÇwY®^»Ž……9X"«Cû¶XYYqüÄ)EúÎ]{000`@ÿ¾ŠôÊ•+qéüYªV©,§Ý½wOŸ>Ó¸qCÅ/ý hצ5‘‘‘ .Q2eJΟ‹ƒC*Ö¬[¯Øǧh‘"ôéÕSköY±bEðöñQ¤ck—ð²T±Nœ8…Z­¦}Û6Zå©[·Ïž?çõ›Äûf•*•äv”ËB‹ÍÊ”)ÍÕ«× ú>ëÖÄÄ„ å˱iÃ:vlÛ‚µM¼å âÔé389:Ò¾][ű… 1xàš4j(ïCæ¶ÿ jµš®]:agg'ç522büØ1´nÙ‚tiÓê|­¤ôu}ÊšY 9rd§~½ºŠüÇáÄÑäK§»,Š‘‘+TÐ\_`P‚yÕj5ÃGŽ"c† ôèÖUq,»³3ݺtV̲È›'æææ'|îäH•Êž‚ò#I’âüéÒ¥£m›Ö4nØP‘?OžÜXXX(ún\‘‘‘ 4„ÚµjÒ ~=y~Õû®HáÂØÙÚôCW(_ŽÆȳìb-RÐŒ‰©Y£:ýûöÅ××mÛwÊéúŽ½úŽ_±Þ¾{Çä©Ó?v Y³d‰·œ:v g÷nŠ4KKKòäv%,,œD¯51IiÓøÄ׿⣫M%$lllhÙ¢9G`âø±ÉºŽøÚôWˆï{F\ImÓ%4fèóÙ~ûö¢££iÚ´±ÛwîâÁÃGŒ=Bk¹Âúõê2lè`­÷é͘q¡dñâüj!!!<|ôˆtéÒ’9S&9½FõjŒ;å²¢¯^½&,,LÑwãš9{áá î1õ«ÞwOž<% 0’?Ü îÕ³;­[µÔÊÑÝ€%’Vjöàºxé’œ¦ïØ«ïøÍÀAC©\©"M7$>¹s»2jÄ0­÷QQQ<}ö GE>¹’Ò¦ñ‰¯ÅGW›ÚÚØ°dÑúõío¿K*]mú³úž+©mªKBc†>ŸíÁògŒörŒÙcúáÓ§Ï-®6ŒŒäÉÓ§¤Je¯ó³¡r¥ŠôíÝKgpówö¯¤|&ýÊþ•½ûö‘>]: , /½¹ÏmÿO•åAÌò”%ué ˜8~¬ÖÞ©¿B|ß×àçúº ‚ ‚ ‚ðûˆ=ðþ‚  `Ö¬]¯HóñõÕÊ'©ÕÌœ>•Œ3È7cMLLhÖ´ §ÏœåÞƒ*TPÎÿêõ"##)R¤0¦¦¦rzÝ:µ)X°iR§Özˆˆ†$߸±´´¤]›Öܼy‹ÇëÜìÞÀÀ€Î4¿ÈNh Ÿ±qó<½¼˜5sÊÙ¤,˜7‡®=zѨIsêÔ®…©©)î—/óàá#fÏœ®¸ù™!C¦NžÈ¸ “èܵ;¥J–$<"œƒcckÃŒiS´^ßÛÛ›‘£Ç2lè`\]s¡³œ¿»,iÒ¤áþýrp+–Z­Æßÿ+‘‘‘‡„ÈÇÞ½OåJ?a[·ïÀÄÄ„¨¨(ŒŒŒèÖµ3ƒP\#hö S«Õô0€!ƒÊ3`¾|ñNR{åˆé?ïÞ½O00åéåÅ¢ÅKprt¤áßdQQQDDDðáÃGjÔªËÛwïäc9]\˜=sºb&ÌooR¤H……Ïž?gñ’e˜˜˜0îlyï³/_”AËààÖoÜ@è·P?yÂÙsçiÙ¢M›4NôÏ¿À±ã'¨\¹’b¿¼4iÒðüÅK­½ibß×~~þ‰ž_—OŸ>>}º$æÿ hfa%URûº¾ey÷î=)R¤ E«6ܾs###¢££±¶¶fæô©Z3Ö~·/_Ê} €ËW®òìÙs¦Lš ϘÕ%44”E‹—P¼x1Ê•-›àkܼu???î޻϶í;(U²„Î@¾.^rÇÿëW$µoŽ? Àâ… tT㊊Šb̸ñÉc÷çÞ¶}';·oÅÊÊ*Þó$ç}°kϬ­­‰ŠŠâÝ»÷9zŒbE‹0f”î™5*•Š /Ìù 9|ä(:vPÌ Nˆ½½=)S¦”û $ïsàGñ_±,\Œ¿¿?›6¬MVÏ_°ˆOŸ>3jÄ°dý}\ImÓ¸ùõé_ú¶éÏÒÕ¦±Îœ=‹­­öìí\9sê JÅJè{F¬ä¶ibc†>Ÿíic¾»=þBë<>>1Ÿ1þ~ZÇ’Ò¦>¾¾¨T*­Y¯‰ùý+©ŸIÂË—¯¸ÿà!=ºwÃÀÀ€ éÓS°`ö<ÄàA{ãóé³æ³Zßz¿{ï¾Î×ttt D(ß÷µŸ¿AAA„ßCðþ‚€€fÌšh¾”)SÒ ~=¢££yþâþþþDG«xÿá_¿~UäÏœ9,Y²Œ¨È(*Wª(ß”Î>}¼¯S¢x1ÅóÔ©5A9ÿ¯:ó2røÐßV?ááá¬Z½–Â… Å{C"[¶¬4nô«×¬cõÚu˜˜˜ðõëW5ü1K¸EEF†J¥âÊÕkäË›—3'“9s&Þ¾{ÇÈQcX¾bÙ²f¥áš™ aáa˜™™!IÇOhn¨uéÔ‘,™3c`` 5«0>±Kp††~‹7ÏÇéЩ+¡¡¡lÞ° ùXìò…ïÞ¿§w¯”,^Î]¸Àò«hסGÆáaᘙi‚Ô¾¾~?qRZÇ΢ WÞôûúõ+S§ÍP¤ÈŸ×\®$ÆÝý2ý "s¦LÌš>Uq¬fj¬X¹Š Q¸PAy¦Âù 9uúŒ¦¢¢’T? ‹©3S³$æmSÓ$åק¯ë[–à`Ír‡ë6l¤IㆬX¾ë)¸uû6ƒ† gÀ !=|€,™3+þn÷ž½\¿qCë|Ž:—R›>c–ÎÈ¥J– EófŠ´{÷îsïÞ}EZêÕý!–mÛñóógîìY$fÒä)<‰™ S£z5F ¢µ«¦~Bè?p°Îs´mÓš¢E +Ò<ă‡äçæææ4nÔ«8ËßêNÿƒ¹yë6cGÒúQ†¿¿?ÃFŒdà€~:°¡8W2Þw‹/Ucï¿@3ûyíú lݼkkkôµlùJV­YKÍÕéØ¡½ÎŸíÅŠ%U*{vìÜEÃõå³¼ÿ•«VkòêøŒIJ›†Ç,£¨k‚øüÎþ¥ï÷¯äÐgìݳoÿÅY"´nÚL™:ËW®R¾\Â?èˆOXØ÷ï_úزu[¶nÓJ/]ªd’xº¾¯ýìø%‚ ‚ ‚ ü>"€÷dȃn{i¯^½¢i‹VZy—,[ÎÚuÆÈÈ uÿRÜÖƆÕ+—1zìxfΞÃÌÙsprr¢j•J´o×V1k(–©©©ÖHCÍ’N’$ý•úqÛ€€Ú·Ó}óF¥RѦ]Þ¼}ËÚÕ+)Sº”¦_¿¦o¿üר©&Ø3#ÄÓË‹FMš‘>CzNŸ<& .^r§O¿\¹z•í[7Ë¿À_»nÏŸ¿àÈ¡ýñþ*ÿO•¥]Û6œ=w}nûåå1_¾z…™©•*VàÌÙsXYinÆÄ.Å¥V«X¶d‘%W/_ÄÂÜ\ìÈ“'76Ö6Lš2•í;vÉ3™LMMä–ö)SR®lYLLMˆˆÙÇêDzgÊ”‘³§Nh®92oooŽ;ÎÄÉS8yêëÖ¬ÒZÎ 47ÍÇŒ›@žÜ®¬^¹Bki»¼yòЫgw–-_Iµµ)P ?¼}ó–&²uûŃúˆ]:,<"iT sÍ{9""Bë}­‹>}]ß²ÄÎpqÉÁØÑ£äôÅ‹3fÔúöÈÞ}nŠY¡Ÿ>’ûS\ñÌü{ùê5¦&&ZéY²dÖJkÚ¤1Ó§jnö‡††òîý6lÜDç®Ýп/}zõÔú•JŦÍ[pΖ²eJ'zÝóçÎ!0(ׯ߰yë6jÕmÀœY3¨Y£º"_tt4Ož<ÕyŽ À@­´¹³gÊûLòäÉSæ-XHý†Y³j…Ι¯~~þtïÕ›‡1mÊ$š5m¢•gĨ1ätq¡kçN‰^[rÞwîΑ&MjÔj5~þþ\½z³æ°c×nºíÅÁ!•"¿••%n{wÊÝ{÷Ù¸q3û`ãúµ:?Çt ùöqÆ#}ÇÞ¸¿ƒ‚´jÙ<Éu´võŠ$uâ²´´Ä5WNfNŸÊ‹/X¼dÚµÕš-wåêU>þ ý“tÞØz/R¸0ÿ5¨O£&Í1j •+UT,mœ2¥'ѻܠ٧±Tɬ]µ’b%K3gî<öíÙ¥ÈóâÅKºtëAHHÖ­¡”Ž½–Üöàì¹ó èß—Ý{ö*þ43wYî¡j•ÊØÛÛÿôû.ö}^¿^]¬­­éÚ½'kׯgøÐ!Š|FFFòÞœ%Š§nÚÔ¨U—ÉS§³aíêDëÇÏÏŸ€€ŠÅÙ×Pß±7VRƯé3fú-‡T©Ø^Äÿ7€IDATµ{œþô™f&æÉS§yüä )÷• ¡WŸ~\»~ƒ‘Çê\Þ4®¤¼7ômS]’Ò¿ômÓŸ¥«Mc9:8’&Mj½Î—Ø÷Œä¶)$mÌÐç³ RÅ Ú¿»÷àååEêÔN 4€o¬\½&ÑϘøÚÔÉÑccc<½’6®ÿÎþ¥ïgRr%uì½pñ>¾¾øøúR¸˜öøyêô‚ƒƒ“5c-vñJb½Ç²µµÑ»¯ÿèÇïk?Ó×AAA„ßOðþa'O`öÌédÊô}o-¯˜½¨’7OòæÉCîÝxúìÍZ´fÉÒÿ|Ï××{÷îS½ZÕxg½¯YB4]Ú´ZÇœb–ÿüèé©?vþÔ17›?~ô¤DqÍþMÆÆÆœ,)³ÿ„téÒñàá#>|ôÄ5—òÆðéӚɕ+WŒ÷ï—¯X…Z­¦w¯Št *È“§ÏxÿþC¢AU}ÙØXcmm­è»Ož<¥]ÇΤH‘‚=»wÈ?þø‘§—¬\µF‘®V«ÍgÐÙsçÉ•+ööö¿ö}~ûVSvo6oÙJNêÖ©­È›!}z2¤OÏãÇO’tî#GP¶ô÷ñ19coRǯϟ¿ÅÔé3é±³W¯]'/+((˜ö;óòÕK–/]L•Ê•’tm‰Ñ·M_ÿŠÏmú+éjÓäJÊ÷Œä´i¬¤Œ ßg;h~0zäpEÚ¼ (T°`’®ýÇ6511!_¾¼Ü½{—/_iQoß½cÀÀ! 2ˆ2¥KýÖþ¥ïgÒï¶wŸLž8^ë³êÎÝ{lݶ#Gi-Õœ…cö¯¾vý­[µÔ:>~Â$¢U*&M—ì}ötÑõ}ígúº ‚ ‚ ‚ðûþü)„ßE³„eÜ›†jµšM›·jþ­R+ò_»~©Óg¢R©é¹ræ$]º´òþX?K¥RQ½fª×¬#ïõô«Üº}€bE‹Ä›'CÍ~~·ïÜÕ:»¿UÆŒâä×üûöí;ñæÏ”Q -Q¼8ïÝÖzܺ~Ðü þá½ÛtêØá·—4³?š4o©UÏkÖ®'""Bë†JÚµgǮ݊ôÛwîàíí-Ï|(R¤0ŽìÛ·_kÿœm;vbbbBÕªºg'ÄR©TLœ<oooÚ´n……Å÷jW®^cäè±”/W–U+–%¸Œä±ã'¨X¥:‹—.Ó:¶{¯fšbE¿Ï¼¨Y£:ìØ¥œÌ¡ÃGÉéâ’¤YY*•J¾1œ=NþÅK—±k÷hðîÕë×´mß‘?Ôùõ7¸}ç ÔKö 8+++jÕ¨Ž¯¯<›/Ö—/_˜3oOŸ=“g/6jØ###֮ߠµÔÞÒe+¸yë6Æ1eÑ·¯ë[333ªV©ÌÕk×yþâ…²½i–2Ûÿ–/_¾píú LMMɘA{¯Ð·nacc­s&a,÷ËWX¸x ¯^¿V¤«T*nß¾‹‘‘Ž ÌLK®‹—Ü ÀÙùûMwo:w륅;·o‰7xЧWO}`ùÒÅ :˜‡÷nËû\ýª÷Àšý°bËncmÍú ›˜·`¡Ö²rŸ>}æý‡Išyòøñ.ZŒ5Í›5•Óõ{õ¿6¬[£³;ǼwvïØ&¿¯@Ó/úôëÏÓgÏX³jÅ/ Þ%§M¢«%äÇ6ýUâkÓäJÊ÷ }Û4®¤Œú|¶«T*z÷íÏØñy¿~ýÊö»È•3§¼/^btµiÓÆX´D¹¯¡J¥bü„I<~òD^õwö/}?“~§¯_¿röÜyŠ.D‹æÍhP¿žâ1 _ŒÙçv Yç/Uª$éÓ¥ãä©ÓZ}àÊÕkìص›ÀÀÀ_¼‹ïûÚÏôuAAAá÷3ðþaE ÂÝý2³æÌ¥kçNøùû±bÕŠ)Ìí;w¸}÷.Þ>>8:8```@tT4ë7l$88ˆömÛ’Ê!•æÆê¡#¼|ùŠaCÿ²²½~ó€=÷ïHLìþ„fªT©\‰9²³mûR¦´£Z•*˜ššrûÎfÍž‹â&_Û6­Ø³wã'N"$ä…  "<‚ã'OrððŠ.LÑnä%äw—%gN?~Bï¾ý| r¥Š”‰™ñðêõk–.Óìu—*•½bI©¸¯;)KæÌ|úô™)Ó¦AÞ¼¹yúì9óæ- mÚ4ôî©œ•uîü|||äç±ËY?~GGMð+wnWòæÉhnˆ^½vIS¦ñüÅKJ–(ÎooÖ¬]‡¿¿?«V,“g‘dËš•^=º³xé27kAÛ6­±³µåìÙs8t˜Ò¥J&k¶@,}Ê0h`.^r§mûŽ 8€L™2råê5V®ZCÖ,Y¨_¯n²Ë’ÏŸ?—û@xD8žž^œ8y’  `F ªµ|¦J¥âõë7äË—7Áý˜úöéIûŽ]hß±3=»w#{vgüý¿²mûž=NÓ&±µ±ù©²Ÿ¿pÍ2•Á!Á¼xñ’3gÏannΰ!ßÇö3gãííMãF 9þ‚Îs5ü¯&:ö LLrÞwÛwîÄ:…5’$ñõëWnß¹Ëí;wÈ!:´ÀÜÜœžÝ»1á"Ú´ïHû¶mprräíÛw¬Z³–¨¨(ù†r\OžŸíFFFX[§`ûŽ]˜˜˜P«F üüýY´x)ÁÁÁ,[¼ð§Ú´IãF·ýìsÛ……9;´g`ÿ~|ñöfÿƒ”)W‘woaaaAÙ²e˜9}*‹—.gÏÞï71l(;uøÛ—”(??@ss$>&&&lÝ´…‹–°rÕ-ÖüjÜÀÀ€’%Š3nÌhEà)[Ö¬ìÞ¹Ùsæ1jÌXy©'3337ú‘#†'x£-!¿»,Y³daÙ’ELœ<•þËy›7k¢ó掉‰ Ö­eÜ„‰,]¾‚EK4³1sº¸°tñB\räPäÿ¯A}"##™·`!ÝzhnèX[[Ó¿_úôê©óšW¯YhfdåÈ‘NÚÓ¢y3Å/Åýüüå¥Cç̯ó<®¹rÊ7)MMMÙ°~ 3fÌbûŽlÞ¢™ejiiIÓ&1l¨ÖRg“&ŽÇÊÊŠ»w³uÛv@³ÔÞÒÅ u.?ÀŒY³åö±²²Â%Gºtê@‹æÍäzôÈ•JE@@£ÆŒÓYöíÚÊ<###Ö®^É°£˜88:°|ÅJÆO˜$÷‹6­[1lÈ Œ“?ìë[–,™3³eÓzÆŒ ×¥¡¡!åÊ–aêäIñî)ø»ÜðûÊífggK‘Â…iӺʗÓʈJ¥Â>ñ4{®]µ‚y 2~âd9=eÊ” 8€®]:ýtÙ>¡Ú}›LLLprt¤AýztëÒYˆ¸w_3›lï>7'€š5j$+€ú¿ï@3û3–¹¹93f G·®téÒ ;[[ùXï^=°¶¶fÕš5 c¯¾ã—¾îÝhö³½{÷žÎ<Ë—.þ£¼¤ö¯XImÓøÆиéׯUX’Ú¦±b?“t±´²Ô à%å{Fr%uÌÐ÷³}¸±DG«Øºm‡¼ ƒ³s6Ö®^©s_@Hz›²zå2æÎ[Àî½û¸pñöööŒ3švm[ÿt½èÛ¿’*9ý+)öî݇±±1µkÕˆ7Ï êsöÜyö¹ígЀþz—¥lÙ2lX·šé3gËK¡‚&È7vô(Ëý?q’ã'Nê|ªU*kð’ò}MAAAø·%5ja GšŽÇ}þã#vOCÿ6Œâü×0Îsã8Ïâ7‰óÜ8æ÷ß&?|ûö4iRkíŸö£èèh<=½HŸ.]²obÿé²H’„··7!ß¾‘.m:ÅR•ñ æËollmtΤû±ìžžž¨Ôê_^/úŠŽŽæSÌ>iÒ¤I´,áááx}ú„¹™¹Î^R@` ~¾~¤rH¥¸‰ý«|ûöÏ_¾ÒÎ.Ñý…$IâÓ§ÏDFE’!}úŸ ÜýlY||} ÄÉÉ ë_^7ÿŠ°°0>}þŒ­m’êåÕï~ßàÿõ+iR§NpùÊäøŸ‚ }?ÛcÇK Ë$-)«¯¨¨(¼¼>abbBÚ´i’ýã&A?þþþ|  mš4¿|¼AAAHLPPaaa‰ÞËNˆ$IË{ˆ'åG³{öì jµøã))íl!@tÌCDýð<î¿c«ãóGÊö¿Bô/AAAAAt3ðþ°š(fÈÂÊ š7mBÁ‚~êücF 8(€6í;þ–k¨R½&=ºw£iãFIÊobbLÕ*•qrrü-åIŠèèhV¯YÇŽ»ðôòÂÐÐ|ùòÒ¿oÊ—+«óoüüüéÝ·?ff¦ :˜,™3£V« ÆÑQûZæ-XÄÞ}nTªXºuj“"E B¾}ÃÆÚú_ïÈÑc‰ŽŽföÌéüµãzñâ%³æÌåò•«DFFbgkKýúu~ü¨é_yó0p@Ê–)­uî€À@æΛϱc' ÄÌÌŒreË0rø02gÎôÓõø»¨Õjöºígó–­¼yó†°°p¬¬¬(T°½zt§xñbñþmÎœ.T­R™´iÒü±òþMë7nbûöñöEÑ¿AAAAAHˆàýa¯_¿ÁÈȈZ5kš³_¾|aŸÛ~öìÝÇ”IhÞ¬i²Ïïœ-›üïoÿ _¿~åÝ»÷Hju’ÿÆ‚Ë–üò²ècÈ°>r×\9iÖ´!ßBس×Î]»³pþ\jת©õ7×®_'""‚ÁûÓ©c‡D_ãâÅKØÙÙ±|ébŒÿî[ëÞýûäΕ믖áýû´hÕCCzõìNº´i¹s÷›·lãùó—lÞ¸NÑGŸ8IßþÉ‘=;£GŽÀÒÒ‚ÃGŽ2eêt‚ƒè×··œ7::š'OŸ‘ÓÅ…ŠÊk½vŽÙu–éÍÛ·?q;;;¶lÝFî]122ÒʧOY¦L›Áæ-[©T±½{vç[h([·n§s×î¬[³Š2¥K)ÊÞ¾cgž>}FËÍÉŸ//==Y·~#-Zµáà}8:8$»§Ysæ²fíz *Ä°!ƒ±±±áÕë×lݺ»²yã:Š.¬óo›6iLÓ&ÿH9ÿ¶GÌœ5‡èèh²e˪u\ô/AAAAA#x½}J¦O¬H{ùòš6gúÌÙ4jø&&&ò±ððp.^rçÍÛ·˜“7OŠ+úKnªJ’Äõ7xñâ%‘d̘ åËann®•÷Üù x<~ Àã'OKáeÏîLÖ,Yù/^rW,±gii©¸ÑëæÍ[R¶L,,´_÷ýû<{þ\ë5$IâæÍ[<òð *:š,™3ë,ûÅKî>r”‚ °}Ë&¹n›7kJ½?q2•*V”_ûÜù DGGsíúu@3›%îµQ¹REEÙ@³ÿ`Ê”vœ;Añú.9rhÍz‰ŽŽæÚµë|ôôÄÐЬY³R´HáxÛÔ×׋—.ñå‹7ÖÖ)(Y¢Ù³;kå»ÿŸ>æիפL™RQîT©ì)\¨P¼ýàô™³/^ [›äv)Ù‚E‹  á€Û^\så QÃÿptp`ñÒeœP¢D1†”ä2íÝ놑‘#‡eøÈÑ\¼äN¥Šyô-˫ׯٺm;5kTgÉ¢òyÔ«Kµµ™6}&Gíÿ^†}nxx·ýôêÑ]Í’93 ê×cÇÎ]œ;^ž…÷:–-_©(……ïÝà̹sL6C>¬µç݈aCéÒùûr¦OŸ=£k÷žøøø’!}zTj5?~$W®œ¬]µ'''ÅßïÚ½‡IS¦5Kf>}þB`àTÚ´nŸ1£A¿å+WÉÁ‰7nrãÆMùXéR%Ù´aξ V«årïÙ¹ý§—rŠŠâÔé3/VL ÄjÛ¦K–-çØñr`àî½{|úô™þýúÈ ÐÌ"mצ57nÜäÌ™s´lÑ € `MÏÎÖ.ÉeR©TìÛ€R¥JR¯n¦L›Á>·ýZ<}ËrâÄ)Ôj5íÛ¶Qœ'eʔԭ[‡-[·ñúͲeÕÌÄ:zì8æææZ3mK–(AŽÙ9vì„`Ñ·ã^kóVmxþü66Ö|þü;[[6mX§xoèãÛ·o„‡‡“)SF­¦E f˦õÚAü‹îŒ›0Q‘6wöLÔ¯§uþã'N2gîüx_¿MëVŠ¥(U*&MfûŽ]ØÙÚ’6mÞ¾{‡$Áä‰ãiø_çùÕ}ýGS¦MÇÀÀ€1£Gê à‰þ%‚ ‚ ‚ ‚ BRþíßy{û``` ï¯B÷½$‰n{8qì0ÏañÂùܺ}‡ 'ÿÔë-]¾‚1}Ú._<ǹÓ'رm3>>¾L‰”ŠuåÒyfÍÐ’&Œû·äG÷n]´òŸ;}J>ž1cÆxËѼYS ؽgŸvøøpáÂEòæÉCüùäôa#Fqïþ}-˜Ç¥óg9~ä‡ìC­¢WŸ~DF~ßíÞý”б?WñbEyb¯óÁÝ[Œ1 €åK+®õÆUw9oÛÖ­ät;;;òçË«Èûàî-:´o«xͱã'bjjÊå‹ç9}òçNŸàØáƒ|òúÄÌÙsyïßÀ˜qÈŸ?îÎrè€ׯ\¢}Û6lÞ²•»v+ò/œ?—s§5AÒ:µk)ʱzåòŸê/úxýæ aaaäË—G똽½=éÓ¥ãñã'rš‡‡æßùòæÕÊŸ/Ÿ&íñ“ÇrZPÌ <[ÂÃÃyòä)×oÜÀÛÛ;Þ2¹_¾‚··7uk×ÆÔÔ”êÕªræì9ƒ‚ùô-Kì¬Ô¼yµ¯5l~ŵ>Æ%GvLMMuäχ¯/>¾¾ÉªÇX[·í t©’ܽu÷ çX¹|)Ì_¸(Ùmjgg‡“£#×oÜäúZÇK–(AêÔÊ™uÍ›5‘ûß³ŽÔ½kž=~¨x<¼w‡"… caa®µçæºõÙ¾cÛ·ãúUwpãÒ…säË——£Æ$8›ïw9uú nû°`Þ,tÌbÑ¿AAAAAHÀû3kö\ž>{F½ºuä¥>Š¯/ýûöV,W«f ªW«ÊÑcÇñ÷÷OöëV©T‘IÆÓ(ÎL•Â… áš+÷îß×Êoaa!ß655ÅÒÒR~èÚóÍÂÂ\>žÐjŸÒ§§l™2ܹ{—×oÞ(ŽíÝë†J¥¢u«rÚë7o8á"uëÔVì]ç’#={t磧§bËOŸ>akcƒ•••Ök§OŸNÎ÷:---åÙzfffŠkµ°°óË醆Š¼ºêæéÓ§¸äÈ¡Xn.{vgŽÚÏ”Iy×oÜ„Z­fÚ”IØÙÙš%<‡‚“£#›·lSä733Ã<¦|ÆFFŠr˜™™ÅÛtîÔ‘Î:jÍLŽØ@Zì2€ó.¢O¿ò’žŽNŽ|þòEg~µZMŸ~èÓooß½“ÏñåË÷à\ì ¼³gÏQº\êý׈Öm;Pº\EzôêÃׯ_µÊ´gï>ÌĮ̀YC3›¨nZDFFräȱxËž”²|ñö&EŠXXXðìùsúôÀÀÁC×ÿ%æZ###  ”ƒô‡¥O¿ò,OÇòë[±2eÌÀ ýåýýªT®DöìÎxx<ægLš8ž¨¨(Z·í@ÃÆÍX´d)wîÞE¥RéÌo§ê (Åe``€‘‘‘â1~â$îܽËÜٳȓ'·"ÿú IŸ.#†•¯ÓÎÖ– ãÆ R©Ø¾sg¼¯ó+ûz,oooFŽË°¡ƒquÍ•`>ýKAAAA„„‰%4ÿ‚=)Z¢4jµŠ  Ír5kTgâø±r¾;wï-kVyÆD,W×\œ8yŠ‡<¨P¾\²ÊQ¼x1Š/†¯¯ï?¼',,I­4AE•J%ß ýÝZ4oÊ%wwöìÙÇ°¡ƒÍ^U»÷îÅÆÆšºuê|¯—;÷pqÉ¡U/±ûÂÝ¿ÿ€Õ«J¥Š7x›þG® W®\œ9{ŽÉS§Q§v-ò硱±±Öì%Ðô;;;¬¬¬´®5W®œ\r¿LXX˜"¨˜†††Œ>ô—]cX˜¦>Mcê÷Úµܾs‡¼yóP*˜™š)öG 4í!IÇOœ K§ŽdÉœEžg>|ôdÔˆäÍ››oìع‹ýâçïÏ®í[ååEƒ‚8söU*W"EŠ”.U {{{öº¹Ñªeód—%<,33MpÊ××ã'NÊÁªïý+"æÜáŠôç/^püÄI¾} I7Uæ׳c•(Q\+-MêÔ¼yóö§Úµj•Ê;rmÛwröÜ9-^Ê¢ÅK±··§cûvtëÚù—+V®bŸÛ~† LõjUÇ>~üˆ·•+WÂÿ‡`­½½=ÖÖÖÜ3«6®_Ý×A3V >’‚òk-uù#Ñ¿AAAAAH Àû ¬S¤‡%$ä»wl£@üŠ|~~šýãZ¶iï¹|êèãåËWŒ;žÛwîšsf¦f| ýãuRµJeØà ƒ ÀÈȈk×oðþý:´k+ÏJðó×ÔËœ¹óãÝ3Ë7¦îŒ122ÒyÓÍãYîîwX8o.ÃFŒbã¦-lÜ´+++Ê•-C‹æÍ([¦´"¯ŸŸ?”*S>Þóùùû“!}ú?Vþ¤ˆ 0DEEP°`,--ɳ”jdd¤bFVì¿#£¢000 \Ù²XÛX$IŠ lÕ*•¹zù"6ÖÖŠô¢E Ɖ“§¸~ã%K”àСÃDFFR¥r%9øP©böîsSì!¦oYLMMäë´O™’reËbbª™½³”kl~Se½dÍ’…reËÊKFÊùMeIj=ƲµµÕJ30ø5®³fÉÂè‘Ã=r8>|à̹ólÞ²•¹óðáãG¦M™ôÓ¯qâä)æÎ_H“Æ éÖ¥³Öq??ÍÌã³gÏQêì9爻ÿæï¶vÝž?Á‘Cû{Rê"ú— ‚ ‚ ‚ ‚ I!x­-ƒô LéR´nÛ%Ë–kíQ»„ã²%‹ä%Î~”ÐÞr ‰ŽŽ¦s×îxûøh–ÑlØ@buèÜw÷Ë´NŒŒŒhÒ¤ËW¬âÂÅKT®T‘]»÷Ð*Îò™¦1õÒ»W*U¨ ó|)S¦”ÿ6M>zz*/u+v©ºtéÒý±kM—.-[6­ç£§'/ºsåêU.^rçø‰“ôëÓ›~}{ËyMLL°±¶fùÒÅñžÏÑÁá•=©bû«¯&ÀüãŒ'__RÇY¾PÎïëƒk®œ¬_»J>öéÓgMž8ùÍÌÌpŒgVeõjU9qò/^¼”x{öº0dسÏíC HVYyøȃˆˆ\]s)òÇØœ4ç´°0ÇÚÚZžMÙð¿4Œ³„ml}ÅÖ¾õø§e̘‘íÚÒ¸á4iÖ’Ý{ö2tð@ÅûO_2l8ÅŠeʤ‰:óÄŽ+”§O¯ž æùÝÞ¾{ÇÜù ¨]«&§Ïœ•Ó££5ËŠzzy±k÷òçÏG®œ9EÿAAAA!IDï/+Q¼8M›4f÷ž½ìsÛO£†ÿÉÇ2eÊ@J;; ,ðK_×Ãã1ž^^4¨_O±| À'¯OÉ<ëÏiÞ¬)+V®ÆmÿŠ-ÂÉS§)U²„<3êÇz166NR½äÍ›‡žžÜ¾sGžíëÎÍ2¥òçûã×›!}zZµlN«–Í  ¤mûŽ,[±’n];ËÁÔL™2òâÅKòåËûÇ–3ýœ³aff†Çã'ZÇøøñ£bÿÂ<¹5û›y<~¢ÕF=RäÍ’§ž^^8g˦uþyÏÃgÏŸóÈÃòåÊÒ ~=­ü3fÎfÿ ÐCCC½Ë’'OnÎœ=Ç“'Oµú£œ?Îþm¹]]yøèÑÑÑZû#>|äƒC*9€£o=þN>âÚõë4kÚ»f`Y[[S¤Ha^½~§—W²xÞÞÞtëÙ'''–-Y¤soM€Œ3Ä,5ñËÇF}}ùòcccNž:ÍÉS§µŽ?þ‚ÉS§3°_råÌ)ú— ‚ ‚ ‚ ‚ I"Ö¼úŒ>G¦L›Ž···œ^±‚fÙÄ=ûÜ´þæÀ¡ÃlÜ´E^úLÔ’Zç1uÌ^wVVÊiîî—yõú5*•Jëïb—S ûåõ!}zÊ–)Ã%÷Ëœ8yšˆˆZ·j©•¯x±¢XX˜³ÿÀA­2>xøˆEK–òåË9-6h³zÍ:$I’Ó8pè0v¶¶TªX?áýû̘5›·ïÞ)Òílm)\¨ÑÑÑŠ6­X¡>ZûÁýhýÆM¬X¹ ??¹*”güØѤÿaO»ÐÐPfÌšÍ>·r¹Ó¤IÍà{DŵyËV&NžÊº5«(_®,‰)Z¢4™3gbï® æ»ÿ“¦Nãþýrš™™M5dð ØØX+ò¿ÿq'qåÊUyædºtiéÖ¥3mZ·Òù.^bä¨1xûøÈi2d`Óúµdʤ½o¢J¥"gnÍ2¢{vnÿeËÞ¹{—±ã&òìùs@³ìiZ5?n¬ÖuìÚ½‡y âëëh‚µ:¶§O¯ž(‡œû2cÖlnÞ¼%§999Ѿ]ºvî„¡¡!§NŸ¡gï¾têØQ#†Å[εëâååÅU÷‹¤H‘Bï²DEE1sÖvîÞMX˜¦eHŸžÑ£Fè Bùò…±ã'rþÂE¹M *ÄÔɵ‚ÚúÔã­ÛwhѪÎ÷VÇÎݸrõ*Ï?Lv{z{{3áb>"¿R§NMÛÖ-éÚ¥³¼Ôë®Ý{5f\‚ç355åñÃ{T¯YG¬ébgg'Ïj‹å~ù S§ÏàÅ‹—rZÞajjJúté´n”ÿIÁÁÁøúùafjFêÔN‰îqŒ··ÖÖ)pttL´ìjµš/_¼‰ŠŠÂÞ>¥˜ú¼½½ !MšÔ‰~¨Õj<==Q©Õ¤O—“ó‡……ñéóg,-,qrrÄÐð×­ ¬oYbû—¹™9éÒ%¾”dPP0>>>¤Li‡½½ý/­ÇßI­VãëëK``¶¶6Š±ãoðöñ!8(˜T©\zó_#ú— ‚ ‚ ‚ ‚ð7‰žàýxLðAAAAAAþ"Àû·x¿nªŠ ‚ ‚ ‚ ‚ ‚ ‚ ?MðAAAAAAá"x‚ ‚ ‚ ‚ ‚ ‚ ‚ð²dͪåKã-ëÍ›·˜¿h1·oßA¥Ráèà@“&èÛ»¦¦¦Š¼­Ú¶Ç×Ç7ÞsÕ­S›~}{'»_¼xɬ9s¹|å*‘‘‘ØÙÚR¿~]€•••Öë?q’e+Vòòå+T*iR§æ¿ÿêÓµs'R¤H¡È¢%Ë8|ä(ÞÞÞ’+WN:¶oGÃÿ(òŽ›0‘k×nÈÏŒ°³µ%gÎœ4iܼyò$»MãÖ‹¡‘!ÖÖÖ8gËJ¥Š©Vµ ††Ú¿Ùøüù /áÜùóøúúaeeEîÜ®ôîѲeËÄÛ_¿~¥K÷ž˜³cÛ–xóéSaaa,[±’ƒãéå…‰‰ ¹]sÑ«gªT®¤È›œ1CŸ²üèW?ö›f-Z͸1£¬ïÏÛ¿_êÔ®¥u}zZ·lAÇí022’ó5hÔ„°Ð0ÌÌÍptp P¡‚4iÔˆ´iÓhWŸñKß²€æ3nî¼ù;v‚€À@ÌÌÌ(W¶ #‡#sæLZ¯—Ô±÷DZT—É“ÆS¢xñx'Ô×gΞÙ3çâýÛŒ3°võJù¹$IlÙº­ÛwðêÕk$I"Cúô4ü¯Ý»uÁÜÜ\Îû;ûún߹èÑã¨P¡¼ÎïhúÖãñ'™7a‚ùwnߢèÇaÕšµ¼zõšèèhR§v¢~ݺtëÖ[Å߆……³nývï݇——FFFdÉ’™¶­[Ó¢yS­÷ª§—³çÌãì¹ó„††baaAµªU1lNNNZe“$‰ ›6³qÓ>~üˆ¹¹9¥J–`Äð¡Zu©é#;váåå…±±1Y³d¡C‡v4iÔPñY­o›<~ü„9óæsçî=BBBH•Êž²eÊпo2eʨ•_Ÿ1CŸ²ë2hÈ0=ò gnZß éß¿ô{“ó=Cß±TAAAø3Dï{ýú ŽŽÁZé‘‘‘¼~óW×\»ˆÅûyýæ ­[¶Ðy#ÝÚÚ:Á¿3v<÷< 2"á_1‡„„0hÈp>~ü˜èyyx0sÖ¢££É–M³OiGµªUtþݳçÏ9á"fqn–ðúÍJ/N¦LQ«Õøùùqêô¾¾¬X¹Š-[·£R© Ò™/¶ÕªYS>ñfÛŽ¬ß¸‰Í›1iÂ8ÅuêS¿»9{Žž½ûâêš‹™3¦‘ÊÞÇY¾bW®^åÐþ}ØÙÙÉùÏž;OÏÞ}111¡Iã†qÞ×[¹yóÛ·nR”öœy¬\½†4iRÓµs'ÌÌÍ8uú 3fÍæÙóçÌž9]Îûúõ ©Q½¼{÷žE‹—²lùJ&M¯è‹ ßø¥oY¢££iß±3OŸ>£e‹æäÏ——žž¬[¿‘­ÚpðÀ>äüúŒ½qÛ4cÆŒ:Ëncc›ì¾îýÅ›×oÞP­jï'GGÅó³æ°vÝzjתÉA166æÂÅK,^ºŒ‡±fÕŠ?Ò×c………³wß>æÎ_Hpp0¹råÔYúÖcPP¯ß¼¡`Á:X`lüý+úª5k™5{.¹s»2h@LLL¸äîÎÊÕk¸|å*{wjµšþqöÜyªU­BçŽí cÿƒŒ›0‘ׯ_3fôÈïmäíM“¦-ðÿú•–-šãš+'÷î?`ÏÞ}Üð€Cû÷aii©(Û´³X¿a#Õ«U¥O¯ž|úü‰uë7Ò¶]GŽ9ˆí÷k9j ¦lÙ2têО°pMYFŽû·ï2x`²Ûôé³g4oÕSSÚ´nEÚ´i¾>^¸ÈÑÃH}Ç }Êþ£M›·rðÐaMÿ Ô:®Ï÷/}Ç^}¿gè[/‚ ‚ ‚ ¿Ç@ÇÃPÇÃMPÐ0Lã<ÌsÀ°¬€€MÌðy8N@j Èdœì@. 7(Š¥r@E *P¨4-€Ö@{ 3Ðÿk@ ”Ð#©ŽŸ8™hž¼ K•ªV×Jöü¹äìâ*õ0H똯ä¶ÿ€´bÕjiç®ÝÒ“§O|¯ÒÉS§¥Í[¶JnûH/_¾Ò™¯mûŽ’³‹«$I’ôáãGió–­Òºõ¤kׯ'x~µZ-zz*Ò׬ռîÂÅKä4•J%•­PIªP©ªôíÛ79]­VK-Û´“\ó¾x{k½ÆÅK—$gWiï>7ÉÅ5¯4}æ,å­]·”3w>éå«WŠ×ìÚ£—äìâ*ݹsW‘¿t¹ŠR‰Òe“T¿úÖãÀÁC¥¹òHŸ(ß; .–œ]\ïÝèèh©H±’RÙ •¤àà`Eþز߾sGN;wþ‚äìâ*Íœ5G‘722R*[¡’T°HqEèÒ­‡äìâ*}úôY‘ÿÖíÛ’³‹«T½Vd·©®z‰ŒŒ”æ/X$9»¸Jí:tRœcîü’³‹«tìø EúÃG$gW©U›örZ``Ô¶}G©dérRöœ¹¥q&I5ëÔ‹·Íô­ÇM›·ÈýZ¥RÉé~~~RÅ*Õ¥ü…ŠJþþþrº>c†¾eùÑï37k!5hØDš2m†äš·€ÎkÙ²u›Ô aÉÅ5¯T®beiöÜù’³‹«´uÛçÔÕ¿üýýåô%K—+òëS¿³I’$5lÜTʯ ÖçÊÖm;$gWiíºõŠ×-U¦¼äâšWºwï¾"ì{cÖì¹rÚ“§O¥¹òH*U•¾~ýªèÝ{ö–œ]\¥ /Ééº>«Ÿ>{&UªZ]Ê‘+tãÆMÅ1}Æ/}˲cç.ÉÙÅUÚ´y‹â#§yx<ÖÙ7¾}û&•*[AÊ[ •ì6íÖ£—”=gnÉÃã±"}íºõ’³‹«´lù÷²ë;fè[ö¸ž?!åÎWP4d˜äìâ*­Û°Qq\ßï_úŽ½ú|Ïз^AAAøÿO`` ôùóg)888Ù   ÉÓÓSò÷÷WÜ¿KÈîÝ{¤Ý»÷$—úÇÄpÚÇÄtZÄÄxÄÄ|jÆÄ€*ÆÄ„JÇĈŠÄÄŒòÅÄrÅÄ”œcbL™bbNébbPN11©Øø”]œ¸UŠ˜X–eLlË<&Ö7öe'.fOìLWŒ-Qb¼Üž½n”¯T…1ã&°w¯ÓgΦ^ƒFL›1KgþýR¾bÎæ­Û˜5{.5j×eða:÷L177çÐá#T«Q›•«×0oÁBZ·íÀð‘£ã-“Z­¦gï¾ôìÝ—7¯ßü’ë ÆÀÀ=áûöÝ;&OÎø±cÈš%K¢ù:̉S§Y0o¦ff‰æŸ2m:Š_«'Å‚E‹ñôòbʤ‰‰.±*•= äG’$‚‚uϬIJY*”/LjaC³ìŠ)@pÐ÷ÙŸwïÝãÓ§Ï4nÜPñëzÚµiMdd¤Î¥ÏöìuÃÊÊŠºujS¦t)<¬µŸØׯ_yöü9¥K•T,§ehhHÏn]8~ò”^ušºê1**ŠS§ÏP¼X1\˜=ѶM+ 8vü„œB‹Íc†¾e‰ëw¯^¿æÞ½ûÔ¬QºµkÉ‘#GµòI’„«k.fϜΩãGÉ›'w¢eøQÊ”)Y8.©X³n½b«äŽ½±~Uÿð÷ÿŠ£ƒƒÖr€Ù³ÉÇc]r¿Œ·Õ«U¥@üŠü:v u«–”*YBNsÛµZM×.³øŒŒŒ?v ­[¶ ]Ú´ ^kNΟ‹Z­fɲåɪ¯ä”åè±ã˜››Ó¼YSÅyJ–(AŽÙ9vìûøõ'ÇÞä~>Æ'0(•JEvgg­cα}à«‚çøU}]­R‘.]:À¹Ó'iÜè¿_rÉD×.º¾g$§^AAA„?G,¡ù  d̸ñ8gËÆö­›±±±&**Š¾ý²nýjÕ¨N¡Båüß¾}cÔ˜qT©\‰¹³gÊûÜ>r”ƒ†P²d š6i¬x I’X±r5‡öï#{vgBCCéÜ­{÷¹ÑºUËx÷ùÕ±¶N¡¡!Ÿ>}æÇXYY‘+WN­½€bEGG3pÐP*WªH“Æ ™=g^‚¯áéåÅø‰“5b¸Î%têôÜö`ï®XÄÙw'1Ïž?gÃÆMtíÜIçÞDº„„„ððÑ#Ò¥KKæLÚ“Ô²ôêÙ]gúEwwJ”ø¾‘‡ÇòåÕnã|1íþøÉce;qêôêÔ®…©©)uëÔæâ%wÜ/_¡BùrŠëK:ÅŠ t=}ú4ÉušTºêñõ›7„……‘/Ÿöž/ööö¤O—ŽÇŸÈiv¶¶ 4@çù<Ô,Ó·ÿ/Vccc.¹_¦Qœ AAÁ<{öŒ‚ `–„ÀÏ“'O  T,kúµiB5üsç/pñ’;E knúÖ¯W—ú1û3Æuóæ-ÂÃÃ)gß+[–,Zä¶Ð§###yòô)©RÙkB*WªHåJiúŒú¶i¬ß9fìÝë@ڵȘ1#2d`ŸÛ~Z·j©Èצu«$×yB,--©Q½:[·mçî½{”.URïzLÈÏö/€Ò¥K±gï>^½z-l®ß¼ @É8}ýAÌ’É%uÜX600Ð 0?xð æÚùÓ¦M“àÒÅqåË›—ìÙ¹~ã&áááŠ=Ù’Jß²xx<Æ%Gv­}CòçËÇÞ}nøøúâèàðÇÆÞä~>&$]Ú´dÍ’…1ý#nÝÞ¼y KKKŸW?ú}½xñb/^L~þõë×D_÷wI:5û÷ÓJW«Õ\¹rsssòçÏ'§.TˆÂ… iåà‘Çc\]sacó=ˆ‚ÖÂ&&&dÊ”‘ç/^ V«åã7nÜ$gNx÷î==ÂÐÐÂ… ‘&rŸÊܹ]µ‚k ùaÍÓgÏptpP±õmÓ¸ËSÇõàá#rdÿ>në;f$·ì3gÏ!<"œ ãÆpûÎ]åKÎ÷¯øè{ã£ë{†¾õ"‚ ‚ ‚ üY"€÷³fízEš¯¯V>I­fæô©d̘A¾ÙbbbB³¦M8}æ,÷Bdd$ bÚ£zµªŒ7}nû<GŒŒŒxþâ…VÙbûºŸ_Â3)’")õ÷:æ/\Ä«W¯iP¿ÕªVÁÑÉ‘gÏž'úZçÎ_àØñT®\I1³%C† L<‘q&ѹkwJ•,IxD8ÆÆÖ†Ó¦è<ß®={°¶Öåß½{Ï‘£Ç(V´cFéžÍ’”6MH쬖wïÞë<~óÖmüüü¸{ï>Û¶ï TÉôï×ç§Û()õèãë‹J¥Òše˜äŒI)KÜúþ]c†J¥bÿƒ*TPÞ/«níZ¬XµšW¯_k•åWÉ‘ý{ˆ½þ+ê~Mÿ6d¯^½¦Eë¶4kÒGž–е¾|ù ¯OŸâÝ¿ìW•%22’€À@Š8jnÌ>r”ã'N’ÛÕ•^=»ã3®}ùòG‡d½wïÝ×°utt ÄÖŸù|Lˆ æÍ¡k^4jÒ\þ¡ˆûåË FõjŒ6Dk¹ÉŸ_=†Ç´QRf*ÆÒwÌHjYbýÎ1ãâ%w¼}|èÝ«‡œV§NmV¬Z;}û:dÐ/­÷X±Kµ…†~ûeõ(Ÿûô/;;;š4iÄÜyóY¿qv¶¶øúùQ¤p!*V¬ Èö}üJŠïãi’ò'$öÆüךÔñKŸ²„…+ßÏ_¼àø‰“|ûª8Gì’ˆÉ{·lÝÆ–­Û´ÒK—*©<%÷3iúŒY:¥J– EófòólٲҸѬ^³ŽÕk×abbÂׯ_iÔð?òè±|ìïìë Ij=ÆÚ½g/×oÜÐJwtpй4éÝ{÷èÙ[³t¥½½=ãÆŒ¦fêñ–gÇÎ]lØ´×\9;z.9r(òÔªQ»wï1uÚ ¦OŒ‘‘’$±pñ|b– ŒŠÔô™°°0T*W®^#_Þ¼œ9yœÌ™3ñöÝ;FŽÃò«È–5+ ÿko™–-_ɪ5k©Y£:;´ÿ©6ýÑÇéЩ+¡¡¡lÞ° ù˜¾c†¾e÷÷÷g؈‘ Ð/ÑÕ+’óý+ÞzI`ìMÊ÷Œ_Q/‚ ‚ ‚ Âï#xA† 8è¶W‘öêÕ+š¶Ð^*mɲå¬]·àà`ŒŒŒ°°°ÀÐP÷žj¶66¬^¹ŒÑcÇ3söfΞƒ““U«T¢}»¶:gu˜šš*nph–I’$éÕÉŽmšL)S¦”Ó\rä wîÜÔÿ¯+V­–o¬1xØpz÷ê¡s™¨Ý»wŸeËW²aÝjìlmÍ¿vÝž?Á‘Cû“´]\ë7lÄÈȈ6?,ƒ÷£¹³gÊ{£òäÉSæ-XHý†Y³j…üëòä–ÅÊÊ·½» åî½ûlܸ™ý°qýZ¹ÄÎÒŒŒŠÂÀÀ€reË`mcMtt4’$)nè¼xñ’‡Ñ¢y3ùæ1h–7EFFê\š.Öî={3nyr»²zå ­ ž^^4jÒŒôÒsúä1²dÎ h‚4}ú àÊÕ«lߺY«ýÜ/œãÿ±w×qQlÿãÇ_4¨„¨`7Ƶ»»;¯ÝÝÝy½vww#`^;Q¯ÝX€H(½»¿?`÷²î‚»˜Ÿß÷ý|<|\væìÌ™3gÎì÷œsÒ¥K‹R©äCP.üËô™³Ù¾s{½vãä”Æèsš”ÏŸ?ÇoG¯€ysf³g¾lÚ²•Úõ2{æô$#©r´¶‰*/á¼L_cL›aì9ýÑmÆnO/ÌÌÌ(W¶,¡ñsº¹º’9s&¼÷îcÈà:ÃÙ}úêÀ·”ã׶!õëïé3Y»n=cF¤}Û6˜™™Ìø‰“iÛ¾#«V,£Bù¸vJ}ß2ô!·u\ú¨¨({Þ÷(G0¼ý2&/–ÚíWÖ,Y(_®œfH`õüš ƒÉi{Ç£3Wá—Û…äß“ž<}†åó·dÉ’Yó·B¡ mûŽø>ΚU+([¦47_d¿þƒhÔ¤9÷ïI´·Ù×ÎÑ÷ªëI1´ÕÞ¾{«ÉkB!nú_ü(Y¢ž;ùøñ#>>ç˜0i ž^Þ¬[³Jïp®]:w¢~½º¼}÷Ž}ûк]ºtî¤õVûvm9qò4ž^Þšá1Ÿ<}Š•¥•+Uäø‰“¤Œ©Û%¥RÁÒÅ 5/ídÉœ™óæP¾RU¶mß©7€§P(˜0i Ûwì¤y³¦ü5y¢QuèkmÌÍ[·éÑ«7*•ŠÍ7P0Á°¢`|›alÞGŽKî\¹èÖ¥óW·gìï¯ä–‹!¿3¾¥\„B!„BüxÀûLMMtzg¥L¥û?ÞÛwìdþ‚E-R„éÓþ"k–,\¿~Co°âæÔ9~$®Ï9|Î]`ÇNvyx²rùÍC‚ßMÂj ¹çÉMÆŒxüø‰fÙ´é3ÿŽSš4ìÜå¡Yþàa\ïŽ#Gqïþ}š6iŒJ¥bÐÐá¸çÉÍ‹/µ† úHLL ;wy>}:Ê—+Çó/˜3o>uj×âØñš´±± .X³s—üQ€<¹skå5,,Œ£ÇŽSªd Òê®41öö”.U’5+WP¼TfÏ™‹§ÇÎoÊ‹™™™fn•’%JP¯nj֮ǔ©ÓX¿fðß’¸çÉͺ5+5ßWñ–pˆTϸ9»¶ïØÉö;uŽÃÓÛ[+€—ÁÍ{½Ø²u;÷< Uª”L2‰Ê•*R PQ ,¨§8päÐdÕ¡ÄÊQsœqÃÇ}Ù{4 0´z†‚U©TÌœ=‡U«×R¯n¦ÿý—Þ¤k×­'8$„5«Wj‚wÊ—£}»¶,_±’K—/':|š©©)ÎNN4¨_[[[ºõèÅšuë1l¨Ñç4)Ož<ÐÊcBêat‹)B£† hÒ¬#G¥JåJI8¿ÆrtqvÆÜÜ¿7o Þ®1m†1yùÑmFpp0ÇOœD¡PPµF-½Çpþü­á"¿MH4IN9&¹ídÖ¯?²~ÃF*V(O§í5ßspp`Æ´¿9|ä(ËW®ÒðÔý½1°Î¸º¹òÚÏ?¿7zçY4Æã'O°°°ÐrÎÐö˘¼ØØXckk«þ²q£†ZÁu»–° KNÛkoo§3Ù—¾åž´fÕò¯¾hpüÄInÞºÍðaC4Á;€ìÙ²1zäp:véÆöí;é߯ÏWËøGÖõ¤RŽ õïÛ× !zÕììl5½»*V(O¡B0hë7l¤gî:éÓ§OGúôé(XðjÕ¬Áø‰“X³vµjT× ÁnnnÎúµ«ðòÞÃù ÿ¢R©èؾÍš6¥s×n8::j‚爊Š¢JåÊÉ*;;[lmmyþ"îá—±yñ`Óæ-äΕ‹zuëh¥ÍàæF77îÝ»¯Y–/oÜpdwïÝש·ïÜÑJ£P(سw/n®® 4@'/»<<ù÷âE|Ÿ?ך!îá{Âaο€B¡ H‚ù¿§/Ë1{ölXYYq7Á±«óúõkêÔÖ¤¨T*ÆŒ›ÀÎ]ôíÝ‹ú%º¿—/ㆴuuM¯³.­KÜCº×¯ý(iÀôGnñ½.ž?Ë»±ç4)þ@Ù²e4Ë–-_‰R©Ô9G.\ˆûòòå«d< -G ÈÏõë7xòä©Îþž¿xÁÀAC6t0eË”6ºÍ0&/?ºÍØ»ï111têØü_ Ê俦²ÛËû»𢣣9zü©R¥¢à5ebl9&æ[ë×k??”J¥ÞëHÄò{í§Y¦n?þ½x‰6zzaÙ’ET­büo$}çTÍÓË›‘£ÇR¾\Y-˜§·‡)ßf“w¿7o°±±aÅÊÕZË•J%÷{þÄÉSäÉ“GGG£~}¾¶7)_þÎHN¹!„B!„øy¾ÿ]â»QÆa™ða„R©dã¦-q+”Zéÿ½x‘©Óf P(´–çÉW×ôš97¾•B¡ F­ºÔ¨UW3§Ñ·ð÷÷§|Å*ôêÓO'ï'O&((ˆâÅ‹i–­_»šÛ7®êüëÒ©#»¶oåÊÅó@\¯%}io߸Jù±µµåö«,[²ˆ{¸¥/­z{•+Uäö«tŽßWB—._ x±¢É*‡3g}&{öìÉÊ‹­-ëÖodîü:C!½}ûŽ—¯^iõ (Z´ÎNNxzzë̉´uû,,,¨V­ §NŸ!0ð5 aƒú:ÿ:vˆ{Ðìéå­ÙÆü‹ø³m{­ùåT*ËW¬ÄÊÊŠºujsÝ1¤­¬â†;á‚æ±Úö;Q©T:¼EK–²s—C L2xqCâ\½zMgÝ74Ãu~Íž=qóù©ónì9MŒ§—7‡¥HáÂZóúœ;Ï‚E‹yúì™Vz…BÁÕ«×133ÃÙåëÃÕ%ƘrlÞ´ kÏÙ£P(˜0q2÷îß× +jl›aL^~t›áá鉵µ5û÷Õ¹ŽÚ·kƒ»{Ž;ΧOŸ’]î_R(Lš2Ú¶iMü¥É)G}¾GýrsuÅÔÔ”ë×ojz«½xñ’àà`2&¸ŽJ—.…›«+GŽÓ¹¿ð/Ûwî"$$DóÀ¹I㆘™™±fÝz! —,]Îå+W1ÿÊÃéàà`FŒ@÷®†Ï?ù%cóR»V ÂÃÃÙ·_»wßõë7xðð¡Nûõ£ÚÞo¹?"C†¸¹z¯^»®³NÝ–f̘!Émüèºþ+DGG³jõZÖ¬]¯³N=^ºté4Ë|Ÿ?gýÆM:õ%±ô‡¡YË?u®£ÕkÖEÓ&µ–×­S›ÈÈH¶ïÜ¥µüêµkøûûS´ÈC›+ úöÀƒ‡Y½ry²‚w‰Sˆ»ÖGG…òåX¹|i¢Á;0¾Í0&ï}{÷Ò{m¨ïÇ áö«šÞ“ÆüþJJbmoR¾üal¹!„B!„ø¹¤Þo¬h‘Âøøœcæì9tëÒ™AX¾r5ÅŠáêµk\½~ÿ€œœ011!6&–uë7J‡víH㔆°°0öí;À“'O>lÈwËÛ3__¢¾ÃœiÓ¦¥YÓ&ìع‹.Ý{ÒºUKR¦LÉÕk×Xµz ©R¥ÒéIð;züø &&&dË–õ«iO>C@üÐgaŸÂxüø ÇOœÄÚÚšáC“wž¬­­éÕ£;ó,¤m‡Nth×gž?ÁÊÕkˆ‰‰Ñ9!.P1bøP†I—n=èØ¡=–––xzyããsŽ¾½{i†yòØí @ƒúõôî»RÅ 888à½g/ƒôÇÔԔ̙3±xé2º÷ìM×.011eËÖm\ø÷"C‡ 2xx¨ïQŽƒôçô™³tìÒ•ýú’>]:þ½t‰¥ËVP¢Dq­9‹ž>{Æ’¥qó¢¥Iã¨5L«Z®œ9)T(®@»¶­ñØíÉ„I“ùôé3… $*2ŠCGŽ°wÿŠ)B1=AÝm;v`›Ê•JÅǹzí:W¯]#C† tîØ>YçTíè±ã¼~íGxx8W®^ãêµk¸¹º2w¶v¯Õ~}{Ñ¡SW:têB¯ÝÉ‘#;AAÙºm;=¢y³¦ØÛÙiÒY!!¡DFFi-¯T±...F—c³¦MØ»ïÿ9ÄçÏŸiP¿±±±lß¹‹ë×oзw/rçÊßf›—åþƒ‡Ü»wŸºuj':S£õ™6cÿ9D‹æ͸{÷wïÝÓ¬¿s÷.÷°ÜÜ<“U*WÒÚΆM›H™2%AAAœ>s–/^R¶Liú÷í­I“ܶ÷GÔ/GGGš5mÂÎ] 2ŒíÛâèèȳg¾Ìž3SSSºwû/hfffÆÔ)“èÚ£íÚw¤s§ŽdË–•;wï±~ÃFœœœ=r„&}¶¬Yéݳ‹–,¥i‹V´kÛ{{Nœ8Éž}û)Sº­Z¶ÐÊhH(K–.G¡TðæÍŽ;ApH}{÷ú¦’Ææ¥EóflÞºñ'óáCÿ(€ïóçÌ›¿4iéÕ³‡Öö“ÓöªÏ©ÞüfËJíZ5“}¼†ªZ¥29sæ`ë¶í¤Ní@õªU±´´äêµkÌœ5Z¶h®ó½Q×ý8uê´æóçð¸y__½z¥Õ~4oÖTk.´QŽÅŠ¥\¹²ìÛSSSêÖ®…•µ57oÞbåê5ØØXk _ýg«–ìÜåÁ_OçÝ»÷+V”˜˜Nœ<Éö»È‘#»f(Z€Ü¹sqïÞ}úôëÏAqqqáÔ©Ó¬Z³– åËéÌé×¢YS¶oßÁä)Sùø%Šñô™/ .ÆÊÊŠ=ºiÒzìöäü…)\¸ÎÄjeË–ÑòÒsÃè1ãP(+V”ÝñÃ|'äàà É¿±mFrónc~%dhÛ«fÈï cËE!„B!ÄÏ%¼ßX—N¹uë6ž^ÞxzycccM§Ž4 ?ïýýñÞ³—²å+qëúlll(W®,3¦MeÑ’exìþïA†³“#‡£K玿ú5yâxÒ¤qdË–môö9Ä=T(]ºãFJrnßŇ ØØØè'íKûöмoaa‹³3 Ô§{×.ß4?SŸÞ=±µµeåêÕ òß\o9rdgñÂùÔªYC+}£† ˆŽŽfîütï÷`ÌÖÖ–ýûÒ·w/‚‚‚8yê4ùòåMt#sssê֮ŖmÛ¹ðïEÊ–)MãF ñ`ùŠUtê77££#cFÔšãê[ZŽÙ³gcúՌ?‰!ÃFhåyÂøqZ`ïܹ‹B¡ 88˜ÑcÇëÝoÇöí4ÁžlY³²kÇVfÍžËè±ã4½‡¬¬¬hÚ¤£FŽÐÚ¾Ú’¥Ë5[[[“1czvïF×®q°·Oö9…¸‡ÁÊÊŠ ÜônâæÌ\³r9sç/`¤)šå©S§fÈ tëÚY+}bå‘pù†ukpqq1ºMMMYµb)sæÎg×nONŸ9«©3ãÇŽ¡}»6Zß5¦Í06/?Êîø@xÃDáõë×cæì¹ìöô¦Eóf?qR§W"Àž½ûس7®'EÑ"Etx«V¯ eÊ”äÌ™ƒÎ;Ъe ^Éi{Týš§ú2?©ƒw°·Ã‡¥fêß|R¾BPP®éÓk‡ÂÃñ´´Ôyèq6‚ƒƒ±··× ;÷¿@©TÀçðpÒ¥M›äpH"iÁÁÁ}ühP9*•JüüüP(•¸¹ºj=ÜûV±±±¼{÷¥R…››ë/†Éßߟ°°O¤K—6Ñ^Pßr¬~~oP¡úîåÆScEDDðöÝ;ìíqttü®Û6VLL o޼łôéÓé €ªI›ñ}üèr4¶~}üø‘‚H:5iÒ|=}PPƒƒIŸ.ÝWó®R©xûöÑ1ÑdpsÓ{ýYŒÍKhh¤NíðÕrüÝÚ^c(•Jüýøüùówo«ÿ—Û •J…¿¿?‘‘Q¸º¦ÿê=&66–·oßbnnAÚ´.˜šš~uÛŸ>Æ5½«ÖP•‰ ãý{ììíôWgÆ´?Òüýõ¿\.B!„BˆŸ'44”ˆˆˆoúo•JEXX66qó¢§Nú«ßñðØ @µê‰ÇSR;Ø>±ñÿ@ÌŸþ­^¯LðYÿ9P%ø¬HðY¿L=¯Ë—«ù§)‚Ÿ¿\—0!Ë´Hï €'„B!„B!„Bñ=Iï÷à™~-B!„B!„B!„âç‘žB!„B!„B!„¿ à !„B!„B!„Bñ‘žB!„B!„B!„¿ à !„B!„B!„Bñ1ÿÕß—@ášÏÖÖV¤M›ö—æI©TòêÕk,,,puMÿ«‹(YBCà ÅÒÒ{;;¬¬¬M«P(D©T’"e ìíuöÅÿQQQ¼{÷{ûß®Þ}üø‘ÐÐ0œH‘"ůΎH†ß¹~ !„B!„Bñÿé÷ÿ™#ÇPµF-Í¿þ‡üê,ñéÓgªÖ¨EÛuVˆŽŽF¡P”öÔé3Ô¨U—"ÅKR©JuÊ”«Hþ‚E¸ÿNÚˆˆFŒÃ…‹Q®be*T®J±¥éէ߯>äßBdd¤Ái ÑÑÑ¿:ËÉÊ‹1õK].*•Ê¨ô‰¹}ç.UkÔbãÆÍ?¥l¢¢¢ N»dérªÖ¨ÅÑcÇJÞþWHýB!„B!„Bè#=ð~²†Mšiõ315!UÊ”äÊ•‹–Í›Q¨PÁoÚþØ1#  m‡N?äªÖ¨EÏÝiÞ´‰Aé-,Ì©Vµ ..Î?$?†ˆeÕêµlß±¿7o055¥@ü è×— åËéý·Aôé7++K†B–Ì™Q*•„……áì¬{,sç/d·§•+U¤^Ý:¤J•ŠOŸ?cgkûÓwÔ˜qÄÆÆ2kÆ´Ÿ¾ï„?~ÂÌÙs8wþÑÑÑ8ØÛÓ A=† HÊ”)uÒ?q’ÅK–q÷Þ=”J%3f¤Cû¶th×­´õ6&*Jà£L™ÒL?VóùËëîK¹rådñÂùÉ΋B¡`ͺõlݶƒ×¯_ÇÕ¯üù4påÊ–ÑÙ_pHsæÎ㟂••åË•eÔˆádÎœé›ËñGQ*•ìöòfÓæ-øúúIÊ”))\¨ ½{ö D‰â‰~7wî\T«Z…ôéÒý´üþ *•Š¡ÃFpûÎ]Ö®^A† ô¦“ú%„B!„B!„HŠð~²gÏ|133£v­š@܃Ù÷ïßãéåÇnOþš<‘–-š'{ûÙ³eÓüýåCàïáãǼxñ•RiðwlllX¾tñwÏ‹1†ÉþqÏ“›Íûóéó'zÄ´é39wþ*•Š¨DzÖIýB!„B!„B|ð~GÇÔL›:EkÙ“'OiÒ¼%ÓfÌ¢IãFXXXhÖEFFr款ϟcanNþ|ù(^¼Øwy¨ªR©¸xé?!**šŒ3P±By¬­­uÒžì?pB… ²móFMÙ¶lÑœú ›0aÒ*Wª¤Ù÷ÉS§‰åß‹¸Þ, ÕÌÌŒ*•+iå âæLÚ“§Nkí?WÎœ:½^bccù÷ß‹¼öóÃÔÔ”¬Y³R¬h‘DÏi`àÎœ=Ëû÷þØÚ¦¢TÉ’äÈ‘]'ÝÍ›·xûîOŸ>#uêÔZùN“Æ‘"… 'ZŽ?@‰ű·³Kn•Ò˜¿paŸ>±Çk7îyrФq#œœX´d)GŽÓÔ”J%S§MÇÍÕÛ4s¤5kÚ„6í;²|å*ZµjK|ÏÇPJ–,ΰ¡ƒ ÊOš4ŽÌœþ÷WÓ›—§Ïž±eë6jÕ¬¡Õ‹¯aýzT¯Y‡¿§ÍàÀ>oÍòÝž^ܽ{ ãÆЮmÍòŋѶ}'–-_Áø±c’UŽ&q/œ>}†'ÏžáìäD…òåI“Æ1Ùç3&&†Í[¶‘-kV¶nÞ ¤®X¡<-ÿlË’¥ËY»z¥fùk??áf äÏOºtºór>ñ‚ÇŸ$ºÿŒ3'wnåOž<åâ¥K„††áââLÅ prJ“èv~D]=v<—/_Á÷ùsŠ-BƒzuÙ³o¿Þ´R¿„B!„B!„†Þo"GŽì+Z„3g}xûö™2eàÖí;ôêÓÀÀ@²dÎLDdoÞ¼¥x±¢,_¶ä›>‡††Ñ±snݾCÚ´i±´´ÄÏÏg6¬]CöìÙ´Ò:œ°°¸á97oÙÊæ-[5ë èOŸÞ=µÒ9ŠÀÀšÏ™2eäÄÑÃ:ù8ããòå+™6uŠÞ:M›Î‰'Ù½k‡fYPP={÷ãÚõë¤OŸŽ”)Sâëûgg'V.[J޼ž^ÞôîÙC+0š%sf6¨Ïö;9yꔦ^ÂãXºl…V~lll¸}ã*ÇOždêßÓ5ëÂÂÂtæ¼9|]»ü7œéƒ‡éÖ£dpsC¡TòúõkòäÉÍš•ËqqqÑúþÎ]Lþ+.ð”5KfÞ¾{OHÈTÚ¶iÍø±£µ‚~ËV¬Ô'.]ºÌ¥K—5ëÊ”.ÅÆõkõÖ¥R©É·ÇŽmß<”kLL G§Dñâš €Z»¶­Y¼tÿ:¬ \¿qƒ·oß1 _M@âz‘¶oÛ†K—.süøIþlՀа¸žƒ½Ã7åScórøðQ”J%ÚµÕÚNêÔ©©W¯.›·l噯/Ù²fàà?‡°¶¶Öéi[ªdIræÌÁ?ÿÖXŒ-G5…BAËÖmyôè1vv¶¼{÷{{6®_«umãóçÏDFF’)SF¦E‹aóÆuºAü3>ŒŸ8IkÙœY3hØ ¾Îö>Âì9óÝÛ6­µ†EU(Lœ<…mÛwâ`oOúôéxþâ*L™4ÆêÝÎ÷®ëT¬PžIÇS¦t)&Nþ+Ñ´R¿„B!„B!„†0ýÕÿñ÷ÀÄÄD3¿Ú§OŸèѳ7*•Š=^þg?gNgÑ‚y\¹z‰“¦|Óþ–,[έÛw˜ö÷_œ;s’“dz}ë&ù+APJíüÙSšLÇåÖõ+š=ºwÕIòØQÍúŒ3&š–-šcbbÂ.OÝ2 àôé3äÏ—‚Ð,>r47nÞdáü¹œ=u‚Cö±o'ŠX½ûö':ÁÐu7nÞ ¤žù¹J/¦•F}œ·®_aôÈá,[²HëX/]ðѤmצµf¹ƒƒȯ•öÖõ+tìÐNkŸã&LÂÒÒ’sgNqìÈ?œÕ«UÅÙÅ™‡éM¯T*é?0nXÌ¡CáæwŽÞ¿ÿ/8§îwâÄI.ZLhè=&«U­Â´©SH:µVžÂÃÃÙà Þü–-SZ“Þؼ¼÷÷'UªTØØØððÑ#-^Š……óæÌÒÿû÷Ž&8$„¢ÎqóÄí?pC‡×ÝÞ½zh‚÷ïß¿ÇÙÉÉèrTË”1ƒÐ|®Z¥29rdçîÝ{|‹É“&зÿ@Ú´ëHüù©\¹"åÊ–¡à`ff¦“Þ,AÔPJÈÄÄDg&ãÚõë,Y´€|ùòj­[·~n®®Œ1Ló={{&ŽKÝúضc‡ÖP‘ ÷ó=뺱¤~ !„B!„B! !¼_àõk?Š•,€R©ÐjÕ¬Á¤ ã4é®]¿@¶¬Y5=&ÔÜÝópøÈQnß¹KÅ å“•%ŠS¢Dq?ðòÕK"""Q)•@\PQ¡Pè}(ÿ#´jÙœ³>>xxx2|Ø n®ª]»wcggK½ºuÿ+—k7È•+§N¹¨ç…»yó5kT'66…B•••Þýª—GFFþ”ãÈ“'ÇOœdÊÔ¿©[§6(€¹¹¹Nï%ˆ«¤L™RçXóäÉÍYŸsDDDh‚ŽÉejjʨþÛ1FDÄ•§e|ùþûï%®^»Fþüù¨NU¬,­´æGŒˆŒâ·J¥âÐá#tí܉,™3cbb¢uŽÔ×Ì«×~Œ9’üùóòéÓg¶ï؉÷ž½| bç¶-ZË~`àà¡zó»}ëfŠM¬¼DFDbee©ÙÇ¡ÃG4ÁªÿêWTü¶#µ–?zü˜C‡ðùsxürKíôF–£ZÉ’%t–¥K›_ßçßt^«U­Â?ö²uÛNœ<ÉÂEKX¸h ŽŽŽtêОîݺ|·6cùŠ•xzy3|ØjT¯¦µîõë×øP¥Je‚>~ÔZçè舭­-7ôªMè{×ucIýB!„B!„BBx¿€mªT´þ³%×ËîÓ§ÏìÚ¾•‚ÿÐJ÷áCÜüq¶mŸè¶¿êãÉ“§Œ7«×®q=æ¬,­øþÓˤZÕ*8;9á½g/CÄÌÌŒ/^âåËWtlßN«7߇ ¸r™=g^¢sfÆ—¹¹9fffzBšåÖÖÖü, æÎaøÈÑlظ™ 7“2eJÊ—+K«–-(W¶ŒVÚ‚ˆŠŠ¢tÙ ‰nïCPÜÜ~Zþ ¡0ÄÄÄP¨PAR¤HA¦ø¡T£££µzd©ÿŽŽ‰ÁÄÄ„òåÊ`kgKll,*•J+[­j.œ;ƒ­­ÖòbE‹Áá#G¹xé¥J–Ô¬ËàæÆö­›õæ7aoHcóbii¡9NÇÔ©)_®–q½7£â‡rU§·´Ð.—¬Y²P¾\9͆њô–Zy1´Õìííu–™˜|Ÿ“³fɘQ#3j¯^½âøÉSlÚ¼…9óæóêõkþþkò7ïãð‘£Ì™·€fMÓ½kõ>q=0KŸ8©w çßüHýB!„B!„BBx¿€½ƒ½fø±²eJÓ¦]G/]¦3G™zÇ¥‹j†8ûRRsË%%66–.ÝzàÀä‰hÒ¸¡&ˆÕ±K7||ÎýÔ2133£Y³&,[¾’ÓgÎR¥r%vîò u‚á3,ãË¥OïžT®XQïöŸ˜>]:^ûù®3¤¤z¨:×ø¡ë~W×ôlÞ¸Ž×~~œ9ãÃù 8sÖ‡C‡Ð¿oú÷ë£Ikaa­-Ë–,Jt{ÎNN?-ï†R××À€¸ó—=žI›`øBMúÀÜóäfÝš•šuoß¾‹K“ ½••Ήôª¬Q½‡åñã'Z¸¸¸°tñBòQ˘1CüP“Qß½müѤ~ !„B!„B! !c^ýFŽ†³“ý= ÍòJã†MôðôÒùΞ}ûÙ°q³fè3}LLLPª”z×)ãçºK™R»GšÏ9ž>{€B¡Ðùžz8µðˆˆï^ÜÜ(W¶,g}ÎqøÈ1¢¢¢hÓúOt%ŠÃÆÆï={uòxëö.^Âû÷ï5Ë6¨ÀªÕkQ©TšåÁÁÁìÙ·{{*WªÈÏðòå+¦ÏœÅó/´–;ØÛS¤pabccµÎi¥Šˆ‰‰aÏÞ}:ÛZ¼tGŽÓYžœs¤P(¨Q«.5jÕåþƒ‡ß|œVVVT®T‘ó.ðòå+­uÛwìD¥RiŠ-‚³“žžÞ:uzëöXXXP­ZͲ©Ó¦S³v=Nž:­•V©Tâé剉 Å‹MVÞÍK­š5011aûÎZiÃÂÂØ·ÿ ¹såÒ 4Ö®Uƒððpöí? •þúõ]údm?""’n={Áê•Ëu‚„ ÙÚÚR¤pa._¹¢S.Ÿ>}âïé35Á­/}ïºn,©_B!„B!„BCH¼ß€½ãǡ߀AŒ?‘•Ë—qÃk–/WŽÝž^ØÙÚÒ¨a,,-8|ä(K–.§\Ù2thß6Ñí¦vpàîÝ{¬Z½{{;ÌÍÍ)^¬(3f$gÎØÚÚràÀ?T®T‰ nnœ»p­[·Ó°A}öìÝÇ™³>”.UR«'SŽÙ111aã¦Í8¦N½½=?~äÍ›·ôîÕC“îÈÑcD$ …ÇÏ«—0•×Ýœ9shå¹UËæœõñaÑâ%¸¸¸P½ZUã²µµ¥O¯žÌž;Ÿ.Ýzлgœ]œ¹~ý³fÏÅÄÄ„Nþ›7°zµª”/WŽ³>>tëÑ‹F ðùógÖ®ßÀÇ™1m*666?å\ÛÙÛ±mûN®\½Æð!ƒÉœ9111\¾rï={©X¡<¶¶¶šô;vÀc·&M&<<œÒ¥JÊæ-[Ù³o?#† Õ[Ÿ\\\8sÖ‡›¶%Kf>}úÄ‹/iÒ¸!iÓêFò™¯/Q‘‘ßåX èÏé3géØ¥+úõ%}ºtü{éK—­ D‰âÔ¨^M“ÖÌÌŒÇ2tøHºtëAÇí±´´ÄÓËŸsôíÝKkÙŽÚ³oÿAN¯žÝù£@~>|bÓæ-ܼu›6¶Ò^64$”%K—'šß–-šãä”Æè¼äÊ™“fM³k·'VVÖÔªYƒ°°0–¯XIpp0sgÏÔÚO‹æÍؼuã'NæÇ þQßçÏ™7!iÒ8Ò«g­ôÆ”ãÔªe §ú2?©ƒw°·3¨9JÍÕ“LS PQœ8qô°Îº½úpüÄIf͘¦™·(""‚¿§ÏÀË{/‘ñ›S¥JE“Æ >tˆf¨E}Nž:ÍŒY³yýÚØØX”J%ÓÿþK3Lçá#G=f!¡¡¸»çaDEGÑ¡cBBCéÞµ Ç ÑÚîò•«X¼d™&?fff*XÛ6kÒ”­PY«œ>C‡ ¢g÷nZË å+VÁ? @g>¸/­Û°‘å+VòáC&+V`¸1¸}1§]xx8ÓgÎÂÓk&ßéÒ¥eÈ ZsD%´ió&M™ÊÚÕ+©P¾_S¬d2gÎÄîÛ“Lwóæ-&Oý››7oi–YYYѬIc† „­Vú—/_1~ÒdΟ¿ é9éêšžî]»Ð¶Mk½û8}æ,£FÅ?AP!C† l\·†L™tçMT(äÎ7Œ¨ÇŽmßmXÂkׯ3nü$>zÄ {Z·v-&Œ§sœSçÌÝ€IDAT;wy0wþ?qÁÚÎ:зw/LL´›œ›·n3}æ,._¾¢YæââB‡öméÖ¥3¦¦ÿu0.P¨¨V@YŸ}Þž¸»çIV^bbb˜1s6;ví"""®~epscÌè‘zƒÐïß¿gÜ„Iœ:}FsN‹.ÌÔ)“t‚ÚƔ㕫×hÕº­Þk«S—p‡÷n'û|úûû3oÁ"öí? ¹ŽÒ¦MK»6Ò­kÍP¯;wy0zìø$·giiɽÛ7¨Q«®&°¦ƒƒW.ž×ZæsîR¿„B!„B!įJDDD²§#P©T„……i:É2½Ž‡ÇnªUO<ž’ÚÁ~ ð ˆÿ§b¾øœðoõze‚ÏŠøϱ€*ÁgE‚Ϫøeêá ¿ü[•È?M$øü庄i Y¦Ex?9€—\QQQø½yƒ¥…éÒ¥Ktn(c) ^¿öÃÆÆZ3/’zyxx¸Vo°„bbbx÷î¦ff8¥Iƒ••Õ9î¯Q*•¼yó†˜ØXÒ¥MûÕžt‘‘‘¼yûKKKÜ\]u”ÿLaaa~ø€•¥iÓº|uŽ»°°0üý°µM…³³óWó®T*yÿÞŸ˜˜S“*Uª_v¬þþþ„…}"]º´_½(•JüüüP(•¸¹ºbaa‘dúˆˆÞ¾{G ›¸¸8k±yQ×/k+k\]¿>”dhh¤N퀣£ãw-ÇI©THHH(öövZmǯà@XhiœÒ$9ôæïFê—B!„B!„ø•$€'¼/×IO!„B!„B!„â’ÞïÀû~]U„B!„B!„B!„ßLxB!„B!„B!„BüF$€'„B!„B!„B!ÄoDxB!„B!„B!„BüF$€'„B!„B!„B!ÄoDxB!„B!„B!„BüF$€÷˜¿¿?/^¼üÕÙB!„B!„B!„ Hïÿ°¡ÃGRµF­_o¦P(ˆ‰‰ù¡ÛW(§ŠŠúÕE’ìãüQå¨T*‰ŒŒü-ò’œr‰ŽŽþaÛ7¦\Œ¥T*›r4Vdd$*•Êàô?òýhÆ´QQQ(•Ê’•JeT}ŒŒŒüayùÛ~qçT¥RýÏ^§ÆÞû?[.Æ^?î> ¾ÿåëÔJ¥’ØØØ_ !„B!„ñÌuþ¯iؤ©S§fýšUZËŸ¿xA÷½©T©"£GÿÕÙü¥úöÈ£GiØ >}z÷Ô›F¥R±yËV¶lÛÎÓ§ÏP©Tdps£q£†ôèÞkkkMZÝ^¬\µ:É}N™<’%Jh-;ëãÃÜy ¹{ï&&&äÉ“›AúS©bïþü™Ùsç³wï>BBC±·³£nÝÚŒ6””)S&¹ïkׯ3jô8R¦L§Çί–Ϻ Ù¶meÊ”fâø±Zë6iFDx&&&XXXà䔆B ÒúÏ–¸¸¸$»¿üÞÐa#¸}ç.kW¯ C† zÓ]¾|…y qõê5 ÎNN4kÖ„~}zciiùMy©ß°1QQúƒ6_–±åpüÄI/YÆÝ{÷P*•d̘‘íÛÒ¡][LLLôî÷â¥KŒ? S3S¶oÝŒƒ½½ÞtÏ_¼`ÎÜùœ9ëÃçÏŸ±´´¤D‰â ì×—B… &zî?~üH×½°07gûÖ͉¦Ûå±››·ððá#ÜÜÜhóg+:ul™™Y²ë—>ƒ‡çλôêÙÆj­3n—/_Ñû½T©RêÔ÷àæÌÇ?ÿ&8$+++Ê—+˨ÃÉœ9“Î6îÝ»Ïì¹ó¸výŸ>}"MGÊ•-Ë€~}É”)c’ù ¡K×î„…}bÙÒEdÏ–M³îÍ›·tìÜ5Éï5BÓPRmmø½yìÙs9qòáááØØØP½ZUFšd^®^»Æè1ã©X±‚Þß‹›6oaÓæ­IËÊKÉ’9³îr®ScÎéÏhK ÍËãÇOèÓo@’yiÖ¬ Ý»vÑZfèujL^À¸ö+áïXS3SlmmÉž-+•+U¢zµª˜šj¿™œrÜ·ÿ+W¯áéÓgÄÆÆ’6­ êÕ£{÷®ØÛÙ!„B!„â×ÞOöì™/ÎÎa:Ë£££yæë‹»{ž_Å_Ê÷ùs>‚ƒƒ›·l¥gnzÓgÎfÍÚuÔ©]‹¡ƒannÎé3gY´d)·ïÜaõÊåš´ÁÁÁ<óõ¥x±¢d̨ÿ¡¾öƒÊ£ÇŽÓ§ßòäÉÍ„qcP(”lÞ²•½ú°yãzŠ+ªIM‡Î]¹sç.íÚ¶!Oî\ܺu›­ÛwðòÕk`mBŸ>}bðм~ý[[Û¯–Ï»w™1s6±±±dË–Ugý³g¾˜™™Q»VMÂÃÃyòä)‹—.cÓæ-ìܱUë¡£1å¨öðÑ#¦MŸÉ¹óP©TD%ÒóÉçÜyºtë­­-}ûôÂÑёÇ°lùJ^½zÍü¹³“}Nccc¹ÿà!¹såÒûÀ8gÎßT.‡¡ß€AäÌ‘ƒ1£F’"… û䯩Ó ¥¿>zyûŽ]ÂþýhÛ¦µNš×~~4kñ'ææ 4ìÙ³ñæí[V®\ÍŸmÛ³iÃ:Š-¢õ¥RÉYŸsLþk*/_¾"MÇDëȬÙsY±j5éÒ¥¥[—ÎXY[qôØq¦ÏœÅÃG˜5cZ²ë×—6nÚÂÞ}û¸‡Û_zôø1´nÕRg•µ•ÖçØØX:têƒù³UKþ(Ÿ×~~¬]·V­Û²w'ÎNNšô>¤eë6XZXÒ¶MkÒ§Oǽ{÷ÙíéÅéÓg8¸O’ÁÇŽ›ÀÍø‡ÿÑ_‚cbbxæëK77J”(®÷û©4òÌ×—Ê•*’+gN´_i3 :uáî½ûtëÚ™âÅŠÎö;6bèÖµ³Î> ½NŸ8I¯>ýpwÏÃŒé“ÆÑ‘»÷î±lùJÎ_¸À>oOâU©TÒ¥[O.^ºD•*•©\±"ïÞ¿cý†M´iß‘Û¶7¯»Î>”J%7m&22Šg¾¾<~üDç¨^­ªÞ<†} ck|P9¹õëK_k{m¿Œ½¼zõŠæ-[cffJÿ¾½I“& þ9Ä´³ˆ‰‰¡gîš´ÅŠ!m"uy˶혙kß#ýßûóÌ×—êÕªê=6gg½Û2¤ýãîj†ÞÛç/XÄâ¥ËÈ“;7cF@¡P²cç.†MTT4¶j‘ìr1ö>ð¥¤Ú c¯ š5oEÐÇüÙª%îyrsãæ-òÕ4ù QU®VCgùÃGTÙs¹«ú¬³. Påå½Gµ|å*ÕŽ»T÷sVïw ©_ =zôX•·@!Õà¡ÃUÙs¹«Ö®ß “¦Fíºª:õtŽ¶ïØ©ÊžË]µqÓf­åþýWï¹îÞ³·*G»wïi-_³v*{.wÕÒe+Ý׎»Tù QõêÓO•=—»êÞ½ûZëŸ?‘h{¬Ïƒÿ¨²çr7è R×fœå“RǧÄ­RÅDzRÄǶ¬ãc] c_ âbf‰ÄÎôÅؾJæÀûÍyìö¢B媌?‘Ý»½˜6cõ6áïé3õ¦÷Þ³— •ª2dØ6mÙÊÌYs¨Y§C†×;§…µµ5ûö zÍ:¬Xµš¹óЦ]GFŒ“hž”J%½úô£WŸ~ø>óýnǪP(ðôÞCéÒ¥¨_¯.¶¶¶xzyë¤ E¡P#{vuٳǽ=ô1(Ùù8vü8ôéÝ+«ÿÞ‚vvrÂçôI 试~ûŽ]äÌ™ƒõëi-1l(‡îÇÕ5½ÞýìÝ·ŸÃG1îl,­’î-ð×ßÓ011aì˜QFSÕª•5e—Ür´°° b…òl\¿–í[7c›ÄJ?~äá£G”)]J«Gƒ©©)½ºwàБ£ÉÎKhXÜq8Ø;]_+—ë7nðöí;š6m¬ÕÂÄÄ„ömÛ­wxº}ûE­Õ©[§6·ïÜÑ —PPÐGräÐ>Ö¬Y²`ffFPÐÇ©B…¶jÉÁ}{˜4a\’Çãå½¥RI·®5½¦ÌÌ̘0n,mþl…kzýõјúÍÀÁC©S» ÔO4]Xhöö_ÝÀÁammMË͵–—*Y’œ9sðÏ?‡µ–+Z”¾½{éôø*^¼þz÷óüÅ ¦LÆ„qcÉš%‹AyûšÐøúã`à±Óf¨ë×õÅ‚L3ñéÓ'­ùÿŒ¹Nã¶ÿg''!Òr¨¯»øú páß‹´û¢gVÁ? P¶l.\ø—ÐPÝ滽H™2%õêÖ¡l™ÒìÝ»ßàyÓNœ<Åž}û=r©S§ÖZgLýJèkm¯±í—±çÔßߟ“§NÓ¤q#­a ÍÌÌضy#ë׬Jt˜Þ„Û˜:mÍš6I´g“1 m¿Œ½?‚á÷ö«W¯KóæMµ¶mggK»6Æù ÿ~÷rÑwHÈ6ÃØk㿱±±¦éÂvìÐŽ”)SrèðõK©PàêêÊA9yìM›4ÂXJ¥’£F“1CzÆ×á/szNel[ú#ó’œëÔ˜¼$·ýR³°°`à€~T®T‘sç/põÚµd•chh(ݺvfÈ XXXh­+?@hXØW·#„B!„âÇÞo,8$„±ã'5KΟ=Í‘C¸tÁ‡ªU*³vÝz®_¿¡•þóçÏŒ;žŠÊsåâyÜÏyŸÓÌŸ;›=ûöãå½Gg*•Šå+V±ÏÛ“³§Npñ¼Å‹c·§·nßù©Çësî<þþþÔ«SKKKjT¯Æñ'uª¹¦OOÖ,Y¸tù ‘‘‘Zë._¾BŠ)(?²óqéòeÊ–)CpHGŽcÏÞ}ÜðP'm@` ¾ÏŸS®Ln޺͞½û8qòŸ>}Jt~oÞ0aÒF‘äUjGÇË{óçÎÆ&‘yé’¢~èYªäóü[Ž“&Œcì˜Q”)]ê«ûS{Â!ÔÔˆ$;/¡!quÂÎÞŽÈÈHîßÀÅK—ð÷÷ÿær¹{÷>€Þ:T @ܲ{÷ïé¬Ûí鉛«+… ¤nÚzÜ©‡<{ÖGk¹zž­R%Kj–ÙÛÙ±xá|ú÷ëcP=¹uëVüñ”ÔY—>}:&M¯ãë׌Y³‰ŒŠüêyêyÀ ¾ÏŸóïÅ‹<óÕô¿{÷¹ræÐ;·Ø H@` fY·®п¯nÄ·[9sè–Wll,ƒ£JåJ4kÚø«Çi(ueggOpHׯßàêµk|þüY'­±mF‰âÅ077ç¬Ï9­å¡¡a<|øB… j;Œ¹N!®>¾yû–§OŸi-¿ß&¼6þ»®Sël'göì( ?y¬S6G§FõjXZZR¯nüð9wþ«y‹ŠŠbÒä¿(\¸N`L½mCë—š!m¯±í—±çôÒå+¨T*Ê—+KLL >>çðÞ³—‹—.Øüëï阘˜0lÈ ƒÒ¡í—1÷G5CïíaI–{ŽørO|?É-}÷5CÛ c¯OŸ>áàà 3w™……™2eäÑãÇ(•JJ”(ÎÜÙ3éо-NNi >®„¶íØÉ­Ûw;f$æ溣ç{zNeL[ú£ó’œëÔ˜¼$§ýÒG=7䙿)Œ)Ç´iÓ2h@*”/§µ\©Trþü¬­­ùãßT–B!„B!’OæÀûBCÃX½fÖ²„¦ÕTJ%3¦M%cÆ ØÙÅÍccaaA‹æÍ8vü7nÝ¢páBšôOŸùMÑ¢E´‚׫[‡B… ’.mZ}DEE1lè`ÍCÉ)Rоm._¾Â½{÷ø£€nÃÄÄ„.;$9Ç”±'NžâÏV-hÞ¬é7—£!œœœ133ãÑãÇ:ëÔuýÇÿzš›u¼'N²pÑb­ž ÕªVaÚÔ)º½u ,uÐÅÙ¥RIÿƒ:df~œ÷ïµ…Ož<åæ­ÛôìÑ2¸¹Q¨PA¼÷îcÈàZõ®~Ý:\½z•ÉýÍÍ[·É•+'ïß¿g׮ݔ/WŽÞ=uçÔ1ÔÛ·ïpýbŸ¤[¿Îœõaë¶ìض…”)S&š.&&†¨¨(^½zMÍÚõxþâ…f]î\¹˜5cš¦÷\tt4Á!!uŽ{Ûÿƒ:|„¼îîôîÕçø9»Þ¿¯5Þ—üÞ¼aá¢Å¸8;Ó¸Qõó,"((ˆë×$»Œõ ‹¯ .âä©Óš‡»–––têОÁƒhꀱmF† ˜:eã'N¦K·”.UŠÈ¨HöîݽÓÿþë›ò>|è`ž>}F«6íhѬ)NÎNÜ¿ÿ€ýÒ£[WÊ•+«I›.]:=~¢3Ÿ¨¾ë`ÿþDGGÓ0>W£z5ÆŽŸˆ§—7+”O2o6mÆïÍfÎø[§§‹1õKÍж×ØöËØsªNBåj5D¥R¡T*Éš% Ë—-Nr.¶›·nsðŸCôïÛGo°ËXÆ´_ÆÜÕ ½·§ÿòè‘žrˆ/÷ ßT.†ÞÔ m3Œ½6Ò¥KÇÍ›·4A5¥RIPÐG¢££ ûôI§glr„‡‡³pÑbJ”(Nùråô¦1ö:5ôœ˘¶4¹yyõê5ûÔYnjjJÚµ4Ÿ“sš—ä´_‰Q\ ÎorË 0ð·nÝâÝ{¼÷ìåþƒûÌœþw¢óf !„B!„øñ$€÷ 3}欯¦K:5 Ô'66–GDl¬‚—¯^qÃ|%”9s&lllX¼x)1Ñ1T©\I3ü`7·D÷Sò‹a¦Ò¦ Ê%:-!SSSFö]Ë$$4”ã'NRµJeR¥J@™Ò¥qttd·——ÎC˜lÙ²Ò´I#V­^˪5k±°°àãÇ4i܈|ùòêÝÇæ-[Ù¼e«Îò2¥KiðÂÂ>Å¢%KY³j9¥J–$8$„yó°eÛv&ÿ5•éOO÷díú 4kÚ˜åË–`›*W®^eðÐ <”ƒû÷h ¿´tù ^½öcù²%_-•JÅ°£(Tð:´kkPY~üø‘©O×ZVð¸çÑ}”œr4„5+Vàĉ“ìعK3,bxx8Sþš†©©©æ¡orò¢ؽzíÇè‘#ÉŸ?/Ÿ>}fûŽxïÙˇ  vnÛ¢õÐßÐr‰ˆŒÀÊÊ •JÅ¡ÃGèÚ¹Y2gÆÄÄD§— ‡§' 'Y¯nþš:sç/h½Ùnjj7DÝí»ìöôÂÉɉ?’ÖÅ…úõêè<ü6Æy·4(½±õ+((ˆá#G1h`½Áý„Bâ{I¾xù’>½{RªD ,,,8yú4Ë–¯¤}ÇÎÜ¿"âËSÝ“ìÑãÇ:|„ϟõŽ'22ñàâëׯéعááálZ¿­õ—.]fͺõlÙ´[[[ƒÊçú 4DïºIÇã`7<™: ö‰%‹%sf^½~Íâ¥ËX±j5ÆŽOc|›Q¼X1ªV©ÌÁqçî]"""Q©”tëÒ×ô†kõqpp Y³&Ì™;u6â`oOà‡-R˜J•*j¥­U³:ËW¬dþ‚…)\H$?uú Gй®=v{áìäDéø©R¥¢b…ò;~‚ÐÐ0ÍË)_ŠŒŒdåª5)\X«}NNýR3´í5¶ý2öœ†}ŠK?cÖl†L£† P*•ìÙ»q&ѳW_ܧ÷;ÀÂE‹±±±¡c‡öIÇ´é3õÙK—*I«–-þ;GF´_ÆÜÁ¸{{ñâÅH“Æ‘í;vÒ¸aMãåËW¬X¹Joý2¶\Œ¹?Óf{mÔ®Yƒë×o0õïéL›:333T* -& ~øߘ辇Í[·ñáCsfÍL41ש±¿×àÇ´¥ÉÍË¿/òïÅ‹:ËÍÌÌ´xÆ^§Æä%9íWbR¤ŒûÍ®Yfl9&}JóV­uÒ.^ºŒ5k׆™™666˜šêŸÇÞÎŽU+–2fÜf͌̚Y³qqq¡ZÕÊthßNïý–––:ºMMâ†tR©T?­LöíÛOtt4U«TÖêMU¹REv{zñÌ×—lY³q½(Ú¶ïˆïóç¬Yµ‚²ñC>}öŒ~ýѨIó¸_¼1<~ìÞp ì053%**ŠÉÆk†"t°·gÂø±\¾rï=û˜0n,666š7¹rådܘњm”,Q‚±£GÒoÀ v{z1dÐ@nܸÉÒe+X¿v•æURÖ¬]Ï£G9°Ïû«s"©eÊ”‘Gãæ ‹ŽŽÆßߟÿbÒ”¿8rô(kW¯ÄÔÔ4Ùåh¨ñcGs÷î=ÆŒ›ÀÖí;H›6-×®]§RÅ ¤M뢨26/ÕªVá¹3ØÙÚj X¬h"""8|ä(/]ÒJÒÐrQ÷^Ž‰ÁÄÄDÓcÁÖΖØØXT*•Ö> {öì#GŽì¸¸¸hêoù²e111ÁÓË[ëøÑcÇéÓoõëÕeú5ØÅowíú 9ßçÏ5õÅX6Öq×rTT”Îuý=ê×ÈÑcÉ+ݺtþjZGÇÔ\8wkkÍÃL€|ùòbgkÇ俦²mûNôï‹¥E\™«pgÍ’…òåÊQ @>Íù‚Ä“7oݦG¯Þ¨T*6oÜ@Á/†û eÈðôéÝ“"… \ž!!¡Ü¿ÿ@ïºØ˜ÿæ>týúö!££fH¼9²S²DqjÕ­Ïú›èÛ§766ÖF·~oÞФY Ü2¸qìÈ?š Й³>ôí?ó.°mË&ƒÛ‡/ý=}&k×­gÌè‘´oÛ333‚ƒƒ?q2mÛwdÕŠešú›?_>z÷êÁÒe+¨^³ þApHÏ}ŸÓ¬Ic¶lÛ®u]?~ü„ÛwîЪe M0 JåJ=vœÿáÏV-ôæËË{/ÁÁÁth¯?°lLýãÛ^cÚ/cÏ©™i\ú–-škõújѼwïÝgËÖm\ø÷"åÊ–ÑÉ×ÓgÏ8sÖ‡?[µH4ø©öäé3,¿˜Ó K–ÿ‚Ãƶ_ÆÜÁ¸{»••ÓÿžJï¾ýiÚ¢E ÆÂÂœ+W¯Ñ¡][V¬Zè †–‹¡÷cÛ c¯öíÚrâäi<½¼¹té2¹sçâÉÓ§XYZQ¹REŽŸ8Iʔə#áùݸi3Ù³eÓ[ŸÀøëÔ˜sªö#ÚÒäæ¥~½ºŒ6T'_6¡Æ^§ÆäÅØö+)êa1ë-Gµ’%Jà鱓?âãsŽ “¦àéåͺ5«°NÆðíB!„B!¾ð~SSL)Sé¾%¿}ÇNæ/XDÑ"E˜>í/²fÉÀõë7ôû nî«ãGâziøøœÃçÜvìô`—‡'+—/Itø¤_Íc·C‡Ô»ÞÓkCàø‰“ܼu›áÆh=Ù³ecôÈátìÒíÛwÒ¿_­mØÛÛ‘.]Z¾&Mš¸9fråÎ¥µÜÔԔ… ñèñcÞ¼yKöìÙH?LWî\¹t¶S´HÜC?õ°F*•ŠAC‡ãž'7/^¼Ôî((è#111ìÜåAúôé(_®Ï_¼`μùÔ©]‹cÇOhÒÆÆÆ …ä÷æ ;wyðÇÈ“;·Þc±´´$C† ôèÖ•?²zÍ:Îœõ¡RÅ É.GCepsãÀ^/¶lÝÎýH•*%S§L¢r¥Š(T”B jÒ›+++œÑªQ½‡åñã'zç‚ûZ¹¨ƒ„¸çÉͺ5+5ßSQ™ð­øÓgÎjæg+R\wG',,LÓƒcÁÂŤL™’éÿ…EüÃusssºwíÂÑcÇY½fýúôÖ;Ü׸º¹òÚÏ?¿7zçºKÈØúå彇'O1p@?vyü÷ÂãÇO€¸ÉÎT«ZÇø‡†‰ wY£z5&ÿ5•ÇOâ¾kcc­­­f¨¹ÆÒ¸QCMúÀøáóÒêépèð†I–Ì™Y±|‰f˜Ó„¦MŸAøçpœÒ¤aç.ÍòãæÓ:rô÷îߧií9®*U¬À‚ys¾Zî©R¥Òz«–"E Ê–)Ã.ݼzýŠ\9sÕf¬]·žàÖ¬^©Õ+¯Bùr´o×–å+Vréòe½½Ô¾æãǬ߰‘ŠÊÓ)A¯%fLû›ÃGŽ²|å*­Îà(^¬(ÿ9LXX(À’… ؾc'3dФõðŒk×·ïØ©YŸ§·w¢¼Ý^^¤L™’jU«è]oLý2¶íãÚ/cÏiš4êô9õ¦ß²u/^¾ÔpñòÚƒJ¥¢a‚Þr‰Y³jy’Cq‚ñí—1÷G0îÞqÁŽ}ÞžìØåÁ›7oH›Ö…!ƒòéÓgV¬Z­U¿’[.jIÝ’Ófsm˜››³~í*¼¼÷pþ¿¨T*:¶oG³¦MéܵŽŽŽ½„ñ5ç/\àÝ»÷ 8 Ñ4Æ^§ÆžSø1miróbmmmàoAã®ScòbLûõ5Ož<к?[Žjvv¶šÞõ+”§P¡‚ 4„õ6Ò³Gò‡÷B!„B‘|Àû9z €Y3¦‘)Ósª¼yûö«ßÍŸ/ùóå£gî|›>cÞ{ö0x`LMMyù2nQ×ôéuÒºÄÿùÚÏ/ÙùÉŸ7/'Nœäõë×:½Ï""â†(´Žk9GŽìXZZòúõkí„ǧU?„S*•È”©Ó´ÒFEE¡T*™2uåÊ–¡|¹r¼ÿsssŽ=¦© =zô˜)S§1h@¿Dx ©ê¹V~t9B\  OïžZËο€B¡ H‚ùÍKdd$~oÞè}8ýéÓ'€$çgKª\òå®óî½û:×Ëí;w´ÒìöôÂÄÄ„)“&è¤}»6ZÛ8á_FG…òåX±lI¢ó…¬_»ZïòY³ç²bÕjvmߊ»{žd•9@‹–­yûî'ŽÆÉ)fùû÷ïñ9w7WWMpÚ˜6Ð<€½zõšÎ\Dêk#SÆŒ$‡›«+¦¦¦\¿~¥R©õûÅ‹—k½ðôÙ3&NšB½ºu4óÂ\¼t‰«×®Ñ¡}[Íy8uú èÓ»§ÞÚ)S¦äß‹ñôòÖ2öÊÕ¸z™Ô5lLý2¶íãÚ/cÏi±¢EqqqaûŽtêØ^khºÅ¥/RD7ÄӧϨZ¥r²‡LM(9í—1÷Gcïí …‚þã蘚)“&jåsÛöäÉ[3/Þ÷,}÷cÛ c® ˆë9¼zí:¦Lš¨õjõšuDEE%ûe‚/]ºr;;[½½CÁøëÔØsj,cÚÒc®Scóbìý11ž^Þ>r”"… S¬h‘d•ctt4«V¯åÝ»÷Ì›£=?÷ÅK—H—.Ñå'„B!„âûÞo¬h‘Âøøœcæì9tëÒ™AX¾r5ÅŠáêµk\½~ÿ€œœ011!6&–uë7J‡víH㔆°°0öí;À“'O>lÈwËÛ3__¢"#¿i;±±±ìÝ·J%Ò…¤aÃú¬Û°//oÊ•-CÕ*•É™3[·m'ujªW­Š¥¥%W¯]cæ¬9888h=@S;zì¸Þ7©²eËJíZ5È™3­[µd˶íX˜›Ó¸QCÂ>}béò|üø‘iS§h}wð œ9ëC»2h ™2eäü…Y±r5Y³d¡Aýzß­Ü Æê5ëâÊWK`@ ÇOžâÕ«WT©\I󖶱åxòÔi4ŸÕÃ6:tg縀SÞ¼îš7¸3gÎÄâ¥ËèÞ³7]»tÂÄÄT3gÌÐ!ƒ´zS›—ŽÚ³oÿAN¯žÝù£@~>|bÓæ-ܼu›6¶"ãA CËÅÌÌŒÇ2tøHºtëAÇí±´´ÄÓËŸsôíÝKxÛ³o?1114¨¯ضԩSS¡|9Nœ<Åó/È’93=ztcÈÐátëÑ‹Aú“5K?²zÍ:^ûùѳGw­^G ‡oƒ¸¹„"#£´–WªX²eÍJïž=X´d)M[´¢]Û68ØÛsâÄIöìÛO™Ò¥ô>¨ÿjT¯Fî\¹X³v=QQÑT©\‘˜èŽ;ÆnOoòæu§~½ÿ‚µ-š7cóÖmŒŸ8™‚(øG|Ÿ?gÞü…¤IãH¯ž=4icbb=f …‚bÅŠ²;~¸„ôÎyù#ôîÝ“!C‡Óºm{ºwëJ† ®øú¾`ÙŠ„……ñ×ä‰ZcÚŒvm[ã±Û“ “&óéÓg .HTd‡Žaïþ-R„b ]Æ\§ŽŽŽ4kÚ„»<4dÚ·ÅÑÑ‘gÏ|™=g¦¦¦tïÖE³­,™3óöí;þú{‘‘QäÏŸ—1wî|Ò§OGŸ^ÿõVóˆXûW©bðÞ³—A´{È$'OæÇ :wê˜èGùóå#{öl9vŒOŸ>‘*U*¶l\Ï‚…‹Y±r5 -ÀÄÄ„R%K0~졽 î÷C‡èÝGµªU4<€ñãÆ*U*6mÙÊž}ûprJÔIµ†»‚¸w›7®c츉Œ;ˆ›ß¤|¹²L2Yë­íŸ!88˜é3giÊ$eÊ”äÊ™“®;Òªe ÍC £ÊqÕšµ\ºtYgó,ÔüÝ»WM¯q£†ø°|Å*:u‰›;ÅÑÑ‘1£GjõÔJN^²gËƆuk˜>s3gý7¯Ž‹‹ Ʀ[—ÎÉ.€F ÍÜù èÞ³7¶¶¶ èßW«ÚîÝž˜››S§vMÓ¨aNœ<…§—7ƒ aýz¤°±aþ‚EtíþßC]GGG† Hî]µ¾¯®S_J¸|ú5š€Â€þ}qrvbÙòL˜8YS¾mÛ´føÐÁ:ÃSþ(–––¬_·šéÓg²mû6mŽë9œ"E š7kÊÈáô•–––lX»šq&1söÍÐœE fê”IZ½?|Ò ©:{Î<½ûwÏ“û§ðÆ?ü^¸h1#GÑ,Ï++—¥J•ÊZéi3²eÍÊ®[™5{.£ÇŽÓ”‹••M›4bÔÈZu×ØëtòÄñdÍ’…5ëÖiz!AÜ5¶dÑ­ùïÌÌÌX³jÃGŽfÊÔ¿¸k©l™ÒL™4Çø¹à‚‚‚8yê4ùòåMt6sssê֮ŖmÛ¹ðïE­¹/?|âH‰1¶~˘öËØs P·Nmb fΚCŸ~qCZ[[Ó¡}[F ª7O‚ÔåâìãJ(9ívLî½}âøqÄÆ*زu»f´ìÙ³±fÕ Š×ß#ɘr1æ>` C¯ µ¬Y²°tñB&M™Ê€Aq/WYYYѲE3FÔ>Ô××Wï}àÖí;ܺ}Gó¹i“ÆZ½üBBBP(8&r{®X¹Úèsj,CÛÒäÔ/µ;wïrçî]½ß±µµÕðÀ°ë4¹u=9í—úw¬••2¸Ñ³{7ºv팃½}²ÊâÚ©Å æ±`ÑvìÜÅž½û€ÿêï°!ƒÉ–5«ÑçR!„B!Ä÷aè“ #–™èù;áç/ÿ©ÿo×TÏß&€Y‚ÿš&ølžà³Y‚õ >›ÇÿKø·ÅŸS} ™ŸÔÁ;ØÛTH‡¥fêß|R¾BPP®éÓk= ÇÒÒRïù‚ÆÞÞ^køœÿß(•Jüýøüù3éÒ¥5xÎCEGGóÚÏ ss2dÈðÕ‡{„‡àââ‚í¯.ƒýÈrŒåÝ»w(•*ÜÜ\“ê09y‰ˆˆàí»w¤°I‹‹s²æºI*/~~~(”JÜ\]õÎ[÷-ÂÃÃyûöÖ6Ö¸¦Oÿ]†ÅSS©T¼}ûŽè˜h2¸¹ý´À>±±±¼Ÿ»3]"óÿ%F@@©S;è<øþÝóáCŽŽ©“ @©ÓfÄÆÆâç÷ªR?~üȇA¤Nš4i’.÷à>~ S‡Ç?›±õËØmÓ~qçT¥RáççGTt43dÀÒÒò—–¥1Œ½?#a»ž.]Ú_}¨F1æÚP©Tøûûóéóg\Ó»bcós_øùÛ–þH?ò:ý‘íWŽêú…«kúïž!„B!Äï)44”ˆˆˆoz¬R© ÃÆÆÀ ÿóðØ @µê‰ÇSR;Ø>±ñÿ@ÌŸþ­^¯LðYÿ9P%ø¬HðY¿L=gÙ—«ù§)‚Ÿ¿\—0!Ë´Hï €'„B!„B!„Bñ=Iï÷à}¿®*B!„B!„B!„Bˆo&þÌ‹/ ûÕ‡þÝEEEñâÅK‚‚‚~uV„B!„B!„BüÀûÅ¢¢¢~uþ¿²vÝzªÖ¨Å“'OuVþÏ:|$UkÔú)ûŠ¥Cç®´jÝ–¨¨è¯¦ÿ_»îÌÌÌÀÍÍ6¶¢SÇö˜™™iÒŸ8‰ÿ½”dÞöxíÆÆ&îxäuúàáCúœh>¾¬¿ Ú~š—7oÞÒ±s×$Ëeô¨TªXAó98$„9sçñÏ?‡  ÁÊÊŠòåÊ2jÄp2gΤI÷-u=1S&O d‰FçE-¹¿c¿VדsN““—OŸ>Ñ¢Ubcc?vt¢íbý†})HßµwïÞ}fÏǵë7øôéiÒ8R®lYôëK¦LB!„B!Œ%¼ŸìµŸÍ[üI@` 5ªWã? ðòå+¼÷ìåÒå+lÙ¸ž¼yÝu6¿›7o«PüêlÅÞÁžB… àç÷†‹—.áž'7îîqç%]ºtš´‘Q‘<óõ%[Ö¬-Z€ÐÐPnܼűã'Øé±›]Û·bee@pp0Ï|})Y¢™2eD©TòáÃŽ;Ξ½ûhóg+&MŸì¼?{拳³î’ÑÑÑ<óõÅÝ=ϯ.ÞïîÅ‹—,_¹Šš5ªk=Mhæì9¬^³Ž"… 3|èìììxúì[¶l£c—nlÚ°–¢EâΟúœúûèl'4$„g¾¾„„„êÝÏö» "8$„ýûжMëDóýðÑ#¦MŸÉ¹óP©TD}åmýÌ™3ѳG7æ/XÄ?‡S»VÍ_Væ¾ÏŸsèðؼe+={tÓzȯvâä)zõ釅…Íš6Æ5}z®]¿Á¦Í[¸|ù Û¶lÄÖÖVï>îܽˌ™³‰%[¶¬:ëŸ=óÅÌÌLSááázÄ©Óg°²´LvÞ¹W{0öœ~ék׆1å0kö\V¬ZMºtiéÖ¥3VÖV=vœé3gñðÑ#f͘¦Iûöí;žùúR»VMlllôîÛÌì¿`è¼NyæëKåJÉ•3§N> ˜Ú~“—˜˜žùú’ÁÍMë…„R;8hþŽ¥C§.‰óÅé3gyõê–äÈ‘=ɲ  áòå+¼ÿžT©RQ ~²gÏ–ä>^ûùqêÔibbbÈ›×]ëÍÿoµdÙrbccØ¿ŸÞõ111lÞ²lY³²uó­€AÅ åiùg[–,]ÎÚÕ+¿)aaa9zŒ¶mZsáßÙíé­7€7zìx._¾‚ïóç+Z„õê²'>`ò5;v`íºõ,X´ø«¼   ®^»Ž™©)U¹Þ’k÷n/ÌÌÌ5b#FáÌY*Wª¨SîcÇM`ËÆõ,ø‡fÝšµë˜6cËW¬bØPÝÞ‘ 2œzuëà½go¢ùptL­uÝ,]¶‚¹ó°qãf­`ø¦Í[¸qã&sgϤA|O•¦M“"e Nœ<Å›7oquM¯µ­V-[h®Ó˜˜–,]Îâ¥Ë4dÖ­ÑÉϹóçy÷î=3§ÿͨ1ãØíåÅÈáôÒ\¹zÙsærïþT*úõeúÌY‰ã–­ÛØåáÉýH›Ö…n]»°|EâuuýÆMø½yÃâ…ó©U³†fyÍÕiÔ¤96nN4€÷øñfÌšMÃõÙ³w_¢û0¶\š4jDë?[ò5·ïÜaý†´lÑœ©S&i–çswgÂä)\¹r•jU«1cÆDëNƒFM(]ª$5kTOvÞ“s¯6ô>`ì9ýòø¾vmSŽ>dÕšµdpsÃÛsñA¦>½zҧ߼¼÷P¿^]*”/§µ1£F’.]Zƒòü£®ÓÐøùN›5m¢÷\'ÆöËؼ¨,ø‡æ÷C’yðôâîÝ{L7FÓ£ Dñb´m߉eËW0~ìàûÔõï•0îÚ0¶®{N“sxxz‘?_>Š/Æ–­Û Ñé1¯2–,Y\oùiÞü…DFF±cë­ aölYù{úLv{zÓ«g÷¯nG!„B!„HHx?QHh(GÇÅÙ™íÛi­+R¸0C $Uª”( ÍÛàׯߠO¿| "W®œDFDâûü9îîyX½biÓÆ=@{òô ½úô£k—Nxxxöé{÷ EófÌ›·€°OŸX¼dÇŽü£®lþ‚E<|ôˆÑ#‡3vüD2¸¹á÷æ QQQÔªYƒE æi çØ»oÊ”.ͺ5Ú_>Âì9óؾu3Åâ{?y’©OפéÕç¿àŠ™™ïÝÖÚ†B¡`âä)lÛ¾{{Ò§OÇó/P©`ʤ :C&ݽ{»Lúôé #K–Ì-RøWŸfÍ1VªX‘3g} êU‘&#… þÁá#G ýi¼û÷бKW‚ƒCÈÁˆðü(V´Ö­Ñé1â½g/ã'N }út„…†á@Ãúõ˜1ýoÞ4ÖÖÖìÛ€á#Gã䔆àà`"""iÚ¤13¦MýæüGDD°ÿÀA .”hO§ÏŸ?I¦LuòW´H6o\§ØN®}ûÆ];5ªã蘚Y³çòäÉSräÈ®•Î‚ŠÊ3iâxÊ”.ÅÄɼ)RP¿n]¶lÛÎ75=EõžÛéÕ§–––Ü»}ã›OM¡Pà齇ҥKQ¿^]þú{:ž^Þ:ÀÏúœÃ? €Úµjjï:wêÈËW¯)]ª¤Þ}üõ÷4LLL;fT’<}ªV­ÌÜù  Õ¾î¶ïØEÎœ94âÕF ʈaC¿º] èÇÝ{÷8yê4W¯]ÓôÚTóØíEÊ”)©W·ûdïÞý 2X«wR¡ÀÕÕ•ÚµjQ·NmÌÌL“ à©T*ÜÝóйSjÖ¨ÎÉS§“ÌgŽìÙéÞµ‹N.¾|X[[¦¿=ŠŽŽfàà¡Ô©]‹úõê&À3¶\ µc§&&&  Œ¯R¥²ÁAèù á÷æ «W.ÿêpĉå=9÷j}»{N2äÚ0¦½¼÷¢T*éÖµ³&x§Îû„qcIëâ‚kúô|oßã: ÿ®ƒCÒC'dhûel^ŒuðŸCX[[Ó²Es­å¥J–$gÎüóÏa­ ™>ÆÔõï•c¯ cëº1ç4¹×éÓgϸqã&C¤t©R¬[¿Ò¦õŸÚy‰o+ì *ÇbE‹’×Ý]§Ç_ñâÅð0h;B!„B!DBÀû‰îÝ»B¡ X±¢zúuíÒIësHh(=z÷ÅÒÒ‚£‡j†RK7|ähM3³¸Syêô|ÎœdËÖmL›1‹xpîì)vyìfâ俸ðïEM/33SÂÂÂØ°i3Ç"}útDFFÒ§ß>Âá#Gµzp£]›Ö´lÞŒ†›ñ9<œc‡jÖé{дvݶmßI§í9bfff‡„ЫO?FŽKþ|ù´4#F!""‚Í×QªdIT*K–-g鲿ú4k\ø÷_ÌÌÌ(ÿð&)Ÿ>}âö;¸º¦'s¦Llýû5fáááìÛã©®jŪÕÌš=—u6Ò³{7MÚÏŸ?3zìxªV©ÌœY3°Œ²kÿƒ <”R¥JÒ¼YS­í«T*–¯XÅ>oOräÈNxx8]º÷d·§mZÿÉòSþ/]¾Btt4åÊ”I4ƒƒ.ÎÎ\¼t™‹—.éôþ+U²ä×vcÝžž¸¹ºR¨PAœ]œ™5{.ž^Þ 6D+ݤ ã¾i?eË–a˶íøœ?ŸdïGñ9w€¥¥%5ªWcßþšù¡ÔnÝŠ Ò—Ò¤311I´Ž;Ž—÷vïÜŽMó†%æü…ãö[ò¿óˆïóçtêЈ›SêùóçØÚÚR¢x1R¥Jeðö›4nÄÉS§9sÖG+P¥~˜\·Nm,--©W·gÎúàsî<+”פ+Q¢¸Ö{?~LrI êOƒúõt—/_!22’R‰ô~1k6‘Q‘L?–«×®]‹1.]ºLîܹpvrâÅ‹—ܾsSSSŠ.lPo¯‡±~ÃFºué¬wÞ.Cónì½:)úîÆžS5C¯ cÊñÖ­[€þv0}útß4¤sR¾ÇuªþÙÙÙ‚ï3_”*%yrçÖšŸ.!CÛ¯ïÙfès÷î=råÌ¡¹&ôGìöô" 0PkèÊ„’[׿5/Æ^ÆÖucÎir¯ÓÝ»½¨[§63f$C† xzyëðâƒîvövDFFâëûœÐ°P²fÉ¢w(Ìn];ëÝß­ÛwÈ™CÿKFB!„B!DR$€÷½}û77WƒÒïÝ»   ÆŒ©5ïG•Ê•¨Z¥2GŽãù‹dÉœY«\©"ÖÖÖ,÷`¿t©’XYYizÀ¼ÿ^k …‚.:’>}ܼnÖÖÖŒ1œÓgÎ~SÏÜÜsssLLL011!EŠI¦_·~n®®šà€ƒ½=Ç¥nýFlÛ±CóøãÇOxðð!6Ð|øÀõ7Ùºm;¥K•d@ÿ¾:éÎœõaë¶ìض%ÑÀGrËÅ/^¾¤JåJL˜8™-Û¶caaALL ffftïÖ…!ƒ&ùý™³æ"E ºwëúMy7ö^­fì}ÀÆ\Æ”ãÛ·qש«×)Àñ'°·×í%•'wn^Ç?ê: nqÁÂEœ5êÔ®…J¥âåËW¼ÿž¨èhP©077çãÇ`­ô™3gÂÆƆŋ—C•Ê•4¥3¸¹%ºŸ’%´ëWÚ´qe”tÏ#CøûÇ I•6‘rV«Vµ ÿØËÖm;8qò$ -aá¢%8::Ò©C{ºwë¢ó óæ­ÛܼuCxxzÐ(Á|CõêÖᯩÓ8wþ‚ÎüQßÂÞÎkkkͱ'&KæÌŒ1ÌÀ­&$4”ã'NRµJeM”2¥KãèèÈn//­à:ð&F¥R1lÄ( üƒíÚô?j Õ Pð¸çÑÂ,,~^¥µë7Ьic–/[‚mªT\¹z•ÁCG0pðPîߣՖ&&Eʸk4<<\k¹Çn/œœ(?dªT©¨X¡<ÇŽŸ 44 ;;Ûïz. 1yÊ_Ü×^Ö¬Q‘Çêô bøÈQ Øÿ›ꉕ À.Ý\¼tIg¹³“cÇŒâê‹B¡àü…)??Ç"sæL<ñ‚Q£Ç²lùJ²eͪ3œ²ÚÍ[·9}æ,½zv7º¬¿Ì»±÷j5cï†2æÚ0¶#"ÕשåWó‘ЄISô.4 ¿NïG]§êKXØ'–,Z@–Ì™yõú5‹—.cŪÕZs—Ó~%·Í¸~ãi÷ºV›4q<ööÿÕ¯ø¶ñÑãÇ:|„ϟõÎEd¤þ ­¡u}ó–­lÞ²Ugy™Ò¥4}úÌö;ñÞ³—AAìܶ%ÑáK_¿~MÇÎÝgÓúuØÄÿ.B!„B!Œ!¼ŸH=äUdT¤A郂‚ô¾íèèŸF;’"EÜõ̓øç *•Jg[úæ[³³µ%,ìÓO)—âŽóĉ“”>qRošÀÀš¿CBB°×3GJêsøüLÍ›5eÚÔ¸šááá¼xùŠõ6Ò¥[èGßÞ½´ÒÏ™5ƒ†ñÁžàîßÀÜù hи)«W.§L| 92dÈÀ^¯ÝZËž>}JóVºCY;~‚¿¦N㵟¦¦¦ØØØ`aaAll¬NZ{;;V­Xʘq˜1k63fÍÆÅÅ…jU+Ó¡};­7×Õ,--uZ™š˜ú뢱ÔæNíðÕ´Y³dąŒ5‚W¯^qüä)6mÞÂœyóyõú5ÿ5Y+}£† tæ Ú±s3fÍÖZ¦P(سg9rdÇÅÅEóЯ|Ù²˜˜˜àéåý]xŽŽ©¿:ôâ°oß~¢££©Z¥²Vo„Ê•*²ÛÓ‹g¾¾dËš@sÞ## kïÖ¬]Ï£G9°ÏÛàùœ2eÊȉ£‡¸ž$þþþø瓦üÅ‘£GY»z%¦¦¦šàl®\97f´æû%K”`ìè‘ô0ˆÝž^_íáqCÉZ=Õ?~Âí;whÕ²…æÁ7Äõ–>zì8þß­ZüìÓż9³ áÙ3_6mÙJíz ™=sºVÏꑣǒ;W.ºuéü {Ò_.joß½Õ¬O($AÏSÓ¸vA©T°tñBM`"KæÌ,˜7‡ò•ª²mûÎDxëÖoÀÌÌŒ¶_ ƒ—œ¼{¯V3ö>`(c® cËÑÆ:î:ŠŠ2*Ààµ{'ÎNÎ:Ëmmu‡–üQ×éð¡Cè×·i5Ç#GvJ–(N­ºõY¿q}ûôÆÆ&î|Ó~%·Í åþýzË,6&î¾ji‹‰¡*k–,”/WŽòiʪZ×Ç£·—`Âí›—ä^†2æœ&'/»=½033£\Ù²š:àæêJæÌ™4=æÕû­Vµ ÎÁÎÖVëE”bE‹Áá#G¹xé’ÞágoÞºM^½Q©TlÞ¸‚0,ƒB!„B!Ä$€÷©‡ùñó{cPzõ$õ”„Ô‰Í-~Ì)ŒU(HanØ°*å·b,,,¨T±B¢8Õià¿à¤J©ÔI§¯‡áÏ–"E ÜóäfÆ´©<~ü˜E‹—Ò±}»DçÌq°·§t©’¬Y¹‚â¥Ê0{Î\<=v&{ÿ¦¦&:oå§L¥ûPýéÓgôé7€4iÒ°qýZJ•,¡ypåž_ÿÜj¥J–äø‘Cܹ{Ÿsøœ»ÀŽìòðdåò%”/÷}U_£© FVÁŒ3Ò±};š6nD³²Ëc7Æ ÒËÂÂB§­­ußô?}æ,R¤¸îƒ¼£ÇŽ†­í÷ë¥T*1ýŽÃrÊ#~î ¡ÃGê]ï鵇¡ƒÿ ùæÍ×Û»ç/^0gÞ|êԮűã'4Ëccã†Oó{ó†»<øãäÉ[ï6,--É!=ºuåãǬ^³Ž3g}¨T±iâ_xÈ+—Î÷Š) >ôã“'O´zÞxxÆ•Ëö;Ù¾C÷Úõôöþ%©Óg˜1}*¹så"wîÜ@ü]Ò‰¿„³?ò$äIþþØÚæTŽ‰‰!$$„BIÎìÑÓÓÓêLüœä\=©äÉ“===¢£¿Sºt©Tó«&’ý4Cúúú¦[?[[[ž>{ÎG_ŠI1¯……9æææ¼÷öÖñîéãüÅ‹( F*ÚñøU½?9‹DZxqôïÇë7oèЩ3kÖnøí<ë‡[PPY²hw0<}öœÛwîС};¬’œÙdnnN¹reyç鉯Ÿ_ªçÙhãëaôôô˜=sºÆ–‡³{Ï^Nž:M§Ž?ÏôM½SäwñÆÝç/^ðWêêÝ£‰Y°p1GŽeÔˆaèëëS¶Linß¹Kg-;E¦Ï˜EœBÁ¬Óøòå †††¸;Û¹óyÝÝß2{î|Fš¬/1ª SU[*TÈccc|||4òF&„úÔu÷ÑÉS§¨V­*°óØ1rÙÚ2jäpüºrûμ޿§@þü¿¼œÖopB©TŠBÄA¼CºL™Ò¼zý†>R¨¾~~dÈN›Ey• ‹#ÜÎçâ¥Ë-Z4U^R½¤…âÅ‹ñôé3­ýcdT”z·XR®]¿Á÷ïß©S»vš~7©ìRûêÔÒ$%-mCŠË–)ÃÝ»÷¸s÷®†O¡PÐ¥[6l@n]Ó¤Û”Ho; %,4T=VJLxx|Õ®J©öëgÚ mspàÙóçÄÅÅa˜äœÒgÏ_5k­¡WÓ[×Ó+ËÏnI‘R¦Re9vü$±±±ôìÑÇâÅÄ¿ʬ9s9tøˆÚ¯ŸŸÖèIeIü›&M¡Fõj¬^¹<ÕóŸedddddddddddddRCÿO ð¿DÆŒiÜ°»4¾|ùÂ’e+xýæ:dfÍ„°{'NžåU*•œ:}šŒ3R¾\ÙtËuõÚ5Ñç»wï¡T*)Uª¤(ÝÂÂQèؘ._¾’콉N˜ìJsssÊ–)ýû÷ùðá£èZxx8ó,âÙóçê´âÅâ'^îÜŸ©Á­Û·Ó­ŸÅ—/_¸}ç.ÆÆÆäÉúDÖÕk× ÆÎN÷]éAµƒ1éÓ¶í;P(¢ôÛwî0wþB qzÑ"E°µÍ©>Kéw’#G>ùœlž›7o²hñR¶oß©q-66–‡¡¯¯OÎ9‘Ê·o߸xé2åÊ–¡SÇ´lÑ\ô7bØ q=|ô§=sPP111곓ãÑ£Ç4hÔ”f-Zÿ”ßUí^éÓ»—Æs¶lÑœfM›ðùónÞŠoƒUªT&—­-nçΫÏaS—É­Û¸ì?@HHTªX‘ghüÝ¿sˆq÷ìñzõ쑪œ …Bí)”0ñjbbíöÜß¾å?}:>´ŸjWMJ¸>ÂY·s”-SFm{/_¹J`àWZµj¡U/=ºwU÷wpýÆMV®^Ã;OO ½2h V½¯_»€qcGóìñƒTÏÆÓ¦—´Ð´Ic¢££qÙ@”þàáCüýý“-£»÷îñgÃJE›ìRûê”Ú$%-mCŠÛ´n‰Î[·i„9]»n÷î?Àðìöýí´CÇhÒ¼•(ĶJç×oÜ$—­-¶9ãíºTûõ³lFr4nÔ€ÈÈHŽŸ8)Jôè1¯ß¼¡Icí;ÄÒS׆,?³mhCJ™J•å «+¦¦¦Œ6D£ü»u팃CQο vÎÍ¿€†›q)ÉW©Tâz8>œmâr¸yë6'Oå¯ÕqÚ°NvÞÉÈÈÈÈÈÈÈÈÈÈÈÈüäx¿™qcGsëöfÍ™‡û[*WªÈ6;o!((§ ëÔgmÔªU“ å˱{ ùóå§Aýz„……±qÓf>|øÈ„qcÓ=A```ÀÖí;066¦BùrxøȤ©Ó044¤Cûv¢¼+”çÌY7–._IófM eíú dÏž_??­gš.\ˆ×oÞ0gî|ªW¯FLL ~Ÿ>QÜÁ Ê«ó=’.ÝzЭgo&OOáÂ…ðöþÀªÕkxþâ%Ù”7o*”/Ç•«×Xµz--[4'ðk -Å6§-¡¡oHï<=9sÆ €·ñ¡äîÞ»ÏÚuÔzH,;€»»;›·ñç±øúúqÖÍÐÐ0&Œ«êò•«$„¦ ãí[.\¼„©©)ãÆŒN—üºR®lüdµÓfgòäɃ¾~üym?úPÄÞ/O/Þ{{“3GLLLˆ‹cë¶í„……Ò½kW²dÍBXXÇŸÄÃããÆþ¹S±bX wîÜKv÷_§Ž8xè0«×®ÃïÓ'êÕ­ƒ¥…~Ÿ>±×e?ïøçïŽÉîàK‰£ÇOK‹æ͵^Ïœ93Õ¨ÎÅK—yïíMþ|ù¸tù ‰vªÂ÷9ãF¶lñÅŠ9àX¼¸Ö{ÞNp\'­ƒI‰ŒŠÂÓË cccÒK\\ÇŽÇÆƆʕ*jÍÓ²es¶nßÁáÃG¨^­*Ì=“>ýÒµ[zõìAÁ‚xþâ%Û¶ï kÖ¬Lš0>]r…††©Û]œ"ŽÀ€@.\ºÌÇ©S»–h7ب‘ùzí:]»÷dôÈäÍ›‡›·n³Ñi3òç§Eóf÷?wþ>>¾DFFrÿÁC<|H.[[–-Y¨Îsð+€ÖïC|H=+++Ž=ÆÈáÃüúU´è!"2>òÇÙà :½}»¶èééñâÅK^¼|©NþâïŒ1Lsœ5kVêÔ®ÀÐ!éÞ³Ý{öf`ÿ~*dGPÐ7öìuá»;íÛµÅÒÂ"]z×E/i¡C»¶¸¸ìcÖì¹| üJÅŠåyçéÅÊUk011¡ÿ¾Z¿÷ö­zzz,˜ú®T]e—ÒW«ÐµZ¦¿R `Ѐþ¬^»Ž¶:ѵKg¬,-¹xñGŸ j•ÊZwoß¹“Lµ‡­^½šè̯_ÕN Àè1ãø§K7úõíCîܶxyy³~ãF˜3kzzzi²_Re‘\FíÛ±kÏ^¦Í˜ÅׯA”*Y¯÷ïY¾bY²X3p@­ßKK]×FÁ‚hܨašd‘Ò6¤Öu]ËTª,¯^¿áåËW4mÒXë9­Z4gþÂÅœ:}†íÛÑ£{7ŽŸ8Ũ1ã8 %K8òõk;wíæÉÓgtþ»yòäâMš<…BAùòå8”V91VVVZÏ$”‘‘‘‘‘‘‘‘‘‘‘‘‘I Ù÷›Éž=;û]v3{î|\öíg÷ž½@¼£káüyT«ZEW__§ ë˜1s6ó.bÖœ¹dÉbÍÔÉ“èÞ­KºåQ*•,^¸€ÑcÆ1îý{ Þé°bÙ}'Œã‹¿?6:±a£¦¦¦ôïׇ¼yóòðÑ#¾ÿ®qÿÑ#‡óÎÓ“m;v²mGü(kkkfNŸ*ÊW¡|9œ7mdîü ‹- _ÿA¬Z³–UkÖb``@ÏÝÈ–5+ó.&6..Í:yûÖƒå+W‰Ònß¹Ãí;w6d°†óäÉÓg !Ü—,]®õþE‹È<Éè¥#_rizZþŸøsÒ?ÕlŠ¾–ÿë‰þÕOôÙ0ÑgƒD×}6LøKü£$Ÿ3} Y‘ÒÃ[Yê¶[á¬Û96¨¯³ò#""øüå ™­¬R=_(** ?¿O˜˜“+W.Ñ„WZéÖ£7oÝÆãMüêh?¿OD&ož}úLLl ¹såJqð;ÒNƒƒƒùú5këÌi:ËôgÊ"•ÐÐ0ÈœùÏ×/©²üʶ!µL¥,*[j–Á ›lÉ:‚edddddddddddþ‹„††•lÄ]°°0õyñº¼Ç+}Ò” ?ôÿB2j$úœôZâ<º¤‰xÐ÷§IêÀ“‘ù/òùóê5lL…òåÙêìô§Åù¥,^²Œ›6ã´~­ÆN)ȼ·O^B*##óŸ&GŽì :„kׯsòÔé?-Î/Ãýí[¶lÛN½ºud猌ŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒÌÿsdžŒŒÌžÞ½zP­j¦Ï˜…¯ŸßŸç§ÍÈQc±¶¶fÞœYZ™_ÌŸ=àDæ²qýZbcãþ´22éF__çM‰ŒŒÂÔÔäO‹óÓ122bïîajªÛ¹“222222222222222222222ÿ]dÞÿ02d !,­ŒÌCCC,,Ìÿ´¿ƒÿ·Ï&####################£‰BSFFFFFFFFFFFFFFFFFFFFFFFFFæ_„ìÀ“ùEpHÞÞˆýÓ¢üÏãïï·÷‡ßö{x{ ,,ìO?úŽ>âç÷éO‹!####################“€ìÀûÃ|ÿþýO‹ðÿŠ-[·Q·A#<<ÞýiQþç3nu4ú-¿G÷^}èôO¾I5ÿ¿©ÝÅĤ.oZA'gö®={©Y§W¯]ÿÓêHJ¥’èèhIßù·Ô…B!©DGG£T*uΫs~A$ëñ¿J\\‚ èœ_Š^âââþU‹H¤Ô¯ïß¿Kª_¿R– …â_U¦Rj3¤ò_-S¥R‰B¡ôœºæÿ·ÙÒèèhíR©$.N÷ó±¥ÚR©Hé«¥Êõï)#©¶WJßþ«eù7éñßįlÿå>IFFFFFFFFF:òx_??–-_ÉåËW ÅÌÌŒ*•+1jäpŠØÛÿiñ~*GŽcùŠU\¹tþO‹¢3ׯß`ÖœyÉ^ïÚåºvé ÀÛ· :\}MOOSlsæ¤zµª´kÛSSSõõƒ‡ã´ióüúzdʘ‘üùóÓ°A}ê׫‹žž^šeoÙ¦™3gf›ó&Qú{ooúõD­Z5™4aÜŸVñOgÍÚõ<~ü„ÍNÈš5‹Æu¥RÉ¡ÃGعk7^^^DEE“1cFÊ”.Å ý©X±‚:¯ªL7nÈÈáÃD÷9zük×®gø°!4mÒXãwîܽËÔi3Ñ7ÐÇeÏ.¬,-µÊÈŠ•«¹pñ"_É”)%‹3tð ‘,ûd³óÖdŸ}ýºÕØ,(J{ïíͼ‹¸~ý±±±ØæÌI·®éÝ«§Ö{Œ=’ë×o0~Â$NŸ:ž¬Ü¿’×oÞ0lø¨d¯ÐÖ­ZŠÒîÝ»ÏòU«yðà! …‚lY³Ò®]†„±±±Æ="""X²lÇŽ'$4K š6mÌø±cȘ1£:_âvªo ¹¹9v P»V-ê׫‹¾¾xíË´3¹}û®ú³¡V––)R„vm[ãX¼¸†,.^bÍÚõ¼xù¥RIždÒäiÔ¬ùW²ý¹›qæ¬Ë–¯Lñ7÷íÝEæÌ™EºÑ¥~íܵ›»ö¤xo§ëÈŸ/_šô²pñ.\¸”ì½óäÉó¦Ï»nÃF<<Þ¡P(È‘=;­Zµ oï^dÊ”I”W¡Pà¼u{öîÃÇÇ}}}J8gäˆáT¯VUã÷ÒjKu)SºŽ3‚CBXºl9§OŸ%8$jT¯ÆÄñãÈ—/¯Fþã'Nâ´Ù™wï<‰‹‹#{vZ4kF¿~}°´°劊fËÖm8䊟ŸäÏŸ®;Ó©c{Q™–þQê{’Ù}ýüX¼d/]&22’ 2P¿^]&Œƒ(¯Ôñ—Tû%ÅöÆë]Zßž´>ôîÓ°°p­ãF©²HÑ£6FÇóç/4ÆRm†ÔqFƒFMS¼wÕ˜:yRšËTJÛ¢H{Ÿ¤«ÍHŠjlRµjfL›¢Ówddddddddd~ ²ï7ããëKûHƒúõ(Y²>|äÈÑcܽwŸÝ;¶Q¬˜ÃŸó§ñøÉSâ$¬pþ7`ieIéÒ¥ðõõãÎÝ»8-‚ƒC|¹äÈñc¢/ú{4ž^^,P€råÊÊã'O9á"ûâ€ËLLLÆÓË‹J+’7o”J%_¿~åÜù =vœÎwbæŒii–ÝÓÓ‹lÙ4CHÆÄÄàéå…ƒCÑ?­ÞŸŽ·÷68m¢aƒúÔªù—Ö<‹–,e³óVÊ–)ø1£±°°à§'»wï¥Gï¾ìܾ…reãËOU¦þþ÷ ÁÓË‹P­¿ã²ïAAA‡„pâÄIºtþG#ODD]ºõàý{oÚ´n…£cq>}ú̾ýèÒ½'NÖ‰žãÃG<½¼èüw'ÉEsssÑç?Ò¾ã?è3lÈ ²dÉÂÉÓg˜¿p1±±± èßOãFFFÌœ1¿;weùŠUÌœ>õ·—c`@ ž^^Ô®UûÂ…5®'è¿~ã&½ûöÇÜÜœ!ƒbmmÍÙ³n¬ßàÄÇ>¬X¶D”?&&†î½úðüù ºvéLÑ"ö<}úŒ=.ûøðÑGäôVµÓ åË‘+W.‚ƒƒ9á¦l™2lX·kkkuþOŸ>ãéåEófM155%66_??öºìcÏ^–.^Hóf?&Îœucèð‘.TˆÉ'`f–'O1gî|BCB6t°:¯R©¤wßܹ{—:ujS»fM>ù̶í;éÜ­û÷îõ …‚ž½ûrÿÁCJ8:Ò¡};"""p=r„ƒ†0oîlÚ·m£Îáâ%ŠƒCQ.˜Gkk^¼|Éú Nܼu‹ãG\±²²ÒZfáááŒ3z˜–2õôôB__Ÿ† êóýûw¼½?°jõZÖ­ßȬ™ÓEr«Úiþ|ù([¶ŒVùrÙÚŠ>Oœ4…£ÇOP½z5zõèNTtGŽcâ¤)x¿÷fÌè‘ê¼>|¤Ó?]ÐÓ×gÐÀþØæÌÉÃGÙ¹kîîìܾEäð[±r5kÖ­§h‘"Lž8…Bɾý7aß¿Çðw§ò²a£»vïE¡P$kWTõ«q£†ñù‹?{\ö±uû:uìÀ¬Ó4&ç-XÄÖmÛiP¿C äÓçOlÙº®Ýzrêä1õžB¡ {ÏÞ¼xùŠ¾}zQ¡|y"##qÙ·Ÿ±ã'ø•¾}z¥Y–×oÞÐñŸÎÓ¥ó?äÌ™ƒ—/_qÈõ0W®\åÔ‰£¢É^÷·o  äŸN5ô`bj¢U?oÜÝ™¿`7nÞB¾'³#LJýX°h Î[¶Ò¤q#ÆŒ‰¡¡!W®^cõÚu<{þœÍNHŽÔÚFZÊ4**šC®®,]¾’°°0Š-¢õ·¥ÚŒÐÐP<½¼(]º ÐzOCCñë‚®õ«`Á‚Ô¯WWë=/]¾‚×û÷˜eÈf½øñÇÓË‹úõêjÕ³M¶l¢ÏûdÒ”iØ,ȈáC166æÚµë¬]·[·îà²g§èþsæ-`ç®ÝÔ®U“ÁûÉîÝ{éÝ·?[6;Q­juÞ´ØR]Ë41ºŒ3âââèÞ³7¯_¿áïN)YÂ__¶lÝN§ºpì¨+Ù²fUçwÚìÌ¢ÅK)VÌQ#†cddĵë×Ù¸i37nÞâÐ ÔõkøÈQ\¼t™úõêÒ»gw"£âmé´3ñôôdÊä‰eªkÿ(õ=IŠìþþþ´k߉ oßø»SGŠáñ“§<äÊ“§O9~Ä333õ½¥Ž¿¤Ø/©¶Wjßž”)S§óäé3b’Dª*‹T=&eÇÎÝ;~ˆw,&FªÍ:ÎHîÞaáaìIpV¥µL¥¶ )z´÷IºØŒ¤<ñ‚…‹–GÁ‚RÍ/########óï@OËŸ¾–?₆€`œèÏ02f@F `‘ðgX'üel€ì€- È äì€B@Q P( ”*U@- Ðh ´Ú€Î@w 70ü[pˆÒŸ®œ9ë–jžÁC‡ vö‚ó–­¢ô E‹—Úvè¤ñÈÈ(áÌY7aƒÓ&ÁyËVáú›‚B¡å ÜÎ"#£„ó. ›·Ÿ?A.]¾"lÙºMðôò}çî½ûµk×A„7îî‚Ó&gaÕšµÂ¥ËW´Ê~þÂEááÃGé^ïß nçÎ ß‚ƒÕiÞÞ·sç…†Mš å*VÜÎWÿ¿p1Yý¼}ë!ìÚ½GX·~£pð«˜lÞàáè±ãÂŽ»„+W¯ ±±±ÂÒå+;{áåËW:—[Jœ>sV°³wV®Z£õúÓgÏ;{a¤)¢ô¸¸8¡gﾂ½ƒpòÔiuú¦Í[;{áÈÑc¢ü_…ª5j …ŠKñ™SñTY¡v½éoÜÝ;{a؈Q×¢££…³nç„ÍÎ[„í;v 7nÞJñ7¾ nçÎ ;wí9*xx¼Óš¯k÷ž‚½ƒ ‚ðÑÇGعk·°eë6áö;?¥lTŒ?Q°³wÜÝßj½#/YF¨ß°‰+ºvÿÁÁÎÞAèÙ»¯:-¹2Aرs—`gï ìÞã¢q-44T(V¢´0oÁ"¡y«6B«6íµÊ³eë6ÁÎÞAزm»(ýù󂽃нgoQú´é3;{QûJ‰¾ý Ž¥Ê ^ïß«Óâââ„N» Ý{õ”Je²ßíÖ£—P¤X µíH‰»÷î nç΋~'=œÃFŒìì„çÏ_$+[jmCŠïÝ tü»³P¢t9Á±TYµ}ÒÖŸ ‚t›±oÿë_R¤Ô¯äpw+88–V¯]—f½¨ôœR™'&..N(W¡²P½fm!,,LtMÕoþ,„……¥ù/44Tðõõ‚‚‚’›&åÀƒÂSôËÃ|8Ý|:|<-|>|@µ|BU|Då|F%|HE|Jv >¦¼ >'Û”M‚OJ埲Jä·Ê”àË2Kðm™&øºû¾ŒùÅ ’ñi󱥊|Þo$$4”sç/`“-Ý»u]+[¦ £GŽ ]›Ö¢36=zLÝú 6b'Nžb¯Ë~º÷ìMË6íøòå‹:ŸÇ;ÊÊÕ«?a‹–,£ßÀÁìÞ똱ãY°h íÚwâÛ·oêï¬X¹š£Çâzø­Ú´çÀÁClظ‰>ý0dظýƒ† cÕšuÏuæ¬;wáÒ%uZpp0Uÿ 2Lã …‚©ÓgШis–¯XÅ©Ó§™1k6µêÖçð‘£ù_¼xIÝú5fN›:|$m;t"<<üO3ÔªY3¾Ü“ÙU‘˜,Y¬)]ª$‚ –zþŸÅ«W¯ù«v]†É—}lØèD·½Î’ÓîݵƒmΛR ÑÚ±C{âââ8|ôXª¿µdérÊ™³néÖÄï°²J=´Ï·oßxãîNÕ*•Ea ôõõد/gÜΉ¾ã²ï… ¢Eóf¢ôñcÇpöÔ lms¦ø›FFFŒ>”Úµjrãæ-<|˜ªœåÊ–ÅÊÒ’ÐD6àÑãÇ|úô™¶m[‹V¨ëééÑ­KgbbbD!ánݾ@×$+¦K•,AµjU¹uë6¡¡?vÝr=À˜Q#E;I¬Êm˜T€IDAT­­™:y"}z‹Ã¨}#[Ö¬aÆ ÙT_×Ʊã'8{î<+–-ÁØDûÎ()ešEìíY¹|)J¥’5ëÖ§ù>½zö``’¨fff/æ@TT´ºÿˆåÜù T¬P‡$;bºvù===NŸ9«N{ðà!qqq´oßV½ÛÀÂÂœ®ÿ&44Œ›·n«ÓAÀÁ¡(‹ÎçÜ™S8/&ùY2gÎÌÊåKÉš5 ›·lA´oÿAôôô1|¨è;uêÔæÚå‹Ô«[G@¡Bv¢¼FFFäÍ“—ðððTÏ8KI–òåÊ1dÐ@È*”À?@lïÂBðԱ¾Qó¯ìض—=»0OR‡u!¹úŠB¡ ÆwìTmã[Ö{êÒ6¤èQ©P`kkËè‘#¸tÞ¶mZ¥x©6C*Rê—6”J%ã'N"OîÜ H°×iÑ‹TÂÂÃéÔ©#£GŽÐØMU±|B}LÔÿž={¥RI÷®]4äiÖ¬)oÜÝñôòR§K±¥RËT…®ãŒS§Ï`jjJÇíEé•+U¢páBœ>ýÃ~…††Ò·O/F‘‘‘(¿:²DØú’!ƒ)ýûö¡G’÷333Š-BLL ÑÑ©Ÿ[§­”úž$Uö[·ï!ƒ)m“„5îѽ+3fäÌYñ¸AÊø ¤Ù/©¶Wj߮⽷7³çÎgúÔ)ÈŸÿ§È"U*bbb1j M7¢e‹æ:é R¶?cœqñÒeŽ?Á¤ ãE¡‚AZ™¦µm袗´öIºÚŒÄÌ™7==½w ÊÈÈÈÈÈÈÈÈü^dÞoäåËW( Ê—/§ç’˜>½{Ò©cõµÐPú‚¾>çÎœâøWÎ=…Ó†u¸»¿eÜ„1ú â—¯\åúÕKŒ3Š/^²ÿÀAn\»ÌÔÉ UOìÄGŸ°°0¶ïÜÅ·3¸9Ƀ»·¨ùW Îœuã¬Û9ÒJ×ÎÿðôÑ} äÏ OÝWÿ=~pW#ÿ–­ÛÙ벟žÝ»qçÖuŽ=̵+—(Q‘ “¦ðö­‡(ÿø‰“‰ŠŠb׎­\»|‘ÇîR¿^]\öøÓŬæÖíÛP1a¢2%ÂÃÃyöü9¶¶9É—7¯wÿ9Lœ<•ÈÈHŽuå‚Ûn^¿ÂØ1£¸ÿà![·ï刈`Ò”iÔü«÷ïÜäì©ܼ~…Ë–pôø ­ŽVAØ°qǸríòEîܼN… å9äz˜§Ïž§[þ»÷îCõªU“Ícee…M¶lܹ{;w5ë^åJ•R=çK¹º’ËÖ–Ò¥K©Ï±r=|D#_Ãõ™>u2â ¡wï<‰ŠŠÒpD†„„`nž }}}>}úÌÝ»÷xñâ¥ÈÑŸX‚ P£z5bcc¹~ýGŽãÎÝ»Zó'¥jÕ*èëësãÆÍtëC*! “0–‡„ðèÑc<|HDD„F^•£%qKª ¨×¯_«Óñzÿ^]Ož<}ÆÑcǹxé²d§¿ê<³«×®§š÷իׇ„P¹r%uÚ‹¯(á¨yžS‰„3ž^¾z©åY3kä/lg‡B¡à­Ç[ ~èÕë×dÉb­1P§v-†$š ªZµ ~Ÿ>ñî§(ï{÷¨\©¢Æ}|ýü˜>s6“&ŒOÖqÒÊ4%J8:R¨wîÞ#::m“÷ÅŠ90iÂ8ó¿bccyýæ Ù²fU‡·óôò"**Š%4Ïf²¶¶&—­-/_¾R§…¥XãõóúõuZ—Îÿ0îlZ4o&røIÅÌÌŒ† Æ£ÇÕéwïÞ£H{²eÍŠ·÷Nœ<Å©Ógøüù‹Æ=*V(¡¡!׮ߥ‡††ñæÍJ—.¥“ŒÉÉÒ·O/†¢‘_eÿ JbïΦT(x½Ïí;wDN’ÄÌœ>•)“'RµJå4ë´×/Ûœ9)??wïÝרs÷îÝÇÌÌLkÖµmHÑcÅŠX¶dÝ»uÑzÆkR¤ØŒ´ ¥~icï¾ý<}öœ)“'h,ª‘¢©XYZ2fÔZµl¡qíé³øЂ‰ËìÅËx;ìè¨iTçñ%¶Rl©Ô2U¡ë8ãÅ‹—Ø.¤õ,Ø’%JH@` Ù³ggäðaüU£º(ŸR©äæÍ[˜ššR²d uzÙ2e;f”Æ9zÁÁÁ<ñ‡¢ãmh륾'I•=<<+++ð´FFFäÍ›÷·oQ*•êt)ã/f¿¤ØÞ´ôíJu䨱ԩ]‹vm[“Rû©zT±pñ¢¿GK>O-%›‘ÞqÆ÷ïß™9keÊ”ÖXà%µLÓÚ6tÑKZû$]m†Šsç/pøÈQV,[B†TÎy•‘‘‘‘‘‘‘‘ù}ÈgàýF>}ú@®\¶:å?vì8AAALž4AÿNíZÔ­S·sçyïíMþ|ùÔ»jjת‰©©)¥JÅŸáV¥r%LLLÔ“–‰wíAüηÞ={3gü¹n¦¦¦L?Ž+W¯qÖí6HÓ³bhhˆžžzzz)ž…°uÛvrÙÚ2aüXõ‹¹•¥%3¦M¡ióVìÝ·iSâwm½}ëÁë7ohÕ²•+Å¿øëéé1dÐ@Nž:­áìû¼õðP;¼‚ƒƒ¹qóoÞ¸3gÖ õÊÈÄ\½v oß”Jü8s&~Óê•+´NZH!44ŒÍÎ[Eiª‰šÄ‚@¿¾½Ñ××ѵó?,^²ŒÇŸˆò¿óô"&&†råÊŠ&…š5mBéҥȡŠöýûwÆŽ¥žp033£[—ÎÜ»wŸ—/_ª'ÁÒÊý€»9’cÖÌé 6‚Î]{PÂÑ‘ÚµkR½ZUJ•,™¬¾ÝÝÝ5ô˜Ü®+wÂÀÀ€¸¸8ÌÍÍY8. ê×ÓINÕêgÕ=³ÿàAÌÍ͉ÅÛû'O¦BùrL™ôc³¿¿?6“R©d؈QŒ=R}fÛ—/þêüª37Ýßz'ø,—¤ÏˆB¡Ð8û-%ÆÅ»wžtêÜ•íÚ’5[V^½z͉“§èß·Õ«WåW(Œ3ŽÊ•*òÏßS¼·”2ÕEïïðûôItN×Ç>œ8yJ#¿¾¾>M7Jõ¾ËW¬âÓ§ÏLš0Nk,_¹Šwï{Îâ…ó5Î3“Ò6~†“CŠÍH RêWR"##Yµz +V Fõê:ÿæÏÐKr\º|…ÓgÎR§NmQÿøÅߟL™2‘!CÞ¸»³zÍ:ŒŒŒX¾t±Ú6$SKµ¥RÑuœCpHå²Åï@;qògκQÌÁAû“-‘ì‰ÏÁ üÊÓ§OùüÅŸ#Gñêõ+-˜§q–`b™¼Þ¿ÇÓË‹={\0Ë¥‹jÍ«Kÿ(õ=Iªì9räàÉ“§j§Œ ¥RIPÐ7bbb W_“2þ’j¿¤ØÞ´ôíi%((ˆÛœSÌ'µªGˆïÙ³wûöî&cÆŒ:?Cj6#½ãŒí;wáëçÇ¢…ó4"T¤§OÒµm誗´ôIRßMüýý™8y*ãÆŽÆÁ¡¨ÖH,222222222Ù÷‰JX1gb¬ÛŠûG ”jIÔ¨P¾nçÎóìÙsQ¨¼¼yâWý©øVí,2Ëï@‹‰Õ¸WÅ DŸ ²ÃÄÄßãóññÁ? €:ujôM®ÍÚÚsssžãÉÓg:ÉqÐÕ€V‰Bß4kÚ„9sçsãæ-Õ቉ŽŽføÈÑÜ»ÿ€©“'i85ÃBà %_¾| 8€,Y¬yöì9ËV¬bôØñXZZRó¯ñyÃã'2.^¸1£hÕ²J¥’£ÇŽ3uúL ™SÇSœÌȞ݆×oÞª1˜.I³¥UèØ°°pÖ®^Iþ|ùøèãÚuëÙ¸i3cÇÄ;»2d0¥fÍ¿¸xñûöP‡ ‹ŒŒdöœùèëë›ÈÖ…%„ÐÚ²m;íÚ¶fÃúµ˜gÊÄý5f<#FáÔ‰£"[šfÍÔ¿•”U«×Š>çÈ‘*•+chô£«ŠŽÀÄÄAÔ!Hûôê©^Œ‘xuu£†õٰщ+WQ¶Liõ ûËW®rîüõ³F'„–“²«ËÊÊŠvíÚ°tÙr¶nß•¥%_¿R®ljÕª©‘݆|ôñeÃúµ©Þ[J™¦†jb+©Þoß¹Ãí;w4ò¤êÀ[·~#N›iÔ°={tÿQF zT…?¼}û.>Äѱ8õ©‹‰±‰hb«B…òdÉb˾ý´nÙB=¡÷áÃG6:m•ÑÏFµ8&22"Aö( 7oݦ„£#ÜÎ/_^Þ{{3qÒÖop¢`´nÕò‡üåËS·NmN>Ãó/ˆŠŠF”ôíÝÛœºO'•E>>>ôèÕ—ÈÈHvnÛJ†„± ü7íýრ rÅŠqéÊÖoˆï|êÄÑdûÕô ­~,X€¶mZ±ió69oÁÈȈo߾Ѧu+Šk {*¥m¤W)!Åf$æÀÁCZw©gËšUJ--õ+1»öìåë× –.^ôSõ2Á"­“ßU*W¢SÇÉÞóúõ 1Š|yó²hþ\ѵè¨hLLâ+~åÌY7õâ%•MOª-•Š®ã õ»F‚Œîoßr欑 éƲ«xôø1LJFµ¶¶fÚ”É).äsÙ·Ÿm;vàP´S'O-KŒný£´÷$©²7nØ€G3wÞæÏ‚ °rõÂùÆÆ$;H¥Å~éj{ÓÒ·ß½{ç­Ûؽsæ:„•ÒHÕcPPã&Ldäˆa’î¥f3Ò3ΈŽŽÆi“3eË”¡REÍhéé“tiRõ"µO’òn"cÇO¤t©’aƒeddddddddþ<²ï7¢ Eý]·`ª3 ’®…¡º’:AÌÌâ'ÃT«Õ/Á ‹ “žkh ßcanNXØï9ONµüâÅKT¹xIkžÀÀ»BBB´žI9‡Ã¯¤}»¶êsÔ"##ñþð‘mÛwлoF ÊAEù—.^¨>ç 8$„W¯^³lÅJZ´nËf§ éZ]ž;wnŽ>$J{÷îí;i:\Î_¸Èœ¹óññõE__Ÿ 2`dd¤õ<;K 6m\Çä©ÓY¸x /ÁÆƆzukÓ½[W­;»ŒE´úzñ»º´ÕE©¨ÎtÌœÙ*Õ¼òçgòÄñLž8ž?ráÒevîÚÍÒå+øèãü9³Dù[µl¡Þõ©bßþ,\¼D”¦P(8zô8… Ùacc£>[¨FµjèééázøH²¼¯_ƒè?h0Ïž=gÞœYthßN#Ëž Ïø#4’}áÂ+VŒ­Ú°Ái“zÉ@?Þ1×±C{Ú·k«Îß¡};^¼|Åî={¹uûÕ«%rTm[¾}KÑ÷³7f4C‡ &‹µµzç_¡BvTªXFM›³mÇN† D† ñvtÚ”I¼xñ’ÉS§³ÇeÙ³gçáÃGÔªùÙ³Ûˆvýª–öö…™:ùGèáJ+2eÒ†É!×Ã)îQ¡ ˤm²øú•KäÈ‘¥RÉ×  nݺ͂EKpÙ€c‡‘5kõpLl,zzzêåææÄÅÅ!‚h’αxq ìϺõ©ß° ¥J•$8$„÷^ïiצ5»÷º¨ŸÕ4A7ºœ?¤bÞ‚Elٺɓ&ЭKg fÚŒYtéÖƒM׫ëïãÇOX·~#Û¶lÂÊ2õ3a¤–iZôÞ¼YSÆ£‘?…£Q(LŸ9—}ûiß®-sfÍ­¼W•‘ÊÉQºt)ÌÌÌÈ›°›)&&F´ ÙÄÄ„óæ2hÈ0ÚvèDÙ2e022äþƒ‡tïÚ…›6§º =­$Õ‹JÏJ¥‚ukV©ÃuåÏ—•Ë—R£V]öºìW;X|ýühÓ®¹rçâ¼Ûiµûêµë 6‚›·n±w÷ÎÏÎL­ŒTÒv.$Ñn(©õ+1 …‚;waW°`Š}PZôâñÎã$g äÏŸü¢Œ1eÚ Šs`ÓÆ ý±±‘ÚXgÎLêÕ12Žÿï ç%¶ÕRl©T¤Œ3ŒÄö«@þüÔ¨^]8F-»fxÍJ+âzp?ß¾}ãúõLŸ9×ÃGØê¼ S-áôz÷êIófMùôù3ÇOœäŸ®ÝéÝ«'ÇÕÈ«Kÿ(õ=Iªìݺváâ¥+¸>¢ëñî&Æ&Ô®U“ /‘1ã¶!eü%Õ~I±½RûöÐPFÏàA([¦Lªù¥öRõ8aÒŠØÛÓ·w/Ieª‹ÍHÏ8ãð‘cÓ½›v‡Uzú$]Ú†½H퓤¾›8oÙ†»û[N?¢S/########ó{‘x¿UH__?ò'‡“ÕJÚÄ+W&q f†º…6”ésĨž¯Uó/ GWÒ<ðÃ9)h9_!æír‚™™E‹°pþ\Þ¾}Ëê5ëèÑ­«èå/1V––T©\ g§T¨\•%K—ázpš___O㌅Œ™4'¼Þ½ódðÐádÉ’…Û¶P¹REõ˯ƒc)­÷®\©ÜâWç^¿~ƒë7n±oÿAtÅiÃZÉ!±Ò‹º.H¬‚yòä¡G·®´mÝŠvþæÀÁCŒ=R4Icdd¤¡GSSÍÕÏW®^SŸ'S¶B%ëçÎ_ ,,LcôÛ·ôé7€ððp¶mÙL•Êšß4Î4QáP´yòäí8Í’%ÞùVÄ^s|¹²eؽg/Þ>¤8yª:·Då ü]dÊ”Ik133£ZÕª8xˆ>Õ+˜sçÊÅÉc‡Ù½Ç…W¯_“)SFæΞIíZ5)Qº¥Ký¨ÃY¬Uz±×ªÐSïRÜ­§¯¯O¶¬YiѼæææôí?ç­[?vŒzr%00‡¢EØêì¤þÞ§OŸ4Vs1œ åËqêôYÂÂÂ(Y¢kW­Äe_¼È“;wü÷²eÃÐÐ_?Ýú˜oß¾±mûjþUƒžÝ»©Ó­¬¬X8gÝαÁiÕ¨Ž Œ3‡¢Eðöþ ÒWPÐ7bccÙà 9sæPÛ©ešo=<022Ò!fjjJŽºŸaΠ!ø}ç.ÇÕY«Ò#@`Bøˤ“Ñ»~kתÉñ#®ì;p???²g·aô¨„‡G°qÓfuýlÔõ1ÁQabbBÆŒ±É–MÃ~ÙØØ'wn¼?ü¶eë6‚CBpÞì$ªÓÕ¨N·®]ذщ»÷îiÝš,‰9sÖ1ã&?_>6nX«5œªÝh£AýzÌš3—·¿(2@Òúuáâ%ž<}Ƹ±£EQì dÒ„qôèÝ—ý :8Mm#­zÔ]mFb† ’jèO©õ+17oÝâóç/Œ1{RÅ{ooFŒÃØ1£¨Vµ >¾¾(•J‘ýW¡šöM¨KJ¥’ÀÀ@™=w¾(ï÷ïßQ*•Ìž;ŸêÕªªåLK™jã»;ïÞyRµJeÑÎ7©„††Ñ½go<Þy°~íjêÖ©­5Ÿ]ALLLxñò•Æµàà`|||´†ç,TÈŽÉÇ‹Ò–­X @™Ò¥Ó,wrÄÄÄpîÂE2eÊD©’?úÎâÅ‹ñôé3­ãŒÈ¨(2˜þ¨ë>|ÐZ²'8'|||©”Šÿ.9Y ~l3aÒjT¯Æê•Ë“ݨP(øôé™3gÖ¨Rê‹T´Õ/µ^rjêÅ&! ´oÚÛFZô(]lFZR¿sþ|üÄp:µ$ÿæÏÒ‹ Lž:ý2dÐ@F šâs^¸x‰W¯^kŒMÕ¶ZÕçJ°¥iAê8£˜ƒÏž?'..CCñ«Þ³ç/Èš5‹z¡ÈãÇO8{îM›4ƱxqQ^•Ã&±-<~â$Ož{.ZÜ$uü%Õ~I±½RûöÏŸ¿ËÜùâ3×TcûMÎ[Ô¡û¥Ê"U¾~~dÈN›E÷U-s;wž‹—.S´hQ ž.6#­ãŒÀÀ¯<~ü„õë%šTj™JiRõ"¥Oi6ãË—/âvî'›çæÍ›,Z¼”íÛwj\‹åá£Gèëë“3GN¤òíÛ7.^ºL¹²eèÔ±-[4ý6CCC\UÇ? €Þý`–!ûöîJÖyñÊרY‡ƒ‡jèýÒå+Q¡ByuZùrå°±±Áeß~Ñ9j§Ïœ lÙ”Ã)}úü‰ L±HåÌ”QcÆÑ QSöí?¦²KJ‡ŽÿФy+Q¸\ˆoG×oÜ$—­­hâbÅÊÕüÝ¥›è,2AØ°Ñ š6i¬N711¡^Ý:ܺ}÷·oÅz9¯—reS3åzøgÝÎQ¶LmïÑ£ñg]ªÚu¹reÉ–5+®®G4å{\öaddD½z?Vƒ¿óô¤k÷žz¾s7þ\¶–-›‹&9Û·mÀª5âó† ÓgÌâå«Wê°É¹lmÑ××çÑ£'êI#ÞÞ&OBØHž=~ õ¯D GÌÍÍyöøë×®Ns™j#88˜ñâCÙöëÓ['kC¡P0dØp^¿yÃf§ É:ï ¾¾Ô®U“›·niôI.ûö#‚ȧP(2iê4 5ÎãªX¡Q¯n,-,ðûô‰½.ûñðxÇ?wLv_J=~‚ØØXZ4o®õzæÌ™ù«Fu.^ºÌ{ooòçËÇ‚…‹ñ÷÷§m›ÖÉ:¿[·j‰‘‘Ù³g§]Û6ìÛ€ÞýðO§Žd̘‘²i³3™2eí@300`òÄñ 9šºt£¿¾˜ššrÈõ0×oܤe‹æ)†~ üÊ»wžTO8##%|}ýðôòâ[pðO)ËAƒ0zÌ8þéÒ~}û;·-^^ެ߸‘°°0sÊòåËËšuëé7`}z÷DOO_}ÆߘÑ#5ÃPŽÎÕk×éÚ½'£GŽ oÞ<ܼu›N›)??-š7ÓéÜù øøøÉýyðð!¹lmY¶d¡ÖgØ»oæ™Ìoß¾ñàá#<|HîܹéÕ£›ºŒÆØqèÝ·?=ºwÃØØ×ÃG¸~ýC T‡p„øPŸ>}fμùDGÇѱ¯ß¸³lÙ ræÌÁàâˆíÚ¶áØñ“œ:}†ˆˆZ4oF\\.ûðèÑc† ¨ž ³¶¶¦]Û6ì?p‘£ÇÒ½[¬­­ñôôbÉÒåèëëÓ¯oÚfRˈïWÖm@¡TàççÇùó  aÈ T¯^Mã7^½z­¶ÍI111¡Oïø™¹róÖmÊ”)­æPEµjUÕ!GÆ•«×èÑ»Ç!gŽܾ{—uë7R±bÔ¯§þžææ™Øë²###7lÈ×  V­^KXXëV¯ý΋/yñò¥úóó/€xˆaBèê¬Y³R§v-Ñ÷¶ïÜIÆŒ âÊÕkx{ ZÕ* 2H”¯C»¶¸¸ìcÖì¹| üJÅŠåyçéÅÊUk011¡ÿ¾ê¼]»üÃÁC®LŸ9‹ððÊ”)Å÷èïœqsã؉“”+[–òZ&8u‘%66–I“§¢P((_¾‡\kÜÇÊÊJ­ËõëQÄÞç-Ûøþ=†:µk‹Ûùór=B±b4oÖDýÝK—¯h'¾*Äâ™3ndË?Á_¬˜ƒhgŽ®õ«nÚ.\ˆ={]Ȝيúuëbll̃‡Y´x)VVVtìÐ>-CšýD}EDd|õ?ŠÂãµo×===É6C*Rê— …B§§%J8êt¾’®u] ï<=Y».þ¬»,Y¬EºSa_¸°z·}á´kÓš‡\111¥QÄ……±a£ÁÁÁ,[²Hý=©¶TJ™¦eœÑ¡};víÙË´³øú5ˆR%Kàõþ=ËW¬"Kkè¯þ~ùòå¨^½ÇOœD__Ÿ¦abjÊ“'OqÚìL† ¦üÝéG¿;udÿƒÌ™·€ÏŸ¿P¾|9bcc¹xé.ûP¨ÖP¡ºô í=IªìEŠØóòå+Æè‘#°±±áòå+lrÞÂ_5ª‹ìºÔñ—Tû%ÕöJéÛ¥"U)zL+ºÚŒ´Œ3õb®¤»#µLÓÚ6tAJŸ”›!########óïFvàýf²gÏÎ~—ÝÌž;—}ûÙ½g/ïèZ8ž(®½¾¾>NÖ1cælæ/\Ĭ9søs®¦Nž”ì¡ÛRP*•,^¸€ÑcÆ1îý{ ~`¿bÙ ( Ê;qÂ8¾øû³a£6:ajjJÿ~}È›7/=í„Q1zäpÞyz²mÇN¶íˆßemmÍÌéSEù*”/‡ó¦Ì¿€ƒ¬Šv,^œí[7k„âY¼hýúbÕšµ¬Z³zöèF¶¬Y™¿p1±qqiÖÉÛ·,_¹J”vûÎnß¹À°!ƒ5xOž>ãÉÓg@üd®••%åÊ–¥KçÔÜ'æø‰“êšFFFØdËFËÍéקwŠ/“?“ Ê3h`6:m¦M»èëëS¿^]–.^Ä©Ó§™>s6õ4ÆyÓFjþUƒêÕ«±pþ\V¯]ÏÁC?&b³eÍÊ„qcéÝ«Ço‘;1åÊ–!C† \»qƒ1£GjÍceeÅž]ÛY¾r5ÇOœM"gÏž1£FÐ7;{rÅÐÐ&&›§UË\¼t×ÃG5b8ŸÄ¯”=äzXë„6@£† Õç>Κ1,Y¬Ù½{/ƒ®ßâëX•*•™:i¢Æ‹wÓ&‰S(X´x)ƒ‡ÆŸbjjJ÷n]?vLŠÏsýÆ AÙ¡ßEËÚªÕk˜0i²:½ˆ½=Në§P'ÉŽ©Ö­ZâÀ†›èÙ;þ|kkk&Oš :ƒHEþ|ùصc+S¦Î`Ò”i@¼­Q½sgÏÒzÒ™³nœ9놉‰ ¹sçb@¿¾ôéÓK#«ŠÄŽ$SSSòäÉ­õ;­Z¶ &&†e+VÒo@ü„´¹¹9Ç Ñ8ÔÀÀçM7a³çÎâÃW«Z…Ù3§k„œÒ××gÓÆu,]¶‚‡\¹rõšZ7Ó¦L¦[×΢ü³fL£@þü8oݪ ñ窬]½2Í“Mi)S€à–¯\…žžVVV”.]Šn]»$+Çó/Ô°¤˜››«xŸ<âw vîŠ×£™™íÛµe¸±¢Pg›œ·p÷î={&î¿ ì/ràéZ¿ŒŒŒØ½c+W­a£ÓfV­Ž//===*WªÈ´)“EŽö´¢‹½¼¼Ô6+1OŸ=çé³Ñ Ú¶id›!)õKEHH …BöúgèE*ÏŸ¿@¡P¬UŸ=ºu…Ëœ5s:3fdßêñzî\¹X»z¥ÆY²Rl©”2MË8ÃØؘí[63uúL-Yªn×eË”aî왢úúú¬Y¹œ•«×²oÿµ RÕ™±£G‰Þ²eÍÊÎí[Y²t9ë7:¡X_þÆÆÆthߎNJέV¡kÿ(õ=IŠìòçgÝšUÌœ=—á#㙘˜Ð±C;&M¯!³”ñ—Tû%ÕöJíÛ¥ U©zL ºÚŒ´Œ3 ¾R /µLÓÚ6tAJŸ”›!########óï&õe°ÉçK.MOËÿNú§ 㩯åÿz€A¢õ}6LôÙ Ñu£DŸ þÿß(ÉçLß‚CV¤ôðV–:)é¬Û96¨¯³ò#""øüå ™­¬RP‰ŠŠÂÏï&&ÆäÊ•K§Ì©Ñ­G/n޺Ǜø~~ŸˆþMÞ}þD–,Y°´øQ×cbbP(”ZËøë× ‚ƒƒ±´´T‡ìùSL›1“={÷qÄõ€Æ(IQUŠ¥¥…Æ.­3J¥’€€""#É‘={ª»oAÀ××—ï11äÉ[§³Ã:þÝ…gÏŸsõÒ…?Z®ÁÁÁ|ý„µuæTÏ%Œ‹‹ãóçÏ(•¹rÙê4ÁHHp666XX˜§šÿW¡T*ñõõE¡T’ËÖ6Õ‰à¾~MÕ6ªˆÅÏïFFFäÌ™#Õ~ãÛ·o|ýDæÌ™º=•R¦ÿ6üýý 'GŽì©žÁŧϟ1Ë`FŽÙuü…_GXX_¾øcai‘ªÃ)..__?êã¯$..ŽO gýæÈ‘ãÊ¢T*ñ÷ ""B§:ðoBªÍŠ”úõ_&::¿OŸ051ÕzNXR~¥-•JhhdÎœú»† øûûý[Ûœ©¶;U;544"{vôõîÉ RÞ“¤È®Ê¡Ó»ŒÔñ—Tû%ÕöJíÛ¥ E©züÕüÊqFZÊôWµÿrŸ$######óï%44”¨¨¨t-A ,,L}¯.c²ƒP¯~òþ”ÌV–#€p .áOÄ&ùœøÿªëÊDŸ Ÿã!ÑgE¢ÏBBšê\„¤ÿ’ùS« Ñç¤×çÑ%M„ìÀûƒ¼?MRžŒÌ‘ÏŸ¿P¯ac*”/ÏVg§?-Ζ«×®Ó«O?zõìÁ¤ ãþ´82222222222222222222¿Ù÷ïvàýÜ¥’2222¿™9²3|è®]¿. [%£;ÑÑÑ̘5›œ9s0|èà?-ŽŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒÌÿ<²OFFæ?Oï^=¨Vµ ÓgÌÂ×ÏïO‹óŸcæì¹øúú±lÉb9ŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒÌ¿ÃôßBæ¿ÊÆõk‰ûÓbÈȤ}}}œ7m$22 SS“ôßðŒIÆ1eÒÙy'###################ó/Avàý“!CÂÒÊÈüç144ÄÂÂüO‹ñŸÄÜ\Ö›ŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒÌ¿ 9„¦ŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒŒÌ¿Ù'#######################ó?ÈÏ8VÇÌÌìO?ÆÿKdžÌÿ+‚CBðöþ@llìŸå¼½?ü¶ß‹ˆˆÀÛûaaaúÑÿs|øð?¿OZ ™dÞæû÷ïZ„ÿWlÙºº ááñîO‹ò?Ϙq¨Û Ñoù­¸¸8º÷êC§ºðý{LªùÿMí.&&uyU‚@ttôO—aמ½Ô¬S«×®ÿiu¨‰ŽŽF„?-_¿¤Èò+eAÒ)õE©TJÎÿ+KHiðïj×RªG©6@ª¥‹R©ü%÷V(¿¬~I­ë¿š_©G©ü›l¯T½H©ë¿²~I%..î—Êò¿T¿~U? uü¥T*‰‹‹“tÿ_ÙüJ~eóýû÷_f~Õ˜:-²§eü¥P(~™ìRj¿¤–é¯Dj;•ŠÔ>éW¶¥Rû¤“½“‚Ôúý¯iÿKH©_ÿ¦±£ŒŒÌÿ†Z€ÿE|ýüX¶|%—/_!$4333ªT®Ä¨‘Ã)boÿ§Åû©9zŒå+VqåÒù?-ŠÎ\¿~ƒYsæ%{½k—èÚ¥3oßz0xèpõ5===LLM°Í™“êÕªÒ®mLMMÕ×:ŒÓ¦Í?òëë‘)cFòçÏOÃõ©_¯.zzzi–½e›vdÎœ™mΛDéï½½é×µjÕdÒ„qZÅ?5k×óøñ6;m kÖ,וJ%‡aç®ÝxyyMÆŒ)Sºƒô§bŠ꼪2mܸ!#‡Ýçèñ¬]»žáÆдIcß¹s÷.S§ÍDß@—=»°²´Ô*ïçÏ_X¹z —._&0ð+3f¤X1èOõêÕ4ò_¿q“µë7ðèÑcâââ°´° ^½ºŒ1ŒìÙ³§¨›‡1qÒT2f4Ãõà~­yÆŽÉõë7?a§OOVî_MpHK—-çô鳇„`bbBêÕ˜8~ùòååmÙ¦Q‘QÉÞËÞ¾0kV­Pþ§kw“Í߬i† ¬þÃÖí;Øë²??? )??=zt£]›ÖíTŠìReø6´iÝJ”ïß\¿ õq†”úµÿÀA6;oMö·Ö¯[­ÑÜðU«×pÿÁCbbb°¶¶¦i“Æ 2ˆÌ™3«ó½~ó†aÃG%{ïúѺUKQšÔñ×ñ'qÚìÌ»wžÄÅÅ‘=» -š5£_¿>XZXhäÿ•};@xx8:u&..ŽiS&ic¦¥~²båj.\¼H`àW2eÊD Çâ Uß¡ÍNƒîö+-zQá´Ù™ƒ]É_ ?Në×jÍ#õ}to§‰ÇFFFXYYQÌ¡(Í›7£d G­¿'uüuáâ%Ö¬]Ï‹—/Q*•äÉ“‡îݺнk—TçR*S©¶TÊ»IÒù mÌž5J+ª?KíÛß¾õ`Ñ’¥Ü¸y‹˜˜¬,-iÑ¢£GŽH5¼[JzIËØQ…®}»”~ ::š•«×pôèqü000 \¹²Œ3šR¥J¦¹L“ÎQi£]»6ôëÓ[ëµÔÆŽRúS©²¤¥OJNþäì—”ú•Ö±£.²HyOJËxMê\FæÑ£Ç?å>ªÅzIí˜Lúx¿__Úwø›€À@Ô¯GÉ’%øðá#GŽãî½ûìÞ±bÅþ´˜?ÇOž÷/Y!¨+–V–êa__?îܽ‹CÑ"88Ä—KŽ?&¨¢¿GãéåEÁ(W®,¡¡¡<~ò”ó.²ÿà!¸ìÁÄÄ€àà`<½¼¨T±"yóæA©TòõëWοÀÑcÇéüw'fΘ–fÙ==½È–M3„dLL ž^^88ýÓêýéx{`ƒÓ&6¨O­šiͳhÉR6;o¥l™2Œ3 Þyz²{÷^zôîËÎí[(W6¾üTeêï qŸÐ<½¼ Õú;.ûDpH'Nœ¤Kç4òÑñïÎ~ýJ»¶m°·/ÌçÏŸqÙw€ž}ú±võJÔ¯§Îáâ%ŠƒCQ.˜Gkk^¼|Éú Nܼu‹ãG\±²²Ò*Oxx8£ÆŒÇÇÇssóduhddÄÌÓø»sW–¯XÅÌéS{9ÆÅÅѽgo^¿~Ãß:R²„#>¾¾lÙºNÿtáØQW²eͪÎïéé…¾¾> Ô×z¿Ü¹s‰>{{ 888Ù ì¤ù'NšÂÑã'¨^½½zt'*:Š#G1qÒ¼ß{3fôÈ4Ë.U–?Ò¾ã?è3lÈ ²dÉÂÉÓg˜¿p1±±± èßO×Ç×—vþÆÈÐÑ#G`gW¿OŸprÚÌß]º±sûVÊ'Ø*ˆŸÈêÝ·?æææ <kkkΞucý'>~ôaŲ%"Y/YÆÆM›É‘#;}{÷ÂÄÔ„sç/°`ÑbÞ¸»³xá|uÞòåÊ’ÝÆFë3îÞë‚¡Fú¼‹Øºm; ê×cÈ |úü‰-[·Óµ[ON<&š8‰‰¡{¯><þ‚®]:S´ˆ=OŸ>cË>>|ô-dPÙÞ åË‘+W.‚ƒƒ9á¦l™2lX·kkk y¼Þ¿çÌY7¬¬¬Øµ{ú÷Õp®©ˆŠŠæ«+K—¯$,,Œ¢E‹$[ߥèQj™Þð®Ý{beiIn]Éf“—/_qÈõ0W®^ãıÃä²µÉȆNìÚ½…B‘¬S(ôìÝ—ûRÂÑ‘íÛë‘# 4„ysgÓ¾mu~ÿ/þxzyQ¿^]­6È&[6Ñç‹–à¼e+M7b̨‘råê5V¯]dzçÏÙì´A÷Ó§ÏxzyѸQC2dÈ U^ƒŽY)uÝ:³õëÕÕzÏ7îî\¾r“D“« L6ÿ¥ËWðzÿ³D2JÑ£TY¤–izlï÷ïßñöþÀªÕkY·~#³fN•\\¯^¿¡ˆ½½Öþ¹páBéª_¯ß¼¡ã?162¦KçÈ™3Ǻ~å*§NÅ&‘ ’R¿£Kßñ‹…®]¿Á¬9sùðá#Y²X“+V®fͺõ-R„ÉÇ£P(Ù·ÿã&Lâû÷þîÔá_]¿T¤6ÎZ¿>|ôÁÓË‹ÎwÒêHú/]fàà¡Ñ®mklsæäá£Çìܵ›{÷î³w÷õwñôò¢v­šØ.¬qï¤_©ã/§ÍÎ,Z¼”bÅ5b8FFF\»~›6sãæ-põ¿²oWqâä)Üß¾ÅÊÒ—ý´:´¤Ö¯ˆˆºtëÁû÷Þ´iÝ GÇâ|úô™}ûÐ¥{Oœ6¬Óhﺶ …BA÷ž½yñò}ûô¢BùòDFFâ²o?cÇO$0ð+}ûôRçÿcj€)S§ó$aaRL’IQ©²Kí?pIS¦aW° #†ÅØؘk×®³vÝnݺƒËžÉ.FÒõ}@Åó/X¸h qqq,¨ét’b¿¤ê%qÙ±sÑÑßñôòâí[>¤¿Hi§‰ÇÆFF|þâÏ—}lݾƒN;0kÆ4‘Î¥Ž¿Îœucèð‘.TˆÉ'`f–'O1gî|BCB5óI)S©¶TÊ»Iâ1užsV”þìùsÁÎÞAø§KwQzë¶í…b%J Á!b[´{‹V[’˜Q£Ç Mšµšµh%”.W1U]vëÑK(R¬„Úv¤ÄÝ{÷·sç¯÷ïÓRl¸ìÛ/ØÙ;;vî¥ßº}[°³wfΞ#JO®®'GÕµ„JU«ë”÷Å‹—‚½ƒÐà`QzDD„P¥zMÁ±TQ]’*»YAúö(8–*+Òu\\œÐ©sW¡{¯>‚R©T§/X´X°³w._¹*º‡Ç»w‚½ƒÐwÀ Qz“f-…"ÅJï~´c…B!ô0H°³wÙüW¯_ …‹jÖ®'|ûöM$Kÿƒ;{áÊÕk©>Ͼý„BEŠ wîÜ¥?}öL(T¤˜0iÊ4Qú… …ê5k çÎ_¥ovŽ·§G¥/X´Xhи©àëë§NÓf{cbb„å+V vöB·½´ÊºxÉ2ÁÞÁQ8xÈU°³w.^º¬‘çÞýBÇ¿; %J—K•Uÿ–6{›=J-Ó: Ž¥Ê >¾¾Zõµrõþl×î=BËÖí{G¡F­:Ââ¥Ë“µq‚ðÃö8X4ùúõ«P«n¡d™òBPP:}Ô豂½ƒ¨~%GXX˜`ïà(´ißQãÚ°£;{áùóê´>ývö§O©Û+AVד#22J¨× ±Ð¥[Q»Kw÷·‚ƒc)aõÚuéÒ£Y¤–éÏ°½¯ß¼j×k .Z\¸{÷ž:=0ð«Ö{$‡T½ô0H(T¤˜ðâÅKÑ}œ·lìì„uë7ªÓ¤Ö/ºôí!!¡B×î=…ÊUk…Š¦Í˜%4jÚ+V®NÕ†§¦)cG©öKjý:sÖM°³wF/ÊûøÉS¡P‘bB÷^}DéRÊ4¥ù mH;JéO¥Ê’ÉõIâ2HÙ~ ‚´ú•Ö±£®²HyOJ陵פŽÁedAÐcü.8(8p0E¿ 0<Á‡Ó=Á§Ó)ÁÇÓ2ÁçÓ(ÁT+Á'T5ÁGT.ÁgT"Á‡T4Á§d—àcÊ›às²MðAÙ$ø¤Tþ)«D~«L ¾,³ß–i‚¯+±ïË(‘_Ì ß™6[ªÈgàýFBBC9wþ6ٲѽ[Wѵ²eÊ0zäÚµi-ŠiÿèÑcêÖoÈ°£8qò{]öÓ½goZ¶iÇ—/_Ôù<Þy0pðPV®^Íø “X´dýf÷^ƌςEKh׾߾}SgÅÊÕŒ=×ÃGhÕ¦=bÃÆMôé7€!ÃFhœQ1hÈ0V­Y§ñ\gκ1pðPѹs.]R§3pðPõß !Ã4î¡P(˜:}š6gùŠUœ:}š³fS«n}9ª‘ÿÅ‹—ԭ߈QcÆá´Ù™¡ÃGÒ¶C'ÂÃÃÿt1```@­š5ãË=™•K‰É’ÅšÒ¥J"¡a©çÿY¼zõš¿j×eèð‘ìqÙdžNtëÑ+á,9ÍsDŽ=Æ_µê2zìxvîÞâÅKiؤ£ÇŒÓãÝÔÔ”ã'NR¿a6nÚ̲+éܵã'Nþ)òGEEqâä)Ê”)ì*¢ˆˆ¢££É›7Æj’re˲kÇVæÏnYŽŸ8Å÷ïßiÔ >M›4æÙóçZÏb,dgG¿>½E+‚‹ÇÔÔT£üƒ‚¾‘-kV…ì ª¯kãØñœ=wžË–`œ°45:vhO\\‡K5ï’¥Ë8x(gκ¥[w§NŸÁÔÔ”ŽÚ‹Ò+WªDáÂ…8}úìOù]éÕ³­~033£x1¢¢¢E¶æWÊîïïÏ¥ËWhÓº•(Tˆ{wí`›ó&Ñ*AU}(TÈNtŸùóc``@PP:íÛ·o¼qw§j•Ê¢0:úúú ì×€3nçÔé‡C©TÒ·O/Ñ u¦OBç¿;a›3gªÏ3wþBÚµm£fkßþƒèéé1bøPQz:µ¹vù"õêÖ¥»ì;@áÂ…h‘$´Ûø±c8{궶)ËbddĈáC©]«&7nÞâÁÇ¢ë …×#G©R¥2Í›5ÅÜÜ×ÃG4î£T(°µµeôÈ\:ïFÛ6­Rü]©z”R¦5ÿªÁ„qc4VÖ–/W€°Ð»´AÀÁ¡(‹ÎçÜ™S8/–¢ì‡\ãŸ̨‘¢UçÖÖÖL<‘>½{’VBBCQ(²³Ó¸f§²wß‚¤Þ^דcŪÕøúù1gÖÌTC[)•JÆOœDžÜ¹ð?SÉÉ"µL†ý*boÏÊåKQ*•¬Y·^®êϬ,­t*'©z)_®C Ôˆ\Q¡Byü~ì¤OkýÒ¥o°°°àïN9uühª»Øu òçO·ìRû¤°ðp:uêÈè‘#4vÞT,Ÿ`ï´DéïsæÍGOO)“'j½.Õ~I-S&cÆŒ4kÚ„jU«pì؉tŸû'µj#sæ̬\¾”¬Y³°yËV¢¢~œŸ%eüõèñc>}úLÛ¶­133S§ëééÑ­Kgbbb’ ­§K™J±¥¿)}Rll,çÎ_ b… 8$‰dѵË?èééqúŒöqIZÞ}SBªý’Z¿nݾÿ\Ivõ—*Y‚jÕªrëÖmBÕ™_Y¦RÇŽRûÓô’RŸ”˜Ôì—Ôú•žw“ÔdùY$7^“:—‘‘ù÷#;ð~#/_¾B¡PP¾|9­!¸úôîI§ŽÔ×BBCé?húúœ;sŠãG\9wöNÖáîþ–q&©¿k`|å*ׯ^bܘQ¼xñ’ýrãÚe¦NžHHh¨z ÿ}ÂÂÂؾsÜÎàvæ$îÞ¢æ_58sÖ³:Lf%G×ÎÿðôÑ} äÏ OÝWÿ=~ w|ËÖíìuÙOÏîݸsë:ÇæÚ•K”(áÈ„ISxûÖC”üÄÉDEE±kÇV®]¾Èãw©_¯..ûüébVsëöm ¨˜0‘”ááá<{þ[ÛœäË›W‡»ÿ&NžJdd$ǺrÁí 7¯_aì˜QÜð­ÛwˆòFDD0iÊ4jþUƒûwnröÔ n^¿ÂŠeK8zü„VG« lظ‰ãG\¹vù"wn^§B…òr=ÌÓgÏÓ-ÿÝ{÷‰‰‰¡zÕªÉæ±²²Â&[6îܽǻšu¯r¥J©žy¡ ‡\]ÉekKéÒ¥ÔáG´Mö·hÞŒqcGk„¹¹wï>ÑÑÑTNt^ÄÇ'÷ûô‰wï}úÌÝ»÷xñâ¥ÖþNuÆjåÊš¶TOO™Ó§ŠBFªl·……%Á!!‹oÚô+õ}àÜù >r”Ë–!™s¤Ú/©e ?=7¨_cccš5m‚@×Óù~"µ&‡™™ 4 ,,ŒG«Ó¥Œ¿^¼x µß)‘p¾ÞËW/5®éZ¦Rlé¯DjŸäéåETT%J×ÈkmmM.[[^¾|•f½HAªý’Z¿~ØÍþ¸° …‚·oÕi¿²L¥Ž¥ö§é%¥>I….öKjýJëØQY~)פŒÁeddþÈgàýF>}ú@®\¶:å?vì8AAALž4AGºNíZÔ­S·sçyïíMþ|ùÔ«-jת‰©©)¥JÅŸáV¥r%LLLÔщwíAüƒÞ={3gü¹n¦¦¦L?Ž+W¯qÖí6HÓ³bhhˆžžzzz¢•eÚغm;¹lm™0~¬ÚieiÉŒiShÚ¼{÷ícÚ”ø][oßzðúÍZµl¡~aÕÓÓcÈ œ/_¾Löp]¹ÿàðcµ}rÌš9!ÃFйkJ8:R»vMªW«J©’%“Õ·»»»†“îÐQááñŽ'OŸ1 ?ôôôÈ+¥K—âȱãŒ5"Ù߸wÿ_¿~åÑã'ìÙëB•Ê•4&#ÇÅ»wžtêÜ•íÚ’5[V^½z͉“§èß·Æy& …‚ÑcÆQ¹REþù»£$}ZYZb_¸0>B©T&{–@ófñå^ú'LCpHå²Å¯Nð!ƒµNüxø@Úµ˜>c»÷º`ddDll,ôëÛ›Ñ#Ghè%S¦Ltú§ >ÂÀÀ€¸¸8ÌÍÍY8®ÆŠüäP­ªTÝSÅÁC®˜˜˜Ð¨aü¹*Íš6æëaNž<-¹m%Fª¥”ib W®^#,,ŒËW®râä)zõ족“QWQ(ZÏÌøèéé±bÙúD›viÚ¤1ÆÆÆ\¿qƒ§Ïž³xá|­g]¸xKKÍÀE‹Q÷=Rëº6-^Š™™ýúöIõY"##Yµz +V FuñDÎÏУYRâgÛ¯Bvvxx¼ÃïÓ' ( ^ý{ñâ%V­^#ZI^¯næÏ­¶Ó?«~ùúù±jõl²e£u«“Ýi©_iíÛS#gÂxÉÝ]K} H¨A_“ýþŸ®_ºŽ3ÒR¿BÃÂÐC®Ý{ŠfÉbÍä‰D;®?}Ž·¥º>«j÷ËÊU«¹tùŠzÒÓØؘžÝ»1jäpQ™J© üÊÓ§OùüÅŸ#Gñêõ+-˜':ËæWöíª2:rôeÊ”VŸQÕ¬Ic68m⧧èÞRêWrÄÆÆ2eÚt èÝ+í;±sçÎÍÜÙ3™6c½ûö§JåÊDæرXXZ°`Þœd¿û+ÆÔ±&((ˆÛœšì?£O‚øó NŸ9K:µ5ÊTêû€¿¿?'OeÜØÑ88Õ‰¤Û¯´”é‰'‰‰‰¡eB{oP¿S¦ÍÀõðjþUC#ZÞti§)Q¸Ð±cÕ*•5tŸÚøK5‰n“-J¥’a#F0fôHµMûòÅ_㾺–©[šV=~¢µÌ–-+•œçRû¤ÄzX¾rïÞyÒ²Esê׫K6›l¼yãžf½¨Ðeì˜t©_9rÄÏ¿¹¿õÐ8KP›HK™~ü裵mèëëÓ¤q£4?ŸÔþ4=²èÒ'éj¿¤Ö¯´Œu•ågÒxMÊ\FFæ¿ìÀûD%¬Ú01ÖmKÿ£Jµ„U—‰©P¾nçÎóìÙsQ蕼yâW^¨vUí,2Ëï@‹‰Õ¸WÅ â0f… Ùabb‚‡Çïq„ùøøà@:µ ú&]bmm¹¹9Ož|äË—/|‰AÀÐÐoß‚EùóåËK† X³f±1±Ô©]KíœÌ+W²¿S)I˜¼ìÙãu’\˜)¨ÂÅdOFÏ*êÕ­Ãé“Çسw/]bÕ구Z½kkkzvïF¿¾½5™Ož>STŸ]]hÕ¢¹:­YÓ&Ì™;Ÿ7oi¬ÄS1kö^%¬RmØ >ÆÑceeE»vmXºl9[·ïÀÊÒ’À¯_)W¶ µjÕÔ¸çº ùèãˆõkÓ¤ÓìÙmxýæ ¡¡¡Z'ËUtIî#=¨mcŠ?÷·o9sÖˆˆÈ„ôx‡qt´xø•£Æh½§Ëž]”/'”†……3|äh­ù»véLù„ð&ÚX·~#N›iÔ°={tO·ìºÊ?Ø^¸x ãÆŒ¢UË(•JŽ;ÎÔé30pgNW×_}}ýø0oÏ^pÈõ0Y³fåÛ·od·±¡y³&¢Å2˜R³æ_\¼x‰}û¨CœEFF2{Î|ôõõ‰MÔgDEG‰žI*«V¯!C† ôèÞM³DE¡P(¸yë6%¹àv†|ùòòÞÛ›‰“¦°~ƒ  u«– ú‹×Ë–mÛi׶5Ö¯Åúø2i‹˾ý9zŒ¯AAìß»==½tëâÇ“=zõ%22’Û¶’!a,¬BjýJkßž*”'Kk\öí§uËê >|d£Ó&€ë㟮_ºŽ3ÒR¿ÂBà %_¾| 8€,Y¬yöì9ËV¬bôØñXZZª'𣢢D÷O ÕdVXX8kW¯$¾||ôñaͺõlÜ´€±cF©óK©xôø1LJ‚¶¶¶fÚ”É "eßñ ý”!ƒŠò/]¼– BÁ!!¼zõše+VÒ¢u[6;mÐXÉ'…ܹssìð!QÚ»wïhßIÓárþÂEæ̯/úúúdÈ###­çÙYZX°iã:&OÎÂÅKX¸x 666Ô«[›îݺj]Íkll¬1¦¯¿«K[]”ŠêLÇÌ™­RÍ[ ~&OÏä‰ãùøñ#.]fç®Ý,]¾‚>>Ì›3K”¿UËê]Ÿ*öí?ÀÂÅKDi …‚£GS¨666êÁRjÕÐÓÓÃõð‘d'ù–/]BHhžž^ìܽ‡ÆÍZ²dÑÑÞ‚Elٺɓ&ЭKg fÚŒYtéÖƒM׫ïÿøñÖ­ßȶ-›°²L[Lzµmùö-EÞÏÄØ(~Oõ’R ~jT¯®o¡:#©Ã#w®\¸ìÙ¥õžY²hîðŠ‹‹ãÕ+íaòBìJR ÓgÎÆeß~Ú·kËœY3DÝ´Ê®«,úñ“w;´§}»¶êôíÛñâå+vïÙË­Ûw¨^->”ä¹ó|D­š‘=»Øágß–¿ÿ®Ñ®Sã§'W¯]çïN´¾d¨v{*• Ö­Y¥Î“?_>V._JZuÙë²_íÀSMjÚÛfêäá¤+U¬È”I:|$‡\‹ž59Tá^¿8?~‚˜˜êÖ©-Z±X»VM¹ÆÓË‹‚ HÒAZõ(µLUdÌhÆáCû‰ŒŒäÑã'lß¾“#G²}«sŠ»/’Ã4CÂFGgNb<Þybœä<€üù8X ]ºõÀëý{œ7mT/^zçéÉÐa#iÕ¦=§NÕXøÐ~²eÕ\1on.ž¸•Rד²uÛv è¢%4VR ;vî®`Au»üYz”*Kj¤Õ~%GÒ¶T¯nnݸŠ…¹¹hò®|¹²DEEqÖíwîÞ¥r¥JéÖË“§Ïè?p‚ °kÇvJ% ƒ&µ~¥§oO ̛ˠ!ÃhÛ¡eË”ÁÈÈûÒ½k6nÚœl}üÓõKÊ8#-õËeÏNѪpûÂ…)V¬-ZµaƒÓ&õ¥Ê~&äNŽqcF3tÈ`²X[«ûœB…ì¨T±š6gÛŽ <ˆ :”2þJL¥Šq=¸Ÿoß¾qýú ¦Ïœëá#luÞ„i»à¯îÛ¹ÆÀÀ€êÕª©ën.[[òåË«ÞAª-ÊBjõ+)_¿ÑÐ`ž={μ9³èоÔ*'Â×Ï6í:+w.λV/¹zí:C†àæ­[ìݽSë„ãÏS‡„†2zÜx@Ù2e~ºìéé“<Ä”i3(^ÌM7hŒ×¥¾8oÙ†»û[N?’êd®Tû%U/oßzðìùs:uì vöC|¢sç/pòÔiþî$žÐ–ú>ºµÓ”Ð6vT¡ËøKÍ&&6===õÎ"ó„¶-‚¨ß”Z¦Rl© ©ïIÓ¦LÖí"±M—Ú'©ô¢ê7J—.…™™yv¨ÅÄĈ"¥õÝW×±cZÑ¥~9/ΠýY·~#õ6¡T©’‡„ðÞë=íÚ´f÷^Q[JK™6oÖ”ñc5ÛéõÙHíOÓ*‹.}’û%µ~I;J‘%1º¼'%%µñš”1¸ŒŒÌÙ÷Q…ÎôõõÓ)¿j‚RÛÁΪ­¡Ñ¯)Â8…3CÝB Êô9bT‡üÖªù—†£+iø᜔J|1©¬Vü˜™™áP´ çÏåíÛ·¬^³Žݺj¬UaeiI•Ê•pvÚH…ÊUY²t®÷§ù÷õõõ4&È3fÒ|¹x÷ΓÁC‡“%KvlÛBåJÕ0ÇRZï]¹R%.¸Å¯ž¼~ý×oÜbßþƒ8èŠÓ†µ:‡ÚùY¨ë‚Ä*˜'OztëJÛÖ­h×áo<ÄØÑ#Eb### =ššj®¼rõšú —²4@çÎ_ ,,LëÊ]Õ ¿reËÒªe Ú´ëÀ„IS¨S»ÆÆÆ|ûömÛwPó¯ôL´kÉÊÊŠ…óçqÖíœ6ñWê‚ÀÈ1ãp(Zoï¢p€AA߈eÿƒäÌ™#ÅrR&´+ÕäÒï CSÌÍÍÕáBZ·j©vÔ&„äIºÓRß@Ÿ9t?¿0sf+ÜÎœÔ9xx8ƒ† ãö»L?VkX¨´Ê®«,ª‰‡"ö…5®•+[†Ý{öâýáƒú¥fåª5d̘‘óæ¨í¦¡¡!ýúôæÜù lvÞÊÐÁƒÔ/'¹såâä±ÃìÞã«ׯɔ)#sgϤv­š”(]ŽÒ¥~ØÛ\¶øøúâëë'yuêáÃGA½p!)&&&d̘›lÙ4Ú yrçÆûƒ÷½X«ôb¯U/ 39<<ÞˆvëL8;h̸ Z¿ãzø(cF¤ƒ´êQj™ª000PŸËP©bEš5mBÃÆ͘=w>Ûœ7I–Û&[6 ñõÓm “çMRu^¸x‰'OŸ1nìhQ仂™4a=z÷ÅÅe?Æ}/[Öl:Ù)u=1aaaœ;Ê•*êt^êÍ[·øüù £F ÿéz”*Kj¤Õ~%Ç[ŒŒŒÔ¡²LLLȖ̪ûõëqÖíoßzP¹R¥téåÌY7ÆŒ›@þ|ùظa­ÖP]RëWzúv]¨]«&Ǹ²ïÀAüüüȞ݆ѣFÁÆM›É“;·ÖïýÉú%uœ‘–ú•\8'‡¢EÈ“'·(ʆªœýt|ÖL™2i‹›™™Q­jU<ÄGŸØ.,iü• sõ.´šÕ téR 9šmÛw0 |¨Ë_Ù·sáâ% uhßÕpóæ-­á"S«_‰yûÖƒ>ýζ-›©R9ý“€[¶n#8$çÍN¢>ù¯ÕéÖµ 6:q÷Þ=õîžÄüÌ15Àü ‰Œˆ$k–,ì?pP_ ÆíÜy^¾zEÛ6­Ó${Zú$AX´d)›6o¡YÓ&,˜7GÃÙ$µ¾÷öféò4i܈ó.ªóÆÅŇÄóõócÿƒ”,Y‚¢EŠÒì—T½t¹ìÛË>Í÷a×#G4xRß@·všê±£– v]Æ_ª ÿÀÀŠa«³“úûªPëªH>iyÇ“bKUH}O²´´HUïRû$µ^ú‡‰ãÇŠ®ªûŒô¼ûê:vL+ºÖ¯Q#†S¡|9N>KXX%K”`íª•êºŸ¸-¥¥LMMMÉsJéOÓ#Kj}’Tû%¥~´±cZl© ]Þ“£Ëû€”1¸ŒŒÌÙ÷q,^cccî߀B¡ÐÙçzø§NŸaÆô©äΕ‹Ü ¶¯ŸŸ†aöK8O/¹|)øû`k›Sý9&&† %9»MOOO«3ñs’sõ¤’'Oî„0ß)]ºTªùU;„ü4®ùúú¦[?[[[ž>{ÎG_ŠI1¯……9æææ¼÷öÖñîéãüÅ‹( F*Úñø5Õ°-ŽÅ‹ãX¼8ú÷ãõ›7tèÔ™5k7üvžuÂ@6(((Ù–OŸ=çö;thßNcež¹¹9åÊ•å§'¾~~iŠ~Èõ0zzzÌž9]c7ÍÃGÙ½g/'OV‡?X¿Á ¥R) kñÃ2eJóêõ>|øH¡Bvøøú¢T*EíS…jbÌ×'¾Î+•J döÜù¢¼ß¿G©T2{î|ªW«šb9©võZé°«ñgRÌÁgÏŸ§q8õ³ç/Èš5K²!i¡¡atïÙw¬_»šºujÿÙU¡9||4m›*|Xâñ½?| gŽ¢E*²ÛØð(ö1þ¢°·VVVõñÆÍ[( Ê–)­N+[¦ wïÞãÎÝ»Ž'Õ Å† У[Wß>wáVVV)®b/^¼OŸ>ÓÚ?FFE©w®AüD±±1>>>÷‰TéEÇ]‚'O ZÂDéwwž¿xÁ_5ªku8.X¸˜#G2jÄ°ωL©z”R¦þìܵ›"öö4kÚD”7w®\äΕKt8»ŒŒŒ(Q‘GãáñNCö÷ÞÞŒ9†±cFi ý>|âŒOŠMBèeŸtöñºÖõÄ\»þíÝw|SÕÿÇñw›––]¦éÞ{ *‚þŠ ˆ"¢ˆ(ˆP•%àDÜ{!8ØŠ ZU Œ2 m’ß%áæöÞäÞ4mÓòz>}$÷Ü“›;Ò&í»Ÿs~Ô¾}ûtá8xéë¯ ~i¿ðÂóc~ÝúùµbåJ­ZµZgžqz0LÎÍÍÕºõë-ÿ(±kWÁ(ê…hÏËÌ÷ÞWÿ蜳ÏÒèQÏÙV­¸}}¹}oÆQG©‡z0¤mäó£$IMO=Õò1¥ùúŠæs†›×—ßï×æ-[”`9úÈ®]»UÙPíøž;o¾n±øôG?®|¯W$Ç£;w*gçÎàïW¡Û}=ºùü%T|ñÕWºêÊ+tâ '„ôË ?{‹ó½ýÃ>Q^^žºtî¤MÃ{íرS?9D3Þ{ß2À‹ôú øã?Õ±Ëíª\¹²¦¿;M5R,¿O-Î{FíZÁsvÚü®¸>SKÒÆ›´?/OC† éøi¤W‚S D³ï’»÷$¿ß¯‡>ªwÞ®^={èÞÞw[žC·ß§›6mRRR’¾üêk}ùÕ×…¶·rå_zbÈPõé}wÈþürs^¼^¯>øðCÕ¯WO÷õ)üûw§ÏÔÜyóôÏ¿ÿFõšsû}jgÿþýúê›oU¹rerrÁß.Ü~þ:áÿ >Ÿù÷²_û-¤Ûkêögiqrûžtä‘M”’’by¶oß®ÿþû/8Üb¬~÷•h__çœ}v¡ýûyî¯?W¬¾)Ÿwà?Í“½ú|>}úÙgªT©RØ9›œš=gNÈòüù äóùtÊ)'‡´§¥¥é¿ÿþ úpÿþýš5ë{ÛmW¨PA¹~µS¥J5kÚT . ¾IìÚµKO==<øAV:øavÞ¼ù!}wïÞ­ŸçÎ-òùˆ•M›6iî¼ùªP¡‚6¨±ÿì9?hûöí:òÈ¢»îD ‚ÑüÇ®)S_•$y}Þö¹óæiÈÐaÁIŠŽ;öXÕ«W78–I Lþ¼qÓFÛ>?ýô“†xVS§¾Vh]^^ž/Y¢ÄÄDÕ­SWnmÛ¶Mß~7KÍ›5ÕM7¶W›kZ‡|Ý{O/%%%iæ{óÃ?iÔè1Zµzuȶ¼^¯-Z"Ç£Z~¡­_¯žµdÉÒ`e\@fæmß¾=8éµÇãѯ¿,²ü:é¤U¥JýúË"½4vtØcÚ°qƒ*VLUZ„ª‚ûîï§K/¿Jo¿ónL®å—_ª={öè£CÿósÉ’_ôçŠE§ß-¯×«^÷ôÖŸ+Vhâø—ÆwŽï-š7WíÚµ5ííw öÙç_H’š5;Š5lÐ@kÌ+j”ŸŸ¯ß~[®ÔÔÔ_üž5ZÿסcÈxÿ~¿_/¯””]uåÁöë¯k#Ç£I“§‡ ûâËZ°p‘’,&³ÏÎÎÖªU«Õ¼YӰÉ\uåÊÍÍÕ4ÓkjÑâÅÊÊÊ VÖIÿUxñEêç¹ó´ò¯¿BÏËgçÅØßÎÌ÷Þ×_~¥fM›ßOÕw]o¿­Ð÷t›kZëê«®ÔÆ›ôÓÏѽ߸=n®iZ•*š<åU|~T¡×ˆ µfíÚ"ý'n»¶×K’^:ψ×ëÕ£ƒ×ïüa9,· ¼O.Z¼¤ÐºÀ³ FÿOKn^ëFó,”T0÷°ó.TZZËêТžG·ûâD,~~mß¾]ö/rº[׃óü ú´.»âj}gúœèóù4ó½‚á…ŒÇâö¼üôó\=ôð@{ÎÙÿò‹a‡œsóúŠæ½Ý ¯×«»îî­i߶m›ÞšöŽŽ;öØà¼Rf¥ùúŠæs†›×WVV–Î9ïBõ¸ëîBŸ5¿›õ½²³³Õ²e‹`Ûgœ®úõêé˯¾Î}ðÓÏs5íwµcÇŽà?„´¿ñf]ÙúÚaù¥‚Ïë?üø“ê׫ü#›Ï_RÁïC&¾¢I¯L)tÞæÍ/ø}%ð™U*Þ÷öé3g*55U÷ÞÓ«Ðk·ã­·èøãÓW_üžÛ×WÖæͺ½Û:¬bE½ýÖë1 ï$ÿ¼hÑâBëߧ‡Î{q}¦–¤)¯L´|­ßÞ¥³$éÝioj἟¢Þw·ïI£Ç¾¨wÞ®¾}îµ ï$÷ߧ§µjeÙ7plœž~ýe‘n;pÜn~¹9/³¾Ÿ­-[¶êÚk¯±üüÕ¹SÁ?6Í|ïý¨^_n¿O­x½^=öÄeee©Ã-7‡tûù«yófªU³¦fÎ|¿Ð?ξ9ím%''ëâ‹/ŒêšºýYZÜܼ'¥¤¤è‚óÏÓO?ÿ\èïBÓÞ~G~¿?ø¾«ß}cÅíëkÕêÕºµS—B¿KÏ›_0/[›6­ƒï_ñvMݼŸE¤÷$·?¿Ü¼¾$wŸÝîK‘΋ƒßÜ~¬8 åïJx%¬ß}õóÜyzüɧ´ò¯¿uúi­´)+K'½¢ììlùÅàÅ矞Z¶h®7Þœ¦FG4Ò¥—\¬œœ›0QkÖ¬Uÿ~„ýc…G“§¾ª *¨e‹æÊ\³VRRRR¡y Zµl¡Ï¿øRÏ>7J­¯¾R;wìÔØ—^VFF†Ö­_o9§ÙÑG¥?W¬Ð“C†êì³ÏÒþýûµ~Ãpüñ!2îïÛG:vVÇ.·ëá‡ÔÑG¥ÌÌ5zaôý¶üw]a˜¿àðêe‹æú~ö½0z¬Ú\ÓZ[¶nÑ°áϪ^ÝzÚ¹s…ŠbÕêÕúü󂉤ÿú»`(‚ù jì‹/σùÒÊ•+5qÒdIs®[·^_|ù¥vîÌQÿ~b`Ö÷³µù@é~ήýõ×ßúæÛšª~÷÷UIhÞ¬àÕã'NRÆ •˜X0§ËÚµÿéØcŽÑ?«ÿÑ¿™™ª[§ŽRRR”Ÿ—¯ÉS¦*'g§:Ýz«jÔ¬¡œœ}ôÑ'úûïUê÷@Éì·Q«V-¥±Ò¼y lÿ³î¦ÛkúŒ÷4zì‹Z¿aƒ.¾èB¥§¥iý† zkÚ;úûïUºùÿn´­à çƒ>V^^ž®im=,`µjÕtî9gëÛïféßÌL5:âÝÝ«‡:uéªN]nWîÝtÔQG*;{›Þ|kšV¬\©v7´UzZš¤‚jÓÚ^¯wÞ®>}P§ŽT½zu­^ýžyö9%&&ª›iRô¢Ø²e«V­Z­³ÌñκuëµúŸ´mûö˜RíÚµuúi­,÷³M›Öš<õU½÷Þû:û¬3•µysÈ?²ìÞS0ÄõÚµkC†ÝjwC[%$$¸>n®ijjªztï¦çF½ º¨Ó­T»v-ýûo¦ÆOœ¤¼¼¼à%iùòßµü÷߃˿-_.© 4M:0ŒvÍš5uáçK’nh{½>üè}úÙçÚ½{·®i}µòóó5íwµdÉ/êÕ³GØ?ü†sÑ…èè£Ò›oMSµjUuÉE©B… Z´x±†xVU«VÕíÛzÜÔ×^SåJÖCTŸ}öYÁ¹ÐܼÖþúëï‚ëÖ$òœ‡^¯W«Wÿ£“N:1ìÏÐhÏ£“}q{M‹ò³×ëójýúõúúëoµ}ÇõêÙ#¤ª§s§ŽúèãOußýýÔãÎn:ù¤µuk¶^{ý -]ö«nù¿›Bþ`îæ¼äååiÀÃåõzÕ¢EsÍ80ìšQÕªUƒóó¸y}EóÞnü^— *rs÷…´ŸÞ¹ª]»¶<ªT©¬·¦½£ääd]qÙeÚš­FUNNŽ^=*n__n¹y}edd膶×ëíwÞÕíÝîÔÍ7ݨJ•*iÑâÅš0q’*W®R­äñx4ä‰ÇÔµ{ÝÚ±³nëÒYMš4ÖoË×”©¯ªfÍšÐÿ`…PÏžwªïýýts‡ŽêvGW5hPOÿü“©—ÆSNNNÈ·n?µhÑ\gŸ}–>úø%&&êª+.WJjª–.]¦ñ'©bÅÔaÿŠë½ý?Wè÷ßÿÐUW^aûŸõ×^ÓZC‡Ð§Ÿ}ò»žÓ××ÓÃF(++Km¯¿ÎöŸ8¯»¶M°ZÐÍ÷Æ­nÖô3õèck×®ÝjÚôíËݧϿüR~ü‰š7k¦†?8ÆÓgj·ûîæ=iÕêÕûbÁ\w5jT/tN¥‚¹°œŒdSTn~¹9/ÓgÌ”$ËÏo×IÕªUõþªO 8ý}Àí÷iÀÔ×^S¥J•”­ïgÏQfæu溧WÏ`·Ÿ¿<ìw¿îï×_·ßÑ];uT… 4ó½÷õÃ?ªWÏ…æüuÊíÏÒh>S[iÒ¤±®¸ü2Iîß“úô¾GßÏž£Î·wUï»{©n:š;¾^|iœZµji9ïž[N?;ºùùåöõÕèˆ#´aÃF=ùÔPåæîÓ‰'þO®X©‘#ŸWݺutWƒ×(ÚkúÇÚ~o¤¤¤¨ëíÓC¸ýìèæýÔí¾8}OrËÍë+ÚßMŠ›“Ïkn?ƒvÁœ]%á]É!À+azgÚzbÈPM{û½ñæ[’ ‚®aCŸ Î&11Qã_~Qƒ{BC‡ ×ãO‘T0oÂÀ‡¨SÇEޟϧÞVßûû©ß¿ÿJ*øÃÄó#ŸQ“Æ¡oõï§MYYzyÜx½< È1½ï饚µj꥗ÇéÑÁK*øÖá–›Õïþû ‘&I[³³%Ì­Nrr²¦¼2Iƒ?¦±/½¬Æü‡é±Ç£±£G…Ì£ üâûú«“õÈÀÁðÈ Iï›çœ}–†<ñx¡ya¤‚¹²>ÿâK¥¤¤¨Aƒúº³ÛêÚõ¶àðºßÍú^[·fë¶.m‡Ç<ñ„tä‘Môå×_k×®]ú矂Ïo´ì×ß´ì׃Õãm¯¿.øŸ´nΣÛkzWÏ;U¥JŸ8Q}úœÛᨣŽÔ˜ž×冈ùæÛï ýG´$}ðáGúàÃ$ü³GàöÄÄDM÷¢žù¼Þ1SßϞܗA<¬Ž·Þ¢h%''ëW§hÔ c4nüD½0º`¿túi­4葇-ÿ˜5aâ+¶Û<¬ÒaÁ?¸}­lÍÞªŠ+Z¾žÌvìØ!¯×ÞÙN´çÑɾ¸½¦EùÙ› ªU«êÔSOQÇ[;z?:²IMgy.Ž?îØàbܼ¾¢yo·ú )¤}êäIÁ?Ê4Pùù^½ñæ4½úÚçëÈ&š4aœíÑÇÃëË-·¯¯ÇRÕõÆo©ç?J*ø\}Ƨkà€‡BB-©à­S^™ ¡ÃF‡ï“ þ :ðá!Ãöµ9 ¼0zŒúx8Ø~ì1ÇhüKèBSµ½›Ï_‰‰‰3ê9=Vo¿ónð{-!!Agy†è{_¡ß«Šã½}ƤM"I­[_­áόԌ™ï‡xN__¿,-¨:˜1ó=Ëà\’.¿ì²`€çæ{£IãÆz÷í75♑ðÈÀàë%%%Em¯¿Võ0ä¹ñô™Úí¾»yOúí·åòz½Ú¾}»íùìÜñÖ ð$w?¿œž—ììl}7ë{pÂÿlç‚JJJÒUW\®7Þš¦ŸçÎ þ¾âô÷h¾O¥ƒŸ3*Uª¤£>J·unl_h¸w7Ÿ¿¤‚÷‘ýû÷käó£Ôí΂0°J•*ê}O/õêÙ£H×ÈíÏÒh>S[¹ø¢ ƒžÛ÷¤#l¢©“'jà ÇÔ÷C®ý£ƒÆ$ÌqúÙÑÍÏ/·¯/Ç£IÆ©_ÿzbÈS!}ŸxìÑà´1E¹¦¿-_ ã̪T© ÍÜ~vtû~êf_œ¾'¹åæõíï&ÅÍÉç5·ŸÁpìB<»’åôÝ/ÁE[‚Å}ã²ù+ð²D‹û ’<†ÛDÃr’aÙcXŸlXN:ðe¼ŸlZ®¼mûŽçÃ|Õô4G'é‹/¿Òe—^âøäïÞ½[7mRµªU ½A›íÝ»Wë×oPJJÕ¯_?&\:v¾M?ýËk¼uk¶¶oß®ôôô¨‡K‹•AƒÓ›o½­÷g¾[h¼y³ÀXù;vìTzzZ‰Î©feïÞ½Ú°q£ª¦§Gü¾ †§Ùº5[ÕªU+–×ûÿ×A¿þö›f÷M©^×;s´yófU«ùgc¼)Î}÷ûýZ·nöí߯† 癲³gÏm zçë1/IDATØ°Q©SU¯nÝ°ïùùùÚ¸q£|>¿êׯWèVû²aÃFíÏÛ¯õë‡}ψFNNŽ6mÊRZzš£_Œ6oÙ¢Ûw¨víÚJK«âàâƒÛóèæšJï×ÙÛ¶©NFF‘+öÍòòò´~ý%''«nÝ:1ýïXŸÏ§¬¬ÍÚ½{·êÔɈé n_ëÅ­8Ï£[Åùó+ð~wXÅÃT»v­ˆóG–Õ×WQÎKQ†·µSV__>ŸO›7oÖî={ÿüÊÎÎÖ¶íÛU·Nˆý·oß®­[³U½z5Gó»ùüå÷û•••¥ÜÜ}ªW¯®å¼uæþÅõÞ^–åççkݺõò˯úõêE<ñô™Ú;ÇÛ{’n~¹½¦ÅÉí÷©[n>ù|>­[·N^Ÿ/æç%šŸ¥ÅÉí{RVV–rrv•ú{µ[n__ÛwìÐÖ-[#þýKŠ¿kêöý4ž¸y}ÅÓgG·Ü~Ç¡k×®]…F32ΉËðnúô’¤‹/±ÏSªUM¿WÒ.Iù¾¼’òLËÆûõ>ò÷Àr¾$¿aÙkXöh Œ·n¾ï·ù 0.›×û8i A€WŠ^i3x@Y´qã&]|ÙjÙ¢…&O_Ú»SfÍžóƒnëÚM·ué¬ýû•öî(f‘NÚB$Åðºòœ¼0€pBˆ#x@!ÀâGÅÏoú@|9¤óœòà/æ!{qÊsæSnóŸ¤ÒÞbó 5}úŒÒ>&X+w!^y©À+· +@yrñ%—צËM^TV+ðJtXÌK.¹¸´ \رs§ÒÒÒŠûiÊôke-À œè„’}Ò}:€r«Â;³2ä•¥!4cubÍ©L]0€rÎœãÄ2#*â½/Ö‰h™¹0Šu¡W\gFñZ«W&.‰eö·R¼xEáædÇí…8DòYO<xE=ÁN_./$@9TRùO\åGñàE‹à |;¤ò xð¢=‰N.@¤>åâ"”#±ÈwŠ’•zvTš^´'Î͘§áÚKýäÀV¤L§¨™Q¤Ç”Z–x±îdÚ­#ȈvyŽÛ ¨Ì*K^¤RÉpí~‹örw1Ê »,§(Uye&*ÏíÉq2†©UÕvåC,ó XgU1WÒ^,Ði².¡%Ј?á²»ª<9lvJLIxn,Ú¹ìœ\0§%/Ú¼§¸çÎ+±L)çÀ‹Åؤ‘Â<ªïâ›9Ï)Êh‹ejn¼x ðÜž¼HN ÜäÄ—HyŽÛ<(Ü㜬+qÅàÅ"ùtz’#%°vÛ‹« pˆs“ë8]g·½Hýår1‘TœwÁ/)ÁE_§ ©±oÌ«ï2׬њÌLååç«^Ýz:öØc”àô0Ê®‘#ŸW¢Ç£{{ß]¤íüºìW}ñõWÚ´1K)©)zòñÇ4aâ$mÚ”¥G~¨´³Ì:l˜ªTIS¯ž="öýí·åšÌèøBnÛ¶Mƒ?¦ÔÔMš0A Ô®»àüóÕ²E u¾½«FyQÍ›7×ñÇY‡#~¿_{÷îÕa‡ñ9½^¯öíÛ稯$íß¿_’T¡B…ˆ}÷îÝ«ääd%%…äååÉï÷;Ú¦S6lTíZµBÂ;I:óÌ3">6??_^o~¡ÇJÒ¾}û”””$ÇÒî÷û•››«Š+Æì ?w®$YϧÜÜÜB×Öï÷kÏž=ªX±¢£Ÿ¦rß¾\y±3g¾¯œœ]ºçî^!á]@åʕշϽºûž{õÚk¯ë©!OJ*¨ÚõÂõïßOß~7K~ø‘rssU³f-ÝqûmjÛöºBÛZ¼x±^7AË–-“×ëUÕªUuí5­Õ½{7%''ûõº§·ªV­ª[nþ? >BË—ÿ.I:õÔS5葇հaƒíææîÓø ôɧŸjëÖl%&&êä“NÒ½÷Ü­O:1¤ïÚµÿééaÃ4ÁBùý~ÜqzðÁ~–çfÃÆZ±b…š4i¢Ã6´=‡sçÎÓ3ÏŽÔúå÷ùtC» õ©Zµª&NWèoj×NÏ<÷œ–/ÿ]5kÖÒgŸ|xpÝ7jøðúý?äñxt饗è‘ýåõúô̳#õù—_iÿ¾}jÔ¨‘|$x¬7nR¯»ïÑM7ݨÚ^|ΡO?­E‹–¨K—NºêÊ+ƒíƒ?¦ììlya”$é÷?þД)SµxÉ/Ú¾}»$©AƒúêpË-!Û“¤—ÆÓ7_«±cFkäsÏiöœ”——§÷fLWÆ ´~Ãû¢fÏž£ÜÜ\¥¤¤ê¼sÏÖ}}z«fÍZN_¦Z¼x±†©¿Wý-Ç£3ÏC99»”ž–¦N:ªã­ïE`Îz|aÖEj“ÅrQ»QZ^QçÇ3®³+— ÜZUÚEUJùãÏ?K’.½Ä~Ž»ÓO;Méiiš;wžü~¿´k×ný›™©§‡PåÃÓÃõWbb¢Þ™>CC‡ “¤oÖ÷ßëÁþÔðð†ºÿ¾>ªV½º.\¨©¯½®µÿý§aO öýï¿ÿ”ùo¦æÍ›¯Ë/½T7´½^+Wþ­·ßyG}觷ßz#X=•——§ž½îÖòåËuÝuתYÓ¦ÊÙ™£7Þ|SÝzôÔÄ ãô¿ã—$íرCwtï¡={v뮞=Ô¸q#ýòËRõ¾·’““U«fè\kóæÍÓ“C†ª×]=Õ¹SGÛóÓ Aµowƒ^ãMíÛ¿OíÛݲþw§kíkCÚÇøã?êÒK/Ñu׶QNNNȺùóç«õUW«]»¶š7>ûìsvXEeþ»FÉ’uÿ}}´sçNMž2UýzH¼7SÉÉɪS'C»vïѬY³‚›ÏçÓ—_}­œœ]úþûÙÁoÿþýúæ›ït¹aŽÃeKÕîݻեsGÕ­[W»víÖ§Ÿ~¦§‡ —ÏëUûöí‚}·lÞª33uOï>ª[¯ŽúÞ×ç@%fE­_¿^ºÜ.Ÿ×«Î:ªqãÆÊü7SS^}UËÿCo¼6U•+WŽøݸqƒè×_mo¸^=ztÓŠ+5åÕ×Ô½G½õÆëÁ Ä={ ^“{öì>6ð:>âYy’<êÖíUHNÑŒÓõÂè1ª[·®.¹ø"§ß.D+Òˆ‹æÊ<»Ç„Ë€J}ž»pâ­ÏÈj^;«À.ܘ§²éo÷Ø°233U±bEÕ©“aÛ'!!A7ÖÒ¥KµmÛvU¯^-¸nïž=z}êT¥¦¦H’Î?ÿ<µ¿éfyq¬®ºêJ¥¦¦hß¾\ yêi~Äáz}êäàpŒ_t¡ªW¯®ñ&ê—¥Kuê)§·»aãF {z¨.ºð‚‚†«¤ÄÄD½þÆZþû:ñ„ÿI’¦½ýŽ–-[¦Ç ©*»øâ uý í5fÌX½8vŒ$iꫯiË–Í1üi]pþù’¤óÎ=W•+UÖKãÆ ðR*¤(==]©†lР¾Ú·o§O?ÿ\»rv…\RAx™³+§Ðã6lܨV›Ö­-×|v„Î=çIR뫯ֺõë5cÆ{ºð‚ó5|ØÓÁ¾iiizjèÓúéçŸuÞ¹çJ’Z¶l®o¿¥ýû÷«B… úsÅ åäìÒ9眭… Éçó)11QË~ýUûöåªåŠ5IjßþÝtSûý¹úª+uÛÝ4åÕW Ÿ${Ü1z|ð£!m÷Þ×W{öìÕ¯MQ£F‚í§œz²ºßÙSo¿ý®n¿½KÄ×è¦MYz o_Ýxc»à5«U«–†<5TÓ¦½£.]:EÜFBb‚¦¼2)8ôæ矧Öm®ÓGL€( VS£¹Í‚ìªòÊÄ|yÑO°eÍÉ:)Kt3ÇÝð™î[]0¯›ƒÛk1_™•ÃT9íÝ»'¤ýºk¯ †w’”’’¢¶×_§œœ]Z²d‰$iÞüÚ¶m›nl×®Ð\j×]{¤‚a(jÔ¨q0¼; e‹æ’¤µkV³}þŪ^½ZHx'IéééºàüóµxÉ/Á9ôfÏž£ŒŒÚ:ÿ¼óBúÞtSûBóËIÒW\®o¾ú¢P˜+UªTÖÕ¦ý¨Y³V0¼ 8夓%I×_:<é)§œ$© r/ UËÚ·/WË~ýURÁð’UªTVÇ[;hgNŽV¬\yàÚÌ/8·†/0G]nn®V­^¥ß~[®ß—ÿ®ÆG4RVÖfmÝš]ho¾é¦åœœ]ú駟uî9g…„w’Ô¼Y35lØ@sçÍ“©©©ºöÀë$àê«®T•*•õýœÙŽ¶Ñöú¶!óæU¯^MGÙ8äµ@,-\°@’“Uáà4b^Ye«ï¬æÈ“ÂWå™E;G^4}+é ¼HsÜÙõqzR¬nÍU|ÒÁa5}#ª\é0íÞ½+b¿œ}*UªÒÞ¸qãB}7:B’´nÝ:IÒêþ•$½ùæ[úàƒå?°{~¿_~Áý-[¶†l£n½º…¶›ž–&IÚ¿_°íŸ3•˜ [;v>pà¡ÛÌÏÏ׎ÛU«Vmý·nš5=58üf@¥J•T³f ——§èêÕ«gJRº…+"«n²NÝ:¦ö‚ó²3ç`•_«–­$t-š7× ԼYs|ÒIªT©’æÍ_ ã;N ,T“&MT£ÆÁãߺu«ž6B³çÌ‘×[8Þµ{—jÔ¨Òfž—033S>ŸO‹—ü¢[;v.tÍÍ×;ÒyJII iKNNVýúõµnÝz‡Û¨S¨---]›·lqápàÌ3Ï4.³cÁ–“*¼h‚´X…x1oChZ…y[ãš ²ëìÊ$Ã}9Ò¸Qc-Z¼XkÖ®Õá Zöñz½Z½jµªW¯¦ªU«†¬óx ýT=ºw·ìóíw³´gÏ]|Ñ……Öªì¬Ú2Ì«W÷@ÅØ1G¥kÛ´‰é‰ÌÈÈО½¹ºµÃ-ûÖ®UKë×®ØÊËËSVV–ÒªT‰é¾•¶–­Zèý÷?ÔÏsç*7wŸZµl)I:­eKû¢~ž;O^¯7Ø.I[¶lÖ²eËtóM7éºkC¯Õ¦YŽŸ»^Ýz’ ª&\›p6lÜœ³/Àï÷ký† ÊȨ]Ú§Kû8`7d¦Õ|vÆõæm(º¸ë9ðÜ—l:9ÑVãžÚ¥­Æ¡3}†û®.еmÚ¨Fzýõ·ôÛòß ­ÏÊÚ¬çž^*TPÇ[;ZÿÑGŸ†T~IÒ‡}¬ ))jÚ´©$éŒÓÏP…”½ùÖÛÊ }±Ù矯͛³ôùç_Dì{úé§)sÍýºì×öO>ýÔr¿¶nÍÖ/K—*+ksL÷¹¤´jÙJ^¯W/¯š5kªQãF’¤ÓZµÔ¾}¹zå•W *ò\'é`_Bbè·Qvö6}7k–ãçÎȨ­ãŽ;Vß~÷½þûo]Äþ;vìÐ/K—jÃÆ…ÖåäìÒw³¾iûᇔ½MgœvziŸf´pÁ‚àœwÆ6ÓxpN Íwìªè¬ò"'Ãk†Ë§J-è+©/ÒûÜ7.‡›|Ð\]éËÙ¸‚*Æð駞Tbb‚ºßÙScÆŒÕü µä—_ôÚëo¨CÇŽÚ²e«êßO5*ôøìm[5èÑÁZù×ßZµz•{üIýñ矺ùÆöÁŠ¶êÕ«©çÝ´zõjÝÑ­»¾›5Kÿ¬þG¿ýú›>úøcÝÙã.-^¼8ª‹p[—NªW·®ò”^7^Ë–-Ó?«ÿÑÏ?ÏÕ¨FëÁþûvêØQ©©)zxà ýðÃZ·n>ùôSû’eõÝœæ¨ëÝõégŸEµo¥­EófJHHÐÊ•©e˃ÃX6nÒX5kÖÒÊ¿þÖñÇ2”e­ZµÕèˆ#4ó½÷ôÙgŸ+sÍÍ™3GÝzôÐa‡æêùûÝßW>ŸW]»Ý©™ï½¯•+ÿÒÊ•éÛï¾ÓÀAjÊÔWƒ}.Z¬®wt׌é3 m'==]ÃGŒÐ—_}­uëÖé›o¿Ó“O UZ•*ú¿ÿ»±´O3ND›õ8VSaúFêgµ\,âaM«a0íVsÞ%„éë¤/ªO’š6mª)“'êùQ£õêëohÊ«¯×Üqzò‰'Ôª¥õC»ùV6Ëá‚D)º00b@XxÆ :»ûVýÍãSè vsÞyT¸â.pëURÔô´4¥Ÿx‚ëÇÞ°¡oØ0b¿„„5jÜHÔ(Ú]´U¥JetòIû%%%é„ÿóç/O<š4i³íedÔVFFí"m£bÅŠ:ñ¤KûÔ@gÙÌd²IÖ£0º Û «YìJj¼hD*q´J?}•Wúù" ˆ.X  Éɪœ\´Ùô±ªˆ 7MZ¸ÌÈÉКq§8+ðì*ê¬Ö[Íwgukµ]«É íÚ­‚<7•wÅ–äš‘†Ë´ ëÌí~‹e©ðÅð™žK*¸Øƹ÷e}cîôÓZéôÓZ÷Ó”ÆÈ8w] (Ë\¡'Ãr¤€ÏøxYlO6ëì֋ҘϩHUwv±*4vu ’òJû@Ê«ýyya—-Úöé`hg•ýØ­3sZwŠc<7Um~Ë~máæÁ3î›qÌÔüb8‡óÛ9铯ÂóßYM“&EΊ"µ9]¶S,£=¥ϸ3 ú&8h3¶GªÀKÐÁ*:«²GŸ WÝ™‡Ñô*ò¾ ää« Ã1VÜ–­Šµü6ë$÷Åcv}¡¯Û>a9 ¯"õK°iK°YN0µ–M·¡/óÖ%šÚ=†v©O’©ÝcúJ”äÙ¶}ÇE=‘‡:cU]`XLs[¤>•*v™ »@pgüòn•zÆvcàç3õ1‡ÒÁ°ÏúY™«í ÝNÄ€¯¤çÀ³ª®sº>R ¢Ý¤„*½ÀvUw*>‘ƒùíœô „kÆÀÎ<ž]åHa[¤*¼/¯¸+ðŒ÷#Uß™+ñŒ÷•yS{  ÏX¸on7VÞ%¶a\N–TARŠi½Ý¶ŒÕ€‰6mæJBóqZ cb¸[»óíuñÁi%—“¹Ýìn}*\af5 ¥¹rÍ|ëµi3‡pÆ*9Ÿ¤}’öKÊÓÁª:ãú|…Vâ™·e¬´3¶Ã>+S»ÕqšYíá®Q™«À³ÚÁíÆÊ<ó}ãzó¼w^jƹòŒJíB¾Ãi çÌCuï[…vVž9 4nVmæÏÌ*´#  ür;Ÿ›] å‹Ðf5ô¤OÖažÝp–Æ[¿iìŒÏã•ýЗƪ<É:l´ ÝÂ͉礽D”d€.”K°èc7œf¤0ÏâׇÓ4Þ×ÛÀÐšÆ /Épë³ØžÓcxîÀ²ß´?2¬7ë)…†s>S›“*<§Uw ü WgWE®ºÌÀcM Nçb W•fÌOŒóâY…eÆ/ÐÇ*¼³NÓÜf ó¼5‡}‘¾Œûn>f«s®o©)©/\5žd4Ù ©iu­*óŒCZJ¡xåÀ‹Ëêyªù çÊ|Q½ÖÙ Õ㌕w‰:8d§yÿdè+…ðd±ì&À#à ~¹© æE ðìB=»Ï<žy9ßð8s0—¯Â!9¬ó:xŸìÃ8»Â«H§,¶åöšÄDIWàE>Ó®Ÿß¢Ý|?pk Ь†Ò”Bƒ¼@˜N¢ ^P‰ J30×]`ñy<ûh7¶YÍwnHM£HCiÐP~E ™ìŠ¡ìîÛµI¡CfFJÓ<¦¹âή:ÏÞY Ñéd¨O«ó®@¬(çºXÄÛš’õ0šÆ~ ¦[©ð‹ÉXñf~œ¹Ïâ·)¬¼ó+´B/°óœw@ϸÝ@^¢©ÝxlÆá5çÁ®ê.ÜPš„vz¬‚+„uvCHšç”3.›C¸@»UÕœ]…] JÏÉüwv•væýŒTu.Ì´;¥Æi€gµ³ÅYUß… íÌmVÅgó<ÒÁ`.Pe—¤ƒyÆÊ»@Pg|Ÿ©ÍÜY ã¸o ïÌÇlïÌç<šà.Ò|y ¾ø¶Ù­wbE ñÌËvÃZ«òÌC]šçÁ3‡wùý­æÄs2žä>Ì+.Qm;VxvsÙ™C¶‹¾nædz›ϸÞ”yu°"ÎjxMóð–RèüwV•wmÛUÞ%˜ž'1Âsš‡öŒÜ9 íë(ŸÜ„zVÁœUÿHá—Õ—Ïæ¾×¢Ý<ž] g~Œ,¶/ÓóØ…zVÇouÌÑœ·bŸ/^†Ð4X¸Ð|ðva q(Mc5yÎ;cÈîŒóÒY •)ÃvÏa¾ï³¹oÔ…k“M+‘‚=<ʾH^¸pÉjþ;㲓 6»àÎ.„³NÓ¦¯1œ³VÓkÚG«sn^¼h*KTixæj:©p…žÕpš²ènìV«ùð¤ƒ<Þ+팞y›j;óð˜ÆðÏXõ'…¡iæÛdZ/‹ûáÖàP>¹ ðüúYthÚ—eègWugµÞ\9'…¹iœϪ².Ò¼wá‚H«s)Ø,%àÙ —é1važ¹òN í¤ÐÎ\iìŒ!Ÿ1Ð3Î…õÌ•wæ°.Ñð<ÆãN4ô5VÜÒbs»ù¸ÝÞ囓/\1”“!5­‚3s%¾ÏØÇ*°3Ï¡'Óv¼Ïï¤rÐ=ÇÅ®¤¼póÜ%8èg\g—,[ͱÒÕqÆ`Îâ¶aÛü†¾æʾD…yÆ}2Ïwg5çqÿ" —iêY-Ëåzÿ"IN*ÍdÑf^ï“}(fUgî ¯i7ĦÞùl¶o(FÚÏHçÎaÙéù‰ÒBÓn®;s@g7¤¦ÕÜwæf7¼¥â%˜îK¡sÝyLÛ3Vë%*tÈLc@g ï<*\!g¬¼ Ü%D¸µÂš”OnçoóG¸ Ü7¤¤¹¯¹ÎüuКƒ9c«9ñìB=»a:#Íwçäøâfn¼ÒðÜ £iê×[Ý7·™ç«“B‡Ó”¬çÉ lÆ~j<«9úÌsÙƒCchgUuç$¸sÚEB¨@üŠõPv–y½]5^¸ùèŒaUµœUežyN<«m›ƒ?'sß9´8¯C‘”d€g7\¦±Ý®ÂN6“¡Ÿ1d 7ž1ijÊ2°ce\ ì3¥i5Çù¾qÿìªî¢ îÂÍyç4˜#À ~9 ŽÂ ÿnj2ÉygÕ)P³3Ü\v>‹[É:ü3ï›Õ<}áΣ]»Ç•XëÏMu]ÿpóåC›~¾0Û4,¦]UžÝù’܇u1 ÷JzÍpáœU`·Î\iXg ϬÊ<¥ÂŸ±ÂÎ܇À Tç™çÖ3΃'ÍAÓàΪ’ÏC¨@ÙíÐVyŠù¾›yâì‚3¯a9Ü°šnº¢TÞ…«@tÜ•è0š¥1^à \¬4´¦Õpš ¦eã¼sÆ°N Û¼†uæ¹ëŒÛö(t(Lãó;.Ó.ГÅz«[; .Û@ÙmÀ©²ÎØÏ®Ïí°šÒÁÜŪ¸a6ÃU÷I‘Ã;«c²;ÞhÎw±ŠU¨ã¦*,Ò|oVëÂ…^vmæ¡-f9ÑæñVÛ2áúËb» s?Ò1‡;nÏ;(›ÜN‘¿póÀEªÈ³ Ï솬4Ïmiî<'a/ÌsÚµE:fEXçä¼9ô+Ž <»*9ãz'óÞÛ¬*òŒd}2Œ•w 6ËæÐ,Ñô<Æ!6¥Ð <¿¡U0çWøÐQ*Ô¹ÿ.\_Pþ9 íÜ̃gîç& 3w^‹>>‹ÇØ ¡«ðÎêÜ8B3\ W,z¥5„¦ñ ",KöÃgš‡Î´:I^„m>æùìü¦6ch—`؆qÙ*¸KûàήO òÉf9B=ʾhçÀ3.û#ô±›CÎIU[¤PÍMçdž='!b¤ã’ƒåUÚž‘qž;·zæv£ÀsÚîä¼Æt>»hÄ*À‰6LrZ}X¶r2Ò0•vÕqv_Nëö¹íŽÓiX‹Ð”o‘Â<'¡žÛ9ñìÚ£ms;¿]¤vY¬³:>7á›Ê?WâiMãAY ¥n><«a5'žU›ñyÃcÚUß…k“©ÝGZgÞoEèi]Qú€’‹!4Í뜵éw°ÎéP•N+îìú†Û†ä,¼sr¾J}èÌ€âBÓÉú„÷TªYbV÷mNÚÃÝO´x|¸ç wîøäpÀÌïp9\ åäÖnÝüuv÷#…s‘¶i·ӯ¨U•v^à ¬ª× ¥iUag· óý¢ì›ñ¾¹Zϸ’}(›¾vmvbU…ʶX…MNæ‹œÛTî¹ ðœìƒÛð.RÈYâbô%T*ŽJâW,B!·UwnæÄ3ÞÕP›VË‘žÓÉsKÑWç2^Qú¹ ñ¬ú¹Ù¦›JÀ’®¸#€v¢ •b97ž]›U»“ ÍI_·Ût{>ŠÚÏ‘â €JºÏn{Ñnnªí"=“ã.ŽyïÀ¡+VóṩÊs®E[EçtÈL«¾q[yPÚ^QúE;De,*øÜ<&Ò¾å¼à;Å5¿[¬æÉ‹ô§Á›}ŠëÊ»€²àYõ&$‹fŽºXUÚ¹ÝG€âæ´ÏiV”ÐÎÉãîS´á›¾e.Às»ý¢~ÑVã•ôcÝl»(ç(Öñ¡(Q¤ÇºVÓn½›ê¼’x¬ÓcpÛÏm_WÊb€g×ßMuž“~ÅQaWÔc,®Ç€²-š0ÉícÜVäGh©_QªîÜö/³žÛç)Î/ÒöÇétn÷à ”¶h‡Ó ÷Xó:7Ã^ºÙ‡’ ïŠ-¸ ˆ·/Výcäu[áú×p™z¢ •¢VÓÉsÅ2l‹—à.Úþ®•dØSÒ!žU[,·Ò&“`UqU™GÈÍ6Ê|x'•|(TZsÀ9 Ùbæ…ÛN¬Ï5ˆ$Ö“Ó!6­Ú¢ íœn§4æ,6ž’z"ƒÒ ñìÚ£ óÜrrQ å@i‰f8ÍpëŠRíçf{å*¼“J/0*‰/ÜãŠðE³Ÿ • âU,†ÖtrÅ" +®yÿbõ com.github.LongSoft.UEFITool com.github.LongSoft.UEFITool.desktop UEFITool UEFI firmware image viewer and editor

UEFITool is a cross-platform open source application, that parses UEFI PI-compatible firmware image into a tree structure, verifies image integrity and provides a GUI to manipulate image elements.

 https://github.com/LongSoft/UEFITool/raw/new_engine/appstream/UEFITool.png https://github.com/LongSoft/UEFITool LongSoft CC0-1.0 BSD-2-Clause UEFITool-A66/common/000077500000000000000000000000001442134156300142715ustar00rootroot00000000000000UEFITool-A66/common/LZMA/000077500000000000000000000000001442134156300150345ustar00rootroot00000000000000UEFITool-A66/common/LZMA/LzmaCompress.c000066400000000000000000000051771442134156300176310ustar00rootroot00000000000000/* LZMA Compress Implementation Copyright (c) 2012, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHWARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "LzmaCompress.h" #include "SDK/C/7zVersion.h" #include "SDK/C/LzmaEnc.h" #include #define LZMA_HEADER_SIZE (LZMA_PROPS_SIZE + 8) static void * AllocForLzma(ISzAllocPtr p, size_t size) { (void)p; return malloc(size); } static void FreeForLzma(ISzAllocPtr p, void *address) { (void)p; free(address); } static ISzAlloc SzAllocForLzma = { &AllocForLzma, &FreeForLzma }; SRes OnProgress(const ICompressProgress *p, UInt64 inSize, UInt64 outSize) { (void)p; (void)inSize; (void)outSize; return SZ_OK; } static ICompressProgress g_ProgressCallback = { &OnProgress }; STATIC UINT64 EFIAPI RShiftU64 ( UINT64 Operand, UINT32 Count ) { return Operand >> Count; } VOID SetEncodedSizeOfBuf( UINT64 EncodedSize, UINT8* EncodedData ) { INT32 Index; EncodedData[LZMA_PROPS_SIZE] = EncodedSize & 0xFF; for (Index = LZMA_PROPS_SIZE + 1; Index <= LZMA_PROPS_SIZE + 7; Index++) { EncodedSize = RShiftU64(EncodedSize, 8); EncodedData[Index] = EncodedSize & 0xFF; } } USTATUS EFIAPI LzmaCompress ( CONST UINT8 *Source, UINT32 SourceSize, UINT8 *Destination, UINT32 *DestinationSize, UINT32 DictionarySize ) { SRes LzmaResult; CLzmaEncProps props; SizeT propsSize = LZMA_PROPS_SIZE; SizeT destLen = SourceSize + SourceSize / 3 + 128; if (*DestinationSize < (UINT32)destLen) { *DestinationSize = (UINT32)destLen; return EFI_BUFFER_TOO_SMALL; } LzmaEncProps_Init(&props); props.dictSize = DictionarySize; props.level = 9; props.fb = 273; LzmaResult = LzmaEncode( (Byte*)((UINT8*)Destination + LZMA_HEADER_SIZE), &destLen, Source, (SizeT)SourceSize, &props, (UINT8*)Destination, &propsSize, props.writeEndMark, &g_ProgressCallback, &SzAllocForLzma, &SzAllocForLzma); *DestinationSize = (UINT32)(destLen + LZMA_HEADER_SIZE); SetEncodedSizeOfBuf(SourceSize, Destination); if (LzmaResult == SZ_OK) { return EFI_SUCCESS; } else { return EFI_INVALID_PARAMETER; } } UEFITool-A66/common/LZMA/LzmaCompress.h000066400000000000000000000020011442134156300176150ustar00rootroot00000000000000/* LZMA Compress Header Copyright (c) 2014, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHWARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef LZMACOMPRESS_H #define LZMACOMPRESS_H #include "SDK/C/7zTypes.h" #include "../basetypes.h" #ifdef __cplusplus extern "C" { #endif #define DEFAULT_LZMA_DICTIONARY_SIZE 0x800000 #define _LZMA_SIZE_OPT USTATUS EFIAPI LzmaCompress ( const UINT8 *Source, UINT32 SourceSize, UINT8 *Destination, UINT32 *DestinationSize, UINT32 DictionarySize ); #ifdef __cplusplus } #endif #endif // LZMACOMPRESS_H UEFITool-A66/common/LZMA/LzmaDecompress.c000066400000000000000000000114521442134156300201330ustar00rootroot00000000000000/* LZMA Decompress Implementation Copyright (c) 2009 - 2010, Intel Corporation. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHWARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "LzmaDecompress.h" #include "SDK/C/7zTypes.h" #include "SDK/C/7zVersion.h" #include UINT64 EFIAPI LShiftU64 ( UINT64 Operand, UINT32 Count ) { return Operand << Count; } static void * AllocForLzma(ISzAllocPtr p, size_t size) { (void)p; return malloc(size); } static void FreeForLzma(ISzAllocPtr p, void *address) { (void)p; free(address); } static ISzAlloc SzAllocForLzma = { &AllocForLzma, &FreeForLzma }; /* Get the size of the uncompressed buffer by parsing EncodeData header. @param EncodedData Pointer to the compressed data. @return The size of the uncompressed buffer. */ UINT64 GetDecodedSizeOfBuf ( UINT8 *EncodedData ) { UINT64 DecodedSize; INT32 Index; // Parse header DecodedSize = 0; for (Index = LZMA_PROPS_SIZE + 7; Index >= LZMA_PROPS_SIZE; Index--) DecodedSize = LShiftU64(DecodedSize, 8) + EncodedData[Index]; return DecodedSize; } // // LZMA functions and data as defined local LzmaDecompressLibInternal.h // /* Given a Lzma compressed source buffer, this function retrieves the size of the uncompressed buffer and the size of the scratch buffer required to decompress the compressed source buffer. Retrieves the size of the uncompressed buffer and the temporary scratch buffer required to decompress the buffer specified by Source and SourceSize. The size of the uncompressed buffer is returned DestinationSize, the size of the scratch buffer is returned ScratchSize, and RETURN_SUCCESS is returned. This function does not have scratch buffer available to perform a thorough checking of the validity of the source data. It just retrieves the "Original Size" field from the LZMA_HEADER_SIZE beginning bytes of the source data and output it as DestinationSize. And ScratchSize is specific to the decompression implementation. If SourceSize is less than LZMA_HEADER_SIZE, then ASSERT(). @param Source The source buffer containing the compressed data. @param SourceSize The size, bytes, of the source buffer. @param DestinationSize A pointer to the size, bytes, of the uncompressed buffer that will be generated when the compressed buffer specified by Source and SourceSize is decompressed. @retval EFI_SUCCESS The size of the uncompressed data was returned DestinationSize and the size of the scratch buffer was returned ScratchSize. */ USTATUS EFIAPI LzmaGetInfo ( CONST VOID *Source, UINT32 SourceSize, UINT32 *DestinationSize ) { UINT64 DecodedSize; ASSERT(SourceSize >= LZMA_HEADER_SIZE); (void)SourceSize; DecodedSize = GetDecodedSizeOfBuf((UINT8*)Source); if (DecodedSize <= UINT32_MAX) { *DestinationSize = (UINT32)DecodedSize; return U_SUCCESS; } else { return U_INVALID_PARAMETER; } } /* Decompresses a Lzma compressed source buffer. Extracts decompressed data to its original form. If the compressed source data specified by Source is successfully decompressed into Destination, then RETURN_SUCCESS is returned. If the compressed source data specified by Source is not a valid compressed data format, then RETURN_INVALID_PARAMETER is returned. @param Source The source buffer containing the compressed data. @param SourceSize The size of source buffer. @param Destination The destination buffer to store the decompressed data @retval EFI_SUCCESS Decompression completed successfully, and the uncompressed buffer is returned Destination. @retval EFI_INVALID_PARAMETER The source buffer specified by Source is corrupted (not a valid compressed format). */ USTATUS EFIAPI LzmaDecompress ( CONST VOID *Source, UINT32 SourceSize, VOID *Destination ) { SRes LzmaResult; ELzmaStatus Status; SizeT DecodedBufSize; SizeT EncodedDataSize; DecodedBufSize = (SizeT)GetDecodedSizeOfBuf((UINT8*)Source); EncodedDataSize = (SizeT)(SourceSize - LZMA_HEADER_SIZE); LzmaResult = LzmaDecode( (Byte*)Destination, &DecodedBufSize, (Byte*)((UINT8*)Source + LZMA_HEADER_SIZE), &EncodedDataSize, (CONST Byte*) Source, LZMA_PROPS_SIZE, LZMA_FINISH_END, &Status, &SzAllocForLzma ); if (LzmaResult == SZ_OK) { return U_SUCCESS; } else { return U_INVALID_PARAMETER; } } UEFITool-A66/common/LZMA/LzmaDecompress.h000066400000000000000000000066441442134156300201470ustar00rootroot00000000000000/* LZMA Decompress Header Copyright (c) 2009 - 2010, Intel Corporation. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHWARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef LZMADECOMPRESS_H #define LZMADECOMPRESS_H #include "../basetypes.h" #include "SDK/C/LzmaDec.h" #include "SDK/C/Bra.h" #ifdef __cplusplus extern "C" { #endif #define LZMA_HEADER_SIZE (LZMA_PROPS_SIZE + 8) /* Given a Lzma compressed source buffer, this function retrieves the size of the uncompressed buffer and the size of the scratch buffer required to decompress the compressed source buffer. Retrieves the size of the uncompressed buffer and the temporary scratch buffer required to decompress the buffer specified by Source and SourceSize. The size of the uncompressed buffer is returned DestinationSize, the size of the scratch buffer is returned ScratchSize, and RETURN_SUCCESS is returned. This function does not have scratch buffer available to perform a thorough checking of the validity of the source data. It just retrieves the "Original Size" field from the LZMA_HEADER_SIZE beginning bytes of the source data and output it as DestinationSize. And ScratchSize is specific to the decompression implementation. If SourceSize is less than LZMA_HEADER_SIZE, then ASSERT(). @param Source The source buffer containing the compressed data. @param SourceSize The size, bytes, of the source buffer. @param DestinationSize A pointer to the size, bytes, of the uncompressed buffer that will be generated when the compressed buffer specified by Source and SourceSize is decompressed. @retval EFI_SUCCESS The size of the uncompressed data was returned DestinationSize and the size of the scratch buffer was returned ScratchSize. */ USTATUS EFIAPI LzmaGetInfo ( CONST VOID *Source, UINT32 SourceSize, UINT32 *DestinationSize ); /* Decompresses a Lzma compressed source buffer. Extracts decompressed data to its original form. If the compressed source data specified by Source is successfully decompressed into Destination, then RETURN_SUCCESS is returned. If the compressed source data specified by Source is not a valid compressed data format, then RETURN_INVALID_PARAMETER is returned. @param Source The source buffer containing the compressed data. @param SourceSize The size of source buffer. @param Destination The destination buffer to store the decompressed data @retval EFI_SUCCESS Decompression completed successfully, and the uncompressed buffer is returned Destination. @retval EFI_INVALID_PARAMETER The source buffer specified by Source is corrupted (not a valid compressed format). */ USTATUS EFIAPI LzmaDecompress ( CONST VOID *Source, UINT32 SourceSize, VOID *Destination ); #ifdef __cplusplus } #endif #endif // LZMADECOMPRESS_H UEFITool-A66/common/LZMA/SDK/000077500000000000000000000000001442134156300154555ustar00rootroot00000000000000UEFITool-A66/common/LZMA/SDK/C/000077500000000000000000000000001442134156300156375ustar00rootroot00000000000000UEFITool-A66/common/LZMA/SDK/C/7zTypes.h000066400000000000000000000327741442134156300174120ustar00rootroot00000000000000/* 7zTypes.h -- Basic types 2022-04-01 : Igor Pavlov : Public domain */ #ifndef __7Z_TYPES_H #define __7Z_TYPES_H #ifdef _WIN32 /* #include */ #else #include #endif #include #ifndef EXTERN_C_BEGIN #ifdef __cplusplus #define EXTERN_C_BEGIN extern "C" { #define EXTERN_C_END } #else #define EXTERN_C_BEGIN #define EXTERN_C_END #endif #endif EXTERN_C_BEGIN #define SZ_OK 0 #define SZ_ERROR_DATA 1 #define SZ_ERROR_MEM 2 #define SZ_ERROR_CRC 3 #define SZ_ERROR_UNSUPPORTED 4 #define SZ_ERROR_PARAM 5 #define SZ_ERROR_INPUT_EOF 6 #define SZ_ERROR_OUTPUT_EOF 7 #define SZ_ERROR_READ 8 #define SZ_ERROR_WRITE 9 #define SZ_ERROR_PROGRESS 10 #define SZ_ERROR_FAIL 11 #define SZ_ERROR_THREAD 12 #define SZ_ERROR_ARCHIVE 16 #define SZ_ERROR_NO_ARCHIVE 17 typedef int SRes; #ifdef _MSC_VER #if _MSC_VER > 1200 #define MY_ALIGN(n) __declspec(align(n)) #else #define MY_ALIGN(n) #endif #else #define MY_ALIGN(n) __attribute__ ((aligned(n))) #endif #ifdef _WIN32 /* typedef DWORD WRes; */ typedef unsigned WRes; #define MY_SRes_HRESULT_FROM_WRes(x) HRESULT_FROM_WIN32(x) // #define MY_HRES_ERROR__INTERNAL_ERROR MY_SRes_HRESULT_FROM_WRes(ERROR_INTERNAL_ERROR) #else // _WIN32 // #define ENV_HAVE_LSTAT typedef int WRes; // (FACILITY_ERRNO = 0x800) is 7zip's FACILITY constant to represent (errno) errors in HRESULT #define MY__FACILITY_ERRNO 0x800 #define MY__FACILITY_WIN32 7 #define MY__FACILITY__WRes MY__FACILITY_ERRNO #define MY_HRESULT_FROM_errno_CONST_ERROR(x) ((HRESULT)( \ ( (HRESULT)(x) & 0x0000FFFF) \ | (MY__FACILITY__WRes << 16) \ | (HRESULT)0x80000000 )) #define MY_SRes_HRESULT_FROM_WRes(x) \ ((HRESULT)(x) <= 0 ? ((HRESULT)(x)) : MY_HRESULT_FROM_errno_CONST_ERROR(x)) // we call macro HRESULT_FROM_WIN32 for system errors (WRes) that are (errno) #define HRESULT_FROM_WIN32(x) MY_SRes_HRESULT_FROM_WRes(x) /* #define ERROR_FILE_NOT_FOUND 2L #define ERROR_ACCESS_DENIED 5L #define ERROR_NO_MORE_FILES 18L #define ERROR_LOCK_VIOLATION 33L #define ERROR_FILE_EXISTS 80L #define ERROR_DISK_FULL 112L #define ERROR_NEGATIVE_SEEK 131L #define ERROR_ALREADY_EXISTS 183L #define ERROR_DIRECTORY 267L #define ERROR_TOO_MANY_POSTS 298L #define ERROR_INTERNAL_ERROR 1359L #define ERROR_INVALID_REPARSE_DATA 4392L #define ERROR_REPARSE_TAG_INVALID 4393L #define ERROR_REPARSE_TAG_MISMATCH 4394L */ // we use errno equivalents for some WIN32 errors: #define ERROR_INVALID_PARAMETER EINVAL #define ERROR_INVALID_FUNCTION EINVAL #define ERROR_ALREADY_EXISTS EEXIST #define ERROR_FILE_EXISTS EEXIST #define ERROR_PATH_NOT_FOUND ENOENT #define ERROR_FILE_NOT_FOUND ENOENT #define ERROR_DISK_FULL ENOSPC // #define ERROR_INVALID_HANDLE EBADF // we use FACILITY_WIN32 for errors that has no errno equivalent // Too many posts were made to a semaphore. #define ERROR_TOO_MANY_POSTS ((HRESULT)0x8007012AL) #define ERROR_INVALID_REPARSE_DATA ((HRESULT)0x80071128L) #define ERROR_REPARSE_TAG_INVALID ((HRESULT)0x80071129L) // if (MY__FACILITY__WRes != FACILITY_WIN32), // we use FACILITY_WIN32 for COM errors: #define E_OUTOFMEMORY ((HRESULT)0x8007000EL) #define E_INVALIDARG ((HRESULT)0x80070057L) #define MY__E_ERROR_NEGATIVE_SEEK ((HRESULT)0x80070083L) /* // we can use FACILITY_ERRNO for some COM errors, that have errno equivalents: #define E_OUTOFMEMORY MY_HRESULT_FROM_errno_CONST_ERROR(ENOMEM) #define E_INVALIDARG MY_HRESULT_FROM_errno_CONST_ERROR(EINVAL) #define MY__E_ERROR_NEGATIVE_SEEK MY_HRESULT_FROM_errno_CONST_ERROR(EINVAL) */ #define TEXT(quote) quote #define FILE_ATTRIBUTE_READONLY 0x0001 #define FILE_ATTRIBUTE_HIDDEN 0x0002 #define FILE_ATTRIBUTE_SYSTEM 0x0004 #define FILE_ATTRIBUTE_DIRECTORY 0x0010 #define FILE_ATTRIBUTE_ARCHIVE 0x0020 #define FILE_ATTRIBUTE_DEVICE 0x0040 #define FILE_ATTRIBUTE_NORMAL 0x0080 #define FILE_ATTRIBUTE_TEMPORARY 0x0100 #define FILE_ATTRIBUTE_SPARSE_FILE 0x0200 #define FILE_ATTRIBUTE_REPARSE_POINT 0x0400 #define FILE_ATTRIBUTE_COMPRESSED 0x0800 #define FILE_ATTRIBUTE_OFFLINE 0x1000 #define FILE_ATTRIBUTE_NOT_CONTENT_INDEXED 0x2000 #define FILE_ATTRIBUTE_ENCRYPTED 0x4000 #define FILE_ATTRIBUTE_UNIX_EXTENSION 0x8000 /* trick for Unix */ #endif #ifndef RINOK #define RINOK(x) { int __result__ = (x); if (__result__ != 0) return __result__; } #endif #ifndef RINOK_WRes #define RINOK_WRes(x) { WRes __result__ = (x); if (__result__ != 0) return __result__; } #endif typedef unsigned char Byte; typedef short Int16; typedef unsigned short UInt16; #ifdef _LZMA_UINT32_IS_ULONG typedef long Int32; typedef unsigned long UInt32; #else typedef int Int32; typedef unsigned int UInt32; #endif #ifndef _WIN32 typedef int INT; typedef Int32 INT32; typedef unsigned int UINT; typedef UInt32 UINT32; typedef INT32 LONG; // LONG, ULONG and DWORD must be 32-bit for _WIN32 compatibility typedef UINT32 ULONG; #undef DWORD typedef UINT32 DWORD; #define VOID void #define HRESULT LONG typedef void *LPVOID; // typedef void VOID; // typedef ULONG_PTR DWORD_PTR, *PDWORD_PTR; // gcc / clang on Unix : sizeof(long==sizeof(void*) in 32 or 64 bits) typedef long INT_PTR; typedef unsigned long UINT_PTR; typedef long LONG_PTR; typedef unsigned long DWORD_PTR; typedef size_t SIZE_T; #endif // _WIN32 #define MY_HRES_ERROR__INTERNAL_ERROR ((HRESULT)0x8007054FL) #ifdef _SZ_NO_INT_64 /* define _SZ_NO_INT_64, if your compiler doesn't support 64-bit integers. NOTES: Some code will work incorrectly in that case! */ typedef long Int64; typedef unsigned long UInt64; #else #if defined(_MSC_VER) || defined(__BORLANDC__) typedef __int64 Int64; typedef unsigned __int64 UInt64; #define UINT64_CONST(n) n #else typedef long long int Int64; typedef unsigned long long int UInt64; #define UINT64_CONST(n) n ## ULL #endif #endif #ifdef _LZMA_NO_SYSTEM_SIZE_T typedef UInt32 SizeT; #else typedef size_t SizeT; #endif typedef int BoolInt; /* typedef BoolInt Bool; */ #define True 1 #define False 0 #ifdef _WIN32 #define MY_STD_CALL __stdcall #else #define MY_STD_CALL #endif #ifdef _MSC_VER #if _MSC_VER >= 1300 #define MY_NO_INLINE __declspec(noinline) #else #define MY_NO_INLINE #endif #define MY_FORCE_INLINE __forceinline #define MY_CDECL __cdecl #define MY_FAST_CALL __fastcall #else // _MSC_VER #if (defined(__GNUC__) && (__GNUC__ >= 4)) \ || (defined(__clang__) && (__clang_major__ >= 4)) \ || defined(__INTEL_COMPILER) \ || defined(__xlC__) #define MY_NO_INLINE __attribute__((noinline)) // #define MY_FORCE_INLINE __attribute__((always_inline)) inline #else #define MY_NO_INLINE #endif #define MY_FORCE_INLINE #define MY_CDECL #if defined(_M_IX86) \ || defined(__i386__) // #define MY_FAST_CALL __attribute__((fastcall)) // #define MY_FAST_CALL __attribute__((cdecl)) #define MY_FAST_CALL #elif defined(MY_CPU_AMD64) // #define MY_FAST_CALL __attribute__((ms_abi)) #define MY_FAST_CALL #else #define MY_FAST_CALL #endif #endif // _MSC_VER /* The following interfaces use first parameter as pointer to structure */ typedef struct IByteIn IByteIn; struct IByteIn { Byte (*Read)(const IByteIn *p); /* reads one byte, returns 0 in case of EOF or error */ }; #define IByteIn_Read(p) (p)->Read(p) typedef struct IByteOut IByteOut; struct IByteOut { void (*Write)(const IByteOut *p, Byte b); }; #define IByteOut_Write(p, b) (p)->Write(p, b) typedef struct ISeqInStream ISeqInStream; struct ISeqInStream { SRes (*Read)(const ISeqInStream *p, void *buf, size_t *size); /* if (input(*size) != 0 && output(*size) == 0) means end_of_stream. (output(*size) < input(*size)) is allowed */ }; #define ISeqInStream_Read(p, buf, size) (p)->Read(p, buf, size) /* it can return SZ_ERROR_INPUT_EOF */ SRes SeqInStream_Read(const ISeqInStream *stream, void *buf, size_t size); SRes SeqInStream_Read2(const ISeqInStream *stream, void *buf, size_t size, SRes errorType); SRes SeqInStream_ReadByte(const ISeqInStream *stream, Byte *buf); typedef struct ISeqOutStream ISeqOutStream; struct ISeqOutStream { size_t (*Write)(const ISeqOutStream *p, const void *buf, size_t size); /* Returns: result - the number of actually written bytes. (result < size) means error */ }; #define ISeqOutStream_Write(p, buf, size) (p)->Write(p, buf, size) typedef enum { SZ_SEEK_SET = 0, SZ_SEEK_CUR = 1, SZ_SEEK_END = 2 } ESzSeek; typedef struct ISeekInStream ISeekInStream; struct ISeekInStream { SRes (*Read)(const ISeekInStream *p, void *buf, size_t *size); /* same as ISeqInStream::Read */ SRes (*Seek)(const ISeekInStream *p, Int64 *pos, ESzSeek origin); }; #define ISeekInStream_Read(p, buf, size) (p)->Read(p, buf, size) #define ISeekInStream_Seek(p, pos, origin) (p)->Seek(p, pos, origin) typedef struct ILookInStream ILookInStream; struct ILookInStream { SRes (*Look)(const ILookInStream *p, const void **buf, size_t *size); /* if (input(*size) != 0 && output(*size) == 0) means end_of_stream. (output(*size) > input(*size)) is not allowed (output(*size) < input(*size)) is allowed */ SRes (*Skip)(const ILookInStream *p, size_t offset); /* offset must be <= output(*size) of Look */ SRes (*Read)(const ILookInStream *p, void *buf, size_t *size); /* reads directly (without buffer). It's same as ISeqInStream::Read */ SRes (*Seek)(const ILookInStream *p, Int64 *pos, ESzSeek origin); }; #define ILookInStream_Look(p, buf, size) (p)->Look(p, buf, size) #define ILookInStream_Skip(p, offset) (p)->Skip(p, offset) #define ILookInStream_Read(p, buf, size) (p)->Read(p, buf, size) #define ILookInStream_Seek(p, pos, origin) (p)->Seek(p, pos, origin) SRes LookInStream_LookRead(const ILookInStream *stream, void *buf, size_t *size); SRes LookInStream_SeekTo(const ILookInStream *stream, UInt64 offset); /* reads via ILookInStream::Read */ SRes LookInStream_Read2(const ILookInStream *stream, void *buf, size_t size, SRes errorType); SRes LookInStream_Read(const ILookInStream *stream, void *buf, size_t size); typedef struct { ILookInStream vt; const ISeekInStream *realStream; size_t pos; size_t size; /* it's data size */ /* the following variables must be set outside */ Byte *buf; size_t bufSize; } CLookToRead2; void LookToRead2_CreateVTable(CLookToRead2 *p, int lookahead); #define LookToRead2_Init(p) { (p)->pos = (p)->size = 0; } typedef struct { ISeqInStream vt; const ILookInStream *realStream; } CSecToLook; void SecToLook_CreateVTable(CSecToLook *p); typedef struct { ISeqInStream vt; const ILookInStream *realStream; } CSecToRead; void SecToRead_CreateVTable(CSecToRead *p); typedef struct ICompressProgress ICompressProgress; struct ICompressProgress { SRes (*Progress)(const ICompressProgress *p, UInt64 inSize, UInt64 outSize); /* Returns: result. (result != SZ_OK) means break. Value (UInt64)(Int64)-1 for size means unknown value. */ }; #define ICompressProgress_Progress(p, inSize, outSize) (p)->Progress(p, inSize, outSize) typedef struct ISzAlloc ISzAlloc; typedef const ISzAlloc * ISzAllocPtr; struct ISzAlloc { void *(*Alloc)(ISzAllocPtr p, size_t size); void (*Free)(ISzAllocPtr p, void *address); /* address can be 0 */ }; #define ISzAlloc_Alloc(p, size) (p)->Alloc(p, size) #define ISzAlloc_Free(p, a) (p)->Free(p, a) /* deprecated */ #define IAlloc_Alloc(p, size) ISzAlloc_Alloc(p, size) #define IAlloc_Free(p, a) ISzAlloc_Free(p, a) #ifndef MY_offsetof #ifdef offsetof #define MY_offsetof(type, m) offsetof(type, m) /* #define MY_offsetof(type, m) FIELD_OFFSET(type, m) */ #else #define MY_offsetof(type, m) ((size_t)&(((type *)0)->m)) #endif #endif #ifndef MY_container_of /* #define MY_container_of(ptr, type, m) container_of(ptr, type, m) #define MY_container_of(ptr, type, m) CONTAINING_RECORD(ptr, type, m) #define MY_container_of(ptr, type, m) ((type *)((char *)(ptr) - offsetof(type, m))) #define MY_container_of(ptr, type, m) (&((type *)0)->m == (ptr), ((type *)(((char *)(ptr)) - MY_offsetof(type, m)))) */ /* GCC shows warning: "perhaps the 'offsetof' macro was used incorrectly" GCC 3.4.4 : classes with constructor GCC 4.8.1 : classes with non-public variable members" */ #define MY_container_of(ptr, type, m) ((type *)(void *)((char *)(void *)(1 ? (ptr) : &((type *)0)->m) - MY_offsetof(type, m))) #endif #define CONTAINER_FROM_VTBL_SIMPLE(ptr, type, m) ((type *)(void *)(ptr)) /* #define CONTAINER_FROM_VTBL(ptr, type, m) CONTAINER_FROM_VTBL_SIMPLE(ptr, type, m) */ #define CONTAINER_FROM_VTBL(ptr, type, m) MY_container_of(ptr, type, m) #define CONTAINER_FROM_VTBL_CLS(ptr, type, m) CONTAINER_FROM_VTBL_SIMPLE(ptr, type, m) /* #define CONTAINER_FROM_VTBL_CLS(ptr, type, m) CONTAINER_FROM_VTBL(ptr, type, m) */ #define MY_memset_0_ARRAY(a) memset((a), 0, sizeof(a)) #ifdef _WIN32 #define CHAR_PATH_SEPARATOR '\\' #define WCHAR_PATH_SEPARATOR L'\\' #define STRING_PATH_SEPARATOR "\\" #define WSTRING_PATH_SEPARATOR L"\\" #else #define CHAR_PATH_SEPARATOR '/' #define WCHAR_PATH_SEPARATOR L'/' #define STRING_PATH_SEPARATOR "/" #define WSTRING_PATH_SEPARATOR L"/" #endif #define k_PropVar_TimePrec_0 0 #define k_PropVar_TimePrec_Unix 1 #define k_PropVar_TimePrec_DOS 2 #define k_PropVar_TimePrec_HighPrec 3 #define k_PropVar_TimePrec_Base 16 #define k_PropVar_TimePrec_100ns (k_PropVar_TimePrec_Base + 7) #define k_PropVar_TimePrec_1ns (k_PropVar_TimePrec_Base + 9) EXTERN_C_END #endif UEFITool-A66/common/LZMA/SDK/C/7zVersion.h000066400000000000000000000013661442134156300177240ustar00rootroot00000000000000#define MY_VER_MAJOR 22 #define MY_VER_MINOR 01 #define MY_VER_BUILD 0 #define MY_VERSION_NUMBERS "22.01" #define MY_VERSION MY_VERSION_NUMBERS #ifdef MY_CPU_NAME #define MY_VERSION_CPU MY_VERSION " (" MY_CPU_NAME ")" #else #define MY_VERSION_CPU MY_VERSION #endif #define MY_DATE "2022-07-15" #undef MY_COPYRIGHT #undef MY_VERSION_COPYRIGHT_DATE #define MY_AUTHOR_NAME "Igor Pavlov" #define MY_COPYRIGHT_PD "Igor Pavlov : Public domain" #define MY_COPYRIGHT_CR "Copyright (c) 1999-2022 Igor Pavlov" #ifdef USE_COPYRIGHT_CR #define MY_COPYRIGHT MY_COPYRIGHT_CR #else #define MY_COPYRIGHT MY_COPYRIGHT_PD #endif #define MY_COPYRIGHT_DATE MY_COPYRIGHT " : " MY_DATE #define MY_VERSION_COPYRIGHT_DATE MY_VERSION_CPU " : " MY_COPYRIGHT " : " MY_DATE UEFITool-A66/common/LZMA/SDK/C/Bra.c000066400000000000000000000100401442134156300165020ustar00rootroot00000000000000/* Bra.c -- Converters for RISC code 2021-02-09 : Igor Pavlov : Public domain */ #include "Precomp.h" #include "CpuArch.h" #include "Bra.h" SizeT ARM_Convert(Byte *data, SizeT size, UInt32 ip, int encoding) { Byte *p; const Byte *lim; size &= ~(size_t)3; ip += 4; p = data; lim = data + size; if (encoding) for (;;) { for (;;) { if (p >= lim) return (SizeT)(p - data); p += 4; if (p[-1] == 0xEB) break; } { UInt32 v = GetUi32(p - 4); v <<= 2; v += ip + (UInt32)(p - data); v >>= 2; v &= 0x00FFFFFF; v |= 0xEB000000; SetUi32(p - 4, v); } } for (;;) { for (;;) { if (p >= lim) return (SizeT)(p - data); p += 4; if (p[-1] == 0xEB) break; } { UInt32 v = GetUi32(p - 4); v <<= 2; v -= ip + (UInt32)(p - data); v >>= 2; v &= 0x00FFFFFF; v |= 0xEB000000; SetUi32(p - 4, v); } } } SizeT ARMT_Convert(Byte *data, SizeT size, UInt32 ip, int encoding) { Byte *p; const Byte *lim; size &= ~(size_t)1; p = data; lim = data + size - 4; if (encoding) for (;;) { UInt32 b1; for (;;) { UInt32 b3; if (p > lim) return (SizeT)(p - data); b1 = p[1]; b3 = p[3]; p += 2; b1 ^= 8; if ((b3 & b1) >= 0xF8) break; } { UInt32 v = ((UInt32)b1 << 19) + (((UInt32)p[1] & 0x7) << 8) + (((UInt32)p[-2] << 11)) + (p[0]); p += 2; { UInt32 cur = (ip + (UInt32)(p - data)) >> 1; v += cur; } p[-4] = (Byte)(v >> 11); p[-3] = (Byte)(0xF0 | ((v >> 19) & 0x7)); p[-2] = (Byte)v; p[-1] = (Byte)(0xF8 | (v >> 8)); } } for (;;) { UInt32 b1; for (;;) { UInt32 b3; if (p > lim) return (SizeT)(p - data); b1 = p[1]; b3 = p[3]; p += 2; b1 ^= 8; if ((b3 & b1) >= 0xF8) break; } { UInt32 v = ((UInt32)b1 << 19) + (((UInt32)p[1] & 0x7) << 8) + (((UInt32)p[-2] << 11)) + (p[0]); p += 2; { UInt32 cur = (ip + (UInt32)(p - data)) >> 1; v -= cur; } /* SetUi16(p - 4, (UInt16)(((v >> 11) & 0x7FF) | 0xF000)); SetUi16(p - 2, (UInt16)(v | 0xF800)); */ p[-4] = (Byte)(v >> 11); p[-3] = (Byte)(0xF0 | ((v >> 19) & 0x7)); p[-2] = (Byte)v; p[-1] = (Byte)(0xF8 | (v >> 8)); } } } SizeT PPC_Convert(Byte *data, SizeT size, UInt32 ip, int encoding) { Byte *p; const Byte *lim; size &= ~(size_t)3; ip -= 4; p = data; lim = data + size; for (;;) { for (;;) { if (p >= lim) return (SizeT)(p - data); p += 4; /* if ((v & 0xFC000003) == 0x48000001) */ if ((p[-4] & 0xFC) == 0x48 && (p[-1] & 3) == 1) break; } { UInt32 v = GetBe32(p - 4); if (encoding) v += ip + (UInt32)(p - data); else v -= ip + (UInt32)(p - data); v &= 0x03FFFFFF; v |= 0x48000000; SetBe32(p - 4, v); } } } SizeT SPARC_Convert(Byte *data, SizeT size, UInt32 ip, int encoding) { Byte *p; const Byte *lim; size &= ~(size_t)3; ip -= 4; p = data; lim = data + size; for (;;) { for (;;) { if (p >= lim) return (SizeT)(p - data); /* v = GetBe32(p); p += 4; m = v + ((UInt32)5 << 29); m ^= (UInt32)7 << 29; m += (UInt32)1 << 22; if ((m & ((UInt32)0x1FF << 23)) == 0) break; */ p += 4; if ((p[-4] == 0x40 && (p[-3] & 0xC0) == 0) || (p[-4] == 0x7F && (p[-3] >= 0xC0))) break; } { UInt32 v = GetBe32(p - 4); v <<= 2; if (encoding) v += ip + (UInt32)(p - data); else v -= ip + (UInt32)(p - data); v &= 0x01FFFFFF; v -= (UInt32)1 << 24; v ^= 0xFF000000; v >>= 2; v |= 0x40000000; SetBe32(p - 4, v); } } } UEFITool-A66/common/LZMA/SDK/C/Bra.h000066400000000000000000000035061442134156300165200ustar00rootroot00000000000000/* Bra.h -- Branch converters for executables 2013-01-18 : Igor Pavlov : Public domain */ #ifndef __BRA_H #define __BRA_H #include "7zTypes.h" EXTERN_C_BEGIN /* These functions convert relative addresses to absolute addresses in CALL instructions to increase the compression ratio. In: data - data buffer size - size of data ip - current virtual Instruction Pinter (IP) value state - state variable for x86 converter encoding - 0 (for decoding), 1 (for encoding) Out: state - state variable for x86 converter Returns: The number of processed bytes. If you call these functions with multiple calls, you must start next call with first byte after block of processed bytes. Type Endian Alignment LookAhead x86 little 1 4 ARMT little 2 2 ARM little 4 0 PPC big 4 0 SPARC big 4 0 IA64 little 16 0 size must be >= Alignment + LookAhead, if it's not last block. If (size < Alignment + LookAhead), converter returns 0. Example: UInt32 ip = 0; for () { ; size must be >= Alignment + LookAhead, if it's not last block SizeT processed = Convert(data, size, ip, 1); data += processed; size -= processed; ip += processed; } */ #define x86_Convert_Init(state) { state = 0; } SizeT x86_Convert(Byte *data, SizeT size, UInt32 ip, UInt32 *state, int encoding); SizeT ARM_Convert(Byte *data, SizeT size, UInt32 ip, int encoding); SizeT ARMT_Convert(Byte *data, SizeT size, UInt32 ip, int encoding); SizeT PPC_Convert(Byte *data, SizeT size, UInt32 ip, int encoding); SizeT SPARC_Convert(Byte *data, SizeT size, UInt32 ip, int encoding); SizeT IA64_Convert(Byte *data, SizeT size, UInt32 ip, int encoding); EXTERN_C_END #endif UEFITool-A66/common/LZMA/SDK/C/Bra86.c000066400000000000000000000032751442134156300166740ustar00rootroot00000000000000/* Bra86.c -- Converter for x86 code (BCJ) 2021-02-09 : Igor Pavlov : Public domain */ #include "Precomp.h" #include "Bra.h" #define Test86MSByte(b) ((((b) + 1) & 0xFE) == 0) SizeT x86_Convert(Byte *data, SizeT size, UInt32 ip, UInt32 *state, int encoding) { SizeT pos = 0; UInt32 mask = *state & 7; if (size < 5) return 0; size -= 4; ip += 5; for (;;) { Byte *p = data + pos; const Byte *limit = data + size; for (; p < limit; p++) if ((*p & 0xFE) == 0xE8) break; { SizeT d = (SizeT)(p - data) - pos; pos = (SizeT)(p - data); if (p >= limit) { *state = (d > 2 ? 0 : mask >> (unsigned)d); return pos; } if (d > 2) mask = 0; else { mask >>= (unsigned)d; if (mask != 0 && (mask > 4 || mask == 3 || Test86MSByte(p[(size_t)(mask >> 1) + 1]))) { mask = (mask >> 1) | 4; pos++; continue; } } } if (Test86MSByte(p[4])) { UInt32 v = ((UInt32)p[4] << 24) | ((UInt32)p[3] << 16) | ((UInt32)p[2] << 8) | ((UInt32)p[1]); UInt32 cur = ip + (UInt32)pos; pos += 5; if (encoding) v += cur; else v -= cur; if (mask != 0) { unsigned sh = (mask & 6) << 2; if (Test86MSByte((Byte)(v >> sh))) { v ^= (((UInt32)0x100 << sh) - 1); if (encoding) v += cur; else v -= cur; } mask = 0; } p[1] = (Byte)v; p[2] = (Byte)(v >> 8); p[3] = (Byte)(v >> 16); p[4] = (Byte)(0 - ((v >> 24) & 1)); } else { mask = (mask >> 1) | 4; pos++; } } } UEFITool-A66/common/LZMA/SDK/C/Compiler.h000066400000000000000000000027751442134156300175750ustar00rootroot00000000000000/* Compiler.h 2021-01-05 : Igor Pavlov : Public domain */ #ifndef __7Z_COMPILER_H #define __7Z_COMPILER_H #ifdef __clang__ #pragma clang diagnostic ignored "-Wunused-private-field" #endif #ifdef _MSC_VER #ifdef UNDER_CE #define RPC_NO_WINDOWS_H /* #pragma warning(disable : 4115) // '_RPC_ASYNC_STATE' : named type definition in parentheses */ #pragma warning(disable : 4201) // nonstandard extension used : nameless struct/union #pragma warning(disable : 4214) // nonstandard extension used : bit field types other than int #endif #if _MSC_VER >= 1300 #pragma warning(disable : 4996) // This function or variable may be unsafe #else #pragma warning(disable : 4511) // copy constructor could not be generated #pragma warning(disable : 4512) // assignment operator could not be generated #pragma warning(disable : 4514) // unreferenced inline function has been removed #pragma warning(disable : 4702) // unreachable code #pragma warning(disable : 4710) // not inlined #pragma warning(disable : 4714) // function marked as __forceinline not inlined #pragma warning(disable : 4786) // identifier was truncated to '255' characters in the debug information #endif #ifdef __clang__ #pragma clang diagnostic ignored "-Wdeprecated-declarations" #pragma clang diagnostic ignored "-Wmicrosoft-exception-spec" // #pragma clang diagnostic ignored "-Wreserved-id-macro" #endif #endif #define UNUSED_VAR(x) (void)x; /* #define UNUSED_VAR(x) x=x; */ #endif UEFITool-A66/common/LZMA/SDK/C/CpuArch.c000066400000000000000000000260401442134156300173320ustar00rootroot00000000000000/* CpuArch.c -- CPU specific code 2021-07-13 : Igor Pavlov : Public domain */ #include "Precomp.h" #include "CpuArch.h" #ifdef MY_CPU_X86_OR_AMD64 #if (defined(_MSC_VER) && !defined(MY_CPU_AMD64)) || defined(__GNUC__) #define USE_ASM #endif #if !defined(USE_ASM) && _MSC_VER >= 1500 #include #endif #if defined(USE_ASM) && !defined(MY_CPU_AMD64) static UInt32 CheckFlag(UInt32 flag) { #ifdef _MSC_VER __asm pushfd; __asm pop EAX; __asm mov EDX, EAX; __asm xor EAX, flag; __asm push EAX; __asm popfd; __asm pushfd; __asm pop EAX; __asm xor EAX, EDX; __asm push EDX; __asm popfd; __asm and flag, EAX; #else __asm__ __volatile__ ( "pushf\n\t" "pop %%EAX\n\t" "movl %%EAX,%%EDX\n\t" "xorl %0,%%EAX\n\t" "push %%EAX\n\t" "popf\n\t" "pushf\n\t" "pop %%EAX\n\t" "xorl %%EDX,%%EAX\n\t" "push %%EDX\n\t" "popf\n\t" "andl %%EAX, %0\n\t": "=c" (flag) : "c" (flag) : "%eax", "%edx"); #endif return flag; } #define CHECK_CPUID_IS_SUPPORTED if (CheckFlag(1 << 18) == 0 || CheckFlag(1 << 21) == 0) return False; #else #define CHECK_CPUID_IS_SUPPORTED #endif #ifndef USE_ASM #ifdef _MSC_VER #if _MSC_VER >= 1600 #define MY__cpuidex __cpuidex #else /* __cpuid (function == 4) requires subfunction number in ECX. MSDN: The __cpuid intrinsic clears the ECX register before calling the cpuid instruction. __cpuid() in new MSVC clears ECX. __cpuid() in old MSVC (14.00) doesn't clear ECX We still can use __cpuid for low (function) values that don't require ECX, but __cpuid() in old MSVC will be incorrect for some function values: (function == 4). So here we use the hack for old MSVC to send (subFunction) in ECX register to cpuid instruction, where ECX value is first parameter for FAST_CALL / NO_INLINE function, So the caller of MY__cpuidex_HACK() sets ECX as subFunction, and old MSVC for __cpuid() doesn't change ECX and cpuid instruction gets (subFunction) value. DON'T remove MY_NO_INLINE and MY_FAST_CALL for MY__cpuidex_HACK() !!! */ static MY_NO_INLINE void MY_FAST_CALL MY__cpuidex_HACK(UInt32 subFunction, int *CPUInfo, UInt32 function) { UNUSED_VAR(subFunction); __cpuid(CPUInfo, function); } #define MY__cpuidex(info, func, func2) MY__cpuidex_HACK(func2, info, func) #pragma message("======== MY__cpuidex_HACK WAS USED ========") #endif #else #define MY__cpuidex(info, func, func2) __cpuid(info, func) #pragma message("======== (INCORRECT ?) cpuid WAS USED ========") #endif #endif void MyCPUID(UInt32 function, UInt32 *a, UInt32 *b, UInt32 *c, UInt32 *d) { #ifdef USE_ASM #ifdef _MSC_VER UInt32 a2, b2, c2, d2; __asm xor EBX, EBX; __asm xor ECX, ECX; __asm xor EDX, EDX; __asm mov EAX, function; __asm cpuid; __asm mov a2, EAX; __asm mov b2, EBX; __asm mov c2, ECX; __asm mov d2, EDX; *a = a2; *b = b2; *c = c2; *d = d2; #else __asm__ __volatile__ ( #if defined(MY_CPU_AMD64) && defined(__PIC__) "mov %%rbx, %%rdi;" "cpuid;" "xchg %%rbx, %%rdi;" : "=a" (*a) , "=D" (*b) , #elif defined(MY_CPU_X86) && defined(__PIC__) "mov %%ebx, %%edi;" "cpuid;" "xchgl %%ebx, %%edi;" : "=a" (*a) , "=D" (*b) , #else "cpuid" : "=a" (*a) , "=b" (*b) , #endif "=c" (*c) , "=d" (*d) : "0" (function), "c"(0) ) ; #endif #else int CPUInfo[4]; MY__cpuidex(CPUInfo, (int)function, 0); *a = (UInt32)CPUInfo[0]; *b = (UInt32)CPUInfo[1]; *c = (UInt32)CPUInfo[2]; *d = (UInt32)CPUInfo[3]; #endif } BoolInt x86cpuid_CheckAndRead(Cx86cpuid *p) { CHECK_CPUID_IS_SUPPORTED MyCPUID(0, &p->maxFunc, &p->vendor[0], &p->vendor[2], &p->vendor[1]); MyCPUID(1, &p->ver, &p->b, &p->c, &p->d); return True; } static const UInt32 kVendors[][3] = { { 0x756E6547, 0x49656E69, 0x6C65746E}, { 0x68747541, 0x69746E65, 0x444D4163}, { 0x746E6543, 0x48727561, 0x736C7561} }; int x86cpuid_GetFirm(const Cx86cpuid *p) { unsigned i; for (i = 0; i < sizeof(kVendors) / sizeof(kVendors[i]); i++) { const UInt32 *v = kVendors[i]; if (v[0] == p->vendor[0] && v[1] == p->vendor[1] && v[2] == p->vendor[2]) return (int)i; } return -1; } BoolInt CPU_Is_InOrder() { Cx86cpuid p; int firm; UInt32 family, model; if (!x86cpuid_CheckAndRead(&p)) return True; family = x86cpuid_GetFamily(p.ver); model = x86cpuid_GetModel(p.ver); firm = x86cpuid_GetFirm(&p); switch (firm) { case CPU_FIRM_INTEL: return (family < 6 || (family == 6 && ( /* In-Order Atom CPU */ model == 0x1C /* 45 nm, N4xx, D4xx, N5xx, D5xx, 230, 330 */ || model == 0x26 /* 45 nm, Z6xx */ || model == 0x27 /* 32 nm, Z2460 */ || model == 0x35 /* 32 nm, Z2760 */ || model == 0x36 /* 32 nm, N2xxx, D2xxx */ ))); case CPU_FIRM_AMD: return (family < 5 || (family == 5 && (model < 6 || model == 0xA))); case CPU_FIRM_VIA: return (family < 6 || (family == 6 && model < 0xF)); } return True; } #if !defined(MY_CPU_AMD64) && defined(_WIN32) #include static BoolInt CPU_Sys_Is_SSE_Supported() { OSVERSIONINFO vi; vi.dwOSVersionInfoSize = sizeof(vi); if (!GetVersionEx(&vi)) return False; return (vi.dwMajorVersion >= 5); } #define CHECK_SYS_SSE_SUPPORT if (!CPU_Sys_Is_SSE_Supported()) return False; #else #define CHECK_SYS_SSE_SUPPORT #endif static UInt32 X86_CPUID_ECX_Get_Flags() { Cx86cpuid p; CHECK_SYS_SSE_SUPPORT if (!x86cpuid_CheckAndRead(&p)) return 0; return p.c; } BoolInt CPU_IsSupported_AES() { return (X86_CPUID_ECX_Get_Flags() >> 25) & 1; } BoolInt CPU_IsSupported_SSSE3() { return (X86_CPUID_ECX_Get_Flags() >> 9) & 1; } BoolInt CPU_IsSupported_SSE41() { return (X86_CPUID_ECX_Get_Flags() >> 19) & 1; } BoolInt CPU_IsSupported_SHA() { Cx86cpuid p; CHECK_SYS_SSE_SUPPORT if (!x86cpuid_CheckAndRead(&p)) return False; if (p.maxFunc < 7) return False; { UInt32 d[4] = { 0 }; MyCPUID(7, &d[0], &d[1], &d[2], &d[3]); return (d[1] >> 29) & 1; } } // #include #ifdef _WIN32 #include #endif BoolInt CPU_IsSupported_AVX2() { Cx86cpuid p; CHECK_SYS_SSE_SUPPORT #ifdef _WIN32 #define MY__PF_XSAVE_ENABLED 17 if (!IsProcessorFeaturePresent(MY__PF_XSAVE_ENABLED)) return False; #endif if (!x86cpuid_CheckAndRead(&p)) return False; if (p.maxFunc < 7) return False; { UInt32 d[4] = { 0 }; MyCPUID(7, &d[0], &d[1], &d[2], &d[3]); // printf("\ncpuid(7): ebx=%8x ecx=%8x\n", d[1], d[2]); return 1 & (d[1] >> 5); // avx2 } } BoolInt CPU_IsSupported_VAES_AVX2() { Cx86cpuid p; CHECK_SYS_SSE_SUPPORT #ifdef _WIN32 #define MY__PF_XSAVE_ENABLED 17 if (!IsProcessorFeaturePresent(MY__PF_XSAVE_ENABLED)) return False; #endif if (!x86cpuid_CheckAndRead(&p)) return False; if (p.maxFunc < 7) return False; { UInt32 d[4] = { 0 }; MyCPUID(7, &d[0], &d[1], &d[2], &d[3]); // printf("\ncpuid(7): ebx=%8x ecx=%8x\n", d[1], d[2]); return 1 & (d[1] >> 5) // avx2 // & (d[1] >> 31) // avx512vl & (d[2] >> 9); // vaes // VEX-256/EVEX } } BoolInt CPU_IsSupported_PageGB() { Cx86cpuid cpuid; if (!x86cpuid_CheckAndRead(&cpuid)) return False; { UInt32 d[4] = { 0 }; MyCPUID(0x80000000, &d[0], &d[1], &d[2], &d[3]); if (d[0] < 0x80000001) return False; } { UInt32 d[4] = { 0 }; MyCPUID(0x80000001, &d[0], &d[1], &d[2], &d[3]); return (d[3] >> 26) & 1; } } #elif defined(MY_CPU_ARM_OR_ARM64) #ifdef _WIN32 #include BoolInt CPU_IsSupported_CRC32() { return IsProcessorFeaturePresent(PF_ARM_V8_CRC32_INSTRUCTIONS_AVAILABLE) ? 1 : 0; } BoolInt CPU_IsSupported_CRYPTO() { return IsProcessorFeaturePresent(PF_ARM_V8_CRYPTO_INSTRUCTIONS_AVAILABLE) ? 1 : 0; } BoolInt CPU_IsSupported_NEON() { return IsProcessorFeaturePresent(PF_ARM_NEON_INSTRUCTIONS_AVAILABLE) ? 1 : 0; } #else #if defined(__APPLE__) /* #include #include static void Print_sysctlbyname(const char *name) { size_t bufSize = 256; char buf[256]; int res = sysctlbyname(name, &buf, &bufSize, NULL, 0); { int i; printf("\nres = %d : %s : '%s' : bufSize = %d, numeric", res, name, buf, (unsigned)bufSize); for (i = 0; i < 20; i++) printf(" %2x", (unsigned)(Byte)buf[i]); } } */ static BoolInt My_sysctlbyname_Get_BoolInt(const char *name) { UInt32 val = 0; if (My_sysctlbyname_Get_UInt32(name, &val) == 0 && val == 1) return 1; return 0; } /* Print_sysctlbyname("hw.pagesize"); Print_sysctlbyname("machdep.cpu.brand_string"); */ BoolInt CPU_IsSupported_CRC32(void) { return My_sysctlbyname_Get_BoolInt("hw.optional.armv8_crc32"); } BoolInt CPU_IsSupported_NEON(void) { return My_sysctlbyname_Get_BoolInt("hw.optional.neon"); } #ifdef MY_CPU_ARM64 #define APPLE_CRYPTO_SUPPORT_VAL 1 #else #define APPLE_CRYPTO_SUPPORT_VAL 0 #endif BoolInt CPU_IsSupported_SHA1(void) { return APPLE_CRYPTO_SUPPORT_VAL; } BoolInt CPU_IsSupported_SHA2(void) { return APPLE_CRYPTO_SUPPORT_VAL; } BoolInt CPU_IsSupported_AES (void) { return APPLE_CRYPTO_SUPPORT_VAL; } #else // __APPLE__ #include #define USE_HWCAP #ifdef USE_HWCAP #ifdef __linux__ #include #endif #ifdef __linux__ #define MY_HWCAP_CHECK_FUNC_2(name1, name2) \ BoolInt CPU_IsSupported_ ## name1() { return (getauxval(AT_HWCAP) & (HWCAP_ ## name2)) ? 1 : 0; } #elif defined(__FreeBSD__) || defined(__OpenBSD__) || defined(__NetBSD__) || defined(__DragonFly__) #define MY_HWCAP_CHECK_FUNC_2(name1, name2) \ BoolInt CPU_IsSupported_ ## name1() { uint32_t hwcaps = 0; elf_aux_info(AT_HWCAP, &hwcaps, sizeof(hwcaps)); return (hwcaps & (HWCAP_ ## name2)) ? 1 : 0; } #endif #ifdef MY_CPU_ARM64 #define MY_HWCAP_CHECK_FUNC(name) \ MY_HWCAP_CHECK_FUNC_2(name, name) MY_HWCAP_CHECK_FUNC_2(NEON, ASIMD) // MY_HWCAP_CHECK_FUNC (ASIMD) #elif defined(MY_CPU_ARM) #ifdef __linux__ #define MY_HWCAP_CHECK_FUNC(name) \ BoolInt CPU_IsSupported_ ## name() { return (getauxval(AT_HWCAP2) & (HWCAP2_ ## name)) ? 1 : 0; } #elif defined(__FreeBSD__) || defined(__OpenBSD__) || defined(__NetBSD__) || defined(__DragonFly__) #define MY_HWCAP_CHECK_FUNC(name) \ BoolInt CPU_IsSupported_ ## name() { uint32_t hwcaps = 0; elf_aux_info(AT_HWCAP2, &hwcaps, sizeof(hwcaps)); return (hwcaps & (HWCAP2_ ## name)) ? 1 : 0; } #endif MY_HWCAP_CHECK_FUNC_2(NEON, NEON) #endif #else // USE_HWCAP #define MY_HWCAP_CHECK_FUNC(name) \ BoolInt CPU_IsSupported_ ## name() { return 0; } MY_HWCAP_CHECK_FUNC(NEON) #endif // USE_HWCAP MY_HWCAP_CHECK_FUNC (CRC32) MY_HWCAP_CHECK_FUNC (SHA1) MY_HWCAP_CHECK_FUNC (SHA2) MY_HWCAP_CHECK_FUNC (AES) #endif // __APPLE__ #endif // _WIN32 #endif // MY_CPU_ARM_OR_ARM64 #ifdef __APPLE__ #include int My_sysctlbyname_Get(const char *name, void *buf, size_t *bufSize) { return sysctlbyname(name, buf, bufSize, NULL, 0); } int My_sysctlbyname_Get_UInt32(const char *name, UInt32 *val) { size_t bufSize = sizeof(*val); int res = My_sysctlbyname_Get(name, val, &bufSize); if (res == 0 && bufSize != sizeof(*val)) return EFAULT; return res; } #endif UEFITool-A66/common/LZMA/SDK/C/CpuArch.h000066400000000000000000000247531442134156300173500ustar00rootroot00000000000000/* CpuArch.h -- CPU specific code 2022-07-15 : Igor Pavlov : Public domain */ #ifndef __CPU_ARCH_H #define __CPU_ARCH_H #include "7zTypes.h" EXTERN_C_BEGIN /* MY_CPU_LE means that CPU is LITTLE ENDIAN. MY_CPU_BE means that CPU is BIG ENDIAN. If MY_CPU_LE and MY_CPU_BE are not defined, we don't know about ENDIANNESS of platform. MY_CPU_LE_UNALIGN means that CPU is LITTLE ENDIAN and CPU supports unaligned memory accesses. MY_CPU_64BIT means that processor can work with 64-bit registers. MY_CPU_64BIT can be used to select fast code branch MY_CPU_64BIT doesn't mean that (sizeof(void *) == 8) */ #if defined(_M_X64) \ || defined(_M_AMD64) \ || defined(__x86_64__) \ || defined(__AMD64__) \ || defined(__amd64__) #define MY_CPU_AMD64 #ifdef __ILP32__ #define MY_CPU_NAME "x32" #define MY_CPU_SIZEOF_POINTER 4 #else #define MY_CPU_NAME "x64" #define MY_CPU_SIZEOF_POINTER 8 #endif #define MY_CPU_64BIT #endif #if defined(_M_IX86) \ || defined(__i386__) #define MY_CPU_X86 #define MY_CPU_NAME "x86" /* #define MY_CPU_32BIT */ #define MY_CPU_SIZEOF_POINTER 4 #endif #if defined(_M_ARM64) \ || defined(__AARCH64EL__) \ || defined(__AARCH64EB__) \ || defined(__aarch64__) #define MY_CPU_ARM64 #define MY_CPU_NAME "arm64" #define MY_CPU_64BIT #endif #if defined(_M_ARM) \ || defined(_M_ARM_NT) \ || defined(_M_ARMT) \ || defined(__arm__) \ || defined(__thumb__) \ || defined(__ARMEL__) \ || defined(__ARMEB__) \ || defined(__THUMBEL__) \ || defined(__THUMBEB__) #define MY_CPU_ARM #if defined(__thumb__) || defined(__THUMBEL__) || defined(_M_ARMT) #define MY_CPU_NAME "armt" #else #define MY_CPU_NAME "arm" #endif /* #define MY_CPU_32BIT */ #define MY_CPU_SIZEOF_POINTER 4 #endif #if defined(_M_IA64) \ || defined(__ia64__) #define MY_CPU_IA64 #define MY_CPU_NAME "ia64" #define MY_CPU_64BIT #endif #if defined(__mips64) \ || defined(__mips64__) \ || (defined(__mips) && (__mips == 64 || __mips == 4 || __mips == 3)) #define MY_CPU_NAME "mips64" #define MY_CPU_64BIT #elif defined(__mips__) #define MY_CPU_NAME "mips" /* #define MY_CPU_32BIT */ #endif #if defined(__ppc64__) \ || defined(__powerpc64__) \ || defined(__ppc__) \ || defined(__powerpc__) \ || defined(__PPC__) \ || defined(_POWER) #if defined(__ppc64__) \ || defined(__powerpc64__) \ || defined(_LP64) \ || defined(__64BIT__) #ifdef __ILP32__ #define MY_CPU_NAME "ppc64-32" #define MY_CPU_SIZEOF_POINTER 4 #else #define MY_CPU_NAME "ppc64" #define MY_CPU_SIZEOF_POINTER 8 #endif #define MY_CPU_64BIT #else #define MY_CPU_NAME "ppc" #define MY_CPU_SIZEOF_POINTER 4 /* #define MY_CPU_32BIT */ #endif #endif #if defined(__riscv) \ || defined(__riscv__) #if __riscv_xlen == 32 #define MY_CPU_NAME "riscv32" #elif __riscv_xlen == 64 #define MY_CPU_NAME "riscv64" #else #define MY_CPU_NAME "riscv" #endif #endif #if defined(MY_CPU_X86) || defined(MY_CPU_AMD64) #define MY_CPU_X86_OR_AMD64 #endif #if defined(MY_CPU_ARM) || defined(MY_CPU_ARM64) #define MY_CPU_ARM_OR_ARM64 #endif #ifdef _WIN32 #ifdef MY_CPU_ARM #define MY_CPU_ARM_LE #endif #ifdef MY_CPU_ARM64 #define MY_CPU_ARM64_LE #endif #ifdef _M_IA64 #define MY_CPU_IA64_LE #endif #endif #if defined(MY_CPU_X86_OR_AMD64) \ || defined(MY_CPU_ARM_LE) \ || defined(MY_CPU_ARM64_LE) \ || defined(MY_CPU_IA64_LE) \ || defined(__LITTLE_ENDIAN__) \ || defined(__ARMEL__) \ || defined(__THUMBEL__) \ || defined(__AARCH64EL__) \ || defined(__MIPSEL__) \ || defined(__MIPSEL) \ || defined(_MIPSEL) \ || defined(__BFIN__) \ || (defined(__BYTE_ORDER__) && (__BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__)) #define MY_CPU_LE #endif #if defined(__BIG_ENDIAN__) \ || defined(__ARMEB__) \ || defined(__THUMBEB__) \ || defined(__AARCH64EB__) \ || defined(__MIPSEB__) \ || defined(__MIPSEB) \ || defined(_MIPSEB) \ || defined(__m68k__) \ || defined(__s390__) \ || defined(__s390x__) \ || defined(__zarch__) \ || (defined(__BYTE_ORDER__) && (__BYTE_ORDER__ == __ORDER_BIG_ENDIAN__)) #define MY_CPU_BE #endif #if defined(MY_CPU_LE) && defined(MY_CPU_BE) #error Stop_Compiling_Bad_Endian #endif #if defined(MY_CPU_32BIT) && defined(MY_CPU_64BIT) #error Stop_Compiling_Bad_32_64_BIT #endif #ifdef __SIZEOF_POINTER__ #ifdef MY_CPU_SIZEOF_POINTER #if MY_CPU_SIZEOF_POINTER != __SIZEOF_POINTER__ #error Stop_Compiling_Bad_MY_CPU_PTR_SIZE #endif #else #define MY_CPU_SIZEOF_POINTER __SIZEOF_POINTER__ #endif #endif #if defined(MY_CPU_SIZEOF_POINTER) && (MY_CPU_SIZEOF_POINTER == 4) #if defined (_LP64) #error Stop_Compiling_Bad_MY_CPU_PTR_SIZE #endif #endif #ifdef _MSC_VER #if _MSC_VER >= 1300 #define MY_CPU_pragma_pack_push_1 __pragma(pack(push, 1)) #define MY_CPU_pragma_pop __pragma(pack(pop)) #else #define MY_CPU_pragma_pack_push_1 #define MY_CPU_pragma_pop #endif #else #ifdef __xlC__ #define MY_CPU_pragma_pack_push_1 _Pragma("pack(1)") #define MY_CPU_pragma_pop _Pragma("pack()") #else #define MY_CPU_pragma_pack_push_1 _Pragma("pack(push, 1)") #define MY_CPU_pragma_pop _Pragma("pack(pop)") #endif #endif #ifndef MY_CPU_NAME #ifdef MY_CPU_LE #define MY_CPU_NAME "LE" #elif defined(MY_CPU_BE) #define MY_CPU_NAME "BE" #else /* #define MY_CPU_NAME "" */ #endif #endif #ifdef MY_CPU_LE #if defined(MY_CPU_X86_OR_AMD64) \ || defined(MY_CPU_ARM64) #define MY_CPU_LE_UNALIGN #define MY_CPU_LE_UNALIGN_64 #elif defined(__ARM_FEATURE_UNALIGNED) /* gcc9 for 32-bit arm can use LDRD instruction that requires 32-bit alignment. So we can't use unaligned 64-bit operations. */ #define MY_CPU_LE_UNALIGN #endif #endif #ifdef MY_CPU_LE_UNALIGN #define GetUi16(p) (*(const UInt16 *)(const void *)(p)) #define GetUi32(p) (*(const UInt32 *)(const void *)(p)) #ifdef MY_CPU_LE_UNALIGN_64 #define GetUi64(p) (*(const UInt64 *)(const void *)(p)) #endif #define SetUi16(p, v) { *(UInt16 *)(void *)(p) = (v); } #define SetUi32(p, v) { *(UInt32 *)(void *)(p) = (v); } #ifdef MY_CPU_LE_UNALIGN_64 #define SetUi64(p, v) { *(UInt64 *)(void *)(p) = (v); } #endif #else #define GetUi16(p) ( (UInt16) ( \ ((const Byte *)(p))[0] | \ ((UInt16)((const Byte *)(p))[1] << 8) )) #define GetUi32(p) ( \ ((const Byte *)(p))[0] | \ ((UInt32)((const Byte *)(p))[1] << 8) | \ ((UInt32)((const Byte *)(p))[2] << 16) | \ ((UInt32)((const Byte *)(p))[3] << 24)) #define SetUi16(p, v) { Byte *_ppp_ = (Byte *)(p); UInt32 _vvv_ = (v); \ _ppp_[0] = (Byte)_vvv_; \ _ppp_[1] = (Byte)(_vvv_ >> 8); } #define SetUi32(p, v) { Byte *_ppp_ = (Byte *)(p); UInt32 _vvv_ = (v); \ _ppp_[0] = (Byte)_vvv_; \ _ppp_[1] = (Byte)(_vvv_ >> 8); \ _ppp_[2] = (Byte)(_vvv_ >> 16); \ _ppp_[3] = (Byte)(_vvv_ >> 24); } #endif #ifndef MY_CPU_LE_UNALIGN_64 #define GetUi64(p) (GetUi32(p) | ((UInt64)GetUi32(((const Byte *)(p)) + 4) << 32)) #define SetUi64(p, v) { Byte *_ppp2_ = (Byte *)(p); UInt64 _vvv2_ = (v); \ SetUi32(_ppp2_ , (UInt32)_vvv2_); \ SetUi32(_ppp2_ + 4, (UInt32)(_vvv2_ >> 32)); } #endif #ifdef __has_builtin #define MY__has_builtin(x) __has_builtin(x) #else #define MY__has_builtin(x) 0 #endif #if defined(MY_CPU_LE_UNALIGN) && /* defined(_WIN64) && */ defined(_MSC_VER) && (_MSC_VER >= 1300) /* Note: we use bswap instruction, that is unsupported in 386 cpu */ #include #pragma intrinsic(_byteswap_ushort) #pragma intrinsic(_byteswap_ulong) #pragma intrinsic(_byteswap_uint64) /* #define GetBe16(p) _byteswap_ushort(*(const UInt16 *)(const Byte *)(p)) */ #define GetBe32(p) _byteswap_ulong (*(const UInt32 *)(const void *)(p)) #define GetBe64(p) _byteswap_uint64(*(const UInt64 *)(const void *)(p)) #define SetBe32(p, v) (*(UInt32 *)(void *)(p)) = _byteswap_ulong(v) #elif defined(MY_CPU_LE_UNALIGN) && ( \ (defined(__GNUC__) && (__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 3))) \ || (defined(__clang__) && MY__has_builtin(__builtin_bswap16)) ) /* #define GetBe16(p) __builtin_bswap16(*(const UInt16 *)(const void *)(p)) */ #define GetBe32(p) __builtin_bswap32(*(const UInt32 *)(const void *)(p)) #define GetBe64(p) __builtin_bswap64(*(const UInt64 *)(const void *)(p)) #define SetBe32(p, v) (*(UInt32 *)(void *)(p)) = __builtin_bswap32(v) #else #define GetBe32(p) ( \ ((UInt32)((const Byte *)(p))[0] << 24) | \ ((UInt32)((const Byte *)(p))[1] << 16) | \ ((UInt32)((const Byte *)(p))[2] << 8) | \ ((const Byte *)(p))[3] ) #define GetBe64(p) (((UInt64)GetBe32(p) << 32) | GetBe32(((const Byte *)(p)) + 4)) #define SetBe32(p, v) { Byte *_ppp_ = (Byte *)(p); UInt32 _vvv_ = (v); \ _ppp_[0] = (Byte)(_vvv_ >> 24); \ _ppp_[1] = (Byte)(_vvv_ >> 16); \ _ppp_[2] = (Byte)(_vvv_ >> 8); \ _ppp_[3] = (Byte)_vvv_; } #endif #ifndef GetBe16 #define GetBe16(p) ( (UInt16) ( \ ((UInt16)((const Byte *)(p))[0] << 8) | \ ((const Byte *)(p))[1] )) #endif #ifdef MY_CPU_X86_OR_AMD64 typedef struct { UInt32 maxFunc; UInt32 vendor[3]; UInt32 ver; UInt32 b; UInt32 c; UInt32 d; } Cx86cpuid; enum { CPU_FIRM_INTEL, CPU_FIRM_AMD, CPU_FIRM_VIA }; void MyCPUID(UInt32 function, UInt32 *a, UInt32 *b, UInt32 *c, UInt32 *d); BoolInt x86cpuid_CheckAndRead(Cx86cpuid *p); int x86cpuid_GetFirm(const Cx86cpuid *p); #define x86cpuid_GetFamily(ver) (((ver >> 16) & 0xFF0) | ((ver >> 8) & 0xF)) #define x86cpuid_GetModel(ver) (((ver >> 12) & 0xF0) | ((ver >> 4) & 0xF)) #define x86cpuid_GetStepping(ver) (ver & 0xF) BoolInt CPU_Is_InOrder(void); BoolInt CPU_IsSupported_AES(void); BoolInt CPU_IsSupported_AVX2(void); BoolInt CPU_IsSupported_VAES_AVX2(void); BoolInt CPU_IsSupported_SSSE3(void); BoolInt CPU_IsSupported_SSE41(void); BoolInt CPU_IsSupported_SHA(void); BoolInt CPU_IsSupported_PageGB(void); #elif defined(MY_CPU_ARM_OR_ARM64) BoolInt CPU_IsSupported_CRC32(void); BoolInt CPU_IsSupported_NEON(void); #if defined(_WIN32) BoolInt CPU_IsSupported_CRYPTO(void); #define CPU_IsSupported_SHA1 CPU_IsSupported_CRYPTO #define CPU_IsSupported_SHA2 CPU_IsSupported_CRYPTO #define CPU_IsSupported_AES CPU_IsSupported_CRYPTO #else BoolInt CPU_IsSupported_SHA1(void); BoolInt CPU_IsSupported_SHA2(void); BoolInt CPU_IsSupported_AES(void); #endif #endif #if defined(__APPLE__) int My_sysctlbyname_Get(const char *name, void *buf, size_t *bufSize); int My_sysctlbyname_Get_UInt32(const char *name, UInt32 *val); #endif EXTERN_C_END #endif UEFITool-A66/common/LZMA/SDK/C/LzFind.c000066400000000000000000001150771442134156300172040ustar00rootroot00000000000000/* LzFind.c -- Match finder for LZ algorithms 2021-11-29 : Igor Pavlov : Public domain */ #include "Precomp.h" #include // #include #include "CpuArch.h" #include "LzFind.h" #include "LzHash.h" #define kBlockMoveAlign (1 << 7) // alignment for memmove() #define kBlockSizeAlign (1 << 16) // alignment for block allocation #define kBlockSizeReserveMin (1 << 24) // it's 1/256 from 4 GB dictinary #define kEmptyHashValue 0 #define kMaxValForNormalize ((UInt32)0) // #define kMaxValForNormalize ((UInt32)(1 << 20) + 0xFFF) // for debug // #define kNormalizeAlign (1 << 7) // alignment for speculated accesses #define GET_AVAIL_BYTES(p) \ Inline_MatchFinder_GetNumAvailableBytes(p) // #define kFix5HashSize (kHash2Size + kHash3Size + kHash4Size) #define kFix5HashSize kFix4HashSize /* HASH2_CALC: if (hv) match, then cur[0] and cur[1] also match */ #define HASH2_CALC hv = GetUi16(cur); // (crc[0 ... 255] & 0xFF) provides one-to-one correspondence to [0 ... 255] /* HASH3_CALC: if (cur[0]) and (h2) match, then cur[1] also match if (cur[0]) and (hv) match, then cur[1] and cur[2] also match */ #define HASH3_CALC { \ UInt32 temp = p->crc[cur[0]] ^ cur[1]; \ h2 = temp & (kHash2Size - 1); \ hv = (temp ^ ((UInt32)cur[2] << 8)) & p->hashMask; } #define HASH4_CALC { \ UInt32 temp = p->crc[cur[0]] ^ cur[1]; \ h2 = temp & (kHash2Size - 1); \ temp ^= ((UInt32)cur[2] << 8); \ h3 = temp & (kHash3Size - 1); \ hv = (temp ^ (p->crc[cur[3]] << kLzHash_CrcShift_1)) & p->hashMask; } #define HASH5_CALC { \ UInt32 temp = p->crc[cur[0]] ^ cur[1]; \ h2 = temp & (kHash2Size - 1); \ temp ^= ((UInt32)cur[2] << 8); \ h3 = temp & (kHash3Size - 1); \ temp ^= (p->crc[cur[3]] << kLzHash_CrcShift_1); \ /* h4 = temp & p->hash4Mask; */ /* (kHash4Size - 1); */ \ hv = (temp ^ (p->crc[cur[4]] << kLzHash_CrcShift_2)) & p->hashMask; } #define HASH_ZIP_CALC hv = ((cur[2] | ((UInt32)cur[0] << 8)) ^ p->crc[cur[1]]) & 0xFFFF; static void LzInWindow_Free(CMatchFinder *p, ISzAllocPtr alloc) { if (!p->directInput) { ISzAlloc_Free(alloc, p->bufferBase); p->bufferBase = NULL; } } static int LzInWindow_Create2(CMatchFinder *p, UInt32 blockSize, ISzAllocPtr alloc) { if (blockSize == 0) return 0; if (!p->bufferBase || p->blockSize != blockSize) { // size_t blockSizeT; LzInWindow_Free(p, alloc); p->blockSize = blockSize; // blockSizeT = blockSize; // printf("\nblockSize = 0x%x\n", blockSize); /* #if defined _WIN64 // we can allocate 4GiB, but still use UInt32 for (p->blockSize) // we use UInt32 type for (p->blockSize), because // we don't want to wrap over 4 GiB, // when we use (p->streamPos - p->pos) that is UInt32. if (blockSize >= (UInt32)0 - (UInt32)kBlockSizeAlign) { blockSizeT = ((size_t)1 << 32); printf("\nchanged to blockSizeT = 4GiB\n"); } #endif */ p->bufferBase = (Byte *)ISzAlloc_Alloc(alloc, blockSize); // printf("\nbufferBase = %p\n", p->bufferBase); // return 0; // for debug } return (p->bufferBase != NULL); } static const Byte *MatchFinder_GetPointerToCurrentPos(CMatchFinder *p) { return p->buffer; } static UInt32 MatchFinder_GetNumAvailableBytes(CMatchFinder *p) { return GET_AVAIL_BYTES(p); } MY_NO_INLINE static void MatchFinder_ReadBlock(CMatchFinder *p) { if (p->streamEndWasReached || p->result != SZ_OK) return; /* We use (p->streamPos - p->pos) value. (p->streamPos < p->pos) is allowed. */ if (p->directInput) { UInt32 curSize = 0xFFFFFFFF - GET_AVAIL_BYTES(p); if (curSize > p->directInputRem) curSize = (UInt32)p->directInputRem; p->directInputRem -= curSize; p->streamPos += curSize; if (p->directInputRem == 0) p->streamEndWasReached = 1; return; } for (;;) { Byte *dest = p->buffer + GET_AVAIL_BYTES(p); size_t size = (size_t)(p->bufferBase + p->blockSize - dest); if (size == 0) { /* we call ReadBlock() after NeedMove() and MoveBlock(). NeedMove() and MoveBlock() povide more than (keepSizeAfter) to the end of (blockSize). So we don't execute this branch in normal code flow. We can go here, if we will call ReadBlock() before NeedMove(), MoveBlock(). */ // p->result = SZ_ERROR_FAIL; // we can show error here return; } // #define kRead 3 // if (size > kRead) size = kRead; // for debug p->result = ISeqInStream_Read(p->stream, dest, &size); if (p->result != SZ_OK) return; if (size == 0) { p->streamEndWasReached = 1; return; } p->streamPos += (UInt32)size; if (GET_AVAIL_BYTES(p) > p->keepSizeAfter) return; /* here and in another (p->keepSizeAfter) checks we keep on 1 byte more than was requested by Create() function (GET_AVAIL_BYTES(p) >= p->keepSizeAfter) - minimal required size */ } // on exit: (p->result != SZ_OK || p->streamEndWasReached || GET_AVAIL_BYTES(p) > p->keepSizeAfter) } MY_NO_INLINE void MatchFinder_MoveBlock(CMatchFinder *p) { const size_t offset = (size_t)(p->buffer - p->bufferBase) - p->keepSizeBefore; const size_t keepBefore = (offset & (kBlockMoveAlign - 1)) + p->keepSizeBefore; p->buffer = p->bufferBase + keepBefore; memmove(p->bufferBase, p->bufferBase + (offset & ~((size_t)kBlockMoveAlign - 1)), keepBefore + (size_t)GET_AVAIL_BYTES(p)); } /* We call MoveBlock() before ReadBlock(). So MoveBlock() can be wasteful operation, if the whole input data can fit in current block even without calling MoveBlock(). in important case where (dataSize <= historySize) condition (p->blockSize > dataSize + p->keepSizeAfter) is met So there is no MoveBlock() in that case case. */ int MatchFinder_NeedMove(CMatchFinder *p) { if (p->directInput) return 0; if (p->streamEndWasReached || p->result != SZ_OK) return 0; return ((size_t)(p->bufferBase + p->blockSize - p->buffer) <= p->keepSizeAfter); } void MatchFinder_ReadIfRequired(CMatchFinder *p) { if (p->keepSizeAfter >= GET_AVAIL_BYTES(p)) MatchFinder_ReadBlock(p); } static void MatchFinder_SetDefaultSettings(CMatchFinder *p) { p->cutValue = 32; p->btMode = 1; p->numHashBytes = 4; p->bigHash = 0; } #define kCrcPoly 0xEDB88320 void MatchFinder_Construct(CMatchFinder *p) { unsigned i; p->bufferBase = NULL; p->directInput = 0; p->hash = NULL; p->expectedDataSize = (UInt64)(Int64)-1; MatchFinder_SetDefaultSettings(p); for (i = 0; i < 256; i++) { UInt32 r = (UInt32)i; unsigned j; for (j = 0; j < 8; j++) r = (r >> 1) ^ (kCrcPoly & ((UInt32)0 - (r & 1))); p->crc[i] = r; } } static void MatchFinder_FreeThisClassMemory(CMatchFinder *p, ISzAllocPtr alloc) { ISzAlloc_Free(alloc, p->hash); p->hash = NULL; } void MatchFinder_Free(CMatchFinder *p, ISzAllocPtr alloc) { MatchFinder_FreeThisClassMemory(p, alloc); LzInWindow_Free(p, alloc); } static CLzRef* AllocRefs(size_t num, ISzAllocPtr alloc) { size_t sizeInBytes = (size_t)num * sizeof(CLzRef); if (sizeInBytes / sizeof(CLzRef) != num) return NULL; return (CLzRef *)ISzAlloc_Alloc(alloc, sizeInBytes); } #if (kBlockSizeReserveMin < kBlockSizeAlign * 2) #error Stop_Compiling_Bad_Reserve #endif static UInt32 GetBlockSize(CMatchFinder *p, UInt32 historySize) { UInt32 blockSize = (p->keepSizeBefore + p->keepSizeAfter); /* if (historySize > kMaxHistorySize) return 0; */ // printf("\nhistorySize == 0x%x\n", historySize); if (p->keepSizeBefore < historySize || blockSize < p->keepSizeBefore) // if 32-bit overflow return 0; { const UInt32 kBlockSizeMax = (UInt32)0 - (UInt32)kBlockSizeAlign; const UInt32 rem = kBlockSizeMax - blockSize; const UInt32 reserve = (blockSize >> (blockSize < ((UInt32)1 << 30) ? 1 : 2)) + (1 << 12) + kBlockMoveAlign + kBlockSizeAlign; // do not overflow 32-bit here if (blockSize >= kBlockSizeMax || rem < kBlockSizeReserveMin) // we reject settings that will be slow return 0; if (reserve >= rem) blockSize = kBlockSizeMax; else { blockSize += reserve; blockSize &= ~(UInt32)(kBlockSizeAlign - 1); } } // printf("\n LzFind_blockSize = %x\n", blockSize); // printf("\n LzFind_blockSize = %d\n", blockSize >> 20); return blockSize; } int MatchFinder_Create(CMatchFinder *p, UInt32 historySize, UInt32 keepAddBufferBefore, UInt32 matchMaxLen, UInt32 keepAddBufferAfter, ISzAllocPtr alloc) { /* we need one additional byte in (p->keepSizeBefore), since we use MoveBlock() after (p->pos++) and before dictionary using */ // keepAddBufferBefore = (UInt32)0xFFFFFFFF - (1 << 22); // for debug p->keepSizeBefore = historySize + keepAddBufferBefore + 1; keepAddBufferAfter += matchMaxLen; /* we need (p->keepSizeAfter >= p->numHashBytes) */ if (keepAddBufferAfter < p->numHashBytes) keepAddBufferAfter = p->numHashBytes; // keepAddBufferAfter -= 2; // for debug p->keepSizeAfter = keepAddBufferAfter; if (p->directInput) p->blockSize = 0; if (p->directInput || LzInWindow_Create2(p, GetBlockSize(p, historySize), alloc)) { const UInt32 newCyclicBufferSize = historySize + 1; // do not change it UInt32 hs; p->matchMaxLen = matchMaxLen; { // UInt32 hs4; p->fixedHashSize = 0; hs = (1 << 16) - 1; if (p->numHashBytes != 2) { hs = historySize; if (hs > p->expectedDataSize) hs = (UInt32)p->expectedDataSize; if (hs != 0) hs--; hs |= (hs >> 1); hs |= (hs >> 2); hs |= (hs >> 4); hs |= (hs >> 8); // we propagated 16 bits in (hs). Low 16 bits must be set later hs >>= 1; if (hs >= (1 << 24)) { if (p->numHashBytes == 3) hs = (1 << 24) - 1; else hs >>= 1; /* if (bigHash) mode, GetHeads4b() in LzFindMt.c needs (hs >= ((1 << 24) - 1))) */ } // hs = ((UInt32)1 << 25) - 1; // for test // (hash_size >= (1 << 16)) : Required for (numHashBytes > 2) hs |= (1 << 16) - 1; /* don't change it! */ // bt5: we adjust the size with recommended minimum size if (p->numHashBytes >= 5) hs |= (256 << kLzHash_CrcShift_2) - 1; } p->hashMask = hs; hs++; /* hs4 = (1 << 20); if (hs4 > hs) hs4 = hs; // hs4 = (1 << 16); // for test p->hash4Mask = hs4 - 1; */ if (p->numHashBytes > 2) p->fixedHashSize += kHash2Size; if (p->numHashBytes > 3) p->fixedHashSize += kHash3Size; // if (p->numHashBytes > 4) p->fixedHashSize += hs4; // kHash4Size; hs += p->fixedHashSize; } { size_t newSize; size_t numSons; p->historySize = historySize; p->hashSizeSum = hs; p->cyclicBufferSize = newCyclicBufferSize; // it must be = (historySize + 1) numSons = newCyclicBufferSize; if (p->btMode) numSons <<= 1; newSize = hs + numSons; // aligned size is not required here, but it can be better for some loops #define NUM_REFS_ALIGN_MASK 0xF newSize = (newSize + NUM_REFS_ALIGN_MASK) & ~(size_t)NUM_REFS_ALIGN_MASK; if (p->hash && p->numRefs == newSize) return 1; MatchFinder_FreeThisClassMemory(p, alloc); p->numRefs = newSize; p->hash = AllocRefs(newSize, alloc); if (p->hash) { p->son = p->hash + p->hashSizeSum; return 1; } } } MatchFinder_Free(p, alloc); return 0; } static void MatchFinder_SetLimits(CMatchFinder *p) { UInt32 k; UInt32 n = kMaxValForNormalize - p->pos; if (n == 0) n = (UInt32)(Int32)-1; // we allow (pos == 0) at start even with (kMaxValForNormalize == 0) k = p->cyclicBufferSize - p->cyclicBufferPos; if (k < n) n = k; k = GET_AVAIL_BYTES(p); { const UInt32 ksa = p->keepSizeAfter; UInt32 mm = p->matchMaxLen; if (k > ksa) k -= ksa; // we must limit exactly to keepSizeAfter for ReadBlock else if (k >= mm) { // the limitation for (p->lenLimit) update k -= mm; // optimization : to reduce the number of checks k++; // k = 1; // non-optimized version : for debug } else { mm = k; if (k != 0) k = 1; } p->lenLimit = mm; } if (k < n) n = k; p->posLimit = p->pos + n; } void MatchFinder_Init_LowHash(CMatchFinder *p) { size_t i; CLzRef *items = p->hash; const size_t numItems = p->fixedHashSize; for (i = 0; i < numItems; i++) items[i] = kEmptyHashValue; } void MatchFinder_Init_HighHash(CMatchFinder *p) { size_t i; CLzRef *items = p->hash + p->fixedHashSize; const size_t numItems = (size_t)p->hashMask + 1; for (i = 0; i < numItems; i++) items[i] = kEmptyHashValue; } void MatchFinder_Init_4(CMatchFinder *p) { p->buffer = p->bufferBase; { /* kEmptyHashValue = 0 (Zero) is used in hash tables as NO-VALUE marker. the code in CMatchFinderMt expects (pos = 1) */ p->pos = p->streamPos = 1; // it's smallest optimal value. do not change it // 0; // for debug } p->result = SZ_OK; p->streamEndWasReached = 0; } // (CYC_TO_POS_OFFSET == 0) is expected by some optimized code #define CYC_TO_POS_OFFSET 0 // #define CYC_TO_POS_OFFSET 1 // for debug void MatchFinder_Init(CMatchFinder *p) { MatchFinder_Init_HighHash(p); MatchFinder_Init_LowHash(p); MatchFinder_Init_4(p); // if (readData) MatchFinder_ReadBlock(p); /* if we init (cyclicBufferPos = pos), then we can use one variable instead of both (cyclicBufferPos) and (pos) : only before (cyclicBufferPos) wrapping */ p->cyclicBufferPos = (p->pos - CYC_TO_POS_OFFSET); // init with relation to (pos) // p->cyclicBufferPos = 0; // smallest value // p->son[0] = p->son[1] = 0; // unused: we can init skipped record for speculated accesses. MatchFinder_SetLimits(p); } #ifdef MY_CPU_X86_OR_AMD64 #if defined(__clang__) && (__clang_major__ >= 8) \ || defined(__GNUC__) && (__GNUC__ >= 8) \ || defined(__INTEL_COMPILER) && (__INTEL_COMPILER >= 1900) #define USE_SATUR_SUB_128 #define USE_AVX2 #define ATTRIB_SSE41 __attribute__((__target__("sse4.1"))) #define ATTRIB_AVX2 __attribute__((__target__("avx2"))) #elif defined(_MSC_VER) #if (_MSC_VER >= 1600) #define USE_SATUR_SUB_128 #if (_MSC_VER >= 1900) #define USE_AVX2 #include // avx #endif #endif #endif // #elif defined(MY_CPU_ARM_OR_ARM64) #elif defined(MY_CPU_ARM64) #if defined(__clang__) && (__clang_major__ >= 8) \ || defined(__GNUC__) && (__GNUC__ >= 8) #define USE_SATUR_SUB_128 #ifdef MY_CPU_ARM64 // #define ATTRIB_SSE41 __attribute__((__target__(""))) #else // #define ATTRIB_SSE41 __attribute__((__target__("fpu=crypto-neon-fp-armv8"))) #endif #elif defined(_MSC_VER) #if (_MSC_VER >= 1910) #define USE_SATUR_SUB_128 #endif #endif #if defined(_MSC_VER) && defined(MY_CPU_ARM64) #include #else #include #endif #endif /* #ifndef ATTRIB_SSE41 #define ATTRIB_SSE41 #endif #ifndef ATTRIB_AVX2 #define ATTRIB_AVX2 #endif */ #ifdef USE_SATUR_SUB_128 // #define _SHOW_HW_STATUS #ifdef _SHOW_HW_STATUS #include #define _PRF(x) x _PRF(;) #else #define _PRF(x) #endif #ifdef MY_CPU_ARM_OR_ARM64 #ifdef MY_CPU_ARM64 // #define FORCE_SATUR_SUB_128 #endif typedef uint32x4_t v128; #define SASUB_128(i) \ *(v128 *)(void *)(items + (i) * 4) = \ vsubq_u32(vmaxq_u32(*(const v128 *)(const void *)(items + (i) * 4), sub2), sub2); #else #include // sse4.1 typedef __m128i v128; #define SASUB_128(i) \ *(v128 *)(void *)(items + (i) * 4) = \ _mm_sub_epi32(_mm_max_epu32(*(const v128 *)(const void *)(items + (i) * 4), sub2), sub2); // SSE 4.1 #endif MY_NO_INLINE static #ifdef ATTRIB_SSE41 ATTRIB_SSE41 #endif void MY_FAST_CALL LzFind_SaturSub_128(UInt32 subValue, CLzRef *items, const CLzRef *lim) { v128 sub2 = #ifdef MY_CPU_ARM_OR_ARM64 vdupq_n_u32(subValue); #else _mm_set_epi32((Int32)subValue, (Int32)subValue, (Int32)subValue, (Int32)subValue); #endif do { SASUB_128(0) SASUB_128(1) SASUB_128(2) SASUB_128(3) items += 4 * 4; } while (items != lim); } #ifdef USE_AVX2 #include // avx #define SASUB_256(i) *(__m256i *)(void *)(items + (i) * 8) = _mm256_sub_epi32(_mm256_max_epu32(*(const __m256i *)(const void *)(items + (i) * 8), sub2), sub2); // AVX2 MY_NO_INLINE static #ifdef ATTRIB_AVX2 ATTRIB_AVX2 #endif void MY_FAST_CALL LzFind_SaturSub_256(UInt32 subValue, CLzRef *items, const CLzRef *lim) { __m256i sub2 = _mm256_set_epi32( (Int32)subValue, (Int32)subValue, (Int32)subValue, (Int32)subValue, (Int32)subValue, (Int32)subValue, (Int32)subValue, (Int32)subValue); do { SASUB_256(0) SASUB_256(1) items += 2 * 8; } while (items != lim); } #endif // USE_AVX2 #ifndef FORCE_SATUR_SUB_128 typedef void (MY_FAST_CALL *LZFIND_SATUR_SUB_CODE_FUNC)( UInt32 subValue, CLzRef *items, const CLzRef *lim); static LZFIND_SATUR_SUB_CODE_FUNC g_LzFind_SaturSub; #endif // FORCE_SATUR_SUB_128 #endif // USE_SATUR_SUB_128 // kEmptyHashValue must be zero // #define SASUB_32(i) v = items[i]; m = v - subValue; if (v < subValue) m = kEmptyHashValue; items[i] = m; #define SASUB_32(i) v = items[i]; if (v < subValue) v = subValue; items[i] = v - subValue; #ifdef FORCE_SATUR_SUB_128 #define DEFAULT_SaturSub LzFind_SaturSub_128 #else #define DEFAULT_SaturSub LzFind_SaturSub_32 MY_NO_INLINE static void MY_FAST_CALL LzFind_SaturSub_32(UInt32 subValue, CLzRef *items, const CLzRef *lim) { do { UInt32 v; SASUB_32(0) SASUB_32(1) SASUB_32(2) SASUB_32(3) SASUB_32(4) SASUB_32(5) SASUB_32(6) SASUB_32(7) items += 8; } while (items != lim); } #endif MY_NO_INLINE void MatchFinder_Normalize3(UInt32 subValue, CLzRef *items, size_t numItems) { #define K_NORM_ALIGN_BLOCK_SIZE (1 << 6) CLzRef *lim; for (; numItems != 0 && ((unsigned)(ptrdiff_t)items & (K_NORM_ALIGN_BLOCK_SIZE - 1)) != 0; numItems--) { UInt32 v; SASUB_32(0); items++; } { #define K_NORM_ALIGN_MASK (K_NORM_ALIGN_BLOCK_SIZE / 4 - 1) lim = items + (numItems & ~(size_t)K_NORM_ALIGN_MASK); numItems &= K_NORM_ALIGN_MASK; if (items != lim) { #if defined(USE_SATUR_SUB_128) && !defined(FORCE_SATUR_SUB_128) if (g_LzFind_SaturSub) g_LzFind_SaturSub(subValue, items, lim); else #endif DEFAULT_SaturSub(subValue, items, lim); } items = lim; } for (; numItems != 0; numItems--) { UInt32 v; SASUB_32(0); items++; } } // call MatchFinder_CheckLimits() only after (p->pos++) update MY_NO_INLINE static void MatchFinder_CheckLimits(CMatchFinder *p) { if (// !p->streamEndWasReached && p->result == SZ_OK && p->keepSizeAfter == GET_AVAIL_BYTES(p)) { // we try to read only in exact state (p->keepSizeAfter == GET_AVAIL_BYTES(p)) if (MatchFinder_NeedMove(p)) MatchFinder_MoveBlock(p); MatchFinder_ReadBlock(p); } if (p->pos == kMaxValForNormalize) if (GET_AVAIL_BYTES(p) >= p->numHashBytes) // optional optimization for last bytes of data. /* if we disable normalization for last bytes of data, and if (data_size == 4 GiB), we don't call wastfull normalization, but (pos) will be wrapped over Zero (0) in that case. And we cannot resume later to normal operation */ { // MatchFinder_Normalize(p); /* after normalization we need (p->pos >= p->historySize + 1); */ /* we can reduce subValue to aligned value, if want to keep alignment of (p->pos) and (p->buffer) for speculated accesses. */ const UInt32 subValue = (p->pos - p->historySize - 1) /* & ~(UInt32)(kNormalizeAlign - 1) */; // const UInt32 subValue = (1 << 15); // for debug // printf("\nMatchFinder_Normalize() subValue == 0x%x\n", subValue); size_t numSonRefs = p->cyclicBufferSize; if (p->btMode) numSonRefs <<= 1; Inline_MatchFinder_ReduceOffsets(p, subValue); MatchFinder_Normalize3(subValue, p->hash, (size_t)p->hashSizeSum + numSonRefs); } if (p->cyclicBufferPos == p->cyclicBufferSize) p->cyclicBufferPos = 0; MatchFinder_SetLimits(p); } /* (lenLimit > maxLen) */ MY_FORCE_INLINE static UInt32 * Hc_GetMatchesSpec(size_t lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son, size_t _cyclicBufferPos, UInt32 _cyclicBufferSize, UInt32 cutValue, UInt32 *d, unsigned maxLen) { /* son[_cyclicBufferPos] = curMatch; for (;;) { UInt32 delta = pos - curMatch; if (cutValue-- == 0 || delta >= _cyclicBufferSize) return d; { const Byte *pb = cur - delta; curMatch = son[_cyclicBufferPos - delta + ((delta > _cyclicBufferPos) ? _cyclicBufferSize : 0)]; if (pb[maxLen] == cur[maxLen] && *pb == *cur) { UInt32 len = 0; while (++len != lenLimit) if (pb[len] != cur[len]) break; if (maxLen < len) { maxLen = len; *d++ = len; *d++ = delta - 1; if (len == lenLimit) return d; } } } } */ const Byte *lim = cur + lenLimit; son[_cyclicBufferPos] = curMatch; do { UInt32 delta; if (curMatch == 0) break; // if (curMatch2 >= curMatch) return NULL; delta = pos - curMatch; if (delta >= _cyclicBufferSize) break; { ptrdiff_t diff; curMatch = son[_cyclicBufferPos - delta + ((delta > _cyclicBufferPos) ? _cyclicBufferSize : 0)]; diff = (ptrdiff_t)0 - (ptrdiff_t)delta; if (cur[maxLen] == cur[(ptrdiff_t)maxLen + diff]) { const Byte *c = cur; while (*c == c[diff]) { if (++c == lim) { d[0] = (UInt32)(lim - cur); d[1] = delta - 1; return d + 2; } } { const unsigned len = (unsigned)(c - cur); if (maxLen < len) { maxLen = len; d[0] = (UInt32)len; d[1] = delta - 1; d += 2; } } } } } while (--cutValue); return d; } MY_FORCE_INLINE UInt32 * GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son, size_t _cyclicBufferPos, UInt32 _cyclicBufferSize, UInt32 cutValue, UInt32 *d, UInt32 maxLen) { CLzRef *ptr0 = son + ((size_t)_cyclicBufferPos << 1) + 1; CLzRef *ptr1 = son + ((size_t)_cyclicBufferPos << 1); unsigned len0 = 0, len1 = 0; UInt32 cmCheck; // if (curMatch >= pos) { *ptr0 = *ptr1 = kEmptyHashValue; return NULL; } cmCheck = (UInt32)(pos - _cyclicBufferSize); if ((UInt32)pos <= _cyclicBufferSize) cmCheck = 0; if (cmCheck < curMatch) do { const UInt32 delta = pos - curMatch; { CLzRef *pair = son + ((size_t)(_cyclicBufferPos - delta + ((delta > _cyclicBufferPos) ? _cyclicBufferSize : 0)) << 1); const Byte *pb = cur - delta; unsigned len = (len0 < len1 ? len0 : len1); const UInt32 pair0 = pair[0]; if (pb[len] == cur[len]) { if (++len != lenLimit && pb[len] == cur[len]) while (++len != lenLimit) if (pb[len] != cur[len]) break; if (maxLen < len) { maxLen = (UInt32)len; *d++ = (UInt32)len; *d++ = delta - 1; if (len == lenLimit) { *ptr1 = pair0; *ptr0 = pair[1]; return d; } } } if (pb[len] < cur[len]) { *ptr1 = curMatch; // const UInt32 curMatch2 = pair[1]; // if (curMatch2 >= curMatch) { *ptr0 = *ptr1 = kEmptyHashValue; return NULL; } // curMatch = curMatch2; curMatch = pair[1]; ptr1 = pair + 1; len1 = len; } else { *ptr0 = curMatch; curMatch = pair[0]; ptr0 = pair; len0 = len; } } } while(--cutValue && cmCheck < curMatch); *ptr0 = *ptr1 = kEmptyHashValue; return d; } static void SkipMatchesSpec(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son, size_t _cyclicBufferPos, UInt32 _cyclicBufferSize, UInt32 cutValue) { CLzRef *ptr0 = son + ((size_t)_cyclicBufferPos << 1) + 1; CLzRef *ptr1 = son + ((size_t)_cyclicBufferPos << 1); unsigned len0 = 0, len1 = 0; UInt32 cmCheck; cmCheck = (UInt32)(pos - _cyclicBufferSize); if ((UInt32)pos <= _cyclicBufferSize) cmCheck = 0; if (// curMatch >= pos || // failure cmCheck < curMatch) do { const UInt32 delta = pos - curMatch; { CLzRef *pair = son + ((size_t)(_cyclicBufferPos - delta + ((delta > _cyclicBufferPos) ? _cyclicBufferSize : 0)) << 1); const Byte *pb = cur - delta; unsigned len = (len0 < len1 ? len0 : len1); if (pb[len] == cur[len]) { while (++len != lenLimit) if (pb[len] != cur[len]) break; { if (len == lenLimit) { *ptr1 = pair[0]; *ptr0 = pair[1]; return; } } } if (pb[len] < cur[len]) { *ptr1 = curMatch; curMatch = pair[1]; ptr1 = pair + 1; len1 = len; } else { *ptr0 = curMatch; curMatch = pair[0]; ptr0 = pair; len0 = len; } } } while(--cutValue && cmCheck < curMatch); *ptr0 = *ptr1 = kEmptyHashValue; return; } #define MOVE_POS \ ++p->cyclicBufferPos; \ p->buffer++; \ { const UInt32 pos1 = p->pos + 1; p->pos = pos1; if (pos1 == p->posLimit) MatchFinder_CheckLimits(p); } #define MOVE_POS_RET MOVE_POS return distances; MY_NO_INLINE static void MatchFinder_MovePos(CMatchFinder *p) { /* we go here at the end of stream data, when (avail < num_hash_bytes) We don't update sons[cyclicBufferPos << btMode]. So (sons) record will contain junk. And we cannot resume match searching to normal operation, even if we will provide more input data in buffer. p->sons[p->cyclicBufferPos << p->btMode] = 0; // kEmptyHashValue if (p->btMode) p->sons[(p->cyclicBufferPos << p->btMode) + 1] = 0; // kEmptyHashValue */ MOVE_POS; } #define GET_MATCHES_HEADER2(minLen, ret_op) \ unsigned lenLimit; UInt32 hv; Byte *cur; UInt32 curMatch; \ lenLimit = (unsigned)p->lenLimit; { if (lenLimit < minLen) { MatchFinder_MovePos(p); ret_op; }} \ cur = p->buffer; #define GET_MATCHES_HEADER(minLen) GET_MATCHES_HEADER2(minLen, return distances) #define SKIP_HEADER(minLen) do { GET_MATCHES_HEADER2(minLen, continue) #define MF_PARAMS(p) lenLimit, curMatch, p->pos, p->buffer, p->son, p->cyclicBufferPos, p->cyclicBufferSize, p->cutValue #define SKIP_FOOTER SkipMatchesSpec(MF_PARAMS(p)); MOVE_POS; } while (--num); #define GET_MATCHES_FOOTER_BASE(_maxLen_, func) \ distances = func(MF_PARAMS(p), \ distances, (UInt32)_maxLen_); MOVE_POS_RET; #define GET_MATCHES_FOOTER_BT(_maxLen_) \ GET_MATCHES_FOOTER_BASE(_maxLen_, GetMatchesSpec1) #define GET_MATCHES_FOOTER_HC(_maxLen_) \ GET_MATCHES_FOOTER_BASE(_maxLen_, Hc_GetMatchesSpec) #define UPDATE_maxLen { \ const ptrdiff_t diff = (ptrdiff_t)0 - (ptrdiff_t)d2; \ const Byte *c = cur + maxLen; \ const Byte *lim = cur + lenLimit; \ for (; c != lim; c++) if (*(c + diff) != *c) break; \ maxLen = (unsigned)(c - cur); } static UInt32* Bt2_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) { GET_MATCHES_HEADER(2) HASH2_CALC; curMatch = p->hash[hv]; p->hash[hv] = p->pos; GET_MATCHES_FOOTER_BT(1) } UInt32* Bt3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) { GET_MATCHES_HEADER(3) HASH_ZIP_CALC; curMatch = p->hash[hv]; p->hash[hv] = p->pos; GET_MATCHES_FOOTER_BT(2) } #define SET_mmm \ mmm = p->cyclicBufferSize; \ if (pos < mmm) \ mmm = pos; static UInt32* Bt3_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) { UInt32 mmm; UInt32 h2, d2, pos; unsigned maxLen; UInt32 *hash; GET_MATCHES_HEADER(3) HASH3_CALC; hash = p->hash; pos = p->pos; d2 = pos - hash[h2]; curMatch = (hash + kFix3HashSize)[hv]; hash[h2] = pos; (hash + kFix3HashSize)[hv] = pos; SET_mmm maxLen = 2; if (d2 < mmm && *(cur - d2) == *cur) { UPDATE_maxLen distances[0] = (UInt32)maxLen; distances[1] = d2 - 1; distances += 2; if (maxLen == lenLimit) { SkipMatchesSpec(MF_PARAMS(p)); MOVE_POS_RET; } } GET_MATCHES_FOOTER_BT(maxLen) } static UInt32* Bt4_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) { UInt32 mmm; UInt32 h2, h3, d2, d3, pos; unsigned maxLen; UInt32 *hash; GET_MATCHES_HEADER(4) HASH4_CALC; hash = p->hash; pos = p->pos; d2 = pos - hash [h2]; d3 = pos - (hash + kFix3HashSize)[h3]; curMatch = (hash + kFix4HashSize)[hv]; hash [h2] = pos; (hash + kFix3HashSize)[h3] = pos; (hash + kFix4HashSize)[hv] = pos; SET_mmm maxLen = 3; for (;;) { if (d2 < mmm && *(cur - d2) == *cur) { distances[0] = 2; distances[1] = d2 - 1; distances += 2; if (*(cur - d2 + 2) == cur[2]) { // distances[-2] = 3; } else if (d3 < mmm && *(cur - d3) == *cur) { d2 = d3; distances[1] = d3 - 1; distances += 2; } else break; } else if (d3 < mmm && *(cur - d3) == *cur) { d2 = d3; distances[1] = d3 - 1; distances += 2; } else break; UPDATE_maxLen distances[-2] = (UInt32)maxLen; if (maxLen == lenLimit) { SkipMatchesSpec(MF_PARAMS(p)); MOVE_POS_RET } break; } GET_MATCHES_FOOTER_BT(maxLen) } static UInt32* Bt5_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) { UInt32 mmm; UInt32 h2, h3, d2, d3, maxLen, pos; UInt32 *hash; GET_MATCHES_HEADER(5) HASH5_CALC; hash = p->hash; pos = p->pos; d2 = pos - hash [h2]; d3 = pos - (hash + kFix3HashSize)[h3]; // d4 = pos - (hash + kFix4HashSize)[h4]; curMatch = (hash + kFix5HashSize)[hv]; hash [h2] = pos; (hash + kFix3HashSize)[h3] = pos; // (hash + kFix4HashSize)[h4] = pos; (hash + kFix5HashSize)[hv] = pos; SET_mmm maxLen = 4; for (;;) { if (d2 < mmm && *(cur - d2) == *cur) { distances[0] = 2; distances[1] = d2 - 1; distances += 2; if (*(cur - d2 + 2) == cur[2]) { } else if (d3 < mmm && *(cur - d3) == *cur) { distances[1] = d3 - 1; distances += 2; d2 = d3; } else break; } else if (d3 < mmm && *(cur - d3) == *cur) { distances[1] = d3 - 1; distances += 2; d2 = d3; } else break; distances[-2] = 3; if (*(cur - d2 + 3) != cur[3]) break; UPDATE_maxLen distances[-2] = (UInt32)maxLen; if (maxLen == lenLimit) { SkipMatchesSpec(MF_PARAMS(p)); MOVE_POS_RET; } break; } GET_MATCHES_FOOTER_BT(maxLen) } static UInt32* Hc4_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) { UInt32 mmm; UInt32 h2, h3, d2, d3, pos; unsigned maxLen; UInt32 *hash; GET_MATCHES_HEADER(4) HASH4_CALC; hash = p->hash; pos = p->pos; d2 = pos - hash [h2]; d3 = pos - (hash + kFix3HashSize)[h3]; curMatch = (hash + kFix4HashSize)[hv]; hash [h2] = pos; (hash + kFix3HashSize)[h3] = pos; (hash + kFix4HashSize)[hv] = pos; SET_mmm maxLen = 3; for (;;) { if (d2 < mmm && *(cur - d2) == *cur) { distances[0] = 2; distances[1] = d2 - 1; distances += 2; if (*(cur - d2 + 2) == cur[2]) { // distances[-2] = 3; } else if (d3 < mmm && *(cur - d3) == *cur) { d2 = d3; distances[1] = d3 - 1; distances += 2; } else break; } else if (d3 < mmm && *(cur - d3) == *cur) { d2 = d3; distances[1] = d3 - 1; distances += 2; } else break; UPDATE_maxLen distances[-2] = (UInt32)maxLen; if (maxLen == lenLimit) { p->son[p->cyclicBufferPos] = curMatch; MOVE_POS_RET; } break; } GET_MATCHES_FOOTER_HC(maxLen); } static UInt32 * Hc5_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) { UInt32 mmm; UInt32 h2, h3, d2, d3, maxLen, pos; UInt32 *hash; GET_MATCHES_HEADER(5) HASH5_CALC; hash = p->hash; pos = p->pos; d2 = pos - hash [h2]; d3 = pos - (hash + kFix3HashSize)[h3]; // d4 = pos - (hash + kFix4HashSize)[h4]; curMatch = (hash + kFix5HashSize)[hv]; hash [h2] = pos; (hash + kFix3HashSize)[h3] = pos; // (hash + kFix4HashSize)[h4] = pos; (hash + kFix5HashSize)[hv] = pos; SET_mmm maxLen = 4; for (;;) { if (d2 < mmm && *(cur - d2) == *cur) { distances[0] = 2; distances[1] = d2 - 1; distances += 2; if (*(cur - d2 + 2) == cur[2]) { } else if (d3 < mmm && *(cur - d3) == *cur) { distances[1] = d3 - 1; distances += 2; d2 = d3; } else break; } else if (d3 < mmm && *(cur - d3) == *cur) { distances[1] = d3 - 1; distances += 2; d2 = d3; } else break; distances[-2] = 3; if (*(cur - d2 + 3) != cur[3]) break; UPDATE_maxLen distances[-2] = maxLen; if (maxLen == lenLimit) { p->son[p->cyclicBufferPos] = curMatch; MOVE_POS_RET; } break; } GET_MATCHES_FOOTER_HC(maxLen); } UInt32* Hc3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) { GET_MATCHES_HEADER(3) HASH_ZIP_CALC; curMatch = p->hash[hv]; p->hash[hv] = p->pos; GET_MATCHES_FOOTER_HC(2) } static void Bt2_MatchFinder_Skip(CMatchFinder *p, UInt32 num) { SKIP_HEADER(2) { HASH2_CALC; curMatch = p->hash[hv]; p->hash[hv] = p->pos; } SKIP_FOOTER } void Bt3Zip_MatchFinder_Skip(CMatchFinder *p, UInt32 num) { SKIP_HEADER(3) { HASH_ZIP_CALC; curMatch = p->hash[hv]; p->hash[hv] = p->pos; } SKIP_FOOTER } static void Bt3_MatchFinder_Skip(CMatchFinder *p, UInt32 num) { SKIP_HEADER(3) { UInt32 h2; UInt32 *hash; HASH3_CALC; hash = p->hash; curMatch = (hash + kFix3HashSize)[hv]; hash[h2] = (hash + kFix3HashSize)[hv] = p->pos; } SKIP_FOOTER } static void Bt4_MatchFinder_Skip(CMatchFinder *p, UInt32 num) { SKIP_HEADER(4) { UInt32 h2, h3; UInt32 *hash; HASH4_CALC; hash = p->hash; curMatch = (hash + kFix4HashSize)[hv]; hash [h2] = (hash + kFix3HashSize)[h3] = (hash + kFix4HashSize)[hv] = p->pos; } SKIP_FOOTER } static void Bt5_MatchFinder_Skip(CMatchFinder *p, UInt32 num) { SKIP_HEADER(5) { UInt32 h2, h3; UInt32 *hash; HASH5_CALC; hash = p->hash; curMatch = (hash + kFix5HashSize)[hv]; hash [h2] = (hash + kFix3HashSize)[h3] = // (hash + kFix4HashSize)[h4] = (hash + kFix5HashSize)[hv] = p->pos; } SKIP_FOOTER } #define HC_SKIP_HEADER(minLen) \ do { if (p->lenLimit < minLen) { MatchFinder_MovePos(p); num--; continue; } { \ Byte *cur; \ UInt32 *hash; \ UInt32 *son; \ UInt32 pos = p->pos; \ UInt32 num2 = num; \ /* (p->pos == p->posLimit) is not allowed here !!! */ \ { const UInt32 rem = p->posLimit - pos; if (num2 > rem) num2 = rem; } \ num -= num2; \ { const UInt32 cycPos = p->cyclicBufferPos; \ son = p->son + cycPos; \ p->cyclicBufferPos = cycPos + num2; } \ cur = p->buffer; \ hash = p->hash; \ do { \ UInt32 curMatch; \ UInt32 hv; #define HC_SKIP_FOOTER \ cur++; pos++; *son++ = curMatch; \ } while (--num2); \ p->buffer = cur; \ p->pos = pos; \ if (pos == p->posLimit) MatchFinder_CheckLimits(p); \ }} while(num); \ static void Hc4_MatchFinder_Skip(CMatchFinder *p, UInt32 num) { HC_SKIP_HEADER(4) UInt32 h2, h3; HASH4_CALC; curMatch = (hash + kFix4HashSize)[hv]; hash [h2] = (hash + kFix3HashSize)[h3] = (hash + kFix4HashSize)[hv] = pos; HC_SKIP_FOOTER } static void Hc5_MatchFinder_Skip(CMatchFinder *p, UInt32 num) { HC_SKIP_HEADER(5) UInt32 h2, h3; HASH5_CALC curMatch = (hash + kFix5HashSize)[hv]; hash [h2] = (hash + kFix3HashSize)[h3] = // (hash + kFix4HashSize)[h4] = (hash + kFix5HashSize)[hv] = pos; HC_SKIP_FOOTER } void Hc3Zip_MatchFinder_Skip(CMatchFinder *p, UInt32 num) { HC_SKIP_HEADER(3) HASH_ZIP_CALC; curMatch = hash[hv]; hash[hv] = pos; HC_SKIP_FOOTER } void MatchFinder_CreateVTable(CMatchFinder *p, IMatchFinder2 *vTable) { vTable->Init = (Mf_Init_Func)MatchFinder_Init; vTable->GetNumAvailableBytes = (Mf_GetNumAvailableBytes_Func)MatchFinder_GetNumAvailableBytes; vTable->GetPointerToCurrentPos = (Mf_GetPointerToCurrentPos_Func)MatchFinder_GetPointerToCurrentPos; if (!p->btMode) { if (p->numHashBytes <= 4) { vTable->GetMatches = (Mf_GetMatches_Func)Hc4_MatchFinder_GetMatches; vTable->Skip = (Mf_Skip_Func)Hc4_MatchFinder_Skip; } else { vTable->GetMatches = (Mf_GetMatches_Func)Hc5_MatchFinder_GetMatches; vTable->Skip = (Mf_Skip_Func)Hc5_MatchFinder_Skip; } } else if (p->numHashBytes == 2) { vTable->GetMatches = (Mf_GetMatches_Func)Bt2_MatchFinder_GetMatches; vTable->Skip = (Mf_Skip_Func)Bt2_MatchFinder_Skip; } else if (p->numHashBytes == 3) { vTable->GetMatches = (Mf_GetMatches_Func)Bt3_MatchFinder_GetMatches; vTable->Skip = (Mf_Skip_Func)Bt3_MatchFinder_Skip; } else if (p->numHashBytes == 4) { vTable->GetMatches = (Mf_GetMatches_Func)Bt4_MatchFinder_GetMatches; vTable->Skip = (Mf_Skip_Func)Bt4_MatchFinder_Skip; } else { vTable->GetMatches = (Mf_GetMatches_Func)Bt5_MatchFinder_GetMatches; vTable->Skip = (Mf_Skip_Func)Bt5_MatchFinder_Skip; } } void LzFindPrepare() { #ifndef FORCE_SATUR_SUB_128 #ifdef USE_SATUR_SUB_128 LZFIND_SATUR_SUB_CODE_FUNC f = NULL; #ifdef MY_CPU_ARM_OR_ARM64 { if (CPU_IsSupported_NEON()) { // #pragma message ("=== LzFind NEON") _PRF(printf("\n=== LzFind NEON\n")); f = LzFind_SaturSub_128; } // f = 0; // for debug } #else // MY_CPU_ARM_OR_ARM64 if (CPU_IsSupported_SSE41()) { // #pragma message ("=== LzFind SSE41") _PRF(printf("\n=== LzFind SSE41\n")); f = LzFind_SaturSub_128; #ifdef USE_AVX2 if (CPU_IsSupported_AVX2()) { // #pragma message ("=== LzFind AVX2") _PRF(printf("\n=== LzFind AVX2\n")); f = LzFind_SaturSub_256; } #endif } #endif // MY_CPU_ARM_OR_ARM64 g_LzFind_SaturSub = f; #endif // USE_SATUR_SUB_128 #endif // FORCE_SATUR_SUB_128 } UEFITool-A66/common/LZMA/SDK/C/LzFind.h000066400000000000000000000073471442134156300172110ustar00rootroot00000000000000/* LzFind.h -- Match finder for LZ algorithms 2021-07-13 : Igor Pavlov : Public domain */ #ifndef __LZ_FIND_H #define __LZ_FIND_H #include "7zTypes.h" EXTERN_C_BEGIN typedef UInt32 CLzRef; typedef struct _CMatchFinder { Byte *buffer; UInt32 pos; UInt32 posLimit; UInt32 streamPos; /* wrap over Zero is allowed (streamPos < pos). Use (UInt32)(streamPos - pos) */ UInt32 lenLimit; UInt32 cyclicBufferPos; UInt32 cyclicBufferSize; /* it must be = (historySize + 1) */ Byte streamEndWasReached; Byte btMode; Byte bigHash; Byte directInput; UInt32 matchMaxLen; CLzRef *hash; CLzRef *son; UInt32 hashMask; UInt32 cutValue; Byte *bufferBase; ISeqInStream *stream; UInt32 blockSize; UInt32 keepSizeBefore; UInt32 keepSizeAfter; UInt32 numHashBytes; size_t directInputRem; UInt32 historySize; UInt32 fixedHashSize; UInt32 hashSizeSum; SRes result; UInt32 crc[256]; size_t numRefs; UInt64 expectedDataSize; } CMatchFinder; #define Inline_MatchFinder_GetPointerToCurrentPos(p) ((const Byte *)(p)->buffer) #define Inline_MatchFinder_GetNumAvailableBytes(p) ((UInt32)((p)->streamPos - (p)->pos)) /* #define Inline_MatchFinder_IsFinishedOK(p) \ ((p)->streamEndWasReached \ && (p)->streamPos == (p)->pos \ && (!(p)->directInput || (p)->directInputRem == 0)) */ int MatchFinder_NeedMove(CMatchFinder *p); /* Byte *MatchFinder_GetPointerToCurrentPos(CMatchFinder *p); */ void MatchFinder_MoveBlock(CMatchFinder *p); void MatchFinder_ReadIfRequired(CMatchFinder *p); void MatchFinder_Construct(CMatchFinder *p); /* Conditions: historySize <= 3 GB keepAddBufferBefore + matchMaxLen + keepAddBufferAfter < 511MB */ int MatchFinder_Create(CMatchFinder *p, UInt32 historySize, UInt32 keepAddBufferBefore, UInt32 matchMaxLen, UInt32 keepAddBufferAfter, ISzAllocPtr alloc); void MatchFinder_Free(CMatchFinder *p, ISzAllocPtr alloc); void MatchFinder_Normalize3(UInt32 subValue, CLzRef *items, size_t numItems); // void MatchFinder_ReduceOffsets(CMatchFinder *p, UInt32 subValue); /* #define Inline_MatchFinder_InitPos(p, val) \ (p)->pos = (val); \ (p)->streamPos = (val); */ #define Inline_MatchFinder_ReduceOffsets(p, subValue) \ (p)->pos -= (subValue); \ (p)->streamPos -= (subValue); UInt32 * GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *buffer, CLzRef *son, size_t _cyclicBufferPos, UInt32 _cyclicBufferSize, UInt32 _cutValue, UInt32 *distances, UInt32 maxLen); /* Conditions: Mf_GetNumAvailableBytes_Func must be called before each Mf_GetMatchLen_Func. Mf_GetPointerToCurrentPos_Func's result must be used only before any other function */ typedef void (*Mf_Init_Func)(void *object); typedef UInt32 (*Mf_GetNumAvailableBytes_Func)(void *object); typedef const Byte * (*Mf_GetPointerToCurrentPos_Func)(void *object); typedef UInt32 * (*Mf_GetMatches_Func)(void *object, UInt32 *distances); typedef void (*Mf_Skip_Func)(void *object, UInt32); typedef struct _IMatchFinder { Mf_Init_Func Init; Mf_GetNumAvailableBytes_Func GetNumAvailableBytes; Mf_GetPointerToCurrentPos_Func GetPointerToCurrentPos; Mf_GetMatches_Func GetMatches; Mf_Skip_Func Skip; } IMatchFinder2; void MatchFinder_CreateVTable(CMatchFinder *p, IMatchFinder2 *vTable); void MatchFinder_Init_LowHash(CMatchFinder *p); void MatchFinder_Init_HighHash(CMatchFinder *p); void MatchFinder_Init_4(CMatchFinder *p); void MatchFinder_Init(CMatchFinder *p); UInt32* Bt3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances); UInt32* Hc3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances); void Bt3Zip_MatchFinder_Skip(CMatchFinder *p, UInt32 num); void Hc3Zip_MatchFinder_Skip(CMatchFinder *p, UInt32 num); void LzFindPrepare(void); EXTERN_C_END #endif UEFITool-A66/common/LZMA/SDK/C/LzHash.h000066400000000000000000000015011442134156300171760ustar00rootroot00000000000000/* LzHash.h -- HASH functions for LZ algorithms 2019-10-30 : Igor Pavlov : Public domain */ #ifndef __LZ_HASH_H #define __LZ_HASH_H /* (kHash2Size >= (1 << 8)) : Required (kHash3Size >= (1 << 16)) : Required */ #define kHash2Size (1 << 10) #define kHash3Size (1 << 16) // #define kHash4Size (1 << 20) #define kFix3HashSize (kHash2Size) #define kFix4HashSize (kHash2Size + kHash3Size) // #define kFix5HashSize (kHash2Size + kHash3Size + kHash4Size) /* We use up to 3 crc values for hash: crc0 crc1 << Shift_1 crc2 << Shift_2 (Shift_1 = 5) and (Shift_2 = 10) is good tradeoff. Small values for Shift are not good for collision rate. Big value for Shift_2 increases the minimum size of hash table, that will be slow for small files. */ #define kLzHash_CrcShift_1 5 #define kLzHash_CrcShift_2 10 #endif UEFITool-A66/common/LZMA/SDK/C/LzmaDec.c000066400000000000000000001124351442134156300173300ustar00rootroot00000000000000/* LzmaDec.c -- LZMA Decoder 2021-04-01 : Igor Pavlov : Public domain */ #include "Precomp.h" #include /* #include "CpuArch.h" */ #include "LzmaDec.h" #define kNumTopBits 24 #define kTopValue ((UInt32)1 << kNumTopBits) #define kNumBitModelTotalBits 11 #define kBitModelTotal (1 << kNumBitModelTotalBits) #define RC_INIT_SIZE 5 #ifndef _LZMA_DEC_OPT #define kNumMoveBits 5 #define NORMALIZE if (range < kTopValue) { range <<= 8; code = (code << 8) | (*buf++); } #define IF_BIT_0(p) ttt = *(p); NORMALIZE; bound = (range >> kNumBitModelTotalBits) * (UInt32)ttt; if (code < bound) #define UPDATE_0(p) range = bound; *(p) = (CLzmaProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits)); #define UPDATE_1(p) range -= bound; code -= bound; *(p) = (CLzmaProb)(ttt - (ttt >> kNumMoveBits)); #define GET_BIT2(p, i, A0, A1) IF_BIT_0(p) \ { UPDATE_0(p); i = (i + i); A0; } else \ { UPDATE_1(p); i = (i + i) + 1; A1; } #define TREE_GET_BIT(probs, i) { GET_BIT2(probs + i, i, ;, ;); } #define REV_BIT(p, i, A0, A1) IF_BIT_0(p + i) \ { UPDATE_0(p + i); A0; } else \ { UPDATE_1(p + i); A1; } #define REV_BIT_VAR( p, i, m) REV_BIT(p, i, i += m; m += m, m += m; i += m; ) #define REV_BIT_CONST(p, i, m) REV_BIT(p, i, i += m; , i += m * 2; ) #define REV_BIT_LAST( p, i, m) REV_BIT(p, i, i -= m , ; ) #define TREE_DECODE(probs, limit, i) \ { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; } /* #define _LZMA_SIZE_OPT */ #ifdef _LZMA_SIZE_OPT #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i) #else #define TREE_6_DECODE(probs, i) \ { i = 1; \ TREE_GET_BIT(probs, i); \ TREE_GET_BIT(probs, i); \ TREE_GET_BIT(probs, i); \ TREE_GET_BIT(probs, i); \ TREE_GET_BIT(probs, i); \ TREE_GET_BIT(probs, i); \ i -= 0x40; } #endif #define NORMAL_LITER_DEC TREE_GET_BIT(prob, symbol) #define MATCHED_LITER_DEC \ matchByte += matchByte; \ bit = offs; \ offs &= matchByte; \ probLit = prob + (offs + bit + symbol); \ GET_BIT2(probLit, symbol, offs ^= bit; , ;) #endif // _LZMA_DEC_OPT #define NORMALIZE_CHECK if (range < kTopValue) { if (buf >= bufLimit) return DUMMY_INPUT_EOF; range <<= 8; code = (code << 8) | (*buf++); } #define IF_BIT_0_CHECK(p) ttt = *(p); NORMALIZE_CHECK; bound = (range >> kNumBitModelTotalBits) * (UInt32)ttt; if (code < bound) #define UPDATE_0_CHECK range = bound; #define UPDATE_1_CHECK range -= bound; code -= bound; #define GET_BIT2_CHECK(p, i, A0, A1) IF_BIT_0_CHECK(p) \ { UPDATE_0_CHECK; i = (i + i); A0; } else \ { UPDATE_1_CHECK; i = (i + i) + 1; A1; } #define GET_BIT_CHECK(p, i) GET_BIT2_CHECK(p, i, ; , ;) #define TREE_DECODE_CHECK(probs, limit, i) \ { i = 1; do { GET_BIT_CHECK(probs + i, i) } while (i < limit); i -= limit; } #define REV_BIT_CHECK(p, i, m) IF_BIT_0_CHECK(p + i) \ { UPDATE_0_CHECK; i += m; m += m; } else \ { UPDATE_1_CHECK; m += m; i += m; } #define kNumPosBitsMax 4 #define kNumPosStatesMax (1 << kNumPosBitsMax) #define kLenNumLowBits 3 #define kLenNumLowSymbols (1 << kLenNumLowBits) #define kLenNumHighBits 8 #define kLenNumHighSymbols (1 << kLenNumHighBits) #define LenLow 0 #define LenHigh (LenLow + 2 * (kNumPosStatesMax << kLenNumLowBits)) #define kNumLenProbs (LenHigh + kLenNumHighSymbols) #define LenChoice LenLow #define LenChoice2 (LenLow + (1 << kLenNumLowBits)) #define kNumStates 12 #define kNumStates2 16 #define kNumLitStates 7 #define kStartPosModelIndex 4 #define kEndPosModelIndex 14 #define kNumFullDistances (1 << (kEndPosModelIndex >> 1)) #define kNumPosSlotBits 6 #define kNumLenToPosStates 4 #define kNumAlignBits 4 #define kAlignTableSize (1 << kNumAlignBits) #define kMatchMinLen 2 #define kMatchSpecLenStart (kMatchMinLen + kLenNumLowSymbols * 2 + kLenNumHighSymbols) #define kMatchSpecLen_Error_Data (1 << 9) #define kMatchSpecLen_Error_Fail (kMatchSpecLen_Error_Data - 1) /* External ASM code needs same CLzmaProb array layout. So don't change it. */ /* (probs_1664) is faster and better for code size at some platforms */ /* #ifdef MY_CPU_X86_OR_AMD64 */ #define kStartOffset 1664 #define GET_PROBS p->probs_1664 /* #define GET_PROBS p->probs + kStartOffset #else #define kStartOffset 0 #define GET_PROBS p->probs #endif */ #define SpecPos (-kStartOffset) #define IsRep0Long (SpecPos + kNumFullDistances) #define RepLenCoder (IsRep0Long + (kNumStates2 << kNumPosBitsMax)) #define LenCoder (RepLenCoder + kNumLenProbs) #define IsMatch (LenCoder + kNumLenProbs) #define Align (IsMatch + (kNumStates2 << kNumPosBitsMax)) #define IsRep (Align + kAlignTableSize) #define IsRepG0 (IsRep + kNumStates) #define IsRepG1 (IsRepG0 + kNumStates) #define IsRepG2 (IsRepG1 + kNumStates) #define PosSlot (IsRepG2 + kNumStates) #define Literal (PosSlot + (kNumLenToPosStates << kNumPosSlotBits)) #define NUM_BASE_PROBS (Literal + kStartOffset) #if Align != 0 && kStartOffset != 0 #error Stop_Compiling_Bad_LZMA_kAlign #endif #if NUM_BASE_PROBS != 1984 #error Stop_Compiling_Bad_LZMA_PROBS #endif #define LZMA_LIT_SIZE 0x300 #define LzmaProps_GetNumProbs(p) (NUM_BASE_PROBS + ((UInt32)LZMA_LIT_SIZE << ((p)->lc + (p)->lp))) #define CALC_POS_STATE(processedPos, pbMask) (((processedPos) & (pbMask)) << 4) #define COMBINED_PS_STATE (posState + state) #define GET_LEN_STATE (posState) #define LZMA_DIC_MIN (1 << 12) /* p->remainLen : shows status of LZMA decoder: < kMatchSpecLenStart : the number of bytes to be copied with (p->rep0) offset = kMatchSpecLenStart : the LZMA stream was finished with end mark = kMatchSpecLenStart + 1 : need init range coder = kMatchSpecLenStart + 2 : need init range coder and state = kMatchSpecLen_Error_Fail : Internal Code Failure = kMatchSpecLen_Error_Data + [0 ... 273] : LZMA Data Error */ /* ---------- LZMA_DECODE_REAL ---------- */ /* LzmaDec_DecodeReal_3() can be implemented in external ASM file. 3 - is the code compatibility version of that function for check at link time. */ #define LZMA_DECODE_REAL LzmaDec_DecodeReal_3 /* LZMA_DECODE_REAL() In: RangeCoder is normalized if (p->dicPos == limit) { LzmaDec_TryDummy() was called before to exclude LITERAL and MATCH-REP cases. So first symbol can be only MATCH-NON-REP. And if that MATCH-NON-REP symbol is not END_OF_PAYALOAD_MARKER, then the function doesn't write any byte to dictionary, the function returns SZ_OK, and the caller can use (p->remainLen) and (p->reps[0]) later. } Processing: The first LZMA symbol will be decoded in any case. All main checks for limits are at the end of main loop, It decodes additional LZMA-symbols while (p->buf < bufLimit && dicPos < limit), RangeCoder is still without last normalization when (p->buf < bufLimit) is being checked. But if (p->buf < bufLimit), the caller provided at least (LZMA_REQUIRED_INPUT_MAX + 1) bytes for next iteration before limit (bufLimit + LZMA_REQUIRED_INPUT_MAX), that is enough for worst case LZMA symbol with one additional RangeCoder normalization for one bit. So that function never reads bufLimit [LZMA_REQUIRED_INPUT_MAX] byte. Out: RangeCoder is normalized Result: SZ_OK - OK p->remainLen: < kMatchSpecLenStart : the number of bytes to be copied with (p->reps[0]) offset = kMatchSpecLenStart : the LZMA stream was finished with end mark SZ_ERROR_DATA - error, when the MATCH-Symbol refers out of dictionary p->remainLen : undefined p->reps[*] : undefined */ #ifdef _LZMA_DEC_OPT int MY_FAST_CALL LZMA_DECODE_REAL(CLzmaDec *p, SizeT limit, const Byte *bufLimit); #else static int MY_FAST_CALL LZMA_DECODE_REAL(CLzmaDec *p, SizeT limit, const Byte *bufLimit) { CLzmaProb *probs = GET_PROBS; unsigned state = (unsigned)p->state; UInt32 rep0 = p->reps[0], rep1 = p->reps[1], rep2 = p->reps[2], rep3 = p->reps[3]; unsigned pbMask = ((unsigned)1 << (p->prop.pb)) - 1; unsigned lc = p->prop.lc; unsigned lpMask = ((unsigned)0x100 << p->prop.lp) - ((unsigned)0x100 >> lc); Byte *dic = p->dic; SizeT dicBufSize = p->dicBufSize; SizeT dicPos = p->dicPos; UInt32 processedPos = p->processedPos; UInt32 checkDicSize = p->checkDicSize; unsigned len = 0; const Byte *buf = p->buf; UInt32 range = p->range; UInt32 code = p->code; do { CLzmaProb *prob; UInt32 bound; unsigned ttt; unsigned posState = CALC_POS_STATE(processedPos, pbMask); prob = probs + IsMatch + COMBINED_PS_STATE; IF_BIT_0(prob) { unsigned symbol; UPDATE_0(prob); prob = probs + Literal; if (processedPos != 0 || checkDicSize != 0) prob += (UInt32)3 * ((((processedPos << 8) + dic[(dicPos == 0 ? dicBufSize : dicPos) - 1]) & lpMask) << lc); processedPos++; if (state < kNumLitStates) { state -= (state < 4) ? state : 3; symbol = 1; #ifdef _LZMA_SIZE_OPT do { NORMAL_LITER_DEC } while (symbol < 0x100); #else NORMAL_LITER_DEC NORMAL_LITER_DEC NORMAL_LITER_DEC NORMAL_LITER_DEC NORMAL_LITER_DEC NORMAL_LITER_DEC NORMAL_LITER_DEC NORMAL_LITER_DEC #endif } else { unsigned matchByte = dic[dicPos - rep0 + (dicPos < rep0 ? dicBufSize : 0)]; unsigned offs = 0x100; state -= (state < 10) ? 3 : 6; symbol = 1; #ifdef _LZMA_SIZE_OPT do { unsigned bit; CLzmaProb *probLit; MATCHED_LITER_DEC } while (symbol < 0x100); #else { unsigned bit; CLzmaProb *probLit; MATCHED_LITER_DEC MATCHED_LITER_DEC MATCHED_LITER_DEC MATCHED_LITER_DEC MATCHED_LITER_DEC MATCHED_LITER_DEC MATCHED_LITER_DEC MATCHED_LITER_DEC } #endif } dic[dicPos++] = (Byte)symbol; continue; } { UPDATE_1(prob); prob = probs + IsRep + state; IF_BIT_0(prob) { UPDATE_0(prob); state += kNumStates; prob = probs + LenCoder; } else { UPDATE_1(prob); prob = probs + IsRepG0 + state; IF_BIT_0(prob) { UPDATE_0(prob); prob = probs + IsRep0Long + COMBINED_PS_STATE; IF_BIT_0(prob) { UPDATE_0(prob); // that case was checked before with kBadRepCode // if (checkDicSize == 0 && processedPos == 0) { len = kMatchSpecLen_Error_Data + 1; break; } // The caller doesn't allow (dicPos == limit) case here // so we don't need the following check: // if (dicPos == limit) { state = state < kNumLitStates ? 9 : 11; len = 1; break; } dic[dicPos] = dic[dicPos - rep0 + (dicPos < rep0 ? dicBufSize : 0)]; dicPos++; processedPos++; state = state < kNumLitStates ? 9 : 11; continue; } UPDATE_1(prob); } else { UInt32 distance; UPDATE_1(prob); prob = probs + IsRepG1 + state; IF_BIT_0(prob) { UPDATE_0(prob); distance = rep1; } else { UPDATE_1(prob); prob = probs + IsRepG2 + state; IF_BIT_0(prob) { UPDATE_0(prob); distance = rep2; } else { UPDATE_1(prob); distance = rep3; rep3 = rep2; } rep2 = rep1; } rep1 = rep0; rep0 = distance; } state = state < kNumLitStates ? 8 : 11; prob = probs + RepLenCoder; } #ifdef _LZMA_SIZE_OPT { unsigned lim, offset; CLzmaProb *probLen = prob + LenChoice; IF_BIT_0(probLen) { UPDATE_0(probLen); probLen = prob + LenLow + GET_LEN_STATE; offset = 0; lim = (1 << kLenNumLowBits); } else { UPDATE_1(probLen); probLen = prob + LenChoice2; IF_BIT_0(probLen) { UPDATE_0(probLen); probLen = prob + LenLow + GET_LEN_STATE + (1 << kLenNumLowBits); offset = kLenNumLowSymbols; lim = (1 << kLenNumLowBits); } else { UPDATE_1(probLen); probLen = prob + LenHigh; offset = kLenNumLowSymbols * 2; lim = (1 << kLenNumHighBits); } } TREE_DECODE(probLen, lim, len); len += offset; } #else { CLzmaProb *probLen = prob + LenChoice; IF_BIT_0(probLen) { UPDATE_0(probLen); probLen = prob + LenLow + GET_LEN_STATE; len = 1; TREE_GET_BIT(probLen, len); TREE_GET_BIT(probLen, len); TREE_GET_BIT(probLen, len); len -= 8; } else { UPDATE_1(probLen); probLen = prob + LenChoice2; IF_BIT_0(probLen) { UPDATE_0(probLen); probLen = prob + LenLow + GET_LEN_STATE + (1 << kLenNumLowBits); len = 1; TREE_GET_BIT(probLen, len); TREE_GET_BIT(probLen, len); TREE_GET_BIT(probLen, len); } else { UPDATE_1(probLen); probLen = prob + LenHigh; TREE_DECODE(probLen, (1 << kLenNumHighBits), len); len += kLenNumLowSymbols * 2; } } } #endif if (state >= kNumStates) { UInt32 distance; prob = probs + PosSlot + ((len < kNumLenToPosStates ? len : kNumLenToPosStates - 1) << kNumPosSlotBits); TREE_6_DECODE(prob, distance); if (distance >= kStartPosModelIndex) { unsigned posSlot = (unsigned)distance; unsigned numDirectBits = (unsigned)(((distance >> 1) - 1)); distance = (2 | (distance & 1)); if (posSlot < kEndPosModelIndex) { distance <<= numDirectBits; prob = probs + SpecPos; { UInt32 m = 1; distance++; do { REV_BIT_VAR(prob, distance, m); } while (--numDirectBits); distance -= m; } } else { numDirectBits -= kNumAlignBits; do { NORMALIZE range >>= 1; { UInt32 t; code -= range; t = (0 - ((UInt32)code >> 31)); /* (UInt32)((Int32)code >> 31) */ distance = (distance << 1) + (t + 1); code += range & t; } /* distance <<= 1; if (code >= range) { code -= range; distance |= 1; } */ } while (--numDirectBits); prob = probs + Align; distance <<= kNumAlignBits; { unsigned i = 1; REV_BIT_CONST(prob, i, 1); REV_BIT_CONST(prob, i, 2); REV_BIT_CONST(prob, i, 4); REV_BIT_LAST (prob, i, 8); distance |= i; } if (distance == (UInt32)0xFFFFFFFF) { len = kMatchSpecLenStart; state -= kNumStates; break; } } } rep3 = rep2; rep2 = rep1; rep1 = rep0; rep0 = distance + 1; state = (state < kNumStates + kNumLitStates) ? kNumLitStates : kNumLitStates + 3; if (distance >= (checkDicSize == 0 ? processedPos: checkDicSize)) { len += kMatchSpecLen_Error_Data + kMatchMinLen; // len = kMatchSpecLen_Error_Data; // len += kMatchMinLen; break; } } len += kMatchMinLen; { SizeT rem; unsigned curLen; SizeT pos; if ((rem = limit - dicPos) == 0) { /* We stop decoding and return SZ_OK, and we can resume decoding later. Any error conditions can be tested later in caller code. For more strict mode we can stop decoding with error // len += kMatchSpecLen_Error_Data; */ break; } curLen = ((rem < len) ? (unsigned)rem : len); pos = dicPos - rep0 + (dicPos < rep0 ? dicBufSize : 0); processedPos += (UInt32)curLen; len -= curLen; if (curLen <= dicBufSize - pos) { Byte *dest = dic + dicPos; ptrdiff_t src = (ptrdiff_t)pos - (ptrdiff_t)dicPos; const Byte *lim = dest + curLen; dicPos += (SizeT)curLen; do *(dest) = (Byte)*(dest + src); while (++dest != lim); } else { do { dic[dicPos++] = dic[pos]; if (++pos == dicBufSize) pos = 0; } while (--curLen != 0); } } } } while (dicPos < limit && buf < bufLimit); NORMALIZE; p->buf = buf; p->range = range; p->code = code; p->remainLen = (UInt32)len; // & (kMatchSpecLen_Error_Data - 1); // we can write real length for error matches too. p->dicPos = dicPos; p->processedPos = processedPos; p->reps[0] = rep0; p->reps[1] = rep1; p->reps[2] = rep2; p->reps[3] = rep3; p->state = (UInt32)state; if (len >= kMatchSpecLen_Error_Data) return SZ_ERROR_DATA; return SZ_OK; } #endif static void MY_FAST_CALL LzmaDec_WriteRem(CLzmaDec *p, SizeT limit) { unsigned len = (unsigned)p->remainLen; if (len == 0 /* || len >= kMatchSpecLenStart */) return; { SizeT dicPos = p->dicPos; Byte *dic; SizeT dicBufSize; SizeT rep0; /* we use SizeT to avoid the BUG of VC14 for AMD64 */ { SizeT rem = limit - dicPos; if (rem < len) { len = (unsigned)(rem); if (len == 0) return; } } if (p->checkDicSize == 0 && p->prop.dicSize - p->processedPos <= len) p->checkDicSize = p->prop.dicSize; p->processedPos += (UInt32)len; p->remainLen -= (UInt32)len; dic = p->dic; rep0 = p->reps[0]; dicBufSize = p->dicBufSize; do { dic[dicPos] = dic[dicPos - rep0 + (dicPos < rep0 ? dicBufSize : 0)]; dicPos++; } while (--len); p->dicPos = dicPos; } } /* At staring of new stream we have one of the following symbols: - Literal - is allowed - Non-Rep-Match - is allowed only if it's end marker symbol - Rep-Match - is not allowed We use early check of (RangeCoder:Code) over kBadRepCode to simplify main decoding code */ #define kRange0 0xFFFFFFFF #define kBound0 ((kRange0 >> kNumBitModelTotalBits) << (kNumBitModelTotalBits - 1)) #define kBadRepCode (kBound0 + (((kRange0 - kBound0) >> kNumBitModelTotalBits) << (kNumBitModelTotalBits - 1))) #if kBadRepCode != (0xC0000000 - 0x400) #error Stop_Compiling_Bad_LZMA_Check #endif /* LzmaDec_DecodeReal2(): It calls LZMA_DECODE_REAL() and it adjusts limit according (p->checkDicSize). We correct (p->checkDicSize) after LZMA_DECODE_REAL() and in LzmaDec_WriteRem(), and we support the following state of (p->checkDicSize): if (total_processed < p->prop.dicSize) then { (total_processed == p->processedPos) (p->checkDicSize == 0) } else (p->checkDicSize == p->prop.dicSize) */ static int MY_FAST_CALL LzmaDec_DecodeReal2(CLzmaDec *p, SizeT limit, const Byte *bufLimit) { if (p->checkDicSize == 0) { UInt32 rem = p->prop.dicSize - p->processedPos; if (limit - p->dicPos > rem) limit = p->dicPos + rem; } { int res = LZMA_DECODE_REAL(p, limit, bufLimit); if (p->checkDicSize == 0 && p->processedPos >= p->prop.dicSize) p->checkDicSize = p->prop.dicSize; return res; } } typedef enum { DUMMY_INPUT_EOF, /* need more input data */ DUMMY_LIT, DUMMY_MATCH, DUMMY_REP } ELzmaDummy; #define IS_DUMMY_END_MARKER_POSSIBLE(dummyRes) ((dummyRes) == DUMMY_MATCH) static ELzmaDummy LzmaDec_TryDummy(const CLzmaDec *p, const Byte *buf, const Byte **bufOut) { UInt32 range = p->range; UInt32 code = p->code; const Byte *bufLimit = *bufOut; const CLzmaProb *probs = GET_PROBS; unsigned state = (unsigned)p->state; ELzmaDummy res; for (;;) { const CLzmaProb *prob; UInt32 bound; unsigned ttt; unsigned posState = CALC_POS_STATE(p->processedPos, ((unsigned)1 << p->prop.pb) - 1); prob = probs + IsMatch + COMBINED_PS_STATE; IF_BIT_0_CHECK(prob) { UPDATE_0_CHECK prob = probs + Literal; if (p->checkDicSize != 0 || p->processedPos != 0) prob += ((UInt32)LZMA_LIT_SIZE * ((((p->processedPos) & (((unsigned)1 << (p->prop.lp)) - 1)) << p->prop.lc) + ((unsigned)p->dic[(p->dicPos == 0 ? p->dicBufSize : p->dicPos) - 1] >> (8 - p->prop.lc)))); if (state < kNumLitStates) { unsigned symbol = 1; do { GET_BIT_CHECK(prob + symbol, symbol) } while (symbol < 0x100); } else { unsigned matchByte = p->dic[p->dicPos - p->reps[0] + (p->dicPos < p->reps[0] ? p->dicBufSize : 0)]; unsigned offs = 0x100; unsigned symbol = 1; do { unsigned bit; const CLzmaProb *probLit; matchByte += matchByte; bit = offs; offs &= matchByte; probLit = prob + (offs + bit + symbol); GET_BIT2_CHECK(probLit, symbol, offs ^= bit; , ; ) } while (symbol < 0x100); } res = DUMMY_LIT; } else { unsigned len; UPDATE_1_CHECK; prob = probs + IsRep + state; IF_BIT_0_CHECK(prob) { UPDATE_0_CHECK; state = 0; prob = probs + LenCoder; res = DUMMY_MATCH; } else { UPDATE_1_CHECK; res = DUMMY_REP; prob = probs + IsRepG0 + state; IF_BIT_0_CHECK(prob) { UPDATE_0_CHECK; prob = probs + IsRep0Long + COMBINED_PS_STATE; IF_BIT_0_CHECK(prob) { UPDATE_0_CHECK; break; } else { UPDATE_1_CHECK; } } else { UPDATE_1_CHECK; prob = probs + IsRepG1 + state; IF_BIT_0_CHECK(prob) { UPDATE_0_CHECK; } else { UPDATE_1_CHECK; prob = probs + IsRepG2 + state; IF_BIT_0_CHECK(prob) { UPDATE_0_CHECK; } else { UPDATE_1_CHECK; } } } state = kNumStates; prob = probs + RepLenCoder; } { unsigned limit, offset; const CLzmaProb *probLen = prob + LenChoice; IF_BIT_0_CHECK(probLen) { UPDATE_0_CHECK; probLen = prob + LenLow + GET_LEN_STATE; offset = 0; limit = 1 << kLenNumLowBits; } else { UPDATE_1_CHECK; probLen = prob + LenChoice2; IF_BIT_0_CHECK(probLen) { UPDATE_0_CHECK; probLen = prob + LenLow + GET_LEN_STATE + (1 << kLenNumLowBits); offset = kLenNumLowSymbols; limit = 1 << kLenNumLowBits; } else { UPDATE_1_CHECK; probLen = prob + LenHigh; offset = kLenNumLowSymbols * 2; limit = 1 << kLenNumHighBits; } } TREE_DECODE_CHECK(probLen, limit, len); len += offset; } if (state < 4) { unsigned posSlot; prob = probs + PosSlot + ((len < kNumLenToPosStates - 1 ? len : kNumLenToPosStates - 1) << kNumPosSlotBits); TREE_DECODE_CHECK(prob, 1 << kNumPosSlotBits, posSlot); if (posSlot >= kStartPosModelIndex) { unsigned numDirectBits = ((posSlot >> 1) - 1); if (posSlot < kEndPosModelIndex) { prob = probs + SpecPos + ((2 | (posSlot & 1)) << numDirectBits); } else { numDirectBits -= kNumAlignBits; do { NORMALIZE_CHECK range >>= 1; code -= range & (((code - range) >> 31) - 1); /* if (code >= range) code -= range; */ } while (--numDirectBits); prob = probs + Align; numDirectBits = kNumAlignBits; } { unsigned i = 1; unsigned m = 1; do { REV_BIT_CHECK(prob, i, m); } while (--numDirectBits); } } } } break; } NORMALIZE_CHECK; *bufOut = buf; return res; } void LzmaDec_InitDicAndState(CLzmaDec *p, BoolInt initDic, BoolInt initState); void LzmaDec_InitDicAndState(CLzmaDec *p, BoolInt initDic, BoolInt initState) { p->remainLen = kMatchSpecLenStart + 1; p->tempBufSize = 0; if (initDic) { p->processedPos = 0; p->checkDicSize = 0; p->remainLen = kMatchSpecLenStart + 2; } if (initState) p->remainLen = kMatchSpecLenStart + 2; } void LzmaDec_Init(CLzmaDec *p) { p->dicPos = 0; LzmaDec_InitDicAndState(p, True, True); } /* LZMA supports optional end_marker. So the decoder can lookahead for one additional LZMA-Symbol to check end_marker. That additional LZMA-Symbol can require up to LZMA_REQUIRED_INPUT_MAX bytes in input stream. When the decoder reaches dicLimit, it looks (finishMode) parameter: if (finishMode == LZMA_FINISH_ANY), the decoder doesn't lookahead if (finishMode != LZMA_FINISH_ANY), the decoder lookahead, if end_marker is possible for current position When the decoder lookahead, and the lookahead symbol is not end_marker, we have two ways: 1) Strict mode (default) : the decoder returns SZ_ERROR_DATA. 2) The relaxed mode (alternative mode) : we could return SZ_OK, and the caller must check (status) value. The caller can show the error, if the end of stream is expected, and the (status) is noit LZMA_STATUS_FINISHED_WITH_MARK or LZMA_STATUS_MAYBE_FINISHED_WITHOUT_MARK. */ #define RETURN__NOT_FINISHED__FOR_FINISH \ *status = LZMA_STATUS_NOT_FINISHED; \ return SZ_ERROR_DATA; // for strict mode // return SZ_OK; // for relaxed mode SRes LzmaDec_DecodeToDic(CLzmaDec *p, SizeT dicLimit, const Byte *src, SizeT *srcLen, ELzmaFinishMode finishMode, ELzmaStatus *status) { SizeT inSize = *srcLen; (*srcLen) = 0; *status = LZMA_STATUS_NOT_SPECIFIED; if (p->remainLen > kMatchSpecLenStart) { if (p->remainLen > kMatchSpecLenStart + 2) return p->remainLen == kMatchSpecLen_Error_Fail ? SZ_ERROR_FAIL : SZ_ERROR_DATA; for (; inSize > 0 && p->tempBufSize < RC_INIT_SIZE; (*srcLen)++, inSize--) p->tempBuf[p->tempBufSize++] = *src++; if (p->tempBufSize != 0 && p->tempBuf[0] != 0) return SZ_ERROR_DATA; if (p->tempBufSize < RC_INIT_SIZE) { *status = LZMA_STATUS_NEEDS_MORE_INPUT; return SZ_OK; } p->code = ((UInt32)p->tempBuf[1] << 24) | ((UInt32)p->tempBuf[2] << 16) | ((UInt32)p->tempBuf[3] << 8) | ((UInt32)p->tempBuf[4]); if (p->checkDicSize == 0 && p->processedPos == 0 && p->code >= kBadRepCode) return SZ_ERROR_DATA; p->range = 0xFFFFFFFF; p->tempBufSize = 0; if (p->remainLen > kMatchSpecLenStart + 1) { SizeT numProbs = LzmaProps_GetNumProbs(&p->prop); SizeT i; CLzmaProb *probs = p->probs; for (i = 0; i < numProbs; i++) probs[i] = kBitModelTotal >> 1; p->reps[0] = p->reps[1] = p->reps[2] = p->reps[3] = 1; p->state = 0; } p->remainLen = 0; } for (;;) { if (p->remainLen == kMatchSpecLenStart) { if (p->code != 0) return SZ_ERROR_DATA; *status = LZMA_STATUS_FINISHED_WITH_MARK; return SZ_OK; } LzmaDec_WriteRem(p, dicLimit); { // (p->remainLen == 0 || p->dicPos == dicLimit) int checkEndMarkNow = 0; if (p->dicPos >= dicLimit) { if (p->remainLen == 0 && p->code == 0) { *status = LZMA_STATUS_MAYBE_FINISHED_WITHOUT_MARK; return SZ_OK; } if (finishMode == LZMA_FINISH_ANY) { *status = LZMA_STATUS_NOT_FINISHED; return SZ_OK; } if (p->remainLen != 0) { RETURN__NOT_FINISHED__FOR_FINISH; } checkEndMarkNow = 1; } // (p->remainLen == 0) if (p->tempBufSize == 0) { const Byte *bufLimit; int dummyProcessed = -1; if (inSize < LZMA_REQUIRED_INPUT_MAX || checkEndMarkNow) { const Byte *bufOut = src + inSize; ELzmaDummy dummyRes = LzmaDec_TryDummy(p, src, &bufOut); if (dummyRes == DUMMY_INPUT_EOF) { size_t i; if (inSize >= LZMA_REQUIRED_INPUT_MAX) break; (*srcLen) += inSize; p->tempBufSize = (unsigned)inSize; for (i = 0; i < inSize; i++) p->tempBuf[i] = src[i]; *status = LZMA_STATUS_NEEDS_MORE_INPUT; return SZ_OK; } dummyProcessed = (int)(bufOut - src); if ((unsigned)dummyProcessed > LZMA_REQUIRED_INPUT_MAX) break; if (checkEndMarkNow && !IS_DUMMY_END_MARKER_POSSIBLE(dummyRes)) { unsigned i; (*srcLen) += (unsigned)dummyProcessed; p->tempBufSize = (unsigned)dummyProcessed; for (i = 0; i < (unsigned)dummyProcessed; i++) p->tempBuf[i] = src[i]; // p->remainLen = kMatchSpecLen_Error_Data; RETURN__NOT_FINISHED__FOR_FINISH; } bufLimit = src; // we will decode only one iteration } else bufLimit = src + inSize - LZMA_REQUIRED_INPUT_MAX; p->buf = src; { int res = LzmaDec_DecodeReal2(p, dicLimit, bufLimit); SizeT processed = (SizeT)(p->buf - src); if (dummyProcessed < 0) { if (processed > inSize) break; } else if ((unsigned)dummyProcessed != processed) break; src += processed; inSize -= processed; (*srcLen) += processed; if (res != SZ_OK) { p->remainLen = kMatchSpecLen_Error_Data; return SZ_ERROR_DATA; } } continue; } { // we have some data in (p->tempBuf) // in strict mode: tempBufSize is not enough for one Symbol decoding. // in relaxed mode: tempBufSize not larger than required for one Symbol decoding. unsigned rem = p->tempBufSize; unsigned ahead = 0; int dummyProcessed = -1; while (rem < LZMA_REQUIRED_INPUT_MAX && ahead < inSize) p->tempBuf[rem++] = src[ahead++]; // ahead - the size of new data copied from (src) to (p->tempBuf) // rem - the size of temp buffer including new data from (src) if (rem < LZMA_REQUIRED_INPUT_MAX || checkEndMarkNow) { const Byte *bufOut = p->tempBuf + rem; ELzmaDummy dummyRes = LzmaDec_TryDummy(p, p->tempBuf, &bufOut); if (dummyRes == DUMMY_INPUT_EOF) { if (rem >= LZMA_REQUIRED_INPUT_MAX) break; p->tempBufSize = rem; (*srcLen) += (SizeT)ahead; *status = LZMA_STATUS_NEEDS_MORE_INPUT; return SZ_OK; } dummyProcessed = (int)(bufOut - p->tempBuf); if ((unsigned)dummyProcessed < p->tempBufSize) break; if (checkEndMarkNow && !IS_DUMMY_END_MARKER_POSSIBLE(dummyRes)) { (*srcLen) += (unsigned)dummyProcessed - p->tempBufSize; p->tempBufSize = (unsigned)dummyProcessed; // p->remainLen = kMatchSpecLen_Error_Data; RETURN__NOT_FINISHED__FOR_FINISH; } } p->buf = p->tempBuf; { // we decode one symbol from (p->tempBuf) here, so the (bufLimit) is equal to (p->buf) int res = LzmaDec_DecodeReal2(p, dicLimit, p->buf); SizeT processed = (SizeT)(p->buf - p->tempBuf); rem = p->tempBufSize; if (dummyProcessed < 0) { if (processed > LZMA_REQUIRED_INPUT_MAX) break; if (processed < rem) break; } else if ((unsigned)dummyProcessed != processed) break; processed -= rem; src += processed; inSize -= processed; (*srcLen) += processed; p->tempBufSize = 0; if (res != SZ_OK) { p->remainLen = kMatchSpecLen_Error_Data; return SZ_ERROR_DATA; } } } } } /* Some unexpected error: internal error of code, memory corruption or hardware failure */ p->remainLen = kMatchSpecLen_Error_Fail; return SZ_ERROR_FAIL; } SRes LzmaDec_DecodeToBuf(CLzmaDec *p, Byte *dest, SizeT *destLen, const Byte *src, SizeT *srcLen, ELzmaFinishMode finishMode, ELzmaStatus *status) { SizeT outSize = *destLen; SizeT inSize = *srcLen; *srcLen = *destLen = 0; for (;;) { SizeT inSizeCur = inSize, outSizeCur, dicPos; ELzmaFinishMode curFinishMode; SRes res; if (p->dicPos == p->dicBufSize) p->dicPos = 0; dicPos = p->dicPos; if (outSize > p->dicBufSize - dicPos) { outSizeCur = p->dicBufSize; curFinishMode = LZMA_FINISH_ANY; } else { outSizeCur = dicPos + outSize; curFinishMode = finishMode; } res = LzmaDec_DecodeToDic(p, outSizeCur, src, &inSizeCur, curFinishMode, status); src += inSizeCur; inSize -= inSizeCur; *srcLen += inSizeCur; outSizeCur = p->dicPos - dicPos; memcpy(dest, p->dic + dicPos, outSizeCur); dest += outSizeCur; outSize -= outSizeCur; *destLen += outSizeCur; if (res != 0) return res; if (outSizeCur == 0 || outSize == 0) return SZ_OK; } } void LzmaDec_FreeProbs(CLzmaDec *p, ISzAllocPtr alloc) { ISzAlloc_Free(alloc, p->probs); p->probs = NULL; } static void LzmaDec_FreeDict(CLzmaDec *p, ISzAllocPtr alloc) { ISzAlloc_Free(alloc, p->dic); p->dic = NULL; } void LzmaDec_Free(CLzmaDec *p, ISzAllocPtr alloc) { LzmaDec_FreeProbs(p, alloc); LzmaDec_FreeDict(p, alloc); } SRes LzmaProps_Decode(CLzmaProps *p, const Byte *data, unsigned size) { UInt32 dicSize; Byte d; if (size < LZMA_PROPS_SIZE) return SZ_ERROR_UNSUPPORTED; else dicSize = data[1] | ((UInt32)data[2] << 8) | ((UInt32)data[3] << 16) | ((UInt32)data[4] << 24); if (dicSize < LZMA_DIC_MIN) dicSize = LZMA_DIC_MIN; p->dicSize = dicSize; d = data[0]; if (d >= (9 * 5 * 5)) return SZ_ERROR_UNSUPPORTED; p->lc = (Byte)(d % 9); d /= 9; p->pb = (Byte)(d / 5); p->lp = (Byte)(d % 5); return SZ_OK; } static SRes LzmaDec_AllocateProbs2(CLzmaDec *p, const CLzmaProps *propNew, ISzAllocPtr alloc) { UInt32 numProbs = LzmaProps_GetNumProbs(propNew); if (!p->probs || numProbs != p->numProbs) { LzmaDec_FreeProbs(p, alloc); p->probs = (CLzmaProb *)ISzAlloc_Alloc(alloc, numProbs * sizeof(CLzmaProb)); if (!p->probs) return SZ_ERROR_MEM; p->probs_1664 = p->probs + 1664; p->numProbs = numProbs; } return SZ_OK; } SRes LzmaDec_AllocateProbs(CLzmaDec *p, const Byte *props, unsigned propsSize, ISzAllocPtr alloc) { CLzmaProps propNew; RINOK(LzmaProps_Decode(&propNew, props, propsSize)); RINOK(LzmaDec_AllocateProbs2(p, &propNew, alloc)); p->prop = propNew; return SZ_OK; } SRes LzmaDec_Allocate(CLzmaDec *p, const Byte *props, unsigned propsSize, ISzAllocPtr alloc) { CLzmaProps propNew; SizeT dicBufSize; RINOK(LzmaProps_Decode(&propNew, props, propsSize)); RINOK(LzmaDec_AllocateProbs2(p, &propNew, alloc)); { UInt32 dictSize = propNew.dicSize; SizeT mask = ((UInt32)1 << 12) - 1; if (dictSize >= ((UInt32)1 << 30)) mask = ((UInt32)1 << 22) - 1; else if (dictSize >= ((UInt32)1 << 22)) mask = ((UInt32)1 << 20) - 1;; dicBufSize = ((SizeT)dictSize + mask) & ~mask; if (dicBufSize < dictSize) dicBufSize = dictSize; } if (!p->dic || dicBufSize != p->dicBufSize) { LzmaDec_FreeDict(p, alloc); p->dic = (Byte *)ISzAlloc_Alloc(alloc, dicBufSize); if (!p->dic) { LzmaDec_FreeProbs(p, alloc); return SZ_ERROR_MEM; } } p->dicBufSize = dicBufSize; p->prop = propNew; return SZ_OK; } SRes LzmaDecode(Byte *dest, SizeT *destLen, const Byte *src, SizeT *srcLen, const Byte *propData, unsigned propSize, ELzmaFinishMode finishMode, ELzmaStatus *status, ISzAllocPtr alloc) { CLzmaDec p; SRes res; SizeT outSize = *destLen, inSize = *srcLen; *destLen = *srcLen = 0; *status = LZMA_STATUS_NOT_SPECIFIED; if (inSize < RC_INIT_SIZE) return SZ_ERROR_INPUT_EOF; LzmaDec_Construct(&p); RINOK(LzmaDec_AllocateProbs(&p, propData, propSize, alloc)); p.dic = dest; p.dicBufSize = outSize; LzmaDec_Init(&p); *srcLen = inSize; res = LzmaDec_DecodeToDic(&p, outSize, src, srcLen, finishMode, status); *destLen = p.dicPos; if (res == SZ_OK && *status == LZMA_STATUS_NEEDS_MORE_INPUT) res = SZ_ERROR_INPUT_EOF; LzmaDec_FreeProbs(&p, alloc); return res; } UEFITool-A66/common/LZMA/SDK/C/LzmaDec.h000066400000000000000000000157041442134156300173360ustar00rootroot00000000000000/* LzmaDec.h -- LZMA Decoder 2020-03-19 : Igor Pavlov : Public domain */ #ifndef __LZMA_DEC_H #define __LZMA_DEC_H #include "7zTypes.h" EXTERN_C_BEGIN /* #define _LZMA_PROB32 */ /* _LZMA_PROB32 can increase the speed on some CPUs, but memory usage for CLzmaDec::probs will be doubled in that case */ typedef #ifdef _LZMA_PROB32 UInt32 #else UInt16 #endif CLzmaProb; /* ---------- LZMA Properties ---------- */ #define LZMA_PROPS_SIZE 5 typedef struct _CLzmaProps { Byte lc; Byte lp; Byte pb; Byte _pad_; UInt32 dicSize; } CLzmaProps; /* LzmaProps_Decode - decodes properties Returns: SZ_OK SZ_ERROR_UNSUPPORTED - Unsupported properties */ SRes LzmaProps_Decode(CLzmaProps *p, const Byte *data, unsigned size); /* ---------- LZMA Decoder state ---------- */ /* LZMA_REQUIRED_INPUT_MAX = number of required input bytes for worst case. Num bits = log2((2^11 / 31) ^ 22) + 26 < 134 + 26 = 160; */ #define LZMA_REQUIRED_INPUT_MAX 20 typedef struct { /* Don't change this structure. ASM code can use it. */ CLzmaProps prop; CLzmaProb *probs; CLzmaProb *probs_1664; Byte *dic; SizeT dicBufSize; SizeT dicPos; const Byte *buf; UInt32 range; UInt32 code; UInt32 processedPos; UInt32 checkDicSize; UInt32 reps[4]; UInt32 state; UInt32 remainLen; UInt32 numProbs; unsigned tempBufSize; Byte tempBuf[LZMA_REQUIRED_INPUT_MAX]; } CLzmaDec; #define LzmaDec_Construct(p) { (p)->dic = NULL; (p)->probs = NULL; } void LzmaDec_Init(CLzmaDec *p); /* There are two types of LZMA streams: - Stream with end mark. That end mark adds about 6 bytes to compressed size. - Stream without end mark. You must know exact uncompressed size to decompress such stream. */ typedef enum { LZMA_FINISH_ANY, /* finish at any point */ LZMA_FINISH_END /* block must be finished at the end */ } ELzmaFinishMode; /* ELzmaFinishMode has meaning only if the decoding reaches output limit !!! You must use LZMA_FINISH_END, when you know that current output buffer covers last bytes of block. In other cases you must use LZMA_FINISH_ANY. If LZMA decoder sees end marker before reaching output limit, it returns SZ_OK, and output value of destLen will be less than output buffer size limit. You can check status result also. You can use multiple checks to test data integrity after full decompression: 1) Check Result and "status" variable. 2) Check that output(destLen) = uncompressedSize, if you know real uncompressedSize. 3) Check that output(srcLen) = compressedSize, if you know real compressedSize. You must use correct finish mode in that case. */ typedef enum { LZMA_STATUS_NOT_SPECIFIED, /* use main error code instead */ LZMA_STATUS_FINISHED_WITH_MARK, /* stream was finished with end mark. */ LZMA_STATUS_NOT_FINISHED, /* stream was not finished */ LZMA_STATUS_NEEDS_MORE_INPUT, /* you must provide more input bytes */ LZMA_STATUS_MAYBE_FINISHED_WITHOUT_MARK /* there is probability that stream was finished without end mark */ } ELzmaStatus; /* ELzmaStatus is used only as output value for function call */ /* ---------- Interfaces ---------- */ /* There are 3 levels of interfaces: 1) Dictionary Interface 2) Buffer Interface 3) One Call Interface You can select any of these interfaces, but don't mix functions from different groups for same object. */ /* There are two variants to allocate state for Dictionary Interface: 1) LzmaDec_Allocate / LzmaDec_Free 2) LzmaDec_AllocateProbs / LzmaDec_FreeProbs You can use variant 2, if you set dictionary buffer manually. For Buffer Interface you must always use variant 1. LzmaDec_Allocate* can return: SZ_OK SZ_ERROR_MEM - Memory allocation error SZ_ERROR_UNSUPPORTED - Unsupported properties */ SRes LzmaDec_AllocateProbs(CLzmaDec *p, const Byte *props, unsigned propsSize, ISzAllocPtr alloc); void LzmaDec_FreeProbs(CLzmaDec *p, ISzAllocPtr alloc); SRes LzmaDec_Allocate(CLzmaDec *p, const Byte *props, unsigned propsSize, ISzAllocPtr alloc); void LzmaDec_Free(CLzmaDec *p, ISzAllocPtr alloc); /* ---------- Dictionary Interface ---------- */ /* You can use it, if you want to eliminate the overhead for data copying from dictionary to some other external buffer. You must work with CLzmaDec variables directly in this interface. STEPS: LzmaDec_Construct() LzmaDec_Allocate() for (each new stream) { LzmaDec_Init() while (it needs more decompression) { LzmaDec_DecodeToDic() use data from CLzmaDec::dic and update CLzmaDec::dicPos } } LzmaDec_Free() */ /* LzmaDec_DecodeToDic The decoding to internal dictionary buffer (CLzmaDec::dic). You must manually update CLzmaDec::dicPos, if it reaches CLzmaDec::dicBufSize !!! finishMode: It has meaning only if the decoding reaches output limit (dicLimit). LZMA_FINISH_ANY - Decode just dicLimit bytes. LZMA_FINISH_END - Stream must be finished after dicLimit. Returns: SZ_OK status: LZMA_STATUS_FINISHED_WITH_MARK LZMA_STATUS_NOT_FINISHED LZMA_STATUS_NEEDS_MORE_INPUT LZMA_STATUS_MAYBE_FINISHED_WITHOUT_MARK SZ_ERROR_DATA - Data error SZ_ERROR_FAIL - Some unexpected error: internal error of code, memory corruption or hardware failure */ SRes LzmaDec_DecodeToDic(CLzmaDec *p, SizeT dicLimit, const Byte *src, SizeT *srcLen, ELzmaFinishMode finishMode, ELzmaStatus *status); /* ---------- Buffer Interface ---------- */ /* It's zlib-like interface. See LzmaDec_DecodeToDic description for information about STEPS and return results, but you must use LzmaDec_DecodeToBuf instead of LzmaDec_DecodeToDic and you don't need to work with CLzmaDec variables manually. finishMode: It has meaning only if the decoding reaches output limit (*destLen). LZMA_FINISH_ANY - Decode just destLen bytes. LZMA_FINISH_END - Stream must be finished after (*destLen). */ SRes LzmaDec_DecodeToBuf(CLzmaDec *p, Byte *dest, SizeT *destLen, const Byte *src, SizeT *srcLen, ELzmaFinishMode finishMode, ELzmaStatus *status); /* ---------- One Call Interface ---------- */ /* LzmaDecode finishMode: It has meaning only if the decoding reaches output limit (*destLen). LZMA_FINISH_ANY - Decode just destLen bytes. LZMA_FINISH_END - Stream must be finished after (*destLen). Returns: SZ_OK status: LZMA_STATUS_FINISHED_WITH_MARK LZMA_STATUS_NOT_FINISHED LZMA_STATUS_MAYBE_FINISHED_WITHOUT_MARK SZ_ERROR_DATA - Data error SZ_ERROR_MEM - Memory allocation error SZ_ERROR_UNSUPPORTED - Unsupported properties SZ_ERROR_INPUT_EOF - It needs more bytes in input buffer (src). SZ_ERROR_FAIL - Some unexpected error: internal error of code, memory corruption or hardware failure */ SRes LzmaDecode(Byte *dest, SizeT *destLen, const Byte *src, SizeT *srcLen, const Byte *propData, unsigned propSize, ELzmaFinishMode finishMode, ELzmaStatus *status, ISzAllocPtr alloc); EXTERN_C_END #endif UEFITool-A66/common/LZMA/SDK/C/LzmaEnc.c000066400000000000000000002357351442134156300173530ustar00rootroot00000000000000/* LzmaEnc.c -- LZMA Encoder 2022-07-15: Igor Pavlov : Public domain */ #include "Precomp.h" #include /* #define SHOW_STAT */ /* #define SHOW_STAT2 */ #if defined(SHOW_STAT) || defined(SHOW_STAT2) #include #endif #include "CpuArch.h" #include "LzmaEnc.h" #include "LzFind.h" #ifndef _7ZIP_ST #include "LzFindMt.h" #endif /* the following LzmaEnc_* declarations is internal LZMA interface for LZMA2 encoder */ SRes LzmaEnc_PrepareForLzma2(CLzmaEncHandle pp, ISeqInStream *inStream, UInt32 keepWindowSize, ISzAllocPtr alloc, ISzAllocPtr allocBig); SRes LzmaEnc_MemPrepare(CLzmaEncHandle pp, const Byte *src, SizeT srcLen, UInt32 keepWindowSize, ISzAllocPtr alloc, ISzAllocPtr allocBig); SRes LzmaEnc_CodeOneMemBlock(CLzmaEncHandle pp, BoolInt reInit, Byte *dest, size_t *destLen, UInt32 desiredPackSize, UInt32 *unpackSize); const Byte *LzmaEnc_GetCurBuf(CLzmaEncHandle pp); void LzmaEnc_Finish(CLzmaEncHandle pp); void LzmaEnc_SaveState(CLzmaEncHandle pp); void LzmaEnc_RestoreState(CLzmaEncHandle pp); #ifdef SHOW_STAT static unsigned g_STAT_OFFSET = 0; #endif /* for good normalization speed we still reserve 256 MB before 4 GB range */ #define kLzmaMaxHistorySize ((UInt32)15 << 28) #define kNumTopBits 24 #define kTopValue ((UInt32)1 << kNumTopBits) #define kNumBitModelTotalBits 11 #define kBitModelTotal (1 << kNumBitModelTotalBits) #define kNumMoveBits 5 #define kProbInitValue (kBitModelTotal >> 1) #define kNumMoveReducingBits 4 #define kNumBitPriceShiftBits 4 // #define kBitPrice (1 << kNumBitPriceShiftBits) #define REP_LEN_COUNT 64 void LzmaEncProps_Init(CLzmaEncProps *p) { p->level = 5; p->dictSize = p->mc = 0; p->reduceSize = (UInt64)(Int64)-1; p->lc = p->lp = p->pb = p->algo = p->fb = p->btMode = p->numHashBytes = p->numThreads = -1; p->writeEndMark = 0; p->affinity = 0; } void LzmaEncProps_Normalize(CLzmaEncProps *p) { int level = p->level; if (level < 0) level = 5; p->level = level; if (p->dictSize == 0) p->dictSize = ( level <= 3 ? ((UInt32)1 << (level * 2 + 16)) : ( level <= 6 ? ((UInt32)1 << (level + 19)) : ( level <= 7 ? ((UInt32)1 << 25) : ((UInt32)1 << 26) ))); if (p->dictSize > p->reduceSize) { UInt32 v = (UInt32)p->reduceSize; const UInt32 kReduceMin = ((UInt32)1 << 12); if (v < kReduceMin) v = kReduceMin; if (p->dictSize > v) p->dictSize = v; } if (p->lc < 0) p->lc = 3; if (p->lp < 0) p->lp = 0; if (p->pb < 0) p->pb = 2; if (p->algo < 0) p->algo = (level < 5 ? 0 : 1); if (p->fb < 0) p->fb = (level < 7 ? 32 : 64); if (p->btMode < 0) p->btMode = (p->algo == 0 ? 0 : 1); if (p->numHashBytes < 0) p->numHashBytes = (p->btMode ? 4 : 5); if (p->mc == 0) p->mc = (16 + ((unsigned)p->fb >> 1)) >> (p->btMode ? 0 : 1); if (p->numThreads < 0) p->numThreads = #ifndef _7ZIP_ST ((p->btMode && p->algo) ? 2 : 1); #else 1; #endif } UInt32 LzmaEncProps_GetDictSize(const CLzmaEncProps *props2) { CLzmaEncProps props = *props2; LzmaEncProps_Normalize(&props); return props.dictSize; } /* x86/x64: BSR: IF (SRC == 0) ZF = 1, DEST is undefined; AMD : DEST is unchanged; IF (SRC != 0) ZF = 0; DEST is index of top non-zero bit BSR is slow in some processors LZCNT: IF (SRC == 0) CF = 1, DEST is size_in_bits_of_register(src) (32 or 64) IF (SRC != 0) CF = 0, DEST = num_lead_zero_bits IF (DEST == 0) ZF = 1; LZCNT works only in new processors starting from Haswell. if LZCNT is not supported by processor, then it's executed as BSR. LZCNT can be faster than BSR, if supported. */ // #define LZMA_LOG_BSR #if defined(MY_CPU_ARM_OR_ARM64) /* || defined(MY_CPU_X86_OR_AMD64) */ #if (defined(__clang__) && (__clang_major__ >= 6)) \ || (defined(__GNUC__) && (__GNUC__ >= 6)) #define LZMA_LOG_BSR #elif defined(_MSC_VER) && (_MSC_VER >= 1300) // #if defined(MY_CPU_ARM_OR_ARM64) #define LZMA_LOG_BSR // #endif #endif #endif // #include #ifdef LZMA_LOG_BSR #if defined(__clang__) \ || defined(__GNUC__) /* C code: : (30 - __builtin_clz(x)) gcc9/gcc10 for x64 /x86 : 30 - (bsr(x) xor 31) clang10 for x64 : 31 + (bsr(x) xor -32) */ #define MY_clz(x) ((unsigned)__builtin_clz(x)) // __lzcnt32 // __builtin_ia32_lzcnt_u32 #else // #if defined(_MSC_VER) #ifdef MY_CPU_ARM_OR_ARM64 #define MY_clz _CountLeadingZeros #else // if defined(MY_CPU_X86_OR_AMD64) // #define MY_clz __lzcnt // we can use lzcnt (unsupported by old CPU) // _BitScanReverse code is not optimal for some MSVC compilers #define BSR2_RET(pos, res) { unsigned long zz; _BitScanReverse(&zz, (pos)); zz--; \ res = (zz + zz) + (pos >> zz); } #endif // MY_CPU_X86_OR_AMD64 #endif // _MSC_VER #ifndef BSR2_RET #define BSR2_RET(pos, res) { unsigned zz = 30 - MY_clz(pos); \ res = (zz + zz) + (pos >> zz); } #endif unsigned GetPosSlot1(UInt32 pos); unsigned GetPosSlot1(UInt32 pos) { unsigned res; BSR2_RET(pos, res); return res; } #define GetPosSlot2(pos, res) { BSR2_RET(pos, res); } #define GetPosSlot(pos, res) { if (pos < 2) res = pos; else BSR2_RET(pos, res); } #else // ! LZMA_LOG_BSR #define kNumLogBits (11 + sizeof(size_t) / 8 * 3) #define kDicLogSizeMaxCompress ((kNumLogBits - 1) * 2 + 7) static void LzmaEnc_FastPosInit(Byte *g_FastPos) { unsigned slot; g_FastPos[0] = 0; g_FastPos[1] = 1; g_FastPos += 2; for (slot = 2; slot < kNumLogBits * 2; slot++) { size_t k = ((size_t)1 << ((slot >> 1) - 1)); size_t j; for (j = 0; j < k; j++) g_FastPos[j] = (Byte)slot; g_FastPos += k; } } /* we can use ((limit - pos) >> 31) only if (pos < ((UInt32)1 << 31)) */ /* #define BSR2_RET(pos, res) { unsigned zz = 6 + ((kNumLogBits - 1) & \ (0 - (((((UInt32)1 << (kNumLogBits + 6)) - 1) - pos) >> 31))); \ res = p->g_FastPos[pos >> zz] + (zz * 2); } */ /* #define BSR2_RET(pos, res) { unsigned zz = 6 + ((kNumLogBits - 1) & \ (0 - (((((UInt32)1 << (kNumLogBits)) - 1) - (pos >> 6)) >> 31))); \ res = p->g_FastPos[pos >> zz] + (zz * 2); } */ #define BSR2_RET(pos, res) { unsigned zz = (pos < (1 << (kNumLogBits + 6))) ? 6 : 6 + kNumLogBits - 1; \ res = p->g_FastPos[pos >> zz] + (zz * 2); } /* #define BSR2_RET(pos, res) { res = (pos < (1 << (kNumLogBits + 6))) ? \ p->g_FastPos[pos >> 6] + 12 : \ p->g_FastPos[pos >> (6 + kNumLogBits - 1)] + (6 + (kNumLogBits - 1)) * 2; } */ #define GetPosSlot1(pos) p->g_FastPos[pos] #define GetPosSlot2(pos, res) { BSR2_RET(pos, res); } #define GetPosSlot(pos, res) { if (pos < kNumFullDistances) res = p->g_FastPos[pos & (kNumFullDistances - 1)]; else BSR2_RET(pos, res); } #endif // LZMA_LOG_BSR #define LZMA_NUM_REPS 4 typedef UInt16 CState; typedef UInt16 CExtra; typedef struct { UInt32 price; CState state; CExtra extra; // 0 : normal // 1 : LIT : MATCH // > 1 : MATCH (extra-1) : LIT : REP0 (len) UInt32 len; UInt32 dist; UInt32 reps[LZMA_NUM_REPS]; } COptimal; // 18.06 #define kNumOpts (1 << 11) #define kPackReserve (kNumOpts * 8) // #define kNumOpts (1 << 12) // #define kPackReserve (1 + kNumOpts * 2) #define kNumLenToPosStates 4 #define kNumPosSlotBits 6 // #define kDicLogSizeMin 0 #define kDicLogSizeMax 32 #define kDistTableSizeMax (kDicLogSizeMax * 2) #define kNumAlignBits 4 #define kAlignTableSize (1 << kNumAlignBits) #define kAlignMask (kAlignTableSize - 1) #define kStartPosModelIndex 4 #define kEndPosModelIndex 14 #define kNumFullDistances (1 << (kEndPosModelIndex >> 1)) typedef #ifdef _LZMA_PROB32 UInt32 #else UInt16 #endif CLzmaProb; #define LZMA_PB_MAX 4 #define LZMA_LC_MAX 8 #define LZMA_LP_MAX 4 #define LZMA_NUM_PB_STATES_MAX (1 << LZMA_PB_MAX) #define kLenNumLowBits 3 #define kLenNumLowSymbols (1 << kLenNumLowBits) #define kLenNumHighBits 8 #define kLenNumHighSymbols (1 << kLenNumHighBits) #define kLenNumSymbolsTotal (kLenNumLowSymbols * 2 + kLenNumHighSymbols) #define LZMA_MATCH_LEN_MIN 2 #define LZMA_MATCH_LEN_MAX (LZMA_MATCH_LEN_MIN + kLenNumSymbolsTotal - 1) #define kNumStates 12 typedef struct { CLzmaProb low[LZMA_NUM_PB_STATES_MAX << (kLenNumLowBits + 1)]; CLzmaProb high[kLenNumHighSymbols]; } CLenEnc; typedef struct { unsigned tableSize; UInt32 prices[LZMA_NUM_PB_STATES_MAX][kLenNumSymbolsTotal]; // UInt32 prices1[LZMA_NUM_PB_STATES_MAX][kLenNumLowSymbols * 2]; // UInt32 prices2[kLenNumSymbolsTotal]; } CLenPriceEnc; #define GET_PRICE_LEN(p, posState, len) \ ((p)->prices[posState][(size_t)(len) - LZMA_MATCH_LEN_MIN]) /* #define GET_PRICE_LEN(p, posState, len) \ ((p)->prices2[(size_t)(len) - 2] + ((p)->prices1[posState][((len) - 2) & (kLenNumLowSymbols * 2 - 1)] & (((len) - 2 - kLenNumLowSymbols * 2) >> 9))) */ typedef struct { UInt32 range; unsigned cache; UInt64 low; UInt64 cacheSize; Byte *buf; Byte *bufLim; Byte *bufBase; ISeqOutStream *outStream; UInt64 processed; SRes res; } CRangeEnc; typedef struct { CLzmaProb *litProbs; unsigned state; UInt32 reps[LZMA_NUM_REPS]; CLzmaProb posAlignEncoder[1 << kNumAlignBits]; CLzmaProb isRep[kNumStates]; CLzmaProb isRepG0[kNumStates]; CLzmaProb isRepG1[kNumStates]; CLzmaProb isRepG2[kNumStates]; CLzmaProb isMatch[kNumStates][LZMA_NUM_PB_STATES_MAX]; CLzmaProb isRep0Long[kNumStates][LZMA_NUM_PB_STATES_MAX]; CLzmaProb posSlotEncoder[kNumLenToPosStates][1 << kNumPosSlotBits]; CLzmaProb posEncoders[kNumFullDistances]; CLenEnc lenProbs; CLenEnc repLenProbs; } CSaveState; typedef UInt32 CProbPrice; typedef struct { void *matchFinderObj; IMatchFinder2 matchFinder; unsigned optCur; unsigned optEnd; unsigned longestMatchLen; unsigned numPairs; UInt32 numAvail; unsigned state; unsigned numFastBytes; unsigned additionalOffset; UInt32 reps[LZMA_NUM_REPS]; unsigned lpMask, pbMask; CLzmaProb *litProbs; CRangeEnc rc; UInt32 backRes; unsigned lc, lp, pb; unsigned lclp; BoolInt fastMode; BoolInt writeEndMark; BoolInt finished; BoolInt multiThread; BoolInt needInit; // BoolInt _maxMode; UInt64 nowPos64; unsigned matchPriceCount; // unsigned alignPriceCount; int repLenEncCounter; unsigned distTableSize; UInt32 dictSize; SRes result; #ifndef _7ZIP_ST BoolInt mtMode; // begin of CMatchFinderMt is used in LZ thread CMatchFinderMt matchFinderMt; // end of CMatchFinderMt is used in BT and HASH threads // #else // CMatchFinder matchFinderBase; #endif CMatchFinder matchFinderBase; // we suppose that we have 8-bytes alignment after CMatchFinder #ifndef _7ZIP_ST Byte pad[128]; #endif // LZ thread CProbPrice ProbPrices[kBitModelTotal >> kNumMoveReducingBits]; // we want {len , dist} pairs to be 8-bytes aligned in matches array UInt32 matches[LZMA_MATCH_LEN_MAX * 2 + 2]; // we want 8-bytes alignment here UInt32 alignPrices[kAlignTableSize]; UInt32 posSlotPrices[kNumLenToPosStates][kDistTableSizeMax]; UInt32 distancesPrices[kNumLenToPosStates][kNumFullDistances]; CLzmaProb posAlignEncoder[1 << kNumAlignBits]; CLzmaProb isRep[kNumStates]; CLzmaProb isRepG0[kNumStates]; CLzmaProb isRepG1[kNumStates]; CLzmaProb isRepG2[kNumStates]; CLzmaProb isMatch[kNumStates][LZMA_NUM_PB_STATES_MAX]; CLzmaProb isRep0Long[kNumStates][LZMA_NUM_PB_STATES_MAX]; CLzmaProb posSlotEncoder[kNumLenToPosStates][1 << kNumPosSlotBits]; CLzmaProb posEncoders[kNumFullDistances]; CLenEnc lenProbs; CLenEnc repLenProbs; #ifndef LZMA_LOG_BSR Byte g_FastPos[1 << kNumLogBits]; #endif CLenPriceEnc lenEnc; CLenPriceEnc repLenEnc; COptimal opt[kNumOpts]; CSaveState saveState; // BoolInt mf_Failure; #ifndef _7ZIP_ST Byte pad2[128]; #endif } CLzmaEnc; #define MFB (p->matchFinderBase) /* #ifndef _7ZIP_ST #define MFB (p->matchFinderMt.MatchFinder) #endif */ #define COPY_ARR(dest, src, arr) memcpy(dest->arr, src->arr, sizeof(src->arr)); void LzmaEnc_SaveState(CLzmaEncHandle pp) { CLzmaEnc *p = (CLzmaEnc *)pp; CSaveState *dest = &p->saveState; dest->state = p->state; dest->lenProbs = p->lenProbs; dest->repLenProbs = p->repLenProbs; COPY_ARR(dest, p, reps); COPY_ARR(dest, p, posAlignEncoder); COPY_ARR(dest, p, isRep); COPY_ARR(dest, p, isRepG0); COPY_ARR(dest, p, isRepG1); COPY_ARR(dest, p, isRepG2); COPY_ARR(dest, p, isMatch); COPY_ARR(dest, p, isRep0Long); COPY_ARR(dest, p, posSlotEncoder); COPY_ARR(dest, p, posEncoders); memcpy(dest->litProbs, p->litProbs, ((UInt32)0x300 << p->lclp) * sizeof(CLzmaProb)); } void LzmaEnc_RestoreState(CLzmaEncHandle pp) { CLzmaEnc *dest = (CLzmaEnc *)pp; const CSaveState *p = &dest->saveState; dest->state = p->state; dest->lenProbs = p->lenProbs; dest->repLenProbs = p->repLenProbs; COPY_ARR(dest, p, reps); COPY_ARR(dest, p, posAlignEncoder); COPY_ARR(dest, p, isRep); COPY_ARR(dest, p, isRepG0); COPY_ARR(dest, p, isRepG1); COPY_ARR(dest, p, isRepG2); COPY_ARR(dest, p, isMatch); COPY_ARR(dest, p, isRep0Long); COPY_ARR(dest, p, posSlotEncoder); COPY_ARR(dest, p, posEncoders); memcpy(dest->litProbs, p->litProbs, ((UInt32)0x300 << dest->lclp) * sizeof(CLzmaProb)); } SRes LzmaEnc_SetProps(CLzmaEncHandle pp, const CLzmaEncProps *props2) { CLzmaEnc *p = (CLzmaEnc *)pp; CLzmaEncProps props = *props2; LzmaEncProps_Normalize(&props); if (props.lc > LZMA_LC_MAX || props.lp > LZMA_LP_MAX || props.pb > LZMA_PB_MAX) return SZ_ERROR_PARAM; if (props.dictSize > kLzmaMaxHistorySize) props.dictSize = kLzmaMaxHistorySize; #ifndef LZMA_LOG_BSR { const UInt64 dict64 = props.dictSize; if (dict64 > ((UInt64)1 << kDicLogSizeMaxCompress)) return SZ_ERROR_PARAM; } #endif p->dictSize = props.dictSize; { unsigned fb = (unsigned)props.fb; if (fb < 5) fb = 5; if (fb > LZMA_MATCH_LEN_MAX) fb = LZMA_MATCH_LEN_MAX; p->numFastBytes = fb; } p->lc = (unsigned)props.lc; p->lp = (unsigned)props.lp; p->pb = (unsigned)props.pb; p->fastMode = (props.algo == 0); // p->_maxMode = True; MFB.btMode = (Byte)(props.btMode ? 1 : 0); { unsigned numHashBytes = 4; if (props.btMode) { if (props.numHashBytes < 2) numHashBytes = 2; else if (props.numHashBytes < 4) numHashBytes = (unsigned)props.numHashBytes; } if (props.numHashBytes >= 5) numHashBytes = 5; MFB.numHashBytes = numHashBytes; } MFB.cutValue = props.mc; p->writeEndMark = (BoolInt)props.writeEndMark; #ifndef _7ZIP_ST /* if (newMultiThread != _multiThread) { ReleaseMatchFinder(); _multiThread = newMultiThread; } */ p->multiThread = (props.numThreads > 1); p->matchFinderMt.btSync.affinity = p->matchFinderMt.hashSync.affinity = props.affinity; #endif return SZ_OK; } void LzmaEnc_SetDataSize(CLzmaEncHandle pp, UInt64 expectedDataSiize) { CLzmaEnc *p = (CLzmaEnc *)pp; MFB.expectedDataSize = expectedDataSiize; } #define kState_Start 0 #define kState_LitAfterMatch 4 #define kState_LitAfterRep 5 #define kState_MatchAfterLit 7 #define kState_RepAfterLit 8 static const Byte kLiteralNextStates[kNumStates] = {0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 4, 5}; static const Byte kMatchNextStates[kNumStates] = {7, 7, 7, 7, 7, 7, 7, 10, 10, 10, 10, 10}; static const Byte kRepNextStates[kNumStates] = {8, 8, 8, 8, 8, 8, 8, 11, 11, 11, 11, 11}; static const Byte kShortRepNextStates[kNumStates]= {9, 9, 9, 9, 9, 9, 9, 11, 11, 11, 11, 11}; #define IsLitState(s) ((s) < 7) #define GetLenToPosState2(len) (((len) < kNumLenToPosStates - 1) ? (len) : kNumLenToPosStates - 1) #define GetLenToPosState(len) (((len) < kNumLenToPosStates + 1) ? (len) - 2 : kNumLenToPosStates - 1) #define kInfinityPrice (1 << 30) static void RangeEnc_Construct(CRangeEnc *p) { p->outStream = NULL; p->bufBase = NULL; } #define RangeEnc_GetProcessed(p) ( (p)->processed + (size_t)((p)->buf - (p)->bufBase) + (p)->cacheSize) #define RangeEnc_GetProcessed_sizet(p) ((size_t)(p)->processed + (size_t)((p)->buf - (p)->bufBase) + (size_t)(p)->cacheSize) #define RC_BUF_SIZE (1 << 16) static int RangeEnc_Alloc(CRangeEnc *p, ISzAllocPtr alloc) { if (!p->bufBase) { p->bufBase = (Byte *)ISzAlloc_Alloc(alloc, RC_BUF_SIZE); if (!p->bufBase) return 0; p->bufLim = p->bufBase + RC_BUF_SIZE; } return 1; } static void RangeEnc_Free(CRangeEnc *p, ISzAllocPtr alloc) { ISzAlloc_Free(alloc, p->bufBase); p->bufBase = NULL; } static void RangeEnc_Init(CRangeEnc *p) { p->range = 0xFFFFFFFF; p->cache = 0; p->low = 0; p->cacheSize = 0; p->buf = p->bufBase; p->processed = 0; p->res = SZ_OK; } MY_NO_INLINE static void RangeEnc_FlushStream(CRangeEnc *p) { const size_t num = (size_t)(p->buf - p->bufBase); if (p->res == SZ_OK) { if (num != ISeqOutStream_Write(p->outStream, p->bufBase, num)) p->res = SZ_ERROR_WRITE; } p->processed += num; p->buf = p->bufBase; } MY_NO_INLINE static void MY_FAST_CALL RangeEnc_ShiftLow(CRangeEnc *p) { UInt32 low = (UInt32)p->low; unsigned high = (unsigned)(p->low >> 32); p->low = (UInt32)(low << 8); if (low < (UInt32)0xFF000000 || high != 0) { { Byte *buf = p->buf; *buf++ = (Byte)(p->cache + high); p->cache = (unsigned)(low >> 24); p->buf = buf; if (buf == p->bufLim) RangeEnc_FlushStream(p); if (p->cacheSize == 0) return; } high += 0xFF; for (;;) { Byte *buf = p->buf; *buf++ = (Byte)(high); p->buf = buf; if (buf == p->bufLim) RangeEnc_FlushStream(p); if (--p->cacheSize == 0) return; } } p->cacheSize++; } static void RangeEnc_FlushData(CRangeEnc *p) { int i; for (i = 0; i < 5; i++) RangeEnc_ShiftLow(p); } #define RC_NORM(p) if (range < kTopValue) { range <<= 8; RangeEnc_ShiftLow(p); } #define RC_BIT_PRE(p, prob) \ ttt = *(prob); \ newBound = (range >> kNumBitModelTotalBits) * ttt; // #define _LZMA_ENC_USE_BRANCH #ifdef _LZMA_ENC_USE_BRANCH #define RC_BIT(p, prob, bit) { \ RC_BIT_PRE(p, prob) \ if (bit == 0) { range = newBound; ttt += (kBitModelTotal - ttt) >> kNumMoveBits; } \ else { (p)->low += newBound; range -= newBound; ttt -= ttt >> kNumMoveBits; } \ *(prob) = (CLzmaProb)ttt; \ RC_NORM(p) \ } #else #define RC_BIT(p, prob, bit) { \ UInt32 mask; \ RC_BIT_PRE(p, prob) \ mask = 0 - (UInt32)bit; \ range &= mask; \ mask &= newBound; \ range -= mask; \ (p)->low += mask; \ mask = (UInt32)bit - 1; \ range += newBound & mask; \ mask &= (kBitModelTotal - ((1 << kNumMoveBits) - 1)); \ mask += ((1 << kNumMoveBits) - 1); \ ttt += (UInt32)((Int32)(mask - ttt) >> kNumMoveBits); \ *(prob) = (CLzmaProb)ttt; \ RC_NORM(p) \ } #endif #define RC_BIT_0_BASE(p, prob) \ range = newBound; *(prob) = (CLzmaProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits)); #define RC_BIT_1_BASE(p, prob) \ range -= newBound; (p)->low += newBound; *(prob) = (CLzmaProb)(ttt - (ttt >> kNumMoveBits)); \ #define RC_BIT_0(p, prob) \ RC_BIT_0_BASE(p, prob) \ RC_NORM(p) #define RC_BIT_1(p, prob) \ RC_BIT_1_BASE(p, prob) \ RC_NORM(p) static void RangeEnc_EncodeBit_0(CRangeEnc *p, CLzmaProb *prob) { UInt32 range, ttt, newBound; range = p->range; RC_BIT_PRE(p, prob) RC_BIT_0(p, prob) p->range = range; } static void LitEnc_Encode(CRangeEnc *p, CLzmaProb *probs, UInt32 sym) { UInt32 range = p->range; sym |= 0x100; do { UInt32 ttt, newBound; // RangeEnc_EncodeBit(p, probs + (sym >> 8), (sym >> 7) & 1); CLzmaProb *prob = probs + (sym >> 8); UInt32 bit = (sym >> 7) & 1; sym <<= 1; RC_BIT(p, prob, bit); } while (sym < 0x10000); p->range = range; } static void LitEnc_EncodeMatched(CRangeEnc *p, CLzmaProb *probs, UInt32 sym, UInt32 matchByte) { UInt32 range = p->range; UInt32 offs = 0x100; sym |= 0x100; do { UInt32 ttt, newBound; CLzmaProb *prob; UInt32 bit; matchByte <<= 1; // RangeEnc_EncodeBit(p, probs + (offs + (matchByte & offs) + (sym >> 8)), (sym >> 7) & 1); prob = probs + (offs + (matchByte & offs) + (sym >> 8)); bit = (sym >> 7) & 1; sym <<= 1; offs &= ~(matchByte ^ sym); RC_BIT(p, prob, bit); } while (sym < 0x10000); p->range = range; } static void LzmaEnc_InitPriceTables(CProbPrice *ProbPrices) { UInt32 i; for (i = 0; i < (kBitModelTotal >> kNumMoveReducingBits); i++) { const unsigned kCyclesBits = kNumBitPriceShiftBits; UInt32 w = (i << kNumMoveReducingBits) + (1 << (kNumMoveReducingBits - 1)); unsigned bitCount = 0; unsigned j; for (j = 0; j < kCyclesBits; j++) { w = w * w; bitCount <<= 1; while (w >= ((UInt32)1 << 16)) { w >>= 1; bitCount++; } } ProbPrices[i] = (CProbPrice)(((unsigned)kNumBitModelTotalBits << kCyclesBits) - 15 - bitCount); // printf("\n%3d: %5d", i, ProbPrices[i]); } } #define GET_PRICE(prob, bit) \ p->ProbPrices[((prob) ^ (unsigned)(((-(int)(bit))) & (kBitModelTotal - 1))) >> kNumMoveReducingBits]; #define GET_PRICEa(prob, bit) \ ProbPrices[((prob) ^ (unsigned)((-((int)(bit))) & (kBitModelTotal - 1))) >> kNumMoveReducingBits]; #define GET_PRICE_0(prob) p->ProbPrices[(prob) >> kNumMoveReducingBits] #define GET_PRICE_1(prob) p->ProbPrices[((prob) ^ (kBitModelTotal - 1)) >> kNumMoveReducingBits] #define GET_PRICEa_0(prob) ProbPrices[(prob) >> kNumMoveReducingBits] #define GET_PRICEa_1(prob) ProbPrices[((prob) ^ (kBitModelTotal - 1)) >> kNumMoveReducingBits] static UInt32 LitEnc_GetPrice(const CLzmaProb *probs, UInt32 sym, const CProbPrice *ProbPrices) { UInt32 price = 0; sym |= 0x100; do { unsigned bit = sym & 1; sym >>= 1; price += GET_PRICEa(probs[sym], bit); } while (sym >= 2); return price; } static UInt32 LitEnc_Matched_GetPrice(const CLzmaProb *probs, UInt32 sym, UInt32 matchByte, const CProbPrice *ProbPrices) { UInt32 price = 0; UInt32 offs = 0x100; sym |= 0x100; do { matchByte <<= 1; price += GET_PRICEa(probs[offs + (matchByte & offs) + (sym >> 8)], (sym >> 7) & 1); sym <<= 1; offs &= ~(matchByte ^ sym); } while (sym < 0x10000); return price; } static void RcTree_ReverseEncode(CRangeEnc *rc, CLzmaProb *probs, unsigned numBits, unsigned sym) { UInt32 range = rc->range; unsigned m = 1; do { UInt32 ttt, newBound; unsigned bit = sym & 1; // RangeEnc_EncodeBit(rc, probs + m, bit); sym >>= 1; RC_BIT(rc, probs + m, bit); m = (m << 1) | bit; } while (--numBits); rc->range = range; } static void LenEnc_Init(CLenEnc *p) { unsigned i; for (i = 0; i < (LZMA_NUM_PB_STATES_MAX << (kLenNumLowBits + 1)); i++) p->low[i] = kProbInitValue; for (i = 0; i < kLenNumHighSymbols; i++) p->high[i] = kProbInitValue; } static void LenEnc_Encode(CLenEnc *p, CRangeEnc *rc, unsigned sym, unsigned posState) { UInt32 range, ttt, newBound; CLzmaProb *probs = p->low; range = rc->range; RC_BIT_PRE(rc, probs); if (sym >= kLenNumLowSymbols) { RC_BIT_1(rc, probs); probs += kLenNumLowSymbols; RC_BIT_PRE(rc, probs); if (sym >= kLenNumLowSymbols * 2) { RC_BIT_1(rc, probs); rc->range = range; // RcTree_Encode(rc, p->high, kLenNumHighBits, sym - kLenNumLowSymbols * 2); LitEnc_Encode(rc, p->high, sym - kLenNumLowSymbols * 2); return; } sym -= kLenNumLowSymbols; } // RcTree_Encode(rc, probs + (posState << kLenNumLowBits), kLenNumLowBits, sym); { unsigned m; unsigned bit; RC_BIT_0(rc, probs); probs += (posState << (1 + kLenNumLowBits)); bit = (sym >> 2) ; RC_BIT(rc, probs + 1, bit); m = (1 << 1) + bit; bit = (sym >> 1) & 1; RC_BIT(rc, probs + m, bit); m = (m << 1) + bit; bit = sym & 1; RC_BIT(rc, probs + m, bit); rc->range = range; } } static void SetPrices_3(const CLzmaProb *probs, UInt32 startPrice, UInt32 *prices, const CProbPrice *ProbPrices) { unsigned i; for (i = 0; i < 8; i += 2) { UInt32 price = startPrice; UInt32 prob; price += GET_PRICEa(probs[1 ], (i >> 2)); price += GET_PRICEa(probs[2 + (i >> 2)], (i >> 1) & 1); prob = probs[4 + (i >> 1)]; prices[i ] = price + GET_PRICEa_0(prob); prices[i + 1] = price + GET_PRICEa_1(prob); } } MY_NO_INLINE static void MY_FAST_CALL LenPriceEnc_UpdateTables( CLenPriceEnc *p, unsigned numPosStates, const CLenEnc *enc, const CProbPrice *ProbPrices) { UInt32 b; { unsigned prob = enc->low[0]; UInt32 a, c; unsigned posState; b = GET_PRICEa_1(prob); a = GET_PRICEa_0(prob); c = b + GET_PRICEa_0(enc->low[kLenNumLowSymbols]); for (posState = 0; posState < numPosStates; posState++) { UInt32 *prices = p->prices[posState]; const CLzmaProb *probs = enc->low + (posState << (1 + kLenNumLowBits)); SetPrices_3(probs, a, prices, ProbPrices); SetPrices_3(probs + kLenNumLowSymbols, c, prices + kLenNumLowSymbols, ProbPrices); } } /* { unsigned i; UInt32 b; a = GET_PRICEa_0(enc->low[0]); for (i = 0; i < kLenNumLowSymbols; i++) p->prices2[i] = a; a = GET_PRICEa_1(enc->low[0]); b = a + GET_PRICEa_0(enc->low[kLenNumLowSymbols]); for (i = kLenNumLowSymbols; i < kLenNumLowSymbols * 2; i++) p->prices2[i] = b; a += GET_PRICEa_1(enc->low[kLenNumLowSymbols]); } */ // p->counter = numSymbols; // p->counter = 64; { unsigned i = p->tableSize; if (i > kLenNumLowSymbols * 2) { const CLzmaProb *probs = enc->high; UInt32 *prices = p->prices[0] + kLenNumLowSymbols * 2; i -= kLenNumLowSymbols * 2 - 1; i >>= 1; b += GET_PRICEa_1(enc->low[kLenNumLowSymbols]); do { /* p->prices2[i] = a + // RcTree_GetPrice(enc->high, kLenNumHighBits, i - kLenNumLowSymbols * 2, ProbPrices); LitEnc_GetPrice(probs, i - kLenNumLowSymbols * 2, ProbPrices); */ // UInt32 price = a + RcTree_GetPrice(probs, kLenNumHighBits - 1, sym, ProbPrices); unsigned sym = --i + (1 << (kLenNumHighBits - 1)); UInt32 price = b; do { unsigned bit = sym & 1; sym >>= 1; price += GET_PRICEa(probs[sym], bit); } while (sym >= 2); { unsigned prob = probs[(size_t)i + (1 << (kLenNumHighBits - 1))]; prices[(size_t)i * 2 ] = price + GET_PRICEa_0(prob); prices[(size_t)i * 2 + 1] = price + GET_PRICEa_1(prob); } } while (i); { unsigned posState; size_t num = (p->tableSize - kLenNumLowSymbols * 2) * sizeof(p->prices[0][0]); for (posState = 1; posState < numPosStates; posState++) memcpy(p->prices[posState] + kLenNumLowSymbols * 2, p->prices[0] + kLenNumLowSymbols * 2, num); } } } } /* #ifdef SHOW_STAT g_STAT_OFFSET += num; printf("\n MovePos %u", num); #endif */ #define MOVE_POS(p, num) { \ p->additionalOffset += (num); \ p->matchFinder.Skip(p->matchFinderObj, (UInt32)(num)); } static unsigned ReadMatchDistances(CLzmaEnc *p, unsigned *numPairsRes) { unsigned numPairs; p->additionalOffset++; p->numAvail = p->matchFinder.GetNumAvailableBytes(p->matchFinderObj); { const UInt32 *d = p->matchFinder.GetMatches(p->matchFinderObj, p->matches); // if (!d) { p->mf_Failure = True; *numPairsRes = 0; return 0; } numPairs = (unsigned)(d - p->matches); } *numPairsRes = numPairs; #ifdef SHOW_STAT printf("\n i = %u numPairs = %u ", g_STAT_OFFSET, numPairs / 2); g_STAT_OFFSET++; { unsigned i; for (i = 0; i < numPairs; i += 2) printf("%2u %6u | ", p->matches[i], p->matches[i + 1]); } #endif if (numPairs == 0) return 0; { const unsigned len = p->matches[(size_t)numPairs - 2]; if (len != p->numFastBytes) return len; { UInt32 numAvail = p->numAvail; if (numAvail > LZMA_MATCH_LEN_MAX) numAvail = LZMA_MATCH_LEN_MAX; { const Byte *p1 = p->matchFinder.GetPointerToCurrentPos(p->matchFinderObj) - 1; const Byte *p2 = p1 + len; const ptrdiff_t dif = (ptrdiff_t)-1 - (ptrdiff_t)p->matches[(size_t)numPairs - 1]; const Byte *lim = p1 + numAvail; for (; p2 != lim && *p2 == p2[dif]; p2++) {} return (unsigned)(p2 - p1); } } } } #define MARK_LIT ((UInt32)(Int32)-1) #define MakeAs_Lit(p) { (p)->dist = MARK_LIT; (p)->extra = 0; } #define MakeAs_ShortRep(p) { (p)->dist = 0; (p)->extra = 0; } #define IsShortRep(p) ((p)->dist == 0) #define GetPrice_ShortRep(p, state, posState) \ ( GET_PRICE_0(p->isRepG0[state]) + GET_PRICE_0(p->isRep0Long[state][posState])) #define GetPrice_Rep_0(p, state, posState) ( \ GET_PRICE_1(p->isMatch[state][posState]) \ + GET_PRICE_1(p->isRep0Long[state][posState])) \ + GET_PRICE_1(p->isRep[state]) \ + GET_PRICE_0(p->isRepG0[state]) MY_FORCE_INLINE static UInt32 GetPrice_PureRep(const CLzmaEnc *p, unsigned repIndex, size_t state, size_t posState) { UInt32 price; UInt32 prob = p->isRepG0[state]; if (repIndex == 0) { price = GET_PRICE_0(prob); price += GET_PRICE_1(p->isRep0Long[state][posState]); } else { price = GET_PRICE_1(prob); prob = p->isRepG1[state]; if (repIndex == 1) price += GET_PRICE_0(prob); else { price += GET_PRICE_1(prob); price += GET_PRICE(p->isRepG2[state], repIndex - 2); } } return price; } static unsigned Backward(CLzmaEnc *p, unsigned cur) { unsigned wr = cur + 1; p->optEnd = wr; for (;;) { UInt32 dist = p->opt[cur].dist; unsigned len = (unsigned)p->opt[cur].len; unsigned extra = (unsigned)p->opt[cur].extra; cur -= len; if (extra) { wr--; p->opt[wr].len = (UInt32)len; cur -= extra; len = extra; if (extra == 1) { p->opt[wr].dist = dist; dist = MARK_LIT; } else { p->opt[wr].dist = 0; len--; wr--; p->opt[wr].dist = MARK_LIT; p->opt[wr].len = 1; } } if (cur == 0) { p->backRes = dist; p->optCur = wr; return len; } wr--; p->opt[wr].dist = dist; p->opt[wr].len = (UInt32)len; } } #define LIT_PROBS(pos, prevByte) \ (p->litProbs + (UInt32)3 * (((((pos) << 8) + (prevByte)) & p->lpMask) << p->lc)) static unsigned GetOptimum(CLzmaEnc *p, UInt32 position) { unsigned last, cur; UInt32 reps[LZMA_NUM_REPS]; unsigned repLens[LZMA_NUM_REPS]; UInt32 *matches; { UInt32 numAvail; unsigned numPairs, mainLen, repMaxIndex, i, posState; UInt32 matchPrice, repMatchPrice; const Byte *data; Byte curByte, matchByte; p->optCur = p->optEnd = 0; if (p->additionalOffset == 0) mainLen = ReadMatchDistances(p, &numPairs); else { mainLen = p->longestMatchLen; numPairs = p->numPairs; } numAvail = p->numAvail; if (numAvail < 2) { p->backRes = MARK_LIT; return 1; } if (numAvail > LZMA_MATCH_LEN_MAX) numAvail = LZMA_MATCH_LEN_MAX; data = p->matchFinder.GetPointerToCurrentPos(p->matchFinderObj) - 1; repMaxIndex = 0; for (i = 0; i < LZMA_NUM_REPS; i++) { unsigned len; const Byte *data2; reps[i] = p->reps[i]; data2 = data - reps[i]; if (data[0] != data2[0] || data[1] != data2[1]) { repLens[i] = 0; continue; } for (len = 2; len < numAvail && data[len] == data2[len]; len++) {} repLens[i] = len; if (len > repLens[repMaxIndex]) repMaxIndex = i; if (len == LZMA_MATCH_LEN_MAX) // 21.03 : optimization break; } if (repLens[repMaxIndex] >= p->numFastBytes) { unsigned len; p->backRes = (UInt32)repMaxIndex; len = repLens[repMaxIndex]; MOVE_POS(p, len - 1) return len; } matches = p->matches; #define MATCHES matches // #define MATCHES p->matches if (mainLen >= p->numFastBytes) { p->backRes = MATCHES[(size_t)numPairs - 1] + LZMA_NUM_REPS; MOVE_POS(p, mainLen - 1) return mainLen; } curByte = *data; matchByte = *(data - reps[0]); last = repLens[repMaxIndex]; if (last <= mainLen) last = mainLen; if (last < 2 && curByte != matchByte) { p->backRes = MARK_LIT; return 1; } p->opt[0].state = (CState)p->state; posState = (position & p->pbMask); { const CLzmaProb *probs = LIT_PROBS(position, *(data - 1)); p->opt[1].price = GET_PRICE_0(p->isMatch[p->state][posState]) + (!IsLitState(p->state) ? LitEnc_Matched_GetPrice(probs, curByte, matchByte, p->ProbPrices) : LitEnc_GetPrice(probs, curByte, p->ProbPrices)); } MakeAs_Lit(&p->opt[1]); matchPrice = GET_PRICE_1(p->isMatch[p->state][posState]); repMatchPrice = matchPrice + GET_PRICE_1(p->isRep[p->state]); // 18.06 if (matchByte == curByte && repLens[0] == 0) { UInt32 shortRepPrice = repMatchPrice + GetPrice_ShortRep(p, p->state, posState); if (shortRepPrice < p->opt[1].price) { p->opt[1].price = shortRepPrice; MakeAs_ShortRep(&p->opt[1]); } if (last < 2) { p->backRes = p->opt[1].dist; return 1; } } p->opt[1].len = 1; p->opt[0].reps[0] = reps[0]; p->opt[0].reps[1] = reps[1]; p->opt[0].reps[2] = reps[2]; p->opt[0].reps[3] = reps[3]; // ---------- REP ---------- for (i = 0; i < LZMA_NUM_REPS; i++) { unsigned repLen = repLens[i]; UInt32 price; if (repLen < 2) continue; price = repMatchPrice + GetPrice_PureRep(p, i, p->state, posState); do { UInt32 price2 = price + GET_PRICE_LEN(&p->repLenEnc, posState, repLen); COptimal *opt = &p->opt[repLen]; if (price2 < opt->price) { opt->price = price2; opt->len = (UInt32)repLen; opt->dist = (UInt32)i; opt->extra = 0; } } while (--repLen >= 2); } // ---------- MATCH ---------- { unsigned len = repLens[0] + 1; if (len <= mainLen) { unsigned offs = 0; UInt32 normalMatchPrice = matchPrice + GET_PRICE_0(p->isRep[p->state]); if (len < 2) len = 2; else while (len > MATCHES[offs]) offs += 2; for (; ; len++) { COptimal *opt; UInt32 dist = MATCHES[(size_t)offs + 1]; UInt32 price = normalMatchPrice + GET_PRICE_LEN(&p->lenEnc, posState, len); unsigned lenToPosState = GetLenToPosState(len); if (dist < kNumFullDistances) price += p->distancesPrices[lenToPosState][dist & (kNumFullDistances - 1)]; else { unsigned slot; GetPosSlot2(dist, slot); price += p->alignPrices[dist & kAlignMask]; price += p->posSlotPrices[lenToPosState][slot]; } opt = &p->opt[len]; if (price < opt->price) { opt->price = price; opt->len = (UInt32)len; opt->dist = dist + LZMA_NUM_REPS; opt->extra = 0; } if (len == MATCHES[offs]) { offs += 2; if (offs == numPairs) break; } } } } cur = 0; #ifdef SHOW_STAT2 /* if (position >= 0) */ { unsigned i; printf("\n pos = %4X", position); for (i = cur; i <= last; i++) printf("\nprice[%4X] = %u", position - cur + i, p->opt[i].price); } #endif } // ---------- Optimal Parsing ---------- for (;;) { unsigned numAvail; UInt32 numAvailFull; unsigned newLen, numPairs, prev, state, posState, startLen; UInt32 litPrice, matchPrice, repMatchPrice; BoolInt nextIsLit; Byte curByte, matchByte; const Byte *data; COptimal *curOpt, *nextOpt; if (++cur == last) break; // 18.06 if (cur >= kNumOpts - 64) { unsigned j, best; UInt32 price = p->opt[cur].price; best = cur; for (j = cur + 1; j <= last; j++) { UInt32 price2 = p->opt[j].price; if (price >= price2) { price = price2; best = j; } } { unsigned delta = best - cur; if (delta != 0) { MOVE_POS(p, delta); } } cur = best; break; } newLen = ReadMatchDistances(p, &numPairs); if (newLen >= p->numFastBytes) { p->numPairs = numPairs; p->longestMatchLen = newLen; break; } curOpt = &p->opt[cur]; position++; // we need that check here, if skip_items in p->opt are possible /* if (curOpt->price >= kInfinityPrice) continue; */ prev = cur - curOpt->len; if (curOpt->len == 1) { state = (unsigned)p->opt[prev].state; if (IsShortRep(curOpt)) state = kShortRepNextStates[state]; else state = kLiteralNextStates[state]; } else { const COptimal *prevOpt; UInt32 b0; UInt32 dist = curOpt->dist; if (curOpt->extra) { prev -= (unsigned)curOpt->extra; state = kState_RepAfterLit; if (curOpt->extra == 1) state = (dist < LZMA_NUM_REPS ? kState_RepAfterLit : kState_MatchAfterLit); } else { state = (unsigned)p->opt[prev].state; if (dist < LZMA_NUM_REPS) state = kRepNextStates[state]; else state = kMatchNextStates[state]; } prevOpt = &p->opt[prev]; b0 = prevOpt->reps[0]; if (dist < LZMA_NUM_REPS) { if (dist == 0) { reps[0] = b0; reps[1] = prevOpt->reps[1]; reps[2] = prevOpt->reps[2]; reps[3] = prevOpt->reps[3]; } else { reps[1] = b0; b0 = prevOpt->reps[1]; if (dist == 1) { reps[0] = b0; reps[2] = prevOpt->reps[2]; reps[3] = prevOpt->reps[3]; } else { reps[2] = b0; reps[0] = prevOpt->reps[dist]; reps[3] = prevOpt->reps[dist ^ 1]; } } } else { reps[0] = (dist - LZMA_NUM_REPS + 1); reps[1] = b0; reps[2] = prevOpt->reps[1]; reps[3] = prevOpt->reps[2]; } } curOpt->state = (CState)state; curOpt->reps[0] = reps[0]; curOpt->reps[1] = reps[1]; curOpt->reps[2] = reps[2]; curOpt->reps[3] = reps[3]; data = p->matchFinder.GetPointerToCurrentPos(p->matchFinderObj) - 1; curByte = *data; matchByte = *(data - reps[0]); posState = (position & p->pbMask); /* The order of Price checks: < LIT <= SHORT_REP < LIT : REP_0 < REP [ : LIT : REP_0 ] < MATCH [ : LIT : REP_0 ] */ { UInt32 curPrice = curOpt->price; unsigned prob = p->isMatch[state][posState]; matchPrice = curPrice + GET_PRICE_1(prob); litPrice = curPrice + GET_PRICE_0(prob); } nextOpt = &p->opt[(size_t)cur + 1]; nextIsLit = False; // here we can allow skip_items in p->opt, if we don't check (nextOpt->price < kInfinityPrice) // 18.new.06 if ((nextOpt->price < kInfinityPrice // && !IsLitState(state) && matchByte == curByte) || litPrice > nextOpt->price ) litPrice = 0; else { const CLzmaProb *probs = LIT_PROBS(position, *(data - 1)); litPrice += (!IsLitState(state) ? LitEnc_Matched_GetPrice(probs, curByte, matchByte, p->ProbPrices) : LitEnc_GetPrice(probs, curByte, p->ProbPrices)); if (litPrice < nextOpt->price) { nextOpt->price = litPrice; nextOpt->len = 1; MakeAs_Lit(nextOpt); nextIsLit = True; } } repMatchPrice = matchPrice + GET_PRICE_1(p->isRep[state]); numAvailFull = p->numAvail; { unsigned temp = kNumOpts - 1 - cur; if (numAvailFull > temp) numAvailFull = (UInt32)temp; } // 18.06 // ---------- SHORT_REP ---------- if (IsLitState(state)) // 18.new if (matchByte == curByte) if (repMatchPrice < nextOpt->price) // 18.new // if (numAvailFull < 2 || data[1] != *(data - reps[0] + 1)) if ( // nextOpt->price >= kInfinityPrice || nextOpt->len < 2 // we can check nextOpt->len, if skip items are not allowed in p->opt || (nextOpt->dist != 0 // && nextOpt->extra <= 1 // 17.old ) ) { UInt32 shortRepPrice = repMatchPrice + GetPrice_ShortRep(p, state, posState); // if (shortRepPrice <= nextOpt->price) // 17.old if (shortRepPrice < nextOpt->price) // 18.new { nextOpt->price = shortRepPrice; nextOpt->len = 1; MakeAs_ShortRep(nextOpt); nextIsLit = False; } } if (numAvailFull < 2) continue; numAvail = (numAvailFull <= p->numFastBytes ? numAvailFull : p->numFastBytes); // numAvail <= p->numFastBytes // ---------- LIT : REP_0 ---------- if (!nextIsLit && litPrice != 0 // 18.new && matchByte != curByte && numAvailFull > 2) { const Byte *data2 = data - reps[0]; if (data[1] == data2[1] && data[2] == data2[2]) { unsigned len; unsigned limit = p->numFastBytes + 1; if (limit > numAvailFull) limit = numAvailFull; for (len = 3; len < limit && data[len] == data2[len]; len++) {} { unsigned state2 = kLiteralNextStates[state]; unsigned posState2 = (position + 1) & p->pbMask; UInt32 price = litPrice + GetPrice_Rep_0(p, state2, posState2); { unsigned offset = cur + len; if (last < offset) last = offset; // do { UInt32 price2; COptimal *opt; len--; // price2 = price + GetPrice_Len_Rep_0(p, len, state2, posState2); price2 = price + GET_PRICE_LEN(&p->repLenEnc, posState2, len); opt = &p->opt[offset]; // offset--; if (price2 < opt->price) { opt->price = price2; opt->len = (UInt32)len; opt->dist = 0; opt->extra = 1; } } // while (len >= 3); } } } } startLen = 2; /* speed optimization */ { // ---------- REP ---------- unsigned repIndex = 0; // 17.old // unsigned repIndex = IsLitState(state) ? 0 : 1; // 18.notused for (; repIndex < LZMA_NUM_REPS; repIndex++) { unsigned len; UInt32 price; const Byte *data2 = data - reps[repIndex]; if (data[0] != data2[0] || data[1] != data2[1]) continue; for (len = 2; len < numAvail && data[len] == data2[len]; len++) {} // if (len < startLen) continue; // 18.new: speed optimization { unsigned offset = cur + len; if (last < offset) last = offset; } { unsigned len2 = len; price = repMatchPrice + GetPrice_PureRep(p, repIndex, state, posState); do { UInt32 price2 = price + GET_PRICE_LEN(&p->repLenEnc, posState, len2); COptimal *opt = &p->opt[cur + len2]; if (price2 < opt->price) { opt->price = price2; opt->len = (UInt32)len2; opt->dist = (UInt32)repIndex; opt->extra = 0; } } while (--len2 >= 2); } if (repIndex == 0) startLen = len + 1; // 17.old // startLen = len + 1; // 18.new /* if (_maxMode) */ { // ---------- REP : LIT : REP_0 ---------- // numFastBytes + 1 + numFastBytes unsigned len2 = len + 1; unsigned limit = len2 + p->numFastBytes; if (limit > numAvailFull) limit = numAvailFull; len2 += 2; if (len2 <= limit) if (data[len2 - 2] == data2[len2 - 2]) if (data[len2 - 1] == data2[len2 - 1]) { unsigned state2 = kRepNextStates[state]; unsigned posState2 = (position + len) & p->pbMask; price += GET_PRICE_LEN(&p->repLenEnc, posState, len) + GET_PRICE_0(p->isMatch[state2][posState2]) + LitEnc_Matched_GetPrice(LIT_PROBS(position + len, data[(size_t)len - 1]), data[len], data2[len], p->ProbPrices); // state2 = kLiteralNextStates[state2]; state2 = kState_LitAfterRep; posState2 = (posState2 + 1) & p->pbMask; price += GetPrice_Rep_0(p, state2, posState2); for (; len2 < limit && data[len2] == data2[len2]; len2++) {} len2 -= len; // if (len2 >= 3) { { unsigned offset = cur + len + len2; if (last < offset) last = offset; // do { UInt32 price2; COptimal *opt; len2--; // price2 = price + GetPrice_Len_Rep_0(p, len2, state2, posState2); price2 = price + GET_PRICE_LEN(&p->repLenEnc, posState2, len2); opt = &p->opt[offset]; // offset--; if (price2 < opt->price) { opt->price = price2; opt->len = (UInt32)len2; opt->extra = (CExtra)(len + 1); opt->dist = (UInt32)repIndex; } } // while (len2 >= 3); } } } } } } // ---------- MATCH ---------- /* for (unsigned len = 2; len <= newLen; len++) */ if (newLen > numAvail) { newLen = numAvail; for (numPairs = 0; newLen > MATCHES[numPairs]; numPairs += 2); MATCHES[numPairs] = (UInt32)newLen; numPairs += 2; } // startLen = 2; /* speed optimization */ if (newLen >= startLen) { UInt32 normalMatchPrice = matchPrice + GET_PRICE_0(p->isRep[state]); UInt32 dist; unsigned offs, posSlot, len; { unsigned offset = cur + newLen; if (last < offset) last = offset; } offs = 0; while (startLen > MATCHES[offs]) offs += 2; dist = MATCHES[(size_t)offs + 1]; // if (dist >= kNumFullDistances) GetPosSlot2(dist, posSlot); for (len = /*2*/ startLen; ; len++) { UInt32 price = normalMatchPrice + GET_PRICE_LEN(&p->lenEnc, posState, len); { COptimal *opt; unsigned lenNorm = len - 2; lenNorm = GetLenToPosState2(lenNorm); if (dist < kNumFullDistances) price += p->distancesPrices[lenNorm][dist & (kNumFullDistances - 1)]; else price += p->posSlotPrices[lenNorm][posSlot] + p->alignPrices[dist & kAlignMask]; opt = &p->opt[cur + len]; if (price < opt->price) { opt->price = price; opt->len = (UInt32)len; opt->dist = dist + LZMA_NUM_REPS; opt->extra = 0; } } if (len == MATCHES[offs]) { // if (p->_maxMode) { // MATCH : LIT : REP_0 const Byte *data2 = data - dist - 1; unsigned len2 = len + 1; unsigned limit = len2 + p->numFastBytes; if (limit > numAvailFull) limit = numAvailFull; len2 += 2; if (len2 <= limit) if (data[len2 - 2] == data2[len2 - 2]) if (data[len2 - 1] == data2[len2 - 1]) { for (; len2 < limit && data[len2] == data2[len2]; len2++) {} len2 -= len; // if (len2 >= 3) { unsigned state2 = kMatchNextStates[state]; unsigned posState2 = (position + len) & p->pbMask; unsigned offset; price += GET_PRICE_0(p->isMatch[state2][posState2]); price += LitEnc_Matched_GetPrice(LIT_PROBS(position + len, data[(size_t)len - 1]), data[len], data2[len], p->ProbPrices); // state2 = kLiteralNextStates[state2]; state2 = kState_LitAfterMatch; posState2 = (posState2 + 1) & p->pbMask; price += GetPrice_Rep_0(p, state2, posState2); offset = cur + len + len2; if (last < offset) last = offset; // do { UInt32 price2; COptimal *opt; len2--; // price2 = price + GetPrice_Len_Rep_0(p, len2, state2, posState2); price2 = price + GET_PRICE_LEN(&p->repLenEnc, posState2, len2); opt = &p->opt[offset]; // offset--; if (price2 < opt->price) { opt->price = price2; opt->len = (UInt32)len2; opt->extra = (CExtra)(len + 1); opt->dist = dist + LZMA_NUM_REPS; } } // while (len2 >= 3); } } offs += 2; if (offs == numPairs) break; dist = MATCHES[(size_t)offs + 1]; // if (dist >= kNumFullDistances) GetPosSlot2(dist, posSlot); } } } } do p->opt[last].price = kInfinityPrice; while (--last); return Backward(p, cur); } #define ChangePair(smallDist, bigDist) (((bigDist) >> 7) > (smallDist)) static unsigned GetOptimumFast(CLzmaEnc *p) { UInt32 numAvail, mainDist; unsigned mainLen, numPairs, repIndex, repLen, i; const Byte *data; if (p->additionalOffset == 0) mainLen = ReadMatchDistances(p, &numPairs); else { mainLen = p->longestMatchLen; numPairs = p->numPairs; } numAvail = p->numAvail; p->backRes = MARK_LIT; if (numAvail < 2) return 1; // if (mainLen < 2 && p->state == 0) return 1; // 18.06.notused if (numAvail > LZMA_MATCH_LEN_MAX) numAvail = LZMA_MATCH_LEN_MAX; data = p->matchFinder.GetPointerToCurrentPos(p->matchFinderObj) - 1; repLen = repIndex = 0; for (i = 0; i < LZMA_NUM_REPS; i++) { unsigned len; const Byte *data2 = data - p->reps[i]; if (data[0] != data2[0] || data[1] != data2[1]) continue; for (len = 2; len < numAvail && data[len] == data2[len]; len++) {} if (len >= p->numFastBytes) { p->backRes = (UInt32)i; MOVE_POS(p, len - 1) return len; } if (len > repLen) { repIndex = i; repLen = len; } } if (mainLen >= p->numFastBytes) { p->backRes = p->matches[(size_t)numPairs - 1] + LZMA_NUM_REPS; MOVE_POS(p, mainLen - 1) return mainLen; } mainDist = 0; /* for GCC */ if (mainLen >= 2) { mainDist = p->matches[(size_t)numPairs - 1]; while (numPairs > 2) { UInt32 dist2; if (mainLen != p->matches[(size_t)numPairs - 4] + 1) break; dist2 = p->matches[(size_t)numPairs - 3]; if (!ChangePair(dist2, mainDist)) break; numPairs -= 2; mainLen--; mainDist = dist2; } if (mainLen == 2 && mainDist >= 0x80) mainLen = 1; } if (repLen >= 2) if ( repLen + 1 >= mainLen || (repLen + 2 >= mainLen && mainDist >= (1 << 9)) || (repLen + 3 >= mainLen && mainDist >= (1 << 15))) { p->backRes = (UInt32)repIndex; MOVE_POS(p, repLen - 1) return repLen; } if (mainLen < 2 || numAvail <= 2) return 1; { unsigned len1 = ReadMatchDistances(p, &p->numPairs); p->longestMatchLen = len1; if (len1 >= 2) { UInt32 newDist = p->matches[(size_t)p->numPairs - 1]; if ( (len1 >= mainLen && newDist < mainDist) || (len1 == mainLen + 1 && !ChangePair(mainDist, newDist)) || (len1 > mainLen + 1) || (len1 + 1 >= mainLen && mainLen >= 3 && ChangePair(newDist, mainDist))) return 1; } } data = p->matchFinder.GetPointerToCurrentPos(p->matchFinderObj) - 1; for (i = 0; i < LZMA_NUM_REPS; i++) { unsigned len, limit; const Byte *data2 = data - p->reps[i]; if (data[0] != data2[0] || data[1] != data2[1]) continue; limit = mainLen - 1; for (len = 2;; len++) { if (len >= limit) return 1; if (data[len] != data2[len]) break; } } p->backRes = mainDist + LZMA_NUM_REPS; if (mainLen != 2) { MOVE_POS(p, mainLen - 2) } return mainLen; } static void WriteEndMarker(CLzmaEnc *p, unsigned posState) { UInt32 range; range = p->rc.range; { UInt32 ttt, newBound; CLzmaProb *prob = &p->isMatch[p->state][posState]; RC_BIT_PRE(&p->rc, prob) RC_BIT_1(&p->rc, prob) prob = &p->isRep[p->state]; RC_BIT_PRE(&p->rc, prob) RC_BIT_0(&p->rc, prob) } p->state = kMatchNextStates[p->state]; p->rc.range = range; LenEnc_Encode(&p->lenProbs, &p->rc, 0, posState); range = p->rc.range; { // RcTree_Encode_PosSlot(&p->rc, p->posSlotEncoder[0], (1 << kNumPosSlotBits) - 1); CLzmaProb *probs = p->posSlotEncoder[0]; unsigned m = 1; do { UInt32 ttt, newBound; RC_BIT_PRE(p, probs + m) RC_BIT_1(&p->rc, probs + m); m = (m << 1) + 1; } while (m < (1 << kNumPosSlotBits)); } { // RangeEnc_EncodeDirectBits(&p->rc, ((UInt32)1 << (30 - kNumAlignBits)) - 1, 30 - kNumAlignBits); UInt32 range = p->range; unsigned numBits = 30 - kNumAlignBits; do { range >>= 1; p->rc.low += range; RC_NORM(&p->rc) } while (--numBits); } { // RcTree_ReverseEncode(&p->rc, p->posAlignEncoder, kNumAlignBits, kAlignMask); CLzmaProb *probs = p->posAlignEncoder; unsigned m = 1; do { UInt32 ttt, newBound; RC_BIT_PRE(p, probs + m) RC_BIT_1(&p->rc, probs + m); m = (m << 1) + 1; } while (m < kAlignTableSize); } p->rc.range = range; } static SRes CheckErrors(CLzmaEnc *p) { if (p->result != SZ_OK) return p->result; if (p->rc.res != SZ_OK) p->result = SZ_ERROR_WRITE; #ifndef _7ZIP_ST if ( // p->mf_Failure || (p->mtMode && ( // p->matchFinderMt.failure_LZ_LZ || p->matchFinderMt.failure_LZ_BT)) ) { p->result = MY_HRES_ERROR__INTERNAL_ERROR; // printf("\nCheckErrors p->matchFinderMt.failureLZ\n"); } #endif if (MFB.result != SZ_OK) p->result = SZ_ERROR_READ; if (p->result != SZ_OK) p->finished = True; return p->result; } MY_NO_INLINE static SRes Flush(CLzmaEnc *p, UInt32 nowPos) { /* ReleaseMFStream(); */ p->finished = True; if (p->writeEndMark) WriteEndMarker(p, nowPos & p->pbMask); RangeEnc_FlushData(&p->rc); RangeEnc_FlushStream(&p->rc); return CheckErrors(p); } MY_NO_INLINE static void FillAlignPrices(CLzmaEnc *p) { unsigned i; const CProbPrice *ProbPrices = p->ProbPrices; const CLzmaProb *probs = p->posAlignEncoder; // p->alignPriceCount = 0; for (i = 0; i < kAlignTableSize / 2; i++) { UInt32 price = 0; unsigned sym = i; unsigned m = 1; unsigned bit; UInt32 prob; bit = sym & 1; sym >>= 1; price += GET_PRICEa(probs[m], bit); m = (m << 1) + bit; bit = sym & 1; sym >>= 1; price += GET_PRICEa(probs[m], bit); m = (m << 1) + bit; bit = sym & 1; sym >>= 1; price += GET_PRICEa(probs[m], bit); m = (m << 1) + bit; prob = probs[m]; p->alignPrices[i ] = price + GET_PRICEa_0(prob); p->alignPrices[i + 8] = price + GET_PRICEa_1(prob); // p->alignPrices[i] = RcTree_ReverseGetPrice(p->posAlignEncoder, kNumAlignBits, i, p->ProbPrices); } } MY_NO_INLINE static void FillDistancesPrices(CLzmaEnc *p) { // int y; for (y = 0; y < 100; y++) { UInt32 tempPrices[kNumFullDistances]; unsigned i, lps; const CProbPrice *ProbPrices = p->ProbPrices; p->matchPriceCount = 0; for (i = kStartPosModelIndex / 2; i < kNumFullDistances / 2; i++) { unsigned posSlot = GetPosSlot1(i); unsigned footerBits = (posSlot >> 1) - 1; unsigned base = ((2 | (posSlot & 1)) << footerBits); const CLzmaProb *probs = p->posEncoders + (size_t)base * 2; // tempPrices[i] = RcTree_ReverseGetPrice(p->posEncoders + base, footerBits, i - base, p->ProbPrices); UInt32 price = 0; unsigned m = 1; unsigned sym = i; unsigned offset = (unsigned)1 << footerBits; base += i; if (footerBits) do { unsigned bit = sym & 1; sym >>= 1; price += GET_PRICEa(probs[m], bit); m = (m << 1) + bit; } while (--footerBits); { unsigned prob = probs[m]; tempPrices[base ] = price + GET_PRICEa_0(prob); tempPrices[base + offset] = price + GET_PRICEa_1(prob); } } for (lps = 0; lps < kNumLenToPosStates; lps++) { unsigned slot; unsigned distTableSize2 = (p->distTableSize + 1) >> 1; UInt32 *posSlotPrices = p->posSlotPrices[lps]; const CLzmaProb *probs = p->posSlotEncoder[lps]; for (slot = 0; slot < distTableSize2; slot++) { // posSlotPrices[slot] = RcTree_GetPrice(encoder, kNumPosSlotBits, slot, p->ProbPrices); UInt32 price; unsigned bit; unsigned sym = slot + (1 << (kNumPosSlotBits - 1)); unsigned prob; bit = sym & 1; sym >>= 1; price = GET_PRICEa(probs[sym], bit); bit = sym & 1; sym >>= 1; price += GET_PRICEa(probs[sym], bit); bit = sym & 1; sym >>= 1; price += GET_PRICEa(probs[sym], bit); bit = sym & 1; sym >>= 1; price += GET_PRICEa(probs[sym], bit); bit = sym & 1; sym >>= 1; price += GET_PRICEa(probs[sym], bit); prob = probs[(size_t)slot + (1 << (kNumPosSlotBits - 1))]; posSlotPrices[(size_t)slot * 2 ] = price + GET_PRICEa_0(prob); posSlotPrices[(size_t)slot * 2 + 1] = price + GET_PRICEa_1(prob); } { UInt32 delta = ((UInt32)((kEndPosModelIndex / 2 - 1) - kNumAlignBits) << kNumBitPriceShiftBits); for (slot = kEndPosModelIndex / 2; slot < distTableSize2; slot++) { posSlotPrices[(size_t)slot * 2 ] += delta; posSlotPrices[(size_t)slot * 2 + 1] += delta; delta += ((UInt32)1 << kNumBitPriceShiftBits); } } { UInt32 *dp = p->distancesPrices[lps]; dp[0] = posSlotPrices[0]; dp[1] = posSlotPrices[1]; dp[2] = posSlotPrices[2]; dp[3] = posSlotPrices[3]; for (i = 4; i < kNumFullDistances; i += 2) { UInt32 slotPrice = posSlotPrices[GetPosSlot1(i)]; dp[i ] = slotPrice + tempPrices[i]; dp[i + 1] = slotPrice + tempPrices[i + 1]; } } } // } } static void LzmaEnc_Construct(CLzmaEnc *p) { RangeEnc_Construct(&p->rc); MatchFinder_Construct(&MFB); #ifndef _7ZIP_ST p->matchFinderMt.MatchFinder = &MFB; MatchFinderMt_Construct(&p->matchFinderMt); #endif { CLzmaEncProps props; LzmaEncProps_Init(&props); LzmaEnc_SetProps(p, &props); } #ifndef LZMA_LOG_BSR LzmaEnc_FastPosInit(p->g_FastPos); #endif LzmaEnc_InitPriceTables(p->ProbPrices); p->litProbs = NULL; p->saveState.litProbs = NULL; } CLzmaEncHandle LzmaEnc_Create(ISzAllocPtr alloc) { void *p; p = ISzAlloc_Alloc(alloc, sizeof(CLzmaEnc)); if (p) LzmaEnc_Construct((CLzmaEnc *)p); return p; } static void LzmaEnc_FreeLits(CLzmaEnc *p, ISzAllocPtr alloc) { ISzAlloc_Free(alloc, p->litProbs); ISzAlloc_Free(alloc, p->saveState.litProbs); p->litProbs = NULL; p->saveState.litProbs = NULL; } static void LzmaEnc_Destruct(CLzmaEnc *p, ISzAllocPtr alloc, ISzAllocPtr allocBig) { #ifndef _7ZIP_ST MatchFinderMt_Destruct(&p->matchFinderMt, allocBig); #endif MatchFinder_Free(&MFB, allocBig); LzmaEnc_FreeLits(p, alloc); RangeEnc_Free(&p->rc, alloc); } void LzmaEnc_Destroy(CLzmaEncHandle p, ISzAllocPtr alloc, ISzAllocPtr allocBig) { LzmaEnc_Destruct((CLzmaEnc *)p, alloc, allocBig); ISzAlloc_Free(alloc, p); } MY_NO_INLINE static SRes LzmaEnc_CodeOneBlock(CLzmaEnc *p, UInt32 maxPackSize, UInt32 maxUnpackSize) { UInt32 nowPos32, startPos32; if (p->needInit) { #ifndef _7ZIP_ST if (p->mtMode) { RINOK(MatchFinderMt_InitMt(&p->matchFinderMt)); } #endif p->matchFinder.Init(p->matchFinderObj); p->needInit = 0; } if (p->finished) return p->result; RINOK(CheckErrors(p)); nowPos32 = (UInt32)p->nowPos64; startPos32 = nowPos32; if (p->nowPos64 == 0) { unsigned numPairs; Byte curByte; if (p->matchFinder.GetNumAvailableBytes(p->matchFinderObj) == 0) return Flush(p, nowPos32); ReadMatchDistances(p, &numPairs); RangeEnc_EncodeBit_0(&p->rc, &p->isMatch[kState_Start][0]); // p->state = kLiteralNextStates[p->state]; curByte = *(p->matchFinder.GetPointerToCurrentPos(p->matchFinderObj) - p->additionalOffset); LitEnc_Encode(&p->rc, p->litProbs, curByte); p->additionalOffset--; nowPos32++; } if (p->matchFinder.GetNumAvailableBytes(p->matchFinderObj) != 0) for (;;) { UInt32 dist; unsigned len, posState; UInt32 range, ttt, newBound; CLzmaProb *probs; if (p->fastMode) len = GetOptimumFast(p); else { unsigned oci = p->optCur; if (p->optEnd == oci) len = GetOptimum(p, nowPos32); else { const COptimal *opt = &p->opt[oci]; len = opt->len; p->backRes = opt->dist; p->optCur = oci + 1; } } posState = (unsigned)nowPos32 & p->pbMask; range = p->rc.range; probs = &p->isMatch[p->state][posState]; RC_BIT_PRE(&p->rc, probs) dist = p->backRes; #ifdef SHOW_STAT2 printf("\n pos = %6X, len = %3u pos = %6u", nowPos32, len, dist); #endif if (dist == MARK_LIT) { Byte curByte; const Byte *data; unsigned state; RC_BIT_0(&p->rc, probs); p->rc.range = range; data = p->matchFinder.GetPointerToCurrentPos(p->matchFinderObj) - p->additionalOffset; probs = LIT_PROBS(nowPos32, *(data - 1)); curByte = *data; state = p->state; p->state = kLiteralNextStates[state]; if (IsLitState(state)) LitEnc_Encode(&p->rc, probs, curByte); else LitEnc_EncodeMatched(&p->rc, probs, curByte, *(data - p->reps[0])); } else { RC_BIT_1(&p->rc, probs); probs = &p->isRep[p->state]; RC_BIT_PRE(&p->rc, probs) if (dist < LZMA_NUM_REPS) { RC_BIT_1(&p->rc, probs); probs = &p->isRepG0[p->state]; RC_BIT_PRE(&p->rc, probs) if (dist == 0) { RC_BIT_0(&p->rc, probs); probs = &p->isRep0Long[p->state][posState]; RC_BIT_PRE(&p->rc, probs) if (len != 1) { RC_BIT_1_BASE(&p->rc, probs); } else { RC_BIT_0_BASE(&p->rc, probs); p->state = kShortRepNextStates[p->state]; } } else { RC_BIT_1(&p->rc, probs); probs = &p->isRepG1[p->state]; RC_BIT_PRE(&p->rc, probs) if (dist == 1) { RC_BIT_0_BASE(&p->rc, probs); dist = p->reps[1]; } else { RC_BIT_1(&p->rc, probs); probs = &p->isRepG2[p->state]; RC_BIT_PRE(&p->rc, probs) if (dist == 2) { RC_BIT_0_BASE(&p->rc, probs); dist = p->reps[2]; } else { RC_BIT_1_BASE(&p->rc, probs); dist = p->reps[3]; p->reps[3] = p->reps[2]; } p->reps[2] = p->reps[1]; } p->reps[1] = p->reps[0]; p->reps[0] = dist; } RC_NORM(&p->rc) p->rc.range = range; if (len != 1) { LenEnc_Encode(&p->repLenProbs, &p->rc, len - LZMA_MATCH_LEN_MIN, posState); --p->repLenEncCounter; p->state = kRepNextStates[p->state]; } } else { unsigned posSlot; RC_BIT_0(&p->rc, probs); p->rc.range = range; p->state = kMatchNextStates[p->state]; LenEnc_Encode(&p->lenProbs, &p->rc, len - LZMA_MATCH_LEN_MIN, posState); // --p->lenEnc.counter; dist -= LZMA_NUM_REPS; p->reps[3] = p->reps[2]; p->reps[2] = p->reps[1]; p->reps[1] = p->reps[0]; p->reps[0] = dist + 1; p->matchPriceCount++; GetPosSlot(dist, posSlot); // RcTree_Encode_PosSlot(&p->rc, p->posSlotEncoder[GetLenToPosState(len)], posSlot); { UInt32 sym = (UInt32)posSlot + (1 << kNumPosSlotBits); range = p->rc.range; probs = p->posSlotEncoder[GetLenToPosState(len)]; do { CLzmaProb *prob = probs + (sym >> kNumPosSlotBits); UInt32 bit = (sym >> (kNumPosSlotBits - 1)) & 1; sym <<= 1; RC_BIT(&p->rc, prob, bit); } while (sym < (1 << kNumPosSlotBits * 2)); p->rc.range = range; } if (dist >= kStartPosModelIndex) { unsigned footerBits = ((posSlot >> 1) - 1); if (dist < kNumFullDistances) { unsigned base = ((2 | (posSlot & 1)) << footerBits); RcTree_ReverseEncode(&p->rc, p->posEncoders + base, footerBits, (unsigned)(dist /* - base */)); } else { UInt32 pos2 = (dist | 0xF) << (32 - footerBits); range = p->rc.range; // RangeEnc_EncodeDirectBits(&p->rc, posReduced >> kNumAlignBits, footerBits - kNumAlignBits); /* do { range >>= 1; p->rc.low += range & (0 - ((dist >> --footerBits) & 1)); RC_NORM(&p->rc) } while (footerBits > kNumAlignBits); */ do { range >>= 1; p->rc.low += range & (0 - (pos2 >> 31)); pos2 += pos2; RC_NORM(&p->rc) } while (pos2 != 0xF0000000); // RcTree_ReverseEncode(&p->rc, p->posAlignEncoder, kNumAlignBits, posReduced & kAlignMask); { unsigned m = 1; unsigned bit; bit = dist & 1; dist >>= 1; RC_BIT(&p->rc, p->posAlignEncoder + m, bit); m = (m << 1) + bit; bit = dist & 1; dist >>= 1; RC_BIT(&p->rc, p->posAlignEncoder + m, bit); m = (m << 1) + bit; bit = dist & 1; dist >>= 1; RC_BIT(&p->rc, p->posAlignEncoder + m, bit); m = (m << 1) + bit; bit = dist & 1; RC_BIT(&p->rc, p->posAlignEncoder + m, bit); p->rc.range = range; // p->alignPriceCount++; } } } } } nowPos32 += (UInt32)len; p->additionalOffset -= len; if (p->additionalOffset == 0) { UInt32 processed; if (!p->fastMode) { /* if (p->alignPriceCount >= 16) // kAlignTableSize FillAlignPrices(p); if (p->matchPriceCount >= 128) FillDistancesPrices(p); if (p->lenEnc.counter <= 0) LenPriceEnc_UpdateTables(&p->lenEnc, 1 << p->pb, &p->lenProbs, p->ProbPrices); */ if (p->matchPriceCount >= 64) { FillAlignPrices(p); // { int y; for (y = 0; y < 100; y++) { FillDistancesPrices(p); // }} LenPriceEnc_UpdateTables(&p->lenEnc, (unsigned)1 << p->pb, &p->lenProbs, p->ProbPrices); } if (p->repLenEncCounter <= 0) { p->repLenEncCounter = REP_LEN_COUNT; LenPriceEnc_UpdateTables(&p->repLenEnc, (unsigned)1 << p->pb, &p->repLenProbs, p->ProbPrices); } } if (p->matchFinder.GetNumAvailableBytes(p->matchFinderObj) == 0) break; processed = nowPos32 - startPos32; if (maxPackSize) { if (processed + kNumOpts + 300 >= maxUnpackSize || RangeEnc_GetProcessed_sizet(&p->rc) + kPackReserve >= maxPackSize) break; } else if (processed >= (1 << 17)) { p->nowPos64 += nowPos32 - startPos32; return CheckErrors(p); } } } p->nowPos64 += nowPos32 - startPos32; return Flush(p, nowPos32); } #define kBigHashDicLimit ((UInt32)1 << 24) static SRes LzmaEnc_Alloc(CLzmaEnc *p, UInt32 keepWindowSize, ISzAllocPtr alloc, ISzAllocPtr allocBig) { UInt32 beforeSize = kNumOpts; UInt32 dictSize; if (!RangeEnc_Alloc(&p->rc, alloc)) return SZ_ERROR_MEM; #ifndef _7ZIP_ST p->mtMode = (p->multiThread && !p->fastMode && (MFB.btMode != 0)); #endif { unsigned lclp = p->lc + p->lp; if (!p->litProbs || !p->saveState.litProbs || p->lclp != lclp) { LzmaEnc_FreeLits(p, alloc); p->litProbs = (CLzmaProb *)ISzAlloc_Alloc(alloc, ((UInt32)0x300 << lclp) * sizeof(CLzmaProb)); p->saveState.litProbs = (CLzmaProb *)ISzAlloc_Alloc(alloc, ((UInt32)0x300 << lclp) * sizeof(CLzmaProb)); if (!p->litProbs || !p->saveState.litProbs) { LzmaEnc_FreeLits(p, alloc); return SZ_ERROR_MEM; } p->lclp = lclp; } } MFB.bigHash = (Byte)(p->dictSize > kBigHashDicLimit ? 1 : 0); dictSize = p->dictSize; if (dictSize == ((UInt32)2 << 30) || dictSize == ((UInt32)3 << 30)) { /* 21.03 : here we reduce the dictionary for 2 reasons: 1) we don't want 32-bit back_distance matches in decoder for 2 GB dictionary. 2) we want to elimate useless last MatchFinder_Normalize3() for corner cases, where data size is aligned for 1 GB: 5/6/8 GB. That reducing must be >= 1 for such corner cases. */ dictSize -= 1; } if (beforeSize + dictSize < keepWindowSize) beforeSize = keepWindowSize - dictSize; /* in worst case we can look ahead for max(LZMA_MATCH_LEN_MAX, numFastBytes + 1 + numFastBytes) bytes. we send larger value for (keepAfter) to MantchFinder_Create(): (numFastBytes + LZMA_MATCH_LEN_MAX + 1) */ #ifndef _7ZIP_ST if (p->mtMode) { RINOK(MatchFinderMt_Create(&p->matchFinderMt, dictSize, beforeSize, p->numFastBytes, LZMA_MATCH_LEN_MAX + 1 /* 18.04 */ , allocBig)); p->matchFinderObj = &p->matchFinderMt; MFB.bigHash = (Byte)( (p->dictSize > kBigHashDicLimit && MFB.hashMask >= 0xFFFFFF) ? 1 : 0); MatchFinderMt_CreateVTable(&p->matchFinderMt, &p->matchFinder); } else #endif { if (!MatchFinder_Create(&MFB, dictSize, beforeSize, p->numFastBytes, LZMA_MATCH_LEN_MAX + 1 /* 21.03 */ , allocBig)) return SZ_ERROR_MEM; p->matchFinderObj = &MFB; MatchFinder_CreateVTable(&MFB, &p->matchFinder); } return SZ_OK; } static void LzmaEnc_Init(CLzmaEnc *p) { unsigned i; p->state = 0; p->reps[0] = p->reps[1] = p->reps[2] = p->reps[3] = 1; RangeEnc_Init(&p->rc); for (i = 0; i < (1 << kNumAlignBits); i++) p->posAlignEncoder[i] = kProbInitValue; for (i = 0; i < kNumStates; i++) { unsigned j; for (j = 0; j < LZMA_NUM_PB_STATES_MAX; j++) { p->isMatch[i][j] = kProbInitValue; p->isRep0Long[i][j] = kProbInitValue; } p->isRep[i] = kProbInitValue; p->isRepG0[i] = kProbInitValue; p->isRepG1[i] = kProbInitValue; p->isRepG2[i] = kProbInitValue; } { for (i = 0; i < kNumLenToPosStates; i++) { CLzmaProb *probs = p->posSlotEncoder[i]; unsigned j; for (j = 0; j < (1 << kNumPosSlotBits); j++) probs[j] = kProbInitValue; } } { for (i = 0; i < kNumFullDistances; i++) p->posEncoders[i] = kProbInitValue; } { UInt32 num = (UInt32)0x300 << (p->lp + p->lc); UInt32 k; CLzmaProb *probs = p->litProbs; for (k = 0; k < num; k++) probs[k] = kProbInitValue; } LenEnc_Init(&p->lenProbs); LenEnc_Init(&p->repLenProbs); p->optEnd = 0; p->optCur = 0; { for (i = 0; i < kNumOpts; i++) p->opt[i].price = kInfinityPrice; } p->additionalOffset = 0; p->pbMask = ((unsigned)1 << p->pb) - 1; p->lpMask = ((UInt32)0x100 << p->lp) - ((unsigned)0x100 >> p->lc); // p->mf_Failure = False; } static void LzmaEnc_InitPrices(CLzmaEnc *p) { if (!p->fastMode) { FillDistancesPrices(p); FillAlignPrices(p); } p->lenEnc.tableSize = p->repLenEnc.tableSize = p->numFastBytes + 1 - LZMA_MATCH_LEN_MIN; p->repLenEncCounter = REP_LEN_COUNT; LenPriceEnc_UpdateTables(&p->lenEnc, (unsigned)1 << p->pb, &p->lenProbs, p->ProbPrices); LenPriceEnc_UpdateTables(&p->repLenEnc, (unsigned)1 << p->pb, &p->repLenProbs, p->ProbPrices); } static SRes LzmaEnc_AllocAndInit(CLzmaEnc *p, UInt32 keepWindowSize, ISzAllocPtr alloc, ISzAllocPtr allocBig) { unsigned i; for (i = kEndPosModelIndex / 2; i < kDicLogSizeMax; i++) if (p->dictSize <= ((UInt32)1 << i)) break; p->distTableSize = i * 2; p->finished = False; p->result = SZ_OK; RINOK(LzmaEnc_Alloc(p, keepWindowSize, alloc, allocBig)); LzmaEnc_Init(p); LzmaEnc_InitPrices(p); p->nowPos64 = 0; return SZ_OK; } static SRes LzmaEnc_Prepare(CLzmaEncHandle pp, ISeqOutStream *outStream, ISeqInStream *inStream, ISzAllocPtr alloc, ISzAllocPtr allocBig) { CLzmaEnc *p = (CLzmaEnc *)pp; MFB.stream = inStream; p->needInit = 1; p->rc.outStream = outStream; return LzmaEnc_AllocAndInit(p, 0, alloc, allocBig); } SRes LzmaEnc_PrepareForLzma2(CLzmaEncHandle pp, ISeqInStream *inStream, UInt32 keepWindowSize, ISzAllocPtr alloc, ISzAllocPtr allocBig) { CLzmaEnc *p = (CLzmaEnc *)pp; MFB.stream = inStream; p->needInit = 1; return LzmaEnc_AllocAndInit(p, keepWindowSize, alloc, allocBig); } static void LzmaEnc_SetInputBuf(CLzmaEnc *p, const Byte *src, SizeT srcLen) { MFB.directInput = 1; MFB.bufferBase = (Byte *)src; MFB.directInputRem = srcLen; } SRes LzmaEnc_MemPrepare(CLzmaEncHandle pp, const Byte *src, SizeT srcLen, UInt32 keepWindowSize, ISzAllocPtr alloc, ISzAllocPtr allocBig) { CLzmaEnc *p = (CLzmaEnc *)pp; LzmaEnc_SetInputBuf(p, src, srcLen); p->needInit = 1; LzmaEnc_SetDataSize(pp, srcLen); return LzmaEnc_AllocAndInit(p, keepWindowSize, alloc, allocBig); } void LzmaEnc_Finish(CLzmaEncHandle pp) { #ifndef _7ZIP_ST CLzmaEnc *p = (CLzmaEnc *)pp; if (p->mtMode) MatchFinderMt_ReleaseStream(&p->matchFinderMt); #else UNUSED_VAR(pp); #endif } typedef struct { ISeqOutStream vt; Byte *data; SizeT rem; BoolInt overflow; } CLzmaEnc_SeqOutStreamBuf; static size_t SeqOutStreamBuf_Write(const ISeqOutStream *pp, const void *data, size_t size) { CLzmaEnc_SeqOutStreamBuf *p = CONTAINER_FROM_VTBL(pp, CLzmaEnc_SeqOutStreamBuf, vt); if (p->rem < size) { size = p->rem; p->overflow = True; } if (size != 0) { memcpy(p->data, data, size); p->rem -= size; p->data += size; } return size; } /* UInt32 LzmaEnc_GetNumAvailableBytes(CLzmaEncHandle pp) { const CLzmaEnc *p = (CLzmaEnc *)pp; return p->matchFinder.GetNumAvailableBytes(p->matchFinderObj); } */ const Byte *LzmaEnc_GetCurBuf(CLzmaEncHandle pp) { const CLzmaEnc *p = (CLzmaEnc *)pp; return p->matchFinder.GetPointerToCurrentPos(p->matchFinderObj) - p->additionalOffset; } // (desiredPackSize == 0) is not allowed SRes LzmaEnc_CodeOneMemBlock(CLzmaEncHandle pp, BoolInt reInit, Byte *dest, size_t *destLen, UInt32 desiredPackSize, UInt32 *unpackSize) { CLzmaEnc *p = (CLzmaEnc *)pp; UInt64 nowPos64; SRes res; CLzmaEnc_SeqOutStreamBuf outStream; outStream.vt.Write = SeqOutStreamBuf_Write; outStream.data = dest; outStream.rem = *destLen; outStream.overflow = False; p->writeEndMark = False; p->finished = False; p->result = SZ_OK; if (reInit) LzmaEnc_Init(p); LzmaEnc_InitPrices(p); RangeEnc_Init(&p->rc); p->rc.outStream = &outStream.vt; nowPos64 = p->nowPos64; res = LzmaEnc_CodeOneBlock(p, desiredPackSize, *unpackSize); *unpackSize = (UInt32)(p->nowPos64 - nowPos64); *destLen -= outStream.rem; if (outStream.overflow) return SZ_ERROR_OUTPUT_EOF; return res; } MY_NO_INLINE static SRes LzmaEnc_Encode2(CLzmaEnc *p, ICompressProgress *progress) { SRes res = SZ_OK; #ifndef _7ZIP_ST Byte allocaDummy[0x300]; allocaDummy[0] = 0; allocaDummy[1] = allocaDummy[0]; #endif for (;;) { res = LzmaEnc_CodeOneBlock(p, 0, 0); if (res != SZ_OK || p->finished) break; if (progress) { res = ICompressProgress_Progress(progress, p->nowPos64, RangeEnc_GetProcessed(&p->rc)); if (res != SZ_OK) { res = SZ_ERROR_PROGRESS; break; } } } LzmaEnc_Finish(p); /* if (res == SZ_OK && !Inline_MatchFinder_IsFinishedOK(&MFB)) res = SZ_ERROR_FAIL; } */ return res; } SRes LzmaEnc_Encode(CLzmaEncHandle pp, ISeqOutStream *outStream, ISeqInStream *inStream, ICompressProgress *progress, ISzAllocPtr alloc, ISzAllocPtr allocBig) { RINOK(LzmaEnc_Prepare(pp, outStream, inStream, alloc, allocBig)); return LzmaEnc_Encode2((CLzmaEnc *)pp, progress); } SRes LzmaEnc_WriteProperties(CLzmaEncHandle pp, Byte *props, SizeT *size) { if (*size < LZMA_PROPS_SIZE) return SZ_ERROR_PARAM; *size = LZMA_PROPS_SIZE; { const CLzmaEnc *p = (const CLzmaEnc *)pp; const UInt32 dictSize = p->dictSize; UInt32 v; props[0] = (Byte)((p->pb * 5 + p->lp) * 9 + p->lc); // we write aligned dictionary value to properties for lzma decoder if (dictSize >= ((UInt32)1 << 21)) { const UInt32 kDictMask = ((UInt32)1 << 20) - 1; v = (dictSize + kDictMask) & ~kDictMask; if (v < dictSize) v = dictSize; } else { unsigned i = 11 * 2; do { v = (UInt32)(2 + (i & 1)) << (i >> 1); i++; } while (v < dictSize); } SetUi32(props + 1, v); return SZ_OK; } } unsigned LzmaEnc_IsWriteEndMark(CLzmaEncHandle pp) { return (unsigned)((CLzmaEnc *)pp)->writeEndMark; } SRes LzmaEnc_MemEncode(CLzmaEncHandle pp, Byte *dest, SizeT *destLen, const Byte *src, SizeT srcLen, int writeEndMark, ICompressProgress *progress, ISzAllocPtr alloc, ISzAllocPtr allocBig) { SRes res; CLzmaEnc *p = (CLzmaEnc *)pp; CLzmaEnc_SeqOutStreamBuf outStream; outStream.vt.Write = SeqOutStreamBuf_Write; outStream.data = dest; outStream.rem = *destLen; outStream.overflow = False; p->writeEndMark = writeEndMark; p->rc.outStream = &outStream.vt; res = LzmaEnc_MemPrepare(pp, src, srcLen, 0, alloc, allocBig); if (res == SZ_OK) { res = LzmaEnc_Encode2(p, progress); if (res == SZ_OK && p->nowPos64 != srcLen) res = SZ_ERROR_FAIL; } *destLen -= outStream.rem; if (outStream.overflow) return SZ_ERROR_OUTPUT_EOF; return res; } SRes LzmaEncode(Byte *dest, SizeT *destLen, const Byte *src, SizeT srcLen, const CLzmaEncProps *props, Byte *propsEncoded, SizeT *propsSize, int writeEndMark, ICompressProgress *progress, ISzAllocPtr alloc, ISzAllocPtr allocBig) { CLzmaEnc *p = (CLzmaEnc *)LzmaEnc_Create(alloc); SRes res; if (!p) return SZ_ERROR_MEM; res = LzmaEnc_SetProps(p, props); if (res == SZ_OK) { res = LzmaEnc_WriteProperties(p, propsEncoded, propsSize); if (res == SZ_OK) res = LzmaEnc_MemEncode(p, dest, destLen, src, srcLen, writeEndMark, progress, alloc, allocBig); } LzmaEnc_Destroy(p, alloc, allocBig); return res; } /* #ifndef _7ZIP_ST void LzmaEnc_GetLzThreads(CLzmaEncHandle pp, HANDLE lz_threads[2]) { const CLzmaEnc *p = (CLzmaEnc *)pp; lz_threads[0] = p->matchFinderMt.hashSync.thread; lz_threads[1] = p->matchFinderMt.btSync.thread; } #endif */ UEFITool-A66/common/LZMA/SDK/C/LzmaEnc.h000066400000000000000000000057061442134156300173510ustar00rootroot00000000000000/* LzmaEnc.h -- LZMA Encoder 2019-10-30 : Igor Pavlov : Public domain */ #ifndef __LZMA_ENC_H #define __LZMA_ENC_H #include "7zTypes.h" EXTERN_C_BEGIN #define LZMA_PROPS_SIZE 5 typedef struct _CLzmaEncProps { int level; /* 0 <= level <= 9 */ UInt32 dictSize; /* (1 << 12) <= dictSize <= (1 << 27) for 32-bit version (1 << 12) <= dictSize <= (3 << 29) for 64-bit version default = (1 << 24) */ int lc; /* 0 <= lc <= 8, default = 3 */ int lp; /* 0 <= lp <= 4, default = 0 */ int pb; /* 0 <= pb <= 4, default = 2 */ int algo; /* 0 - fast, 1 - normal, default = 1 */ int fb; /* 5 <= fb <= 273, default = 32 */ int btMode; /* 0 - hashChain Mode, 1 - binTree mode - normal, default = 1 */ int numHashBytes; /* 2, 3 or 4, default = 4 */ UInt32 mc; /* 1 <= mc <= (1 << 30), default = 32 */ unsigned writeEndMark; /* 0 - do not write EOPM, 1 - write EOPM, default = 0 */ int numThreads; /* 1 or 2, default = 2 */ UInt64 reduceSize; /* estimated size of data that will be compressed. default = (UInt64)(Int64)-1. Encoder uses this value to reduce dictionary size */ UInt64 affinity; } CLzmaEncProps; void LzmaEncProps_Init(CLzmaEncProps *p); void LzmaEncProps_Normalize(CLzmaEncProps *p); UInt32 LzmaEncProps_GetDictSize(const CLzmaEncProps *props2); /* ---------- CLzmaEncHandle Interface ---------- */ /* LzmaEnc* functions can return the following exit codes: SRes: SZ_OK - OK SZ_ERROR_MEM - Memory allocation error SZ_ERROR_PARAM - Incorrect paramater in props SZ_ERROR_WRITE - ISeqOutStream write callback error SZ_ERROR_OUTPUT_EOF - output buffer overflow - version with (Byte *) output SZ_ERROR_PROGRESS - some break from progress callback SZ_ERROR_THREAD - error in multithreading functions (only for Mt version) */ typedef void * CLzmaEncHandle; CLzmaEncHandle LzmaEnc_Create(ISzAllocPtr alloc); void LzmaEnc_Destroy(CLzmaEncHandle p, ISzAllocPtr alloc, ISzAllocPtr allocBig); SRes LzmaEnc_SetProps(CLzmaEncHandle p, const CLzmaEncProps *props); void LzmaEnc_SetDataSize(CLzmaEncHandle p, UInt64 expectedDataSiize); SRes LzmaEnc_WriteProperties(CLzmaEncHandle p, Byte *properties, SizeT *size); unsigned LzmaEnc_IsWriteEndMark(CLzmaEncHandle p); SRes LzmaEnc_Encode(CLzmaEncHandle p, ISeqOutStream *outStream, ISeqInStream *inStream, ICompressProgress *progress, ISzAllocPtr alloc, ISzAllocPtr allocBig); SRes LzmaEnc_MemEncode(CLzmaEncHandle p, Byte *dest, SizeT *destLen, const Byte *src, SizeT srcLen, int writeEndMark, ICompressProgress *progress, ISzAllocPtr alloc, ISzAllocPtr allocBig); /* ---------- One Call Interface ---------- */ SRes LzmaEncode(Byte *dest, SizeT *destLen, const Byte *src, SizeT srcLen, const CLzmaEncProps *props, Byte *propsEncoded, SizeT *propsSize, int writeEndMark, ICompressProgress *progress, ISzAllocPtr alloc, ISzAllocPtr allocBig); EXTERN_C_END #endif UEFITool-A66/common/LZMA/SDK/C/Precomp.h000066400000000000000000000002761442134156300174220ustar00rootroot00000000000000/* Precomp.h -- StdAfx 2013-11-12 : Igor Pavlov : Public domain */ #ifndef __7Z_PRECOMP_H #define __7Z_PRECOMP_H #include "Compiler.h" /* #include "7zTypes.h" */ #define _7ZIP_ST #endif UEFITool-A66/common/LZMA/UefiLzma.h000066400000000000000000000013171442134156300167230ustar00rootroot00000000000000/* LZMA UEFI header file Copyright (c) 2009, Intel Corporation. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHWARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef __UEFILZMA_H__ #define __UEFILZMA_H__ #include "../basetypes.h" #ifdef _WIN32 #undef _WIN32 #endif #ifdef _WIN64 #undef _WIN64 #endif #define _LZMA_SIZE_OPT #define _7ZIP_ST #endif // __UEFILZMA_H__ UEFITool-A66/common/Tiano/000077500000000000000000000000001442134156300153435ustar00rootroot00000000000000UEFITool-A66/common/Tiano/EfiTianoCompress.c000066400000000000000000000657271442134156300207420ustar00rootroot00000000000000/** @file Compression routine. The compression algorithm is a mixture of LZ77 and Huffman coding. LZ77 transforms the source data into a sequence of Original Characters and Pointers to repeated strings. This sequence is further divided into Blocks and Huffman codings are applied to each Block. Copyright (c) 2014, Nikolaj Schlej Copyright (c) 2006 - 2014, Intel Corporation. All rights reserved.
This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. **/ #include "EfiTianoCompress.h" // // Macro Definitions // #undef UINT8_MAX typedef INT16 NODE; #define UINT8_MAX 0xff #define UINT8_BIT 8 #define THRESHOLD 3 #define INIT_CRC 0 #define WNDBIT 13 #define WNDSIZ (1U << WNDBIT) #define MAXMATCH 256 #define PERC_FLAG 0x8000U #define CODE_BIT 16 #define NIL 0 #define MAX_HASH_VAL (3 * WNDSIZ + (WNDSIZ / 512 + 1) * UINT8_MAX) #define HASH(p, c) ((p) + ((c) << (WNDBIT - 9)) + WNDSIZ * 2) #define CRCPOLY 0xA001 #define UPDATE_CRC(c) mCrc = mCrcTable[(mCrc ^ (c)) & 0xFF] ^ (mCrc >> UINT8_BIT) // // C: the Char&Len Set; P: the Position Set; T: the exTra Set // #define NC (UINT8_MAX + MAXMATCH + 2 - THRESHOLD) #define CBIT 9 #define NP (WNDBIT + 1) //#define PBIT 4 UINT8 gPBIT = 4; #define NT (CODE_BIT + 3) #define TBIT 5 #if NT > NP #define NPT NT #else #define NPT NP #endif // // Function Prototypes // STATIC VOID PutDword( IN UINT32 Data ); STATIC EFI_STATUS AllocateMemory (VOID); STATIC VOID FreeMemory (VOID); STATIC VOID InitSlide (VOID); STATIC NODE Child ( IN NODE q, IN UINT8 c ); STATIC VOID MakeChild ( IN NODE q, IN UINT8 c, IN NODE r ); STATIC VOID Split ( IN NODE Old ); STATIC VOID InsertNode (VOID); STATIC VOID DeleteNode (VOID); STATIC VOID GetNextMatch (VOID); STATIC EFI_STATUS Encode (VOID); STATIC VOID CountTFreq (VOID); STATIC VOID WritePTLen ( IN INT32 n, IN INT32 nbit, IN INT32 Special ); STATIC VOID WriteCLen (VOID); STATIC VOID EncodeC ( IN INT32 c ); STATIC VOID EncodeP ( IN UINT32 p ); STATIC VOID SendBlock (VOID); STATIC VOID Output ( IN UINT32 c, IN UINT32 p ); STATIC VOID HufEncodeStart (VOID); STATIC VOID HufEncodeEnd (VOID); STATIC VOID MakeCrcTable (VOID); STATIC VOID PutBits ( IN INT32 n, IN UINT32 x ); STATIC INT32 FreadCrc ( OUT UINT8 *p, IN INT32 n ); STATIC VOID InitPutBits (VOID); STATIC VOID CountLen ( IN INT32 i ); STATIC VOID MakeLen ( IN INT32 Root ); STATIC VOID DownHeap ( IN INT32 i ); STATIC VOID MakeCode ( IN INT32 n, IN UINT8 Len[], OUT UINT16 Code[] ); STATIC INT32 MakeTree ( IN INT32 NParm, IN UINT16 FreqParm[], OUT UINT8 LenParm[], OUT UINT16 CodeParm[] ); // // Global Variables // STATIC UINT8 *mSrc, *mDst, *mSrcUpperLimit, *mDstUpperLimit; STATIC UINT8 *mLevel, *mText, *mChildCount, *mBuf, mCLen[NC], mPTLen[NPT], *mLen; STATIC INT16 mHeap[NC + 1]; STATIC INT32 mRemainder, mMatchLen, mBitCount, mHeapSize, mN; STATIC UINT32 mBufSiz = 0, mOutputPos, mOutputMask, mSubBitBuf, mCrc; STATIC UINT32 mCompSize, mOrigSize; STATIC UINT16 *mFreq, *mSortPtr, mLenCnt[17], mLeft[2 * NC - 1], mRight[2 * NC - 1], mCrcTable[UINT8_MAX + 1], mCFreq[2 * NC - 1],mCCode[NC], mPFreq[2 * NP - 1], mPTCode[NPT], mTFreq[2 * NT - 1]; STATIC NODE mPos, mMatchPos, mAvail, *mPosition, *mParent, *mPrev, *mNext = NULL; // // functions // EFI_STATUS EfiCompress ( IN CONST VOID *SrcBuffer, IN UINT32 SrcSize, IN VOID *DstBuffer, IN OUT UINT32 *DstSize ) /*++ Routine Description: The main compression routine. Arguments: SrcBuffer - The buffer storing the source data SrcSize - The size of source data DstBuffer - The buffer to store the compressed data DstSize - On input, the size of DstBuffer; On output, the size of the actual compressed data. Returns: EFI_BUFFER_TOO_SMALL - The DstBuffer is too small. In this case, DstSize contains the size needed. EFI_SUCCESS - Compression is successful. --*/ { EFI_STATUS Status = EFI_SUCCESS; // // Initializations // mBufSiz = 0; mBuf = NULL; mText = NULL; mLevel = NULL; mChildCount = NULL; mPosition = NULL; mParent = NULL; mPrev = NULL; mNext = NULL; gPBIT = 4; mSrc = (UINT8*)SrcBuffer; mSrcUpperLimit = mSrc + SrcSize; mDst = DstBuffer; mDstUpperLimit = mDst + *DstSize; PutDword(0L); PutDword(0L); MakeCrcTable (); mOrigSize = mCompSize = 0; mCrc = INIT_CRC; // // Compress it // Status = Encode(); if (EFI_ERROR (Status)) { return EFI_OUT_OF_RESOURCES; } // // Null terminate the compressed data // if (mDst < mDstUpperLimit) { *mDst++ = 0; } // // Fill in compressed size and original size // mDst = DstBuffer; PutDword(mCompSize+1); PutDword(mOrigSize); // // Return // if (mCompSize + 1 + 8 > *DstSize) { *DstSize = mCompSize + 1 + 8; return EFI_BUFFER_TOO_SMALL; } else { *DstSize = mCompSize + 1 + 8; return EFI_SUCCESS; } } EFI_STATUS TianoCompress( IN CONST VOID *SrcBuffer, IN UINT32 SrcSize, IN VOID *DstBuffer, IN OUT UINT32 *DstSize ) /*++ Routine Description: The main compression routine. Arguments: SrcBuffer - The buffer storing the source data SrcSize - The size of source data DstBuffer - The buffer to store the compressed data DstSize - On input, the size of DstBuffer; On output, the size of the actual compressed data. Returns: EFI_BUFFER_TOO_SMALL - The DstBuffer is too small. In this case, DstSize contains the size needed. EFI_SUCCESS - Compression is successful. --*/ { EFI_STATUS Status = EFI_SUCCESS; // // Initializations // mBufSiz = 0; mBuf = NULL; mText = NULL; mLevel = NULL; mChildCount = NULL; mPosition = NULL; mParent = NULL; mPrev = NULL; mNext = NULL; gPBIT = 5; mSrc = (UINT8*)SrcBuffer; mSrcUpperLimit = mSrc + SrcSize; mDst = DstBuffer; mDstUpperLimit = mDst + *DstSize; PutDword(0L); PutDword(0L); MakeCrcTable(); mOrigSize = mCompSize = 0; mCrc = INIT_CRC; // // Compress it // Status = Encode(); if (EFI_ERROR(Status)) { return EFI_OUT_OF_RESOURCES; } // // Null terminate the compressed data // if (mDst < mDstUpperLimit) { *mDst++ = 0; } // // Fill in compressed size and original size // mDst = DstBuffer; PutDword(mCompSize + 1); PutDword(mOrigSize); // // Return // if (mCompSize + 1 + 8 > *DstSize) { *DstSize = mCompSize + 1 + 8; return EFI_BUFFER_TOO_SMALL; } else { *DstSize = mCompSize + 1 + 8; return EFI_SUCCESS; } } STATIC VOID PutDword( IN UINT32 Data ) /*++ Routine Description: Put a dword to output stream Arguments: Data - the dword to put Returns: (VOID) --*/ { if (mDst < mDstUpperLimit) { *mDst++ = (UINT8)(((UINT8)(Data )) & 0xff); } if (mDst < mDstUpperLimit) { *mDst++ = (UINT8)(((UINT8)(Data >> 0x08)) & 0xff); } if (mDst < mDstUpperLimit) { *mDst++ = (UINT8)(((UINT8)(Data >> 0x10)) & 0xff); } if (mDst < mDstUpperLimit) { *mDst++ = (UINT8)(((UINT8)(Data >> 0x18)) & 0xff); } } STATIC EFI_STATUS AllocateMemory () /*++ Routine Description: Allocate memory spaces for data structures used in compression process Argements: (VOID) Returns: EFI_SUCCESS - Memory is allocated successfully EFI_OUT_OF_RESOURCES - Allocation fails --*/ { UINT32 i; mText = malloc (WNDSIZ * 2 + MAXMATCH); if (!mText) return EFI_OUT_OF_RESOURCES; for (i = 0 ; i < WNDSIZ * 2 + MAXMATCH; i ++) { mText[i] = 0; } mLevel = malloc((WNDSIZ + UINT8_MAX + 1) * sizeof(*mLevel)); if (!mLevel) return EFI_OUT_OF_RESOURCES; mChildCount = malloc((WNDSIZ + UINT8_MAX + 1) * sizeof(*mChildCount)); if (!mChildCount) return EFI_OUT_OF_RESOURCES; mPosition = malloc((WNDSIZ + UINT8_MAX + 1) * sizeof(*mPosition)); if (!mPosition) return EFI_OUT_OF_RESOURCES; mParent = malloc(WNDSIZ * 2 * sizeof(*mParent)); if (!mParent) return EFI_OUT_OF_RESOURCES; mPrev = malloc(WNDSIZ * 2 * sizeof(*mPrev)); if (!mPrev) return EFI_OUT_OF_RESOURCES; mNext = malloc((MAX_HASH_VAL + 1) * sizeof(*mNext)); if (!mNext) return EFI_OUT_OF_RESOURCES; mBufSiz = 16 * 1024U; while ((mBuf = malloc(mBufSiz)) == NULL) { mBufSiz = (mBufSiz / 10U) * 9U; if (mBufSiz < 4 * 1024U) { return EFI_OUT_OF_RESOURCES; } } mBuf[0] = 0; return EFI_SUCCESS; } VOID FreeMemory () /*++ Routine Description: Called when compression is completed to free memory previously allocated. Arguments: (VOID) Returns: (VOID) --*/ { free (mText); free (mLevel); free (mChildCount); free (mPosition); free (mParent); free (mPrev); free (mNext); free (mBuf); } STATIC VOID InitSlide () /*++ Routine Description: Initialize String Info Log data structures Arguments: (VOID) Returns: (VOID) --*/ { NODE i; for (i = WNDSIZ; i <= (NODE)(WNDSIZ + UINT8_MAX); i++) { mLevel[i] = 1; mPosition[i] = NIL; /* sentinel */ } for (i = WNDSIZ; i < (NODE)(WNDSIZ * 2); i++) { mParent[i] = NIL; } mAvail = 1; for (i = 1; i < (NODE)(WNDSIZ - 1); i++) { mNext[i] = (NODE)(i + 1); } mNext[WNDSIZ - 1] = NIL; for (i = WNDSIZ * 2; i <= (NODE)MAX_HASH_VAL; i++) { mNext[i] = NIL; } } STATIC NODE Child ( IN NODE q, IN UINT8 c ) /*++ Routine Description: Find child node given the parent node and the edge character Arguments: q - the parent node c - the edge character Returns: The child node (NIL if not found) --*/ { NODE r; r = mNext[HASH(q, c)]; mParent[NIL] = q; /* sentinel */ while (mParent[r] != q) { r = mNext[r]; } return r; } STATIC VOID MakeChild ( IN NODE q, IN UINT8 c, IN NODE r ) /*++ Routine Description: Create a new child for a given parent node. Arguments: q - the parent node c - the edge character r - the child node Returns: (VOID) --*/ { NODE h, t; h = (NODE)HASH(q, c); t = mNext[h]; mNext[h] = r; mNext[r] = t; mPrev[t] = r; mPrev[r] = h; mParent[r] = q; mChildCount[q]++; } STATIC VOID Split ( NODE Old ) /*++ Routine Description: Split a node. Arguments: Old - the node to split Returns: (VOID) --*/ { NODE New, t; New = mAvail; mAvail = mNext[New]; mChildCount[New] = 0; t = mPrev[Old]; mPrev[New] = t; mNext[t] = New; t = mNext[Old]; mNext[New] = t; mPrev[t] = New; mParent[New] = mParent[Old]; mLevel[New] = (UINT8)mMatchLen; mPosition[New] = mPos; MakeChild(New, mText[mMatchPos + mMatchLen], Old); MakeChild(New, mText[mPos + mMatchLen], mPos); } STATIC VOID InsertNode () /*++ Routine Description: Insert string info for current position into the String Info Log Arguments: (VOID) Returns: (VOID) --*/ { NODE q, r, j, t; UINT8 c, *t1, *t2; if (mMatchLen >= 4) { // // We have just got a long match, the target tree // can be located by MatchPos + 1. Travese the tree // from bottom up to get to a proper starting point. // The usage of PERC_FLAG ensures proper node deletion // in DeleteNode() later. // mMatchLen--; r = (INT16)((mMatchPos + 1) | WNDSIZ); while ((q = mParent[r]) == NIL) { r = mNext[r]; } while (mLevel[q] >= mMatchLen) { r = q; q = mParent[q]; } t = q; while (mPosition[t] < 0) { mPosition[t] = mPos; t = mParent[t]; } if (t < (NODE)WNDSIZ) { mPosition[t] = (NODE)(mPos | PERC_FLAG); } } else { // // Locate the target tree // q = (INT16)(mText[mPos] + WNDSIZ); c = mText[mPos + 1]; if ((r = Child(q, c)) == NIL) { MakeChild(q, c, mPos); mMatchLen = 1; return; } mMatchLen = 2; } // // Traverse down the tree to find a match. // Update Position value along the route. // Node split or creation is involved. // for ( ; ; ) { if (r >= (NODE)WNDSIZ) { j = MAXMATCH; mMatchPos = r; } else { j = mLevel[r]; mMatchPos = (NODE)(mPosition[r] & ~PERC_FLAG); } if (mMatchPos >= mPos) { mMatchPos -= WNDSIZ; } t1 = &mText[mPos + mMatchLen]; t2 = &mText[mMatchPos + mMatchLen]; while (mMatchLen < j) { if (*t1 != *t2) { Split(r); return; } mMatchLen++; t1++; t2++; } if (mMatchLen >= MAXMATCH) { break; } mPosition[r] = mPos; q = r; if ((r = Child(q, *t1)) == NIL) { MakeChild(q, *t1, mPos); return; } mMatchLen++; } t = mPrev[r]; mPrev[mPos] = t; mNext[t] = mPos; t = mNext[r]; mNext[mPos] = t; mPrev[t] = mPos; mParent[mPos] = q; mParent[r] = NIL; // // Special usage of 'next' // mNext[r] = mPos; } STATIC VOID DeleteNode () /*++ Routine Description: Delete outdated string info. (The Usage of PERC_FLAG ensures a clean deletion) Arguments: (VOID) Returns: (VOID) --*/ { NODE q, r, s, t, u; if (mParent[mPos] == NIL) { return; } r = mPrev[mPos]; s = mNext[mPos]; mNext[r] = s; mPrev[s] = r; r = mParent[mPos]; mParent[mPos] = NIL; if (r >= (NODE)WNDSIZ || --mChildCount[r] > 1) { return; } t = (NODE)(mPosition[r] & ~PERC_FLAG); if (t >= mPos) { t -= WNDSIZ; } s = t; q = mParent[r]; while ((u = mPosition[q]) & PERC_FLAG) { u &= ~PERC_FLAG; if (u >= mPos) { u -= WNDSIZ; } if (u > s) { s = u; } mPosition[q] = (INT16)(s | WNDSIZ); q = mParent[q]; } if (q < (NODE)WNDSIZ) { if (u >= mPos) { u -= WNDSIZ; } if (u > s) { s = u; } mPosition[q] = (INT16)(s | WNDSIZ | PERC_FLAG); } s = Child(r, mText[t + mLevel[r]]); t = mPrev[s]; u = mNext[s]; mNext[t] = u; mPrev[u] = t; t = mPrev[r]; mNext[t] = s; mPrev[s] = t; t = mNext[r]; mPrev[t] = s; mNext[s] = t; mParent[s] = mParent[r]; mParent[r] = NIL; mNext[r] = mAvail; mAvail = r; } STATIC VOID GetNextMatch () /*++ Routine Description: Advance the current position (read in new data if needed). Delete outdated string info. Find a match string for current position. Arguments: (VOID) Returns: (VOID) --*/ { INT32 n; mRemainder--; if (++mPos == WNDSIZ * 2) { memmove(&mText[0], &mText[WNDSIZ], WNDSIZ + MAXMATCH); n = FreadCrc(&mText[WNDSIZ + MAXMATCH], WNDSIZ); mRemainder += n; mPos = WNDSIZ; } DeleteNode(); InsertNode(); } STATIC EFI_STATUS Encode () /*++ Routine Description: The main controlling routine for compression process. Arguments: (VOID) Returns: EFI_SUCCESS - The compression is successful EFI_OUT_0F_RESOURCES - Not enough memory for compression process --*/ { EFI_STATUS Status; INT32 LastMatchLen; NODE LastMatchPos; Status = AllocateMemory(); if (EFI_ERROR(Status)) { FreeMemory(); return Status; } InitSlide(); HufEncodeStart(); mRemainder = FreadCrc(&mText[WNDSIZ], WNDSIZ + MAXMATCH); mMatchLen = 0; mPos = WNDSIZ; InsertNode(); if (mMatchLen > mRemainder) { mMatchLen = mRemainder; } while (mRemainder > 0) { LastMatchLen = mMatchLen; LastMatchPos = mMatchPos; GetNextMatch(); if (mMatchLen > mRemainder) { mMatchLen = mRemainder; } if (mMatchLen > LastMatchLen || LastMatchLen < THRESHOLD) { // // Not enough benefits are gained by outputting a pointer, // so just output the original character // Output(mText[mPos - 1], 0); } else { // // Outputting a pointer is beneficial enough, do it. // Output(LastMatchLen + (UINT8_MAX + 1 - THRESHOLD), (mPos - LastMatchPos - 2) & (WNDSIZ - 1)); while (--LastMatchLen > 0) { GetNextMatch(); } if (mMatchLen > mRemainder) { mMatchLen = mRemainder; } } } HufEncodeEnd(); FreeMemory(); return EFI_SUCCESS; } STATIC VOID CountTFreq () /*++ Routine Description: Count the frequencies for the Extra Set Arguments: (VOID) Returns: (VOID) --*/ { INT32 i, k, n, Count; for (i = 0; i < NT; i++) { mTFreq[i] = 0; } n = NC; while (n > 0 && mCLen[n - 1] == 0) { n--; } i = 0; while (i < n) { k = mCLen[i++]; if (k == 0) { Count = 1; while (i < n && mCLen[i] == 0) { i++; Count++; } if (Count <= 2) { mTFreq[0] = (UINT16)(mTFreq[0] + Count); } else if (Count <= 18) { mTFreq[1]++; } else if (Count == 19) { mTFreq[0]++; mTFreq[1]++; } else { mTFreq[2]++; } } else { mTFreq[k + 2]++; } } } STATIC VOID WritePTLen ( IN INT32 n, IN INT32 nbit, IN INT32 Special ) /*++ Routine Description: Outputs the code length array for the Extra Set or the Position Set. Arguments: n - the number of symbols nbit - the number of bits needed to represent 'n' Special - the special symbol that needs to be take care of Returns: (VOID) --*/ { INT32 i, k; while (n > 0 && mPTLen[n - 1] == 0) { n--; } PutBits(nbit, n); i = 0; while (i < n) { k = mPTLen[i++]; if (k <= 6) { PutBits(3, k); } else { PutBits(k - 3, (1U << (k - 3)) - 2); } if (i == Special) { while (i < 6 && mPTLen[i] == 0) { i++; } PutBits(2, (i - 3) & 3); } } } STATIC VOID WriteCLen () /*++ Routine Description: Outputs the code length array for Char&Length Set Arguments: (VOID) Returns: (VOID) --*/ { INT32 i, k, n, Count; n = NC; while (n > 0 && mCLen[n - 1] == 0) { n--; } PutBits(CBIT, n); i = 0; while (i < n) { k = mCLen[i++]; if (k == 0) { Count = 1; while (i < n && mCLen[i] == 0) { i++; Count++; } if (Count <= 2) { for (k = 0; k < Count; k++) { PutBits(mPTLen[0], mPTCode[0]); } } else if (Count <= 18) { PutBits(mPTLen[1], mPTCode[1]); PutBits(4, Count - 3); } else if (Count == 19) { PutBits(mPTLen[0], mPTCode[0]); PutBits(mPTLen[1], mPTCode[1]); PutBits(4, 15); } else { PutBits(mPTLen[2], mPTCode[2]); PutBits(CBIT, Count - 20); } } else { PutBits(mPTLen[k + 2], mPTCode[k + 2]); } } } STATIC VOID EncodeC ( IN INT32 c ) { PutBits(mCLen[c], mCCode[c]); } STATIC VOID EncodeP ( IN UINT32 p ) { UINT32 c, q; c = 0; q = p; while (q) { q >>= 1; c++; } PutBits(mPTLen[c], mPTCode[c]); if (c > 1) { PutBits(c - 1, p & (0xFFFFU >> (17 - c))); } } STATIC VOID SendBlock () /*++ Routine Description: Huffman code the block and output it. Argument: (VOID) Returns: (VOID) --*/ { UINT32 i, k, Flags, Root, Pos, Size; Flags = 0; Root = MakeTree(NC, mCFreq, mCLen, mCCode); Size = mCFreq[Root]; PutBits(16, Size); if (Root >= NC) { CountTFreq(); Root = MakeTree(NT, mTFreq, mPTLen, mPTCode); if (Root >= NT) { WritePTLen(NT, TBIT, 3); } else { PutBits(TBIT, 0); PutBits(TBIT, Root); } WriteCLen(); } else { PutBits(TBIT, 0); PutBits(TBIT, 0); PutBits(CBIT, 0); PutBits(CBIT, Root); } Root = MakeTree(NP, mPFreq, mPTLen, mPTCode); if (Root >= NP) { WritePTLen(NP, gPBIT, -1); } else { PutBits(gPBIT, 0); PutBits(gPBIT, Root); } Pos = 0; for (i = 0; i < Size; i++) { if (i % UINT8_BIT == 0) { Flags = mBuf[Pos++]; } else { Flags <<= 1; } if (Flags & (1U << (UINT8_BIT - 1))) { EncodeC(mBuf[Pos++] + (1U << UINT8_BIT)); k = mBuf[Pos++] << UINT8_BIT; k += mBuf[Pos++]; EncodeP(k); } else { EncodeC(mBuf[Pos++]); } } for (i = 0; i < NC; i++) { mCFreq[i] = 0; } for (i = 0; i < NP; i++) { mPFreq[i] = 0; } } STATIC VOID Output ( IN UINT32 c, IN UINT32 p ) /*++ Routine Description: Outputs an Original Character or a Pointer Arguments: c - The original character or the 'String Length' element of a Pointer p - The 'Position' field of a Pointer Returns: (VOID) --*/ { STATIC UINT32 CPos; if ((mOutputMask >>= 1) == 0) { mOutputMask = 1U << (UINT8_BIT - 1); if (mOutputPos >= mBufSiz - 3 * UINT8_BIT) { SendBlock(); mOutputPos = 0; } CPos = mOutputPos++; mBuf[CPos] = 0; } mBuf[mOutputPos++] = (UINT8) c; mCFreq[c]++; if (c >= (1U << UINT8_BIT)) { mBuf[CPos] |= mOutputMask; mBuf[mOutputPos++] = (UINT8)(p >> UINT8_BIT); mBuf[mOutputPos++] = (UINT8) p; c = 0; while (p) { p >>= 1; c++; } mPFreq[c]++; } } STATIC VOID HufEncodeStart () { INT32 i; for (i = 0; i < NC; i++) { mCFreq[i] = 0; } for (i = 0; i < NP; i++) { mPFreq[i] = 0; } mOutputPos = mOutputMask = 0; InitPutBits(); return; } STATIC VOID HufEncodeEnd () { SendBlock(); // // Flush remaining bits // PutBits(UINT8_BIT - 1, 0); return; } STATIC VOID MakeCrcTable () { UINT32 i, j, r; for (i = 0; i <= UINT8_MAX; i++) { r = i; for (j = 0; j < UINT8_BIT; j++) { if (r & 1) { r = (r >> 1) ^ CRCPOLY; } else { r >>= 1; } } mCrcTable[i] = (UINT16)r; } } STATIC VOID PutBits ( IN INT32 n, IN UINT32 x ) /*++ Routine Description: Outputs rightmost n bits of x Argments: n - the rightmost n bits of the data is used x - the data Returns: (VOID) --*/ { UINT8 Temp; if (n < mBitCount) { mSubBitBuf |= x << (mBitCount -= n); } else { Temp = (UINT8)(mSubBitBuf | (x >> (n -= mBitCount))); if (mDst < mDstUpperLimit) { *mDst++ = Temp; } mCompSize++; if (n < UINT8_BIT) { mSubBitBuf = x << (mBitCount = UINT8_BIT - n); } else { Temp = (UINT8)(x >> (n - UINT8_BIT)); if (mDst < mDstUpperLimit) { *mDst++ = Temp; } mCompSize++; mSubBitBuf = x << (mBitCount = 2 * UINT8_BIT - n); } } } STATIC INT32 FreadCrc ( OUT UINT8 *p, IN INT32 n ) /*++ Routine Description: Read in source data Arguments: p - the buffer to hold the data n - number of bytes to read Returns: number of bytes actually read --*/ { INT32 i; for (i = 0; mSrc < mSrcUpperLimit && i < n; i++) { *p++ = *mSrc++; } n = i; p -= n; mOrigSize += n; while (--i >= 0) { UPDATE_CRC(*p++); } return n; } STATIC VOID InitPutBits () { mBitCount = UINT8_BIT; mSubBitBuf = 0; } STATIC VOID CountLen ( IN INT32 i ) /*++ Routine Description: Count the number of each code length for a Huffman tree. Arguments: i - the top node Returns: (VOID) --*/ { STATIC INT32 Depth = 0; if (i < mN) { mLenCnt[(Depth < 16) ? Depth : 16]++; } else { Depth++; CountLen(mLeft [i]); CountLen(mRight[i]); Depth--; } } STATIC VOID MakeLen ( IN INT32 Root ) /*++ Routine Description: Create code length array for a Huffman tree Arguments: Root - the root of the tree --*/ { INT32 i, k; UINT32 Cum; for (i = 0; i <= 16; i++) { mLenCnt[i] = 0; } CountLen(Root); // // Adjust the length count array so that // no code will be generated longer than its designated length // Cum = 0; for (i = 16; i > 0; i--) { Cum += mLenCnt[i] << (16 - i); } while (Cum != (1U << 16)) { mLenCnt[16]--; for (i = 15; i > 0; i--) { if (mLenCnt[i] != 0) { mLenCnt[i]--; mLenCnt[i+1] += 2; break; } } Cum--; } for (i = 16; i > 0; i--) { k = mLenCnt[i]; while (--k >= 0) { mLen[*mSortPtr++] = (UINT8)i; } } } STATIC VOID DownHeap ( IN INT32 i ) { INT32 j, k; // // priority queue: send i-th entry down heap // k = mHeap[i]; while ((j = 2 * i) <= mHeapSize) { if (j < mHeapSize && mFreq[mHeap[j]] > mFreq[mHeap[j + 1]]) { j++; } if (mFreq[k] <= mFreq[mHeap[j]]) { break; } mHeap[i] = mHeap[j]; i = j; } mHeap[i] = (INT16)k; } STATIC VOID MakeCode ( IN INT32 n, IN UINT8 Len[], OUT UINT16 Code[] ) /*++ Routine Description: Assign code to each symbol based on the code length array Arguments: n - number of symbols Len - the code length array Code - stores codes for each symbol Returns: (VOID) --*/ { INT32 i; UINT16 Start[18]; memset(Start, 0, sizeof(Start)); for (i = 1; i <= 16; i++) { Start[i + 1] = (UINT16)((Start[i] + mLenCnt[i]) << 1); } for (i = 0; i < n; i++) { Code[i] = Start[Len[i]]++; } } STATIC INT32 MakeTree ( IN INT32 NParm, IN UINT16 FreqParm[], OUT UINT8 LenParm[], OUT UINT16 CodeParm[] ) /*++ Routine Description: Generates Huffman codes given a frequency distribution of symbols Arguments: NParm - number of symbols FreqParm - frequency of each symbol LenParm - code length for each symbol CodeParm - code for each symbol Returns: Root of the Huffman tree. --*/ { INT32 i, j, k, Avail; // // make tree, calculate len[], return root // mN = NParm; mFreq = FreqParm; mLen = LenParm; Avail = mN; mHeapSize = 0; mHeap[1] = 0; for (i = 0; i < mN; i++) { mLen[i] = 0; if (mFreq[i]) { mHeap[++mHeapSize] = (INT16)i; } } if (mHeapSize < 2) { CodeParm[mHeap[1]] = 0; return mHeap[1]; } for (i = mHeapSize / 2; i >= 1; i--) { // // make priority queue // DownHeap(i); } mSortPtr = CodeParm; do { i = mHeap[1]; if (i < mN) { *mSortPtr++ = (UINT16)i; } mHeap[1] = mHeap[mHeapSize--]; DownHeap(1); j = mHeap[1]; if (j < mN) { *mSortPtr++ = (UINT16)j; } k = Avail++; mFreq[k] = (UINT16)(mFreq[i] + mFreq[j]); mHeap[1] = (INT16)k; DownHeap(1); mLeft[k] = (UINT16)i; mRight[k] = (UINT16)j; } while (mHeapSize > 1); mSortPtr = CodeParm; MakeLen(k); MakeCode(NParm, LenParm, CodeParm); // // return root // return k; } UEFITool-A66/common/Tiano/EfiTianoCompress.h000066400000000000000000000056511442134156300207350ustar00rootroot00000000000000/* EfiTianoCompress.h Copyright (c) 2014, Nikolaj Schlej. All rights reserved.
Copyright (c) 2004 - 2008, Intel Corporation. All rights reserved.
This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. Module Name: TianoCompress.h Abstract: Header file for compression routine. */ #ifndef EFITIANOCOMPRESS_H #define EFITIANOCOMPRESS_H #include #include #include "../basetypes.h" #ifdef __cplusplus extern "C" { #endif /*++ Routine Description: Tiano compression routine. Arguments: SrcBuffer - The buffer storing the source data SrcSize - The size of source data DstBuffer - The buffer to store the compressed data DstSize - On input, the size of DstBuffer; On output, the size of the actual compressed data. Returns: EFI_BUFFER_TOO_SMALL - The DstBuffer is too small. this case, DstSize contains the size needed. EFI_SUCCESS - Compression is successful. EFI_OUT_OF_RESOURCES - No resource to complete function. EFI_INVALID_PARAMETER - Parameter supplied is wrong. --*/ EFI_STATUS TianoCompress ( IN CONST VOID *SrcBuffer, IN UINT32 SrcSize, IN VOID *DstBuffer, IN OUT UINT32 *DstSize ); EFI_STATUS TianoCompressLegacy( CONST VOID *SrcBuffer, UINT32 SrcSize, VOID *DstBuffer, UINT32 *DstSize ); /*++ Routine Description: EFI 1.1 compression routine. Arguments: SrcBuffer - The buffer storing the source data SrcSize - The size of source data DstBuffer - The buffer to store the compressed data DstSize - On input, the size of DstBuffer; On output, the size of the actual compressed data. Returns: EFI_BUFFER_TOO_SMALL - The DstBuffer is too small. this case, DstSize contains the size needed. EFI_SUCCESS - Compression is successful. EFI_OUT_OF_RESOURCES - No resource to complete function. EFI_INVALID_PARAMETER - Parameter supplied is wrong. --*/ EFI_STATUS EfiCompress ( IN CONST VOID *SrcBuffer, IN UINT32 SrcSize, IN VOID *DstBuffer, IN OUT UINT32 *DstSize ); EFI_STATUS EfiCompressLegacy( CONST VOID *SrcBuffer, UINT32 SrcSize, VOID *DstBuffer, UINT32 *DstSize ); #ifdef __cplusplus } #endif #endif // EFITIANOCOMPRESS_H UEFITool-A66/common/Tiano/EfiTianoCompressLegacy.c000066400000000000000000000756251442134156300220650ustar00rootroot00000000000000/* EFI11/Tiano Compress Implementation Copyright (c) 2015, Nikolaj Schlej Copyright (c) 2006 - 2008, Intel Corporation This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHWARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. Module Name: EfiTianoCompressLegacy.c Abstract: Compression routine. The compression algorithm is a mixture of LZ77 and Huffman coding. LZ77 transforms the source data into a sequence of Original Characters and Pointers to repeated strings. This sequence is further divided into Blocks and Huffman codings are applied to each Block. Notes: This legacy compression code can produce incorrect output, but has better compression ratio as newer releases */ #include "EfiTianoCompress.h" // // Macro Definitions // #undef UINT8_MAX typedef INT32 NODE; #define UINT8_MAX 0xff #define UINT8_BIT 8 #define THRESHOLD 3 #define INIT_CRC 0 #define WNDBIT 19 #define WNDSIZ (1U << WNDBIT) #define MAXMATCH 256 #define BLKSIZ (1U << 14) // 16 * 1024U #define PERC_FLAG 0x80000000U #define CODE_BIT 16 #define NIL 0 #define MAX_HASH_VAL (3 * WNDSIZ + (WNDSIZ / 512 + 1) * UINT8_MAX) #define HASH(p, c) ((p) + ((c) << (WNDBIT - 9)) + WNDSIZ * 2) #define CRCPOLY 0xA001 #define UPDATE_CRC(c) mCrc = mCrcTable[(mCrc ^ (c)) & 0xFF] ^ (mCrc >> UINT8_BIT) // // C: the Char&Len Set; P: the Position Set; T: the exTra Set // #define NC (UINT8_MAX + MAXMATCH + 2 - THRESHOLD) #define CBIT 9 #define NP (WNDBIT + 1) //#define PBIT 5 #define NT (CODE_BIT + 3) #define TBIT 5 #if NT > NP #define NPT NT #else #define NPT NP #endif // // Function Prototypes // STATIC VOID PutDword( UINT32 Data ); STATIC INT32 AllocateMemory ( VOID ); STATIC VOID FreeMemory ( VOID ); STATIC VOID InitSlide ( VOID ); STATIC NODE Child ( NODE NodeQ, UINT8 CharC ); STATIC VOID MakeChild ( NODE NodeQ, UINT8 CharC, NODE NodeR ); STATIC VOID Split ( NODE Old ); STATIC VOID InsertNode ( VOID ); STATIC VOID DeleteNode ( VOID ); STATIC VOID GetNextMatch ( VOID ); STATIC INT32 Encode ( VOID ); STATIC VOID CountTFreq ( VOID ); STATIC VOID WritePTLen ( INT32 Number, INT32 nbit, INT32 Special ); STATIC VOID WriteCLen ( VOID ); STATIC VOID EncodeC ( INT32 Value ); STATIC VOID EncodeP ( UINT32 Value ); STATIC VOID SendBlock ( VOID ); STATIC VOID Output ( UINT32 c, UINT32 p ); STATIC VOID HufEncodeStart ( VOID ); STATIC VOID HufEncodeEnd ( VOID ); STATIC VOID MakeCrcTable ( VOID ); STATIC VOID PutBits ( INT32 Number, UINT32 Value ); STATIC INT32 FreadCrc ( UINT8 *Pointer, INT32 Number ); STATIC VOID InitPutBits ( VOID ); STATIC VOID CountLen ( INT32 Index ); STATIC VOID MakeLen ( INT32 Root ); STATIC VOID DownHeap ( INT32 Index ); STATIC VOID MakeCode ( INT32 Number, UINT8 Len[ ], UINT16 Code[] ); STATIC INT32 MakeTree ( INT32 NParm, UINT16 FreqParm[], UINT8 LenParm[ ], UINT16 CodeParm[] ); // // Global Variables // STATIC UINT8 *mSrc, *mDst, *mSrcUpperLimit, *mDstUpperLimit; STATIC UINT8 *mLevel, *mText, *mChildCount, *mBuf, mCLen[NC], mPTLen[NPT], *mLen; STATIC INT16 mHeap[NC + 1]; STATIC INT32 mRemainder, mMatchLen, mBitCount, mHeapSize, mN; STATIC UINT32 mBufSiz = 0, mOutputPos, mOutputMask, mSubBitBuf, mCrc; STATIC UINT32 mCompSize, mOrigSize; STATIC UINT16 *mFreq, *mSortPtr, mLenCnt[17], mLeft[2 * NC - 1], mRight[2 * NC - 1], mCrcTable[UINT8_MAX + 1], mCFreq[2 * NC - 1], mCCode[NC], mPFreq[2 * NP - 1], mPTCode[NPT], mTFreq[2 * NT - 1]; STATIC UINT8 mPbit; STATIC NODE mPos, mMatchPos, mAvail, *mPosition, *mParent, *mPrev, *mNext = NULL; // // functions // EFI_STATUS EfiCompressLegacy( CONST VOID *SrcBuffer, UINT32 SrcSize, VOID *DstBuffer, UINT32 *DstSize ) /*++ Routine Description: The internal implementation of [Efi/Tiano]Compress(). Arguments: SrcBuffer - The buffer storing the source data SrcSize - The size of source data DstBuffer - The buffer to store the compressed data DstSize - On input, the size of DstBuffer; On output, the size of the actual compressed data. Returns: EFI_BUFFER_TOO_SMALL - The DstBuffer is too small. this case, DstSize contains the size needed. EFI_SUCCESS - Compression is successful. EFI_OUT_OF_RESOURCES - No resource to complete function. EFI_INVALID_PARAMETER - Parameter supplied is wrong. --*/ { INT32 Status; // // Initializations // mPbit = 4; mBufSiz = 0; mBuf = NULL; mText = NULL; mLevel = NULL; mChildCount = NULL; mPosition = NULL; mParent = NULL; mPrev = NULL; mNext = NULL; mSrc = (UINT8*) SrcBuffer; mSrcUpperLimit = mSrc + SrcSize; mDst = DstBuffer; mDstUpperLimit = mDst + *DstSize; PutDword(0L); PutDword(0L); MakeCrcTable(); mOrigSize = mCompSize = 0; mCrc = INIT_CRC; // // Compress it // Status = Encode(); if (Status) { return EFI_OUT_OF_RESOURCES; } // // Null terminate the compressed data // if (mDst < mDstUpperLimit) { *mDst++ = 0; } // // Fill compressed size and original size // mDst = DstBuffer; PutDword(mCompSize + 1); PutDword(mOrigSize); // // Return // if (mCompSize + 1 + 8 > *DstSize) { *DstSize = mCompSize + 1 + 8; return EFI_BUFFER_TOO_SMALL; } else { *DstSize = mCompSize + 1 + 8; return EFI_SUCCESS; } } EFI_STATUS TianoCompressLegacy ( CONST VOID *SrcBuffer, UINT32 SrcSize, VOID *DstBuffer, UINT32 *DstSize ) /*++ Routine Description: The internal implementation of [Efi/Tiano]Compress(). Arguments: SrcBuffer - The buffer storing the source data SrcSize - The size of source data DstBuffer - The buffer to store the compressed data DstSize - On input, the size of DstBuffer; On output, the size of the actual compressed data. Version - The version of de/compression algorithm. Version 1 for UEFI 2.0 de/compression algorithm. Version 2 for Tiano de/compression algorithm. Returns: EFI_BUFFER_TOO_SMALL - The DstBuffer is too small. this case, DstSize contains the size needed. EFI_SUCCESS - Compression is successful. EFI_OUT_OF_RESOURCES - No resource to complete function. EFI_INVALID_PARAMETER - Parameter supplied is wrong. --*/ { INT32 Status; // // Initializations // mPbit = 5; mBufSiz = 0; mBuf = NULL; mText = NULL; mLevel = NULL; mChildCount = NULL; mPosition = NULL; mParent = NULL; mPrev = NULL; mNext = NULL; mSrc = (UINT8*) SrcBuffer; mSrcUpperLimit = mSrc + SrcSize; mDst = DstBuffer; mDstUpperLimit = mDst +*DstSize; PutDword (0L); PutDword (0L); MakeCrcTable (); mOrigSize = mCompSize = 0; mCrc = INIT_CRC; // // Compress it // Status = Encode (); if (Status) { return EFI_OUT_OF_RESOURCES; } // // Null terminate the compressed data // if (mDst < mDstUpperLimit) { *mDst++ = 0; } // // Fill compressed size and original size // mDst = DstBuffer; PutDword (mCompSize + 1); PutDword (mOrigSize); // // Return // if (mCompSize + 1 + 8 > *DstSize) { *DstSize = mCompSize + 1 + 8; return EFI_BUFFER_TOO_SMALL; } else { *DstSize = mCompSize + 1 + 8; return EFI_SUCCESS; } } STATIC VOID PutDword ( UINT32 Data ) /*++ Routine Description: Put a DWORD to output stream Arguments: Data - the DWORD to put Returns: (VOID) --*/ { if (mDst < mDstUpperLimit) { *mDst++ = (UINT8) (((UINT8) (Data)) & 0xff); } if (mDst < mDstUpperLimit) { *mDst++ = (UINT8) (((UINT8) (Data >> 0x08)) & 0xff); } if (mDst < mDstUpperLimit) { *mDst++ = (UINT8) (((UINT8) (Data >> 0x10)) & 0xff); } if (mDst < mDstUpperLimit) { *mDst++ = (UINT8) (((UINT8) (Data >> 0x18)) & 0xff); } } STATIC INT32 AllocateMemory ( VOID ) /*++ Routine Description: Allocate memory spaces for data structures used compression process Arguments: VOID Returns: EFI_SUCCESS - Memory is allocated successfully EFI_OUT_OF_RESOURCES - Allocation fails --*/ { UINT32 Index; mText = malloc (WNDSIZ * 2 + MAXMATCH); if (!mText) return EFI_OUT_OF_RESOURCES; for (Index = 0; Index < WNDSIZ * 2 + MAXMATCH; Index++) { mText[Index] = 0; } mLevel = malloc ((WNDSIZ + UINT8_MAX + 1) * sizeof (*mLevel)); if (!mLevel) return EFI_OUT_OF_RESOURCES; mChildCount = malloc ((WNDSIZ + UINT8_MAX + 1) * sizeof (*mChildCount)); if (!mChildCount) return EFI_OUT_OF_RESOURCES; mPosition = malloc ((WNDSIZ + UINT8_MAX + 1) * sizeof (*mPosition)); if (!mPosition) return EFI_OUT_OF_RESOURCES; mParent = malloc (WNDSIZ * 2 * sizeof (*mParent)); if (!mParent) return EFI_OUT_OF_RESOURCES; mPrev = malloc (WNDSIZ * 2 * sizeof (*mPrev)); if (!mPrev) return EFI_OUT_OF_RESOURCES; mNext = malloc ((MAX_HASH_VAL + 1) * sizeof (*mNext)); if (!mNext) return EFI_OUT_OF_RESOURCES; mBufSiz = BLKSIZ; mBuf = malloc (mBufSiz); while (mBuf == NULL) { mBufSiz = (mBufSiz / 10U) * 9U; if (mBufSiz < 4 * 1024U) { return EFI_OUT_OF_RESOURCES; } mBuf = malloc (mBufSiz); } mBuf[0] = 0; return EFI_SUCCESS; } VOID FreeMemory ( VOID ) /*++ Routine Description: Called when compression is completed to free memory previously allocated. Arguments: (VOID) Returns: (VOID) --*/ { free (mText); free (mLevel); free (mChildCount); free (mPosition); free (mParent); free (mPrev); free (mNext); free (mBuf); } STATIC VOID InitSlide ( VOID ) /*++ Routine Description: Initialize String Info Log data structures Arguments: (VOID) Returns: (VOID) --*/ { NODE Index; for (Index = (NODE) WNDSIZ; Index <= (NODE) WNDSIZ + UINT8_MAX; Index++) { mLevel[Index] = 1; mPosition[Index] = NIL; // sentinel } for (Index = (NODE) WNDSIZ; Index < (NODE) WNDSIZ * 2; Index++) { mParent[Index] = NIL; } mAvail = 1; for (Index = 1; Index < (NODE) WNDSIZ - 1; Index++) { mNext[Index] = (NODE) (Index + 1); } mNext[WNDSIZ - 1] = NIL; for (Index = (NODE) WNDSIZ * 2; Index <= (NODE) MAX_HASH_VAL; Index++) { mNext[Index] = NIL; } } STATIC NODE Child ( NODE NodeQ, UINT8 CharC ) /*++ Routine Description: Find child node given the parent node and the edge character Arguments: NodeQ - the parent node CharC - the edge character Returns: The child node (NIL if not found) --*/ { NODE NodeR; NodeR = mNext[HASH (NodeQ, CharC)]; // // sentinel // mParent[NIL] = NodeQ; while (mParent[NodeR] != NodeQ) { NodeR = mNext[NodeR]; } return NodeR; } STATIC VOID MakeChild ( NODE Parent, UINT8 CharC, NODE Child ) /*++ Routine Description: Create a new child for a given parent node. Arguments: Parent - the parent node CharC - the edge character Child - the child node Returns: (VOID) --*/ { NODE Node1; NODE Node2; Node1 = (NODE) HASH (Parent, CharC); Node2 = mNext[Node1]; mNext[Node1] = Child; mNext[Child] = Node2; mPrev[Node2] = Child; mPrev[Child] = Node1; mParent[Child] = Parent; mChildCount[Parent]++; } STATIC VOID Split ( NODE Old ) /*++ Routine Description: Split a node. Arguments: Old - the node to split Returns: (VOID) --*/ { NODE New; NODE TempNode; New = mAvail; mAvail = mNext[New]; mChildCount[New] = 0; TempNode = mPrev[Old]; mPrev[New] = TempNode; mNext[TempNode] = New; TempNode = mNext[Old]; mNext[New] = TempNode; mPrev[TempNode] = New; mParent[New] = mParent[Old]; mLevel[New] = (UINT8) mMatchLen; mPosition[New] = mPos; MakeChild (New, mText[mMatchPos + mMatchLen], Old); MakeChild (New, mText[mPos + mMatchLen], mPos); } STATIC VOID InsertNode ( VOID ) /*++ Routine Description: Insert string info for current position into the String Info Log Arguments: (VOID) Returns: (VOID) --*/ { NODE NodeQ; NODE NodeR; NODE Index2; NODE NodeT; UINT8 CharC; UINT8 *t1; UINT8 *t2; if (mMatchLen >= 4) { // // We have just got a long match, the target tree // can be located by MatchPos + 1. Traverse the tree // from bottom up to get to a proper starting point. // The usage of PERC_FLAG ensures proper node deletion // DeleteNode() later. // mMatchLen--; NodeR = (NODE) ((mMatchPos + 1) | WNDSIZ); NodeQ = mParent[NodeR]; while (NodeQ == NIL) { NodeR = mNext[NodeR]; NodeQ = mParent[NodeR]; } while (mLevel[NodeQ] >= mMatchLen) { NodeR = NodeQ; NodeQ = mParent[NodeQ]; } NodeT = NodeQ; while (mPosition[NodeT] < 0) { mPosition[NodeT] = mPos; NodeT = mParent[NodeT]; } if (NodeT < (NODE) WNDSIZ) { mPosition[NodeT] = (NODE) (mPos | (UINT32) PERC_FLAG); } } else { // // Locate the target tree // NodeQ = (NODE) (mText[mPos] + WNDSIZ); CharC = mText[mPos + 1]; NodeR = Child (NodeQ, CharC); if (NodeR == NIL) { MakeChild (NodeQ, CharC, mPos); mMatchLen = 1; return ; } mMatchLen = 2; } // // Traverse down the tree to find a match. // Update Position value along the route. // Node split or creation is involved. // for (;;) { if (NodeR >= (NODE) WNDSIZ) { Index2 = MAXMATCH; mMatchPos = NodeR; } else { Index2 = mLevel[NodeR]; mMatchPos = (NODE) (mPosition[NodeR] & (UINT32)~PERC_FLAG); } if (mMatchPos >= mPos) { mMatchPos -= WNDSIZ; } t1 = &mText[mPos + mMatchLen]; t2 = &mText[mMatchPos + mMatchLen]; while (mMatchLen < Index2) { if (*t1 != *t2) { Split (NodeR); return ; } mMatchLen++; t1++; t2++; } if (mMatchLen >= MAXMATCH) { break; } mPosition[NodeR] = mPos; NodeQ = NodeR; NodeR = Child (NodeQ, *t1); if (NodeR == NIL) { MakeChild (NodeQ, *t1, mPos); return ; } mMatchLen++; } NodeT = mPrev[NodeR]; mPrev[mPos] = NodeT; mNext[NodeT] = mPos; NodeT = mNext[NodeR]; mNext[mPos] = NodeT; mPrev[NodeT] = mPos; mParent[mPos] = NodeQ; mParent[NodeR] = NIL; // // Special usage of 'next' // mNext[NodeR] = mPos; } STATIC VOID DeleteNode ( VOID ) /*++ Routine Description: Delete outdated string info. (The Usage of PERC_FLAG ensures a clean deletion) Arguments: (VOID) Returns: (VOID) --*/ { NODE NodeQ; NODE NodeR; NODE NodeS; NODE NodeT; NODE NodeU; if (mParent[mPos] == NIL) { return ; } NodeR = mPrev[mPos]; NodeS = mNext[mPos]; mNext[NodeR] = NodeS; mPrev[NodeS] = NodeR; NodeR = mParent[mPos]; mParent[mPos] = NIL; if (NodeR >= (NODE) WNDSIZ) { return ; } mChildCount[NodeR]--; if (mChildCount[NodeR] > 1) { return ; } NodeT = (NODE) (mPosition[NodeR] & (UINT32)~PERC_FLAG); if (NodeT >= mPos) { NodeT -= WNDSIZ; } NodeS = NodeT; NodeQ = mParent[NodeR]; NodeU = mPosition[NodeQ]; while (NodeU & (UINT32) PERC_FLAG) { NodeU &= (UINT32)~PERC_FLAG; if (NodeU >= mPos) { NodeU -= WNDSIZ; } if (NodeU > NodeS) { NodeS = NodeU; } mPosition[NodeQ] = (NODE) (NodeS | WNDSIZ); NodeQ = mParent[NodeQ]; NodeU = mPosition[NodeQ]; } if (NodeQ < (NODE) WNDSIZ) { if (NodeU >= mPos) { NodeU -= WNDSIZ; } if (NodeU > NodeS) { NodeS = NodeU; } mPosition[NodeQ] = (NODE) (NodeS | WNDSIZ | (UINT32) PERC_FLAG); } NodeS = Child (NodeR, mText[NodeT + mLevel[NodeR]]); NodeT = mPrev[NodeS]; NodeU = mNext[NodeS]; mNext[NodeT] = NodeU; mPrev[NodeU] = NodeT; NodeT = mPrev[NodeR]; mNext[NodeT] = NodeS; mPrev[NodeS] = NodeT; NodeT = mNext[NodeR]; mPrev[NodeT] = NodeS; mNext[NodeS] = NodeT; mParent[NodeS] = mParent[NodeR]; mParent[NodeR] = NIL; mNext[NodeR] = mAvail; mAvail = NodeR; } STATIC VOID GetNextMatch ( VOID ) /*++ Routine Description: Advance the current position (read new data if needed). Delete outdated string info. Find a match string for current position. Arguments: (VOID) Returns: (VOID) --*/ { INT32 Number; mRemainder--; mPos++; if (mPos == WNDSIZ * 2) { memmove (&mText[0], &mText[WNDSIZ], WNDSIZ + MAXMATCH); Number = FreadCrc (&mText[WNDSIZ + MAXMATCH], WNDSIZ); mRemainder += Number; mPos = WNDSIZ; } DeleteNode (); InsertNode (); } STATIC INT32 Encode ( VOID ) /*++ Routine Description: The mac controlling routine for compression process. Arguments: (VOID) Returns: EFI_SUCCESS - The compression is successful EFI_OUT_0F_RESOURCES - Not enough memory for compression process --*/ { INT32 Status; INT32 LastMatchLen; NODE LastMatchPos; Status = AllocateMemory (); if (Status) { FreeMemory (); return Status; } InitSlide (); HufEncodeStart (); mRemainder = FreadCrc (&mText[WNDSIZ], WNDSIZ + MAXMATCH); mMatchLen = 0; mPos = WNDSIZ; InsertNode (); if (mMatchLen > mRemainder) { mMatchLen = mRemainder; } while (mRemainder > 0) { LastMatchLen = mMatchLen; LastMatchPos = mMatchPos; GetNextMatch (); if (mMatchLen > mRemainder) { mMatchLen = mRemainder; } if (mMatchLen > LastMatchLen || LastMatchLen < THRESHOLD) { // // Not enough benefits are gained by outputting a pointer, // so just output the original character // Output (mText[mPos - 1], 0); } else { if (LastMatchLen == THRESHOLD) { if (((mPos - LastMatchPos - 2) & (WNDSIZ - 1)) > (1U << 11)) { Output (mText[mPos - 1], 0); continue; } } // // Outputting a pointer is beneficial enough, do it. // Output ( LastMatchLen + (UINT8_MAX + 1 - THRESHOLD), (mPos - LastMatchPos - 2) & (WNDSIZ - 1) ); LastMatchLen--; while (LastMatchLen > 0) { GetNextMatch (); LastMatchLen--; } if (mMatchLen > mRemainder) { mMatchLen = mRemainder; } } } HufEncodeEnd (); FreeMemory (); return EFI_SUCCESS; } STATIC VOID CountTFreq ( VOID ) /*++ Routine Description: Count the frequencies for the Extra Set Arguments: (VOID) Returns: (VOID) --*/ { INT32 Index; INT32 Index3; INT32 Number; INT32 Count; for (Index = 0; Index < NT; Index++) { mTFreq[Index] = 0; } Number = NC; while (Number > 0 && mCLen[Number - 1] == 0) { Number--; } Index = 0; while (Index < Number) { Index3 = mCLen[Index++]; if (Index3 == 0) { Count = 1; while (Index < Number && mCLen[Index] == 0) { Index++; Count++; } if (Count <= 2) { mTFreq[0] = (UINT16) (mTFreq[0] + Count); } else if (Count <= 18) { mTFreq[1]++; } else if (Count == 19) { mTFreq[0]++; mTFreq[1]++; } else { mTFreq[2]++; } } else { mTFreq[Index3 + 2]++; } } } STATIC VOID WritePTLen ( INT32 Number, INT32 nbit, INT32 Special ) /*++ Routine Description: Outputs the code length array for the Extra Set or the Position Set. Arguments: Number - the number of symbols nbit - the number of bits needed to represent 'n' Special - the special symbol that needs to be take care of Returns: (VOID) --*/ { INT32 Index; INT32 Index3; while (Number > 0 && mPTLen[Number - 1] == 0) { Number--; } PutBits (nbit, Number); Index = 0; while (Index < Number) { Index3 = mPTLen[Index++]; if (Index3 <= 6) { PutBits (3, Index3); } else { PutBits (Index3 - 3, (1U << (Index3 - 3)) - 2); } if (Index == Special) { while (Index < 6 && mPTLen[Index] == 0) { Index++; } PutBits (2, (Index - 3) & 3); } } } STATIC VOID WriteCLen ( VOID ) /*++ Routine Description: Outputs the code length array for Char&Length Set Arguments: (VOID) Returns: (VOID) --*/ { INT32 Index; INT32 Index3; INT32 Number; INT32 Count; Number = NC; while (Number > 0 && mCLen[Number - 1] == 0) { Number--; } PutBits (CBIT, Number); Index = 0; while (Index < Number) { Index3 = mCLen[Index++]; if (Index3 == 0) { Count = 1; while (Index < Number && mCLen[Index] == 0) { Index++; Count++; } if (Count <= 2) { for (Index3 = 0; Index3 < Count; Index3++) { PutBits (mPTLen[0], mPTCode[0]); } } else if (Count <= 18) { PutBits (mPTLen[1], mPTCode[1]); PutBits (4, Count - 3); } else if (Count == 19) { PutBits (mPTLen[0], mPTCode[0]); PutBits (mPTLen[1], mPTCode[1]); PutBits (4, 15); } else { PutBits (mPTLen[2], mPTCode[2]); PutBits (CBIT, Count - 20); } } else { PutBits (mPTLen[Index3 + 2], mPTCode[Index3 + 2]); } } } STATIC VOID EncodeC ( INT32 Value ) { PutBits (mCLen[Value], mCCode[Value]); } STATIC VOID EncodeP ( UINT32 Value ) { UINT32 Index; UINT32 NodeQ; Index = 0; NodeQ = Value; while (NodeQ) { NodeQ >>= 1; Index++; } PutBits (mPTLen[Index], mPTCode[Index]); if (Index > 1) { PutBits (Index - 1, Value & (0xFFFFFFFFU >> (32 - Index + 1))); } } STATIC VOID SendBlock ( VOID ) /*++ Routine Description: Huffman code the block and output it. Arguments: (VOID) Returns: (VOID) --*/ { UINT32 Index; UINT32 Index2; UINT32 Index3; UINT32 Flags; UINT32 Root; UINT32 Pos; UINT32 Size; Flags = 0; Root = MakeTree (NC, mCFreq, mCLen, mCCode); Size = mCFreq[Root]; PutBits (16, Size); if (Root >= NC) { CountTFreq (); Root = MakeTree (NT, mTFreq, mPTLen, mPTCode); if (Root >= NT) { WritePTLen (NT, TBIT, 3); } else { PutBits (TBIT, 0); PutBits (TBIT, Root); } WriteCLen (); } else { PutBits (TBIT, 0); PutBits (TBIT, 0); PutBits (CBIT, 0); PutBits (CBIT, Root); } Root = MakeTree (NP, mPFreq, mPTLen, mPTCode); if (Root >= NP) { WritePTLen (NP, mPbit, -1); } else { PutBits (mPbit, 0); PutBits (mPbit, Root); } Pos = 0; for (Index = 0; Index < Size; Index++) { if (Index % UINT8_BIT == 0) { Flags = mBuf[Pos++]; } else { Flags <<= 1; } if (Flags & (1U << (UINT8_BIT - 1))) { EncodeC (mBuf[Pos++] + (1U << UINT8_BIT)); Index3 = mBuf[Pos++]; for (Index2 = 0; Index2 < 3; Index2++) { Index3 <<= UINT8_BIT; Index3 += mBuf[Pos++]; } EncodeP (Index3); } else { EncodeC (mBuf[Pos++]); } } for (Index = 0; Index < NC; Index++) { mCFreq[Index] = 0; } for (Index = 0; Index < NP; Index++) { mPFreq[Index] = 0; } } STATIC VOID Output ( UINT32 CharC, UINT32 Pos ) /*++ Routine Description: Outputs an Original Character or a Pointer Arguments: CharC - The original character or the 'String Length' element of a Pointer Pos - The 'Position' field of a Pointer Returns: (VOID) --*/ { STATIC UINT32 CPos; if ((mOutputMask >>= 1) == 0) { mOutputMask = 1U << (UINT8_BIT - 1); // // Check the buffer overflow per outputting UINT8_BIT symbols // which is an Original Character or a Pointer. The biggest // symbol is a Pointer which occupies 5 bytes. // if (mOutputPos >= mBufSiz - 5 * UINT8_BIT) { SendBlock (); mOutputPos = 0; } CPos = mOutputPos++; mBuf[CPos] = 0; } mBuf[mOutputPos++] = (UINT8) CharC; mCFreq[CharC]++; if (CharC >= (1U << UINT8_BIT)) { mBuf[CPos] |= mOutputMask; mBuf[mOutputPos++] = (UINT8) (Pos >> 24); mBuf[mOutputPos++] = (UINT8) (Pos >> 16); mBuf[mOutputPos++] = (UINT8) (Pos >> (UINT8_BIT)); mBuf[mOutputPos++] = (UINT8) Pos; CharC = 0; while (Pos) { Pos >>= 1; CharC++; } mPFreq[CharC]++; } } STATIC VOID HufEncodeStart ( VOID ) { INT32 Index; for (Index = 0; Index < NC; Index++) { mCFreq[Index] = 0; } for (Index = 0; Index < NP; Index++) { mPFreq[Index] = 0; } mOutputPos = mOutputMask = 0; InitPutBits (); return ; } STATIC VOID HufEncodeEnd ( VOID ) { SendBlock (); // // Flush remaining bits // PutBits (UINT8_BIT - 1, 0); return ; } STATIC VOID MakeCrcTable ( VOID ) { UINT32 Index; UINT32 Index2; UINT32 Temp; for (Index = 0; Index <= UINT8_MAX; Index++) { Temp = Index; for (Index2 = 0; Index2 < UINT8_BIT; Index2++) { if (Temp & 1) { Temp = (Temp >> 1) ^ CRCPOLY; } else { Temp >>= 1; } } mCrcTable[Index] = (UINT16) Temp; } } STATIC VOID PutBits ( INT32 Number, UINT32 Value ) /*++ Routine Description: Outputs rightmost n bits of x Arguments: Number - the rightmost n bits of the data is used x - the data Returns: (VOID) --*/ { UINT8 Temp; while (Number >= mBitCount) { // // Number -= mBitCount should never equal to 32 // Temp = (UINT8) (mSubBitBuf | (Value >> (Number -= mBitCount))); if (mDst < mDstUpperLimit) { *mDst++ = Temp; } mCompSize++; mSubBitBuf = 0; mBitCount = UINT8_BIT; } mSubBitBuf |= Value << (mBitCount -= Number); } STATIC INT32 FreadCrc ( UINT8 *Pointer, INT32 Number ) /*++ Routine Description: Read source data Arguments: Pointer - the buffer to hold the data Number - number of bytes to read Returns: number of bytes actually read --*/ { INT32 Index; for (Index = 0; mSrc < mSrcUpperLimit && Index < Number; Index++) { *Pointer++ = *mSrc++; } Number = Index; Pointer -= Number; mOrigSize += Number; Index--; while (Index >= 0) { UPDATE_CRC (*Pointer++); Index--; } return Number; } STATIC VOID InitPutBits ( VOID ) { mBitCount = UINT8_BIT; mSubBitBuf = 0; } STATIC VOID CountLen ( INT32 Index ) /*++ Routine Description: Count the number of each code length for a Huffman tree. Arguments: Index - the top node Returns: (VOID) --*/ { STATIC INT32 Depth = 0; if (Index < mN) { mLenCnt[(Depth < 16) ? Depth : 16]++; } else { Depth++; CountLen (mLeft[Index]); CountLen (mRight[Index]); Depth--; } } STATIC VOID MakeLen ( INT32 Root ) /*++ Routine Description: Create code length array for a Huffman tree Arguments: Root - the root of the tree Returns: VOID --*/ { INT32 Index; INT32 Index3; UINT32 Cum; for (Index = 0; Index <= 16; Index++) { mLenCnt[Index] = 0; } CountLen (Root); // // Adjust the length count array so that // no code will be generated longer than its designated length // Cum = 0; for (Index = 16; Index > 0; Index--) { Cum += mLenCnt[Index] << (16 - Index); } while (Cum != (1U << 16)) { mLenCnt[16]--; for (Index = 15; Index > 0; Index--) { if (mLenCnt[Index] != 0) { mLenCnt[Index]--; mLenCnt[Index + 1] += 2; break; } } Cum--; } for (Index = 16; Index > 0; Index--) { Index3 = mLenCnt[Index]; Index3--; while (Index3 >= 0) { mLen[*mSortPtr++] = (UINT8) Index; Index3--; } } } STATIC VOID DownHeap ( INT32 Index ) { INT32 Index2; INT32 Index3; // // priority queue: send Index-th entry down heap // Index3 = mHeap[Index]; Index2 = 2 * Index; while (Index2 <= mHeapSize) { if (Index2 < mHeapSize && mFreq[mHeap[Index2]] > mFreq[mHeap[Index2 + 1]]) { Index2++; } if (mFreq[Index3] <= mFreq[mHeap[Index2]]) { break; } mHeap[Index] = mHeap[Index2]; Index = Index2; Index2 = 2 * Index; } mHeap[Index] = (INT16) Index3; } STATIC VOID MakeCode ( INT32 Number, UINT8 Len[ ], UINT16 Code[] ) /*++ Routine Description: Assign code to each symbol based on the code length array Arguments: Number - number of symbols Len - the code length array Code - stores codes for each symbol Returns: (VOID) --*/ { INT32 Index; UINT16 Start[18]; Start[1] = 0; for (Index = 1; Index <= 16; Index++) { Start[Index + 1] = (UINT16) ((Start[Index] + mLenCnt[Index]) << 1); } for (Index = 0; Index < Number; Index++) { Code[Index] = Start[Len[Index]]++; } } STATIC INT32 MakeTree ( INT32 NParm, UINT16 FreqParm[], UINT8 LenParm[ ], UINT16 CodeParm[] ) /*++ Routine Description: Generates Huffman codes given a frequency distribution of symbols Arguments: NParm - number of symbols FreqParm - frequency of each symbol LenParm - code length for each symbol CodeParm - code for each symbol Returns: Root of the Huffman tree. --*/ { INT32 Index; INT32 Index2; INT32 Index3; INT32 Avail; // // make tree, calculate len[], return root // mN = NParm; mFreq = FreqParm; mLen = LenParm; Avail = mN; mHeapSize = 0; mHeap[1] = 0; for (Index = 0; Index < mN; Index++) { mLen[Index] = 0; if (mFreq[Index]) { mHeapSize++; mHeap[mHeapSize] = (INT16) Index; } } if (mHeapSize < 2) { CodeParm[mHeap[1]] = 0; return mHeap[1]; } for (Index = mHeapSize / 2; Index >= 1; Index--) { // // make priority queue // DownHeap (Index); } mSortPtr = CodeParm; do { Index = mHeap[1]; if (Index < mN) { *mSortPtr++ = (UINT16) Index; } mHeap[1] = mHeap[mHeapSize--]; DownHeap (1); Index2 = mHeap[1]; if (Index2 < mN) { *mSortPtr++ = (UINT16) Index2; } Index3 = Avail++; mFreq[Index3] = (UINT16) (mFreq[Index] + mFreq[Index2]); mHeap[1] = (INT16) Index3; DownHeap (1); mLeft[Index3] = (UINT16) Index; mRight[Index3] = (UINT16) Index2; } while (mHeapSize > 1); mSortPtr = CodeParm; MakeLen (Index3); MakeCode (NParm, LenParm, CodeParm); // // return root // return Index3; } UEFITool-A66/common/Tiano/EfiTianoDecompress.c000066400000000000000000000646441442134156300212500ustar00rootroot00000000000000/*++ EfiTianoDecompress.c Copyright (c) 2018, LongSoft. All rights reserved.
Copyright (c) 2006 - 2018, Intel Corporation. All rights reserved.
Portions copyright (c) 2008 - 2009, Apple Inc. All rights reserved.
This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. Module Name: Decompress.c Abstract: UEFI Decompress Library implementation refer to UEFI specification. --*/ #include "EfiTianoDecompress.h" // // Decompression algorithm begins here // #define BITBUFSIZ 32 #define MAXMATCH 256 #define THRESHOLD 3 #define CODE_BIT 16 #ifndef UINT8_MAX #define UINT8_MAX 0xff #endif #define BAD_TABLE - 1 // // C: Char&Len Set; P: Position Set; T: exTra Set // #define NC (0xff + MAXMATCH + 2 - THRESHOLD) #define CBIT 9 #define MAXPBIT 5 #define TBIT 5 #define MAXNP ((1U << MAXPBIT) - 1) #define NT (CODE_BIT + 3) #if NT > MAXNP #define NPT NT #else #define NPT MAXNP #endif typedef struct { UINT8 *mSrcBase; // Starting address of compressed data UINT8 *mDstBase; // Starting address of decompressed data UINT32 mOutBuf; UINT32 mInBuf; UINT16 mBitCount; UINT32 mBitBuf; UINT32 mSubBitBuf; UINT16 mBlockSize; UINT32 mCompSize; UINT32 mOrigSize; UINT16 mBadTableFlag; UINT16 mLeft[2 * NC - 1]; UINT16 mRight[2 * NC - 1]; UINT8 mCLen[NC]; UINT8 mPTLen[NPT]; UINT16 mCTable[4096]; UINT16 mPTTable[256]; // // The length of the field 'Position Set Code Length Array Size' in Block Header. // For EFI 1.1 de/compression algorithm, mPBit = 4 // For Tiano de/compression algorithm, mPBit = 5 // UINT8 mPBit; } SCRATCH_DATA; STATIC UINT64 EFIAPI LShiftU64 ( UINT64 Operand, UINT32 Count ) { return Operand << Count; } STATIC VOID * EFIAPI SetMem ( OUT VOID *Buffer, IN UINTN Length, IN UINT8 Value ) { return memset (Buffer, Value, Length); } STATIC VOID * EFIAPI SetMem16 ( OUT VOID *Buffer, IN UINTN Length, IN UINT16 Value ) { UINTN Index; UINT16* Buf = (UINT16*)Buffer; if (Buffer == NULL || Length == 0) { return Buffer; } Length /= sizeof(UINT16); for (Index = 0; Index < Length; Index++) { Buf[Index] = Value; } return Buffer; } /** Read NumOfBit of bits from source into mBitBuf. Shift mBitBuf NumOfBits left. Read in NumOfBits of bits from source. @param Sd The global scratch data. @param NumOfBits The number of bits to shift and read. **/ STATIC VOID FillBuf ( IN SCRATCH_DATA *Sd, IN UINT16 NumOfBits ) { // // Left shift NumOfBits of bits in advance // Sd->mBitBuf = (UINT32)LShiftU64 (((UINT64)Sd->mBitBuf), NumOfBits); // // Copy data needed in bytes into mSbuBitBuf // while (NumOfBits > Sd->mBitCount) { NumOfBits = (UINT16)(NumOfBits - Sd->mBitCount); Sd->mBitBuf |= (UINT32)LShiftU64 (((UINT64)Sd->mSubBitBuf), NumOfBits); if (Sd->mCompSize > 0) { // // Get 1 byte into SubBitBuf // Sd->mCompSize--; Sd->mSubBitBuf = Sd->mSrcBase[Sd->mInBuf++]; Sd->mBitCount = 8; } else { // // No more bits from the source, just pad zero bit. // Sd->mSubBitBuf = 0; Sd->mBitCount = 8; } } // // Calculate additional bit count read to update mBitCount // Sd->mBitCount = (UINT16)(Sd->mBitCount - NumOfBits); // // Copy NumOfBits of bits from mSubBitBuf into mBitBuf // Sd->mBitBuf |= Sd->mSubBitBuf >> Sd->mBitCount; } /** Get NumOfBits of bits out from mBitBuf. Get NumOfBits of bits out from mBitBuf. Fill mBitBuf with subsequent NumOfBits of bits from source. Returns NumOfBits of bits that are popped out. @param Sd The global scratch data. @param NumOfBits The number of bits to pop and read. @return The bits that are popped out. **/ STATIC UINT32 GetBits ( IN SCRATCH_DATA *Sd, IN UINT16 NumOfBits ) { UINT32 OutBits; // // Pop NumOfBits of Bits from Left // OutBits = (UINT32)(Sd->mBitBuf >> (BITBUFSIZ - NumOfBits)); // // Fill up mBitBuf from source // FillBuf (Sd, NumOfBits); return OutBits; } /** Creates Huffman Code mapping table according to code length array. Creates Huffman Code mapping table for Extra Set, Char&Len Set and Position Set according to code length array. If TableBits > 16, then ASSERT (). @param Sd The global scratch data. @param NumOfChar The number of symbols in the symbol set. @param BitLen Code length array. @param TableBits The width of the mapping table. @param Table The table to be created. @retval 0 OK. @retval BAD_TABLE The table is corrupted. **/ STATIC UINT16 MakeTable ( IN SCRATCH_DATA *Sd, IN UINT16 NumOfChar, IN UINT8 *BitLen, IN UINT16 TableBits, OUT UINT16 *Table ) { UINT16 Count[17]; UINT16 Weight[17]; UINT16 Start[18]; UINT16 *Pointer; UINT16 Index3; UINT16 Index; UINT16 Len; UINT16 Char; UINT16 JuBits; UINT16 Avail; UINT16 NextCode; UINT16 Mask; UINT16 WordOfStart; UINT16 WordOfCount; UINT16 MaxTableLength; // // The maximum mapping table width supported by this internal // working function is 16. // if (TableBits >= (sizeof(Count) / sizeof(UINT16))) { return (UINT16)BAD_TABLE; } // // Initialize Count array starting from Index 0, as there is a possibility of Count array being uninitialized. // for (Index = 0; Index <= 16; Index++) { Count[Index] = 0; } for (Index = 0; Index < NumOfChar; Index++) { if (BitLen[Index] > 16) { return (UINT16)BAD_TABLE; } Count[BitLen[Index]]++; } Start[0] = 0; Start[1] = 0; for (Index = 1; Index <= 16; Index++) { WordOfStart = Start[Index]; WordOfCount = Count[Index]; Start[Index + 1] = (UINT16)(WordOfStart + (WordOfCount << (16 - Index))); } if (Start[17] != 0) { /*(1U << 16)*/ return (UINT16)BAD_TABLE; } JuBits = (UINT16)(16 - TableBits); Weight[0] = 0; for (Index = 1; Index <= TableBits; Index++) { Start[Index] >>= JuBits; Weight[Index] = (UINT16)(1U << (TableBits - Index)); } while (Index <= 16) { Weight[Index] = (UINT16)(1U << (16 - Index)); Index++; } Index = (UINT16)(Start[TableBits + 1] >> JuBits); if (Index != 0) { Index3 = (UINT16)(1U << TableBits); if (Index < Index3) { SetMem16 (Table + Index, (Index3 - Index) * sizeof(*Table), 0); } } Avail = NumOfChar; Mask = (UINT16)(1U << (15 - TableBits)); MaxTableLength = (UINT16)(1U << TableBits); for (Char = 0; Char < NumOfChar; Char++) { Len = BitLen[Char]; if (Len == 0 || Len >= 17) { continue; } NextCode = (UINT16)(Start[Len] + Weight[Len]); if (Len <= TableBits) { for (Index = Start[Len]; Index < NextCode; Index++) { if (Index >= MaxTableLength) { return (UINT16)BAD_TABLE; } Table[Index] = Char; } } else { Index3 = Start[Len]; Pointer = &Table[Index3 >> JuBits]; Index = (UINT16)(Len - TableBits); while (Index != 0) { if (*Pointer == 0 && Avail < (2 * NC - 1)) { Sd->mRight[Avail] = Sd->mLeft[Avail] = 0; *Pointer = Avail++; } if (*Pointer < (2 * NC - 1)) { if ((Index3 & Mask) != 0) { Pointer = &Sd->mRight[*Pointer]; } else { Pointer = &Sd->mLeft[*Pointer]; } } Index3 <<= 1; Index--; } *Pointer = Char; } Start[Len] = NextCode; } // // Succeeds // return 0; } /** Decodes a position value. Get a position value according to Position Huffman Table. @param Sd The global scratch data. @return The position value decoded. **/ UINT32 DecodeP ( IN SCRATCH_DATA *Sd ) { UINT16 Val; UINT32 Mask; UINT32 Pos; Val = Sd->mPTTable[Sd->mBitBuf >> (BITBUFSIZ - 8)]; if (Val >= MAXNP) { Mask = 1U << (BITBUFSIZ - 1 - 8); do { if ((Sd->mBitBuf & Mask) != 0) { Val = Sd->mRight[Val]; } else { Val = Sd->mLeft[Val]; } Mask >>= 1; } while (Val >= MAXNP); } // // Advance what we have read // FillBuf (Sd, Sd->mPTLen[Val]); Pos = Val; if (Val > 1) { Pos = (UINT32)((1U << (Val - 1)) + GetBits (Sd, (UINT16)(Val - 1))); } return Pos; } /** Reads code lengths for the Extra Set or the Position Set. Read in the Extra Set or Position Set Length Array, then generate the Huffman code mapping for them. @param Sd The global scratch data. @param nn The number of symbols. @param nbit The number of bits needed to represent nn. @param Special The special symbol that needs to be taken care of. @retval 0 OK. @retval BAD_TABLE Table is corrupted. **/ STATIC UINT16 ReadPTLen ( IN SCRATCH_DATA *Sd, IN UINT16 nn, IN UINT16 nbit, IN UINT16 Special ) { UINT16 Number; UINT16 CharC; UINT16 Index; UINT32 Mask; // // Read Extra Set Code Length Array size // Number = (UINT16)GetBits (Sd, nbit); if ((Number > sizeof(Sd->mPTLen)) || (nn > sizeof(Sd->mPTLen))) { // // Fail if Number or nn is greater than size of mPTLen // return (UINT16)BAD_TABLE; } if (Number == 0) { // // This represents only Huffman code used // CharC = (UINT16)GetBits (Sd, nbit); SetMem16 (&Sd->mPTTable[0], sizeof(Sd->mPTTable), CharC); SetMem (Sd->mPTLen, nn, 0); return 0; } Index = 0; while (Index < Number && Index < NPT) { CharC = (UINT16)(Sd->mBitBuf >> (BITBUFSIZ - 3)); // // If a code length is less than 7, then it is encoded as a 3-bit // value. Or it is encoded as a series of "1"s followed by a // terminating "0". The number of "1"s = Code length - 4. // if (CharC == 7) { Mask = 1U << (BITBUFSIZ - 1 - 3); while (Mask & Sd->mBitBuf) { Mask >>= 1; CharC += 1; } } FillBuf(Sd, (UINT16)((CharC < 7) ? 3 : CharC - 3)); Sd->mPTLen[Index++] = (UINT8)CharC; // // For Code&Len Set, // After the third length of the code length concatenation, // a 2-bit value is used to indicated the number of consecutive // zero lengths after the third length. // if (Index == Special) { CharC = (UINT16)GetBits (Sd, 2); while ((INT16)(--CharC) >= 0 && Index < NPT) { Sd->mPTLen[Index++] = 0; } } } while (Index < nn && Index < NPT) { Sd->mPTLen[Index++] = 0; } return MakeTable (Sd, nn, Sd->mPTLen, 8, Sd->mPTTable); } /** Reads code lengths for Char&Len Set. Read in and decode the Char&Len Set Code Length Array, then generate the Huffman Code mapping table for the Char&Len Set. @param Sd The global scratch data. **/ STATIC VOID ReadCLen ( SCRATCH_DATA *Sd ) { UINT16 Number; UINT16 CharC; UINT16 Index; UINT32 Mask; Number = (UINT16)GetBits (Sd, CBIT); if (Number == 0) { // // This represents only Huffman code used // CharC = (UINT16)GetBits (Sd, CBIT); SetMem (Sd->mCLen, NC, 0); SetMem16 (&Sd->mCTable[0], sizeof(Sd->mCTable), CharC); return; } Index = 0; while (Index < Number && Index < NC) { CharC = Sd->mPTTable[Sd->mBitBuf >> (BITBUFSIZ - 8)]; if (CharC >= NT) { Mask = 1U << (BITBUFSIZ - 1 - 8); do { if (Mask & Sd->mBitBuf) { CharC = Sd->mRight[CharC]; } else { CharC = Sd->mLeft[CharC]; } Mask >>= 1; } while (CharC >= NT); } // // Advance what we have read // FillBuf (Sd, Sd->mPTLen[CharC]); if (CharC <= 2) { if (CharC == 0) { CharC = 1; } else if (CharC == 1) { CharC = (UINT16)(GetBits (Sd, 4) + 3); } else if (CharC == 2) { CharC = (UINT16)(GetBits (Sd, CBIT) + 20); } while ((INT16)(--CharC) >= 0 && Index < NC) { Sd->mCLen[Index++] = 0; } } else { Sd->mCLen[Index++] = (UINT8)(CharC - 2); } } SetMem (Sd->mCLen + Index, NC - Index, 0); MakeTable (Sd, NC, Sd->mCLen, 12, Sd->mCTable); return; } /** Decode a character/length value. Read one value from mBitBuf, Get one code from mBitBuf. If it is at block boundary, generates Huffman code mapping table for Extra Set, Code&Len Set and Position Set. @param Sd The global scratch data. @return The value decoded. **/ STATIC UINT16 DecodeC ( SCRATCH_DATA *Sd ) { UINT16 Index2; UINT32 Mask; if (Sd->mBlockSize == 0) { // // Starting a new block // Read BlockSize from block header // Sd->mBlockSize = (UINT16)GetBits (Sd, 16); // // Read in the Extra Set Code Length Array, // Generate the Huffman code mapping table for Extra Set. // Sd->mBadTableFlag = ReadPTLen (Sd, NT, TBIT, 3); if (Sd->mBadTableFlag != 0) { return 0; } // // Read in and decode the Char&Len Set Code Length Array, // Generate the Huffman code mapping table for Char&Len Set. // ReadCLen (Sd); // // Read in the Position Set Code Length Array, // Generate the Huffman code mapping table for the Position Set. // Sd->mBadTableFlag = ReadPTLen (Sd, MAXNP, Sd->mPBit, (UINT16)(-1)); if (Sd->mBadTableFlag != 0) { return 0; } } // // Get one code according to Code&Set Huffman Table // Sd->mBlockSize--; Index2 = Sd->mCTable[Sd->mBitBuf >> (BITBUFSIZ - 12)]; if (Index2 >= NC) { Mask = 1U << (BITBUFSIZ - 1 - 12); do { if ((Sd->mBitBuf & Mask) != 0) { Index2 = Sd->mRight[Index2]; } else { Index2 = Sd->mLeft[Index2]; } Mask >>= 1; } while (Index2 >= NC); } // // Advance what we have read // FillBuf (Sd, Sd->mCLen[Index2]); return Index2; } /** Decode the source data and put the resulting data into the destination buffer. @param Sd The global scratch data. **/ STATIC VOID Decode ( SCRATCH_DATA *Sd ) { UINT16 BytesRemain; UINT32 DataIdx; UINT16 CharC; for (;;) { // // Get one code from mBitBuf // CharC = DecodeC(Sd); if (Sd->mBadTableFlag != 0) { goto Done; } if (CharC < 256) { // // Process an Original character // if (Sd->mOutBuf >= Sd->mOrigSize) { goto Done; } else { // // Write orignal character into mDstBase // Sd->mDstBase[Sd->mOutBuf++] = (UINT8)CharC; } } else { // // Process a Pointer // CharC = (UINT16)(CharC - (0x00000100U - THRESHOLD)); // // Get string length // BytesRemain = CharC; // // Locate string position // DataIdx = Sd->mOutBuf - DecodeP(Sd) - 1; // // Write BytesRemain of bytes into mDstBase // BytesRemain--; while ((INT16)(BytesRemain) >= 0) { if (Sd->mOutBuf >= Sd->mOrigSize) { goto Done; } if (DataIdx >= Sd->mOrigSize) { Sd->mBadTableFlag = (UINT16)BAD_TABLE; goto Done; } Sd->mDstBase[Sd->mOutBuf++] = Sd->mDstBase[DataIdx++]; BytesRemain--; } // // Once mOutBuf is fully filled, directly return // if (Sd->mOutBuf >= Sd->mOrigSize) { goto Done; } } } Done: return; } /** Given a compressed source buffer, this function retrieves the size of the uncompressed buffer and the size of the scratch buffer required to decompress the compressed source buffer. Retrieves the size of the uncompressed buffer and the temporary scratch buffer required to decompress the buffer specified by Source and SourceSize. If the size of the uncompressed buffer or the size of the scratch buffer cannot be determined from the compressed data specified by Source and SourceData, then EFI_INVALID_PARAMETER is returned. Otherwise, the size of the uncompressed buffer is returned in DestinationSize, the size of the scratch buffer is returned in ScratchSize, and EFI_SUCCESS is returned. This function does not have scratch buffer available to perform a thorough checking of the validity of the source data. It just retrieves the "Original Size" field from the beginning bytes of the source data and output it as DestinationSize. And ScratchSize is specific to the decompression implementation. @param Source The source buffer containing the compressed data. @param SourceSize The size, in bytes, of the source buffer. @param DestinationSize A pointer to the size, in bytes, of the uncompressed buffer that will be generated when the compressed buffer specified by Source and SourceSize is decompressed. @param ScratchSize A pointer to the size, in bytes, of the scratch buffer that is required to decompress the compressed buffer specified by Source and SourceSize. @retval EFI_SUCCESS The size of the uncompressed data was returned in DestinationSize, and the size of the scratch buffer was returned in ScratchSize. @retval EFI_INVALID_PARAMETER The size of the uncompressed data or the size of the scratch buffer cannot be determined from the compressed data specified by Source and SourceSize. **/ EFI_STATUS EFIAPI GetInfo ( IN CONST VOID *Source, IN UINT32 SourceSize, OUT UINT32 *DestinationSize, OUT UINT32 *ScratchSize ) { UINT32 CompressedSize; if (Source == NULL || DestinationSize == NULL || ScratchSize == NULL || SourceSize < 8) { return EFI_INVALID_PARAMETER; } CompressedSize = *(UINT32 *)Source; if (SourceSize < (CompressedSize + 8) || (CompressedSize + 8) < 8) { return EFI_INVALID_PARAMETER; } *ScratchSize = sizeof(SCRATCH_DATA); *DestinationSize = *((UINT32 *)Source + 1); return EFI_SUCCESS; } /** Decompresses a compressed source buffer. Extracts decompressed data to its original form. This function is designed so that the decompression algorithm can be implemented without using any memory services. As a result, this function is not allowed to call any memory allocation services in its implementation. It is the caller's responsibility to allocate and free the Destination and Scratch buffers. If the compressed source data specified by Source is successfully decompressed into Destination, then RETURN_SUCCESS is returned. If the compressed source data specified by Source is not in a valid compressed data format, then RETURN_INVALID_PARAMETER is returned. @param Source The source buffer containing the compressed data. @param Destination The destination buffer to store the decompressed data. @param Scratch A temporary scratch buffer that is used to perform the decompression. This is an optional parameter that may be NULL if the required scratch buffer size is 0. @retval EFI_SUCCESS Decompression completed successfully, and the uncompressed buffer is returned in Destination. @retval EFI_INVALID_PARAMETER The source buffer specified by Source is corrupted (not in a valid compressed format). **/ EFI_STATUS EFIAPI Decompress ( IN CONST VOID *Source, IN UINT32 SrcSize, IN OUT VOID *Destination, IN UINT32 DstSize, IN OUT VOID *Scratch, IN UINT32 ScratchSize, IN UINT8 Version ) { UINT32 CompSize; UINT32 OrigSize; SCRATCH_DATA *Sd; CONST UINT8 *Src = Source; UINT8 *Dst = Destination; EFI_STATUS Status = EFI_SUCCESS; if (ScratchSize < sizeof(SCRATCH_DATA)) { return EFI_INVALID_PARAMETER; } Sd = (SCRATCH_DATA *)Scratch; if (SrcSize < 8) { return EFI_INVALID_PARAMETER; } CompSize = Src[0] + (Src[1] << 8) + (Src[2] << 16) + (Src[3] << 24); OrigSize = Src[4] + (Src[5] << 8) + (Src[6] << 16) + (Src[7] << 24); // // If compressed file size is 0, return // if (OrigSize == 0) { return Status; } if (SrcSize < CompSize + 8) { return EFI_INVALID_PARAMETER; } if (DstSize != OrigSize) { return EFI_INVALID_PARAMETER; } Src = Src + 8; SetMem (Sd, sizeof(SCRATCH_DATA), 0); // // The length of the field 'Position Set Code Length Array Size' in Block Header. // For EFI 1.1 de/compression algorithm(Version 1), mPBit = 4 // For Tiano de/compression algorithm(Version 2), mPBit = 5 // switch (Version) { case 1: Sd->mPBit = 4; break; case 2: Sd->mPBit = 5; break; default: // // Currently, only have 2 versions // return EFI_INVALID_PARAMETER; } Sd->mSrcBase = (UINT8*)Src; Sd->mDstBase = Dst; // // CompSize and OrigSize are calculated in bytes // Sd->mCompSize = CompSize; Sd->mOrigSize = OrigSize; // // Fill the first BITBUFSIZ bits // FillBuf (Sd, BITBUFSIZ); // // Decompress it // Decode (Sd); if (Sd->mBadTableFlag != 0) { // // Something wrong with the source // Status = EFI_INVALID_PARAMETER; } return Status; } /*++ Routine Description: The implementation of EFI_DECOMPRESS_PROTOCOL.GetInfo(). Arguments: This - The protocol instance pointer Source - The source buffer containing the compressed data. SrcSize - The size of source buffer DstSize - The size of destination buffer. ScratchSize - The size of scratch buffer. Returns: EFI_SUCCESS - The size of destination buffer and the size of scratch buffer are successful retrieved. EFI_INVALID_PARAMETER - The source data is corrupted --*/ EFI_STATUS EFIAPI EfiTianoGetInfo ( IN CONST VOID *Source, IN UINT32 SrcSize, OUT UINT32 *DstSize, OUT UINT32 *ScratchSize ) { return GetInfo (Source, SrcSize, DstSize, ScratchSize); } /*++ Routine Description: The implementation of EFI_DECOMPRESS_PROTOCOL.Decompress(). Arguments: This - The protocol instance pointer Source - The source buffer containing the compressed data. SrcSize - The size of source buffer Destination - The destination buffer to store the decompressed data DstSize - The size of destination buffer. Scratch - The buffer used internally by the decompress routine. This buffer is needed to store intermediate data. ScratchSize - The size of scratch buffer. Returns: EFI_SUCCESS - Decompression is successful EFI_INVALID_PARAMETER - The source data is corrupted --*/ EFI_STATUS EFIAPI EfiDecompress ( IN CONST VOID *Source, IN UINT32 SrcSize, IN OUT VOID *Destination, IN UINT32 DstSize, IN OUT VOID *Scratch, IN UINT32 ScratchSize ) { // // For EFI 1.1 de/compression algorithm, the version is 1. // return Decompress ( Source, SrcSize, Destination, DstSize, Scratch, ScratchSize, 1 ); } /*++ Routine Description: The implementation of EFI_TIANO_DECOMPRESS_PROTOCOL.Decompress(). Arguments: This - The protocol instance pointer Source - The source buffer containing the compressed data. SrcSize - The size of source buffer Destination - The destination buffer to store the decompressed data DstSize - The size of destination buffer. Scratch - The buffer used internally by the decompress routine. This buffer is needed to store intermediate data. ScratchSize - The size of scratch buffer. Returns: EFI_SUCCESS - Decompression is successful EFI_INVALID_PARAMETER - The source data is corrupted --*/ EFI_STATUS EFIAPI TianoDecompress ( IN CONST VOID *Source, IN UINT32 SrcSize, IN OUT VOID *Destination, IN UINT32 DstSize, IN OUT VOID *Scratch, IN UINT32 ScratchSize ) { // // For Tiano de/compression algorithm, the version is 2. // return Decompress ( Source, SrcSize, Destination, DstSize, Scratch, ScratchSize, 2 ); } UEFITool-A66/common/Tiano/EfiTianoDecompress.h000066400000000000000000000065331442134156300212460ustar00rootroot00000000000000/* EfiTianoDecompress.h Copyright (c) 2015, Nikolaj Schlej. All rights reserved.
Copyright (c) 2004 - 2008, Intel Corporation. All rights reserved.
This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. Module Name: Decompress.h Abstract: Header file for decompression routine. Providing both EFI and Tiano decompress algorithms. --*/ #ifndef EFITIANODECOMPRESS_H #define EFITIANODECOMPRESS_H #include #include #include "../basetypes.h" #ifdef __cplusplus extern "C" { #endif typedef struct EFI_TIANO_HEADER_ { UINT32 CompSize; UINT32 OrigSize; } EFI_TIANO_HEADER; /*++ Routine Description: The implementation is same as that of EFI_DECOMPRESS_PROTOCOL.GetInfo(). Arguments: Source - The source buffer containing the compressed data. SrcSize - The size of source buffer DstSize - The size of destination buffer. ScratchSize - The size of scratch buffer. Returns: EFI_SUCCESS - The size of destination buffer and the size of scratch buffer are successfully retrieved. EFI_INVALID_PARAMETER - The source data is corrupted --*/ EFI_STATUS EFIAPI EfiTianoGetInfo ( IN CONST VOID *Source, IN UINT32 SrcSize, OUT UINT32 *DstSize, OUT UINT32 *ScratchSize ); /*++ Routine Description: The implementation is same as that of EFI_DECOMPRESS_PROTOCOL.Decompress(). Arguments: Source - The source buffer containing the compressed data. SrcSize - The size of source buffer Destination - The destination buffer to store the decompressed data DstSize - The size of destination buffer. Scratch - The buffer used internally by the decompress routine. This buffer is needed to store intermediate data. ScratchSize - The size of scratch buffer. Returns: EFI_SUCCESS - Decompression is successful EFI_INVALID_PARAMETER - The source data is corrupted --*/ EFI_STATUS EFIAPI EfiDecompress( IN CONST VOID *Source, IN UINT32 SrcSize, IN OUT VOID *Destination, IN UINT32 DstSize, IN OUT VOID *Scratch, IN UINT32 ScratchSize ); /*++ Routine Description: The implementation is same as that of EFI_TIANO_DECOMPRESS_PROTOCOL.Decompress(). Arguments: Source - The source buffer containing the compressed data. SrcSize - The size of source buffer Destination - The destination buffer to store the decompressed data DstSize - The size of destination buffer. Scratch - The buffer used internally by the decompress routine. This buffer is needed to store intermediate data. ScratchSize - The size of scratch buffer. Returns: EFI_SUCCESS - Decompression is successful EFI_INVALID_PARAMETER - The source data is corrupted --*/ EFI_STATUS EFIAPI TianoDecompress( IN CONST VOID *Source, IN UINT32 SrcSize, IN OUT VOID *Destination, IN UINT32 DstSize, IN OUT VOID *Scratch, IN UINT32 ScratchSize ); #ifdef __cplusplus } #endif #endif // EFITIANODECOMPRESS_H UEFITool-A66/common/basetypes.h000066400000000000000000000164121442134156300164450ustar00rootroot00000000000000/* basetypes.h Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef BASETYPES_H #define BASETYPES_H #include #include #include // TODO: improve typedef size_t USTATUS; #define U_SUCCESS 0 #define U_INVALID_PARAMETER 1 #define U_BUFFER_TOO_SMALL 2 #define U_OUT_OF_RESOURCES 3 #define U_OUT_OF_MEMORY 4 #define U_FILE_OPEN 5 #define U_FILE_READ 6 #define U_FILE_WRITE 7 #define U_ITEM_NOT_FOUND 8 #define U_UNKNOWN_ITEM_TYPE 9 #define U_INVALID_FLASH_DESCRIPTOR 10 #define U_INVALID_REGION 11 #define U_EMPTY_REGION 12 #define U_BIOS_REGION_NOT_FOUND 13 #define U_VOLUMES_NOT_FOUND 14 #define U_INVALID_VOLUME 15 #define U_VOLUME_REVISION_NOT_SUPPORTED 16 #define U_COMPLEX_BLOCK_MAP 17 #define U_UNKNOWN_FFS 18 #define U_INVALID_FILE 19 #define U_INVALID_SECTION 20 #define U_UNKNOWN_SECTION 21 #define U_STANDARD_COMPRESSION_FAILED 22 #define U_CUSTOMIZED_COMPRESSION_FAILED 23 #define U_STANDARD_DECOMPRESSION_FAILED 24 #define U_CUSTOMIZED_DECOMPRESSION_FAILED 25 #define U_GZIP_DECOMPRESSION_FAILED 26 #define U_UNKNOWN_COMPRESSION_TYPE 27 #define U_DEPEX_PARSE_FAILED 28 #define U_UNKNOWN_EXTRACT_MODE 29 #define U_UNKNOWN_REPLACE_MODE 30 #define U_UNKNOWN_IMAGE_TYPE 31 #define U_UNKNOWN_PE_OPTIONAL_HEADER_TYPE 32 #define U_UNKNOWN_RELOCATION_TYPE 33 #define U_DIR_ALREADY_EXIST 34 #define U_DIR_CREATE 35 #define U_DIR_CHANGE 36 #define U_TRUNCATED_IMAGE 37 #define U_INVALID_CAPSULE 38 #define U_STORES_NOT_FOUND 39 #define U_INVALID_IMAGE 40 #define U_INVALID_RAW_AREA 41 #define U_INVALID_FIT 42 #define U_INVALID_MICROCODE 43 #define U_INVALID_ACM 44 #define U_INVALID_BOOT_GUARD_KEY_MANIFEST 45 #define U_INVALID_BOOT_GUARD_BOOT_POLICY 46 #define U_INVALID_TXT_CONF 47 #define U_ELEMENTS_NOT_FOUND 48 #define U_PEI_CORE_ENTRY_POINT_NOT_FOUND 49 #define U_INVALID_STORE_SIZE 50 #define U_UNKNOWN_COMPRESSION_ALGORITHM 51 #define U_NOTHING_TO_PATCH 52 #define U_UNKNOWN_PATCH_TYPE 53 #define U_PATCH_OFFSET_OUT_OF_BOUNDS 54 #define U_INVALID_SYMBOL 55 #define U_ZLIB_DECOMPRESSION_FAILED 56 #define U_INVALID_STORE 57 #define U_INVALID_MANIFEST 251 #define U_UNKNOWN_MANIFEST_HEADER_VERSION 252 #define U_INVALID_ME_PARTITION_TABLE 253 #define U_INVALID_ME_PARTITION 254 #define U_NOT_IMPLEMENTED 255 // EDK2 porting definitions typedef uint8_t BOOLEAN; typedef int8_t INT8; typedef uint8_t UINT8; typedef int16_t INT16; typedef uint16_t UINT16; typedef int32_t INT32; typedef uint32_t UINT32; typedef int64_t INT64; typedef uint64_t UINT64; typedef char CHAR8; typedef uint16_t CHAR16; typedef size_t UINTN; typedef ptrdiff_t INTN; #define CONST const #define VOID void #define STATIC static #ifndef INT32_MAX #define INT32_MAX 0x7fffffff #endif #ifndef TRUE #define TRUE ((BOOLEAN)(1==1)) #endif #ifndef FALSE #define FALSE ((BOOLEAN)(0==1)) #endif #define IN #define OUT #define EFIAPI #define EFI_STATUS UINTN #define EFI_SUCCESS U_SUCCESS #define EFI_INVALID_PARAMETER U_INVALID_PARAMETER #define EFI_OUT_OF_RESOURCES U_OUT_OF_RESOURCES #define EFI_BUFFER_TOO_SMALL U_BUFFER_TOO_SMALL #define EFI_ERROR(X) (X) // Compression algorithms #define COMPRESSION_ALGORITHM_UNKNOWN 0 #define COMPRESSION_ALGORITHM_NONE 1 #define COMPRESSION_ALGORITHM_EFI11 2 #define COMPRESSION_ALGORITHM_TIANO 3 #define COMPRESSION_ALGORITHM_UNDECIDED 4 #define COMPRESSION_ALGORITHM_LZMA 5 #define COMPRESSION_ALGORITHM_LZMA_INTEL_LEGACY 6 #define COMPRESSION_ALGORITHM_LZMAF86 7 #define COMPRESSION_ALGORITHM_GZIP 8 #define COMPRESSION_ALGORITHM_ZLIB 9 // Item create modes #define CREATE_MODE_APPEND 0 #define CREATE_MODE_PREPEND 1 #define CREATE_MODE_BEFORE 2 #define CREATE_MODE_AFTER 3 // Item extract modes #define EXTRACT_MODE_AS_IS 0 #define EXTRACT_MODE_BODY 1 #define EXTRACT_MODE_BODY_UNCOMPRESSED 2 // Item replace modes #define REPLACE_MODE_AS_IS 0 #define REPLACE_MODE_BODY 1 // Item patch modes #define PATCH_MODE_HEADER 0 #define PATCH_MODE_BODY 1 // Patch types #define PATCH_TYPE_OFFSET 'O' #define PATCH_TYPE_PATTERN 'P' // Erase polarity types #define ERASE_POLARITY_FALSE 0 #define ERASE_POLARITY_TRUE 1 #define ERASE_POLARITY_UNKNOWN 0xFF // Search modes #define SEARCH_MODE_HEADER 1 #define SEARCH_MODE_BODY 2 #define SEARCH_MODE_ALL 3 // EFI GUID typedef struct EFI_GUID_ { UINT32 Data1; UINT16 Data2; UINT16 Data3; UINT8 Data4[8]; } EFI_GUID; // EFI Time typedef struct EFI_TIME_ { UINT16 Year; // Year: 2000 - 20XX UINT8 Month; // Month: 1 - 12 UINT8 Day; // Day: 1 - 31 UINT8 Hour; // Hour: 0 - 23 UINT8 Minute; // Minute: 0 - 59 UINT8 Second; // Second: 0 - 59 UINT8 Reserved0; UINT32 Nanosecond; // Nanosecond: 0 - 999,999,999 INT16 TimeZone; // TimeZone: -1440 to 1440 or UNSPECIFIED (0x07FF) UINT8 Daylight; // Daylight: ADJUST_DAYLIGHT (1) or IN_DAYLIGHT (2) UINT8 Reserved1; } EFI_TIME; // Align to 4 or 8 bytes #define ALIGN4(Value) (((Value)+3) & ~3) #define ALIGN8(Value) (((Value)+7) & ~7) // Unused parameter declaration #define U_UNUSED_PARAMETER(x) ((void)x) // Assert macro #include #define ASSERT(x) assert(x) // Hash sizes in bytes #define SHA1_HASH_SIZE 0x14 #define SHA256_HASH_SIZE 0x20 #define SHA384_HASH_SIZE 0x30 #define SHA512_HASH_SIZE 0x40 #define SM3_HASH_SIZE 0x20 // TCG Algorithm Registry: Table 2 #define TCG_HASH_ALGORITHM_ID_SHA1 0x0004 #define TCG_HASH_ALGORITHM_ID_SHA256 0x000B #define TCG_HASH_ALGORITHM_ID_SHA384 0x000C #define TCG_HASH_ALGORITHM_ID_SHA512 0x000D #define TCG_HASH_ALGORITHM_ID_NULL 0x0010 #define TCG_HASH_ALGORITHM_ID_SM3 0x0012 // A workaround for compilers not supporting c++11 and c11 // for using PRIX64. #define __STDC_FORMAT_MACROS #include #if defined(__clang__) || defined(__GNUC__) #define ATTRIBUTE_FORMAT_(t,f,a) __attribute__((format(t, f, a))) #else #define ATTRIBUTE_FORMAT_(t,f,a) #endif #endif // BASETYPES_H UEFITool-A66/common/bstrlib/000077500000000000000000000000001442134156300157325ustar00rootroot00000000000000UEFITool-A66/common/bstrlib/LICENSE000066400000000000000000000027041442134156300167420ustar00rootroot00000000000000Copyright (c) 2014, Paul Hsieh All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of bstrlib nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. UEFITool-A66/common/bstrlib/bstrlib.c000066400000000000000000002675401442134156300175550ustar00rootroot00000000000000/* * This source file is part of the bstring string library. This code was * written by Paul Hsieh in 2002-2015, and is covered by the BSD open source * license and the GPL. Refer to the accompanying documentation for details * on usage and license. */ /* * bstrlib.c * * This file is the core module for implementing the bstring functions. */ #if defined (_MSC_VER) # define _CRT_SECURE_NO_WARNINGS #endif #include #include #include #include #include #include #include #include "bstrlib.h" /* Optionally include a mechanism for debugging memory */ #if defined(MEMORY_DEBUG) || defined(BSTRLIB_MEMORY_DEBUG) #include "memdbg.h" #endif #ifndef bstr__alloc #if defined (BSTRLIB_TEST_CANARY) void* bstr__alloc (size_t sz) { char* p = (char *) malloc (sz); memset (p, 'X', sz); return p; } #else #define bstr__alloc(x) malloc (x) #endif #endif #ifndef bstr__free #define bstr__free(p) free (p) #endif #ifndef bstr__realloc #define bstr__realloc(p,x) realloc ((p), (x)) #endif #ifndef bstr__memcpy #define bstr__memcpy(d,s,l) memcpy ((d), (s), (l)) #endif #ifndef bstr__memmove #define bstr__memmove(d,s,l) memmove ((d), (s), (l)) #endif #ifndef bstr__memset #define bstr__memset(d,c,l) memset ((d), (c), (l)) #endif #ifndef bstr__memcmp #define bstr__memcmp(d,c,l) memcmp ((d), (c), (l)) #endif #ifndef bstr__memchr #define bstr__memchr(s,c,l) memchr ((s), (c), (l)) #endif /* Just a length safe wrapper for memmove. */ #define bBlockCopy(D,S,L) { if ((L) > 0) bstr__memmove ((D),(S),(L)); } /* Compute the snapped size for a given requested size. By snapping to powers of 2 like this, repeated reallocations are avoided. */ static int snapUpSize (int i) { if (i < 8) { i = 8; } else { unsigned int j; j = (unsigned int) i; j |= (j >> 1); j |= (j >> 2); j |= (j >> 4); j |= (j >> 8); /* Ok, since int >= 16 bits */ #if (UINT_MAX != 0xffff) j |= (j >> 16); /* For 32 bit int systems */ #if (UINT_MAX > 0xffffffffUL) j |= (j >> 32); /* For 64 bit int systems */ #endif #endif /* Least power of two greater than i */ j++; if ((int) j >= i) i = (int) j; } return i; } /* int balloc (bstring b, int len) * * Increase the size of the memory backing the bstring b to at least olen + 1. */ int balloc (bstring b, int olen) { int len; if (b == NULL || b->data == NULL || b->slen < 0 || b->mlen <= 0 || b->mlen < b->slen || olen <= 0) { return BSTR_ERR; } if (olen >= b->mlen) { unsigned char * x; if ((len = snapUpSize (olen)) <= b->mlen) return BSTR_OK; /* Assume probability of a non-moving realloc is 0.125 */ if (7 * b->mlen < 8 * b->slen) { /* If slen is close to mlen in size then use realloc to reduce the memory defragmentation */ reallocStrategy:; x = (unsigned char *) bstr__realloc (b->data, (size_t) len + 1); if (x == NULL) { /* Since we failed, try allocating the tighest possible allocation */ len = olen; x = (unsigned char *) bstr__realloc (b->data, (size_t) len + 1); if (NULL == x) { return BSTR_ERR; } } } else { /* If slen is not close to mlen then avoid the penalty of copying the extra bytes that are allocated, but not considered part of the string */ if (NULL == (x = (unsigned char *) bstr__alloc ((size_t) len + 1))) { /* Perhaps there is no available memory for the two allocations to be in memory at once */ goto reallocStrategy; } else { if (b->slen) bstr__memcpy ((char *) x, (char *) b->data, (size_t) b->slen); bstr__free (b->data); } } b->data = x; b->mlen = len; b->data[b->slen] = (unsigned char) '\0'; #if defined (BSTRLIB_TEST_CANARY) if (len > b->slen + 1) { memchr (b->data + b->slen + 1, 'X', len - (b->slen + 1)); } #endif } return BSTR_OK; } /* int ballocmin (bstring b, int len) * * Set the size of the memory backing the bstring b to len or b->slen+1, * whichever is larger. Note that repeated use of this function can degrade * performance. */ int ballocmin (bstring b, int len) { unsigned char * s; if (b == NULL || b->data == NULL) return BSTR_ERR; if (b->slen >= INT_MAX || b->slen < 0) return BSTR_ERR; if (b->mlen <= 0 || b->mlen < b->slen || len <= 0) { return BSTR_ERR; } if (len < b->slen + 1) len = b->slen + 1; if (len != b->mlen) { s = (unsigned char *) bstr__realloc (b->data, (size_t) len); if (NULL == s) return BSTR_ERR; s[b->slen] = (unsigned char) '\0'; b->data = s; b->mlen = len; } return BSTR_OK; } /* bstring bfromcstr (const char * str) * * Create a bstring which contains the contents of the '\0' terminated char * * buffer str. */ bstring bfromcstr (const char * str) { bstring b; int i; size_t j; if (str == NULL) return NULL; j = (strlen) (str); i = snapUpSize ((int) (j + (2 - (j != 0)))); if (i <= (int) j) return NULL; b = (bstring) bstr__alloc (sizeof (struct tagbstring)); if (NULL == b) return NULL; b->slen = (int) j; if (NULL == (b->data = (unsigned char *) bstr__alloc (b->mlen = i))) { bstr__free (b); return NULL; } bstr__memcpy (b->data, str, j+1); return b; } /* bstring bfromcstrrangealloc (int minl, int maxl, const char* str) * * Create a bstring which contains the contents of the '\0' terminated * char* buffer str. The memory buffer backing the string is at least * minl characters in length, but an attempt is made to allocate up to * maxl characters. */ bstring bfromcstrrangealloc (int minl, int maxl, const char* str) { bstring b; int i; size_t j; /* Bad parameters? */ if (str == NULL) return NULL; if (maxl < minl || minl < 0) return NULL; /* Adjust lengths */ j = (strlen) (str); if ((size_t) minl < (j+1)) minl = (int) (j+1); if (maxl < minl) maxl = minl; i = maxl; b = (bstring) bstr__alloc (sizeof (struct tagbstring)); if (b == NULL) return NULL; b->slen = (int) j; while (NULL == (b->data = (unsigned char *) bstr__alloc (b->mlen = i))) { int k = (i >> 1) + (minl >> 1); if (i == k || i < minl) { bstr__free (b); return NULL; } i = k; } bstr__memcpy (b->data, str, j+1); return b; } /* bstring bfromcstralloc (int mlen, const char * str) * * Create a bstring which contains the contents of the '\0' terminated * char* buffer str. The memory buffer backing the string is at least * mlen characters in length. */ bstring bfromcstralloc (int mlen, const char * str) { return bfromcstrrangealloc (mlen, mlen, str); } /* bstring blk2bstr (const void * blk, int len) * * Create a bstring which contains the content of the block blk of length * len. */ bstring blk2bstr (const void * blk, int len) { bstring b; int i; if (blk == NULL || len < 0) return NULL; b = (bstring) bstr__alloc (sizeof (struct tagbstring)); if (b == NULL) return NULL; b->slen = len; i = len + (2 - (len != 0)); i = snapUpSize (i); b->mlen = i; b->data = (unsigned char *) bstr__alloc ((size_t) b->mlen); if (b->data == NULL) { bstr__free (b); return NULL; } if (len > 0) bstr__memcpy (b->data, blk, (size_t) len); b->data[len] = (unsigned char) '\0'; return b; } /* char * bstr2cstr (const_bstring s, char z) * * Create a '\0' terminated char * buffer which is equal to the contents of * the bstring s, except that any contained '\0' characters are converted * to the character in z. This returned value should be freed with a * bcstrfree () call, by the calling application. */ char * bstr2cstr (const_bstring b, char z) { int i, l; char * r; if (b == NULL || b->slen < 0 || b->data == NULL) return NULL; l = b->slen; r = (char *) bstr__alloc ((size_t)l + 1); if (r == NULL) return r; for (i=0; i < l; i ++) { r[i] = (char) ((b->data[i] == '\0') ? z : (char) (b->data[i])); } r[l] = (unsigned char) '\0'; return r; } /* int bcstrfree (char * s) * * Frees a C-string generated by bstr2cstr (). This is normally unnecessary * since it just wraps a call to bstr__free (), however, if bstr__alloc () * and bstr__free () have been redefined as a macros within the bstrlib * module (via defining them in memdbg.h after defining * BSTRLIB_MEMORY_DEBUG) with some difference in behaviour from the std * library functions, then this allows a correct way of freeing the memory * that allows higher level code to be independent from these macro * redefinitions. */ int bcstrfree (char * s) { if (s) { bstr__free (s); return BSTR_OK; } return BSTR_ERR; } /* int bconcat (bstring b0, const_bstring b1) * * Concatenate the bstring b1 to the bstring b0. */ int bconcat (bstring b0, const_bstring b1) { int len, d; bstring aux = (bstring) b1; if (b0 == NULL || b1 == NULL || b0->data == NULL || b1->data == NULL) return BSTR_ERR; d = b0->slen; len = b1->slen; if ((d | (b0->mlen - d) | len | (d + len)) < 0) return BSTR_ERR; if (b0->mlen <= d + len + 1) { ptrdiff_t pd = b1->data - b0->data; if (0 <= pd && pd < b0->mlen) { if (NULL == (aux = bstrcpy (b1))) return BSTR_ERR; } if (balloc (b0, d + len + 1) != BSTR_OK) { if (aux != b1) bdestroy (aux); return BSTR_ERR; } } bBlockCopy (&b0->data[d], &aux->data[0], (size_t) len); b0->data[d + len] = (unsigned char) '\0'; b0->slen = d + len; if (aux != b1) bdestroy (aux); return BSTR_OK; } /* int bconchar (bstring b, char c) * * Concatenate the single character c to the bstring b. */ int bconchar (bstring b, char c) { int d; if (b == NULL) return BSTR_ERR; d = b->slen; if ((d | (b->mlen - d)) < 0 || balloc (b, d + 2) != BSTR_OK) return BSTR_ERR; b->data[d] = (unsigned char) c; b->data[d + 1] = (unsigned char) '\0'; b->slen++; return BSTR_OK; } /* int bcatcstr (bstring b, const char * s) * * Concatenate a char * string to a bstring. */ int bcatcstr (bstring b, const char * s) { char * d; int i, l; if (b == NULL || b->data == NULL || b->slen < 0 || b->mlen < b->slen || b->mlen <= 0 || s == NULL) return BSTR_ERR; /* Optimistically concatenate directly */ l = b->mlen - b->slen; d = (char *) &b->data[b->slen]; for (i=0; i < l; i++) { if ((*d++ = *s++) == '\0') { b->slen += i; return BSTR_OK; } } b->slen += i; /* Need to explicitely resize and concatenate tail */ return bcatblk (b, (const void *) s, (int) strlen (s)); } /* int bcatblk (bstring b, const void * s, int len) * * Concatenate a fixed length buffer to a bstring. */ int bcatblk (bstring b, const void * s, int len) { int nl; if (b == NULL || b->data == NULL || b->slen < 0 || b->mlen < b->slen || b->mlen <= 0 || s == NULL || len < 0) return BSTR_ERR; if (0 > (nl = b->slen + len)) return BSTR_ERR; /* Overflow? */ if (b->mlen <= nl && 0 > balloc (b, nl + 1)) return BSTR_ERR; bBlockCopy (&b->data[b->slen], s, (size_t) len); b->slen = nl; b->data[nl] = (unsigned char) '\0'; return BSTR_OK; } /* bstring bstrcpy (const_bstring b) * * Create a copy of the bstring b. */ bstring bstrcpy (const_bstring b) { bstring b0; int i,j; /* Attempted to copy an invalid string? */ if (b == NULL || b->slen < 0 || b->data == NULL) return NULL; b0 = (bstring) bstr__alloc (sizeof (struct tagbstring)); if (b0 == NULL) { /* Unable to allocate memory for string header */ return NULL; } i = b->slen; j = snapUpSize (i + 1); b0->data = (unsigned char *) bstr__alloc (j); if (b0->data == NULL) { j = i + 1; b0->data = (unsigned char *) bstr__alloc (j); if (b0->data == NULL) { /* Unable to allocate memory for string data */ bstr__free (b0); return NULL; } } b0->mlen = j; b0->slen = i; if (i) bstr__memcpy ((char *) b0->data, (char *) b->data, i); b0->data[b0->slen] = (unsigned char) '\0'; return b0; } /* int bassign (bstring a, const_bstring b) * * Overwrite the string a with the contents of string b. */ int bassign (bstring a, const_bstring b) { if (b == NULL || b->data == NULL || b->slen < 0) return BSTR_ERR; if (b->slen != 0) { if (balloc (a, b->slen) != BSTR_OK) return BSTR_ERR; bstr__memmove (a->data, b->data, b->slen); } else { if (a == NULL || a->data == NULL || a->mlen < a->slen || a->slen < 0 || a->mlen == 0) return BSTR_ERR; } a->data[b->slen] = (unsigned char) '\0'; a->slen = b->slen; return BSTR_OK; } /* int bassignmidstr (bstring a, const_bstring b, int left, int len) * * Overwrite the string a with the middle of contents of string b * starting from position left and running for a length len. left and * len are clamped to the ends of b as with the function bmidstr. */ int bassignmidstr (bstring a, const_bstring b, int left, int len) { if (b == NULL || b->data == NULL || b->slen < 0) return BSTR_ERR; if (left < 0) { len += left; left = 0; } if (len > b->slen - left) len = b->slen - left; if (a == NULL || a->data == NULL || a->mlen < a->slen || a->slen < 0 || a->mlen == 0) return BSTR_ERR; if (len > 0) { if (balloc (a, len) != BSTR_OK) return BSTR_ERR; bstr__memmove (a->data, b->data + left, len); a->slen = len; } else { a->slen = 0; } a->data[a->slen] = (unsigned char) '\0'; return BSTR_OK; } /* int bassigncstr (bstring a, const char * str) * * Overwrite the string a with the contents of char * string str. Note that * the bstring a must be a well defined and writable bstring. If an error * occurs BSTR_ERR is returned however a may be partially overwritten. */ int bassigncstr (bstring a, const char * str) { int i; size_t len; if (a == NULL || a->data == NULL || a->mlen < a->slen || a->slen < 0 || a->mlen == 0 || NULL == str) return BSTR_ERR; for (i=0; i < a->mlen; i++) { if ('\0' == (a->data[i] = str[i])) { a->slen = i; return BSTR_OK; } } a->slen = i; len = strlen (str + i); if (len + 1 > (size_t) INT_MAX - i || 0 > balloc (a, (int) (i + len + 1))) return BSTR_ERR; bBlockCopy (a->data + i, str + i, (size_t) len + 1); a->slen += (int) len; return BSTR_OK; } /* int bassignblk (bstring a, const void * s, int len) * * Overwrite the string a with the contents of the block (s, len). Note that * the bstring a must be a well defined and writable bstring. If an error * occurs BSTR_ERR is returned and a is not overwritten. */ int bassignblk (bstring a, const void * s, int len) { if (a == NULL || a->data == NULL || a->mlen < a->slen || a->slen < 0 || a->mlen == 0 || NULL == s || len < 0 || len >= INT_MAX) return BSTR_ERR; if (len + 1 > a->mlen && 0 > balloc (a, len + 1)) return BSTR_ERR; bBlockCopy (a->data, s, (size_t) len); a->data[len] = (unsigned char) '\0'; a->slen = len; return BSTR_OK; } /* int btrunc (bstring b, int n) * * Truncate the bstring to at most n characters. */ int btrunc (bstring b, int n) { if (n < 0 || b == NULL || b->data == NULL || b->mlen < b->slen || b->slen < 0 || b->mlen <= 0) return BSTR_ERR; if (b->slen > n) { b->slen = n; b->data[n] = (unsigned char) '\0'; } return BSTR_OK; } #define upcase(c) (toupper ((unsigned char) c)) #define downcase(c) (tolower ((unsigned char) c)) #define wspace(c) (isspace ((unsigned char) c)) /* int btoupper (bstring b) * * Convert contents of bstring to upper case. */ int btoupper (bstring b) { int i, len; if (b == NULL || b->data == NULL || b->mlen < b->slen || b->slen < 0 || b->mlen <= 0) return BSTR_ERR; for (i=0, len = b->slen; i < len; i++) { b->data[i] = (unsigned char) upcase (b->data[i]); } return BSTR_OK; } /* int btolower (bstring b) * * Convert contents of bstring to lower case. */ int btolower (bstring b) { int i, len; if (b == NULL || b->data == NULL || b->mlen < b->slen || b->slen < 0 || b->mlen <= 0) return BSTR_ERR; for (i=0, len = b->slen; i < len; i++) { b->data[i] = (unsigned char) downcase (b->data[i]); } return BSTR_OK; } /* int bstricmp (const_bstring b0, const_bstring b1) * * Compare two strings without differentiating between case. The return * value is the difference of the values of the characters where the two * strings first differ after lower case transformation, otherwise 0 is * returned indicating that the strings are equal. If the lengths are * different, then a difference from 0 is given, but if the first extra * character is '\0', then it is taken to be the value UCHAR_MAX+1. */ int bstricmp (const_bstring b0, const_bstring b1) { int i, v, n; if (bdata (b0) == NULL || b0->slen < 0 || bdata (b1) == NULL || b1->slen < 0) return SHRT_MIN; if ((n = b0->slen) > b1->slen) n = b1->slen; else if (b0->slen == b1->slen && b0->data == b1->data) return BSTR_OK; for (i = 0; i < n; i ++) { v = (char) downcase (b0->data[i]) - (char) downcase (b1->data[i]); if (0 != v) return v; } if (b0->slen > n) { v = (char) downcase (b0->data[n]); if (v) return v; return UCHAR_MAX + 1; } if (b1->slen > n) { v = - (char) downcase (b1->data[n]); if (v) return v; return - (int) (UCHAR_MAX + 1); } return BSTR_OK; } /* int bstrnicmp (const_bstring b0, const_bstring b1, int n) * * Compare two strings without differentiating between case for at most n * characters. If the position where the two strings first differ is * before the nth position, the return value is the difference of the values * of the characters, otherwise 0 is returned. If the lengths are different * and less than n characters, then a difference from 0 is given, but if the * first extra character is '\0', then it is taken to be the value * UCHAR_MAX+1. */ int bstrnicmp (const_bstring b0, const_bstring b1, int n) { int i, v, m; if (bdata (b0) == NULL || b0->slen < 0 || bdata (b1) == NULL || b1->slen < 0 || n < 0) return SHRT_MIN; m = n; if (m > b0->slen) m = b0->slen; if (m > b1->slen) m = b1->slen; if (b0->data != b1->data) { for (i = 0; i < m; i ++) { v = (char) downcase (b0->data[i]); v -= (char) downcase (b1->data[i]); if (v != 0) return b0->data[i] - b1->data[i]; } } if (n == m || b0->slen == b1->slen) return BSTR_OK; if (b0->slen > m) { v = (char) downcase (b0->data[m]); if (v) return v; return UCHAR_MAX + 1; } v = - (char) downcase (b1->data[m]); if (v) return v; return - (int) (UCHAR_MAX + 1); } /* int biseqcaselessblk (const_bstring b, const void * blk, int len) * * Compare content of b and the array of bytes in blk for length len for * equality without differentiating between character case. If the content * differs other than in case, 0 is returned, if, ignoring case, the content * is the same, 1 is returned, if there is an error, -1 is returned. If the * length of the strings are different, this function is O(1). '\0' * characters are not treated in any special way. */ int biseqcaselessblk (const_bstring b, const void * blk, int len) { int i; if (bdata (b) == NULL || b->slen < 0 || blk == NULL || len < 0) return BSTR_ERR; if (b->slen != len) return 0; if (len == 0 || b->data == blk) return 1; for (i=0; i < len; i++) { if (b->data[i] != ((unsigned char*)blk)[i]) { unsigned char c = (unsigned char) downcase (b->data[i]); if (c != (unsigned char) downcase (((unsigned char*)blk)[i])) return 0; } } return 1; } /* int biseqcaseless (const_bstring b0, const_bstring b1) * * Compare two strings for equality without differentiating between case. * If the strings differ other than in case, 0 is returned, if the strings * are the same, 1 is returned, if there is an error, -1 is returned. If * the length of the strings are different, this function is O(1). '\0' * termination characters are not treated in any special way. */ int biseqcaseless (const_bstring b0, const_bstring b1) { if (NULL == b1) return BSTR_ERR; return biseqcaselessblk (b0, b1->data, b1->slen); } /* int bisstemeqcaselessblk (const_bstring b0, const void * blk, int len) * * Compare beginning of string b0 with a block of memory of length len * without differentiating between case for equality. If the beginning of b0 * differs from the memory block other than in case (or if b0 is too short), * 0 is returned, if the strings are the same, 1 is returned, if there is an * error, -1 is returned. '\0' characters are not treated in any special * way. */ int bisstemeqcaselessblk (const_bstring b0, const void * blk, int len) { int i; if (bdata (b0) == NULL || b0->slen < 0 || NULL == blk || len < 0) return BSTR_ERR; if (b0->slen < len) return BSTR_OK; if (b0->data == (const unsigned char *) blk || len == 0) return 1; for (i = 0; i < len; i ++) { if (b0->data[i] != ((const unsigned char *) blk)[i]) { if (downcase (b0->data[i]) != downcase (((const unsigned char *) blk)[i])) return 0; } } return 1; } /* * int bltrimws (bstring b) * * Delete whitespace contiguous from the left end of the string. */ int bltrimws (bstring b) { int i, len; if (b == NULL || b->data == NULL || b->mlen < b->slen || b->slen < 0 || b->mlen <= 0) return BSTR_ERR; for (len = b->slen, i = 0; i < len; i++) { if (!wspace (b->data[i])) { return bdelete (b, 0, i); } } b->data[0] = (unsigned char) '\0'; b->slen = 0; return BSTR_OK; } /* * int brtrimws (bstring b) * * Delete whitespace contiguous from the right end of the string. */ int brtrimws (bstring b) { int i; if (b == NULL || b->data == NULL || b->mlen < b->slen || b->slen < 0 || b->mlen <= 0) return BSTR_ERR; for (i = b->slen - 1; i >= 0; i--) { if (!wspace (b->data[i])) { if (b->mlen > i) b->data[i+1] = (unsigned char) '\0'; b->slen = i + 1; return BSTR_OK; } } b->data[0] = (unsigned char) '\0'; b->slen = 0; return BSTR_OK; } /* * int btrimws (bstring b) * * Delete whitespace contiguous from both ends of the string. */ int btrimws (bstring b) { int i, j; if (b == NULL || b->data == NULL || b->mlen < b->slen || b->slen < 0 || b->mlen <= 0) return BSTR_ERR; for (i = b->slen - 1; i >= 0; i--) { if (!wspace (b->data[i])) { if (b->mlen > i) b->data[i+1] = (unsigned char) '\0'; b->slen = i + 1; for (j = 0; wspace (b->data[j]); j++) {} return bdelete (b, 0, j); } } b->data[0] = (unsigned char) '\0'; b->slen = 0; return BSTR_OK; } /* int biseqblk (const_bstring b, const void * blk, int len) * * Compare the string b with the character block blk of length len. If the * content differs, 0 is returned, if the content is the same, 1 is returned, * if there is an error, -1 is returned. If the length of the strings are * different, this function is O(1). '\0' characters are not treated in any * special way. */ int biseqblk (const_bstring b, const void * blk, int len) { if (len < 0 || b == NULL || blk == NULL || b->data == NULL || b->slen < 0) return BSTR_ERR; if (b->slen != len) return 0; if (len == 0 || b->data == blk) return 1; return !bstr__memcmp (b->data, blk, len); } /* int biseq (const_bstring b0, const_bstring b1) * * Compare the string b0 and b1. If the strings differ, 0 is returned, if * the strings are the same, 1 is returned, if there is an error, -1 is * returned. If the length of the strings are different, this function is * O(1). '\0' termination characters are not treated in any special way. */ int biseq (const_bstring b0, const_bstring b1) { if (b0 == NULL || b1 == NULL || b0->data == NULL || b1->data == NULL || b0->slen < 0 || b1->slen < 0) return BSTR_ERR; if (b0->slen != b1->slen) return BSTR_OK; if (b0->data == b1->data || b0->slen == 0) return 1; return !bstr__memcmp (b0->data, b1->data, b0->slen); } /* int bisstemeqblk (const_bstring b0, const void * blk, int len) * * Compare beginning of string b0 with a block of memory of length len for * equality. If the beginning of b0 differs from the memory block (or if b0 * is too short), 0 is returned, if the strings are the same, 1 is returned, * if there is an error, -1 is returned. '\0' characters are not treated in * any special way. */ int bisstemeqblk (const_bstring b0, const void * blk, int len) { int i; if (bdata (b0) == NULL || b0->slen < 0 || NULL == blk || len < 0) return BSTR_ERR; if (b0->slen < len) return BSTR_OK; if (b0->data == (const unsigned char *) blk || len == 0) return 1; for (i = 0; i < len; i ++) { if (b0->data[i] != ((const unsigned char *) blk)[i]) return BSTR_OK; } return 1; } /* int biseqcstr (const_bstring b, const char *s) * * Compare the bstring b and char * string s. The C string s must be '\0' * terminated at exactly the length of the bstring b, and the contents * between the two must be identical with the bstring b with no '\0' * characters for the two contents to be considered equal. This is * equivalent to the condition that their current contents will be always be * equal when comparing them in the same format after converting one or the * other. If the strings are equal 1 is returned, if they are unequal 0 is * returned and if there is a detectable error BSTR_ERR is returned. */ int biseqcstr (const_bstring b, const char * s) { int i; if (b == NULL || s == NULL || b->data == NULL || b->slen < 0) return BSTR_ERR; for (i=0; i < b->slen; i++) { if (s[i] == '\0' || b->data[i] != (unsigned char) s[i]) return BSTR_OK; } return s[i] == '\0'; } /* int biseqcstrcaseless (const_bstring b, const char *s) * * Compare the bstring b and char * string s. The C string s must be '\0' * terminated at exactly the length of the bstring b, and the contents * between the two must be identical except for case with the bstring b with * no '\0' characters for the two contents to be considered equal. This is * equivalent to the condition that their current contents will be always be * equal ignoring case when comparing them in the same format after * converting one or the other. If the strings are equal, except for case, * 1 is returned, if they are unequal regardless of case 0 is returned and * if there is a detectable error BSTR_ERR is returned. */ int biseqcstrcaseless (const_bstring b, const char * s) { int i; if (b == NULL || s == NULL || b->data == NULL || b->slen < 0) return BSTR_ERR; for (i=0; i < b->slen; i++) { if (s[i] == '\0' || (b->data[i] != (unsigned char) s[i] && downcase (b->data[i]) != (unsigned char) downcase (s[i]))) return BSTR_OK; } return s[i] == '\0'; } /* int bstrcmp (const_bstring b0, const_bstring b1) * * Compare the string b0 and b1. If there is an error, SHRT_MIN is returned, * otherwise a value less than or greater than zero, indicating that the * string pointed to by b0 is lexicographically less than or greater than * the string pointed to by b1 is returned. If the the string lengths are * unequal but the characters up until the length of the shorter are equal * then a value less than, or greater than zero, indicating that the string * pointed to by b0 is shorter or longer than the string pointed to by b1 is * returned. 0 is returned if and only if the two strings are the same. If * the length of the strings are different, this function is O(n). Like its * standard C library counter part strcmp, the comparison does not proceed * past any '\0' termination characters encountered. */ int bstrcmp (const_bstring b0, const_bstring b1) { int i, v, n; if (b0 == NULL || b1 == NULL || b0->data == NULL || b1->data == NULL || b0->slen < 0 || b1->slen < 0) return SHRT_MIN; n = b0->slen; if (n > b1->slen) n = b1->slen; if (b0->slen == b1->slen && (b0->data == b1->data || b0->slen == 0)) return BSTR_OK; for (i = 0; i < n; i ++) { v = ((char) b0->data[i]) - ((char) b1->data[i]); if (v != 0) return v; if (b0->data[i] == (unsigned char) '\0') return BSTR_OK; } if (b0->slen > n) return 1; if (b1->slen > n) return -1; return BSTR_OK; } /* int bstrncmp (const_bstring b0, const_bstring b1, int n) * * Compare the string b0 and b1 for at most n characters. If there is an * error, SHRT_MIN is returned, otherwise a value is returned as if b0 and * b1 were first truncated to at most n characters then bstrcmp was called * with these new strings are paremeters. If the length of the strings are * different, this function is O(n). Like its standard C library counter * part strcmp, the comparison does not proceed past any '\0' termination * characters encountered. */ int bstrncmp (const_bstring b0, const_bstring b1, int n) { int i, v, m; if (b0 == NULL || b1 == NULL || b0->data == NULL || b1->data == NULL || b0->slen < 0 || b1->slen < 0) return SHRT_MIN; m = n; if (m > b0->slen) m = b0->slen; if (m > b1->slen) m = b1->slen; if (b0->data != b1->data) { for (i = 0; i < m; i ++) { v = ((char) b0->data[i]) - ((char) b1->data[i]); if (v != 0) return v; if (b0->data[i] == (unsigned char) '\0') return BSTR_OK; } } if (n == m || b0->slen == b1->slen) return BSTR_OK; if (b0->slen > m) return 1; return -1; } /* bstring bmidstr (const_bstring b, int left, int len) * * Create a bstring which is the substring of b starting from position left * and running for a length len (clamped by the end of the bstring b.) If * b is detectably invalid, then NULL is returned. The section described * by (left, len) is clamped to the boundaries of b. */ bstring bmidstr (const_bstring b, int left, int len) { if (b == NULL || b->slen < 0 || b->data == NULL) return NULL; if (left < 0) { len += left; left = 0; } if (len > b->slen - left) len = b->slen - left; if (len <= 0) return bfromcstr (""); return blk2bstr (b->data + left, len); } /* int bdelete (bstring b, int pos, int len) * * Removes characters from pos to pos+len-1 inclusive and shifts the tail of * the bstring starting from pos+len to pos. len must be positive for this * call to have any effect. The section of the string described by (pos, * len) is clamped to boundaries of the bstring b. */ int bdelete (bstring b, int pos, int len) { /* Clamp to left side of bstring */ if (pos < 0) { len += pos; pos = 0; } if (len < 0 || b == NULL || b->data == NULL || b->slen < 0 || b->mlen < b->slen || b->mlen <= 0) return BSTR_ERR; if (len > 0 && pos < b->slen) { if (pos + len >= b->slen) { b->slen = pos; } else { bBlockCopy ((char *) (b->data + pos), (char *) (b->data + pos + len), b->slen - (pos+len)); b->slen -= len; } b->data[b->slen] = (unsigned char) '\0'; } return BSTR_OK; } /* int bdestroy (bstring b) * * Free up the bstring. Note that if b is detectably invalid or not writable * then no action is performed and BSTR_ERR is returned. Like a freed memory * allocation, dereferences, writes or any other action on b after it has * been bdestroyed is undefined. */ int bdestroy (bstring b) { if (b == NULL || b->slen < 0 || b->mlen <= 0 || b->mlen < b->slen || b->data == NULL) return BSTR_ERR; bstr__free (b->data); /* In case there is any stale usage, there is one more chance to notice this error. */ b->slen = -1; b->mlen = -__LINE__; b->data = NULL; bstr__free (b); return BSTR_OK; } /* int binstr (const_bstring b1, int pos, const_bstring b2) * * Search for the bstring b2 in b1 starting from position pos, and searching * forward. If it is found then return with the first position where it is * found, otherwise return BSTR_ERR. Note that this is just a brute force * string searcher that does not attempt clever things like the Boyer-Moore * search algorithm. Because of this there are many degenerate cases where * this can take much longer than it needs to. */ int binstr (const_bstring b1, int pos, const_bstring b2) { int j, ii, ll, lf; unsigned char * d0; unsigned char c0; register unsigned char * d1; register unsigned char c1; register int i; if (b1 == NULL || b1->data == NULL || b1->slen < 0 || b2 == NULL || b2->data == NULL || b2->slen < 0) return BSTR_ERR; if (b1->slen == pos) return (b2->slen == 0)?pos:BSTR_ERR; if (b1->slen < pos || pos < 0) return BSTR_ERR; if (b2->slen == 0) return pos; /* No space to find such a string? */ if ((lf = b1->slen - b2->slen + 1) <= pos) return BSTR_ERR; /* An obvious alias case */ if (b1->data == b2->data && pos == 0) return 0; i = pos; d0 = b2->data; d1 = b1->data; ll = b2->slen; /* Peel off the b2->slen == 1 case */ c0 = d0[0]; if (1 == ll) { for (;i < lf; i++) if (c0 == d1[i]) return i; return BSTR_ERR; } c1 = c0; j = 0; lf = b1->slen - 1; ii = -1; if (i < lf) do { /* Unrolled current character test */ if (c1 != d1[i]) { if (c1 != d1[1+i]) { i += 2; continue; } i++; } /* Take note if this is the start of a potential match */ if (0 == j) ii = i; /* Shift the test character down by one */ j++; i++; /* If this isn't past the last character continue */ if (j < ll) { c1 = d0[j]; continue; } N0:; /* If no characters mismatched, then we matched */ if (i == ii+j) return ii; /* Shift back to the beginning */ i -= j; j = 0; c1 = c0; } while (i < lf); /* Deal with last case if unrolling caused a misalignment */ if (i == lf && ll == j+1 && c1 == d1[i]) goto N0; return BSTR_ERR; } /* int binstrr (const_bstring b1, int pos, const_bstring b2) * * Search for the bstring b2 in b1 starting from position pos, and searching * backward. If it is found then return with the first position where it is * found, otherwise return BSTR_ERR. Note that this is just a brute force * string searcher that does not attempt clever things like the Boyer-Moore * search algorithm. Because of this there are many degenerate cases where * this can take much longer than it needs to. */ int binstrr (const_bstring b1, int pos, const_bstring b2) { int j, i, l; unsigned char * d0, * d1; if (b1 == NULL || b1->data == NULL || b1->slen < 0 || b2 == NULL || b2->data == NULL || b2->slen < 0) return BSTR_ERR; if (b1->slen == pos && b2->slen == 0) return pos; if (b1->slen < pos || pos < 0) return BSTR_ERR; if (b2->slen == 0) return pos; /* Obvious alias case */ if (b1->data == b2->data && pos == 0 && b2->slen <= b1->slen) return 0; i = pos; if ((l = b1->slen - b2->slen) < 0) return BSTR_ERR; /* If no space to find such a string then snap back */ if (l + 1 <= i) i = l; j = 0; d0 = b2->data; d1 = b1->data; l = b2->slen; for (;;) { if (d0[j] == d1[i + j]) { j ++; if (j >= l) return i; } else { i --; if (i < 0) break; j=0; } } return BSTR_ERR; } /* int binstrcaseless (const_bstring b1, int pos, const_bstring b2) * * Search for the bstring b2 in b1 starting from position pos, and searching * forward but without regard to case. If it is found then return with the * first position where it is found, otherwise return BSTR_ERR. Note that * this is just a brute force string searcher that does not attempt clever * things like the Boyer-Moore search algorithm. Because of this there are * many degenerate cases where this can take much longer than it needs to. */ int binstrcaseless (const_bstring b1, int pos, const_bstring b2) { int j, i, l, ll; unsigned char * d0, * d1; if (b1 == NULL || b1->data == NULL || b1->slen < 0 || b2 == NULL || b2->data == NULL || b2->slen < 0) return BSTR_ERR; if (b1->slen == pos) return (b2->slen == 0)?pos:BSTR_ERR; if (b1->slen < pos || pos < 0) return BSTR_ERR; if (b2->slen == 0) return pos; l = b1->slen - b2->slen + 1; /* No space to find such a string? */ if (l <= pos) return BSTR_ERR; /* An obvious alias case */ if (b1->data == b2->data && pos == 0) return BSTR_OK; i = pos; j = 0; d0 = b2->data; d1 = b1->data; ll = b2->slen; for (;;) { if (d0[j] == d1[i + j] || downcase (d0[j]) == downcase (d1[i + j])) { j ++; if (j >= ll) return i; } else { i ++; if (i >= l) break; j=0; } } return BSTR_ERR; } /* int binstrrcaseless (const_bstring b1, int pos, const_bstring b2) * * Search for the bstring b2 in b1 starting from position pos, and searching * backward but without regard to case. If it is found then return with the * first position where it is found, otherwise return BSTR_ERR. Note that * this is just a brute force string searcher that does not attempt clever * things like the Boyer-Moore search algorithm. Because of this there are * many degenerate cases where this can take much longer than it needs to. */ int binstrrcaseless (const_bstring b1, int pos, const_bstring b2) { int j, i, l; unsigned char * d0, * d1; if (b1 == NULL || b1->data == NULL || b1->slen < 0 || b2 == NULL || b2->data == NULL || b2->slen < 0) return BSTR_ERR; if (b1->slen == pos && b2->slen == 0) return pos; if (b1->slen < pos || pos < 0) return BSTR_ERR; if (b2->slen == 0) return pos; /* Obvious alias case */ if (b1->data == b2->data && pos == 0 && b2->slen <= b1->slen) return BSTR_OK; i = pos; if ((l = b1->slen - b2->slen) < 0) return BSTR_ERR; /* If no space to find such a string then snap back */ if (l + 1 <= i) i = l; j = 0; d0 = b2->data; d1 = b1->data; l = b2->slen; for (;;) { if (d0[j] == d1[i + j] || downcase (d0[j]) == downcase (d1[i + j])) { j ++; if (j >= l) return i; } else { i --; if (i < 0) break; j=0; } } return BSTR_ERR; } /* int bstrchrp (const_bstring b, int c, int pos) * * Search for the character c in b forwards from the position pos * (inclusive). */ int bstrchrp (const_bstring b, int c, int pos) { unsigned char * p; if (b == NULL || b->data == NULL || b->slen <= pos || pos < 0) return BSTR_ERR; p = (unsigned char *) bstr__memchr ((b->data + pos), (unsigned char) c, (b->slen - pos)); if (p) return (int) (p - b->data); return BSTR_ERR; } /* int bstrrchrp (const_bstring b, int c, int pos) * * Search for the character c in b backwards from the position pos in string * (inclusive). */ int bstrrchrp (const_bstring b, int c, int pos) { int i; if (b == NULL || b->data == NULL || b->slen <= pos || pos < 0) return BSTR_ERR; for (i=pos; i >= 0; i--) { if (b->data[i] == (unsigned char) c) return i; } return BSTR_ERR; } #if !defined (BSTRLIB_AGGRESSIVE_MEMORY_FOR_SPEED_TRADEOFF) #define LONG_LOG_BITS_QTY (3) #define LONG_BITS_QTY (1 << LONG_LOG_BITS_QTY) #define LONG_TYPE unsigned char #define CFCLEN ((1 << CHAR_BIT) / LONG_BITS_QTY) struct charField { LONG_TYPE content[CFCLEN]; }; #define testInCharField(cf,c) ((cf)->content[(c) >> LONG_LOG_BITS_QTY] & \ (((long)1) << ((c) & (LONG_BITS_QTY-1)))) #define setInCharField(cf,idx) { \ unsigned int c = (unsigned int) (idx); \ (cf)->content[c >> LONG_LOG_BITS_QTY] |= \ (LONG_TYPE) (1ul << (c & (LONG_BITS_QTY-1))); \ } #else #define CFCLEN (1 << CHAR_BIT) struct charField { unsigned char content[CFCLEN]; }; #define testInCharField(cf,c) ((cf)->content[(unsigned char) (c)]) #define setInCharField(cf,idx) (cf)->content[(unsigned int) (idx)] = ~0 #endif /* Convert a bstring to charField */ static int buildCharField (struct charField * cf, const_bstring b) { int i; if (b == NULL || b->data == NULL || b->slen <= 0) return BSTR_ERR; memset ((void *) cf->content, 0, sizeof (struct charField)); for (i=0; i < b->slen; i++) { setInCharField (cf, b->data[i]); } return BSTR_OK; } static void invertCharField (struct charField * cf) { int i; for (i=0; i < CFCLEN; i++) cf->content[i] = ~cf->content[i]; } /* Inner engine for binchr */ static int binchrCF (const unsigned char * data, int len, int pos, const struct charField * cf) { int i; for (i=pos; i < len; i++) { unsigned char c = (unsigned char) data[i]; if (testInCharField (cf, c)) return i; } return BSTR_ERR; } /* int binchr (const_bstring b0, int pos, const_bstring b1); * * Search for the first position in b0 starting from pos or after, in which * one of the characters in b1 is found and return it. If such a position * does not exist in b0, then BSTR_ERR is returned. */ int binchr (const_bstring b0, int pos, const_bstring b1) { struct charField chrs; if (pos < 0 || b0 == NULL || b0->data == NULL || b0->slen <= pos) return BSTR_ERR; if (1 == b1->slen) return bstrchrp (b0, b1->data[0], pos); if (0 > buildCharField (&chrs, b1)) return BSTR_ERR; return binchrCF (b0->data, b0->slen, pos, &chrs); } /* Inner engine for binchrr */ static int binchrrCF (const unsigned char * data, int pos, const struct charField * cf) { int i; for (i=pos; i >= 0; i--) { unsigned int c = (unsigned int) data[i]; if (testInCharField (cf, c)) return i; } return BSTR_ERR; } /* int binchrr (const_bstring b0, int pos, const_bstring b1); * * Search for the last position in b0 no greater than pos, in which one of * the characters in b1 is found and return it. If such a position does not * exist in b0, then BSTR_ERR is returned. */ int binchrr (const_bstring b0, int pos, const_bstring b1) { struct charField chrs; if (pos < 0 || b0 == NULL || b0->data == NULL || b1 == NULL || b0->slen < pos) return BSTR_ERR; if (pos == b0->slen) pos--; if (1 == b1->slen) return bstrrchrp (b0, b1->data[0], pos); if (0 > buildCharField (&chrs, b1)) return BSTR_ERR; return binchrrCF (b0->data, pos, &chrs); } /* int bninchr (const_bstring b0, int pos, const_bstring b1); * * Search for the first position in b0 starting from pos or after, in which * none of the characters in b1 is found and return it. If such a position * does not exist in b0, then BSTR_ERR is returned. */ int bninchr (const_bstring b0, int pos, const_bstring b1) { struct charField chrs; if (pos < 0 || b0 == NULL || b0->data == NULL || b0->slen <= pos) return BSTR_ERR; if (buildCharField (&chrs, b1) < 0) return BSTR_ERR; invertCharField (&chrs); return binchrCF (b0->data, b0->slen, pos, &chrs); } /* int bninchrr (const_bstring b0, int pos, const_bstring b1); * * Search for the last position in b0 no greater than pos, in which none of * the characters in b1 is found and return it. If such a position does not * exist in b0, then BSTR_ERR is returned. */ int bninchrr (const_bstring b0, int pos, const_bstring b1) { struct charField chrs; if (pos < 0 || b0 == NULL || b0->data == NULL || b0->slen < pos) return BSTR_ERR; if (pos == b0->slen) pos--; if (buildCharField (&chrs, b1) < 0) return BSTR_ERR; invertCharField (&chrs); return binchrrCF (b0->data, pos, &chrs); } /* int bsetstr (bstring b0, int pos, bstring b1, unsigned char fill) * * Overwrite the string b0 starting at position pos with the string b1. If * the position pos is past the end of b0, then the character "fill" is * appended as necessary to make up the gap between the end of b0 and pos. * If b1 is NULL, it behaves as if it were a 0-length string. */ int bsetstr (bstring b0, int pos, const_bstring b1, unsigned char fill) { int d, newlen; ptrdiff_t pd; bstring aux = (bstring) b1; if (pos < 0 || b0 == NULL || b0->slen < 0 || NULL == b0->data || b0->mlen < b0->slen || b0->mlen <= 0) return BSTR_ERR; if (b1 != NULL && (b1->slen < 0 || b1->data == NULL)) return BSTR_ERR; d = pos; /* Aliasing case */ if (NULL != aux) { if ((pd = (ptrdiff_t) (b1->data - b0->data)) >= 0 && pd < (ptrdiff_t) b0->mlen) { if (NULL == (aux = bstrcpy (b1))) return BSTR_ERR; } d += aux->slen; } /* Increase memory size if necessary */ if (balloc (b0, d + 1) != BSTR_OK) { if (aux != b1) bdestroy (aux); return BSTR_ERR; } newlen = b0->slen; /* Fill in "fill" character as necessary */ if (pos > newlen) { bstr__memset (b0->data + b0->slen, (int) fill, (size_t) (pos - b0->slen)); newlen = pos; } /* Copy b1 to position pos in b0. */ if (aux != NULL) { bBlockCopy ((char *) (b0->data + pos), (char *) aux->data, aux->slen); if (aux != b1) bdestroy (aux); } /* Indicate the potentially increased size of b0 */ if (d > newlen) newlen = d; b0->slen = newlen; b0->data[newlen] = (unsigned char) '\0'; return BSTR_OK; } /* int binsertblk (bstring b, int pos, const void * blk, int len, * unsigned char fill) * * Inserts the block of characters at blk with length len into b at position * pos. If the position pos is past the end of b, then the character "fill" * is appended as necessary to make up the gap between the end of b1 and pos. * Unlike bsetstr, binsert does not allow b2 to be NULL. */ int binsertblk (bstring b, int pos, const void * blk, int len, unsigned char fill) { int d, l; unsigned char* aux = (unsigned char*) blk; if (b == NULL || blk == NULL || pos < 0 || len < 0 || b->slen < 0 || b->mlen <= 0 || b->mlen < b->slen) return BSTR_ERR; /* Compute the two possible end pointers */ d = b->slen + len; l = pos + len; if ((d|l) < 0) return BSTR_ERR; /* Integer wrap around. */ /* Aliasing case */ if (((size_t) ((unsigned char*) blk + len)) >= ((size_t) b->data) && ((size_t) blk) < ((size_t) (b->data + b->mlen))) { if (NULL == (aux = (unsigned char*) bstr__alloc (len))) return BSTR_ERR; bstr__memcpy (aux, blk, len); } if (l > d) { /* Inserting past the end of the string */ if (balloc (b, l + 1) != BSTR_OK) { if (aux != (unsigned char*) blk) bstr__free (aux); return BSTR_ERR; } bstr__memset (b->data + b->slen, (int) fill, (size_t) (pos - b->slen)); b->slen = l; } else { /* Inserting in the middle of the string */ if (balloc (b, d + 1) != BSTR_OK) { if (aux != (unsigned char*) blk) bstr__free (aux); return BSTR_ERR; } bBlockCopy (b->data + l, b->data + pos, d - l); b->slen = d; } bBlockCopy (b->data + pos, aux, len); b->data[b->slen] = (unsigned char) '\0'; if (aux != (unsigned char*) blk) bstr__free (aux); return BSTR_OK; } /* int binsert (bstring b1, int pos, const_bstring b2, unsigned char fill) * * Inserts the string b2 into b1 at position pos. If the position pos is * past the end of b1, then the character "fill" is appended as necessary to * make up the gap between the end of b1 and pos. Unlike bsetstr, binsert * does not allow b2 to be NULL. */ int binsert (bstring b1, int pos, const_bstring b2, unsigned char fill) { if (NULL == b2 || (b2->mlen > 0 && b2->slen > b2->mlen)) return BSTR_ERR; return binsertblk (b1, pos, b2->data, b2->slen, fill); } /* int breplace (bstring b1, int pos, int len, bstring b2, * unsigned char fill) * * Replace a section of a string from pos for a length len with the string * b2. fill is used is pos > b1->slen. */ int breplace (bstring b1, int pos, int len, const_bstring b2, unsigned char fill) { int pl, ret; ptrdiff_t pd; bstring aux = (bstring) b2; if (pos < 0 || len < 0) return BSTR_ERR; if (pos > INT_MAX - len) return BSTR_ERR; /* Overflow */ pl = pos + len; if (b1 == NULL || b2 == NULL || b1->data == NULL || b2->data == NULL || b1->slen < 0 || b2->slen < 0 || b1->mlen < b1->slen || b1->mlen <= 0) return BSTR_ERR; /* Straddles the end? */ if (pl >= b1->slen) { if ((ret = bsetstr (b1, pos, b2, fill)) < 0) return ret; if (pos + b2->slen < b1->slen) { b1->slen = pos + b2->slen; b1->data[b1->slen] = (unsigned char) '\0'; } return ret; } /* Aliasing case */ if ((pd = (ptrdiff_t) (b2->data - b1->data)) >= 0 && pd < (ptrdiff_t) b1->slen) { if (NULL == (aux = bstrcpy (b2))) return BSTR_ERR; } if (aux->slen > len) { if (balloc (b1, b1->slen + aux->slen - len) != BSTR_OK) { if (aux != b2) bdestroy (aux); return BSTR_ERR; } } if (aux->slen != len) bstr__memmove (b1->data + pos + aux->slen, b1->data + pos + len, b1->slen - (pos + len)); bstr__memcpy (b1->data + pos, aux->data, aux->slen); b1->slen += aux->slen - len; b1->data[b1->slen] = (unsigned char) '\0'; if (aux != b2) bdestroy (aux); return BSTR_OK; } /* * findreplaceengine is used to implement bfindreplace and * bfindreplacecaseless. It works by breaking the three cases of * expansion, reduction and replacement, and solving each of these * in the most efficient way possible. */ typedef int (*instr_fnptr) (const_bstring s1, int pos, const_bstring s2); #define INITIAL_STATIC_FIND_INDEX_COUNT 32 static int findreplaceengine (bstring b, const_bstring find, const_bstring repl, int pos, instr_fnptr instr) { int i, ret, slen, mlen, delta, acc; int * d; int static_d[INITIAL_STATIC_FIND_INDEX_COUNT+1]; /* This +1 is for LINT. */ ptrdiff_t pd; bstring auxf = (bstring) find; bstring auxr = (bstring) repl; if (b == NULL || b->data == NULL || find == NULL || find->data == NULL || repl == NULL || repl->data == NULL || pos < 0 || find->slen <= 0 || b->mlen <= 0 || b->slen > b->mlen || b->slen < 0 || repl->slen < 0) return BSTR_ERR; if (pos > b->slen - find->slen) return BSTR_OK; /* Alias with find string */ pd = (ptrdiff_t) (find->data - b->data); if ((ptrdiff_t) (pos - find->slen) < pd && pd < (ptrdiff_t) b->slen) { if (NULL == (auxf = bstrcpy (find))) return BSTR_ERR; } /* Alias with repl string */ pd = (ptrdiff_t) (repl->data - b->data); if ((ptrdiff_t) (pos - repl->slen) < pd && pd < (ptrdiff_t) b->slen) { if (NULL == (auxr = bstrcpy (repl))) { if (auxf != find) bdestroy (auxf); return BSTR_ERR; } } delta = auxf->slen - auxr->slen; /* in-place replacement since find and replace strings are of equal length */ if (delta == 0) { while ((pos = instr (b, pos, auxf)) >= 0) { bstr__memcpy (b->data + pos, auxr->data, auxr->slen); pos += auxf->slen; } if (auxf != find) bdestroy (auxf); if (auxr != repl) bdestroy (auxr); return BSTR_OK; } /* shrinking replacement since auxf->slen > auxr->slen */ if (delta > 0) { acc = 0; while ((i = instr (b, pos, auxf)) >= 0) { if (acc && i > pos) bstr__memmove (b->data + pos - acc, b->data + pos, i - pos); if (auxr->slen) bstr__memcpy (b->data + i - acc, auxr->data, auxr->slen); acc += delta; pos = i + auxf->slen; } if (acc) { i = b->slen; if (i > pos) bstr__memmove (b->data + pos - acc, b->data + pos, i - pos); b->slen -= acc; b->data[b->slen] = (unsigned char) '\0'; } if (auxf != find) bdestroy (auxf); if (auxr != repl) bdestroy (auxr); return BSTR_OK; } /* expanding replacement since find->slen < repl->slen. Its a lot more complicated. This works by first finding all the matches and storing them to a growable array, then doing at most one resize of the destination bstring and then performing the direct memory transfers of the string segment pieces to form the final result. The growable array of matches uses a deferred doubling reallocing strategy. What this means is that it starts as a reasonably fixed sized auto array in the hopes that many if not most cases will never need to grow this array. But it switches as soon as the bounds of the array will be exceeded. An extra find result is always appended to this array that corresponds to the end of the destination string, so slen is checked against mlen - 1 rather than mlen before resizing. */ mlen = INITIAL_STATIC_FIND_INDEX_COUNT; d = (int *) static_d; /* Avoid malloc for trivial/initial cases */ acc = slen = 0; while ((pos = instr (b, pos, auxf)) >= 0) { if (slen >= mlen - 1) { int *t; int sl; /* Overflow */ if (mlen > (INT_MAX / sizeof(int *)) / 2) { ret = BSTR_ERR; goto done; } mlen += mlen; sl = sizeof (int *) * mlen; if (static_d == d) d = NULL; /* static_d cannot be realloced */ if (NULL == (t = (int *) bstr__realloc (d, sl))) { ret = BSTR_ERR; goto done; } if (NULL == d) bstr__memcpy (t, static_d, sizeof (static_d)); d = t; } d[slen] = pos; slen++; acc -= delta; pos += auxf->slen; if (pos < 0 || acc < 0) { ret = BSTR_ERR; goto done; } } /* slen <= INITIAL_STATIC_INDEX_COUNT-1 or mlen-1 here. */ d[slen] = b->slen; if (BSTR_OK == (ret = balloc (b, b->slen + acc + 1))) { b->slen += acc; for (i = slen-1; i >= 0; i--) { int s, l; s = d[i] + auxf->slen; l = d[i+1] - s; /* d[slen] may be accessed here. */ if (l) { bstr__memmove (b->data + s + acc, b->data + s, l); } if (auxr->slen) { bstr__memmove (b->data + s + acc - auxr->slen, auxr->data, auxr->slen); } acc += delta; } b->data[b->slen] = (unsigned char) '\0'; } done:; if (static_d != d) bstr__free (d); if (auxf != find) bdestroy (auxf); if (auxr != repl) bdestroy (auxr); return ret; } /* int bfindreplace (bstring b, const_bstring find, const_bstring repl, * int pos) * * Replace all occurrences of a find string with a replace string after a * given point in a bstring. */ int bfindreplace (bstring b, const_bstring find, const_bstring repl, int pos) { return findreplaceengine (b, find, repl, pos, binstr); } /* int bfindreplacecaseless (bstring b, const_bstring find, * const_bstring repl, int pos) * * Replace all occurrences of a find string, ignoring case, with a replace * string after a given point in a bstring. */ int bfindreplacecaseless (bstring b, const_bstring find, const_bstring repl, int pos) { return findreplaceengine (b, find, repl, pos, binstrcaseless); } /* int binsertch (bstring b, int pos, int len, unsigned char fill) * * Inserts the character fill repeatedly into b at position pos for a * length len. If the position pos is past the end of b, then the * character "fill" is appended as necessary to make up the gap between the * end of b and the position pos + len. */ int binsertch (bstring b, int pos, int len, unsigned char fill) { int d, l, i; if (pos < 0 || b == NULL || b->slen < 0 || b->mlen < b->slen || b->mlen <= 0 || len < 0) return BSTR_ERR; /* Compute the two possible end pointers */ d = b->slen + len; l = pos + len; if ((d|l) < 0) return BSTR_ERR; if (l > d) { /* Inserting past the end of the string */ if (balloc (b, l + 1) != BSTR_OK) return BSTR_ERR; pos = b->slen; b->slen = l; } else { /* Inserting in the middle of the string */ if (balloc (b, d + 1) != BSTR_OK) return BSTR_ERR; for (i = d - 1; i >= l; i--) { b->data[i] = b->data[i - len]; } b->slen = d; } for (i=pos; i < l; i++) b->data[i] = fill; b->data[b->slen] = (unsigned char) '\0'; return BSTR_OK; } /* int bpattern (bstring b, int len) * * Replicate the bstring, b in place, end to end repeatedly until it * surpasses len characters, then chop the result to exactly len characters. * This function operates in-place. The function will return with BSTR_ERR * if b is NULL or of length 0, otherwise BSTR_OK is returned. */ int bpattern (bstring b, int len) { int i, d; d = blength (b); if (d <= 0 || len < 0 || balloc (b, len + 1) != BSTR_OK) return BSTR_ERR; if (len > 0) { if (d == 1) return bsetstr (b, len, NULL, b->data[0]); for (i = d; i < len; i++) b->data[i] = b->data[i - d]; } b->data[len] = (unsigned char) '\0'; b->slen = len; return BSTR_OK; } #define BS_BUFF_SZ (1024) /* int breada (bstring b, bNread readPtr, void * parm) * * Use a finite buffer fread-like function readPtr to concatenate to the * bstring b the entire contents of file-like source data in a roughly * efficient way. */ int breada (bstring b, bNread readPtr, void * parm) { int i, l, n; if (b == NULL || b->mlen <= 0 || b->slen < 0 || b->mlen < b->slen || readPtr == NULL) return BSTR_ERR; i = b->slen; for (n=i+16; ; n += ((n < BS_BUFF_SZ) ? n : BS_BUFF_SZ)) { if (BSTR_OK != balloc (b, n + 1)) return BSTR_ERR; l = (int) readPtr ((void *) (b->data + i), 1, n - i, parm); i += l; b->slen = i; if (i < n) break; } b->data[i] = (unsigned char) '\0'; return BSTR_OK; } /* bstring bread (bNread readPtr, void * parm) * * Use a finite buffer fread-like function readPtr to create a bstring * filled with the entire contents of file-like source data in a roughly * efficient way. */ bstring bread (bNread readPtr, void * parm) { bstring buff; if (0 > breada (buff = bfromcstr (""), readPtr, parm)) { bdestroy (buff); return NULL; } return buff; } /* int bassigngets (bstring b, bNgetc getcPtr, void * parm, char terminator) * * Use an fgetc-like single character stream reading function (getcPtr) to * obtain a sequence of characters which are concatenated to the end of the * bstring b. The stream read is terminated by the passed in terminator * parameter. * * If getcPtr returns with a negative number, or the terminator character * (which is appended) is read, then the stream reading is halted and the * function returns with a partial result in b. If there is an empty partial * result, 1 is returned. If no characters are read, or there is some other * detectable error, BSTR_ERR is returned. */ int bassigngets (bstring b, bNgetc getcPtr, void * parm, char terminator) { int c, d, e; if (b == NULL || b->mlen <= 0 || b->slen < 0 || b->mlen < b->slen || getcPtr == NULL) return BSTR_ERR; d = 0; e = b->mlen - 2; while ((c = getcPtr (parm)) >= 0) { if (d > e) { b->slen = d; if (balloc (b, d + 2) != BSTR_OK) return BSTR_ERR; e = b->mlen - 2; } b->data[d] = (unsigned char) c; d++; if (c == terminator) break; } b->data[d] = (unsigned char) '\0'; b->slen = d; return d == 0 && c < 0; } /* int bgetsa (bstring b, bNgetc getcPtr, void * parm, char terminator) * * Use an fgetc-like single character stream reading function (getcPtr) to * obtain a sequence of characters which are concatenated to the end of the * bstring b. The stream read is terminated by the passed in terminator * parameter. * * If getcPtr returns with a negative number, or the terminator character * (which is appended) is read, then the stream reading is halted and the * function returns with a partial result concatentated to b. If there is * an empty partial result, 1 is returned. If no characters are read, or * there is some other detectable error, BSTR_ERR is returned. */ int bgetsa (bstring b, bNgetc getcPtr, void * parm, char terminator) { int c, d, e; if (b == NULL || b->mlen <= 0 || b->slen < 0 || b->mlen < b->slen || getcPtr == NULL) return BSTR_ERR; d = b->slen; e = b->mlen - 2; while ((c = getcPtr (parm)) >= 0) { if (d > e) { b->slen = d; if (balloc (b, d + 2) != BSTR_OK) return BSTR_ERR; e = b->mlen - 2; } b->data[d] = (unsigned char) c; d++; if (c == terminator) break; } b->data[d] = (unsigned char) '\0'; b->slen = d; return d == 0 && c < 0; } /* bstring bgets (bNgetc getcPtr, void * parm, char terminator) * * Use an fgetc-like single character stream reading function (getcPtr) to * obtain a sequence of characters which are concatenated into a bstring. * The stream read is terminated by the passed in terminator function. * * If getcPtr returns with a negative number, or the terminator character * (which is appended) is read, then the stream reading is halted and the * result obtained thus far is returned. If no characters are read, or * there is some other detectable error, NULL is returned. */ bstring bgets (bNgetc getcPtr, void * parm, char terminator) { bstring buff; if (0 > bgetsa (buff = bfromcstr (""), getcPtr, parm, terminator) || 0 >= buff->slen) { bdestroy (buff); buff = NULL; } return buff; } struct bStream { bstring buff; /* Buffer for over-reads */ void * parm; /* The stream handle for core stream */ bNread readFnPtr; /* fread compatible fnptr for core stream */ int isEOF; /* track file's EOF state */ int maxBuffSz; }; /* struct bStream * bsopen (bNread readPtr, void * parm) * * Wrap a given open stream (described by a fread compatible function * pointer and stream handle) into an open bStream suitable for the bstring * library streaming functions. */ struct bStream * bsopen (bNread readPtr, void * parm) { struct bStream * s; if (readPtr == NULL) return NULL; s = (struct bStream *) bstr__alloc (sizeof (struct bStream)); if (s == NULL) return NULL; s->parm = parm; s->buff = bfromcstr (""); s->readFnPtr = readPtr; s->maxBuffSz = BS_BUFF_SZ; s->isEOF = 0; return s; } /* int bsbufflength (struct bStream * s, int sz) * * Set the length of the buffer used by the bStream. If sz is zero, the * length is not set. This function returns with the previous length. */ int bsbufflength (struct bStream * s, int sz) { int oldSz; if (s == NULL || sz < 0) return BSTR_ERR; oldSz = s->maxBuffSz; if (sz > 0) s->maxBuffSz = sz; return oldSz; } int bseof (const struct bStream * s) { if (s == NULL || s->readFnPtr == NULL) return BSTR_ERR; return s->isEOF && (s->buff->slen == 0); } /* void * bsclose (struct bStream * s) * * Close the bStream, and return the handle to the stream that was originally * used to open the given stream. */ void * bsclose (struct bStream * s) { void * parm; if (s == NULL) return NULL; s->readFnPtr = NULL; if (s->buff) bdestroy (s->buff); s->buff = NULL; parm = s->parm; s->parm = NULL; s->isEOF = 1; bstr__free (s); return parm; } /* int bsreadlna (bstring r, struct bStream * s, char terminator) * * Read a bstring terminated by the terminator character or the end of the * stream from the bStream (s) and return it into the parameter r. This * function may read additional characters from the core stream that are not * returned, but will be retained for subsequent read operations. */ int bsreadlna (bstring r, struct bStream * s, char terminator) { int i, l, ret, rlo; char * b; struct tagbstring x; if (s == NULL || s->buff == NULL || r == NULL || r->mlen <= 0 || r->slen < 0 || r->mlen < r->slen) return BSTR_ERR; l = s->buff->slen; if (BSTR_OK != balloc (s->buff, s->maxBuffSz + 1)) return BSTR_ERR; b = (char *) s->buff->data; x.data = (unsigned char *) b; /* First check if the current buffer holds the terminator */ b[l] = terminator; /* Set sentinel */ for (i=0; b[i] != terminator; i++) ; if (i < l) { x.slen = i + 1; ret = bconcat (r, &x); s->buff->slen = l; if (BSTR_OK == ret) bdelete (s->buff, 0, i + 1); return BSTR_OK; } rlo = r->slen; /* If not then just concatenate the entire buffer to the output */ x.slen = l; if (BSTR_OK != bconcat (r, &x)) return BSTR_ERR; /* Perform direct in-place reads into the destination to allow for the minimum of data-copies */ for (;;) { if (BSTR_OK != balloc (r, r->slen + s->maxBuffSz + 1)) return BSTR_ERR; b = (char *) (r->data + r->slen); l = (int) s->readFnPtr (b, 1, s->maxBuffSz, s->parm); if (l <= 0) { r->data[r->slen] = (unsigned char) '\0'; s->buff->slen = 0; s->isEOF = 1; /* If nothing was read return with an error message */ return BSTR_ERR & -(r->slen == rlo); } b[l] = terminator; /* Set sentinel */ for (i=0; b[i] != terminator; i++) ; if (i < l) break; r->slen += l; } /* Terminator found, push over-read back to buffer */ i++; r->slen += i; s->buff->slen = l - i; bstr__memcpy (s->buff->data, b + i, l - i); r->data[r->slen] = (unsigned char) '\0'; return BSTR_OK; } /* int bsreadlnsa (bstring r, struct bStream * s, bstring term) * * Read a bstring terminated by any character in the term string or the end * of the stream from the bStream (s) and return it into the parameter r. * This function may read additional characters from the core stream that * are not returned, but will be retained for subsequent read operations. */ int bsreadlnsa (bstring r, struct bStream * s, const_bstring term) { int i, l, ret, rlo; unsigned char * b; struct tagbstring x; struct charField cf; if (s == NULL || s->buff == NULL || r == NULL || term == NULL || term->data == NULL || r->mlen <= 0 || r->slen < 0 || r->mlen < r->slen) return BSTR_ERR; if (term->slen == 1) return bsreadlna (r, s, term->data[0]); if (term->slen < 1 || buildCharField (&cf, term)) return BSTR_ERR; l = s->buff->slen; if (BSTR_OK != balloc (s->buff, s->maxBuffSz + 1)) return BSTR_ERR; b = (unsigned char *) s->buff->data; x.data = b; /* First check if the current buffer holds the terminator */ b[l] = term->data[0]; /* Set sentinel */ for (i=0; !testInCharField (&cf, b[i]); i++) ; if (i < l) { x.slen = i + 1; ret = bconcat (r, &x); s->buff->slen = l; if (BSTR_OK == ret) bdelete (s->buff, 0, i + 1); return BSTR_OK; } rlo = r->slen; /* If not then just concatenate the entire buffer to the output */ x.slen = l; if (BSTR_OK != bconcat (r, &x)) return BSTR_ERR; /* Perform direct in-place reads into the destination to allow for the minimum of data-copies */ for (;;) { if (BSTR_OK != balloc (r, r->slen + s->maxBuffSz + 1)) return BSTR_ERR; b = (unsigned char *) (r->data + r->slen); l = (int) s->readFnPtr (b, 1, s->maxBuffSz, s->parm); if (l <= 0) { r->data[r->slen] = (unsigned char) '\0'; s->buff->slen = 0; s->isEOF = 1; /* If nothing was read return with an error message */ return BSTR_ERR & -(r->slen == rlo); } b[l] = term->data[0]; /* Set sentinel */ for (i=0; !testInCharField (&cf, b[i]); i++) ; if (i < l) break; r->slen += l; } /* Terminator found, push over-read back to buffer */ i++; r->slen += i; s->buff->slen = l - i; bstr__memcpy (s->buff->data, b + i, l - i); r->data[r->slen] = (unsigned char) '\0'; return BSTR_OK; } /* int bsreada (bstring r, struct bStream * s, int n) * * Read a bstring of length n (or, if it is fewer, as many bytes as is * remaining) from the bStream. This function may read additional * characters from the core stream that are not returned, but will be * retained for subsequent read operations. This function will not read * additional characters from the core stream beyond virtual stream pointer. */ int bsreada (bstring r, struct bStream * s, int n) { int l, ret, orslen; char * b; struct tagbstring x; if (s == NULL || s->buff == NULL || r == NULL || r->mlen <= 0 || r->slen < 0 || r->mlen < r->slen || n <= 0) return BSTR_ERR; if (n > INT_MAX - r->slen) return BSTR_ERR; n += r->slen; l = s->buff->slen; orslen = r->slen; if (0 == l) { if (s->isEOF) return BSTR_ERR; if (r->mlen > n) { l = (int) s->readFnPtr (r->data + r->slen, 1, n - r->slen, s->parm); if (0 >= l || l > n - r->slen) { s->isEOF = 1; return BSTR_ERR; } r->slen += l; r->data[r->slen] = (unsigned char) '\0'; return 0; } } if (BSTR_OK != balloc (s->buff, s->maxBuffSz + 1)) return BSTR_ERR; b = (char *) s->buff->data; x.data = (unsigned char *) b; do { if (l + r->slen >= n) { x.slen = n - r->slen; ret = bconcat (r, &x); s->buff->slen = l; if (BSTR_OK == ret) bdelete (s->buff, 0, x.slen); return BSTR_ERR & -(r->slen == orslen); } x.slen = l; if (BSTR_OK != bconcat (r, &x)) break; l = n - r->slen; if (l > s->maxBuffSz) l = s->maxBuffSz; l = (int) s->readFnPtr (b, 1, l, s->parm); } while (l > 0); if (l < 0) l = 0; if (l == 0) s->isEOF = 1; s->buff->slen = l; return BSTR_ERR & -(r->slen == orslen); } /* int bsreadln (bstring r, struct bStream * s, char terminator) * * Read a bstring terminated by the terminator character or the end of the * stream from the bStream (s) and return it into the parameter r. This * function may read additional characters from the core stream that are not * returned, but will be retained for subsequent read operations. */ int bsreadln (bstring r, struct bStream * s, char terminator) { if (s == NULL || s->buff == NULL || r == NULL || r->mlen <= 0) return BSTR_ERR; if (BSTR_OK != balloc (s->buff, s->maxBuffSz + 1)) return BSTR_ERR; r->slen = 0; return bsreadlna (r, s, terminator); } /* int bsreadlns (bstring r, struct bStream * s, bstring term) * * Read a bstring terminated by any character in the term string or the end * of the stream from the bStream (s) and return it into the parameter r. * This function may read additional characters from the core stream that * are not returned, but will be retained for subsequent read operations. */ int bsreadlns (bstring r, struct bStream * s, const_bstring term) { if (s == NULL || s->buff == NULL || r == NULL || term == NULL || term->data == NULL || r->mlen <= 0) return BSTR_ERR; if (term->slen == 1) return bsreadln (r, s, term->data[0]); if (term->slen < 1) return BSTR_ERR; if (BSTR_OK != balloc (s->buff, s->maxBuffSz + 1)) return BSTR_ERR; r->slen = 0; return bsreadlnsa (r, s, term); } /* int bsread (bstring r, struct bStream * s, int n) * * Read a bstring of length n (or, if it is fewer, as many bytes as is * remaining) from the bStream. This function may read additional * characters from the core stream that are not returned, but will be * retained for subsequent read operations. This function will not read * additional characters from the core stream beyond virtual stream pointer. */ int bsread (bstring r, struct bStream * s, int n) { if (s == NULL || s->buff == NULL || r == NULL || r->mlen <= 0 || n <= 0) return BSTR_ERR; if (BSTR_OK != balloc (s->buff, s->maxBuffSz + 1)) return BSTR_ERR; r->slen = 0; return bsreada (r, s, n); } /* int bsunread (struct bStream * s, const_bstring b) * * Insert a bstring into the bStream at the current position. These * characters will be read prior to those that actually come from the core * stream. */ int bsunread (struct bStream * s, const_bstring b) { if (s == NULL || s->buff == NULL) return BSTR_ERR; return binsert (s->buff, 0, b, (unsigned char) '?'); } /* int bspeek (bstring r, const struct bStream * s) * * Return the currently buffered characters from the bStream that will be * read prior to reads from the core stream. */ int bspeek (bstring r, const struct bStream * s) { if (s == NULL || s->buff == NULL) return BSTR_ERR; return bassign (r, s->buff); } /* bstring bjoinblk (const struct bstrList * bl, void * blk, int len); * * Join the entries of a bstrList into one bstring by sequentially * concatenating them with the content from blk for length len in between. * If there is an error NULL is returned, otherwise a bstring with the * correct result is returned. */ bstring bjoinblk (const struct bstrList * bl, const void * blk, int len) { bstring b; unsigned char * p; int i, c, v; if (bl == NULL || bl->qty < 0) return NULL; if (len < 0) return NULL; if (len > 0 && blk == NULL) return NULL; if (bl->qty < 1) return bfromStatic (""); for (i = 0, c = 1; i < bl->qty; i++) { v = bl->entry[i]->slen; if (v < 0) return NULL; /* Invalid input */ if (v > INT_MAX - c) return NULL; /* Overflow */ c += v; } b = (bstring) bstr__alloc (sizeof (struct tagbstring)); if (len == 0) { p = b->data = (unsigned char *) bstr__alloc (c); if (p == NULL) { bstr__free (b); return NULL; } for (i = 0; i < bl->qty; i++) { v = bl->entry[i]->slen; bstr__memcpy (p, bl->entry[i]->data, v); p += v; } } else { v = (bl->qty - 1) * len; if ((bl->qty > 512 || len > 127) && v / len != bl->qty - 1) { bstr__free (b); return NULL; /* Overflow */ } if (v > INT_MAX - c) { bstr__free (b); return NULL; /* Overflow */ } c += v; p = b->data = (unsigned char *) bstr__alloc (c); if (p == NULL) { bstr__free (b); return NULL; } v = bl->entry[0]->slen; bstr__memcpy (p, bl->entry[0]->data, v); p += v; for (i = 1; i < bl->qty; i++) { bstr__memcpy (p, blk, len); p += len; v = bl->entry[i]->slen; if (v) { bstr__memcpy (p, bl->entry[i]->data, v); p += v; } } } b->mlen = c; b->slen = c-1; b->data[c-1] = (unsigned char) '\0'; return b; } /* bstring bjoin (const struct bstrList * bl, const_bstring sep); * * Join the entries of a bstrList into one bstring by sequentially * concatenating them with the sep string in between. If there is an error * NULL is returned, otherwise a bstring with the correct result is returned. */ bstring bjoin (const struct bstrList * bl, const_bstring sep) { if (sep == NULL || (sep->slen < 0 || sep->data == NULL)) return NULL; return bjoinblk (bl, sep->data, sep->slen); } #define BSSSC_BUFF_LEN (256) /* int bssplitscb (struct bStream * s, const_bstring splitStr, * int (* cb) (void * parm, int ofs, const_bstring entry), * void * parm) * * Iterate the set of disjoint sequential substrings read from a stream * divided by any of the characters in splitStr. An empty splitStr causes * the whole stream to be iterated once. * * Note: At the point of calling the cb function, the bStream pointer is * pointed exactly at the position right after having read the split * character. The cb function can act on the stream by causing the bStream * pointer to move, and bssplitscb will continue by starting the next split * at the position of the pointer after the return from cb. * * However, if the cb causes the bStream s to be destroyed then the cb must * return with a negative value, otherwise bssplitscb will continue in an * undefined manner. */ int bssplitscb (struct bStream * s, const_bstring splitStr, int (* cb) (void * parm, int ofs, const_bstring entry), void * parm) { struct charField chrs; bstring buff; int i = 0, p = 0, ret = 0; if (cb == NULL || s == NULL || s->readFnPtr == NULL || splitStr == NULL || splitStr->slen < 0) return BSTR_ERR; if (NULL == (buff = bfromcstr (""))) return BSTR_ERR; if (splitStr->slen == 0) { while (bsreada (buff, s, BSSSC_BUFF_LEN) >= 0) ; if ((ret = cb (parm, 0, buff)) > 0) ret = 0; } else { buildCharField (&chrs, splitStr); for (;;) { if (i >= buff->slen) { bsreada (buff, s, BSSSC_BUFF_LEN); if (i >= buff->slen) { if (0 < (ret = cb (parm, p, buff))) ret = 0; break; } } if (testInCharField (&chrs, buff->data[i])) { struct tagbstring t; unsigned char c; blk2tbstr (t, buff->data + i + 1, buff->slen - (i + 1)); if ((ret = bsunread (s, &t)) < 0) break; buff->slen = i; c = buff->data[i]; buff->data[i] = (unsigned char) '\0'; if ((ret = cb (parm, p, buff)) < 0) break; buff->data[i] = c; buff->slen = 0; p += i + 1; i = -1; } i++; } } bdestroy (buff); return ret; } /* int bssplitstrcb (struct bStream * s, const_bstring splitStr, * int (* cb) (void * parm, int ofs, const_bstring entry), * void * parm) * * Iterate the set of disjoint sequential substrings read from a stream * divided by the entire substring splitStr. An empty splitStr causes * each character of the stream to be iterated. * * Note: At the point of calling the cb function, the bStream pointer is * pointed exactly at the position right after having read the split * character. The cb function can act on the stream by causing the bStream * pointer to move, and bssplitscb will continue by starting the next split * at the position of the pointer after the return from cb. * * However, if the cb causes the bStream s to be destroyed then the cb must * return with a negative value, otherwise bssplitscb will continue in an * undefined manner. */ int bssplitstrcb (struct bStream * s, const_bstring splitStr, int (* cb) (void * parm, int ofs, const_bstring entry), void * parm) { bstring buff; int i = 0, p = 0, ret = 0; if (cb == NULL || s == NULL || s->readFnPtr == NULL || splitStr == NULL || splitStr->slen < 0) return BSTR_ERR; if (splitStr->slen == 1) return bssplitscb (s, splitStr, cb, parm); if (NULL == (buff = bfromcstr (""))) return BSTR_ERR; if (splitStr->slen == 0) { for (i=0; bsreada (buff, s, BSSSC_BUFF_LEN) >= 0; i++) { if ((ret = cb (parm, 0, buff)) < 0) { bdestroy (buff); return ret; } buff->slen = 0; } bdestroy (buff); return BSTR_OK; } else { for (;;) { if ((ret = binstr (buff, 0, splitStr)) >= 0) { struct tagbstring t; blk2tbstr (t, buff->data, ret); i = ret + splitStr->slen; if ((ret = cb (parm, p, &t)) < 0) break; p += i; bdelete (buff, 0, i); } else { bsreada (buff, s, BSSSC_BUFF_LEN); if (bseof (s)) { if ((ret = cb (parm, p, buff)) > 0) ret = 0; break; } } } } bdestroy (buff); return ret; } /* int bstrListCreate (void) * * Create a bstrList. */ struct bstrList * bstrListCreate (void) { struct bstrList * sl = (struct bstrList *) bstr__alloc (sizeof (struct bstrList)); if (sl) { sl->entry = (bstring *) bstr__alloc (1*sizeof (bstring)); if (!sl->entry) { bstr__free (sl); sl = NULL; } else { sl->qty = 0; sl->mlen = 1; } } return sl; } /* int bstrListDestroy (struct bstrList * sl) * * Destroy a bstrList that has been created by bsplit, bsplits or * bstrListCreate. */ int bstrListDestroy (struct bstrList * sl) { int i; if (sl == NULL || sl->qty < 0) return BSTR_ERR; for (i=0; i < sl->qty; i++) { if (sl->entry[i]) { bdestroy (sl->entry[i]); sl->entry[i] = NULL; } } sl->qty = -1; sl->mlen = -1; bstr__free (sl->entry); sl->entry = NULL; bstr__free (sl); return BSTR_OK; } /* int bstrListAlloc (struct bstrList * sl, int msz) * * Ensure that there is memory for at least msz number of entries for the * list. */ int bstrListAlloc (struct bstrList * sl, int msz) { bstring * l; int smsz; size_t nsz; if (!sl || msz <= 0 || !sl->entry || sl->qty < 0 || sl->mlen <= 0 || sl->qty > sl->mlen) return BSTR_ERR; if (sl->mlen >= msz) return BSTR_OK; smsz = snapUpSize (msz); nsz = ((size_t) smsz) * sizeof (bstring); if (nsz < (size_t) smsz) return BSTR_ERR; l = (bstring *) bstr__realloc (sl->entry, nsz); if (!l) { smsz = msz; nsz = ((size_t) smsz) * sizeof (bstring); l = (bstring *) bstr__realloc (sl->entry, nsz); if (!l) return BSTR_ERR; } sl->mlen = smsz; sl->entry = l; return BSTR_OK; } /* int bstrListAllocMin (struct bstrList * sl, int msz) * * Try to allocate the minimum amount of memory for the list to include at * least msz entries or sl->qty whichever is greater. */ int bstrListAllocMin (struct bstrList * sl, int msz) { bstring * l; size_t nsz; if (!sl || msz <= 0 || !sl->entry || sl->qty < 0 || sl->mlen <= 0 || sl->qty > sl->mlen) return BSTR_ERR; if (msz < sl->qty) msz = sl->qty; if (sl->mlen == msz) return BSTR_OK; nsz = ((size_t) msz) * sizeof (bstring); if (nsz < (size_t) msz) return BSTR_ERR; l = (bstring *) bstr__realloc (sl->entry, nsz); if (!l) return BSTR_ERR; sl->mlen = msz; sl->entry = l; return BSTR_OK; } /* int bsplitcb (const_bstring str, unsigned char splitChar, int pos, * int (* cb) (void * parm, int ofs, int len), void * parm) * * Iterate the set of disjoint sequential substrings over str divided by the * character in splitChar. * * Note: Non-destructive modification of str from within the cb function * while performing this split is not undefined. bsplitcb behaves in * sequential lock step with calls to cb. I.e., after returning from a cb * that return a non-negative integer, bsplitcb continues from the position * 1 character after the last detected split character and it will halt * immediately if the length of str falls below this point. However, if the * cb function destroys str, then it *must* return with a negative value, * otherwise bsplitcb will continue in an undefined manner. */ int bsplitcb (const_bstring str, unsigned char splitChar, int pos, int (* cb) (void * parm, int ofs, int len), void * parm) { int i, p, ret; if (cb == NULL || str == NULL || pos < 0 || pos > str->slen) return BSTR_ERR; p = pos; do { for (i=p; i < str->slen; i++) { if (str->data[i] == splitChar) break; } if ((ret = cb (parm, p, i - p)) < 0) return ret; p = i + 1; } while (p <= str->slen); return BSTR_OK; } /* int bsplitscb (const_bstring str, const_bstring splitStr, int pos, * int (* cb) (void * parm, int ofs, int len), void * parm) * * Iterate the set of disjoint sequential substrings over str divided by any * of the characters in splitStr. An empty splitStr causes the whole str to * be iterated once. * * Note: Non-destructive modification of str from within the cb function * while performing this split is not undefined. bsplitscb behaves in * sequential lock step with calls to cb. I.e., after returning from a cb * that return a non-negative integer, bsplitscb continues from the position * 1 character after the last detected split character and it will halt * immediately if the length of str falls below this point. However, if the * cb function destroys str, then it *must* return with a negative value, * otherwise bsplitscb will continue in an undefined manner. */ int bsplitscb (const_bstring str, const_bstring splitStr, int pos, int (* cb) (void * parm, int ofs, int len), void * parm) { struct charField chrs; int i, p, ret; if (cb == NULL || str == NULL || pos < 0 || pos > str->slen || splitStr == NULL || splitStr->slen < 0) return BSTR_ERR; if (splitStr->slen == 0) { if ((ret = cb (parm, 0, str->slen)) > 0) ret = 0; return ret; } if (splitStr->slen == 1) return bsplitcb (str, splitStr->data[0], pos, cb, parm); buildCharField (&chrs, splitStr); p = pos; do { for (i=p; i < str->slen; i++) { if (testInCharField (&chrs, str->data[i])) break; } if ((ret = cb (parm, p, i - p)) < 0) return ret; p = i + 1; } while (p <= str->slen); return BSTR_OK; } /* int bsplitstrcb (const_bstring str, const_bstring splitStr, int pos, * int (* cb) (void * parm, int ofs, int len), void * parm) * * Iterate the set of disjoint sequential substrings over str divided by the * substring splitStr. An empty splitStr causes the whole str to be * iterated once. * * Note: Non-destructive modification of str from within the cb function * while performing this split is not undefined. bsplitstrcb behaves in * sequential lock step with calls to cb. I.e., after returning from a cb * that return a non-negative integer, bsplitscb continues from the position * 1 character after the last detected split character and it will halt * immediately if the length of str falls below this point. However, if the * cb function destroys str, then it *must* return with a negative value, * otherwise bsplitscb will continue in an undefined manner. */ int bsplitstrcb (const_bstring str, const_bstring splitStr, int pos, int (* cb) (void * parm, int ofs, int len), void * parm) { int i, p, ret; if (cb == NULL || str == NULL || pos < 0 || pos > str->slen || splitStr == NULL || splitStr->slen < 0) return BSTR_ERR; if (0 == splitStr->slen) { for (i=pos; i < str->slen; i++) { if ((ret = cb (parm, i, 1)) < 0) return ret; } return BSTR_OK; } if (splitStr->slen == 1) return bsplitcb (str, splitStr->data[0], pos, cb, parm); for (i=p=pos; i <= str->slen - splitStr->slen; i++) { if (0 == bstr__memcmp (splitStr->data, str->data + i, splitStr->slen)) { if ((ret = cb (parm, p, i - p)) < 0) return ret; i += splitStr->slen; p = i; } } if ((ret = cb (parm, p, str->slen - p)) < 0) return ret; return BSTR_OK; } struct genBstrList { bstring b; struct bstrList * bl; }; static int bscb (void * parm, int ofs, int len) { struct genBstrList * g = (struct genBstrList *) parm; if (g->bl->qty >= g->bl->mlen) { int mlen = g->bl->mlen * 2; bstring * tbl; while (g->bl->qty >= mlen) { if (mlen < g->bl->mlen) return BSTR_ERR; mlen += mlen; } tbl = (bstring *) bstr__realloc (g->bl->entry, sizeof (bstring) * mlen); if (tbl == NULL) return BSTR_ERR; g->bl->entry = tbl; g->bl->mlen = mlen; } g->bl->entry[g->bl->qty] = bmidstr (g->b, ofs, len); g->bl->qty++; return BSTR_OK; } /* struct bstrList * bsplit (const_bstring str, unsigned char splitChar) * * Create an array of sequential substrings from str divided by the character * splitChar. */ struct bstrList * bsplit (const_bstring str, unsigned char splitChar) { struct genBstrList g; if (str == NULL || str->data == NULL || str->slen < 0) return NULL; g.bl = (struct bstrList *) bstr__alloc (sizeof (struct bstrList)); if (g.bl == NULL) return NULL; g.bl->mlen = 4; g.bl->entry = (bstring *) bstr__alloc (g.bl->mlen * sizeof (bstring)); if (NULL == g.bl->entry) { bstr__free (g.bl); return NULL; } g.b = (bstring) str; g.bl->qty = 0; if (bsplitcb (str, splitChar, 0, bscb, &g) < 0) { bstrListDestroy (g.bl); return NULL; } return g.bl; } /* struct bstrList * bsplitstr (const_bstring str, const_bstring splitStr) * * Create an array of sequential substrings from str divided by the entire * substring splitStr. */ struct bstrList * bsplitstr (const_bstring str, const_bstring splitStr) { struct genBstrList g; if (str == NULL || str->data == NULL || str->slen < 0) return NULL; g.bl = (struct bstrList *) bstr__alloc (sizeof (struct bstrList)); if (g.bl == NULL) return NULL; g.bl->mlen = 4; g.bl->entry = (bstring *) bstr__alloc (g.bl->mlen * sizeof (bstring)); if (NULL == g.bl->entry) { bstr__free (g.bl); return NULL; } g.b = (bstring) str; g.bl->qty = 0; if (bsplitstrcb (str, splitStr, 0, bscb, &g) < 0) { bstrListDestroy (g.bl); return NULL; } return g.bl; } /* struct bstrList * bsplits (const_bstring str, bstring splitStr) * * Create an array of sequential substrings from str divided by any of the * characters in splitStr. An empty splitStr causes a single entry bstrList * containing a copy of str to be returned. */ struct bstrList * bsplits (const_bstring str, const_bstring splitStr) { struct genBstrList g; if ( str == NULL || str->slen < 0 || str->data == NULL || splitStr == NULL || splitStr->slen < 0 || splitStr->data == NULL) return NULL; g.bl = (struct bstrList *) bstr__alloc (sizeof (struct bstrList)); if (g.bl == NULL) return NULL; g.bl->mlen = 4; g.bl->entry = (bstring *) bstr__alloc (g.bl->mlen * sizeof (bstring)); if (NULL == g.bl->entry) { bstr__free (g.bl); return NULL; } g.b = (bstring) str; g.bl->qty = 0; if (bsplitscb (str, splitStr, 0, bscb, &g) < 0) { bstrListDestroy (g.bl); return NULL; } return g.bl; } #if defined (__TURBOC__) && !defined (__BORLANDC__) # ifndef BSTRLIB_NOVSNP # define BSTRLIB_NOVSNP # endif #endif /* Give WATCOM C/C++, MSVC some latitude for their non-support of vsnprintf */ #if defined(__WATCOMC__) || defined(_MSC_VER) #define exvsnprintf(r,b,n,f,a) {r = _vsnprintf (b,n,f,a);} #else #ifdef BSTRLIB_NOVSNP /* This is just a hack. If you are using a system without a vsnprintf, it is not recommended that bformat be used at all. */ #define exvsnprintf(r,b,n,f,a) {vsprintf (b,f,a); r = -1;} #define START_VSNBUFF (256) #else #if defined(__GNUC__) && !defined(__APPLE__) /* Something is making gcc complain about this prototype not being here, so I've just gone ahead and put it in. */ extern int vsnprintf (char *buf, size_t count, const char *format, va_list arg); #endif #define exvsnprintf(r,b,n,f,a) {r = vsnprintf (b,n,f,a);} #endif #endif #if !defined (BSTRLIB_NOVSNP) #ifndef START_VSNBUFF #define START_VSNBUFF (16) #endif /* On IRIX vsnprintf returns n-1 when the operation would overflow the target buffer, WATCOM and MSVC both return -1, while C99 requires that the returned value be exactly what the length would be if the buffer would be large enough. This leads to the idea that if the return value is larger than n, then changing n to the return value will reduce the number of iterations required. */ /* int bformata (bstring b, const char * fmt, ...) * * After the first parameter, it takes the same parameters as printf (), but * rather than outputting results to stdio, it appends the results to * a bstring which contains what would have been output. Note that if there * is an early generation of a '\0' character, the bstring will be truncated * to this end point. */ int bformata (bstring b, const char * fmt, ...) { va_list arglist; bstring buff; int n, r; if (b == NULL || fmt == NULL || b->data == NULL || b->mlen <= 0 || b->slen < 0 || b->slen > b->mlen) return BSTR_ERR; /* Since the length is not determinable beforehand, a search is performed using the truncating "vsnprintf" call (to avoid buffer overflows) on increasing potential sizes for the output result. */ if ((n = (int) (2*strlen (fmt))) < START_VSNBUFF) n = START_VSNBUFF; if (NULL == (buff = bfromcstralloc (n + 2, ""))) { n = 1; if (NULL == (buff = bfromcstralloc (n + 2, ""))) return BSTR_ERR; } for (;;) { va_start (arglist, fmt); exvsnprintf (r, (char *) buff->data, n + 1, fmt, arglist); va_end (arglist); buff->data[n] = (unsigned char) '\0'; buff->slen = (int) (strlen) ((char *) buff->data); if (buff->slen < n) break; if (r > n) n = r; else n += n; if (BSTR_OK != balloc (buff, n + 2)) { bdestroy (buff); return BSTR_ERR; } } r = bconcat (b, buff); bdestroy (buff); return r; } /* int bassignformat (bstring b, const char * fmt, ...) * * After the first parameter, it takes the same parameters as printf (), but * rather than outputting results to stdio, it outputs the results to * the bstring parameter b. Note that if there is an early generation of a * '\0' character, the bstring will be truncated to this end point. */ int bassignformat (bstring b, const char * fmt, ...) { va_list arglist; bstring buff; int n, r; if (b == NULL || fmt == NULL || b->data == NULL || b->mlen <= 0 || b->slen < 0 || b->slen > b->mlen) return BSTR_ERR; /* Since the length is not determinable beforehand, a search is performed using the truncating "vsnprintf" call (to avoid buffer overflows) on increasing potential sizes for the output result. */ if ((n = (int) (2*strlen (fmt))) < START_VSNBUFF) n = START_VSNBUFF; if (NULL == (buff = bfromcstralloc (n + 2, ""))) { n = 1; if (NULL == (buff = bfromcstralloc (n + 2, ""))) return BSTR_ERR; } for (;;) { va_start (arglist, fmt); exvsnprintf (r, (char *) buff->data, n + 1, fmt, arglist); va_end (arglist); buff->data[n] = (unsigned char) '\0'; buff->slen = (int) (strlen) ((char *) buff->data); if (buff->slen < n) break; if (r > n) n = r; else n += n; if (BSTR_OK != balloc (buff, n + 2)) { bdestroy (buff); return BSTR_ERR; } } r = bassign (b, buff); bdestroy (buff); return r; } /* bstring bformat (const char * fmt, ...) * * Takes the same parameters as printf (), but rather than outputting results * to stdio, it forms a bstring which contains what would have been output. * Note that if there is an early generation of a '\0' character, the * bstring will be truncated to this end point. */ bstring bformat (const char * fmt, ...) { va_list arglist; bstring buff; int n, r; if (fmt == NULL) return NULL; /* Since the length is not determinable beforehand, a search is performed using the truncating "vsnprintf" call (to avoid buffer overflows) on increasing potential sizes for the output result. */ if ((n = (int) (2*strlen (fmt))) < START_VSNBUFF) n = START_VSNBUFF; if (NULL == (buff = bfromcstralloc (n + 2, ""))) { n = 1; if (NULL == (buff = bfromcstralloc (n + 2, ""))) return NULL; } for (;;) { va_start (arglist, fmt); exvsnprintf (r, (char *) buff->data, n + 1, fmt, arglist); va_end (arglist); buff->data[n] = (unsigned char) '\0'; buff->slen = (int) (strlen) ((char *) buff->data); if (buff->slen < n) break; if (r > n) n = r; else n += n; if (BSTR_OK != balloc (buff, n + 2)) { bdestroy (buff); return NULL; } } return buff; } /* int bvcformata (bstring b, int count, const char * fmt, va_list arglist) * * The bvcformata function formats data under control of the format control * string fmt and attempts to append the result to b. The fmt parameter is * the same as that of the printf function. The variable argument list is * replaced with arglist, which has been initialized by the va_start macro. * The size of the output is upper bounded by count. If the required output * exceeds count, the string b is not augmented with any contents and a value * below BSTR_ERR is returned. If a value below -count is returned then it * is recommended that the negative of this value be used as an update to the * count in a subsequent pass. On other errors, such as running out of * memory, parameter errors or numeric wrap around BSTR_ERR is returned. * BSTR_OK is returned when the output is successfully generated and * appended to b. * * Note: There is no sanity checking of arglist, and this function is * destructive of the contents of b from the b->slen point onward. If there * is an early generation of a '\0' character, the bstring will be truncated * to this end point. */ int bvcformata (bstring b, int count, const char * fmt, va_list arg) { int n, r, l; if (b == NULL || fmt == NULL || count <= 0 || b->data == NULL || b->mlen <= 0 || b->slen < 0 || b->slen > b->mlen) return BSTR_ERR; if (count > (n = b->slen + count) + 2) return BSTR_ERR; if (BSTR_OK != balloc (b, n + 2)) return BSTR_ERR; exvsnprintf (r, (char *) b->data + b->slen, count + 2, fmt, arg); b->data[b->slen + count + 2] = '\0'; /* Did the operation complete successfully within bounds? */ if (n >= (l = b->slen + (int) (strlen) ((char *) b->data + b->slen))) { b->slen = l; return BSTR_OK; } /* Abort, since the buffer was not large enough. The return value tries to help set what the retry length should be. */ b->data[b->slen] = '\0'; if (r > count+1) { l = r; } else { if (count > INT_MAX / 2) l = INT_MAX; else l = count + count; } n = -l; if (n > BSTR_ERR-1) n = BSTR_ERR-1; return n; } #endif UEFITool-A66/common/bstrlib/bstrlib.h000066400000000000000000000361421442134156300175520ustar00rootroot00000000000000/* * This source file is part of the bstring string library. This code was * written by Paul Hsieh in 2002-2015, and is covered by the BSD open source * license and the GPL. Refer to the accompanying documentation for details * on usage and license. */ /* * bstrlib.h * * This file is the interface for the core bstring functions. */ #ifndef BSTRLIB_INCLUDE #define BSTRLIB_INCLUDE #ifdef __cplusplus extern "C" { #endif #include #include #include #include #include "../basetypes.h" #if !defined (BSTRLIB_VSNP_OK) && !defined (BSTRLIB_NOVSNP) # if defined (__TURBOC__) && !defined (__BORLANDC__) # define BSTRLIB_NOVSNP # endif #endif #define BSTR_ERR (-1) #define BSTR_OK (0) #define BSTR_BS_BUFF_LENGTH_GET (0) typedef struct tagbstring * bstring; typedef const struct tagbstring * const_bstring; /* Version */ #define BSTR_VER_MAJOR 1 #define BSTR_VER_MINOR 0 #define BSTR_VER_UPDATE 0 /* Copy functions */ #define cstr2bstr bfromcstr extern bstring bfromcstr (const char * str); extern bstring bfromcstralloc (int mlen, const char * str); extern bstring bfromcstrrangealloc (int minl, int maxl, const char* str); extern bstring blk2bstr (const void * blk, int len); extern char * bstr2cstr (const_bstring s, char z); extern int bcstrfree (char * s); extern bstring bstrcpy (const_bstring b1); extern int bassign (bstring a, const_bstring b); extern int bassignmidstr (bstring a, const_bstring b, int left, int len); extern int bassigncstr (bstring a, const char * str); extern int bassignblk (bstring a, const void * s, int len); /* Destroy function */ extern int bdestroy (bstring b); /* Space allocation hinting functions */ extern int balloc (bstring s, int len); extern int ballocmin (bstring b, int len); /* Substring extraction */ extern bstring bmidstr (const_bstring b, int left, int len); /* Various standard manipulations */ extern int bconcat (bstring b0, const_bstring b1); extern int bconchar (bstring b0, char c); extern int bcatcstr (bstring b, const char * s); extern int bcatblk (bstring b, const void * s, int len); extern int binsert (bstring s1, int pos, const_bstring s2, unsigned char fill); extern int binsertblk (bstring s1, int pos, const void * s2, int len, unsigned char fill); extern int binsertch (bstring s1, int pos, int len, unsigned char fill); extern int breplace (bstring b1, int pos, int len, const_bstring b2, unsigned char fill); extern int bdelete (bstring s1, int pos, int len); extern int bsetstr (bstring b0, int pos, const_bstring b1, unsigned char fill); extern int btrunc (bstring b, int n); /* Scan/search functions */ extern int bstricmp (const_bstring b0, const_bstring b1); extern int bstrnicmp (const_bstring b0, const_bstring b1, int n); extern int biseqcaseless (const_bstring b0, const_bstring b1); extern int biseqcaselessblk (const_bstring b, const void * blk, int len); extern int bisstemeqcaselessblk (const_bstring b0, const void * blk, int len); extern int biseq (const_bstring b0, const_bstring b1); extern int biseqblk (const_bstring b, const void * blk, int len); extern int bisstemeqblk (const_bstring b0, const void * blk, int len); extern int biseqcstr (const_bstring b, const char * s); extern int biseqcstrcaseless (const_bstring b, const char * s); extern int bstrcmp (const_bstring b0, const_bstring b1); extern int bstrncmp (const_bstring b0, const_bstring b1, int n); extern int binstr (const_bstring s1, int pos, const_bstring s2); extern int binstrr (const_bstring s1, int pos, const_bstring s2); extern int binstrcaseless (const_bstring s1, int pos, const_bstring s2); extern int binstrrcaseless (const_bstring s1, int pos, const_bstring s2); extern int bstrchrp (const_bstring b, int c, int pos); extern int bstrrchrp (const_bstring b, int c, int pos); #define bstrchr(b,c) bstrchrp ((b), (c), 0) #define bstrrchr(b,c) bstrrchrp ((b), (c), blength(b)-1) extern int binchr (const_bstring b0, int pos, const_bstring b1); extern int binchrr (const_bstring b0, int pos, const_bstring b1); extern int bninchr (const_bstring b0, int pos, const_bstring b1); extern int bninchrr (const_bstring b0, int pos, const_bstring b1); extern int bfindreplace (bstring b, const_bstring find, const_bstring repl, int pos); extern int bfindreplacecaseless (bstring b, const_bstring find, const_bstring repl, int pos); /* List of string container functions */ struct bstrList { int qty, mlen; bstring * entry; }; extern struct bstrList * bstrListCreate (void); extern int bstrListDestroy (struct bstrList * sl); extern int bstrListAlloc (struct bstrList * sl, int msz); extern int bstrListAllocMin (struct bstrList * sl, int msz); /* String split and join functions */ extern struct bstrList * bsplit (const_bstring str, unsigned char splitChar); extern struct bstrList * bsplits (const_bstring str, const_bstring splitStr); extern struct bstrList * bsplitstr (const_bstring str, const_bstring splitStr); extern bstring bjoin (const struct bstrList * bl, const_bstring sep); extern bstring bjoinblk (const struct bstrList * bl, const void * s, int len); extern int bsplitcb (const_bstring str, unsigned char splitChar, int pos, int (* cb) (void * parm, int ofs, int len), void * parm); extern int bsplitscb (const_bstring str, const_bstring splitStr, int pos, int (* cb) (void * parm, int ofs, int len), void * parm); extern int bsplitstrcb (const_bstring str, const_bstring splitStr, int pos, int (* cb) (void * parm, int ofs, int len), void * parm); /* Miscellaneous functions */ extern int bpattern (bstring b, int len); extern int btoupper (bstring b); extern int btolower (bstring b); extern int bltrimws (bstring b); extern int brtrimws (bstring b); extern int btrimws (bstring b); #if !defined (BSTRLIB_NOVSNP) extern bstring bformat (const char * fmt, ...) ATTRIBUTE_FORMAT_(printf, 1, 2); extern int bformata (bstring b, const char * fmt, ...) ATTRIBUTE_FORMAT_(printf, 2, 3); extern int bassignformat (bstring b, const char * fmt, ...) ATTRIBUTE_FORMAT_(printf, 2, 3); extern int bvcformata (bstring b, int count, const char * fmt, va_list arglist); #define bvformata(ret, b, fmt, lastarg) { \ bstring bstrtmp_b = (b); \ const char * bstrtmp_fmt = (fmt); \ int bstrtmp_r = BSTR_ERR, bstrtmp_sz = 16; \ for (;;) { \ va_list bstrtmp_arglist; \ va_start (bstrtmp_arglist, lastarg); \ bstrtmp_r = bvcformata (bstrtmp_b, bstrtmp_sz, bstrtmp_fmt, bstrtmp_arglist); \ va_end (bstrtmp_arglist); \ if (bstrtmp_r >= 0) { /* Everything went ok */ \ bstrtmp_r = BSTR_OK; \ break; \ } else if (-bstrtmp_r <= bstrtmp_sz) { /* A real error? */ \ bstrtmp_r = BSTR_ERR; \ break; \ } \ bstrtmp_sz = -bstrtmp_r; /* Doubled or target size */ \ } \ ret = bstrtmp_r; \ } #endif typedef int (*bNgetc) (void *parm); typedef size_t (* bNread) (void *buff, size_t elsize, size_t nelem, void *parm); /* Input functions */ extern bstring bgets (bNgetc getcPtr, void * parm, char terminator); extern bstring bread (bNread readPtr, void * parm); extern int bgetsa (bstring b, bNgetc getcPtr, void * parm, char terminator); extern int bassigngets (bstring b, bNgetc getcPtr, void * parm, char terminator); extern int breada (bstring b, bNread readPtr, void * parm); /* Stream functions */ extern struct bStream * bsopen (bNread readPtr, void * parm); extern void * bsclose (struct bStream * s); extern int bsbufflength (struct bStream * s, int sz); extern int bsreadln (bstring b, struct bStream * s, char terminator); extern int bsreadlns (bstring r, struct bStream * s, const_bstring term); extern int bsread (bstring b, struct bStream * s, int n); extern int bsreadlna (bstring b, struct bStream * s, char terminator); extern int bsreadlnsa (bstring r, struct bStream * s, const_bstring term); extern int bsreada (bstring b, struct bStream * s, int n); extern int bsunread (struct bStream * s, const_bstring b); extern int bspeek (bstring r, const struct bStream * s); extern int bssplitscb (struct bStream * s, const_bstring splitStr, int (* cb) (void * parm, int ofs, const_bstring entry), void * parm); extern int bssplitstrcb (struct bStream * s, const_bstring splitStr, int (* cb) (void * parm, int ofs, const_bstring entry), void * parm); extern int bseof (const struct bStream * s); struct tagbstring { int mlen; int slen; unsigned char * data; }; /* Accessor macros */ #define blengthe(b, e) (((b) == (void *)0 || (b)->slen < 0) ? (int)(e) : ((b)->slen)) #define blength(b) (blengthe ((b), 0)) #define bdataofse(b, o, e) (((b) == (void *)0 || (b)->data == (void*)0) ? (char *)(e) : ((char *)(b)->data) + (o)) #define bdataofs(b, o) (bdataofse ((b), (o), (void *)0)) #define bdatae(b, e) (bdataofse (b, 0, e)) #define bdata(b) (bdataofs (b, 0)) #define bchare(b, p, e) ((((unsigned)(p)) < (unsigned)blength(b)) ? ((b)->data[(p)]) : (e)) #define bchar(b, p) bchare ((b), (p), '\0') /* Static constant string initialization macro */ #define bsStaticMlen(q,m) {(m), (int) sizeof(q)-1, (unsigned char *) ("" q "")} #if defined(_MSC_VER) # define bsStatic(q) bsStaticMlen(q,-32) #endif #ifndef bsStatic # define bsStatic(q) bsStaticMlen(q,-__LINE__) #endif /* Static constant block parameter pair */ #define bsStaticBlkParms(q) ((void *)("" q "")), ((int) sizeof(q)-1) #define bcatStatic(b,s) ((bcatblk)((b), bsStaticBlkParms(s))) #define bfromStatic(s) ((blk2bstr)(bsStaticBlkParms(s))) #define bassignStatic(b,s) ((bassignblk)((b), bsStaticBlkParms(s))) #define binsertStatic(b,p,s,f) ((binsertblk)((b), (p), bsStaticBlkParms(s), (f))) #define bjoinStatic(b,s) ((bjoinblk)((b), bsStaticBlkParms(s))) #define biseqStatic(b,s) ((biseqblk)((b), bsStaticBlkParms(s))) #define bisstemeqStatic(b,s) ((bisstemeqblk)((b), bsStaticBlkParms(s))) #define biseqcaselessStatic(b,s) ((biseqcaselessblk)((b), bsStaticBlkParms(s))) #define bisstemeqcaselessStatic(b,s) ((bisstemeqcaselessblk)((b), bsStaticBlkParms(s))) /* Reference building macros */ #define cstr2tbstr btfromcstr #define btfromcstr(t,s) { \ (t).data = (unsigned char *) (s); \ (t).slen = ((t).data) ? ((int) (strlen) ((char *)(t).data)) : 0; \ (t).mlen = -1; \ } #define blk2tbstr(t,s,l) { \ (t).data = (unsigned char *) (s); \ (t).slen = l; \ (t).mlen = -1; \ } #define btfromblk(t,s,l) blk2tbstr(t,s,l) #define bmid2tbstr(t,b,p,l) { \ const_bstring bstrtmp_s = (b); \ if (bstrtmp_s && bstrtmp_s->data && bstrtmp_s->slen >= 0) { \ int bstrtmp_left = (p); \ int bstrtmp_len = (l); \ if (bstrtmp_left < 0) { \ bstrtmp_len += bstrtmp_left; \ bstrtmp_left = 0; \ } \ if (bstrtmp_len > bstrtmp_s->slen - bstrtmp_left) \ bstrtmp_len = bstrtmp_s->slen - bstrtmp_left; \ if (bstrtmp_len <= 0) { \ (t).data = (unsigned char *)""; \ (t).slen = 0; \ } else { \ (t).data = bstrtmp_s->data + bstrtmp_left; \ (t).slen = bstrtmp_len; \ } \ } else { \ (t).data = (unsigned char *)""; \ (t).slen = 0; \ } \ (t).mlen = -__LINE__; \ } #define btfromblkltrimws(t,s,l) { \ int bstrtmp_idx = 0, bstrtmp_len = (l); \ unsigned char * bstrtmp_s = (s); \ if (bstrtmp_s && bstrtmp_len >= 0) { \ for (; bstrtmp_idx < bstrtmp_len; bstrtmp_idx++) { \ if (!isspace (bstrtmp_s[bstrtmp_idx])) break; \ } \ } \ (t).data = bstrtmp_s + bstrtmp_idx; \ (t).slen = bstrtmp_len - bstrtmp_idx; \ (t).mlen = -__LINE__; \ } #define btfromblkrtrimws(t,s,l) { \ int bstrtmp_len = (l) - 1; \ unsigned char * bstrtmp_s = (s); \ if (bstrtmp_s && bstrtmp_len >= 0) { \ for (; bstrtmp_len >= 0; bstrtmp_len--) { \ if (!isspace (bstrtmp_s[bstrtmp_len])) break; \ } \ } \ (t).data = bstrtmp_s; \ (t).slen = bstrtmp_len + 1; \ (t).mlen = -__LINE__; \ } #define btfromblktrimws(t,s,l) { \ int bstrtmp_idx = 0, bstrtmp_len = (l) - 1; \ unsigned char * bstrtmp_s = (s); \ if (bstrtmp_s && bstrtmp_len >= 0) { \ for (; bstrtmp_idx <= bstrtmp_len; bstrtmp_idx++) { \ if (!isspace (bstrtmp_s[bstrtmp_idx])) break; \ } \ for (; bstrtmp_len >= bstrtmp_idx; bstrtmp_len--) { \ if (!isspace (bstrtmp_s[bstrtmp_len])) break; \ } \ } \ (t).data = bstrtmp_s + bstrtmp_idx; \ (t).slen = bstrtmp_len + 1 - bstrtmp_idx; \ (t).mlen = -__LINE__; \ } /* Write protection macros */ #define bwriteprotect(t) { if ((t).mlen >= 0) (t).mlen = -1; } #define bwriteallow(t) { if ((t).mlen == -1) (t).mlen = (t).slen + ((t).slen == 0); } #define biswriteprotected(t) ((t).mlen <= 0) #ifdef __cplusplus } #endif #endif UEFITool-A66/common/bstrlib/bstrwrap.cpp000066400000000000000000001157201442134156300203100ustar00rootroot00000000000000/* * This source file is part of the bstring string library. This code was * written by Paul Hsieh in 2002-2015, and is covered by the BSD open source * license and the GPL. Refer to the accompanying documentation for details * on usage and license. */ /* * bstrwrap.c * * This file is the C++ wrapper for the bstring functions. */ #if defined (_MSC_VER) # define _CRT_SECURE_NO_WARNINGS #endif #include #include #include #include #include #include "bstrwrap.h" #if defined(MEMORY_DEBUG) || defined(BSTRLIB_MEMORY_DEBUG) #include "memdbg.h" #endif #ifndef bstr__alloc #define bstr__alloc(x) malloc (x) #endif #ifndef bstr__free #define bstr__free(p) free (p) #endif #ifndef bstr__realloc #define bstr__realloc(p,x) realloc ((p), (x)) #endif #ifndef bstr__memcpy #define bstr__memcpy(d,s,l) memcpy ((d), (s), (l)) #endif #ifndef bstr__memmove #define bstr__memmove(d,s,l) memmove ((d), (s), (l)) #endif #ifndef bstr__memset #define bstr__memset(d,c,l) memset ((d), (c), (l)) #endif #ifndef bstr__memcmp #define bstr__memcmp(d,c,l) memcmp ((d), (c), (l)) #endif #ifndef bstr__memchr #define bstr__memchr(s,c,l) memchr ((s), (c), (l)) #endif #if defined(BSTRLIB_CAN_USE_IOSTREAM) #include #endif namespace Bstrlib { // Constructors. CBString::CBString () { slen = 0; mlen = 8; data = (unsigned char *) bstr__alloc (mlen); if (!data) { mlen = 0; bstringThrow ("Failure in default constructor"); } else { data[0] = '\0'; } } CBString::CBString (const void * blk, int len) { data = NULL; if (len >= 0) { mlen = len + 1; slen = len; data = (unsigned char *) bstr__alloc (mlen); } if (!data) { mlen = slen = 0; bstringThrow ("Failure in block constructor"); } else { if (slen > 0) bstr__memcpy (data, blk, slen); data[slen] = '\0'; } } CBString::CBString (char c, int len) { data = NULL; if (len >= 0) { mlen = len + 1; slen = len; data = (unsigned char *) bstr__alloc (mlen); } if (!data) { mlen = slen = 0; bstringThrow ("Failure in repeat(char) constructor"); } else { if (slen > 0) bstr__memset (data, c, slen); data[slen] = '\0'; } } CBString::CBString (char c) { mlen = 2; slen = 1; if (NULL == (data = (unsigned char *) bstr__alloc (mlen))) { mlen = slen = 0; bstringThrow ("Failure in (char) constructor"); } else { data[0] = (unsigned char) c; data[1] = '\0'; } } CBString::CBString (unsigned char c) { mlen = 2; slen = 1; if (NULL == (data = (unsigned char *) bstr__alloc (mlen))) { mlen = slen = 0; bstringThrow ("Failure in (char) constructor"); } else { data[0] = c; data[1] = '\0'; } } CBString::CBString (const char *s) { if (s) { size_t sslen = strlen (s); if (sslen >= INT_MAX) bstringThrow ("Failure in (char *) constructor, string too large") slen = (int) sslen; mlen = slen + 1; if (NULL != (data = (unsigned char *) bstr__alloc (mlen))) { bstr__memcpy (data, s, mlen); return; } } data = NULL; bstringThrow ("Failure in (char *) constructor"); } CBString::CBString (int len, const char *s) { if (s) { size_t sslen = strlen (s); if (sslen >= INT_MAX) bstringThrow ("Failure in (char *) constructor, string too large") slen = (int) sslen; mlen = slen + 1; if (mlen < len) mlen = len; if (NULL != (data = (unsigned char *) bstr__alloc (mlen))) { bstr__memcpy (data, s, slen + 1); return; } } data = NULL; bstringThrow ("Failure in (int len, char *) constructor"); } CBString::CBString (const CBString& b) { slen = b.slen; mlen = slen + 1; data = NULL; if (mlen > 0) data = (unsigned char *) bstr__alloc (mlen); if (!data) { bstringThrow ("Failure in (CBString) constructor"); } else { bstr__memcpy (data, b.data, slen); data[slen] = '\0'; } } CBString::CBString (const tagbstring& x) { slen = x.slen; mlen = slen + 1; data = NULL; if (slen >= 0 && x.data != NULL) data = (unsigned char *) bstr__alloc (mlen); if (!data) { bstringThrow ("Failure in (tagbstring) constructor"); } else { bstr__memcpy (data, x.data, slen); data[slen] = '\0'; } } // Destructor. CBString::~CBString () { if (data != NULL) { bstr__free (data); data = NULL; } mlen = 0; slen = -__LINE__; } // = operator. const CBString& CBString::operator = (char c) { if (mlen <= 0) bstringThrow ("Write protection error"); if (2 >= mlen) alloc (2); if (!data) { mlen = slen = 0; bstringThrow ("Failure in =(char) operator"); } else { slen = 1; data[0] = (unsigned char) c; data[1] = '\0'; } return *this; } const CBString& CBString::operator = (unsigned char c) { if (mlen <= 0) bstringThrow ("Write protection error"); if (2 >= mlen) alloc (2); if (!data) { mlen = slen = 0; bstringThrow ("Failure in =(char) operator"); } else { slen = 1; data[0] = c; data[1] = '\0'; } return *this; } const CBString& CBString::operator = (const char *s) { size_t tmpSlen; if (mlen <= 0) bstringThrow ("Write protection error"); if (NULL == s) s = ""; if ((tmpSlen = strlen (s)) >= (size_t) mlen) { if (tmpSlen >= INT_MAX-1) bstringThrow ("Failure in =(const char *) operator, string too large"); alloc ((int) tmpSlen); } if (data) { slen = (int) tmpSlen; bstr__memcpy (data, s, tmpSlen + 1); } else { mlen = slen = 0; bstringThrow ("Failure in =(const char *) operator"); } return *this; } const CBString& CBString::operator = (const CBString& b) { if (mlen <= 0) bstringThrow ("Write protection error"); if (b.slen >= mlen) alloc (b.slen); slen = b.slen; if (!data) { mlen = slen = 0; bstringThrow ("Failure in =(CBString) operator"); } else { bstr__memcpy (data, b.data, slen); data[slen] = '\0'; } return *this; } const CBString& CBString::operator = (const tagbstring& x) { if (mlen <= 0) bstringThrow ("Write protection error"); if (x.slen < 0) bstringThrow ("Failure in =(tagbstring) operator, badly formed tagbstring"); if (x.slen >= mlen) alloc (x.slen); slen = x.slen; if (!data) { mlen = slen = 0; bstringThrow ("Failure in =(tagbstring) operator"); } else { bstr__memcpy (data, x.data, slen); data[slen] = '\0'; } return *this; } const CBString& CBString::operator += (const CBString& b) { if (BSTR_ERR == bconcat (this, (bstring) &b)) { bstringThrow ("Failure in concatenate"); } return *this; } const CBString& CBString::operator += (const char *s) { char * d; int i, l; if (mlen <= 0) bstringThrow ("Write protection error"); /* Optimistically concatenate directly */ l = mlen - slen; d = (char *) &data[slen]; for (i=0; i < l; i++) { if ((*d++ = *s++) == '\0') { slen += i; return *this; } } slen += i; if (BSTR_ERR == bcatcstr (this, s)) { bstringThrow ("Failure in concatenate"); } return *this; } const CBString& CBString::operator += (char c) { if (BSTR_ERR == bconchar (this, c)) { bstringThrow ("Failure in concatenate"); } return *this; } const CBString& CBString::operator += (unsigned char c) { if (BSTR_ERR == bconchar (this, (char) c)) { bstringThrow ("Failure in concatenate"); } return *this; } const CBString& CBString::operator += (const tagbstring& x) { if (mlen <= 0) bstringThrow ("Write protection error"); if (x.slen < 0) bstringThrow ("Failure in +=(tagbstring) operator, badly formed tagbstring"); alloc (x.slen + slen + 1); if (!data) { mlen = slen = 0; bstringThrow ("Failure in +=(tagbstring) operator"); } else { bstr__memcpy (data + slen, x.data, x.slen); slen += x.slen; data[slen] = '\0'; } return *this; } const CBString CBString::operator + (char c) const { CBString retval (*this); retval += c; return retval; } const CBString CBString::operator + (unsigned char c) const { CBString retval (*this); retval += c; return retval; } const CBString CBString::operator + (const CBString& b) const { CBString retval (*this); retval += b; return retval; } const CBString CBString::operator + (const char *s) const { if (s == NULL) bstringThrow ("Failure in + (char *) operator, NULL"); CBString retval (*this); retval += s; return retval; } const CBString CBString::operator + (const unsigned char *s) const { if (s == NULL) bstringThrow ("Failure in + (unsigned char *) operator, NULL"); CBString retval (*this); retval += (const char *) s; return retval; } const CBString CBString::operator + (const tagbstring& x) const { if (x.slen < 0) bstringThrow ("Failure in + (tagbstring) operator, badly formed tagbstring"); CBString retval (*this); retval += x; return retval; } bool CBString::operator == (const CBString& b) const { int retval; if (BSTR_ERR == (retval = biseq ((bstring)this, (bstring)&b))) { bstringThrow ("Failure in compare (==)"); } return retval > 0; } bool CBString::operator == (const char * s) const { int retval; if (NULL == s) { bstringThrow ("Failure in compare (== NULL)"); } if (BSTR_ERR == (retval = biseqcstr ((bstring) this, s))) { bstringThrow ("Failure in compare (==)"); } return retval > 0; } bool CBString::operator == (const unsigned char * s) const { int retval; if (NULL == s) { bstringThrow ("Failure in compare (== NULL)"); } if (BSTR_ERR == (retval = biseqcstr ((bstring) this, (const char *) s))) { bstringThrow ("Failure in compare (==)"); } return retval > 0; } bool CBString::operator != (const CBString& b) const { return ! ((*this) == b); } bool CBString::operator != (const char * s) const { return ! ((*this) == s); } bool CBString::operator != (const unsigned char * s) const { return ! ((*this) == s); } bool CBString::operator < (const CBString& b) const { int retval; if (SHRT_MIN == (retval = bstrcmp ((bstring) this, (bstring)&b))) { bstringThrow ("Failure in compare (<)"); } return retval < 0; } bool CBString::operator < (const char * s) const { if (s == NULL) { bstringThrow ("Failure in compare (<)"); } return strcmp ((const char *)this->data, s) < 0; } bool CBString::operator < (const unsigned char * s) const { if (s == NULL) { bstringThrow ("Failure in compare (<)"); } return strcmp ((const char *)this->data, (const char *)s) < 0; } bool CBString::operator <= (const CBString& b) const { int retval; if (SHRT_MIN == (retval = bstrcmp ((bstring) this, (bstring)&b))) { bstringThrow ("Failure in compare (<=)"); } return retval <= 0; } bool CBString::operator <= (const char * s) const { if (s == NULL) { bstringThrow ("Failure in compare (<=)"); } return strcmp ((const char *)this->data, s) <= 0; } bool CBString::operator <= (const unsigned char * s) const { if (s == NULL) { bstringThrow ("Failure in compare (<=)"); } return strcmp ((const char *)this->data, (const char *)s) <= 0; } bool CBString::operator > (const CBString& b) const { return ! ((*this) <= b); } bool CBString::operator > (const char * s) const { return ! ((*this) <= s); } bool CBString::operator > (const unsigned char * s) const { return ! ((*this) <= s); } bool CBString::operator >= (const CBString& b) const { return ! ((*this) < b); } bool CBString::operator >= (const char * s) const { return ! ((*this) < s); } bool CBString::operator >= (const unsigned char * s) const { return ! ((*this) < s); } CBString::operator double () const { double d = 0; if (1 != sscanf ((const char *)this->data, "%lf", &d)) { bstringThrow ("Unable to convert to a double"); } return d; } CBString::operator float () const { float d = 0; if (1 != sscanf ((const char *)this->data, "%f", &d)) { bstringThrow ("Unable to convert to a float"); } return d; } CBString::operator int () const { int d = 0; if (1 != sscanf ((const char *)this->data, "%d", &d)) { bstringThrow ("Unable to convert to an int"); } return d; } CBString::operator unsigned int () const { unsigned int d = 0; if (1 != sscanf ((const char *)this->data, "%u", &d)) { bstringThrow ("Unable to convert to an unsigned int"); } return d; } #ifdef __TURBOC__ # ifndef BSTRLIB_NOVSNP # define BSTRLIB_NOVSNP # endif #endif /* Give WATCOM C/C++, MSVC some latitude for their non-support of vsnprintf */ #if defined(__WATCOMC__) || defined(_MSC_VER) #define exvsnprintf(r,b,n,f,a) {r = _vsnprintf (b,n,f,a);} #else #ifdef BSTRLIB_NOVSNP /* This is just a hack. If you are using a system without a vsnprintf, it is not recommended that bformat be used at all. */ #define exvsnprintf(r,b,n,f,a) {vsprintf (b,f,a); r = -1;} #define START_VSNBUFF (256) #else #if defined (__GNUC__) && !defined (__PPC__) /* Something is making gcc complain about this prototype not being here, so I've just gone ahead and put it in. */ extern "C" { extern int vsnprintf (char *buf, size_t count, const char *format, va_list arg); } #endif #define exvsnprintf(r,b,n,f,a) {r = vsnprintf (b,n,f,a);} #endif #endif #ifndef START_VSNBUFF #define START_VSNBUFF (16) #endif /* * Yeah I'd like to just call a vformat function or something, but because of * the ANSI specified brokeness of the va_* macros, it is actually not * possible to do this correctly. */ void CBString::format (const char * fmt, ...) { bstring b; va_list arglist; int r, n; if (mlen <= 0) bstringThrow ("Write protection error"); if (fmt == NULL) { *this = ""; bstringThrow ("CBString::format (NULL, ...) is erroneous."); } else { if ((b = bfromcstr ("")) == NULL) { #ifdef BSTRLIB_THROWS_EXCEPTIONS bstringThrow ("CBString::format out of memory."); #else *this = ""; #endif } else { if ((n = (int) (2 * (strlen) (fmt))) < START_VSNBUFF) n = START_VSNBUFF; for (;;) { if (BSTR_OK != balloc (b, n + 2)) { #ifdef BSTRLIB_THROWS_EXCEPTIONS bstringThrow ("CBString::format out of memory."); #else b = bformat (""); break; #endif } va_start (arglist, fmt); exvsnprintf (r, (char *) b->data, n + 1, fmt, arglist); va_end (arglist); b->data[n] = '\0'; b->slen = (int) (strlen) ((char *) b->data); if (b->slen < n) break; if (r > n) n = r; else n += n; } *this = *b; bdestroy (b); } } } void CBString::formata (const char * fmt, ...) { bstring b; va_list arglist; int r, n; if (mlen <= 0) bstringThrow ("Write protection error"); if (fmt == NULL) { *this += ""; bstringThrow ("CBString::formata (NULL, ...) is erroneous."); } else { if ((b = bfromcstr ("")) == NULL) { #ifdef BSTRLIB_THROWS_EXCEPTIONS bstringThrow ("CBString::format out of memory."); #else *this += ""; #endif } else { if ((n = (int) (2 * (strlen) (fmt))) < START_VSNBUFF) n = START_VSNBUFF; for (;;) { if (BSTR_OK != balloc (b, n + 2)) { #ifdef BSTRLIB_THROWS_EXCEPTIONS bstringThrow ("CBString::format out of memory."); #else b = bformat (""); break; #endif } va_start (arglist, fmt); exvsnprintf (r, (char *) b->data, n + 1, fmt, arglist); va_end (arglist); b->data[n] = '\0'; b->slen = (int) (strlen) ((char *) b->data); if (b->slen < n) break; if (r > n) n = r; else n += n; } *this += *b; bdestroy (b); } } } int CBString::caselessEqual (const CBString& b) const { int ret; if (BSTR_ERR == (ret = biseqcaseless ((bstring) this, (bstring) &b))) { bstringThrow ("CBString::caselessEqual Unable to compare"); } return ret; } int CBString::caselessCmp (const CBString& b) const { int ret; if (SHRT_MIN == (ret = bstricmp ((bstring) this, (bstring) &b))) { bstringThrow ("CBString::caselessCmp Unable to compare"); } return ret; } int CBString::find (const CBString& b, int pos) const { return binstr ((bstring) this, pos, (bstring) &b); } /* int CBString::find (const char * b, int pos) const; Uses and unrolling and sliding paired indexes character matching. Since the unrolling is the primary real world impact the true purpose of this algorithm choice is maximize the effectiveness of the unrolling. The idea is to scan until at least one match of the current indexed character from each string, and then shift indexes of both down by and repeat until the last character form b matches. When the last character from b matches if the were no mismatches in previous strlen(b) characters then we know we have a full match, otherwise shift both indexes back strlen(b) characters and continue. In general, if there is any character in b that is not at all in this CBString, then this algorithm is O(slen). The algorithm does not easily degenerate into O(slen * strlen(b)) performance except in very uncommon situations. Thus from a real world perspective, the overhead of precomputing suffix shifts in the Boyer-Moore algorithm is avoided, while delivering an unrolled matching inner loop most of the time. */ int CBString::find (const char * b, int pos) const { int ii, j; unsigned char c0; int i, l; unsigned char cx; unsigned char * pdata; if (NULL == b) { #ifdef BSTRLIB_THROWS_EXCEPTIONS bstringThrow ("CBString::find NULL."); #else return BSTR_ERR; #endif } if ((unsigned int) pos > (unsigned int) slen) return BSTR_ERR; if ('\0' == b[0]) return pos; if (pos == slen) return BSTR_ERR; if ('\0' == b[1]) return find (b[0], pos); cx = c0 = (unsigned char) b[0]; l = slen - 1; pdata = data; for (ii = -1, i = pos, j = 0; i < l;) { /* Unrolled current character test */ if (cx != pdata[i]) { if (cx != pdata[1+i]) { i += 2; continue; } i++; } /* Take note if this is the start of a potential match */ if (0 == j) ii = i; /* Shift the test character down by one */ j++; i++; /* If this isn't past the last character continue */ if ('\0' != (cx = b[j])) continue; N0:; /* If no characters mismatched, then we matched */ if (i == ii+j) return ii; /* Shift back to the beginning */ i -= j; j = 0; cx = c0; } /* Deal with last case if unrolling caused a misalignment */ if (i == l && cx == pdata[i] && '\0' == b[j+1]) goto N0; return BSTR_ERR; } int CBString::caselessfind (const CBString& b, int pos) const { return binstrcaseless ((bstring) this, pos, (bstring) &b); } int CBString::caselessfind (const char * b, int pos) const { struct tagbstring t; if (NULL == b) { #ifdef BSTRLIB_THROWS_EXCEPTIONS bstringThrow ("CBString::caselessfind NULL."); #else return BSTR_ERR; #endif } if ((unsigned int) pos > (unsigned int) slen) return BSTR_ERR; if ('\0' == b[0]) return pos; if (pos == slen) return BSTR_ERR; btfromcstr (t, b); return binstrcaseless ((bstring) this, pos, (bstring) &t); } int CBString::find (char c, int pos) const { if (pos < 0) return BSTR_ERR; for (;pos < slen; pos++) { if (data[pos] == (unsigned char) c) return pos; } return BSTR_ERR; } int CBString::reversefind (const CBString& b, int pos) const { return binstrr ((bstring) this, pos, (bstring) &b); } int CBString::reversefind (const char * b, int pos) const { struct tagbstring t; if (NULL == b) { #ifdef BSTRLIB_THROWS_EXCEPTIONS bstringThrow ("CBString::reversefind NULL."); #else return BSTR_ERR; #endif } cstr2tbstr (t, b); return binstrr ((bstring) this, pos, &t); } int CBString::caselessreversefind (const CBString& b, int pos) const { return binstrrcaseless ((bstring) this, pos, (bstring) &b); } int CBString::caselessreversefind (const char * b, int pos) const { struct tagbstring t; if (NULL == b) { #ifdef BSTRLIB_THROWS_EXCEPTIONS bstringThrow ("CBString::caselessreversefind NULL."); #else return BSTR_ERR; #endif } if ((unsigned int) pos > (unsigned int) slen) return BSTR_ERR; if ('\0' == b[0]) return pos; if (pos == slen) return BSTR_ERR; btfromcstr (t, b); return binstrrcaseless ((bstring) this, pos, (bstring) &t); } int CBString::reversefind (char c, int pos) const { if (pos > slen) return BSTR_ERR; if (pos == slen) pos--; for (;pos >= 0; pos--) { if (data[pos] == (unsigned char) c) return pos; } return BSTR_ERR; } int CBString::findchr (const CBString& b, int pos) const { return binchr ((bstring) this, pos, (bstring) &b); } int CBString::findchr (const char * s, int pos) const { struct tagbstring t; if (NULL == s) { #ifdef BSTRLIB_THROWS_EXCEPTIONS bstringThrow ("CBString::findchr NULL."); #else return BSTR_ERR; #endif } cstr2tbstr (t, s); return binchr ((bstring) this, pos, (bstring) &t); } int CBString::nfindchr (const CBString& b, int pos) const { return bninchr ((bstring) this, pos, (bstring) &b); } int CBString::nfindchr (const char * s, int pos) const { struct tagbstring t; if (NULL == s) { #ifdef BSTRLIB_THROWS_EXCEPTIONS bstringThrow ("CBString::nfindchr NULL."); #else return BSTR_ERR; #endif } cstr2tbstr (t, s); return bninchr ((bstring) this, pos, &t); } int CBString::reversefindchr (const CBString& b, int pos) const { return binchrr ((bstring) this, pos, (bstring) &b); } int CBString::reversefindchr (const char * s, int pos) const { struct tagbstring t; if (NULL == s) { #ifdef BSTRLIB_THROWS_EXCEPTIONS bstringThrow ("CBString::reversefindchr NULL."); #else return BSTR_ERR; #endif } cstr2tbstr (t, s); return binchrr ((bstring) this, pos, &t); } int CBString::nreversefindchr (const CBString& b, int pos) const { return bninchrr ((bstring) this, pos, (bstring) &b); } int CBString::nreversefindchr (const char * s, int pos) const { struct tagbstring t; if (NULL == s) { #ifdef BSTRLIB_THROWS_EXCEPTIONS bstringThrow ("CBString::nreversefindchr NULL."); #else return BSTR_ERR; #endif } cstr2tbstr (t, s); return bninchrr ((bstring) this, pos, &t); } CBString CBString::midstr (int left, int len) const { struct tagbstring t; if (left < 0) { len += left; left = 0; } if (len > slen - left) len = slen - left; if (len <= 0) return CBString (""); blk2tbstr (t, data + left, len); return CBString (t); } void CBString::alloc (int len) { if (BSTR_ERR == balloc ((bstring)this, len)) { bstringThrow ("Failure in alloc"); } } void CBString::fill (int len, unsigned char cfill) { slen = 0; if (BSTR_ERR == bsetstr (this, len, NULL, cfill)) { bstringThrow ("Failure in fill"); } } void CBString::setsubstr (int pos, const CBString& b, unsigned char cfill) { if (BSTR_ERR == bsetstr (this, pos, (bstring) &b, cfill)) { bstringThrow ("Failure in setsubstr"); } } void CBString::setsubstr (int pos, const char * s, unsigned char cfill) { struct tagbstring t; if (NULL == s) { #ifdef BSTRLIB_THROWS_EXCEPTIONS bstringThrow ("setsubstr NULL."); #else return; #endif } cstr2tbstr (t, s); if (BSTR_ERR == bsetstr (this, pos, &t, cfill)) { bstringThrow ("Failure in setsubstr"); } } void CBString::insert (int pos, const CBString& b, unsigned char cfill) { if (BSTR_ERR == binsert (this, pos, (bstring) &b, cfill)) { bstringThrow ("Failure in insert"); } } void CBString::insert (int pos, const char * s, unsigned char cfill) { struct tagbstring t; if (NULL == s) { #ifdef BSTRLIB_THROWS_EXCEPTIONS bstringThrow ("insert NULL."); #else return; #endif } cstr2tbstr (t, s); if (BSTR_ERR == binsert (this, pos, &t, cfill)) { bstringThrow ("Failure in insert"); } } void CBString::insertchrs (int pos, int len, unsigned char cfill) { if (BSTR_ERR == binsertch (this, pos, len, cfill)) { bstringThrow ("Failure in insertchrs"); } } void CBString::replace (int pos, int len, const CBString& b, unsigned char cfill) { if (BSTR_ERR == breplace (this, pos, len, (bstring) &b, cfill)) { bstringThrow ("Failure in replace"); } } void CBString::replace (int pos, int len, const char * s, unsigned char cfill) { struct tagbstring t; size_t q; if (mlen <= 0) bstringThrow ("Write protection error"); if (NULL == s || (pos|len) < 0) { bstringThrow ("Failure in replace"); } else { if (pos + len >= slen) { cstr2tbstr (t, s); if (BSTR_ERR == bsetstr (this, pos, &t, cfill)) { bstringThrow ("Failure in replace"); } else if (pos + t.slen < slen) { slen = pos + t.slen; data[slen] = '\0'; } } else { /* Aliasing case */ if ((unsigned int) (data - (unsigned char *) s) < (unsigned int) slen) { replace (pos, len, CBString(s), cfill); return; } if ((q = strlen (s)) > (size_t) len || len < 0) { if (slen + q - len >= INT_MAX) bstringThrow ("Failure in replace, result too long."); alloc ((int) (slen + q - len)); if (NULL == data) return; } if ((int) q != len) bstr__memmove (data + pos + q, data + pos + len, slen - (pos + len)); bstr__memcpy (data + pos, s, q); slen += ((int) q) - len; data[slen] = '\0'; } } } void CBString::findreplace (const CBString& sfind, const CBString& repl, int pos) { if (BSTR_ERR == bfindreplace (this, (bstring) &sfind, (bstring) &repl, pos)) { bstringThrow ("Failure in findreplace"); } } void CBString::findreplace (const CBString& sfind, const char * repl, int pos) { struct tagbstring t; if (NULL == repl) { #ifdef BSTRLIB_THROWS_EXCEPTIONS bstringThrow ("findreplace NULL."); #else return; #endif } cstr2tbstr (t, repl); if (BSTR_ERR == bfindreplace (this, (bstring) &sfind, (bstring) &t, pos)) { bstringThrow ("Failure in findreplace"); } } void CBString::findreplace (const char * sfind, const CBString& repl, int pos) { struct tagbstring t; if (NULL == sfind) { #ifdef BSTRLIB_THROWS_EXCEPTIONS bstringThrow ("findreplace NULL."); #else return; #endif } cstr2tbstr (t, sfind); if (BSTR_ERR == bfindreplace (this, (bstring) &t, (bstring) &repl, pos)) { bstringThrow ("Failure in findreplace"); } } void CBString::findreplace (const char * sfind, const char * repl, int pos) { struct tagbstring t, u; if (NULL == repl || NULL == sfind) { #ifdef BSTRLIB_THROWS_EXCEPTIONS bstringThrow ("findreplace NULL."); #else return; #endif } cstr2tbstr (t, sfind); cstr2tbstr (u, repl); if (BSTR_ERR == bfindreplace (this, (bstring) &t, (bstring) &u, pos)) { bstringThrow ("Failure in findreplace"); } } void CBString::findreplacecaseless (const CBString& sfind, const CBString& repl, int pos) { if (BSTR_ERR == bfindreplacecaseless (this, (bstring) &sfind, (bstring) &repl, pos)) { bstringThrow ("Failure in findreplacecaseless"); } } void CBString::findreplacecaseless (const CBString& sfind, const char * repl, int pos) { struct tagbstring t; if (NULL == repl) { #ifdef BSTRLIB_THROWS_EXCEPTIONS bstringThrow ("findreplacecaseless NULL."); #else return; #endif } cstr2tbstr (t, repl); if (BSTR_ERR == bfindreplacecaseless (this, (bstring) &sfind, (bstring) &t, pos)) { bstringThrow ("Failure in findreplacecaseless"); } } void CBString::findreplacecaseless (const char * sfind, const CBString& repl, int pos) { struct tagbstring t; if (NULL == sfind) { #ifdef BSTRLIB_THROWS_EXCEPTIONS bstringThrow ("findreplacecaseless NULL."); #else return; #endif } cstr2tbstr (t, sfind); if (BSTR_ERR == bfindreplacecaseless (this, (bstring) &t, (bstring) &repl, pos)) { bstringThrow ("Failure in findreplacecaseless"); } } void CBString::findreplacecaseless (const char * sfind, const char * repl, int pos) { struct tagbstring t, u; if (NULL == repl || NULL == sfind) { #ifdef BSTRLIB_THROWS_EXCEPTIONS bstringThrow ("findreplacecaseless NULL."); #else return; #endif } cstr2tbstr (t, sfind); cstr2tbstr (u, repl); if (BSTR_ERR == bfindreplacecaseless (this, (bstring) &t, (bstring) &u, pos)) { bstringThrow ("Failure in findreplacecaseless"); } } void CBString::remove (int pos, int len) { if (BSTR_ERR == bdelete (this, pos, len)) { bstringThrow ("Failure in remove"); } } void CBString::trunc (int len) { if (len < 0) { bstringThrow ("Failure in trunc"); } if (len < slen) { slen = len; data[len] = '\0'; } } void CBString::ltrim (const CBString& b) { int l = nfindchr (b, 0); if (l == BSTR_ERR) l = slen; remove (0, l); } void CBString::rtrim (const CBString& b) { int l = nreversefindchr (b, slen - 1); #if BSTR_ERR != -1 if (l == BSTR_ERR) l = -1; #endif slen = l + 1; if (mlen > slen) data[slen] = '\0'; } void CBString::toupper () { if (BSTR_ERR == btoupper ((bstring) this)) { bstringThrow ("Failure in toupper"); } } void CBString::tolower () { if (BSTR_ERR == btolower ((bstring) this)) { bstringThrow ("Failure in tolower"); } } void CBString::repeat (int count) { count *= slen; if (count == 0) { trunc (0); return; } if (count < 0 || BSTR_ERR == bpattern (this, count)) { bstringThrow ("Failure in repeat"); } } int CBString::gets (bNgetc getcPtr, void * parm, char terminator) { if (mlen <= 0) bstringThrow ("Write protection error"); bstring b = bgets (getcPtr, parm, terminator); if (b == NULL) { slen = 0; return -1; } *this = *b; bdestroy (b); return 0; } int CBString::read (bNread readPtr, void * parm) { if (mlen <= 0) bstringThrow ("Write protection error"); bstring b = bread (readPtr, parm); if (b == NULL) { slen = 0; return -1; } *this = *b; bdestroy (b); return 0; } const CBString operator + (const char *a, const CBString& b) { return CBString(a) + b; } const CBString operator + (const unsigned char *a, const CBString& b) { return CBString((const char *)a) + b; } const CBString operator + (char c, const CBString& b) { return CBString(c) + b; } const CBString operator + (unsigned char c, const CBString& b) { return CBString(c) + b; } const CBString operator + (const tagbstring& x, const CBString& b) { return CBString(x) + b; } void CBString::writeprotect () { if (mlen >= 0) mlen = -1; } void CBString::writeallow () { if (mlen == -1) mlen = slen + (slen == 0); else if (mlen < 0) { bstringThrow ("Cannot unprotect a constant"); } } #if defined(BSTRLIB_CAN_USE_STL) // Constructors. CBString::CBString (const CBStringList& l) { int c; size_t i; for (c=1, i=0; i < l.size(); i++) { c += l.at(i).slen; } mlen = c; slen = 0; data = (unsigned char *) bstr__alloc (c); if (!data) { mlen = slen = 0; bstringThrow ("Failure in (CBStringList) constructor"); } else { for (i=0; i < l.size(); i++) { *this += l.at(i); } } } CBString::CBString (const struct CBStringList& l, const CBString& sep) { int c, sl = sep.length (); size_t i; for (c=1, i=0; i < l.size(); i++) { c += l.at(i).slen + sl; } mlen = c; slen = 0; data = (unsigned char *) bstr__alloc (mlen); if (!data) { mlen = slen = 0; bstringThrow ("Failure in (CBStringList) constructor"); } else { for (i=0; i < l.size(); i++) { if (i > 0) *this += sep; *this += l.at(i); } } } CBString::CBString (const struct CBStringList& l, char sep) { int c; size_t i; for (c=1, i=0; i < l.size(); i++) { c += l.at(i).slen + 1; } mlen = c; slen = 0; data = (unsigned char *) bstr__alloc (mlen); if (!data) { mlen = slen = 0; bstringThrow ("Failure in (CBStringList) constructor"); } else { for (i=0; i < l.size(); i++) { if (i > 0) *this += sep; *this += l.at(i); } } } CBString::CBString (const struct CBStringList& l, unsigned char sep) { int c; size_t i; for (c=1, i=0; i < l.size(); i++) { c += l.at(i).slen + 1; } mlen = c; slen = 0; data = (unsigned char *) bstr__alloc (mlen); if (!data) { mlen = slen = 0; bstringThrow ("Failure in (CBStringList) constructor"); } else { for (i=0; i < l.size(); i++) { if (i > 0) *this += sep; *this += l.at(i); } } } void CBString::join (const struct CBStringList& l) { int c; size_t i; if (mlen <= 0) { bstringThrow ("Write protection error"); } for (c=1, i=0; i < l.size(); i++) { c += l.at(i).slen; if (c < 0) bstringThrow ("Failure in (CBStringList) constructor, too long"); } alloc (c); slen = 0; if (!data) { mlen = slen = 0; bstringThrow ("Failure in (CBStringList) constructor"); } else { for (i=0; i < l.size(); i++) { *this += l.at(i); } } } void CBString::join (const struct CBStringList& l, const CBString& sep) { int c, sl = sep.length(); size_t i; if (mlen <= 0) { bstringThrow ("Write protection error"); } for (c=1, i=0; i < l.size(); i++) { c += l.at(i).slen + sl; if (c < sl) bstringThrow ("Failure in (CBStringList) constructor, too long"); } alloc (c); slen = 0; if (!data) { mlen = slen = 0; bstringThrow ("Failure in (CBStringList) constructor"); } else { for (i=0; i < l.size(); i++) { if (i > 0) *this += sep; *this += l.at(i); } } } void CBString::join (const struct CBStringList& l, char sep) { int c; size_t i; if (mlen <= 0) { bstringThrow ("Write protection error"); } for (c=1, i=0; i < l.size(); i++) { c += l.at(i).slen + 1; if (c <= 0) bstringThrow ("Failure in (CBStringList) constructor, too long"); } alloc (c); slen = 0; if (!data) { mlen = slen = 0; bstringThrow ("Failure in (CBStringList) constructor"); } else { for (i=0; i < l.size(); i++) { if (i > 0) *this += sep; *this += l.at(i); } } } void CBString::join (const struct CBStringList& l, unsigned char sep) { int c; size_t i; if (mlen <= 0) { bstringThrow ("Write protection error"); } for (c=1, i=0; i < l.size(); i++) { c += l.at(i).slen + 1; if (c <= 0) bstringThrow ("Failure in (CBStringList) constructor, too long"); } alloc (c); slen = 0; if (!data) { mlen = slen = 0; bstringThrow ("Failure in (CBStringList) constructor"); } else { for (i=0; i < l.size(); i++) { if (i > 0) *this += sep; *this += l.at(i); } } } // Split functions. void CBStringList::split (const CBString& b, unsigned char splitChar) { int p, i; p = 0; do { for (i = p; i < b.length (); i++) { if (b.character (i) == splitChar) break; } if (i >= p) this->push_back (CBString (&(b.data[p]), i - p)); p = i + 1; } while (p <= b.length ()); } void CBStringList::split (const CBString& b, const CBString& s) { struct { unsigned long content[(1 << CHAR_BIT) / 32]; } chrs; unsigned char c; int p, i; if (s.length() == 0) bstringThrow ("Null splitstring failure"); if (s.length() == 1) { this->split (b, s.character (0)); } else { for (i=0; i < ((1 << CHAR_BIT) / 32); i++) chrs.content[i] = 0x0; for (i=0; i < s.length(); i++) { c = s.character (i); chrs.content[c >> 5] |= ((long)1) << (c & 31); } p = 0; do { for (i = p; i < b.length (); i++) { c = b.character (i); if (chrs.content[c >> 5] & ((long)1) << (c & 31)) break; } if (i >= p) this->push_back (CBString (&(b.data[p]), i - p)); p = i + 1; } while (p <= b.length ()); } } void CBStringList::splitstr (const CBString& b, const CBString& s) { int p, i; if (s.length() == 1) { this->split (b, s.character (0)); } else if (s.length() == 0) { for (i=0; i < b.length (); i++) { this->push_back (CBString (b.data[i])); } } else { for (p=0; (i = b.find (s, p)) >= 0; p = i + s.length ()) { this->push_back (b.midstr (p, i - p)); } if (p <= b.length ()) { this->push_back (b.midstr (p, b.length () - p)); } } } static int streamSplitCb (void * parm, int ofs, const_bstring entry) { CBStringList * r = (CBStringList *) parm; (void)ofs; r->push_back (CBString (*entry)); return 0; } void CBStringList::split (const CBStream& b, const CBString& s) { if (0 > bssplitscb (b.m_s, (bstring) &s, streamSplitCb, (void *) this)) { bstringThrow ("Split bstream failure"); } } void CBStringList::split (const CBStream& b, unsigned char splitChar) { CBString sc (splitChar); if (0 > bssplitscb (b.m_s, (bstring) &sc, streamSplitCb, (void *) this)) { bstringThrow ("Split bstream failure"); } } void CBStringList::splitstr (const CBStream& b, const CBString& s) { if (0 > bssplitstrcb (b.m_s, (bstring) &s, streamSplitCb, (void *) this)) { bstringThrow ("Split bstream failure"); } } #endif #if defined(BSTRLIB_CAN_USE_IOSTREAM) std::ostream& operator << (std::ostream& sout, CBString b) { return sout.write ((const char *)b, b.length()); } #include static int istreamGets (void * parm) { char c = '\n'; ((std::istream *)parm)->get(c); if (isspace (c)) c = '\n'; return c; } std::istream& operator >> (std::istream& sin, CBString& b) { do { b.gets ((bNgetc) istreamGets, &sin, '\n'); if (b.slen > 0 && b.data[b.slen-1] == '\n') b.slen--; } while (b.slen == 0 && !sin.eof() && !sin.fail()); return sin; } struct sgetc { std::istream * sin; char terminator; }; static int istreamGetc (void * parm) { char c = ((struct sgetc *)parm)->terminator; ((struct sgetc *)parm)->sin->get(c); return c; } std::istream& getline (std::istream& sin, CBString& b, char terminator) { struct sgetc parm; parm.sin = &sin; parm.terminator = terminator; b.gets ((bNgetc) istreamGetc, &parm, terminator); if (b.slen > 0 && b.data[b.slen-1] == terminator) b.slen--; return sin; } #endif CBStream::CBStream (bNread readPtr, void * parm) { m_s = bsopen (readPtr, parm); } CBStream::~CBStream () { bsclose (m_s); } int CBStream::buffLengthSet (int sz) { if (sz <= 0) { bstringThrow ("buffLengthSet parameter failure"); } return bsbufflength (m_s, sz); } int CBStream::buffLengthGet () { return bsbufflength (m_s, 0); } CBString CBStream::readLine (char terminator) { CBString ret(""); if (0 > bsreadln ((bstring) &ret, m_s, terminator) && eof () < 0) { bstringThrow ("Failed readLine"); } return ret; } CBString CBStream::readLine (const CBString& terminator) { CBString ret(""); if (0 > bsreadlns ((bstring) &ret, m_s, (bstring) &terminator) && eof () < 0) { bstringThrow ("Failed readLine"); } return ret; } void CBStream::readLine (CBString& s, char terminator) { if (0 > bsreadln ((bstring) &s, m_s, terminator) && eof () < 0) { bstringThrow ("Failed readLine"); } } void CBStream::readLine (CBString& s, const CBString& terminator) { if (0 > bsreadlns ((bstring) &s, m_s, (bstring) &terminator) && eof () < 0) { bstringThrow ("Failed readLine"); } } void CBStream::readLineAppend (CBString& s, char terminator) { if (0 > bsreadlna ((bstring) &s, m_s, terminator) && eof () < 0) { bstringThrow ("Failed readLineAppend"); } } void CBStream::readLineAppend (CBString& s, const CBString& terminator) { if (0 > bsreadlnsa ((bstring) &s, m_s, (bstring) &terminator) && eof () < 0) { bstringThrow ("Failed readLineAppend"); } } #define BS_BUFF_SZ (1024) CBString CBStream::read () { CBString ret(""); while (!bseof (m_s)) { if (0 > bsreada ((bstring) &ret, m_s, BS_BUFF_SZ) && eof () < 0) { bstringThrow ("Failed read"); } } return ret; } CBString& CBStream::operator >> (CBString& s) { while (!bseof (m_s)) { if (0 > bsreada ((bstring) &s, m_s, BS_BUFF_SZ) && eof () < 0) { bstringThrow ("Failed read"); } } return s; } CBString CBStream::read (int n) { CBString ret(""); if (0 > bsread ((bstring) &ret, m_s, n) && eof () < 0) { bstringThrow ("Failed read"); } return ret; } void CBStream::read (CBString& s) { s.slen = 0; while (!bseof (m_s)) { if (0 > bsreada ((bstring) &s, m_s, BS_BUFF_SZ)) { bstringThrow ("Failed read"); } } } void CBStream::read (CBString& s, int n) { if (0 > bsread ((bstring) &s, m_s, n)) { bstringThrow ("Failed read"); } } void CBStream::readAppend (CBString& s) { while (!bseof (m_s)) { if (0 > bsreada ((bstring) &s, m_s, BS_BUFF_SZ)) { bstringThrow ("Failed readAppend"); } } } void CBStream::readAppend (CBString& s, int n) { if (0 > bsreada ((bstring) &s, m_s, n)) { bstringThrow ("Failed readAppend"); } } void CBStream::unread (const CBString& s) { if (0 > bsunread (m_s, (bstring) &s)) { bstringThrow ("Failed unread"); } } CBString CBStream::peek () const { CBString ret (""); if (0 > bspeek ((bstring) &ret, m_s)) { bstringThrow ("Failed peek"); } return ret; } void CBStream::peek (CBString& s) const { s.slen = 0; if (0 > bspeek ((bstring) &s, m_s)) { bstringThrow ("Failed peek"); } } void CBStream::peekAppend (CBString& s) const { if (0 > bspeek ((bstring) &s, m_s)) { bstringThrow ("Failed peekAppend"); } } int CBStream::eof () const { int ret = bseof (m_s); if (0 > ret) { bstringThrow ("Failed eof"); } return ret; } } // namespace Bstrlib UEFITool-A66/common/bstrlib/bstrwrap.h000066400000000000000000000341441442134156300177550ustar00rootroot00000000000000/* * This source file is part of the bstring string library. This code was * written by Paul Hsieh in 2002-2015, and is covered by the BSD open source * license and the GPL. Refer to the accompanying documentation for details * on usage and license. */ /* * bstrwrap.h * * This file is the C++ wrapper for the bstring functions. */ #ifndef BSTRWRAP_INCLUDE #define BSTRWRAP_INCLUDE /////////////////// Configuration defines ////////////////////////////// // WATCOM C/C++ has broken STL and std::iostream support. If you have // ported over STLport, then you can #define BSTRLIB_CAN_USE_STL to use // the CBStringList class. #if defined(__WATCOMC__) # if !defined (BSTRLIB_CAN_USE_STL) && !defined (BSTRLIB_CANNOT_USE_STL) # define BSTRLIB_CANNOT_USE_STL # endif # if !defined (BSTRLIB_CAN_USE_IOSTREAM) && !defined (BSTRLIB_CANNOT_USE_IOSTREAM) # define BSTRLIB_CANNOT_USE_IOSTREAM # endif #endif // By default it assumed that STL has been installed and works for your // compiler. If this is not the case, then #define BSTRLIB_CANNOT_USE_STL #if !defined (BSTRLIB_CANNOT_USE_STL) && !defined (BSTRLIB_CAN_USE_STL) #define BSTRLIB_CAN_USE_STL #endif // By default it assumed that std::iostream works well with your compiler. // If this is not the case, then #define BSTRLIB_CAN_USE_IOSTREAM #if !defined (BSTRLIB_CANNOT_USE_IOSTREAM) && !defined (BSTRLIB_CAN_USE_IOSTREAM) #define BSTRLIB_CAN_USE_IOSTREAM #endif // By default it is assumed that your compiler can deal with and has enabled // exception handlling. If this is not the case then you will need to // #define BSTRLIB_DOESNT_THROW_EXCEPTIONS #if !defined (BSTRLIB_THROWS_EXCEPTIONS) && !defined (BSTRLIB_DOESNT_THROW_EXCEPTIONS) #define BSTRLIB_THROWS_EXCEPTIONS #endif //////////////////////////////////////////////////////////////////////// #include #include "bstrlib.h" #include "../ubytearray.h" #include "../basetypes.h" #ifdef __cplusplus #if defined(BSTRLIB_CAN_USE_STL) #if defined(__WATCOMC__) #pragma warning 604 10 #pragma warning 595 10 #pragma warning 594 10 #pragma warning 549 10 #endif #include #include #if defined(__WATCOMC__) #pragma warning 604 9 #pragma warning 595 9 #pragma warning 594 9 #endif #endif namespace Bstrlib { #ifdef BSTRLIB_THROWS_EXCEPTIONS #if defined(BSTRLIB_CAN_USE_STL) struct CBStringException : public std::exception { private: std::string msg; public: CBStringException (const std::string inmsg) : msg(inmsg) {} virtual ~CBStringException () throw () {} virtual const char *what () const throw () { return msg.c_str(); } }; #else struct CBStringException { private: char * msg; int needToFree; public: CBStringException (const char * inmsg) : needToFree(0) { if (inmsg) { msg = (char *) malloc (1 + strlen (inmsg)); if (NULL == msg) msg = "Out of memory"; else { strcpy (msg, inmsg); needToFree = 1; } } else { msg = "NULL exception message"; } } virtual ~CBStringException () throw () { if (needToFree) { free (msg); needToFree = 0; msg = NULL; } } virtual const char *what () const throw () { return msg; } }; #endif #define bstringThrow(er) {\ CBStringException bstr__cppwrapper_exception ("CBString::" er "");\ throw bstr__cppwrapper_exception;\ } #else #define bstringThrow(er) {} #endif struct CBString; #ifdef _MSC_VER #pragma warning(disable:4512) #endif class CBCharWriteProtected { friend struct CBString; private: const struct tagbstring& s; unsigned int idx; CBCharWriteProtected (const struct tagbstring& c, int i) : s(c), idx((unsigned int)i) { if (idx >= (unsigned) s.slen) { bstringThrow ("character index out of bounds"); } } public: inline char operator = (char c) { if (s.mlen <= 0) { bstringThrow ("Write protection error"); } else { #ifndef BSTRLIB_THROWS_EXCEPTIONS if (idx >= (unsigned) s.slen) return '\0'; #endif s.data[idx] = (unsigned char) c; } return (char) s.data[idx]; } inline unsigned char operator = (unsigned char c) { if (s.mlen <= 0) { bstringThrow ("Write protection error"); } else { #ifndef BSTRLIB_THROWS_EXCEPTIONS if (idx >= (unsigned) s.slen) return '\0'; #endif s.data[idx] = c; } return s.data[idx]; } inline operator unsigned char () const { #ifndef BSTRLIB_THROWS_EXCEPTIONS if (idx >= (unsigned) s.slen) return (unsigned char) '\0'; #endif return s.data[idx]; } }; struct CBString : public tagbstring { // Constructors CBString (); CBString (char c); CBString (unsigned char c); CBString (const char *s); CBString (int len, const char *s); CBString (const CBString& b); CBString (const tagbstring& x); CBString (char c, int len); CBString (const void * blk, int len); #if defined(BSTRLIB_CAN_USE_STL) CBString (const struct CBStringList& l); CBString (const struct CBStringList& l, const CBString& sep); CBString (const struct CBStringList& l, char sep); CBString (const struct CBStringList& l, unsigned char sep); #endif // Destructor #if !defined(BSTRLIB_DONT_USE_VIRTUAL_DESTRUCTOR) virtual #endif ~CBString (); // = operator const CBString& operator = (char c); const CBString& operator = (unsigned char c); const CBString& operator = (const char *s); const CBString& operator = (const CBString& b); const CBString& operator = (const tagbstring& x); // += operator const CBString& operator += (char c); const CBString& operator += (unsigned char c); const CBString& operator += (const char *s); const CBString& operator += (const CBString& b); const CBString& operator += (const tagbstring& x); // *= operator inline const CBString& operator *= (int count) { this->repeat (count); return *this; } // + operator const CBString operator + (char c) const; const CBString operator + (unsigned char c) const; const CBString operator + (const unsigned char *s) const; const CBString operator + (const char *s) const; const CBString operator + (const CBString& b) const; const CBString operator + (const tagbstring& x) const; // * operator inline const CBString operator * (int count) const { CBString retval (*this); retval.repeat (count); return retval; } // Comparison operators bool operator == (const CBString& b) const; bool operator == (const char * s) const; bool operator == (const unsigned char * s) const; bool operator != (const CBString& b) const; bool operator != (const char * s) const; bool operator != (const unsigned char * s) const; bool operator < (const CBString& b) const; bool operator < (const char * s) const; bool operator < (const unsigned char * s) const; bool operator <= (const CBString& b) const; bool operator <= (const char * s) const; bool operator <= (const unsigned char * s) const; bool operator > (const CBString& b) const; bool operator > (const char * s) const; bool operator > (const unsigned char * s) const; bool operator >= (const CBString& b) const; bool operator >= (const char * s) const; bool operator >= (const unsigned char * s) const; // Casts inline operator const char* () const { return (const char *)data; } inline operator const unsigned char* () const { return (const unsigned char *)data; } operator double () const; operator float () const; operator int () const; operator unsigned int () const; // Accessors inline int length () const {return slen;} inline unsigned char character (int i) const { if (((unsigned) i) >= (unsigned) slen) { #ifdef BSTRLIB_THROWS_EXCEPTIONS bstringThrow ("character idx out of bounds"); #else return '\0'; #endif } return data[i]; } inline unsigned char operator [] (int i) const { return character(i); } inline CBCharWriteProtected character (int i) { return CBCharWriteProtected (*this, i); } inline CBCharWriteProtected operator [] (int i) { return character(i); } // Space allocation hint method. void alloc (int length); // Search methods. int caselessEqual (const CBString& b) const; int caselessCmp (const CBString& b) const; int find (const CBString& b, int pos = 0) const; int find (const char * b, int pos = 0) const; int caselessfind (const CBString& b, int pos = 0) const; int caselessfind (const char * b, int pos = 0) const; int find (char c, int pos = 0) const; int reversefind (const CBString& b, int pos) const; int reversefind (const char * b, int pos) const; int caselessreversefind (const CBString& b, int pos) const; int caselessreversefind (const char * b, int pos) const; int reversefind (char c, int pos) const; int findchr (const CBString& b, int pos = 0) const; int findchr (const char * s, int pos = 0) const; int reversefindchr (const CBString& b, int pos) const; int reversefindchr (const char * s, int pos) const; int nfindchr (const CBString& b, int pos = 0) const; int nfindchr (const char * b, int pos = 0) const; int nreversefindchr (const CBString& b, int pos) const; int nreversefindchr (const char * b, int pos) const; // Search and substitute methods. void findreplace (const CBString& find, const CBString& repl, int pos = 0); void findreplace (const CBString& find, const char * repl, int pos = 0); void findreplace (const char * find, const CBString& repl, int pos = 0); void findreplace (const char * find, const char * repl, int pos = 0); void findreplacecaseless (const CBString& find, const CBString& repl, int pos = 0); void findreplacecaseless (const CBString& find, const char * repl, int pos = 0); void findreplacecaseless (const char * find, const CBString& repl, int pos = 0); void findreplacecaseless (const char * find, const char * repl, int pos = 0); // Extraction method. CBString midstr (int left, int len) const; // Standard manipulation methods. void setsubstr (int pos, const CBString& b, unsigned char fill = ' '); void setsubstr (int pos, const char * b, unsigned char fill = ' '); void insert (int pos, const CBString& b, unsigned char fill = ' '); void insert (int pos, const char * b, unsigned char fill = ' '); void insertchrs (int pos, int len, unsigned char fill = ' '); void replace (int pos, int len, const CBString& b, unsigned char fill = ' '); void replace (int pos, int len, const char * s, unsigned char fill = ' '); void remove (int pos, int len); void trunc (int len); // Miscellaneous methods. void format (const char * fmt, ...) ATTRIBUTE_FORMAT_(printf, 2, 3); void formata (const char * fmt, ...) ATTRIBUTE_FORMAT_(printf, 2, 3); void fill (int length, unsigned char fill = ' '); void repeat (int count); void ltrim (const CBString& b = CBString (bsStaticBlkParms (" \t\v\f\r\n"))); void rtrim (const CBString& b = CBString (bsStaticBlkParms (" \t\v\f\r\n"))); inline void trim (const CBString& b = CBString (bsStaticBlkParms (" \t\v\f\r\n"))) { rtrim (b); ltrim (b); } void toupper (); void tolower (); // Write protection methods. void writeprotect (); void writeallow (); inline bool iswriteprotected () const { return mlen <= 0; } // Join methods. #if defined(BSTRLIB_CAN_USE_STL) void join (const struct CBStringList& l); void join (const struct CBStringList& l, const CBString& sep); void join (const struct CBStringList& l, char sep); void join (const struct CBStringList& l, unsigned char sep); #endif // CBStream methods int gets (bNgetc getcPtr, void * parm, char terminator = '\n'); int read (bNread readPtr, void * parm); // QString compatibility methods const char *toLocal8Bit() const { return *this; } bool contains(const char *str) { return find(str) >= 0; } bool startsWith(const char *str) { return find(str) == 0; } bool endsWith(const char *str) { int len = strlen(str); return (slen >= len && (find(str, slen - len) == (slen - len))); } bool isEmpty() const { return slen == 0; } void clear() { *this = ""; } CBString left(int len) const { return midstr(0, len); } CBString mid(int pos, int len) const { return midstr(pos, len); } CBString chopped(int len) const { return midstr(slen - len, len); } void chop(int len) { trunc(((slen > len) ? slen - len : 0)); } CBString leftJustified(int length) { if (length > slen) { return *this + CBString(' ', length - slen); } return *this; } }; extern const CBString operator + (const char *a, const CBString& b); extern const CBString operator + (const unsigned char *a, const CBString& b); extern const CBString operator + (char c, const CBString& b); extern const CBString operator + (unsigned char c, const CBString& b); extern const CBString operator + (const tagbstring& x, const CBString& b); inline const CBString operator * (int count, const CBString& b) { CBString retval (b); retval.repeat (count); return retval; } #if defined(BSTRLIB_CAN_USE_IOSTREAM) extern std::ostream& operator << (std::ostream& sout, CBString b); extern std::istream& operator >> (std::istream& sin, CBString& b); extern std::istream& getline (std::istream& sin, CBString& b, char terminator='\n'); #endif struct CBStream { friend struct CBStringList; private: struct bStream * m_s; public: CBStream (bNread readPtr, void * parm); ~CBStream (); int buffLengthSet (int sz); int buffLengthGet (); int eof () const; CBString readLine (char terminator); CBString readLine (const CBString& terminator); void readLine (CBString& s, char terminator); void readLine (CBString& s, const CBString& terminator); void readLineAppend (CBString& s, char terminator); void readLineAppend (CBString& s, const CBString& terminator); CBString read (); CBString& operator >> (CBString& s); CBString read (int n); void read (CBString& s); void read (CBString& s, int n); void readAppend (CBString& s); void readAppend (CBString& s, int n); void unread (const CBString& s); inline CBStream& operator << (const CBString& s) { this->unread (s); return *this; } CBString peek () const; void peek (CBString& s) const; void peekAppend (CBString& s) const; }; #if defined(BSTRLIB_CAN_USE_STL) struct CBStringList : public std::vector { // split a string into a vector of strings. void split (const CBString& b, unsigned char splitChar); void split (const CBString& b, const CBString& s); void splitstr (const CBString& b, const CBString& s); void split (const CBStream& b, unsigned char splitChar); void split (const CBStream& b, const CBString& s); void splitstr (const CBStream& b, const CBString& s); }; #endif } // namespace Bstrlib #if !defined (BSTRLIB_DONT_ASSUME_NAMESPACE) using namespace Bstrlib; #endif #endif #endif UEFITool-A66/common/descriptor.cpp000066400000000000000000000274401442134156300171620ustar00rootroot00000000000000/* descriptor.cpp Copyright (c) 2015, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHWARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "descriptor.h" // Calculate address of data structure addressed by descriptor address format // 8 bit base or limit const UINT8* calculateAddress8(const UINT8* baseAddress, const UINT8 baseOrLimit) { return baseAddress + baseOrLimit * 0x10; } // 16 bit base or limit const UINT8* calculateAddress16(const UINT8* baseAddress, const UINT16 baseOrLimit) { return baseAddress + baseOrLimit * 0x1000; } // Calculate offset of region using its base UINT32 calculateRegionOffset(const UINT16 base) { return base * 0x1000; } //Calculate size of region using its base and limit UINT32 calculateRegionSize(const UINT16 base, const UINT16 limit) { if (limit) return (limit + 1 - base) * 0x1000; return 0; } // Return human-readable chip name for given JEDEC ID UString jedecIdToUString(UINT8 vendorId, UINT8 deviceId0, UINT8 deviceId1) { UINT32 jedecId = (UINT32)deviceId1 + ((UINT32)deviceId0 << 8) + ((UINT32)vendorId << 16); switch (jedecId) { // Winbond case 0xEF3010: return UString("Winbond W25X05"); case 0xEF3011: return UString("Winbond W25X10"); case 0xEF3012: return UString("Winbond W25X20"); case 0xEF3013: return UString("Winbond W25X40"); case 0xEF3014: return UString("Winbond W25X80"); case 0xEF3015: return UString("Winbond W25X16"); case 0xEF3016: return UString("Winbond W25X32"); case 0xEF3017: return UString("Winbond W25X64"); case 0xEF4012: return UString("Winbond W25Q20"); case 0xEF4013: return UString("Winbond W25Q40"); case 0xEF4014: return UString("Winbond W25Q80"); case 0xEF4015: return UString("Winbond W25Q16"); case 0xEF4016: return UString("Winbond W25Q32"); case 0xEF4017: return UString("Winbond W25Q64"); case 0xEF4018: return UString("Winbond W25Q128"); case 0xEF4019: return UString("Winbond W25Q256"); case 0xEF6011: return UString("Winbond W25Q10"); case 0xEF6012: return UString("Winbond W25Q20"); case 0xEF6013: return UString("Winbond W25Q40"); case 0xEF6014: return UString("Winbond W25Q80"); case 0xEF6015: return UString("Winbond W25Q16"); case 0xEF6016: return UString("Winbond W25Q32"); case 0xEF6017: return UString("Winbond W25Q64"); case 0xEF6018: return UString("Winbond W25Q128"); case 0xEF6019: return UString("Winbond W25Q256"); case 0xEF7118: return UString("Winbond W25M256"); case 0xEF7119: return UString("Winbond W25M512"); // Macronix case 0xC22013: return UString("Macronix MX25L40"); case 0xC22014: return UString("Macronix MX25L80"); case 0xC22015: return UString("Macronix MX25L16"); case 0xC22016: return UString("Macronix MX25U16"); case 0xC22017: return UString("Macronix MX25L64"); case 0xC22018: return UString("Macronix MX25L128"); case 0xC22019: return UString("Macronix MX25L256"); case 0xC2201A: return UString("Macronix MX66L512"); case 0xC22415: return UString("Macronix MX25L16"); case 0xC22515: return UString("Macronix MX25L16"); case 0xC22534: return UString("Macronix MX25U80"); case 0xC22535: return UString("Macronix MX25U16"); case 0xC22536: return UString("Macronix MX25U32"); case 0xC22537: return UString("Macronix MX25U64"); case 0xC22538: return UString("Macronix MX25U128"); case 0xC22539: return UString("Macronix MX25U256"); case 0xC2253A: return UString("Macronix MX25U512"); case 0xC22617: return UString("Macronix MX25L64"); case 0xC22618: return UString("Macronix MX25L128"); case 0xC25E16: return UString("Macronix MX25L32"); case 0xC29517: return UString("Macronix MX25L64"); // Micron case 0x202014: return UString("Micron M25P80"); case 0x202015: return UString("Micron M25P16"); case 0x202016: return UString("Micron M25P32"); case 0x202017: return UString("Micron M25P64"); case 0x202018: return UString("Micron M25P128"); case 0x204011: return UString("Micron M45PE10"); case 0x204012: return UString("Micron M45PE20"); case 0x204013: return UString("Micron M45PE40"); case 0x204014: return UString("Micron M45PE80"); case 0x204015: return UString("Micron M45PE16"); case 0x204017: return UString("Micron XM25QH64C"); case 0x204018: return UString("Micron XM25QH128C"); case 0x204019: return UString("Micron XM25QH256C"); case 0x207114: return UString("Micron M25PX80"); case 0x207115: return UString("Micron M25PX16"); case 0x207116: return UString("Micron M25PX32"); case 0x207117: return UString("Micron M25PX64"); case 0x208011: return UString("Micron M25PE10"); case 0x208012: return UString("Micron M25PE20"); case 0x208013: return UString("Micron M25PE40"); case 0x208014: return UString("Micron M25PE80"); case 0x208015: return UString("Micron M25PE16"); case 0x20BA15: return UString("Micron N25Q016"); case 0x20BA16: return UString("Micron N25Q032"); case 0x20BA17: return UString("Micron N25Q064"); case 0x20BA18: return UString("Micron N25Q128"); case 0x20BA19: return UString("Micron N25Q256"); case 0x20BA20: return UString("Micron N25Q512"); case 0x20BA21: return UString("Micron N25Q00A"); case 0x20BB15: return UString("Micron N25Q016"); case 0x20BB16: return UString("Micron N25Q032"); case 0x20BB17: return UString("Micron N25Q064"); case 0x20BB18: return UString("Micron MT25Q128"); case 0x20BB19: return UString("Micron MT25Q256"); case 0x20BB20: return UString("Micron MT25Q512"); // Intel case 0x898911: return UString("Intel 25F160S33B8"); case 0x898912: return UString("Intel 25F320S33B8"); case 0x898913: return UString("Intel 25F640S33B8"); case 0x898915: return UString("Intel 25F160S33T8"); case 0x898916: return UString("Intel 25F320S33T8"); case 0x898917: return UString("Intel 25F640S33T8"); // Atmel / Adesto case 0x1F3217: return UString("Atmel AT25SF641"); case 0x1F4216: return UString("Atmel AT25SL321"); case 0x1F4218: return UString("Atmel AT25SL128A"); case 0x1F4317: return UString("Atmel AT25SL641"); case 0x1F4500: return UString("Atmel AT26DF081"); case 0x1F4501: return UString("Atmel AT26DF081A"); case 0x1F4502: return UString("Atmel AT25DF081"); case 0x1F4600: return UString("Atmel AT26DF161"); case 0x1F4601: return UString("Atmel AT26DF161A"); case 0x1F4602: return UString("Atmel AT25DF161"); case 0x1F4700: return UString("Atmel AT25DF321"); case 0x1F4701: return UString("Atmel AT25DF321A"); case 0x1F4800: return UString("Atmel AT25DF641"); case 0x1F7018: return UString("Atmel AT25QF128"); case 0x1F8600: return UString("Atmel AT25DQ161"); case 0x1F8800: return UString("Atmel AT25DQ641"); // Microchip case 0xBF2541: return UString("Microchip SST25VF016B"); case 0xBF254A: return UString("Microchip SST25VF032B"); case 0xBF258D: return UString("Microchip SST25VF040B"); case 0xBF258E: return UString("Microchip SST25VF080B"); case 0xBF254B: return UString("Microchip SST25VF064C"); // EON / ESMT case 0x1C3013: return UString("EON EN25Q40"); case 0x1C3014: return UString("EON EN25Q80"); case 0x1C3015: return UString("EON EN25Q16"); case 0x1C3016: return UString("EON EN25Q32"); case 0x1C3017: return UString("EON EN25Q64"); case 0x1C3018: return UString("EON EN25Q128"); case 0x1C3114: return UString("EON EN25F80"); case 0x1C3115: return UString("EON EN25F16"); case 0x1C3116: return UString("EON EN25F32"); case 0x1C3117: return UString("EON EN25F64"); case 0x1C3811: return UString("EON EN25S10"); case 0x1C3812: return UString("EON EN25S20"); case 0x1C3813: return UString("EON EN25S40"); case 0x1C3814: return UString("EON EN25S80"); case 0x1C3815: return UString("EON EN25S16"); case 0x1C3816: return UString("EON EN25S32"); case 0x1C3817: return UString("EON EN25S64"); case 0x1C7014: return UString("EON EN25QH80"); case 0x1C7015: return UString("EON EN25QH16"); case 0x1C7016: return UString("EON EN25QH32"); case 0x1C7017: return UString("EON EN25QH64"); case 0x1C7018: return UString("EON EN25QH128"); case 0x1C7019: return UString("EON EN25QH256"); // GigaDevice case 0xC84014: return UString("GigaDevice GD25x80"); case 0xC84015: return UString("GigaDevice GD25x16"); case 0xC84016: return UString("GigaDevice GD25x32"); case 0xC84017: return UString("GigaDevice GD25x64"); case 0xC84018: return UString("GigaDevice GD25x128"); case 0xC84019: return UString("GigaDevice GD25x256C"); case 0xC86015: return UString("GigaDevice GD25LQ16V"); case 0xC86017: return UString("GigaDevice GD25Lx64"); case 0xC86018: return UString("GigaDevice GD25Lx128"); case 0xC86019: return UString("GigaDevice GD25LQ256C"); // Fidelix case 0xF83215: return UString("Fidelix FM25Q16"); case 0xF83216: return UString("Fidelix FM25Q32"); case 0xF83217: return UString("Fidelix FM25Q64"); case 0xF83218: return UString("Fidelix FM25Q128"); // Spansion case 0x014015: return UString("Spansion S25FL116K"); case 0x014016: return UString("Spansion S25FL132K"); case 0x014017: return UString("Spansion S25FL164K"); // AMIC Technology case 0x373015: return UString("AMIC A25L016"); case 0x373016: return UString("AMIC A25L032"); case 0x374015: return UString("AMIC A25LQ16"); case 0x374016: return UString("AMIC A25LQ32A"); // PMC case 0x9DF713: return UString("PMC Pm25LV080B"); case 0x9DF714: return UString("PMC Pm25LV016B"); case 0x9DF744: return UString("PMC Pm25LQ080C"); case 0x9DF745: return UString("PMC Pm25LQ016C"); case 0x9DF746: return UString("PMC Pm25LQ032C"); case 0x9DF77B: return UString("PMC Pm25LV512A"); case 0x9DF77C: return UString("PMC Pm25LV010A"); case 0x9DF77D: return UString("PMC Pm25LV020"); case 0x9DF77E: return UString("PMC Pm25LV040"); // ISSI case 0x9D6014: return UString("ISSI Ix25LP080"); case 0x9D6015: return UString("ISSI Ix25LP016"); case 0x9D6016: return UString("ISSI Ix25LP032"); case 0x9D6017: return UString("ISSI Ix25LP064"); case 0x9D6018: return UString("ISSI Ix25LP128"); case 0x9D6019: return UString("ISSI Ix25LP256"); case 0x9D7014: return UString("ISSI Ix25WP080"); case 0x9D7015: return UString("ISSI Ix25WP016"); case 0x9D7016: return UString("ISSI Ix25WP032"); case 0x9D7017: return UString("ISSI Ix25WP064"); case 0x9D7018: return UString("ISSI Ix25WP128"); case 0x9D7019: return UString("ISSI Ix25WP256"); } return usprintf("Unknown %08Xh", jedecId); } UEFITool-A66/common/descriptor.h000066400000000000000000000210041442134156300166150ustar00rootroot00000000000000/* descriptor.h Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHWARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef DESCRIPTOR_H #define DESCRIPTOR_H #include "basetypes.h" #include "ustring.h" #include "ubytearray.h" // Make sure we use right packing rules #pragma pack(push,1) // Flash descriptor header typedef struct FLASH_DESCRIPTOR_HEADER_ { UINT8 ReservedVector[16]; // Reserved for ARM ResetVector, 0xFFs on x86/x86-64 machines UINT32 Signature; // 0x0FF0A55A } FLASH_DESCRIPTOR_HEADER; // Flash descriptor signature #define FLASH_DESCRIPTOR_SIGNATURE 0x0FF0A55A // Descriptor region size #define FLASH_DESCRIPTOR_SIZE 0x1000 // Maximum base value in descriptor map #define FLASH_DESCRIPTOR_MAX_BASE 0xE0 // Descriptor version was reserved in older firmware #define FLASH_DESCRIPTOR_VERSION_INVALID 0xFFFFFFFF // The only known version found in Coffee Lake #define FLASH_DESCRIPTOR_VERSION_MAJOR 1 #define FLASH_DESCRIPTOR_VERSION_MINOR 0 // Descriptor version present in Coffee Lake and newer typedef struct _FLASH_DESCRIPTOR_VERSION { UINT32 Reserved : 14; UINT32 Minor : 7; UINT32 Major : 11; } FLASH_DESCRIPTOR_VERSION; // Descriptor map // Base fields are storing bits [11:4] of actual base addresses, all other bits are 0 typedef struct FLASH_DESCRIPTOR_MAP_ { // FLMAP0 UINT32 ComponentBase : 8; UINT32 NumberOfFlashChips : 2; // Zero-based number of flash chips installed on board UINT32 : 6; UINT32 RegionBase : 8; UINT32 NumberOfRegions : 3; // Reserved in v2 descriptor UINT32 : 5; // FLMAP 1 UINT32 MasterBase : 8; UINT32 NumberOfMasters : 2; // Zero-based number of flash masters UINT32 : 6; UINT32 PchStrapsBase : 8; UINT32 NumberOfPchStraps : 8; // One-based number of UINT32s to read as PCH straps, min=0, max=255 (1 Kb) // FLMAP 2 UINT32 ProcStrapsBase : 8; UINT32 NumberOfProcStraps : 8; // One-based number of UINT32s to read as processor straps, min=0, max=255 (1 Kb) UINT32 : 16; // FLMAP 3 UINT32 DescriptorVersion; // Reserved prior to Coffee Lake } FLASH_DESCRIPTOR_MAP; // Component section // Flash parameters DWORD structure typedef struct FLASH_PARAMETERS_ { UINT8 FirstChipDensity : 4; UINT8 SecondChipDensity : 4; UINT8 : 8; UINT8 : 1; UINT8 ReadClockFrequency : 3; // Hardcoded value of 20 Mhz (000b) in v1 descriptors UINT8 FastReadEnabled : 1; UINT8 FastReadFrequency : 3; UINT8 FlashWriteFrequency : 3; UINT8 FlashReadStatusFrequency : 3; UINT8 DualOutputFastReadSupported : 1; UINT8 : 1; } FLASH_PARAMETERS; // Flash densities #define FLASH_DENSITY_512KB 0x00 #define FLASH_DENSITY_1MB 0x01 #define FLASH_DENSITY_2MB 0x02 #define FLASH_DENSITY_4MB 0x03 #define FLASH_DENSITY_8MB 0x04 #define FLASH_DENSITY_16MB 0x05 #define FLASH_DENSITY_32MB 0x06 #define FLASH_DENSITY_64MB 0x07 #define FLASH_DENSITY_UNUSED 0x0F // Flash frequencies #define FLASH_FREQUENCY_20MHZ 0x00 #define FLASH_FREQUENCY_33MHZ 0x01 #define FLASH_FREQUENCY_48MHZ 0x02 #define FLASH_FREQUENCY_50MHZ_30MHZ 0x04 #define FLASH_FREQUENCY_17MHZ 0x06 // Component section structure typedef struct FLASH_DESCRIPTOR_COMPONENT_SECTION_ { FLASH_PARAMETERS FlashParameters; UINT8 InvalidInstruction0; // Instructions for SPI chip, that must not be executed, like FLASH ERASE UINT8 InvalidInstruction1; // UINT8 InvalidInstruction2; // UINT8 InvalidInstruction3; // UINT16 PartitionBoundary; // Upper 16 bit of partition boundary address. Default is 0x0000, which makes the boundary to be 0x00001000 UINT16 : 16; } FLASH_DESCRIPTOR_COMPONENT_SECTION; // Region section // All base and limit register are storing upper part of actual UINT32 base and limit // If limit is zero - region is not present typedef struct FLASH_DESCRIPTOR_REGION_SECTION_ { UINT16 DescriptorBase; // Descriptor UINT16 DescriptorLimit; // UINT16 BiosBase; // BIOS UINT16 BiosLimit; // UINT16 MeBase; // Management Engine UINT16 MeLimit; // UINT16 GbeBase; // Gigabit Ethernet UINT16 GbeLimit; // UINT16 PdrBase; // Platform Data UINT16 PdrLimit; // UINT16 DevExp1Base; // Device Expansion 1 UINT16 DevExp1Limit; // UINT16 Bios2Base; // Secondary BIOS UINT16 Bios2Limit; // UINT16 MicrocodeBase; // CPU microcode UINT16 MicrocodeLimit; // UINT16 EcBase; // Embedded Controller UINT16 EcLimit; // UINT16 DevExp2Base; // Device Expansion 2 UINT16 DevExp2Limit; // UINT16 IeBase; // Innovation Engine UINT16 IeLimit; // UINT16 Tgbe1Base; // 10 Gigabit Ethernet 1 UINT16 Tgbe1Limit; // UINT16 Tgbe2Base; // 10 Gigabit Ethernet 2 UINT16 Tgbe2Limit; // UINT16 Reserved1Base; // Reserved 1 UINT16 Reserved1Limit; // UINT16 Reserved2Base; // Reserved 2 UINT16 Reserved2Limit; // UINT16 PttBase; // Platform Trust Technology UINT16 PttLimit; // } FLASH_DESCRIPTOR_REGION_SECTION; // Master section typedef struct FLASH_DESCRIPTOR_MASTER_SECTION_ { UINT16 BiosId; UINT8 BiosRead; UINT8 BiosWrite; UINT16 MeId; UINT8 MeRead; UINT8 MeWrite; UINT16 GbeId; UINT8 GbeRead; UINT8 GbeWrite; } FLASH_DESCRIPTOR_MASTER_SECTION; // Master section v2 (Skylake+) typedef struct FLASH_DESCRIPTOR_MASTER_SECTION_V2_ { UINT32 : 8; UINT32 BiosRead : 12; UINT32 BiosWrite : 12; UINT32 : 8; UINT32 MeRead : 12; UINT32 MeWrite : 12; UINT32 : 8; UINT32 GbeRead : 12; UINT32 GbeWrite : 12; UINT32 : 32; UINT32 : 8; UINT32 EcRead : 12; UINT32 EcWrite : 12; } FLASH_DESCRIPTOR_MASTER_SECTION_V2; // Region access bits in master section #define FLASH_DESCRIPTOR_REGION_ACCESS_DESC 0x01 #define FLASH_DESCRIPTOR_REGION_ACCESS_BIOS 0x02 #define FLASH_DESCRIPTOR_REGION_ACCESS_ME 0x04 #define FLASH_DESCRIPTOR_REGION_ACCESS_GBE 0x08 #define FLASH_DESCRIPTOR_REGION_ACCESS_PDR 0x10 #define FLASH_DESCRIPTOR_REGION_ACCESS_EC 0x20 // Base address of descriptor upper map #define FLASH_DESCRIPTOR_UPPER_MAP_BASE 0x0EFC // Descriptor upper map structure typedef struct FLASH_DESCRIPTOR_UPPER_MAP_ { UINT8 VsccTableBase; // Base address of VSCC Table for ME, bits [11:4] UINT8 VsccTableSize; // Counted in UINT32s UINT16 ReservedZero; // Still unknown, zero in all descriptors I have seen } FLASH_DESCRIPTOR_UPPER_MAP; // VSCC table entry structure typedef struct VSCC_TABLE_ENTRY_ { UINT8 VendorId; // JEDEC VendorID byte UINT8 DeviceId0; // JEDEC DeviceID first byte UINT8 DeviceId1; // JEDEC DeviceID second byte UINT8 ReservedZero; // Reserved, must be zero UINT32 VsccRegisterValue; // VSCC register value } VSCC_TABLE_ENTRY; // Base address and size of OEM section #define FLASH_DESCRIPTOR_OEM_SECTION_BASE 0x0F00 #define FLASH_DESCRIPTOR_OEM_SECTION_SIZE 0x100 // Restore previous packing rules #pragma pack(pop) // Calculate address of data structure addressed by descriptor address format // 8 bit base or limit extern const UINT8* calculateAddress8(const UINT8* baseAddress, const UINT8 baseOrLimit); // 16 bit base or limit extern const UINT8* calculateAddress16(const UINT8* baseAddress, const UINT16 baseOrLimit); // Calculate offset of region using it's base extern UINT32 calculateRegionOffset(const UINT16 base); // Calculate size of region using it's base and limit extern UINT32 calculateRegionSize(const UINT16 base, const UINT16 limit); // Return human-readable chip name for given JEDEC ID extern UString jedecIdToUString(UINT8 vendorId, UINT8 deviceId0, UINT8 deviceId1); #endif // DESCRIPTOR_H UEFITool-A66/common/digest/000077500000000000000000000000001442134156300155505ustar00rootroot00000000000000UEFITool-A66/common/digest/sha1.c000066400000000000000000000151311442134156300165510ustar00rootroot00000000000000/* sha1.c Copyright (c) 2022, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ // // This implementations are based on LibTomCrypt that was released into // public domain by Tom St Denis. // #include "sha1.h" #include #include /* ulong64: 64-bit data type */ #ifdef _MSC_VER #define CONST64(n) n ## ui64 typedef unsigned __int64 ulong64; #else #define CONST64(n) n ## ULL typedef uint64_t ulong64; #endif typedef uint32_t ulong32; #define LOAD32H(x, y) \ do { x = ((ulong32)((y)[0] & 255)<<24) | \ ((ulong32)((y)[1] & 255)<<16) | \ ((ulong32)((y)[2] & 255)<<8) | \ ((ulong32)((y)[3] & 255)); } while(0) #ifndef MIN #define MIN(x, y) (((x) < (y)) ? (x) : (y)) #endif #define ROL(x, y) ( (((ulong32)(x)<<(ulong32)((y)&31)) | (((ulong32)(x)&0xFFFFFFFFUL)>>(ulong32)((32-((y)&31))&31))) & 0xFFFFFFFFUL) #define ROLc(x, y) ( (((ulong32)(x)<<(ulong32)((y)&31)) | (((ulong32)(x)&0xFFFFFFFFUL)>>(ulong32)((32-((y)&31))&31))) & 0xFFFFFFFFUL) #define STORE32H(x, y) \ do { (y)[0] = (unsigned char)(((x)>>24)&255); (y)[1] = (unsigned char)(((x)>>16)&255); \ (y)[2] = (unsigned char)(((x)>>8)&255); (y)[3] = (unsigned char)((x)&255); } while(0) #define STORE64H(x, y) \ do { (y)[0] = (unsigned char)(((x)>>56)&255); (y)[1] = (unsigned char)(((x)>>48)&255); \ (y)[2] = (unsigned char)(((x)>>40)&255); (y)[3] = (unsigned char)(((x)>>32)&255); \ (y)[4] = (unsigned char)(((x)>>24)&255); (y)[5] = (unsigned char)(((x)>>16)&255); \ (y)[6] = (unsigned char)(((x)>>8)&255); (y)[7] = (unsigned char)((x)&255); } while(0) #define F0(x,y,z) (z ^ (x & (y ^ z))) #define F1(x,y,z) (x ^ y ^ z) #define F2(x,y,z) ((x & y) | (z & (x | y))) #define F3(x,y,z) (x ^ y ^ z) struct sha1_state { ulong64 length; ulong32 state[5], curlen; unsigned char buf[64]; }; static int s_sha1_compress(struct sha1_state *md, const unsigned char *buf) { ulong32 a,b,c,d,e,W[80],i; ulong32 t; /* copy the state into 512-bits into W[0..15] */ for (i = 0; i < 16; i++) { LOAD32H(W[i], buf + (4*i)); } /* copy state */ a = md->state[0]; b = md->state[1]; c = md->state[2]; d = md->state[3]; e = md->state[4]; /* expand it */ for (i = 16; i < 80; i++) { W[i] = ROL(W[i-3] ^ W[i-8] ^ W[i-14] ^ W[i-16], 1); } /* compress */ /* round one */ #define FF0(a,b,c,d,e,i) e = (ROLc(a, 5) + F0(b,c,d) + e + W[i] + 0x5a827999UL); b = ROLc(b, 30); #define FF1(a,b,c,d,e,i) e = (ROLc(a, 5) + F1(b,c,d) + e + W[i] + 0x6ed9eba1UL); b = ROLc(b, 30); #define FF2(a,b,c,d,e,i) e = (ROLc(a, 5) + F2(b,c,d) + e + W[i] + 0x8f1bbcdcUL); b = ROLc(b, 30); #define FF3(a,b,c,d,e,i) e = (ROLc(a, 5) + F3(b,c,d) + e + W[i] + 0xca62c1d6UL); b = ROLc(b, 30); for (i = 0; i < 20; ) { FF0(a,b,c,d,e,i++); t = e; e = d; d = c; c = b; b = a; a = t; } for (; i < 40; ) { FF1(a,b,c,d,e,i++); t = e; e = d; d = c; c = b; b = a; a = t; } for (; i < 60; ) { FF2(a,b,c,d,e,i++); t = e; e = d; d = c; c = b; b = a; a = t; } for (; i < 80; ) { FF3(a,b,c,d,e,i++); t = e; e = d; d = c; c = b; b = a; a = t; } #undef FF0 #undef FF1 #undef FF2 #undef FF3 /* store */ md->state[0] = md->state[0] + a; md->state[1] = md->state[1] + b; md->state[2] = md->state[2] + c; md->state[3] = md->state[3] + d; md->state[4] = md->state[4] + e; return 0; } static int sha1_init(struct sha1_state * md) { if (md == NULL) return -1; md->state[0] = 0x67452301UL; md->state[1] = 0xefcdab89UL; md->state[2] = 0x98badcfeUL; md->state[3] = 0x10325476UL; md->state[4] = 0xc3d2e1f0UL; md->curlen = 0; md->length = 0; return 0; } static int sha1_process(struct sha1_state * md, const unsigned char *in, unsigned long inlen) { unsigned long n; int err; if (md == NULL) return -1; if (in == NULL) return -1; if (md->curlen > sizeof(md->buf)) { return -1; } if (((md->length + inlen * 8) < md->length) || ((inlen * 8) < inlen)) { return -1; } while (inlen > 0) { if (md->curlen == 0 && inlen >= 64) { if ((err = s_sha1_compress(md, in)) != 0) { return err; } md->length += 64 * 8; in += 64; inlen -= 64; } else { n = MIN(inlen, (64 - md->curlen)); memcpy(md->buf + md->curlen, in, (size_t)n); md->curlen += n; in += n; inlen -= n; if (md->curlen == 64) { if ((err = s_sha1_compress(md, md->buf)) != 0) { return err; } md->length += 8 * 64; md->curlen = 0; } } } return 0; } static int sha1_done(struct sha1_state * md, unsigned char *out) { int i; if (md == NULL) return -1; if (out == NULL) return -1; if (md->curlen >= sizeof(md->buf)) { return -1; } /* increase the length of the message */ md->length += md->curlen * 8; /* append the '1' bit */ md->buf[md->curlen++] = (unsigned char)0x80; /* if the length is currently above 56 bytes we append zeros * then compress. Then we can fall back to padding zeros and length * encoding like normal. */ if (md->curlen > 56) { while (md->curlen < 64) { md->buf[md->curlen++] = (unsigned char)0; } s_sha1_compress(md, md->buf); md->curlen = 0; } /* pad upto 56 bytes of zeroes */ while (md->curlen < 56) { md->buf[md->curlen++] = (unsigned char)0; } /* store length */ STORE64H(md->length, md->buf+56); s_sha1_compress(md, md->buf); /* copy output */ for (i = 0; i < 5; i++) { STORE32H(md->state[i], out+(4*i)); } return 0; } void sha1(const void *in, unsigned long inlen, void* out) { struct sha1_state ctx; sha1_init(&ctx); sha1_process(&ctx, (const unsigned char*)in, inlen); sha1_done(&ctx, (unsigned char *)out); } UEFITool-A66/common/digest/sha1.h000066400000000000000000000012151442134156300165540ustar00rootroot00000000000000/* sha1.h Copyright (c) 2022, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef SHA1_H #define SHA1_H #ifdef __cplusplus extern "C" { #endif void sha1(const void *in, unsigned long inlen, void* out); #ifdef __cplusplus } #endif #endif // SHA2_H UEFITool-A66/common/digest/sha2.h000066400000000000000000000014111442134156300165530ustar00rootroot00000000000000/* sha2.h Copyright (c) 2017, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef SHA2_H #define SHA2_H #ifdef __cplusplus extern "C" { #endif void sha256(const void *in, unsigned long inlen, void* out); void sha384(const void *in, unsigned long inlen, void* out); void sha512(const void *in, unsigned long inlen, void* out); #ifdef __cplusplus } #endif #endif // SHA2_H UEFITool-A66/common/digest/sha256.c000066400000000000000000000242431442134156300167310ustar00rootroot00000000000000/* sha256.c Copyright (c) 2017, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ // // This implementations are based on LibTomCrypt that was released into // public domain by Tom St Denis. // #include "sha2.h" #include #include /* ulong64: 64-bit data type */ #ifdef _MSC_VER #define CONST64(n) n ## ui64 typedef unsigned __int64 ulong64; #else #define CONST64(n) n ## ULL typedef uint64_t ulong64; #endif typedef uint32_t ulong32; #define LOAD32H(x, y) \ do { x = ((ulong32)((y)[0] & 255)<<24) | \ ((ulong32)((y)[1] & 255)<<16) | \ ((ulong32)((y)[2] & 255)<<8) | \ ((ulong32)((y)[3] & 255)); } while(0) #ifndef MIN #define MIN(x, y) (((x) < (y)) ? (x) : (y)) #endif #define RORc(x, y) ( ((((ulong32)(x)&0xFFFFFFFFUL)>>(ulong32)((y)&31)) | ((ulong32)(x)<<(ulong32)((32-((y)&31))&31))) & 0xFFFFFFFFUL) #define STORE32H(x, y) \ do { (y)[0] = (unsigned char)(((x)>>24)&255); (y)[1] = (unsigned char)(((x)>>16)&255); \ (y)[2] = (unsigned char)(((x)>>8)&255); (y)[3] = (unsigned char)((x)&255); } while(0) #define STORE64H(x, y) \ do { (y)[0] = (unsigned char)(((x)>>56)&255); (y)[1] = (unsigned char)(((x)>>48)&255); \ (y)[2] = (unsigned char)(((x)>>40)&255); (y)[3] = (unsigned char)(((x)>>32)&255); \ (y)[4] = (unsigned char)(((x)>>24)&255); (y)[5] = (unsigned char)(((x)>>16)&255); \ (y)[6] = (unsigned char)(((x)>>8)&255); (y)[7] = (unsigned char)((x)&255); } while(0) /* Various logical functions */ #define Ch(x,y,z) (z ^ (x & (y ^ z))) #define Maj(x,y,z) (((x | y) & z) | (x & y)) #define S(x, n) RORc((x),(n)) #define R(x, n) (((x)&0xFFFFFFFFUL)>>(n)) #define Sigma0(x) (S(x, 2) ^ S(x, 13) ^ S(x, 22)) #define Sigma1(x) (S(x, 6) ^ S(x, 11) ^ S(x, 25)) #define Gamma0(x) (S(x, 7) ^ S(x, 18) ^ R(x, 3)) #define Gamma1(x) (S(x, 17) ^ S(x, 19) ^ R(x, 10)) struct sha256_state { ulong64 length; ulong32 state[8], curlen; unsigned char buf[32*2]; }; /* compress 512-bits */ static int s_sha256_compress(struct sha256_state * md, const unsigned char *buf) { ulong32 S[8], W[64], t0, t1; int i; /* copy state into S */ for (i = 0; i < 8; i++) { S[i] = md->state[i]; } /* copy the state into 512-bits into W[0..15] */ for (i = 0; i < 16; i++) { LOAD32H(W[i], buf + (4*i)); } /* fill W[16..63] */ for (i = 16; i < 64; i++) { W[i] = Gamma1(W[i - 2]) + W[i - 7] + Gamma0(W[i - 15]) + W[i - 16]; } /* Compress */ #define RND(a,b,c,d,e,f,g,h,i,ki) \ t0 = h + Sigma1(e) + Ch(e, f, g) + ki + W[i]; \ t1 = Sigma0(a) + Maj(a, b, c); \ d += t0; \ h = t0 + t1; RND(S[0],S[1],S[2],S[3],S[4],S[5],S[6],S[7],0,0x428a2f98); RND(S[7],S[0],S[1],S[2],S[3],S[4],S[5],S[6],1,0x71374491); RND(S[6],S[7],S[0],S[1],S[2],S[3],S[4],S[5],2,0xb5c0fbcf); RND(S[5],S[6],S[7],S[0],S[1],S[2],S[3],S[4],3,0xe9b5dba5); RND(S[4],S[5],S[6],S[7],S[0],S[1],S[2],S[3],4,0x3956c25b); RND(S[3],S[4],S[5],S[6],S[7],S[0],S[1],S[2],5,0x59f111f1); RND(S[2],S[3],S[4],S[5],S[6],S[7],S[0],S[1],6,0x923f82a4); RND(S[1],S[2],S[3],S[4],S[5],S[6],S[7],S[0],7,0xab1c5ed5); RND(S[0],S[1],S[2],S[3],S[4],S[5],S[6],S[7],8,0xd807aa98); RND(S[7],S[0],S[1],S[2],S[3],S[4],S[5],S[6],9,0x12835b01); RND(S[6],S[7],S[0],S[1],S[2],S[3],S[4],S[5],10,0x243185be); RND(S[5],S[6],S[7],S[0],S[1],S[2],S[3],S[4],11,0x550c7dc3); RND(S[4],S[5],S[6],S[7],S[0],S[1],S[2],S[3],12,0x72be5d74); RND(S[3],S[4],S[5],S[6],S[7],S[0],S[1],S[2],13,0x80deb1fe); RND(S[2],S[3],S[4],S[5],S[6],S[7],S[0],S[1],14,0x9bdc06a7); RND(S[1],S[2],S[3],S[4],S[5],S[6],S[7],S[0],15,0xc19bf174); RND(S[0],S[1],S[2],S[3],S[4],S[5],S[6],S[7],16,0xe49b69c1); RND(S[7],S[0],S[1],S[2],S[3],S[4],S[5],S[6],17,0xefbe4786); RND(S[6],S[7],S[0],S[1],S[2],S[3],S[4],S[5],18,0x0fc19dc6); RND(S[5],S[6],S[7],S[0],S[1],S[2],S[3],S[4],19,0x240ca1cc); RND(S[4],S[5],S[6],S[7],S[0],S[1],S[2],S[3],20,0x2de92c6f); RND(S[3],S[4],S[5],S[6],S[7],S[0],S[1],S[2],21,0x4a7484aa); RND(S[2],S[3],S[4],S[5],S[6],S[7],S[0],S[1],22,0x5cb0a9dc); RND(S[1],S[2],S[3],S[4],S[5],S[6],S[7],S[0],23,0x76f988da); RND(S[0],S[1],S[2],S[3],S[4],S[5],S[6],S[7],24,0x983e5152); RND(S[7],S[0],S[1],S[2],S[3],S[4],S[5],S[6],25,0xa831c66d); RND(S[6],S[7],S[0],S[1],S[2],S[3],S[4],S[5],26,0xb00327c8); RND(S[5],S[6],S[7],S[0],S[1],S[2],S[3],S[4],27,0xbf597fc7); RND(S[4],S[5],S[6],S[7],S[0],S[1],S[2],S[3],28,0xc6e00bf3); RND(S[3],S[4],S[5],S[6],S[7],S[0],S[1],S[2],29,0xd5a79147); RND(S[2],S[3],S[4],S[5],S[6],S[7],S[0],S[1],30,0x06ca6351); RND(S[1],S[2],S[3],S[4],S[5],S[6],S[7],S[0],31,0x14292967); RND(S[0],S[1],S[2],S[3],S[4],S[5],S[6],S[7],32,0x27b70a85); RND(S[7],S[0],S[1],S[2],S[3],S[4],S[5],S[6],33,0x2e1b2138); RND(S[6],S[7],S[0],S[1],S[2],S[3],S[4],S[5],34,0x4d2c6dfc); RND(S[5],S[6],S[7],S[0],S[1],S[2],S[3],S[4],35,0x53380d13); RND(S[4],S[5],S[6],S[7],S[0],S[1],S[2],S[3],36,0x650a7354); RND(S[3],S[4],S[5],S[6],S[7],S[0],S[1],S[2],37,0x766a0abb); RND(S[2],S[3],S[4],S[5],S[6],S[7],S[0],S[1],38,0x81c2c92e); RND(S[1],S[2],S[3],S[4],S[5],S[6],S[7],S[0],39,0x92722c85); RND(S[0],S[1],S[2],S[3],S[4],S[5],S[6],S[7],40,0xa2bfe8a1); RND(S[7],S[0],S[1],S[2],S[3],S[4],S[5],S[6],41,0xa81a664b); RND(S[6],S[7],S[0],S[1],S[2],S[3],S[4],S[5],42,0xc24b8b70); RND(S[5],S[6],S[7],S[0],S[1],S[2],S[3],S[4],43,0xc76c51a3); RND(S[4],S[5],S[6],S[7],S[0],S[1],S[2],S[3],44,0xd192e819); RND(S[3],S[4],S[5],S[6],S[7],S[0],S[1],S[2],45,0xd6990624); RND(S[2],S[3],S[4],S[5],S[6],S[7],S[0],S[1],46,0xf40e3585); RND(S[1],S[2],S[3],S[4],S[5],S[6],S[7],S[0],47,0x106aa070); RND(S[0],S[1],S[2],S[3],S[4],S[5],S[6],S[7],48,0x19a4c116); RND(S[7],S[0],S[1],S[2],S[3],S[4],S[5],S[6],49,0x1e376c08); RND(S[6],S[7],S[0],S[1],S[2],S[3],S[4],S[5],50,0x2748774c); RND(S[5],S[6],S[7],S[0],S[1],S[2],S[3],S[4],51,0x34b0bcb5); RND(S[4],S[5],S[6],S[7],S[0],S[1],S[2],S[3],52,0x391c0cb3); RND(S[3],S[4],S[5],S[6],S[7],S[0],S[1],S[2],53,0x4ed8aa4a); RND(S[2],S[3],S[4],S[5],S[6],S[7],S[0],S[1],54,0x5b9cca4f); RND(S[1],S[2],S[3],S[4],S[5],S[6],S[7],S[0],55,0x682e6ff3); RND(S[0],S[1],S[2],S[3],S[4],S[5],S[6],S[7],56,0x748f82ee); RND(S[7],S[0],S[1],S[2],S[3],S[4],S[5],S[6],57,0x78a5636f); RND(S[6],S[7],S[0],S[1],S[2],S[3],S[4],S[5],58,0x84c87814); RND(S[5],S[6],S[7],S[0],S[1],S[2],S[3],S[4],59,0x8cc70208); RND(S[4],S[5],S[6],S[7],S[0],S[1],S[2],S[3],60,0x90befffa); RND(S[3],S[4],S[5],S[6],S[7],S[0],S[1],S[2],61,0xa4506ceb); RND(S[2],S[3],S[4],S[5],S[6],S[7],S[0],S[1],62,0xbef9a3f7); RND(S[1],S[2],S[3],S[4],S[5],S[6],S[7],S[0],63,0xc67178f2); #undef RND /* feedback */ for (i = 0; i < 8; i++) { md->state[i] = md->state[i] + S[i]; } return 0; } static int sha256_init(struct sha256_state * md) { if (md == NULL) return -1; md->curlen = 0; md->length = 0; md->state[0] = 0x6A09E667UL; md->state[1] = 0xBB67AE85UL; md->state[2] = 0x3C6EF372UL; md->state[3] = 0xA54FF53AUL; md->state[4] = 0x510E527FUL; md->state[5] = 0x9B05688CUL; md->state[6] = 0x1F83D9ABUL; md->state[7] = 0x5BE0CD19UL; return 0; } static int sha256_process(struct sha256_state * md, const unsigned char *in, unsigned long inlen) { unsigned long n; int err; if (md == NULL) return -1; if (in == NULL) return -1; if (md->curlen > sizeof(md->buf)) { return -1; } if (((md->length + inlen * 8) < md->length) || ((inlen * 8) < inlen)) { return -1; } while (inlen > 0) { if (md->curlen == 0 && inlen >= 64) { if ((err = s_sha256_compress(md, in)) != 0) { return err; } md->length += 64 * 8; in += 64; inlen -= 64; } else { n = MIN(inlen, (64 - md->curlen)); memcpy(md->buf + md->curlen, in, (size_t)n); md->curlen += n; in += n; inlen -= n; if (md->curlen == 64) { if ((err = s_sha256_compress(md, md->buf)) != 0) { return err; } md->length += 8 * 64; md->curlen = 0; } } } return 0; } static int sha256_done(struct sha256_state * md, unsigned char *out) { int i; if (md == NULL) return -1; if (out == NULL) return -1; if (md->curlen >= sizeof(md->buf)) { return -1; } /* increase the length of the message */ md->length += md->curlen * 8; /* append the '1' bit */ md->buf[md->curlen++] = (unsigned char)0x80; /* if the length is currently above 56 bytes we append zeros * then compress. Then we can fall back to padding zeros and length * encoding like normal. */ if (md->curlen > 56) { while (md->curlen < 64) { md->buf[md->curlen++] = (unsigned char)0; } s_sha256_compress(md, md->buf); md->curlen = 0; } /* pad upto 56 bytes of zeroes */ while (md->curlen < 56) { md->buf[md->curlen++] = (unsigned char)0; } /* store length */ STORE64H(md->length, md->buf+56); s_sha256_compress(md, md->buf); /* copy output */ for (i = 0; i < 8; i++) { STORE32H(md->state[i], out+(4*i)); } return 0; } void sha256(const void *in, unsigned long inlen, void* out) { struct sha256_state ctx; sha256_init(&ctx); sha256_process(&ctx, (const unsigned char*)in, inlen); sha256_done(&ctx, (unsigned char *)out); } UEFITool-A66/common/digest/sha512.c000066400000000000000000000243761442134156300167330ustar00rootroot00000000000000/* sha512.c Copyright (c) 2022, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ // // This implementations are based on LibTomCrypt that was released into // public domain by Tom St Denis. // #include "sha2.h" #include #include /* ulong64: 64-bit data type */ #ifdef _MSC_VER #define CONST64(n) n ## ui64 typedef unsigned __int64 ulong64; typedef __int64 long64; #else #define CONST64(n) n ## ULL typedef unsigned long long ulong64; typedef long long long64; #endif #define ROR64c(x, y) \ ( ((((x)&CONST64(0xFFFFFFFFFFFFFFFF))>>((ulong64)(y)&CONST64(63))) | \ ((x)<<(((ulong64)64-((y)&63))&63))) & CONST64(0xFFFFFFFFFFFFFFFF)) #define LOAD64H(x, y) \ do { x = (((ulong64)((y)[0] & 255))<<56)|(((ulong64)((y)[1] & 255))<<48) | \ (((ulong64)((y)[2] & 255))<<40)|(((ulong64)((y)[3] & 255))<<32) | \ (((ulong64)((y)[4] & 255))<<24)|(((ulong64)((y)[5] & 255))<<16) | \ (((ulong64)((y)[6] & 255))<<8)|(((ulong64)((y)[7] & 255))); } while(0) #define STORE64H(x, y) \ do { (y)[0] = (unsigned char)(((x)>>56)&255); (y)[1] = (unsigned char)(((x)>>48)&255); \ (y)[2] = (unsigned char)(((x)>>40)&255); (y)[3] = (unsigned char)(((x)>>32)&255); \ (y)[4] = (unsigned char)(((x)>>24)&255); (y)[5] = (unsigned char)(((x)>>16)&255); \ (y)[6] = (unsigned char)(((x)>>8)&255); (y)[7] = (unsigned char)((x)&255); } while(0) #ifndef MIN #define MIN(x, y) (((x) < (y)) ? (x) : (y)) #endif /* the K array */ static const ulong64 K[80] = { CONST64(0x428a2f98d728ae22), CONST64(0x7137449123ef65cd), CONST64(0xb5c0fbcfec4d3b2f), CONST64(0xe9b5dba58189dbbc), CONST64(0x3956c25bf348b538), CONST64(0x59f111f1b605d019), CONST64(0x923f82a4af194f9b), CONST64(0xab1c5ed5da6d8118), CONST64(0xd807aa98a3030242), CONST64(0x12835b0145706fbe), CONST64(0x243185be4ee4b28c), CONST64(0x550c7dc3d5ffb4e2), CONST64(0x72be5d74f27b896f), CONST64(0x80deb1fe3b1696b1), CONST64(0x9bdc06a725c71235), CONST64(0xc19bf174cf692694), CONST64(0xe49b69c19ef14ad2), CONST64(0xefbe4786384f25e3), CONST64(0x0fc19dc68b8cd5b5), CONST64(0x240ca1cc77ac9c65), CONST64(0x2de92c6f592b0275), CONST64(0x4a7484aa6ea6e483), CONST64(0x5cb0a9dcbd41fbd4), CONST64(0x76f988da831153b5), CONST64(0x983e5152ee66dfab), CONST64(0xa831c66d2db43210), CONST64(0xb00327c898fb213f), CONST64(0xbf597fc7beef0ee4), CONST64(0xc6e00bf33da88fc2), CONST64(0xd5a79147930aa725), CONST64(0x06ca6351e003826f), CONST64(0x142929670a0e6e70), CONST64(0x27b70a8546d22ffc), CONST64(0x2e1b21385c26c926), CONST64(0x4d2c6dfc5ac42aed), CONST64(0x53380d139d95b3df), CONST64(0x650a73548baf63de), CONST64(0x766a0abb3c77b2a8), CONST64(0x81c2c92e47edaee6), CONST64(0x92722c851482353b), CONST64(0xa2bfe8a14cf10364), CONST64(0xa81a664bbc423001), CONST64(0xc24b8b70d0f89791), CONST64(0xc76c51a30654be30), CONST64(0xd192e819d6ef5218), CONST64(0xd69906245565a910), CONST64(0xf40e35855771202a), CONST64(0x106aa07032bbd1b8), CONST64(0x19a4c116b8d2d0c8), CONST64(0x1e376c085141ab53), CONST64(0x2748774cdf8eeb99), CONST64(0x34b0bcb5e19b48a8), CONST64(0x391c0cb3c5c95a63), CONST64(0x4ed8aa4ae3418acb), CONST64(0x5b9cca4f7763e373), CONST64(0x682e6ff3d6b2b8a3), CONST64(0x748f82ee5defb2fc), CONST64(0x78a5636f43172f60), CONST64(0x84c87814a1f0ab72), CONST64(0x8cc702081a6439ec), CONST64(0x90befffa23631e28), CONST64(0xa4506cebde82bde9), CONST64(0xbef9a3f7b2c67915), CONST64(0xc67178f2e372532b), CONST64(0xca273eceea26619c), CONST64(0xd186b8c721c0c207), CONST64(0xeada7dd6cde0eb1e), CONST64(0xf57d4f7fee6ed178), CONST64(0x06f067aa72176fba), CONST64(0x0a637dc5a2c898a6), CONST64(0x113f9804bef90dae), CONST64(0x1b710b35131c471b), CONST64(0x28db77f523047d84), CONST64(0x32caab7b40c72493), CONST64(0x3c9ebe0a15c9bebc), CONST64(0x431d67c49c100d4c), CONST64(0x4cc5d4becb3e42b6), CONST64(0x597f299cfc657e2a), CONST64(0x5fcb6fab3ad6faec), CONST64(0x6c44198c4a475817) }; /* Various logical functions */ #define Ch(x,y,z) (z ^ (x & (y ^ z))) #define Maj(x,y,z) (((x | y) & z) | (x & y)) #define S(x, n) ROR64c(x, n) #define R(x, n) (((x)&CONST64(0xFFFFFFFFFFFFFFFF))>>((ulong64)n)) #define Sigma0(x) (S(x, 28) ^ S(x, 34) ^ S(x, 39)) #define Sigma1(x) (S(x, 14) ^ S(x, 18) ^ S(x, 41)) #define Gamma0(x) (S(x, 1) ^ S(x, 8) ^ R(x, 7)) #define Gamma1(x) (S(x, 19) ^ S(x, 61) ^ R(x, 6)) struct sha512_state { ulong64 length, state[8]; unsigned long curlen; unsigned char buf[128]; }; /* compress 1024-bits */ static int s_sha512_compress(struct sha512_state * md, const unsigned char *buf) { ulong64 S[8], W[80], t0, t1; int i; /* copy state into S */ for (i = 0; i < 8; i++) { S[i] = md->state[i]; } /* copy the state into 1024-bits into W[0..15] */ for (i = 0; i < 16; i++) { LOAD64H(W[i], buf + (8*i)); } /* fill W[16..79] */ for (i = 16; i < 80; i++) { W[i] = Gamma1(W[i - 2]) + W[i - 7] + Gamma0(W[i - 15]) + W[i - 16]; } /* Compress */ #define RND(a,b,c,d,e,f,g,h,i) \ t0 = h + Sigma1(e) + Ch(e, f, g) + K[i] + W[i]; \ t1 = Sigma0(a) + Maj(a, b, c); \ d += t0; \ h = t0 + t1; for (i = 0; i < 80; i += 8) { RND(S[0],S[1],S[2],S[3],S[4],S[5],S[6],S[7],i+0); RND(S[7],S[0],S[1],S[2],S[3],S[4],S[5],S[6],i+1); RND(S[6],S[7],S[0],S[1],S[2],S[3],S[4],S[5],i+2); RND(S[5],S[6],S[7],S[0],S[1],S[2],S[3],S[4],i+3); RND(S[4],S[5],S[6],S[7],S[0],S[1],S[2],S[3],i+4); RND(S[3],S[4],S[5],S[6],S[7],S[0],S[1],S[2],i+5); RND(S[2],S[3],S[4],S[5],S[6],S[7],S[0],S[1],i+6); RND(S[1],S[2],S[3],S[4],S[5],S[6],S[7],S[0],i+7); } /* feedback */ for (i = 0; i < 8; i++) { md->state[i] = md->state[i] + S[i]; } return 0; } static int sha512_init(struct sha512_state * md) { if (md == NULL) return -1; md->curlen = 0; md->length = 0; md->state[0] = CONST64(0x6a09e667f3bcc908); md->state[1] = CONST64(0xbb67ae8584caa73b); md->state[2] = CONST64(0x3c6ef372fe94f82b); md->state[3] = CONST64(0xa54ff53a5f1d36f1); md->state[4] = CONST64(0x510e527fade682d1); md->state[5] = CONST64(0x9b05688c2b3e6c1f); md->state[6] = CONST64(0x1f83d9abfb41bd6b); md->state[7] = CONST64(0x5be0cd19137e2179); return 0; } static int sha512_process(struct sha512_state * md, const unsigned char *in, unsigned long inlen) { unsigned long n; int err; if (md == NULL) return -1; if (in == NULL) return -1; if (md->curlen > sizeof(md->buf)) { return -1; } if (((md->length + inlen * 8) < md->length) || ((inlen * 8) < inlen)) { return -1; } while (inlen > 0) { if (md->curlen == 0 && inlen >= 128) { if ((err = s_sha512_compress(md, in)) != 0) { return err; } md->length += 128 * 8; in += 128; inlen -= 128; } else { n = MIN(inlen, (128 - md->curlen)); memcpy(md->buf + md->curlen, in, (size_t)n); md->curlen += n; in += n; inlen -= n; if (md->curlen == 128) { if ((err = s_sha512_compress(md, md->buf)) != 0) { return err; } md->length += 8 * 128; md->curlen = 0; } } } return 0; } static int sha512_done(struct sha512_state * md, unsigned char *out) { int i; if (md == NULL) return -1; if (out == NULL) return -1; if (md->curlen >= sizeof(md->buf)) { return -1; } /* increase the length of the message */ md->length += md->curlen * CONST64(8); /* append the '1' bit */ md->buf[md->curlen++] = (unsigned char)0x80; /* if the length is currently above 112 bytes we append zeros * then compress. Then we can fall back to padding zeros and length * encoding like normal. */ if (md->curlen > 112) { while (md->curlen < 128) { md->buf[md->curlen++] = (unsigned char)0; } s_sha512_compress(md, md->buf); md->curlen = 0; } /* pad upto 120 bytes of zeroes * note: that from 112 to 120 is the 64 MSB of the length. We assume that you won't hash * > 2^64 bits of data... :-) */ while (md->curlen < 120) { md->buf[md->curlen++] = (unsigned char)0; } /* store length */ STORE64H(md->length, md->buf+120); s_sha512_compress(md, md->buf); /* copy output */ for (i = 0; i < 8; i++) { STORE64H(md->state[i], out+(8*i)); } return 0; } static int sha384_init(struct sha512_state * md) { if (md == NULL) return -1; md->curlen = 0; md->length = 0; md->state[0] = CONST64(0xcbbb9d5dc1059ed8); md->state[1] = CONST64(0x629a292a367cd507); md->state[2] = CONST64(0x9159015a3070dd17); md->state[3] = CONST64(0x152fecd8f70e5939); md->state[4] = CONST64(0x67332667ffc00b31); md->state[5] = CONST64(0x8eb44a8768581511); md->state[6] = CONST64(0xdb0c2e0d64f98fa7); md->state[7] = CONST64(0x47b5481dbefa4fa4); return 0; } static int sha384_done(struct sha512_state * md, unsigned char *out) { unsigned char buf[64]; if (md == NULL) return -1; if (out == NULL) return -1;; if (md->curlen >= sizeof(md->buf)) { return -1; } sha512_done(md, buf); memcpy(out, buf, 48); return 0; } void sha384(const void *in, unsigned long inlen, void* out) { struct sha512_state ctx; sha384_init(&ctx); sha512_process(&ctx, (const unsigned char*)in, inlen); sha384_done(&ctx, (unsigned char *)out); } void sha512(const void *in, unsigned long inlen, void* out) { struct sha512_state ctx; sha512_init(&ctx); sha512_process(&ctx, (const unsigned char*)in, inlen); sha512_done(&ctx, (unsigned char *)out); } UEFITool-A66/common/digest/sm3.c000066400000000000000000000131731442134156300164230ustar00rootroot00000000000000// SPDX-License-Identifier: BSD-2-Clause /* * Copyright (c) 2019 Huawei Technologies Co., Ltd */ #include "sm3.h" #include struct sm3_context { uint32_t total[2]; /* number of bytes processed */ uint32_t state[8]; /* intermediate digest state */ uint8_t buffer[64]; /* data block being processed */ uint8_t ipad[64]; /* HMAC: inner padding */ uint8_t opad[64]; /* HMAC: outer padding */ }; static void sm3_init(struct sm3_context *ctx); static void sm3_update(struct sm3_context *ctx, const uint8_t *input, size_t ilen); static void sm3_final(struct sm3_context *ctx, uint8_t* output); #define GET_UINT32_BE(n, b, i) \ do { \ (n) = ((uint32_t)(b)[(i)] << 24) | \ ((uint32_t)(b)[(i) + 1] << 16) | \ ((uint32_t)(b)[(i) + 2] << 8) | \ ((uint32_t)(b)[(i) + 3]); \ } while (0) #define PUT_UINT32_BE(n, b, i) \ do { \ (b)[(i)] = (uint8_t)((n) >> 24); \ (b)[(i) + 1] = (uint8_t)((n) >> 16); \ (b)[(i) + 2] = (uint8_t)((n) >> 8); \ (b)[(i) + 3] = (uint8_t)((n)); \ } while (0) static void sm3_init(struct sm3_context *ctx) { ctx->total[0] = 0; ctx->total[1] = 0; ctx->state[0] = 0x7380166F; ctx->state[1] = 0x4914B2B9; ctx->state[2] = 0x172442D7; ctx->state[3] = 0xDA8A0600; ctx->state[4] = 0xA96F30BC; ctx->state[5] = 0x163138AA; ctx->state[6] = 0xE38DEE4D; ctx->state[7] = 0xB0FB0E4E; } static void sm3_process(struct sm3_context *ctx, const uint8_t data[64]) { uint32_t SS1, SS2, TT1, TT2, W[68], W1[64]; uint32_t A, B, C, D, E, F, G, H; uint32_t T[64]; uint32_t Temp1, Temp2, Temp3, Temp4, Temp5; int j; for (j = 0; j < 16; j++) T[j] = 0x79CC4519; for (j = 16; j < 64; j++) T[j] = 0x7A879D8A; GET_UINT32_BE(W[0], data, 0); GET_UINT32_BE(W[1], data, 4); GET_UINT32_BE(W[2], data, 8); GET_UINT32_BE(W[3], data, 12); GET_UINT32_BE(W[4], data, 16); GET_UINT32_BE(W[5], data, 20); GET_UINT32_BE(W[6], data, 24); GET_UINT32_BE(W[7], data, 28); GET_UINT32_BE(W[8], data, 32); GET_UINT32_BE(W[9], data, 36); GET_UINT32_BE(W[10], data, 40); GET_UINT32_BE(W[11], data, 44); GET_UINT32_BE(W[12], data, 48); GET_UINT32_BE(W[13], data, 52); GET_UINT32_BE(W[14], data, 56); GET_UINT32_BE(W[15], data, 60); #define FF0(x, y, z) ((x) ^ (y) ^ (z)) #define FF1(x, y, z) (((x) & (y)) | ((x) & (z)) | ((y) & (z))) #define GG0(x, y, z) ((x) ^ (y) ^ (z)) #define GG1(x, y, z) (((x) & (y)) | ((~(x)) & (z))) #define SHL(x, n) ((x) << (n)) #define ROTL(x, y) ( (((uint32_t)(x)<<(uint32_t)((y)&31)) | (((uint32_t)(x)&0xFFFFFFFFUL)>>(uint32_t)((32-((y)&31))&31))) & 0xFFFFFFFFUL) #define P0(x) ((x) ^ ROTL((x), 9) ^ ROTL((x), 17)) #define P1(x) ((x) ^ ROTL((x), 15) ^ ROTL((x), 23)) for (j = 16; j < 68; j++) { /* * W[j] = P1( W[j-16] ^ W[j-9] ^ ROTL(W[j-3],15)) ^ * ROTL(W[j - 13],7 ) ^ W[j-6]; */ Temp1 = W[j - 16] ^ W[j - 9]; Temp2 = ROTL(W[j - 3], 15); Temp3 = Temp1 ^ Temp2; Temp4 = P1(Temp3); Temp5 = ROTL(W[j - 13], 7) ^ W[j - 6]; W[j] = Temp4 ^ Temp5; } for (j = 0; j < 64; j++) W1[j] = W[j] ^ W[j + 4]; A = ctx->state[0]; B = ctx->state[1]; C = ctx->state[2]; D = ctx->state[3]; E = ctx->state[4]; F = ctx->state[5]; G = ctx->state[6]; H = ctx->state[7]; for (j = 0; j < 16; j++) { SS1 = ROTL(ROTL(A, 12) + E + ROTL(T[j], j), 7); SS2 = SS1 ^ ROTL(A, 12); TT1 = FF0(A, B, C) + D + SS2 + W1[j]; TT2 = GG0(E, F, G) + H + SS1 + W[j]; D = C; C = ROTL(B, 9); B = A; A = TT1; H = G; G = ROTL(F, 19); F = E; E = P0(TT2); } for (j = 16; j < 64; j++) { SS1 = ROTL(ROTL(A, 12) + E + ROTL(T[j], j), 7); SS2 = SS1 ^ ROTL(A, 12); TT1 = FF1(A, B, C) + D + SS2 + W1[j]; TT2 = GG1(E, F, G) + H + SS1 + W[j]; D = C; C = ROTL(B, 9); B = A; A = TT1; H = G; G = ROTL(F, 19); F = E; E = P0(TT2); } ctx->state[0] ^= A; ctx->state[1] ^= B; ctx->state[2] ^= C; ctx->state[3] ^= D; ctx->state[4] ^= E; ctx->state[5] ^= F; ctx->state[6] ^= G; ctx->state[7] ^= H; } static void sm3_update(struct sm3_context *ctx, const uint8_t *input, size_t ilen) { size_t fill; size_t left; if (!ilen) return; left = ctx->total[0] & 0x3F; fill = 64 - left; ctx->total[0] += ilen; if (ctx->total[0] < ilen) ctx->total[1]++; if (left && ilen >= fill) { memcpy(ctx->buffer + left, input, fill); sm3_process(ctx, ctx->buffer); input += fill; ilen -= fill; left = 0; } while (ilen >= 64) { sm3_process(ctx, input); input += 64; ilen -= 64; } if (ilen > 0) memcpy(ctx->buffer + left, input, ilen); } static const uint8_t sm3_padding[64] = { 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }; static void sm3_final(struct sm3_context *ctx, uint8_t* output) { uint32_t last, padn; uint32_t high, low; uint8_t msglen[8]; high = (ctx->total[0] >> 29) | (ctx->total[1] << 3); low = ctx->total[0] << 3; PUT_UINT32_BE(high, msglen, 0); PUT_UINT32_BE(low, msglen, 4); last = ctx->total[0] & 0x3F; padn = (last < 56) ? (56 - last) : (120 - last); sm3_update(ctx, sm3_padding, padn); sm3_update(ctx, msglen, 8); PUT_UINT32_BE(ctx->state[0], output, 0); PUT_UINT32_BE(ctx->state[1], output, 4); PUT_UINT32_BE(ctx->state[2], output, 8); PUT_UINT32_BE(ctx->state[3], output, 12); PUT_UINT32_BE(ctx->state[4], output, 16); PUT_UINT32_BE(ctx->state[5], output, 20); PUT_UINT32_BE(ctx->state[6], output, 24); PUT_UINT32_BE(ctx->state[7], output, 28); } void sm3(const void *in, unsigned long inlen, void* out) { struct sm3_context ctx; sm3_init(&ctx); sm3_update(&ctx, (const uint8_t *)in, (size_t)inlen); sm3_final(&ctx, (uint8_t*)out); } UEFITool-A66/common/digest/sm3.h000066400000000000000000000014321442134156300164230ustar00rootroot00000000000000/* sm3.h Copyright (c) 2022, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ /* SPDX-License-Identifier: BSD-2-Clause */ /* * Copyright (c) 2019 Huawei Technologies Co., Ltd */ #ifndef SM3_H #define SM3_H #ifdef __cplusplus extern "C" { #endif #include #include void sm3(const void *in, unsigned long inlen, void* out); #ifdef __cplusplus } #endif #endif /* SM3_H */ UEFITool-A66/common/ffs.cpp000066400000000000000000000513741442134156300155650ustar00rootroot00000000000000/* ffs.cpp Copyright (c) 2015, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHWARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include #include "ffs.h" #include "guiddatabase.h" #include "ubytearray.h" // // GUIDs mentioned in by ffs.h // // Standard FMP capsule GUID extern const UByteArray EFI_FMP_CAPSULE_GUID // 6DCBD5ED-E82D-4C44-BDA1-7194199AD92A ("\xED\xD5\xCB\x6D\x2D\xE8\x44\x4C\xBD\xA1\x71\x94\x19\x9A\xD9\x2A", 16); // Standard EFI capsule GUID extern const UByteArray EFI_CAPSULE_GUID // 3B6686BD-0D76-4030-B70E-B5519E2FC5A0 ("\xBD\x86\x66\x3B\x76\x0D\x30\x40\xB7\x0E\xB5\x51\x9E\x2F\xC5\xA0", 16); // Intel capsule GUID extern const UByteArray INTEL_CAPSULE_GUID // 539182B9-ABB5-4391-B69A-E3A943F72FCC ("\xB9\x82\x91\x53\xB5\xAB\x91\x43\xB6\x9A\xE3\xA9\x43\xF7\x2F\xCC", 16); // Lenovo capsule GUID extern const UByteArray LENOVO_CAPSULE_GUID // E20BAFD3-9914-4F4F-9537-3129E090EB3C ("\xD3\xAF\x0B\xE2\x14\x99\x4F\x4F\x95\x37\x31\x29\xE0\x90\xEB\x3C", 16); // Another Lenovo capsule GUID extern const UByteArray LENOVO2_CAPSULE_GUID // 25B5FE76-8243-4A5C-A9BD-7EE3246198B5 ("\x76\xFE\xB5\x25\x43\x82\x5C\x4A\xA9\xBD\x7E\xE3\x24\x61\x98\xB5", 16); // Toshiba capsule GUID extern const UByteArray TOSHIBA_CAPSULE_GUID // 3BE07062-1D51-45D2-832B-F093257ED461 ("\x62\x70\xE0\x3B\x51\x1D\xD2\x45\x83\x2B\xF0\x93\x25\x7E\xD4\x61", 16); // AMI Aptio signed extended capsule GUID extern const UByteArray APTIO_SIGNED_CAPSULE_GUID // 4A3CA68B-7723-48FB-803D-578CC1FEC44D ("\x8B\xA6\x3C\x4A\x23\x77\xFB\x48\x80\x3D\x57\x8C\xC1\xFE\xC4\x4D", 16); // AMI Aptio unsigned extended capsule GUID extern const UByteArray APTIO_UNSIGNED_CAPSULE_GUID // 14EEBB90-890A-43DB-AED1-5D3C4588A418 ("\x90\xBB\xEE\x14\x0A\x89\xDB\x43\xAE\xD1\x5D\x3C\x45\x88\xA4\x18", 16); // Standard file system GUIDs extern const UByteArray EFI_FIRMWARE_FILE_SYSTEM_GUID // 7A9354D9-0468-444A-81CE-0BF617D890DF ("\xD9\x54\x93\x7A\x68\x04\x4A\x44\x81\xCE\x0B\xF6\x17\xD8\x90\xDF", 16); extern const UByteArray EFI_FIRMWARE_FILE_SYSTEM2_GUID // 8C8CE578-8A3D-4F1C-9935-896185C32DD3 ("\x78\xE5\x8C\x8C\x3D\x8A\x1C\x4F\x99\x35\x89\x61\x85\xC3\x2D\xD3", 16); extern const UByteArray EFI_FIRMWARE_FILE_SYSTEM3_GUID // 5473C07A-3DCB-4DCA-BD6F-1E9689E7349A ("\x7A\xC0\x73\x54\xCB\x3D\xCA\x4D\xBD\x6F\x1E\x96\x89\xE7\x34\x9A", 16); // Vendor-specific file system GUIDs extern const UByteArray EFI_APPLE_IMMUTABLE_FV_GUID // 04ADEEAD-61FF-4D31-B6BA-64F8BF901F5A ("\xAD\xEE\xAD\x04\xFF\x61\x31\x4D\xB6\xBA\x64\xF8\xBF\x90\x1F\x5A", 16); extern const UByteArray EFI_APPLE_AUTHENTICATION_FV_GUID // BD001B8C-6A71-487B-A14F-0C2A2DCF7A5D ("\x8C\x1B\x00\xBD\x71\x6A\x7B\x48\xA1\x4F\x0C\x2A\x2D\xCF\x7A\x5D", 16); extern const UByteArray EFI_APPLE_MICROCODE_VOLUME_GUID // 153D2197-29BD-44DC-AC59-887F70E41A6B ("\x97\x21\x3D\x15\xBD\x29\xDC\x44\xAC\x59\x88\x7F\x70\xE4\x1A\x6B", 16); extern const UByteArray EFI_INTEL_FILE_SYSTEM_GUID // AD3FFFFF-D28B-44C4-9F13-9EA98A97F9F0 ("\xFF\xFF\x3F\xAD\x8B\xD2\xC4\x44\x9F\x13\x9E\xA9\x8A\x97\xF9\xF0", 16); extern const UByteArray EFI_INTEL_FILE_SYSTEM2_GUID // D6A1CD70-4B33-4994-A6EA-375F2CCC5437 ("\x70\xCD\xA1\xD6\x33\x4B\x94\x49\xA6\xEA\x37\x5F\x2C\xCC\x54\x37", 16); extern const UByteArray EFI_SONY_FILE_SYSTEM_GUID // 4F494156-AED6-4D64-A537-B8A5557BCEEC ("\x56\x41\x49\x4F\xD6\xAE\x64\x4D\xA5\x37\xB8\xA5\x55\x7B\xCE\xEC", 16); // PEI apriori file extern const UByteArray EFI_PEI_APRIORI_FILE_GUID // 1B45CC0A-156A-428A-AF62-49864DA0E6E6 ("\x0A\xCC\x45\x1B\x6A\x15\x8A\x42\xAF\x62\x49\x86\x4D\xA0\xE6\xE6", 16); // DXE apriori file extern const UByteArray EFI_DXE_APRIORI_FILE_GUID // FC510EE7-FFDC-11D4-BD41-0080C73C8881 ("\xE7\x0E\x51\xFC\xDC\xFF\xD4\x11\xBD\x41\x00\x80\xC7\x3C\x88\x81", 16); // Volume top file extern const UByteArray EFI_FFS_VOLUME_TOP_FILE_GUID // 1BA0062E-C779-4582-8566-336AE8F78F09 ("\x2E\x06\xA0\x1B\x79\xC7\x82\x45\x85\x66\x33\x6A\xE8\xF7\x8F\x09", 16); // Padding file GUID extern const UByteArray EFI_FFS_PAD_FILE_GUID // E4536585-7909-4A60-B5C6-ECDEA6EBFB5 ("\x85\x65\x53\xE4\x09\x79\x60\x4A\xB5\xC6\xEC\xDE\xA6\xEB\xFB\x54", 16); // AMI DXE core file extern const UByteArray AMI_CORE_DXE_GUID // 5AE3F37E-4EAE-41AE-8240-35465B5E81EB ("\x7E\xF3\xE3\x5A\xAE\x4E\xAE\x41\x82\x40\x35\x46\x5B\x5E\x81\xEB", 16); // EDK2 DXE core file extern const UByteArray EFI_DXE_CORE_GUID // D6A2CB7F-6A18-4E2F-B43B-9920A733700A ("\x7F\xCB\xA2\xD6\x18\x6A\x2F\x4E\xB4\x3B\x99\x20\xA7\x33\x70\x0A", 16); // GUIDs of GUID-defined sections extern const UByteArray EFI_GUIDED_SECTION_CRC32 // FC1BCDB0-7D31-49AA-936A-A4600D9DD083 ("\xB0\xCD\x1B\xFC\x31\x7D\xAA\x49\x93\x6A\xA4\x60\x0D\x9D\xD0\x83", 16); extern const UByteArray EFI_GUIDED_SECTION_TIANO // A31280AD-481E-41B6-95E8-127F4C984779 ("\xAD\x80\x12\xA3\x1E\x48\xB6\x41\x95\xE8\x12\x7F\x4C\x98\x47\x79", 16); extern const UByteArray EFI_GUIDED_SECTION_LZMA // EE4E5898-3914-4259-9D6E-DC7BD79403CF ("\x98\x58\x4E\xEE\x14\x39\x59\x42\x9D\x6E\xDC\x7B\xD7\x94\x03\xCF", 16); extern const UByteArray EFI_GUIDED_SECTION_LZMA_HP // 0ED85E23-F253-413F-A03C-901987B04397 ("\x23\x5E\xD8\x0E\x53\xF2\x3F\x41\xA0\x3C\x90\x19\x87\xB0\x43\x97", 16); extern const UByteArray EFI_GUIDED_SECTION_LZMAF86 // D42AE6BD-1352-4BFB-909A-CA72A6EAE889 ("\xBD\xE6\x2A\xD4\x52\x13\xFB\x4B\x90\x9A\xCA\x72\xA6\xEA\xE8\x89", 16); extern const UByteArray EFI_GUIDED_SECTION_GZIP // 1D301FE9-BE79-4353-91C2-D23BC959AE0C ("\xE9\x1F\x30\x1D\x79\xBE\x53\x43\x91\xC2\xD2\x3B\xC9\x59\xAE\x0C", 16); extern const UByteArray EFI_GUIDED_SECTION_ZLIB_AMD // CE3233F5-2CD6-4D87-9152-4A238BB6D1C4 ("\xF5\x33\x32\xCE\xD6\x2C\x87\x4D\x91\x52\x4A\x23\x8B\xB6\xD1\xC4", 16); extern const UByteArray EFI_FIRMWARE_CONTENTS_SIGNED_GUID // 0F9D89E8-9259-4F76-A5AF-0C89E34023DF ("\xE8\x89\x9D\x0F\x59\x92\x76\x4F\xA5\xAF\x0C\x89\xE3\x40\x23\xDF", 16); extern const UByteArray EFI_CERT_TYPE_RSA2048_SHA256_GUID // A7717414-C616-4977-9420-844712A735BF ("\x14\x74\x71\xA7\x16\xC6\x77\x49\x94\x20\x84\x47\x12\xA7\x35\xBF"); extern const UByteArray EFI_HASH_ALGORITHM_SHA256_GUID // 51AA59DE-FDF2-4EA3-BC63-875FB7842EE9 ("\xde\x59\xAA\x51\xF2\xFD\xA3\x4E\xBC\x63\x87\x5F\xB7\x84\x2E\xE9"); // Protected range files extern const UByteArray PROTECTED_RANGE_VENDOR_HASH_FILE_GUID_PHOENIX // 389CC6F2-1EA8-467B-AB8A-78E769AE2A15 ("\xF2\xC6\x9C\x38\xA8\x1E\x7B\x46\xAB\x8A\x78\xE7\x69\xAE\x2A\x15", 16); extern const UByteArray PROTECTED_RANGE_VENDOR_HASH_FILE_GUID_AMI // CBC91F44-A4BC-4A5B-8696-703451D0B053 ("\x44\x1F\xC9\xCB\xBC\xA4\x5B\x4A\x86\x96\x70\x34\x51\xD0\xB0\x53", 16); // AMI ROM Hole files extern const UByteArray AMI_ROM_HOLE_FILE_GUID_0 //05CA01FC-0FC1-11DC-9011-00173153EBA8 ("\xFC\x01\xCA\x05\xC1\x0F\xDC\x11\x90\x11\x00\x17\x31\x53\xEB\xA8", 16); extern const UByteArray AMI_ROM_HOLE_FILE_GUID_1 //05CA01FD-0FC1-11DC-9011-00173153EBA8 ("\xFD\x01\xCA\x05\xC1\x0F\xDC\x11\x90\x11\x00\x17\x31\x53\xEB\xA8", 16); extern const UByteArray AMI_ROM_HOLE_FILE_GUID_2 //05CA01FE-0FC1-11DC-9011-00173153EBA8 ("\xFE\x01\xCA\x05\xC1\x0F\xDC\x11\x90\x11\x00\x17\x31\x53\xEB\xA8", 16); extern const UByteArray AMI_ROM_HOLE_FILE_GUID_3 //05CA01FF-0FC1-11DC-9011-00173153EBA8 ("\xFF\x01\xCA\x05\xC1\x0F\xDC\x11\x90\x11\x00\x17\x31\x53\xEB\xA8", 16); extern const UByteArray AMI_ROM_HOLE_FILE_GUID_4 //05CA0200-0FC1-11DC-9011-00173153EBA8 ("\x00\x02\xCA\x05\xC1\x0F\xDC\x11\x90\x11\x00\x17\x31\x53\xEB\xA8", 16); extern const UByteArray AMI_ROM_HOLE_FILE_GUID_5 //05CA0201-0FC1-11DC-9011-00173153EBA8 ("\x01\x02\xCA\x05\xC1\x0F\xDC\x11\x90\x11\x00\x17\x31\x53\xEB\xA8", 16); extern const UByteArray AMI_ROM_HOLE_FILE_GUID_6 //05CA0202-0FC1-11DC-9011-00173153EBA8 ("\x02\x02\xCA\x05\xC1\x0F\xDC\x11\x90\x11\x00\x17\x31\x53\xEB\xA8", 16); extern const UByteArray AMI_ROM_HOLE_FILE_GUID_7 //05CA0203-0FC1-11DC-9011-00173153EBA8 ("\x03\x02\xCA\x05\xC1\x0F\xDC\x11\x90\x11\x00\x17\x31\x53\xEB\xA8", 16); extern const UByteArray AMI_ROM_HOLE_FILE_GUID_8 //05CA0204-0FC1-11DC-9011-00173153EBA8 ("\x04\x02\xCA\x05\xC1\x0F\xDC\x11\x90\x11\x00\x17\x31\x53\xEB\xA8", 16); extern const UByteArray AMI_ROM_HOLE_FILE_GUID_9 //05CA0205-0FC1-11DC-9011-00173153EBA8 ("\x05\x02\xCA\x05\xC1\x0F\xDC\x11\x90\x11\x00\x17\x31\x53\xEB\xA8", 16); extern const UByteArray AMI_ROM_HOLE_FILE_GUID_10 //05CA0206-0FC1-11DC-9011-00173153EBA8 ("\x06\x02\xCA\x05\xC1\x0F\xDC\x11\x90\x11\x00\x17\x31\x53\xEB\xA8", 16); extern const UByteArray AMI_ROM_HOLE_FILE_GUID_11 //05CA0207-0FC1-11DC-9011-00173153EBA8 ("\x07\x02\xCA\x05\xC1\x0F\xDC\x11\x90\x11\x00\x17\x31\x53\xEB\xA8", 16); extern const UByteArray AMI_ROM_HOLE_FILE_GUID_12 //05CA0208-0FC1-11DC-9011-00173153EBA8 ("\x08\x02\xCA\x05\xC1\x0F\xDC\x11\x90\x11\x00\x17\x31\x53\xEB\xA8", 16); extern const UByteArray AMI_ROM_HOLE_FILE_GUID_13 //05CA0209-0FC1-11DC-9011-00173153EBA8 ("\x09\x02\xCA\x05\xC1\x0F\xDC\x11\x90\x11\x00\x17\x31\x53\xEB\xA8", 16); extern const UByteArray AMI_ROM_HOLE_FILE_GUID_14 //05CA020A-0FC1-11DC-9011-00173153EBA8 ("\x0A\x02\xCA\x05\xC1\x0F\xDC\x11\x90\x11\x00\x17\x31\x53\xEB\xA8", 16); extern const UByteArray AMI_ROM_HOLE_FILE_GUID_15 //05CA020B-0FC1-11DC-9011-00173153EBA8 ("\x0B\x02\xCA\x05\xC1\x0F\xDC\x11\x90\x11\x00\x17\x31\x53\xEB\xA8", 16); const std::vector FFSv2Volumes({ EFI_FIRMWARE_FILE_SYSTEM_GUID, EFI_FIRMWARE_FILE_SYSTEM2_GUID, EFI_APPLE_AUTHENTICATION_FV_GUID, EFI_APPLE_IMMUTABLE_FV_GUID, EFI_INTEL_FILE_SYSTEM_GUID, EFI_INTEL_FILE_SYSTEM2_GUID, EFI_SONY_FILE_SYSTEM_GUID }); const std::vector FFSv3Volumes({EFI_FIRMWARE_FILE_SYSTEM3_GUID}); const UINT8 ffsAlignmentTable[] = { 0, 4, 7, 9, 10, 12, 15, 16 }; const UINT8 ffsAlignment2Table[] = { 17, 18, 19, 20, 21, 22, 23, 24 }; extern const UByteArray RECOVERY_STARTUP_AP_DATA_X86_128K // jmp far F000:FFD0, EAD0FF00F0 ("\xEA\xD0\xFF\x00\xF0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x27\x2D", RECOVERY_STARTUP_AP_DATA_X86_SIZE); VOID uint32ToUint24(UINT32 size, UINT8* ffsSize) { ffsSize[2] = (UINT8)((size) >> 16U); ffsSize[1] = (UINT8)((size) >> 8U); ffsSize[0] = (UINT8)((size)); } UINT32 uint24ToUint32(const UINT8* ffsSize) { return (UINT32) ffsSize[0] + ((UINT32) ffsSize[1] << 8U) + ((UINT32) ffsSize[2] << 16U); } UString guidToUString(const EFI_GUID & guid, bool convertToString) { if (convertToString) { UString readableName = guidDatabaseLookup(guid); if (!readableName.isEmpty()) return readableName; } return usprintf("%08X-%04X-%04X-%02X%02X-%02X%02X%02X%02X%02X%02X", guid.Data1, guid.Data2, guid.Data3, guid.Data4[0], guid.Data4[1], guid.Data4[2], guid.Data4[3], guid.Data4[4], guid.Data4[5], guid.Data4[6], guid.Data4[7]); } bool ustringToGuid(const UString & str, EFI_GUID & guid) { unsigned long p0; unsigned p1, p2, p3, p4, p5, p6, p7, p8, p9, p10; int err = std::sscanf(str.toLocal8Bit(), "%08lX-%04X-%04X-%02X%02X-%02X%02X%02X%02X%02X%02X", &p0, &p1, &p2, &p3, &p4, &p5, &p6, &p7, &p8, &p9, &p10); if (err == 0) return false; guid.Data1 = (UINT32)p0; guid.Data2 = (UINT16)p1; guid.Data3 = (UINT16)p2; guid.Data4[0] = (UINT8)p3; guid.Data4[1] = (UINT8)p4; guid.Data4[2] = (UINT8)p5; guid.Data4[3] = (UINT8)p6; guid.Data4[4] = (UINT8)p7; guid.Data4[5] = (UINT8)p8; guid.Data4[6] = (UINT8)p9; guid.Data4[7] = (UINT8)p10; return true; } UString fileTypeToUString(const UINT8 type) { switch (type) { case EFI_FV_FILETYPE_RAW: return UString("Raw"); case EFI_FV_FILETYPE_FREEFORM: return UString("Freeform"); case EFI_FV_FILETYPE_SECURITY_CORE: return UString("SEC core"); case EFI_FV_FILETYPE_PEI_CORE: return UString("PEI core"); case EFI_FV_FILETYPE_DXE_CORE: return UString("DXE core"); case EFI_FV_FILETYPE_PEIM: return UString("PEI module"); case EFI_FV_FILETYPE_DRIVER: return UString("DXE driver"); case EFI_FV_FILETYPE_COMBINED_PEIM_DRIVER: return UString("Combined PEI/DXE"); case EFI_FV_FILETYPE_APPLICATION: return UString("Application"); case EFI_FV_FILETYPE_MM: return UString("SMM module"); case EFI_FV_FILETYPE_FIRMWARE_VOLUME_IMAGE: return UString("Volume image"); case EFI_FV_FILETYPE_COMBINED_MM_DXE: return UString("Combined SMM/DXE"); case EFI_FV_FILETYPE_MM_CORE: return UString("SMM core"); case EFI_FV_FILETYPE_MM_STANDALONE: return UString("MM standalone module"); case EFI_FV_FILETYPE_MM_CORE_STANDALONE: return UString("MM standalone core"); case EFI_FV_FILETYPE_PAD: return UString("Pad"); }; return usprintf("Unknown %02Xh", type); } UString sectionTypeToUString(const UINT8 type) { switch (type) { case EFI_SECTION_COMPRESSION: return UString("Compressed"); case EFI_SECTION_GUID_DEFINED: return UString("GUID defined"); case EFI_SECTION_DISPOSABLE: return UString("Disposable"); case EFI_SECTION_PE32: return UString("PE32 image"); case EFI_SECTION_PIC: return UString("PIC image"); case EFI_SECTION_TE: return UString("TE image"); case EFI_SECTION_DXE_DEPEX: return UString("DXE dependency"); case EFI_SECTION_VERSION: return UString("Version"); case EFI_SECTION_USER_INTERFACE: return UString("UI"); case EFI_SECTION_COMPATIBILITY16: return UString("16-bit image"); case EFI_SECTION_FIRMWARE_VOLUME_IMAGE: return UString("Volume image"); case EFI_SECTION_FREEFORM_SUBTYPE_GUID: return UString("Freeform subtype GUID"); case EFI_SECTION_RAW: return UString("Raw"); case EFI_SECTION_PEI_DEPEX: return UString("PEI dependency"); case EFI_SECTION_MM_DEPEX: return UString("MM dependency"); case INSYDE_SECTION_POSTCODE: return UString("Insyde postcode"); case PHOENIX_SECTION_POSTCODE: return UString("Phoenix postcode"); } return usprintf("Unknown %02Xh", type); } UString bpdtEntryTypeToUString(const UINT16 type) { switch (type) { case BPDT_ENTRY_TYPE_SMIP: return UString("OEM SMIP"); case BPDT_ENTRY_TYPE_RBEP: return UString("ROM Boot Extensions"); case BPDT_ENTRY_TYPE_FTPR: return UString("Bring Up"); case BPDT_ENTRY_TYPE_UCOD: return UString("Microcode"); case BPDT_ENTRY_TYPE_IBBP: return UString("IBB"); case BPDT_ENTRY_TYPE_S_BPDT: return UString("Secondary BPDT"); case BPDT_ENTRY_TYPE_OBBP: return UString("OBB"); case BPDT_ENTRY_TYPE_NFTP: return UString("Main"); case BPDT_ENTRY_TYPE_ISHC: return UString("ISH"); case BPDT_ENTRY_TYPE_DLMP: return UString("Debug Launch Module"); case BPDT_ENTRY_TYPE_UEBP: return UString("IFP Bypass"); case BPDT_ENTRY_TYPE_UTOK: return UString("Debug Tokens"); case BPDT_ENTRY_TYPE_UFS_PHY: return UString("UFS PHY Config"); case BPDT_ENTRY_TYPE_UFS_GPP_LUN: return UString("UFS GPP LUN"); case BPDT_ENTRY_TYPE_PMCP: return UString("PMC"); case BPDT_ENTRY_TYPE_IUNP: return UString("iUnit"); case BPDT_ENTRY_TYPE_NVMC: return UString("NVM Config"); case BPDT_ENTRY_TYPE_UEP: return UString("Unified Emulation"); case BPDT_ENTRY_TYPE_WCOD: return UString("WLAN Microcode"); case BPDT_ENTRY_TYPE_LOCL: return UString("LOCL Sprites"); case BPDT_ENTRY_TYPE_OEMP: return UString("OEM Key Manifest"); case BPDT_ENTRY_TYPE_FITC: return UString("fitc.cfg"); case BPDT_ENTRY_TYPE_PAVP: return UString("PAVP"); case BPDT_ENTRY_TYPE_IOMP: return UString("TCSS FW IOM"); case BPDT_ENTRY_TYPE_XPHY: return UString("TCSS FW PHY"); case BPDT_ENTRY_TYPE_TBTP: return UString("TCSS TBT"); case BPDT_ENTRY_TYPE_PLTS: return UString("Platform Settings"); case BPDT_ENTRY_TYPE_RES27: return UString("Reserved 27"); case BPDT_ENTRY_TYPE_RES28: return UString("Reserved 28"); case BPDT_ENTRY_TYPE_RES29: return UString("Reserved 29"); case BPDT_ENTRY_TYPE_RES30: return UString("Reserved 30"); case BPDT_ENTRY_TYPE_DPHY: return UString("Dekel PHY"); case BPDT_ENTRY_TYPE_PCHC: return UString("PCH Config"); case BPDT_ENTRY_TYPE_ISIF: return UString("ISI FW"); case BPDT_ENTRY_TYPE_ISIC: return UString("ISI Config"); case BPDT_ENTRY_TYPE_HBMI: return UString("HBM IO"); case BPDT_ENTRY_TYPE_OMSM: return UString("OOB MSM"); case BPDT_ENTRY_TYPE_GTGP: return UString("GT-GPU"); case BPDT_ENTRY_TYPE_MDFI: return UString("MDF IO"); case BPDT_ENTRY_TYPE_PUNP: return UString("PUnit"); case BPDT_ENTRY_TYPE_PHYP: return UString("GSC PHY"); case BPDT_ENTRY_TYPE_SAMF: return UString("SAM FW"); case BPDT_ENTRY_TYPE_PPHY: return UString("PPHY"); case BPDT_ENTRY_TYPE_GBST: return UString("GBST"); case BPDT_ENTRY_TYPE_TCCP: return UString("TCC"); case BPDT_ENTRY_TYPE_PSEP: return UString("PSE"); } return usprintf("Unknown %04Xh", type); } UString cpdExtensionTypeToUstring(const UINT32 type) { switch (type) { case CPD_EXT_TYPE_SYSTEM_INFO: return UString("System Info"); case CPD_EXT_TYPE_INIT_SCRIPT: return UString("Init Script"); case CPD_EXT_TYPE_FEATURE_PERMISSIONS: return UString("Feature Permissions"); case CPD_EXT_TYPE_PARTITION_INFO: return UString("Partition Info"); case CPD_EXT_TYPE_SHARED_LIB_ATTRIBUTES: return UString("Shared Lib Attributes"); case CPD_EXT_TYPE_PROCESS_ATTRIBUTES: return UString("Process Attributes"); case CPD_EXT_TYPE_THREAD_ATTRIBUTES: return UString("Thread Attributes"); case CPD_EXT_TYPE_DEVICE_TYPE: return UString("Device Type"); case CPD_EXT_TYPE_MMIO_RANGE: return UString("MMIO Range"); case CPD_EXT_TYPE_SPEC_FILE_PRODUCER: return UString("Spec File Producer"); case CPD_EXT_TYPE_MODULE_ATTRIBUTES: return UString("Module Attributes"); case CPD_EXT_TYPE_LOCKED_RANGES: return UString("Locked Ranges"); case CPD_EXT_TYPE_CLIENT_SYSTEM_INFO: return UString("Client System Info"); case CPD_EXT_TYPE_USER_INFO: return UString("User Info"); case CPD_EXT_TYPE_KEY_MANIFEST: return UString("Key Manifest"); case CPD_EXT_TYPE_SIGNED_PACKAGE_INFO: return UString("Signed Package Info"); case CPD_EXT_TYPE_ANTI_CLONING_SKU_ID: return UString("Anti-cloning SKU ID"); case CPD_EXT_TYPE_CAVS: return UString("cAVS"); case CPD_EXT_TYPE_IMR_INFO: return UString("IMR Info"); case CPD_EXT_TYPE_RCIP_INFO: return UString("RCIP Info"); case CPD_EXT_TYPE_BOOT_POLICY: return UString("Boot Policy"); case CPD_EXT_TYPE_SECURE_TOKEN: return UString("Secure Token"); case CPD_EXT_TYPE_IFWI_PARTITION_MANIFEST: return UString("IFWI Partition Manifest"); case CPD_EXT_TYPE_FD_HASH: return UString("FD Hash"); case CPD_EXT_TYPE_IOM_METADATA: return UString("IOM Metadata"); case CPD_EXT_TYPE_MGP_METADATA: return UString("MGP Metadata"); case CPD_EXT_TYPE_TBT_METADATA: return UString("TBT Metadata"); case CPD_EXT_TYPE_GMF_CERTIFICATE: return UString("Golden Measurement File Certificate"); case CPD_EXT_TYPE_GMF_BODY: return UString("Golden Measurement File Body"); case CPD_EXT_TYPE_KEY_MANIFEST_EXT: return UString("Extended Key Manifest"); case CPD_EXT_TYPE_SIGNED_PACKAGE_INFO_EXT: return UString("Extended Signed Package Info"); case CPD_EXT_TYPE_SPS_PLATFORM_ID: return UString("SPS Platform ID"); } return usprintf("Unknown %08Xh", type); } UEFITool-A66/common/ffs.h000066400000000000000000000763441442134156300152360ustar00rootroot00000000000000/* ffs.h Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHWARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef FFS_H #define FFS_H #include #include "basetypes.h" #include "ubytearray.h" #include "ustring.h" // Make sure we use right packing rules #pragma pack(push,1) extern UString guidToUString(const EFI_GUID& guid, bool convertToString = true); extern bool ustringToGuid(const UString& str, EFI_GUID& guid); extern UString fileTypeToUString(const UINT8 type); extern UString sectionTypeToUString(const UINT8 type); extern UString bpdtEntryTypeToUString(const UINT16 type); extern UString cpdExtensionTypeToUstring(const UINT32 type); //***************************************************************************** // EFI Capsule //***************************************************************************** // Capsule header typedef struct EFI_CAPSULE_HEADER_ { EFI_GUID CapsuleGuid; UINT32 HeaderSize; UINT32 Flags; UINT32 CapsuleImageSize; } EFI_CAPSULE_HEADER; // Capsule flags #define EFI_CAPSULE_HEADER_FLAG_SETUP 0x00000001 #define EFI_CAPSULE_HEADER_FLAG_PERSIST_ACROSS_RESET 0x00010000 #define EFI_CAPSULE_HEADER_FLAG_POPULATE_SYSTEM_TABLE 0x00020000 // Standard FMP capsule GUID extern const UByteArray EFI_FMP_CAPSULE_GUID; // 6DCBD5ED-E82D-4C44-BDA1-7194199AD92A // Standard EFI capsule GUID extern const UByteArray EFI_CAPSULE_GUID; // 3B6686BD-0D76-4030-B70E-B5519E2FC5A0 // Intel capsule GUID extern const UByteArray INTEL_CAPSULE_GUID; // 539182B9-ABB5-4391-B69A-E3A943F72FCC // Lenovo capsule GUID extern const UByteArray LENOVO_CAPSULE_GUID; // E20BAFD3-9914-4F4F-9537-3129E090EB3C // Another Lenovo capsule GUID extern const UByteArray LENOVO2_CAPSULE_GUID; // 25B5FE76-8243-4A5C-A9BD-7EE3246198B5 // Toshiba EFI Capsule header typedef struct TOSHIBA_CAPSULE_HEADER_ { EFI_GUID CapsuleGuid; UINT32 HeaderSize; UINT32 FullSize; UINT32 Flags; } TOSHIBA_CAPSULE_HEADER; // Toshiba capsule GUID extern const UByteArray TOSHIBA_CAPSULE_GUID; // 3BE07062-1D51-45D2-832B-F093257ED461 // AMI Aptio extended capsule header typedef struct APTIO_CAPSULE_HEADER_ { EFI_CAPSULE_HEADER CapsuleHeader; UINT16 RomImageOffset; // offset in bytes from the beginning of the capsule header to the start of the capsule volume UINT16 RomLayoutOffset; // offset to the table of the module descriptors in the capsule's volume that are included in the signature calculation //FW_CERTIFICATE FWCert; //ROM_AREA RomAreaMap[]; } APTIO_CAPSULE_HEADER; // AMI Aptio signed extended capsule GUID extern const UByteArray APTIO_SIGNED_CAPSULE_GUID; // 4A3CA68B-7723-48FB-803D-578CC1FEC44D // AMI Aptio unsigned extended capsule GUID extern const UByteArray APTIO_UNSIGNED_CAPSULE_GUID; // 14EEBB90-890A-43DB-AED1-5D3C4588A418 //***************************************************************************** // EFI Firmware Volume //***************************************************************************** // Firmware block map entry // FvBlockMap ends with an entry {0x00000000, 0x00000000} typedef struct EFI_FV_BLOCK_MAP_ENTRY_ { UINT32 NumBlocks; UINT32 Length; } EFI_FV_BLOCK_MAP_ENTRY; // Volume header typedef struct EFI_FIRMWARE_VOLUME_HEADER_ { UINT8 ZeroVector[16]; EFI_GUID FileSystemGuid; UINT64 FvLength; UINT32 Signature; UINT32 Attributes; UINT16 HeaderLength; UINT16 Checksum; UINT16 ExtHeaderOffset; //Reserved in Revision 1 UINT8 Reserved; UINT8 Revision; //EFI_FV_BLOCK_MAP_ENTRY FvBlockMap[2]; } EFI_FIRMWARE_VOLUME_HEADER; // Standard file system GUIDs extern const UByteArray EFI_FIRMWARE_FILE_SYSTEM_GUID; // 7A9354D9-0468-444A-81CE-0BF617D890DF extern const UByteArray EFI_FIRMWARE_FILE_SYSTEM2_GUID; // 8C8CE578-8A3D-4F1C-9935-896185C32DD3 extern const UByteArray EFI_FIRMWARE_FILE_SYSTEM3_GUID; // 5473C07A-3DCB-4DCA-BD6F-1E9689E7349A // Vendor-specific file system GUIDs extern const UByteArray EFI_APPLE_IMMUTABLE_FV_GUID; // 04ADEEAD-61FF-4D31-B6BA-64F8BF901F5A extern const UByteArray EFI_APPLE_AUTHENTICATION_FV_GUID; // BD001B8C-6A71-487B-A14F-0C2A2DCF7A5D extern const UByteArray EFI_APPLE_MICROCODE_VOLUME_GUID; // 153D2197-29BD-44DC-AC59-887F70E41A6B #define EFI_APPLE_MICROCODE_VOLUME_HEADER_SIZE 0x100 extern const UByteArray EFI_INTEL_FILE_SYSTEM_GUID; // AD3FFFFF-D28B-44C4-9F13-9EA98A97F9F0 extern const UByteArray EFI_INTEL_FILE_SYSTEM2_GUID; // D6A1CD70-4B33-4994-A6EA-375F2CCC5437 extern const UByteArray EFI_SONY_FILE_SYSTEM_GUID; // 4F494156-AED6-4D64-A537-B8A5557BCEEC // Vector of volume GUIDs with FFSv2-compatible files extern const std::vector FFSv2Volumes; // Vector of volume GUIDs with FFSv3-compatible files extern const std::vector FFSv3Volumes; // Firmware volume signature #define EFI_FV_SIGNATURE 0x4856465F // _FVH #define EFI_FV_SIGNATURE_OFFSET 0x28 // Firmware volume attributes // Revision 1 #define EFI_FVB_READ_DISABLED_CAP 0x00000001 #define EFI_FVB_READ_ENABLED_CAP 0x00000002 #define EFI_FVB_READ_STATUS 0x00000004 #define EFI_FVB_WRITE_DISABLED_CAP 0x00000008 #define EFI_FVB_WRITE_ENABLED_CAP 0x00000010 #define EFI_FVB_WRITE_STATUS 0x00000020 #define EFI_FVB_LOCK_CAP 0x00000040 #define EFI_FVB_LOCK_STATUS 0x00000080 #define EFI_FVB_STICKY_WRITE 0x00000200 #define EFI_FVB_MEMORY_MAPPED 0x00000400 #define EFI_FVB_ERASE_POLARITY 0x00000800 #define EFI_FVB_ALIGNMENT_CAP 0x00008000 #define EFI_FVB_ALIGNMENT_2 0x00010000 #define EFI_FVB_ALIGNMENT_4 0x00020000 #define EFI_FVB_ALIGNMENT_8 0x00040000 #define EFI_FVB_ALIGNMENT_16 0x00080000 #define EFI_FVB_ALIGNMENT_32 0x00100000 #define EFI_FVB_ALIGNMENT_64 0x00200000 #define EFI_FVB_ALIGNMENT_128 0x00400000 #define EFI_FVB_ALIGNMENT_256 0x00800000 #define EFI_FVB_ALIGNMENT_512 0x01000000 #define EFI_FVB_ALIGNMENT_1K 0x02000000 #define EFI_FVB_ALIGNMENT_2K 0x04000000 #define EFI_FVB_ALIGNMENT_4K 0x08000000 #define EFI_FVB_ALIGNMENT_8K 0x10000000 #define EFI_FVB_ALIGNMENT_16K 0x20000000 #define EFI_FVB_ALIGNMENT_32K 0x40000000 #define EFI_FVB_ALIGNMENT_64K 0x80000000 // Revision 2 #define EFI_FVB2_READ_DISABLED_CAP 0x00000001 #define EFI_FVB2_READ_ENABLED_CAP 0x00000002 #define EFI_FVB2_READ_STATUS 0x00000004 #define EFI_FVB2_WRITE_DISABLED_CAP 0x00000008 #define EFI_FVB2_WRITE_ENABLED_CAP 0x00000010 #define EFI_FVB2_WRITE_STATUS 0x00000020 #define EFI_FVB2_LOCK_CAP 0x00000040 #define EFI_FVB2_LOCK_STATUS 0x00000080 #define EFI_FVB2_STICKY_WRITE 0x00000200 #define EFI_FVB2_MEMORY_MAPPED 0x00000400 #define EFI_FVB2_ERASE_POLARITY 0x00000800 #define EFI_FVB2_READ_LOCK_CAP 0x00001000 #define EFI_FVB2_READ_LOCK_STATUS 0x00002000 #define EFI_FVB2_WRITE_LOCK_CAP 0x00004000 #define EFI_FVB2_WRITE_LOCK_STATUS 0x00008000 #define EFI_FVB2_ALIGNMENT 0x001F0000 #define EFI_FVB2_ALIGNMENT_1 0x00000000 #define EFI_FVB2_ALIGNMENT_2 0x00010000 #define EFI_FVB2_ALIGNMENT_4 0x00020000 #define EFI_FVB2_ALIGNMENT_8 0x00030000 #define EFI_FVB2_ALIGNMENT_16 0x00040000 #define EFI_FVB2_ALIGNMENT_32 0x00050000 #define EFI_FVB2_ALIGNMENT_64 0x00060000 #define EFI_FVB2_ALIGNMENT_128 0x00070000 #define EFI_FVB2_ALIGNMENT_256 0x00080000 #define EFI_FVB2_ALIGNMENT_512 0x00090000 #define EFI_FVB2_ALIGNMENT_1K 0x000A0000 #define EFI_FVB2_ALIGNMENT_2K 0x000B0000 #define EFI_FVB2_ALIGNMENT_4K 0x000C0000 #define EFI_FVB2_ALIGNMENT_8K 0x000D0000 #define EFI_FVB2_ALIGNMENT_16K 0x000E0000 #define EFI_FVB2_ALIGNMENT_32K 0x000F0000 #define EFI_FVB2_ALIGNMENT_64K 0x00100000 #define EFI_FVB2_ALIGNMENT_128K 0x00110000 #define EFI_FVB2_ALIGNMENT_256K 0x00120000 #define EFI_FVB2_ALIGNMENT_512K 0x00130000 #define EFI_FVB2_ALIGNMENT_1M 0x00140000 #define EFI_FVB2_ALIGNMENT_2M 0x00150000 #define EFI_FVB2_ALIGNMENT_4M 0x00160000 #define EFI_FVB2_ALIGNMENT_8M 0x00170000 #define EFI_FVB2_ALIGNMENT_16M 0x00180000 #define EFI_FVB2_ALIGNMENT_32M 0x00190000 #define EFI_FVB2_ALIGNMENT_64M 0x001A0000 #define EFI_FVB2_ALIGNMENT_128M 0x001B0000 #define EFI_FVB2_ALIGNMENT_256M 0x001C0000 #define EFI_FVB2_ALIGNMENT_512M 0x001D0000 #define EFI_FVB2_ALIGNMENT_1G 0x001E0000 #define EFI_FVB2_ALIGNMENT_2G 0x001F0000 #define EFI_FVB2_WEAK_ALIGNMENT 0x80000000 // Extended firmware volume header typedef struct EFI_FIRMWARE_VOLUME_EXT_HEADER_ { EFI_GUID FvName; UINT32 ExtHeaderSize; } EFI_FIRMWARE_VOLUME_EXT_HEADER; // Extended header entry // The extended header entries follow each other and are // terminated by ExtHeaderType EFI_FV_EXT_TYPE_END #define EFI_FV_EXT_TYPE_END 0x0000 typedef struct EFI_FIRMWARE_VOLUME_EXT_ENTRY_ { UINT16 ExtEntrySize; UINT16 ExtEntryType; } EFI_FIRMWARE_VOLUME_EXT_ENTRY; // GUID that maps OEM file types to GUIDs #define EFI_FV_EXT_TYPE_OEM_TYPE 0x0001 typedef struct EFI_FIRMWARE_VOLUME_EXT_HEADER_OEM_TYPE_ { EFI_FIRMWARE_VOLUME_EXT_ENTRY Header; UINT32 TypeMask; //EFI_GUID Types[]; } EFI_FIRMWARE_VOLUME_EXT_HEADER_OEM_TYPE; #define EFI_FV_EXT_TYPE_GUID_TYPE 0x0002 typedef struct EFI_FIRMWARE_VOLUME_EXT_ENTRY_GUID_TYPE_ { EFI_FIRMWARE_VOLUME_EXT_ENTRY Header; EFI_GUID FormatType; //UINT8 Data[]; } EFI_FIRMWARE_VOLUME_EXT_ENTRY_GUID_TYPE; //***************************************************************************** // EFI FFS File //***************************************************************************** // Integrity check typedef union { struct { UINT8 Header; UINT8 File; } Checksum; UINT16 TailReference; // Revision 1 UINT16 Checksum16; // Revision 2 } EFI_FFS_INTEGRITY_CHECK; // File header typedef struct EFI_FFS_FILE_HEADER_ { EFI_GUID Name; EFI_FFS_INTEGRITY_CHECK IntegrityCheck; UINT8 Type; UINT8 Attributes; UINT8 Size[3]; UINT8 State; } EFI_FFS_FILE_HEADER; // Large file header typedef struct EFI_FFS_FILE_HEADER2_ { EFI_GUID Name; EFI_FFS_INTEGRITY_CHECK IntegrityCheck; UINT8 Type; UINT8 Attributes; UINT8 Size[3]; // Set to 0xFFFFFF or 0x000000 UINT8 State; UINT64 ExtendedSize; } EFI_FFS_FILE_HEADER2; // Lenovo large file header typedef struct EFI_FFS_FILE_HEADER2_LENOVO_ { EFI_GUID Name; EFI_FFS_INTEGRITY_CHECK IntegrityCheck; UINT8 Type; UINT8 Attributes; UINT8 Size[3]; // Set to 0x000000 UINT8 State; UINT32 ExtendedSize; } EFI_FFS_FILE_HEADER2_LENOVO; // Standard data checksum, used if FFS_ATTRIB_CHECKSUM is clear #define FFS_FIXED_CHECKSUM 0x5A #define FFS_FIXED_CHECKSUM2 0xAA // File types #define EFI_FV_FILETYPE_ALL 0x00 #define EFI_FV_FILETYPE_RAW 0x01 #define EFI_FV_FILETYPE_FREEFORM 0x02 #define EFI_FV_FILETYPE_SECURITY_CORE 0x03 #define EFI_FV_FILETYPE_PEI_CORE 0x04 #define EFI_FV_FILETYPE_DXE_CORE 0x05 #define EFI_FV_FILETYPE_PEIM 0x06 #define EFI_FV_FILETYPE_DRIVER 0x07 #define EFI_FV_FILETYPE_COMBINED_PEIM_DRIVER 0x08 #define EFI_FV_FILETYPE_APPLICATION 0x09 #define EFI_FV_FILETYPE_MM 0x0A #define EFI_FV_FILETYPE_FIRMWARE_VOLUME_IMAGE 0x0B #define EFI_FV_FILETYPE_COMBINED_MM_DXE 0x0C #define EFI_FV_FILETYPE_MM_CORE 0x0D #define EFI_FV_FILETYPE_MM_STANDALONE 0x0E #define EFI_FV_FILETYPE_MM_CORE_STANDALONE 0x0F #define EFI_FV_FILETYPE_OEM_MIN 0xC0 #define EFI_FV_FILETYPE_OEM_MAX 0xDF #define EFI_FV_FILETYPE_DEBUG_MIN 0xE0 #define EFI_FV_FILETYPE_DEBUG_MAX 0xEF #define EFI_FV_FILETYPE_PAD 0xF0 #define EFI_FV_FILETYPE_FFS_MIN 0xF0 #define EFI_FV_FILETYPE_FFS_MAX 0xFF // File attributes #define FFS_ATTRIB_TAIL_PRESENT 0x01 // Valid only for revision 1 volumes #define FFS_ATTRIB_RECOVERY 0x02 // Valid only for revision 1 volumes #define FFS_ATTRIB_LARGE_FILE 0x01 // Valid only for FFSv3 volumes or FFSv2 volumes with Lenovo large files #define FFS_ATTRIB_DATA_ALIGNMENT2 0x02 // Valid only for revision 2 volumes, added in UEFI PI 1.6 #define FFS_ATTRIB_FIXED 0x04 #define FFS_ATTRIB_DATA_ALIGNMENT 0x38 #define FFS_ATTRIB_CHECKSUM 0x40 // FFS alignment table extern const UINT8 ffsAlignmentTable[]; // Extended FFS alignment table, added in UEFI PI 1.6 extern const UINT8 ffsAlignment2Table[]; // File states #define EFI_FILE_HEADER_CONSTRUCTION 0x01 #define EFI_FILE_HEADER_VALID 0x02 #define EFI_FILE_DATA_VALID 0x04 #define EFI_FILE_MARKED_FOR_UPDATE 0x08 #define EFI_FILE_DELETED 0x10 #define EFI_FILE_HEADER_INVALID 0x20 #define EFI_FILE_ERASE_POLARITY 0x80 // Defined as "all other bits must be set to ERASE_POLARITY" in UEFI PI // PEI apriori file extern const UByteArray EFI_PEI_APRIORI_FILE_GUID; // 1B45CC0A-156A-428A-AF62-49864DA0E6E6 // DXE apriori file extern const UByteArray EFI_DXE_APRIORI_FILE_GUID; // FC510EE7-FFDC-11D4-BD41-0080C73C8881 // Volume top file extern const UByteArray EFI_FFS_VOLUME_TOP_FILE_GUID; // 1BA0062E-C779-4582-8566-336AE8F78F09 // AMI padding file GUID extern const UByteArray EFI_FFS_PAD_FILE_GUID; // E4536585-7909-4A60-B5C6-ECDEA6EBFB5 // AMI DXE core file extern const UByteArray AMI_CORE_DXE_GUID; // 5AE3F37E-4EAE-41AE-8240-35465B5E81EB // EDK2 DXE core file extern const UByteArray EFI_DXE_CORE_GUID; // D6A2CB7F-6A18-4E2F-B43B-9920A733700A // FFS size conversion routines extern VOID uint32ToUint24(UINT32 size, UINT8* ffsSize); extern UINT32 uint24ToUint32(const UINT8* ffsSize); //***************************************************************************** // EFI FFS File Section //***************************************************************************** // Common section header typedef struct EFI_COMMON_SECTION_HEADER_ { UINT8 Size[3]; UINT8 Type; } EFI_COMMON_SECTION_HEADER; // Large file common section header typedef struct EFI_COMMON_SECTION_HEADER2_ { UINT8 Size[3]; // Must be 0xFFFFFF for this header to be used UINT8 Type; UINT32 ExtendedSize; } EFI_COMMON_SECTION_HEADER2; // Section2 usage indicator #define EFI_SECTION2_IS_USED 0xFFFFFF // File section types #define EFI_SECTION_ALL 0x00 // Impossible attribute for file in the FS // Encapsulation section types #define EFI_SECTION_COMPRESSION 0x01 #define EFI_SECTION_GUID_DEFINED 0x02 #define EFI_SECTION_DISPOSABLE 0x03 // Leaf section types #define EFI_SECTION_PE32 0x10 #define EFI_SECTION_PIC 0x11 #define EFI_SECTION_TE 0x12 #define EFI_SECTION_DXE_DEPEX 0x13 #define EFI_SECTION_VERSION 0x14 #define EFI_SECTION_USER_INTERFACE 0x15 #define EFI_SECTION_COMPATIBILITY16 0x16 #define EFI_SECTION_FIRMWARE_VOLUME_IMAGE 0x17 #define EFI_SECTION_FREEFORM_SUBTYPE_GUID 0x18 #define EFI_SECTION_RAW 0x19 #define EFI_SECTION_PEI_DEPEX 0x1B #define EFI_SECTION_MM_DEPEX 0x1C #define PHOENIX_SECTION_POSTCODE 0xF0 // Specific to Phoenix SCT images #define INSYDE_SECTION_POSTCODE 0x20 // Specific to Insyde H2O images // Compression section typedef struct EFI_COMPRESSION_SECTION_ { UINT32 UncompressedLength; UINT8 CompressionType; } EFI_COMPRESSION_SECTION; // Compression types #define EFI_NOT_COMPRESSED 0x00 #define EFI_STANDARD_COMPRESSION 0x01 #define EFI_CUSTOMIZED_COMPRESSION 0x02 #define EFI_CUSTOMIZED_COMPRESSION_LZMAF86 0x86 //GUID defined section typedef struct EFI_GUID_DEFINED_SECTION_ { EFI_GUID SectionDefinitionGuid; UINT16 DataOffset; UINT16 Attributes; } EFI_GUID_DEFINED_SECTION; // Attributes for GUID defined section #define EFI_GUIDED_SECTION_PROCESSING_REQUIRED 0x01 #define EFI_GUIDED_SECTION_AUTH_STATUS_VALID 0x02 // GUIDs of GUID-defined sections extern const UByteArray EFI_GUIDED_SECTION_CRC32; // FC1BCDB0-7D31-49AA-936A-A4600D9DD083 extern const UByteArray EFI_GUIDED_SECTION_TIANO; // A31280AD-481E-41B6-95E8-127F4C984779 extern const UByteArray EFI_GUIDED_SECTION_LZMA; // EE4E5898-3914-4259-9D6E-DC7BD79403CF extern const UByteArray EFI_GUIDED_SECTION_LZMA_HP; // 0ED85E23-F253-413F-A03C-901987B04397 extern const UByteArray EFI_GUIDED_SECTION_LZMAF86; // D42AE6BD-1352-4BFB-909A-CA72A6EAE889 extern const UByteArray EFI_GUIDED_SECTION_GZIP; // 1D301FE9-BE79-4353-91C2-D23BC959AE0C extern const UByteArray EFI_GUIDED_SECTION_ZLIB_AMD; // CE3233F5-2CD6-4D87-9152-4A238BB6D1C4 extern const UByteArray EFI_FIRMWARE_CONTENTS_SIGNED_GUID; // 0F9D89E8-9259-4F76-A5AF-0C89E34023DF #define WIN_CERT_TYPE_EFI_GUID 0x0EF1 // AMD Zlib-compressed section header typedef struct EFI_AMD_ZLIB_SECTION_HEADER_ { UINT8 ZeroHeader[0x14]; UINT32 CompressedSize; UINT8 ZeroFooter[0x100 - sizeof(UINT32) - 0x14]; //UINT8 CompressedData[] } EFI_AMD_ZLIB_SECTION_HEADER; typedef struct WIN_CERTIFICATE_ { UINT32 Length; UINT16 Revision; UINT16 CertificateType; //UINT8 CertData[]; } WIN_CERTIFICATE; typedef struct WIN_CERTIFICATE_UEFI_GUID_ { WIN_CERTIFICATE Header; // Standard WIN_CERTIFICATE EFI_GUID CertType; // Determines format of CertData // UINT8 CertData[]; // Certificate data follows } WIN_CERTIFICATE_UEFI_GUID; // WIN_CERTIFICATE_UEFI_GUID.CertType extern const UByteArray EFI_CERT_TYPE_RSA2048_SHA256_GUID; // A7717414-C616-4977-9420-844712A735BF // WIN_CERTIFICATE_UEFI_GUID.CertData typedef struct EFI_CERT_BLOCK_RSA2048_SHA256_ { EFI_GUID HashType; UINT8 PublicKey[256]; UINT8 Signature[256]; } EFI_CERT_BLOCK_RSA2048_SHA256; extern const UByteArray EFI_HASH_ALGORITHM_SHA256_GUID; // 51AA59DE-FDF2-4EA3-BC63-875FB7842EE9 // Version section typedef struct EFI_VERSION_SECTION_ { UINT16 BuildNumber; } EFI_VERSION_SECTION; // Freeform subtype GUID section typedef struct EFI_FREEFORM_SUBTYPE_GUID_SECTION_ { EFI_GUID SubTypeGuid; } EFI_FREEFORM_SUBTYPE_GUID_SECTION; // Phoenix SCT and Insyde postcode section typedef struct POSTCODE_SECTION_ { UINT32 Postcode; } POSTCODE_SECTION; //***************************************************************************** // EFI DXE Dependency Expression //***************************************************************************** #define EFI_DEP_OPCODE_SIZE 1 /// /// If present, this must be the first and only opcode, /// EFI_DEP_BEFORE is only used by DXE drivers /// #define EFI_DEP_BEFORE 0x00 /// /// If present, this must be the first and only opcode, /// EFI_DEP_AFTER is only used by DXE drivers /// #define EFI_DEP_AFTER 0x01 #define EFI_DEP_PUSH 0x02 #define EFI_DEP_AND 0x03 #define EFI_DEP_OR 0x04 #define EFI_DEP_NOT 0x05 #define EFI_DEP_TRUE 0x06 #define EFI_DEP_FALSE 0x07 #define EFI_DEP_END 0x08 /// /// If present, this must be the first opcode, /// EFI_DEP_SOR is only used by DXE drivers /// #define EFI_DEP_SOR 0x09 //***************************************************************************** // X86 Startup AP Data //***************************************************************************** #define RECOVERY_STARTUP_AP_DATA_X86_SIZE 0x10 extern const UByteArray RECOVERY_STARTUP_AP_DATA_X86_64K; extern const UByteArray RECOVERY_STARTUP_AP_DATA_X86_128K; //***************************************************************************** // X86 Reset Vector Data //***************************************************************************** typedef struct X86_RESET_VECTOR_DATA_ { UINT8 ApEntryVector[8]; // Base: 0xffffffd0 UINT8 Reserved0[8]; UINT32 PeiCoreEntryPoint; // Base: 0xffffffe0 UINT8 Reserved1[12]; UINT8 ResetVector[8]; // Base: 0xfffffff0 UINT32 ApStartupSegment; // Base: 0xfffffff8 UINT32 BootFvBaseAddress; // Base: 0xfffffffc } X86_RESET_VECTOR_DATA; #define X86_RESET_VECTOR_DATA_UNPOPULATED 0x12345678 //***************************************************************************** // IFWI //***************************************************************************** // BPDT #define BPDT_GREEN_SIGNATURE 0x000055AA #define BPDT_YELLOW_SIGNATURE 0x00AA55AA typedef struct BPDT_HEADER_ { UINT32 Signature; UINT16 NumEntries; UINT8 HeaderVersion; UINT8 RedundancyFlag; // Reserved zero in version 1 UINT32 Checksum; UINT32 IfwiVersion; UINT16 FitcMajor; UINT16 FitcMinor; UINT16 FitcHotfix; UINT16 FitcBuild; } BPDT_HEADER; #define BPDT_HEADER_VERSION_1 1 #define BPDT_HEADER_VERSION_2 2 typedef struct BPDT_ENTRY_ { UINT32 Type : 16; UINT32 SplitSubPartitionFirstPart : 1; UINT32 SplitSubPartitionSecondPart : 1; UINT32 CodeSubPartition : 1; UINT32 UmaCachable : 1; UINT32 Reserved: 12; UINT32 Offset; UINT32 Size; } BPDT_ENTRY; // https://github.com/platomav/MEAnalyzer/blob/master/MEA.py#L10595 #define BPDT_ENTRY_TYPE_SMIP 0 #define BPDT_ENTRY_TYPE_RBEP 1 #define BPDT_ENTRY_TYPE_FTPR 2 #define BPDT_ENTRY_TYPE_UCOD 3 #define BPDT_ENTRY_TYPE_IBBP 4 #define BPDT_ENTRY_TYPE_S_BPDT 5 #define BPDT_ENTRY_TYPE_OBBP 6 #define BPDT_ENTRY_TYPE_NFTP 7 #define BPDT_ENTRY_TYPE_ISHC 8 #define BPDT_ENTRY_TYPE_DLMP 9 #define BPDT_ENTRY_TYPE_UEBP 10 #define BPDT_ENTRY_TYPE_UTOK 11 #define BPDT_ENTRY_TYPE_UFS_PHY 12 #define BPDT_ENTRY_TYPE_UFS_GPP_LUN 13 #define BPDT_ENTRY_TYPE_PMCP 14 #define BPDT_ENTRY_TYPE_IUNP 15 #define BPDT_ENTRY_TYPE_NVMC 16 #define BPDT_ENTRY_TYPE_UEP 17 #define BPDT_ENTRY_TYPE_WCOD 18 #define BPDT_ENTRY_TYPE_LOCL 19 #define BPDT_ENTRY_TYPE_OEMP 20 #define BPDT_ENTRY_TYPE_FITC 21 #define BPDT_ENTRY_TYPE_PAVP 22 #define BPDT_ENTRY_TYPE_IOMP 23 #define BPDT_ENTRY_TYPE_XPHY 24 #define BPDT_ENTRY_TYPE_TBTP 25 #define BPDT_ENTRY_TYPE_PLTS 26 #define BPDT_ENTRY_TYPE_RES27 27 #define BPDT_ENTRY_TYPE_RES28 28 #define BPDT_ENTRY_TYPE_RES29 29 #define BPDT_ENTRY_TYPE_RES30 30 #define BPDT_ENTRY_TYPE_DPHY 31 #define BPDT_ENTRY_TYPE_PCHC 32 #define BPDT_ENTRY_TYPE_ISIF 33 #define BPDT_ENTRY_TYPE_ISIC 34 #define BPDT_ENTRY_TYPE_HBMI 35 #define BPDT_ENTRY_TYPE_OMSM 36 #define BPDT_ENTRY_TYPE_GTGP 37 #define BPDT_ENTRY_TYPE_MDFI 38 #define BPDT_ENTRY_TYPE_PUNP 39 #define BPDT_ENTRY_TYPE_PHYP 40 #define BPDT_ENTRY_TYPE_SAMF 41 #define BPDT_ENTRY_TYPE_PPHY 42 #define BPDT_ENTRY_TYPE_GBST 43 #define BPDT_ENTRY_TYPE_TCCP 44 #define BPDT_ENTRY_TYPE_PSEP 45 // CPD #define CPD_SIGNATURE 0x44504324 //$CPD typedef struct CPD_REV1_HEADER_ { UINT32 Signature; UINT32 NumEntries; UINT8 HeaderVersion; // 1 UINT8 EntryVersion; UINT8 HeaderLength; UINT8 HeaderChecksum; UINT8 ShortName[4]; } CPD_REV1_HEADER; typedef struct CPD_REV2_HEADER_ { UINT32 Signature; UINT32 NumEntries; UINT8 HeaderVersion; // 2 UINT8 EntryVersion; UINT8 HeaderLength; UINT8 Reserved; UINT8 ShortName[4]; UINT32 Checksum; } CPD_REV2_HEADER; typedef struct CPD_ENTRY_ { UINT8 EntryName[12]; struct { UINT32 Offset : 25; UINT32 HuffmanCompressed : 1; UINT32 Reserved : 6; } Offset; UINT32 Length; UINT32 Reserved; } CPD_ENTRY; typedef struct CPD_MANIFEST_HEADER_ { UINT32 HeaderType; UINT32 HeaderLength; UINT32 HeaderVersion; UINT32 Flags; UINT32 Vendor; UINT32 Date; UINT32 Size; UINT32 HeaderId; UINT32 Reserved1; UINT16 VersionMajor; UINT16 VersionMinor; UINT16 VersionBugfix; UINT16 VersionBuild; UINT32 SecurityVersion; UINT8 Reserved2[8]; UINT8 Reserved3[64]; UINT32 ModulusSize; UINT32 ExponentSize; //manifest_rsa_key_t public_key; //manifest_signature_t signature; } CPD_MANIFEST_HEADER; typedef struct CPD_EXTENTION_HEADER_ { UINT32 Type; UINT32 Length; } CPD_EXTENTION_HEADER; #define CPD_EXT_TYPE_SYSTEM_INFO 0 #define CPD_EXT_TYPE_INIT_SCRIPT 1 #define CPD_EXT_TYPE_FEATURE_PERMISSIONS 2 #define CPD_EXT_TYPE_PARTITION_INFO 3 #define CPD_EXT_TYPE_SHARED_LIB_ATTRIBUTES 4 #define CPD_EXT_TYPE_PROCESS_ATTRIBUTES 5 #define CPD_EXT_TYPE_THREAD_ATTRIBUTES 6 #define CPD_EXT_TYPE_DEVICE_TYPE 7 #define CPD_EXT_TYPE_MMIO_RANGE 8 #define CPD_EXT_TYPE_SPEC_FILE_PRODUCER 9 #define CPD_EXT_TYPE_MODULE_ATTRIBUTES 10 #define CPD_EXT_TYPE_LOCKED_RANGES 11 #define CPD_EXT_TYPE_CLIENT_SYSTEM_INFO 12 #define CPD_EXT_TYPE_USER_INFO 13 #define CPD_EXT_TYPE_KEY_MANIFEST 14 #define CPD_EXT_TYPE_SIGNED_PACKAGE_INFO 15 #define CPD_EXT_TYPE_ANTI_CLONING_SKU_ID 16 #define CPD_EXT_TYPE_CAVS 17 #define CPD_EXT_TYPE_IMR_INFO 18 #define CPD_EXT_TYPE_BOOT_POLICY 19 #define CPD_EXT_TYPE_RCIP_INFO 20 #define CPD_EXT_TYPE_SECURE_TOKEN 21 #define CPD_EXT_TYPE_IFWI_PARTITION_MANIFEST 22 #define CPD_EXT_TYPE_FD_HASH 23 #define CPD_EXT_TYPE_IOM_METADATA 24 #define CPD_EXT_TYPE_MGP_METADATA 25 #define CPD_EXT_TYPE_TBT_METADATA 26 #define CPD_EXT_TYPE_GMF_CERTIFICATE 30 #define CPD_EXT_TYPE_GMF_BODY 31 #define CPD_EXT_TYPE_KEY_MANIFEST_EXT 34 #define CPD_EXT_TYPE_SIGNED_PACKAGE_INFO_EXT 35 #define CPD_EXT_TYPE_SPS_PLATFORM_ID 50 typedef struct CPD_EXT_SIGNED_PACKAGE_INFO_MODULE_ { UINT8 Name[12]; UINT8 Type; UINT8 HashAlgorithm; UINT16 HashSize; UINT32 MetadataSize; // UINT8 MetadataHash[]; with the actual hash size is 32 or 48 bytes } CPD_EXT_SIGNED_PACKAGE_INFO_MODULE; static const size_t CpdExtSignedPkgMetadataHashOffset = sizeof(CPD_EXT_SIGNED_PACKAGE_INFO_MODULE); typedef struct CPD_EXT_SIGNED_PACKAGE_INFO_ { UINT32 ExtensionType; UINT32 ExtensionLength; UINT8 PackageName[4]; UINT32 Vcn; UINT8 UsageBitmap[16]; UINT32 Svn; UINT8 Reserved[16]; // EXT_SIGNED_PACKAGE_INFO_MODULE Modules[]; } CPD_EXT_SIGNED_PACKAGE_INFO; typedef struct CPD_EXT_MODULE_ATTRIBUTES_ { UINT32 ExtensionType; UINT32 ExtensionLength; UINT32 CompressionType; UINT32 UncompressedSize; UINT32 CompressedSize; UINT32 GlobalModuleId; // UINT8 ImageHash[]; with the actual hash size is 32 or 48 bytes } CPD_EXT_MODULE_ATTRIBUTES; static const size_t CpdExtModuleImageHashOffset = sizeof(CPD_EXT_MODULE_ATTRIBUTES); #define CPD_EXT_MODULE_COMPRESSION_TYPE_UNCOMPRESSED 0 #define CPD_EXT_MODULE_COMPRESSION_TYPE_HUFFMAN 1 #define CPD_EXT_MODULE_COMPRESSION_TYPE_LZMA 2 typedef struct CPD_EXT_IFWI_PARTITION_MANIFEST_ { UINT32 ExtensionType; UINT32 ExtensionLength; UINT8 PartitionName[4]; UINT32 CompletePartitionLength; UINT16 PartitionVersionMinor; UINT16 PartitionVersionMajor; UINT32 DataFormatVersion; UINT32 InstanceId; UINT32 SupportMultipleInstances : 1; UINT32 SupportApiVersionBasedUpdate : 1; UINT32 ActionOnUpdate : 2; UINT32 ObeyFullUpdateRules : 1; UINT32 IfrEnableOnly : 1; UINT32 AllowCrossPointUpdate : 1; UINT32 AllowCrossHotfixUpdate : 1; UINT32 PartialUpdateOnly : 1; UINT32 ReservedFlags : 23; UINT32 HashAlgorithm : 8; UINT32 HashSize : 24; UINT8 CompletePartitionHash[48]; UINT8 Reserved[4]; } CPD_EXT_IFWI_PARTITION_MANIFEST; //***************************************************************************** // Protected range //***************************************************************************** extern const UByteArray PROTECTED_RANGE_VENDOR_HASH_FILE_GUID_PHOENIX; // 389CC6F2-1EA8-467B-AB8A-78E769AE2A15 #define BG_VENDOR_HASH_FILE_SIGNATURE_PHOENIX 0x4C42544853414824ULL // '$HASHTBL' extern const UByteArray PROTECTED_RANGE_VENDOR_HASH_FILE_GUID_AMI; // CBC91F44-A4BC-4A5B-8696-703451D0B053 typedef struct BG_VENDOR_HASH_FILE_ENTRY { UINT8 Hash[SHA256_HASH_SIZE]; UINT32 Base; UINT32 Size; } PROTECTED_RANGE_VENDOR_HASH_FILE_ENTRY; typedef struct PROTECTED_RANGE_VENDOR_HASH_FILE_HEADER_PHOENIX_ { UINT64 Signature; UINT32 NumEntries; //BG_VENDOR_HASH_FILE_ENTRY Entries[]; } PROTECTED_RANGE_VENDOR_HASH_FILE_HEADER_PHOENIX; typedef struct PROTECTED_RANGE_VENDOR_HASH_FILE_HEADER_AMI_V1_ { UINT8 Hash[SHA256_HASH_SIZE]; UINT32 Size; // Base is derived from flash map, will be detected as root volume with DXE core } PROTECTED_RANGE_VENDOR_HASH_FILE_HEADER_AMI_V1; typedef struct PROTECTED_RANGE_VENDOR_HASH_FILE_HEADER_AMI_V2_ { BG_VENDOR_HASH_FILE_ENTRY Hash0; BG_VENDOR_HASH_FILE_ENTRY Hash1; } PROTECTED_RANGE_VENDOR_HASH_FILE_HEADER_AMI_V2; typedef struct PROTECTED_RANGE_VENDOR_HASH_FILE_HEADER_AMI_V3_ { UINT8 Hash[SHA256_HASH_SIZE]; UINT32 FvMainSegmentBase[3]; UINT32 FvMainSegmentSize[3]; UINT32 NestedFvBase; UINT32 NestedFvSize; UINT8 Reserved[48]; } PROTECTED_RANGE_VENDOR_HASH_FILE_HEADER_AMI_V3; // // AMI ROM Hole files // extern const UByteArray AMI_ROM_HOLE_FILE_GUID_0; //05CA01FC-0FC1-11DC-9011-00173153EBA8 extern const UByteArray AMI_ROM_HOLE_FILE_GUID_1; //05CA01FD-0FC1-11DC-9011-00173153EBA8 extern const UByteArray AMI_ROM_HOLE_FILE_GUID_2; //05CA01FE-0FC1-11DC-9011-00173153EBA8 extern const UByteArray AMI_ROM_HOLE_FILE_GUID_3; //05CA01FF-0FC1-11DC-9011-00173153EBA8 extern const UByteArray AMI_ROM_HOLE_FILE_GUID_4; //05CA0200-0FC1-11DC-9011-00173153EBA8 extern const UByteArray AMI_ROM_HOLE_FILE_GUID_5; //05CA0201-0FC1-11DC-9011-00173153EBA8 extern const UByteArray AMI_ROM_HOLE_FILE_GUID_6; //05CA0202-0FC1-11DC-9011-00173153EBA8 extern const UByteArray AMI_ROM_HOLE_FILE_GUID_7; //05CA0203-0FC1-11DC-9011-00173153EBA8 extern const UByteArray AMI_ROM_HOLE_FILE_GUID_8; //05CA0204-0FC1-11DC-9011-00173153EBA8 extern const UByteArray AMI_ROM_HOLE_FILE_GUID_9; //05CA0205-0FC1-11DC-9011-00173153EBA8 extern const UByteArray AMI_ROM_HOLE_FILE_GUID_10; //05CA0206-0FC1-11DC-9011-00173153EBA8 extern const UByteArray AMI_ROM_HOLE_FILE_GUID_11; //05CA0207-0FC1-11DC-9011-00173153EBA8 extern const UByteArray AMI_ROM_HOLE_FILE_GUID_12; //05CA0208-0FC1-11DC-9011-00173153EBA8 extern const UByteArray AMI_ROM_HOLE_FILE_GUID_13; //05CA0209-0FC1-11DC-9011-00173153EBA8 extern const UByteArray AMI_ROM_HOLE_FILE_GUID_14; //05CA020A-0FC1-11DC-9011-00173153EBA8 extern const UByteArray AMI_ROM_HOLE_FILE_GUID_15; //05CA020B-0FC1-11DC-9011-00173153EBA8 // Restore previous packing rules #pragma pack(pop) #endif // FFS_H UEFITool-A66/common/ffsbuilder.cpp000066400000000000000000000362231442134156300171300ustar00rootroot00000000000000/* fssbuilder.cpp Copyright (c) 2015, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "ffsbuilder.h" #include "descriptor.h" #include "ffs.h" #include "peimage.h" #include "utility.h" #include "nvram.h" #include USTATUS FfsBuilder::erase(const UModelIndex & index, UByteArray & erased) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // Try to get emptyByte value from item's parsing data UINT8 emptyByte = 0xFF; if (!model->hasEmptyParsingData(index)) { if (model->type(index) == Types::Volume) { VOLUME_PARSING_DATA pdata = *(VOLUME_PARSING_DATA*)model->parsingData(index).constData(); emptyByte = pdata.emptyByte; } else if (model->type(index) == Types::File) { FILE_PARSING_DATA pdata = *(FILE_PARSING_DATA*)model->parsingData(index).constData(); emptyByte = pdata.emptyByte; } } erased = UByteArray(model->header(index).size() + model->body(index).size() + model->tail(index).size(), emptyByte); return U_SUCCESS; } USTATUS FfsBuilder::build(const UModelIndex & root, UByteArray & image) { // Sanity check if (!root.isValid()) return U_INVALID_PARAMETER; if (model->type(root) == Types::Capsule) { return buildCapsule(root, image); } else if (model->type(root) == Types::Image) { if (model->subtype(root) == Subtypes::IntelImage) { return buildIntelImage(root, image); } else if (model->subtype(root) == Subtypes::UefiImage) { return buildRawArea(root, image); } } return U_NOT_IMPLEMENTED; } USTATUS FfsBuilder::buildCapsule(const UModelIndex & index, UByteArray & capsule) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // No action if (model->action(index) == Actions::NoAction) { // Use original item data capsule = model->header(index) + model->body(index) + model->tail(index); return U_SUCCESS; } // Rebuild or Replace else if (model->action(index) == Actions::Rebuild || model->action(index) == Actions::Replace) { if (model->rowCount(index)) { // Clear the supplied UByteArray capsule.clear(); // Right now there is only one capsule image element supported if (model->rowCount(index) != 1) { msg(usprintf("buildCapsule: building of capsules with %d items is not yet supported", model->rowCount(index)), index); return U_NOT_IMPLEMENTED; } // Build image UModelIndex imageIndex = index.model()->index(0, 0, index); UByteArray imageData; // Check image type if (model->type(imageIndex) == Types::Image) { USTATUS result = U_SUCCESS; if (model->subtype(imageIndex) == Subtypes::IntelImage) { result = buildIntelImage(imageIndex, imageData); } else if (model->subtype(imageIndex) == Subtypes::UefiImage) { result = buildRawArea(imageIndex, imageData); } else { msg(UString("buildCapsule: unexpected item subtype ") + itemSubtypeToUString(model->type(imageIndex), model->subtype(imageIndex)), imageIndex); return U_UNKNOWN_ITEM_TYPE; } // Check build result if (result) { msg(UString("buildCapsule: building of ") + model->name(imageIndex) + UString(" failed with error ") + errorCodeToUString(result), imageIndex); return result; } else capsule += imageData; } else { msg(UString("buildCapsule: unexpected item type ") + itemTypeToUString(model->type(imageIndex)), imageIndex); return U_UNKNOWN_ITEM_TYPE; } // Check size of reconstructed capsule body, it must remain the same UINT32 newSize = (UINT32)capsule.size(); UINT32 oldSize = (UINT32)model->body(index).size(); if (newSize > oldSize) { msg(usprintf("buildCapsule: new capsule size %Xh (%u) is bigger than the original %Xh (%u)", newSize, newSize, oldSize, oldSize), index); return U_INVALID_CAPSULE; } else if (newSize < oldSize) { msg(usprintf("buildCapsule: new capsule size %Xh (%u) is smaller than the original %Xh (%u)", newSize, newSize, oldSize, oldSize), index); return U_INVALID_CAPSULE; } } else capsule = model->body(index); // Build successful, append header and tail capsule = model->header(index) + capsule + model->tail(index); return U_SUCCESS; } msg(UString("buildCapsule: unexpected action " + actionTypeToUString(model->action(index))), index); return U_NOT_IMPLEMENTED; } USTATUS FfsBuilder::buildIntelImage(const UModelIndex & index, UByteArray & intelImage) { // Sanity check if (!index.isValid()) return U_SUCCESS; // No action if (model->action(index) == Actions::NoAction) { intelImage = model->header(index) + model->body(index) + model->tail(index); return U_SUCCESS; } // Remove else if (model->action(index) == Actions::Remove) { intelImage.clear(); return U_SUCCESS; } // Rebuild else if (model->action(index) == Actions::Rebuild) { // First child will always be descriptor for this type of image, and it's read only for now intelImage = model->header(index.model()->index(0, 0, index)) + model->body(index.model()->index(0, 0, index)) + model->tail(index.model()->index(0, 0, index)); // Process other regions for (int i = 1; i < model->rowCount(index); i++) { UModelIndex currentRegion = index.model()->index(i, 0, index); // Skip regions with Remove action if (model->action(currentRegion) == Actions::Remove) continue; // Check item type to be either region or padding UINT8 type = model->type(currentRegion); if (type == Types::Padding) { // Add padding as is intelImage += model->header(currentRegion) + model->body(currentRegion) + model->tail(currentRegion); continue; } // Check region subtype USTATUS result; UByteArray region; UINT8 regionType = model->subtype(currentRegion); switch (regionType) { case Subtypes::BiosRegion: case Subtypes::PdrRegion: result = buildRawArea(currentRegion, region); if (result) { msg(UString("buildIntelImage: building of region ") + regionTypeToUString(regionType) + UString(" failed with error ") + errorCodeToUString(result), currentRegion); return result; } break; case Subtypes::MeRegion: case Subtypes::GbeRegion: case Subtypes::DevExp1Region: case Subtypes::Bios2Region: case Subtypes::MicrocodeRegion: case Subtypes::EcRegion: case Subtypes::DevExp2Region: case Subtypes::IeRegion: case Subtypes::Tgbe1Region: case Subtypes::Tgbe2Region: case Subtypes::Reserved1Region: case Subtypes::Reserved2Region: case Subtypes::PttRegion: // Add region as is region = model->header(currentRegion) + model->body(currentRegion); break; default: msg(UString("buildIntelImage: unknown region type"), currentRegion); return U_UNKNOWN_ITEM_TYPE; } // Append the resulting region intelImage += region; } // Check size of new image, it must be same as old one UINT32 newSize = (UINT32)intelImage.size(); UINT32 oldSize = (UINT32)model->body(index).size(); if (newSize > oldSize) { msg(usprintf("buildIntelImage: new image size %Xh (%u) is bigger than the original %Xh (%u)", newSize, newSize, oldSize, oldSize), index); return U_INVALID_IMAGE; } else if (newSize < oldSize) { msg(usprintf("buildIntelImage: new image size %Xh (%u) is smaller than the original %Xh (%u)", newSize, newSize, oldSize, oldSize), index); return U_INVALID_IMAGE; } // Build successful, append header and tail intelImage = model->header(index) + intelImage + model->tail(index); return U_SUCCESS; } msg(UString("buildIntelImage: unexpected action " + actionTypeToUString(model->action(index))), index); return U_NOT_IMPLEMENTED; } USTATUS FfsBuilder::buildRawArea(const UModelIndex & index, UByteArray & rawArea) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // No action required if (model->action(index) == Actions::NoAction) { rawArea = model->header(index) + model->body(index) + model->tail(index); return U_SUCCESS; } // Remove else if (model->action(index) == Actions::Remove) { rawArea.clear(); return U_SUCCESS; } // Rebuild or Replace else if (model->action(index) == Actions::Rebuild || model->action(index) == Actions::Replace) { // Rebuild if there is at least 1 child if (model->rowCount(index)) { // Clear the supplied UByteArray rawArea.clear(); // Build children for (int i = 0; i < model->rowCount(index); i++) { USTATUS result = U_SUCCESS; UModelIndex currentChild = index.model()->index(i, 0, index); UByteArray currentData; // Check child type if (model->type(currentChild) == Types::Volume) { result = buildVolume(currentChild, currentData); } else if (model->type(currentChild) == Types::Padding) { result = buildPadding(currentChild, currentData); } else { msg(UString("buildRawArea: unexpected item type ") + itemTypeToUString(model->type(currentChild)), currentChild); return U_UNKNOWN_ITEM_TYPE; } // Check build result if (result) { msg(UString("buildRawArea: building of ") + model->name(currentChild) + UString(" failed with error ") + errorCodeToUString(result), currentChild); return result; } // Append current data rawArea += currentData; } // Check size of new raw area, it must be same as original one UINT32 newSize = (UINT32)rawArea.size(); UINT32 oldSize = (UINT32)model->body(index).size(); if (newSize > oldSize) { msg(usprintf("buildRawArea: new area size %Xh (%u) is bigger than the original %Xh (%u)", newSize, newSize, oldSize, oldSize), index); return U_INVALID_RAW_AREA; } else if (newSize < oldSize) { msg(usprintf("buildRawArea: new area size %Xh (%u) is smaller than the original %Xh (%u)", newSize, newSize, oldSize, oldSize), index); return U_INVALID_RAW_AREA; } } // No need to rebuild a raw area with no children else { rawArea = model->body(index); } // Build successful, add header if needed rawArea = model->header(index) + rawArea + model->tail(index); return U_SUCCESS; } msg(UString("buildRawArea: unexpected action " + actionTypeToUString(model->action(index))), index); return U_NOT_IMPLEMENTED; } USTATUS FfsBuilder::buildPadding(const UModelIndex & index, UByteArray & padding) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // No action required if (model->action(index) == Actions::NoAction) { padding = model->header(index) + model->body(index) + model->tail(index); return U_SUCCESS; } // Remove else if (model->action(index) == Actions::Remove) { padding.clear(); return U_SUCCESS; } // Erase else if (model->action(index) == Actions::Erase) { return erase(index, padding); } msg(UString("buildPadding: unexpected action " + actionTypeToUString(model->action(index))), index); return U_NOT_IMPLEMENTED; } USTATUS FfsBuilder::buildNonUefiData(const UModelIndex & index, UByteArray & data) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // No action required if (model->action(index) == Actions::NoAction) { data = model->header(index) + model->body(index) + model->tail(index); return U_SUCCESS; } // Remove else if (model->action(index) == Actions::Remove) { data.clear(); return U_SUCCESS; } // Erase else if (model->action(index) == Actions::Erase) { return erase(index, data); } // TODO: rebuild properly msg(UString("buildNoUefiData: unexpected action " + actionTypeToUString(model->action(index))), index); return U_NOT_IMPLEMENTED; } USTATUS FfsBuilder::buildFreeSpace(const UModelIndex & index, UByteArray & freeSpace) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // No actions possible for free space freeSpace = model->header(index) + model->body(index) + model->tail(index); return U_SUCCESS; } USTATUS FfsBuilder::buildVolume(const UModelIndex & index, UByteArray & volume) { U_UNUSED_PARAMETER(index); U_UNUSED_PARAMETER(volume); return U_NOT_IMPLEMENTED; } USTATUS FfsBuilder::buildPadFile(const UModelIndex & index, UByteArray & padFile) { U_UNUSED_PARAMETER(index); U_UNUSED_PARAMETER(padFile); return U_NOT_IMPLEMENTED; } USTATUS FfsBuilder::buildFile(const UModelIndex & index, UByteArray & file) { U_UNUSED_PARAMETER(index); U_UNUSED_PARAMETER(file); return U_NOT_IMPLEMENTED; } USTATUS FfsBuilder::buildSection(const UModelIndex & index, UByteArray & section) { U_UNUSED_PARAMETER(index); U_UNUSED_PARAMETER(section); return U_NOT_IMPLEMENTED; } UEFITool-A66/common/ffsbuilder.h000066400000000000000000000041121442134156300165650ustar00rootroot00000000000000/* fssbuilder.h Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef FFSBUILDER_H #define FFSBUILDER_H #include #include "basetypes.h" #include "ubytearray.h" #include "ustring.h" #include "treemodel.h" class FfsBuilder { public: FfsBuilder(const TreeModel * treeModel) : model(treeModel) {} ~FfsBuilder() {} std::vector > getMessages() const { return messagesVector; } void clearMessages() { messagesVector.clear(); } USTATUS build(const UModelIndex & root, UByteArray & image); private: const TreeModel* model; std::vector > messagesVector; void msg(const UString & message, const UModelIndex &index = UModelIndex()) { messagesVector.push_back(std::pair(message, index)); } USTATUS buildCapsule(const UModelIndex & index, UByteArray & capsule); USTATUS buildIntelImage(const UModelIndex & index, UByteArray & intelImage); USTATUS buildRawArea(const UModelIndex & index, UByteArray & rawArea); USTATUS buildPadding(const UModelIndex & index, UByteArray & padding); USTATUS buildVolume(const UModelIndex & index, UByteArray & volume); USTATUS buildNonUefiData(const UModelIndex & index, UByteArray & data); USTATUS buildFreeSpace(const UModelIndex & index, UByteArray & freeSpace); USTATUS buildPadFile(const UModelIndex & index, UByteArray & padFile); USTATUS buildFile(const UModelIndex & index, UByteArray & file); USTATUS buildSection(const UModelIndex & index, UByteArray & section); // Utility functions USTATUS erase(const UModelIndex & index, UByteArray & erased); }; #endif // FFSBUILDER_H UEFITool-A66/common/ffsops.cpp000066400000000000000000000055451442134156300163060ustar00rootroot00000000000000/* fssops.cpp Copyright (c) 2015, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "ffsops.h" #include "ffs.h" #include "utility.h" USTATUS FfsOperations::extract(const UModelIndex & index, UString & name, UByteArray & extracted, const UINT8 mode) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // Default name name = uniqueItemName(index); // Get extracted data if (mode == EXTRACT_MODE_AS_IS) { // Extract as is, with header body and tail extracted.clear(); extracted += model->header(index); extracted += model->body(index); extracted += model->tail(index); } else if (mode == EXTRACT_MODE_BODY) { name += UString("_body"); // Extract without header and tail extracted.clear(); extracted += model->body(index); } else if (mode == EXTRACT_MODE_BODY_UNCOMPRESSED) { name += UString("_body_uncompressed"); extracted.clear(); extracted += model->uncompressedData(index); } else return U_UNKNOWN_EXTRACT_MODE; return U_SUCCESS; } USTATUS FfsOperations::replace(const UModelIndex & index, UByteArray & data, const UINT8 mode) { U_UNUSED_PARAMETER(data); // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; if (mode == REPLACE_MODE_AS_IS) { return U_NOT_IMPLEMENTED; } else if (mode == REPLACE_MODE_BODY) { return U_NOT_IMPLEMENTED; } return U_UNKNOWN_REPLACE_MODE; } USTATUS FfsOperations::remove(const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // Set remove action model->setAction(index, Actions::Remove); return U_SUCCESS; } USTATUS FfsOperations::rebuild(const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // On insert action, set insert action for children //if (action == Actions::Insert) // for (int i = 0; i < item->childCount(); i++) // setAction(index.child(i, 0), Actions::Insert); // Set rebuild action model->setAction(index, Actions::Rebuild); // Rebuild parent, if it has no action now UModelIndex parent = index.parent(); if (parent.isValid() && model->type(parent) != Types::Root && model->action(parent) == Actions::NoAction) rebuild(parent); return U_SUCCESS; } UEFITool-A66/common/ffsops.h000066400000000000000000000027421442134156300157470ustar00rootroot00000000000000/* fssops.h Copyright (c) 2015, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef FFSOPS_H #define FFSOPS_H #include #include "basetypes.h" #include "ubytearray.h" #include "ustring.h" #include "treemodel.h" #include "ffsparser.h" class FfsOperations { public: FfsOperations(TreeModel * treeModel) : model(treeModel) {} ~FfsOperations() {}; std::vector > getMessages() const { return messagesVector; } void clearMessages() { messagesVector.clear(); } USTATUS extract(const UModelIndex & index, UString & name, UByteArray & extracted, const UINT8 mode); USTATUS replace(const UModelIndex & index, UByteArray & data, const UINT8 mode); USTATUS remove(const UModelIndex & index); USTATUS rebuild(const UModelIndex & index); private: TreeModel * model; std::vector > messagesVector; void msg(const UString & message, const UModelIndex &index = UModelIndex()) { messagesVector.push_back(std::pair(message, index)); } }; #endif // FFSOPS_H UEFITool-A66/common/ffsparser.cpp000066400000000000000000007121401442134156300167750ustar00rootroot00000000000000/* ffsparser.cpp Copyright (c) 2018, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHWARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "ffsparser.h" #include #include #include #include "descriptor.h" #include "ffs.h" #include "gbe.h" #include "me.h" #include "intel_fit.h" #include "nvram.h" #include "peimage.h" #include "parsingdata.h" #include "types.h" #include "utility.h" #include "nvramparser.h" #include "meparser.h" #include "fitparser.h" #include "digest/sha1.h" #include "digest/sha2.h" #include "digest/sm3.h" // Constructor FfsParser::FfsParser(TreeModel* treeModel) : model(treeModel), imageBase(0), addressDiff(0x100000000ULL), protectedRegionsBase(0) { fitParser = new FitParser(treeModel, this); nvramParser = new NvramParser(treeModel, this); meParser = new MeParser(treeModel, this); } // Destructor FfsParser::~FfsParser() { delete nvramParser; delete meParser; delete fitParser; } // Obtain parser messages std::vector > FfsParser::getMessages() const { std::vector > meVector = meParser->getMessages(); std::vector > nvramVector = nvramParser->getMessages(); std::vector > fitVector = fitParser->getMessages(); std::vector > resultVector = messagesVector; resultVector.insert(resultVector.end(), meVector.begin(), meVector.end()); resultVector.insert(resultVector.end(), nvramVector.begin(), nvramVector.end());\ resultVector.insert(resultVector.end(), fitVector.begin(), fitVector.end()); return resultVector; } // Obtain FIT table from FIT parser std::vector, UModelIndex> > FfsParser::getFitTable() const { return fitParser->getFitTable(); } // Obtain security info from FIT parser UString FfsParser::getSecurityInfo() const { return securityInfo + fitParser->getSecurityInfo(); } // Firmware image parsing functions USTATUS FfsParser::parse(const UByteArray & buffer) { UModelIndex root; // Reset global parser state openedImage = buffer; imageBase = 0; addressDiff = 0x100000000ULL; protectedRegionsBase = 0; securityInfo = ""; protectedRanges.clear(); lastVtf = UModelIndex(); dxeCore = UModelIndex(); // Parse input buffer USTATUS result = performFirstPass(buffer, root); if (result == U_SUCCESS) { if (lastVtf.isValid()) { result = performSecondPass(root); } else { msg(usprintf("%s: not a single Volume Top File is found, the image may be corrupted", __FUNCTION__)); } } addInfoRecursive(root); return result; } USTATUS FfsParser::performFirstPass(const UByteArray & buffer, UModelIndex & index) { // Sanity check if (buffer.isEmpty()) { return U_INVALID_PARAMETER; } // Try parsing as UEFI Capsule if (U_SUCCESS == parseCapsule(buffer, 0, UModelIndex(), index)) { return U_SUCCESS; } // Try parsing as Intel image if (U_SUCCESS == parseIntelImage(buffer, 0, UModelIndex(), index)) { return U_SUCCESS; } // Parse as generic image return parseGenericImage(buffer, 0, UModelIndex(), index); } USTATUS FfsParser::parseGenericImage(const UByteArray & buffer, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index) { // Parse as generic UEFI image UString name("UEFI image"); UString info = usprintf("Full size: %Xh (%u)", (UINT32)buffer.size(), (UINT32)buffer.size()); // Add tree item index = model->addItem(localOffset, Types::Image, Subtypes::UefiImage, name, UString(), info, UByteArray(), buffer, UByteArray(), Fixed, parent); // Parse the image as raw area imageBase = model->base(parent) + localOffset; protectedRegionsBase = imageBase; return parseRawArea(index); } USTATUS FfsParser::parseCapsule(const UByteArray & capsule, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index) { // Check buffer size to be more than or equal to size of EFI_CAPSULE_HEADER if ((UINT32)capsule.size() < sizeof(EFI_CAPSULE_HEADER)) { return U_ITEM_NOT_FOUND; } UINT32 capsuleHeaderSize = 0; // Check buffer for being normal EFI capsule header if (capsule.startsWith(EFI_CAPSULE_GUID) || capsule.startsWith(EFI_FMP_CAPSULE_GUID) || capsule.startsWith(INTEL_CAPSULE_GUID) || capsule.startsWith(LENOVO_CAPSULE_GUID) || capsule.startsWith(LENOVO2_CAPSULE_GUID)) { // Get info const EFI_CAPSULE_HEADER* capsuleHeader = (const EFI_CAPSULE_HEADER*)capsule.constData(); // Check sanity of HeaderSize and CapsuleImageSize values if (capsuleHeader->HeaderSize == 0 || capsuleHeader->HeaderSize > (UINT32)capsule.size() || capsuleHeader->HeaderSize > capsuleHeader->CapsuleImageSize) { msg(usprintf("%s: UEFI capsule header size of %Xh (%u) bytes is invalid", __FUNCTION__, capsuleHeader->HeaderSize, capsuleHeader->HeaderSize)); return U_INVALID_CAPSULE; } if (capsuleHeader->CapsuleImageSize > (UINT32)capsule.size()) { msg(usprintf("%s: UEFI capsule image size of %Xh (%u) bytes is invalid", __FUNCTION__, capsuleHeader->CapsuleImageSize, capsuleHeader->CapsuleImageSize)); return U_INVALID_CAPSULE; } capsuleHeaderSize = capsuleHeader->HeaderSize; UByteArray header = capsule.left(capsuleHeaderSize); UByteArray body = capsule.mid(capsuleHeaderSize); UString name("UEFI capsule"); UString info = UString("Capsule GUID: ") + guidToUString(capsuleHeader->CapsuleGuid, false) + usprintf("\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nImage size: %Xh (%u)\nFlags: %08Xh", (UINT32)capsule.size(), (UINT32)capsule.size(), capsuleHeaderSize, capsuleHeaderSize, capsuleHeader->CapsuleImageSize - capsuleHeaderSize, capsuleHeader->CapsuleImageSize - capsuleHeaderSize, capsuleHeader->Flags); // Add tree item index = model->addItem(localOffset, Types::Capsule, Subtypes::UefiCapsule, name, UString(), info, header, body, UByteArray(), Fixed, parent); } // Check buffer for being Toshiba capsule header else if (capsule.startsWith(TOSHIBA_CAPSULE_GUID)) { // Get info const TOSHIBA_CAPSULE_HEADER* capsuleHeader = (const TOSHIBA_CAPSULE_HEADER*)capsule.constData(); // Check sanity of HeaderSize and FullSize values if (capsuleHeader->HeaderSize == 0 || capsuleHeader->HeaderSize > (UINT32)capsule.size() || capsuleHeader->HeaderSize > capsuleHeader->FullSize) { msg(usprintf("%s: Toshiba capsule header size of %Xh (%u) bytes is invalid", __FUNCTION__, capsuleHeader->HeaderSize, capsuleHeader->HeaderSize)); return U_INVALID_CAPSULE; } if (capsuleHeader->FullSize > (UINT32)capsule.size()) { msg(usprintf("%s: Toshiba capsule full size of %Xh (%u) bytes is invalid", __FUNCTION__, capsuleHeader->FullSize, capsuleHeader->FullSize)); return U_INVALID_CAPSULE; } capsuleHeaderSize = capsuleHeader->HeaderSize; UByteArray header = capsule.left(capsuleHeaderSize); UByteArray body = capsule.mid(capsuleHeaderSize); UString name("Toshiba capsule"); UString info = UString("Capsule GUID: ") + guidToUString(capsuleHeader->CapsuleGuid, false) + usprintf("\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nImage size: %Xh (%u)\nFlags: %08Xh", (UINT32)capsule.size(), (UINT32)capsule.size(), capsuleHeaderSize, capsuleHeaderSize, capsuleHeader->FullSize - capsuleHeaderSize, capsuleHeader->FullSize - capsuleHeaderSize, capsuleHeader->Flags); // Add tree item index = model->addItem(localOffset, Types::Capsule, Subtypes::ToshibaCapsule, name, UString(), info, header, body, UByteArray(), Fixed, parent); } // Check buffer for being extended Aptio capsule header else if (capsule.startsWith(APTIO_SIGNED_CAPSULE_GUID) || capsule.startsWith(APTIO_UNSIGNED_CAPSULE_GUID)) { bool signedCapsule = capsule.startsWith(APTIO_SIGNED_CAPSULE_GUID); if ((UINT32)capsule.size() <= sizeof(APTIO_CAPSULE_HEADER)) { msg(usprintf("%s: AMI capsule image file is smaller than minimum size of 20h (32) bytes", __FUNCTION__)); return U_INVALID_CAPSULE; } // Get info const APTIO_CAPSULE_HEADER* capsuleHeader = (const APTIO_CAPSULE_HEADER*)capsule.constData(); // Check sanity of RomImageOffset and CapsuleImageSize values if (capsuleHeader->RomImageOffset == 0 || capsuleHeader->RomImageOffset > (UINT32)capsule.size() || capsuleHeader->RomImageOffset > capsuleHeader->CapsuleHeader.CapsuleImageSize) { msg(usprintf("%s: AMI capsule image offset of %Xh (%u) bytes is invalid", __FUNCTION__, capsuleHeader->RomImageOffset, capsuleHeader->RomImageOffset)); return U_INVALID_CAPSULE; } if (capsuleHeader->CapsuleHeader.CapsuleImageSize > (UINT32)capsule.size()) { msg(usprintf("%s: AMI capsule image size of %Xh (%u) bytes is invalid", __FUNCTION__, capsuleHeader->CapsuleHeader.CapsuleImageSize, capsuleHeader->CapsuleHeader.CapsuleImageSize)); return U_INVALID_CAPSULE; } capsuleHeaderSize = capsuleHeader->RomImageOffset; UByteArray header = capsule.left(capsuleHeaderSize); UByteArray body = capsule.mid(capsuleHeaderSize); UString name("AMI Aptio capsule"); UString info = UString("Capsule GUID: ") + guidToUString(capsuleHeader->CapsuleHeader.CapsuleGuid, false) + usprintf("\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nImage size: %Xh (%u)\nFlags: %08Xh", (UINT32)capsule.size(), (UINT32)capsule.size(), capsuleHeaderSize, capsuleHeaderSize, capsuleHeader->CapsuleHeader.CapsuleImageSize - capsuleHeaderSize, capsuleHeader->CapsuleHeader.CapsuleImageSize - capsuleHeaderSize, capsuleHeader->CapsuleHeader.Flags); // Add tree item index = model->addItem(localOffset, Types::Capsule, signedCapsule ? Subtypes::AptioSignedCapsule : Subtypes::AptioUnsignedCapsule, name, UString(), info, header, body, UByteArray(), Fixed, parent); // Show message about possible Aptio signature break if (signedCapsule) { msg(usprintf("%s: Aptio capsule signature may become invalid after image modifications", __FUNCTION__), index); } } // Capsule present if (capsuleHeaderSize > 0) { UByteArray image = capsule.mid(capsuleHeaderSize); UModelIndex imageIndex; // Try parsing as Intel image if (U_SUCCESS == parseIntelImage(image, capsuleHeaderSize, index, imageIndex)) { return U_SUCCESS; } // Parse as generic image return parseGenericImage(image, capsuleHeaderSize, index, imageIndex); } return U_ITEM_NOT_FOUND; } USTATUS FfsParser::parseIntelImage(const UByteArray & intelImage, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index) { // Check for buffer size to be greater or equal to descriptor region size if (intelImage.size() < FLASH_DESCRIPTOR_SIZE) { msg(usprintf("%s: input file is smaller than minimum descriptor size of %Xh (%u) bytes", __FUNCTION__, FLASH_DESCRIPTOR_SIZE, FLASH_DESCRIPTOR_SIZE)); return U_ITEM_NOT_FOUND; } // Store the beginning of descriptor as descriptor base address const FLASH_DESCRIPTOR_HEADER* descriptor = (const FLASH_DESCRIPTOR_HEADER*)intelImage.constData(); // Check descriptor signature if (descriptor->Signature != FLASH_DESCRIPTOR_SIGNATURE) { return U_ITEM_NOT_FOUND; } // Parse descriptor map const FLASH_DESCRIPTOR_MAP* descriptorMap = (const FLASH_DESCRIPTOR_MAP*)((UINT8*)descriptor + sizeof(FLASH_DESCRIPTOR_HEADER)); const FLASH_DESCRIPTOR_UPPER_MAP* upperMap = (const FLASH_DESCRIPTOR_UPPER_MAP*)((UINT8*)descriptor + FLASH_DESCRIPTOR_UPPER_MAP_BASE); // Check sanity of base values if (descriptorMap->MasterBase > FLASH_DESCRIPTOR_MAX_BASE || descriptorMap->MasterBase == descriptorMap->RegionBase || descriptorMap->MasterBase == descriptorMap->ComponentBase) { msg(usprintf("%s: invalid descriptor master base %02Xh", __FUNCTION__, descriptorMap->MasterBase)); return U_INVALID_FLASH_DESCRIPTOR; } if (descriptorMap->RegionBase > FLASH_DESCRIPTOR_MAX_BASE || descriptorMap->RegionBase == descriptorMap->ComponentBase) { msg(usprintf("%s: invalid descriptor region base %02Xh", __FUNCTION__, descriptorMap->RegionBase)); return U_INVALID_FLASH_DESCRIPTOR; } if (descriptorMap->ComponentBase > FLASH_DESCRIPTOR_MAX_BASE) { msg(usprintf("%s: invalid descriptor component base %02Xh", __FUNCTION__, descriptorMap->ComponentBase)); return U_INVALID_FLASH_DESCRIPTOR; } const FLASH_DESCRIPTOR_REGION_SECTION* regionSection = (const FLASH_DESCRIPTOR_REGION_SECTION*)calculateAddress8((UINT8*)descriptor, descriptorMap->RegionBase); const FLASH_DESCRIPTOR_COMPONENT_SECTION* componentSection = (const FLASH_DESCRIPTOR_COMPONENT_SECTION*)calculateAddress8((UINT8*)descriptor, descriptorMap->ComponentBase); UINT8 descriptorVersion = 2; // Check descriptor version by getting hardcoded value of FlashParameters.ReadClockFrequency if (componentSection->FlashParameters.ReadClockFrequency == FLASH_FREQUENCY_20MHZ) descriptorVersion = 1; // Regions std::vector regions; // ME region REGION_INFO me; me.type = Subtypes::MeRegion; me.offset = 0; me.length = 0; if (regionSection->MeLimit) { me.offset = calculateRegionOffset(regionSection->MeBase); me.length = calculateRegionSize(regionSection->MeBase, regionSection->MeLimit); if ((UINT32)intelImage.size() < me.offset + me.length) { msg(usprintf("%s: ", __FUNCTION__) + itemSubtypeToUString(Types::Region, me.type) + UString(" region is located outside of the opened image. If your system uses dual-chip storage, please append another part to the opened image"), index); return U_TRUNCATED_IMAGE; } me.data = intelImage.mid(me.offset, me.length); regions.push_back(me); } // BIOS region if (regionSection->BiosLimit) { REGION_INFO bios; bios.type = Subtypes::BiosRegion; bios.offset = calculateRegionOffset(regionSection->BiosBase); bios.length = calculateRegionSize(regionSection->BiosBase, regionSection->BiosLimit); // Check for Gigabyte specific descriptor map if (bios.length == (UINT32)intelImage.size()) { if (!me.offset) { msg(usprintf("%s: can't determine BIOS region start from Gigabyte-specific descriptor", __FUNCTION__)); return U_INVALID_FLASH_DESCRIPTOR; } // Use ME region end as BIOS region offset bios.offset = me.offset + me.length; bios.length = (UINT32)intelImage.size() - bios.offset; } if ((UINT32)intelImage.size() < bios.offset + bios.length) { msg(usprintf("%s: ", __FUNCTION__) + itemSubtypeToUString(Types::Region, bios.type) + UString(" region is located outside of the opened image. If your system uses dual-chip storage, please append another part to the opened image"), index); return U_TRUNCATED_IMAGE; } bios.data = intelImage.mid(bios.offset, bios.length); regions.push_back(bios); } else { msg(usprintf("%s: descriptor parsing failed, BIOS region not found in descriptor", __FUNCTION__)); return U_INVALID_FLASH_DESCRIPTOR; } // Add all other regions for (UINT8 i = Subtypes::GbeRegion; i <= Subtypes::PttRegion; i++) { if (descriptorVersion == 1 && i == Subtypes::MicrocodeRegion) break; // Do not parse Microcode and other following regions for legacy descriptors const UINT16* RegionBase = ((const UINT16*)regionSection) + 2 * i; const UINT16* RegionLimit = ((const UINT16*)regionSection) + 2 * i + 1; if (*RegionLimit && !(*RegionBase == 0xFFFF && *RegionLimit == 0xFFFF)) { REGION_INFO region; region.type = i; region.offset = calculateRegionOffset(*RegionBase); region.length = calculateRegionSize(*RegionBase, *RegionLimit); if (region.length != 0) { if ((UINT32)intelImage.size() < region.offset + region.length) { msg(usprintf("%s: ", __FUNCTION__) + itemSubtypeToUString(Types::Region, region.type) + UString(" region is located outside of the opened image. If your system uses dual-chip storage, please append another part to the opened image"), index); return U_TRUNCATED_IMAGE; } region.data = intelImage.mid(region.offset, region.length); regions.push_back(region); } } } // Regions can not be empty here if (regions.empty()) { msg(usprintf("%s: descriptor parsing failed, no regions found", __FUNCTION__)); return U_INVALID_FLASH_DESCRIPTOR; } // Sort regions in ascending order std::sort(regions.begin(), regions.end()); // Check for intersections and paddings between regions REGION_INFO region; // Check intersection with the descriptor if (regions.front().offset < FLASH_DESCRIPTOR_SIZE) { msg(usprintf("%s: ", __FUNCTION__) + itemSubtypeToUString(Types::Region, regions.front().type) + UString(" region has intersection with flash descriptor"), index); return U_INVALID_FLASH_DESCRIPTOR; } // Check for padding between descriptor and the first region else if (regions.front().offset > FLASH_DESCRIPTOR_SIZE) { region.offset = FLASH_DESCRIPTOR_SIZE; region.length = regions.front().offset - FLASH_DESCRIPTOR_SIZE; region.data = intelImage.mid(region.offset, region.length); region.type = getPaddingType(region.data); regions.insert(regions.begin(), region); } // Check for intersections/paddings between regions for (size_t i = 1; i < regions.size(); i++) { UINT32 previousRegionEnd = regions[i-1].offset + regions[i-1].length; // Check for intersection with previous region if (regions[i].offset < previousRegionEnd) { msg(usprintf("%s: ", __FUNCTION__) + itemSubtypeToUString(Types::Region, regions[i].type) + UString(" region has intersection with ") + itemSubtypeToUString(Types::Region, regions[i - 1].type) + UString(" region"), index); return U_INVALID_FLASH_DESCRIPTOR; } // Check for padding between current and previous regions else if (regions[i].offset > previousRegionEnd) { region.offset = previousRegionEnd; region.length = regions[i].offset - previousRegionEnd; region.data = intelImage.mid(region.offset, region.length); region.type = getPaddingType(region.data); std::vector::iterator iter = regions.begin(); std::advance(iter, i); regions.insert(iter, region); } } // Check for padding after the last region if ((UINT64)regions.back().offset + (UINT64)regions.back().length < (UINT64)intelImage.size()) { region.offset = regions.back().offset + regions.back().length; region.length = (UINT32)(intelImage.size() - region.offset); region.data = intelImage.mid(region.offset, region.length); region.type = getPaddingType(region.data); regions.push_back(region); } // Region map is consistent // Intel image UString name("Intel image"); UString info = usprintf("Full size: %Xh (%u)\nFlash chips: %u\nRegions: %u\nMasters: %u\nPCH straps: %u\nPROC straps: %u", (UINT32)intelImage.size(), (UINT32)intelImage.size(), descriptorMap->NumberOfFlashChips + 1, // descriptorMap->NumberOfRegions + 1, // Zero-based numbers in storage descriptorMap->NumberOfMasters + 1, // descriptorMap->NumberOfPchStraps, descriptorMap->NumberOfProcStraps); // Set image base imageBase = model->base(parent) + localOffset; // Add Intel image tree item index = model->addItem(localOffset, Types::Image, Subtypes::IntelImage, name, UString(), info, UByteArray(), intelImage, UByteArray(), Fixed, parent); // Descriptor // Get descriptor info UByteArray body = intelImage.left(FLASH_DESCRIPTOR_SIZE); name = UString("Descriptor region"); info = usprintf("ReservedVector:\n%02X %02X %02X %02X %02X %02X %02X %02X\n" "%02X %02X %02X %02X %02X %02X %02X %02X\nFull size: %Xh (%u)", descriptor->ReservedVector[0], descriptor->ReservedVector[1], descriptor->ReservedVector[2], descriptor->ReservedVector[3], descriptor->ReservedVector[4], descriptor->ReservedVector[5], descriptor->ReservedVector[6], descriptor->ReservedVector[7], descriptor->ReservedVector[8], descriptor->ReservedVector[9], descriptor->ReservedVector[10], descriptor->ReservedVector[11], descriptor->ReservedVector[12], descriptor->ReservedVector[13], descriptor->ReservedVector[14], descriptor->ReservedVector[15], FLASH_DESCRIPTOR_SIZE, FLASH_DESCRIPTOR_SIZE); // Add offsets of actual regions for (size_t i = 0; i < regions.size(); i++) { if (regions[i].type != Subtypes::ZeroPadding && regions[i].type != Subtypes::OnePadding && regions[i].type != Subtypes::DataPadding) info += "\n" + itemSubtypeToUString(Types::Region, regions[i].type) + usprintf(" region offset: %Xh", regions[i].offset + localOffset); } // Region access settings if (descriptorVersion == 1) { const FLASH_DESCRIPTOR_MASTER_SECTION* masterSection = (const FLASH_DESCRIPTOR_MASTER_SECTION*)calculateAddress8((UINT8*)descriptor, descriptorMap->MasterBase); info += UString("\nRegion access settings:"); info += usprintf("\nBIOS: %02Xh %02Xh ME: %02Xh %02Xh\nGbE: %02Xh %02Xh", masterSection->BiosRead, masterSection->BiosWrite, masterSection->MeRead, masterSection->MeWrite, masterSection->GbeRead, masterSection->GbeWrite); // BIOS access table info += UString("\nBIOS access table:") + UString("\n Read Write") + usprintf("\nDesc %s %s", masterSection->BiosRead & FLASH_DESCRIPTOR_REGION_ACCESS_DESC ? "Yes " : "No ", masterSection->BiosWrite & FLASH_DESCRIPTOR_REGION_ACCESS_DESC ? "Yes " : "No "); info += UString("\nBIOS Yes Yes") + usprintf("\nME %s %s", masterSection->BiosRead & FLASH_DESCRIPTOR_REGION_ACCESS_ME ? "Yes " : "No ", masterSection->BiosWrite & FLASH_DESCRIPTOR_REGION_ACCESS_ME ? "Yes " : "No "); info += usprintf("\nGbE %s %s", masterSection->BiosRead & FLASH_DESCRIPTOR_REGION_ACCESS_GBE ? "Yes " : "No ", masterSection->BiosWrite & FLASH_DESCRIPTOR_REGION_ACCESS_GBE ? "Yes " : "No "); info += usprintf("\nPDR %s %s", masterSection->BiosRead & FLASH_DESCRIPTOR_REGION_ACCESS_PDR ? "Yes " : "No ", masterSection->BiosWrite & FLASH_DESCRIPTOR_REGION_ACCESS_PDR ? "Yes " : "No "); } else if (descriptorVersion == 2) { const FLASH_DESCRIPTOR_MASTER_SECTION_V2* masterSection = (const FLASH_DESCRIPTOR_MASTER_SECTION_V2*)calculateAddress8((UINT8*)descriptor, descriptorMap->MasterBase); info += UString("\nRegion access settings:"); info += usprintf("\nBIOS: %03Xh %03Xh ME: %03Xh %03Xh\nGbE: %03Xh %03Xh EC: %03Xh %03Xh", masterSection->BiosRead, masterSection->BiosWrite, masterSection->MeRead, masterSection->MeWrite, masterSection->GbeRead, masterSection->GbeWrite, masterSection->EcRead, masterSection->EcWrite); // BIOS access table info += UString("\nBIOS access table:") + UString("\n Read Write") + usprintf("\nDesc %s %s", masterSection->BiosRead & FLASH_DESCRIPTOR_REGION_ACCESS_DESC ? "Yes " : "No ", masterSection->BiosWrite & FLASH_DESCRIPTOR_REGION_ACCESS_DESC ? "Yes " : "No "); info += UString("\nBIOS Yes Yes") + usprintf("\nME %s %s", masterSection->BiosRead & FLASH_DESCRIPTOR_REGION_ACCESS_ME ? "Yes " : "No ", masterSection->BiosWrite & FLASH_DESCRIPTOR_REGION_ACCESS_ME ? "Yes " : "No "); info += usprintf("\nGbE %s %s", masterSection->BiosRead & FLASH_DESCRIPTOR_REGION_ACCESS_GBE ? "Yes " : "No ", masterSection->BiosWrite & FLASH_DESCRIPTOR_REGION_ACCESS_GBE ? "Yes " : "No "); info += usprintf("\nPDR %s %s", masterSection->BiosRead & FLASH_DESCRIPTOR_REGION_ACCESS_PDR ? "Yes " : "No ", masterSection->BiosWrite & FLASH_DESCRIPTOR_REGION_ACCESS_PDR ? "Yes " : "No "); info += usprintf("\nEC %s %s", masterSection->BiosRead & FLASH_DESCRIPTOR_REGION_ACCESS_EC ? "Yes " : "No ", masterSection->BiosWrite & FLASH_DESCRIPTOR_REGION_ACCESS_EC ? "Yes " : "No "); // Prepend descriptor version if present if (descriptorMap->DescriptorVersion != FLASH_DESCRIPTOR_VERSION_INVALID) { const FLASH_DESCRIPTOR_VERSION* version = (const FLASH_DESCRIPTOR_VERSION*)&descriptorMap->DescriptorVersion; UString versionStr = usprintf("Flash descriptor version: %d.%d", version->Major, version->Minor); if (version->Major != FLASH_DESCRIPTOR_VERSION_MAJOR || version->Minor != FLASH_DESCRIPTOR_VERSION_MINOR) { versionStr += ", unknown"; msg(usprintf("%s: unknown flash descriptor version %d.%d", __FUNCTION__, version->Major, version->Minor)); } info = versionStr + "\n" + info; } } // VSCC table const VSCC_TABLE_ENTRY* vsccTableEntry = (const VSCC_TABLE_ENTRY*)((UINT8*)descriptor + ((UINT16)upperMap->VsccTableBase << 4)); info += UString("\nFlash chips in VSCC table:"); UINT8 vsscTableSize = upperMap->VsccTableSize * sizeof(UINT32) / sizeof(VSCC_TABLE_ENTRY); for (UINT8 i = 0; i < vsscTableSize; i++) { UString jedecId = jedecIdToUString(vsccTableEntry->VendorId, vsccTableEntry->DeviceId0, vsccTableEntry->DeviceId1); info += usprintf("\n%02X%02X%02X (", vsccTableEntry->VendorId, vsccTableEntry->DeviceId0, vsccTableEntry->DeviceId1) + jedecId + UString(")"); if (jedecId.startsWith("Unknown")) { msg(usprintf("%s: SPI flash with unknown JEDEC ID %02X%02X%02X found in VSCC table", __FUNCTION__, vsccTableEntry->VendorId, vsccTableEntry->DeviceId0, vsccTableEntry->DeviceId1), index); } vsccTableEntry++; } // Add descriptor tree item UModelIndex regionIndex = model->addItem(localOffset, Types::Region, Subtypes::DescriptorRegion, name, UString(), info, UByteArray(), body, UByteArray(), Fixed, index); // Parse regions USTATUS result = U_SUCCESS; USTATUS parseResult = U_SUCCESS; for (size_t i = 0; i < regions.size(); i++) { region = regions[i]; switch (region.type) { case Subtypes::BiosRegion: result = parseBiosRegion(region.data, region.offset, index, regionIndex); break; case Subtypes::MeRegion: result = parseMeRegion(region.data, region.offset, index, regionIndex); break; case Subtypes::GbeRegion: result = parseGbeRegion(region.data, region.offset, index, regionIndex); break; case Subtypes::PdrRegion: result = parsePdrRegion(region.data, region.offset, index, regionIndex); break; case Subtypes::DevExp1Region: result = parseDevExp1Region(region.data, region.offset, index, regionIndex); break; case Subtypes::Bios2Region: case Subtypes::MicrocodeRegion: case Subtypes::EcRegion: case Subtypes::DevExp2Region: case Subtypes::IeRegion: case Subtypes::Tgbe1Region: case Subtypes::Tgbe2Region: case Subtypes::Reserved1Region: case Subtypes::Reserved2Region: case Subtypes::PttRegion: result = parseGenericRegion(region.type, region.data, region.offset, index, regionIndex); break; case Subtypes::ZeroPadding: case Subtypes::OnePadding: case Subtypes::DataPadding: { // Add padding between regions UByteArray padding = intelImage.mid(region.offset, region.length); // Get info name = UString("Padding"); info = usprintf("Full size: %Xh (%u)", (UINT32)padding.size(), (UINT32)padding.size()); // Add tree item regionIndex = model->addItem(region.offset, Types::Padding, getPaddingType(padding), name, UString(), info, UByteArray(), padding, UByteArray(), Fixed, index); result = U_SUCCESS; } break; default: msg(usprintf("%s: region of unknown type found", __FUNCTION__), index); result = U_INVALID_FLASH_DESCRIPTOR; } // Store the first failed result as a final result if (!parseResult && result) { parseResult = result; } } return parseResult; } USTATUS FfsParser::parseGbeRegion(const UByteArray & gbe, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index) { // Check sanity if (gbe.isEmpty()) return U_EMPTY_REGION; if ((UINT32)gbe.size() < GBE_VERSION_OFFSET + sizeof(GBE_VERSION)) return U_INVALID_REGION; // Get info UString name("GbE region"); const GBE_MAC_ADDRESS* mac = (const GBE_MAC_ADDRESS*)gbe.constData(); const GBE_VERSION* version = (const GBE_VERSION*)(gbe.constData() + GBE_VERSION_OFFSET); UString info = usprintf("Full size: %Xh (%u)\nMAC: %02X:%02X:%02X:%02X:%02X:%02X\nVersion: %u.%u", (UINT32)gbe.size(), (UINT32)gbe.size(), mac->vendor[0], mac->vendor[1], mac->vendor[2], mac->device[0], mac->device[1], mac->device[2], version->major, version->minor); // Add tree item index = model->addItem(localOffset, Types::Region, Subtypes::GbeRegion, name, UString(), info, UByteArray(), gbe, UByteArray(), Fixed, parent); return U_SUCCESS; } USTATUS FfsParser::parseMeRegion(const UByteArray & me, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index) { // Check sanity if (me.isEmpty()) return U_EMPTY_REGION; // Get info UString name("ME region"); UString info = usprintf("Full size: %Xh (%u)", (UINT32)me.size(), (UINT32)me.size()); // Parse region bool versionFound = true; bool emptyRegion = false; // Check for empty region if (me.size() == me.count('\xFF') || me.size() == me.count('\x00')) { // Further parsing not needed emptyRegion = true; info += ("\nState: empty"); } else { // Search for new signature UINT32 sig2Value = ME_VERSION_SIGNATURE2; UByteArray sig2((const char*)&sig2Value, sizeof(sig2Value)); INT32 versionOffset = (INT32)me.indexOf(sig2); if (versionOffset < 0) { // New signature not found // Search for old signature UINT32 sigValue = ME_VERSION_SIGNATURE; UByteArray sig((const char*)&sigValue, sizeof(sigValue)); versionOffset = (INT32)me.indexOf(sig); if (versionOffset < 0) { info += ("\nVersion: unknown"); versionFound = false; } } // Check sanity if ((UINT32)me.size() < (UINT32)versionOffset + sizeof(ME_VERSION)) return U_INVALID_REGION; // Add version information if (versionFound) { const ME_VERSION* version = (const ME_VERSION*)(me.constData() + versionOffset); info += usprintf("\nVersion: %u.%u.%u.%u", version->Major, version->Minor, version->Bugfix, version->Build); } } // Add tree item index = model->addItem(localOffset, Types::Region, Subtypes::MeRegion, name, UString(), info, UByteArray(), me, UByteArray(), Fixed, parent); // Show messages if (emptyRegion) { msg(usprintf("%s: ME region is empty", __FUNCTION__), index); } else if (!versionFound) { msg(usprintf("%s: ME version is unknown, it can be damaged", __FUNCTION__), index); } else { meParser->parseMeRegionBody(index); } return U_SUCCESS; } USTATUS FfsParser::parsePdrRegion(const UByteArray & pdr, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index) { // Check sanity if (pdr.isEmpty()) return U_EMPTY_REGION; // Get info UString name("PDR region"); UString info = usprintf("Full size: %Xh (%u)", (UINT32)pdr.size(), (UINT32)pdr.size()); // Add tree item index = model->addItem(localOffset, Types::Region, Subtypes::PdrRegion, name, UString(), info, UByteArray(), pdr, UByteArray(), Fixed, parent); // Parse PDR region as BIOS space USTATUS result = parseRawArea(index); if (result && result != U_VOLUMES_NOT_FOUND && result != U_INVALID_VOLUME && result != U_STORES_NOT_FOUND) return result; return U_SUCCESS; } USTATUS FfsParser::parseDevExp1Region(const UByteArray & devExp1, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index) { // Check sanity if (devExp1.isEmpty()) return U_EMPTY_REGION; // Get info UString name("DevExp1 region"); UString info = usprintf("Full size: %Xh (%u)", (UINT32)devExp1.size(), (UINT32)devExp1.size()); bool emptyRegion = false; // Check for empty region if (devExp1.size() == devExp1.count('\xFF') || devExp1.size() == devExp1.count('\x00')) { // Further parsing not needed emptyRegion = true; info += ("\nState: empty"); } // Add tree item index = model->addItem(localOffset, Types::Region, Subtypes::DevExp1Region, name, UString(), info, UByteArray(), devExp1, UByteArray(), Fixed, parent); if (!emptyRegion) { meParser->parseMeRegionBody(index); } return U_SUCCESS; } USTATUS FfsParser::parseGenericRegion(const UINT8 subtype, const UByteArray & region, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index) { // Check sanity if (region.isEmpty()) return U_EMPTY_REGION; // Get info UString name = itemSubtypeToUString(Types::Region, subtype) + UString(" region"); UString info = usprintf("Full size: %Xh (%u)", (UINT32)region.size(), (UINT32)region.size()); // Add tree item index = model->addItem(localOffset, Types::Region, subtype, name, UString(), info, UByteArray(), region, UByteArray(), Fixed, parent); return U_SUCCESS; } USTATUS FfsParser::parseBiosRegion(const UByteArray & bios, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index) { // Sanity check if (bios.isEmpty()) return U_EMPTY_REGION; // Get info UString name("BIOS region"); UString info = usprintf("Full size: %Xh (%u)", (UINT32)bios.size(), (UINT32)bios.size()); // Add tree item index = model->addItem(localOffset, Types::Region, Subtypes::BiosRegion, name, UString(), info, UByteArray(), bios, UByteArray(), Fixed, parent); return parseRawArea(index); } USTATUS FfsParser::parseRawArea(const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // Get item data UByteArray data = model->body(index); UINT32 headerSize = (UINT32)model->header(index).size(); USTATUS result; UString name; UString info; // Search for the first item UINT8 prevItemType = 0; UINT32 prevItemOffset = 0; UINT32 prevItemSize = 0; UINT32 prevItemAltSize = 0; result = findNextRawAreaItem(index, 0, prevItemType, prevItemOffset, prevItemSize, prevItemAltSize); if (result) { // No need to parse further return U_SUCCESS; } // Set base of protected regions to be the first volume if (model->type(index) == Types::Region && model->subtype(index) == Subtypes::BiosRegion) { protectedRegionsBase = (UINT64)model->base(index) + prevItemOffset; } // First item is not at the beginning of this raw area if (prevItemOffset > 0) { // Get info UByteArray padding = data.left(prevItemOffset); name = UString("Padding"); info = usprintf("Full size: %Xh (%u)", (UINT32)padding.size(), (UINT32)padding.size()); // Add tree item model->addItem(headerSize, Types::Padding, getPaddingType(padding), name, UString(), info, UByteArray(), padding, UByteArray(), Fixed, index); } // Search for and parse all items UINT8 itemType = prevItemType; UINT32 itemOffset = prevItemOffset; UINT32 itemSize = prevItemSize; UINT32 itemAltSize = prevItemAltSize; while (!result) { // Padding between items if (itemOffset > prevItemOffset + prevItemSize) { UINT32 paddingOffset = prevItemOffset + prevItemSize; UINT32 paddingSize = itemOffset - paddingOffset; UByteArray padding = data.mid(paddingOffset, paddingSize); // Get info name = UString("Padding"); info = usprintf("Full size: %Xh (%u)", (UINT32)padding.size(), (UINT32)padding.size()); // Add tree item model->addItem(headerSize + paddingOffset, Types::Padding, getPaddingType(padding), name, UString(), info, UByteArray(), padding, UByteArray(), Fixed, index); } // Check that item is fully present in input if (itemSize > (UINT32)data.size() || itemOffset + itemSize > (UINT32)data.size()) { // Mark the rest as padding and finish parsing UByteArray padding = data.mid(itemOffset); // Get info name = UString("Padding"); info = usprintf("Full size: %Xh (%u)", (UINT32)padding.size(), (UINT32)padding.size()); // Add tree item UModelIndex paddingIndex = model->addItem(headerSize + itemOffset, Types::Padding, getPaddingType(padding), name, UString(), info, UByteArray(), padding, UByteArray(), Fixed, index); msg(usprintf("%s: one of objects inside overlaps the end of data", __FUNCTION__), paddingIndex); // Update variables prevItemOffset = itemOffset; prevItemSize = (UINT32)padding.size(); break; } // Parse current volume header if (itemType == Types::Volume) { UModelIndex volumeIndex; UByteArray volume = data.mid(itemOffset, itemSize); result = parseVolumeHeader(volume, headerSize + itemOffset, index, volumeIndex); if (result) { msg(usprintf("%s: volume header parsing failed with error ", __FUNCTION__) + errorCodeToUString(result), index); } else { // Show messages if (itemSize != itemAltSize) msg(usprintf("%s: volume size stored in header %Xh differs from calculated using block map %Xh", __FUNCTION__, itemSize, itemAltSize), volumeIndex); } } else if (itemType == Types::Microcode) { UModelIndex microcodeIndex; UByteArray microcode = data.mid(itemOffset, itemSize); result = parseIntelMicrocodeHeader(microcode, headerSize + itemOffset, index, microcodeIndex); if (result) { msg(usprintf("%s: microcode header parsing failed with error ", __FUNCTION__) + errorCodeToUString(result), index); } } else if (itemType == Types::BpdtStore) { UByteArray bpdtStore = data.mid(itemOffset, itemSize); // Get info name = UString("BPDT region"); info = usprintf("Full size: %Xh (%u)", (UINT32)bpdtStore.size(), (UINT32)bpdtStore.size()); // Add tree item UModelIndex bpdtIndex = model->addItem(headerSize + itemOffset, Types::BpdtStore, 0, name, UString(), info, UByteArray(), bpdtStore, UByteArray(), Fixed, index); // Parse BPDT region UModelIndex bpdtPtIndex; result = parseBpdtRegion(bpdtStore, 0, 0, bpdtIndex, bpdtPtIndex); if (result) { msg(usprintf("%s: BPDT store parsing failed with error ", __FUNCTION__) + errorCodeToUString(result), index); } } else { return U_UNKNOWN_ITEM_TYPE; } // Go to next item prevItemOffset = itemOffset; prevItemSize = itemSize; prevItemType = itemType; result = findNextRawAreaItem(index, itemOffset + prevItemSize, itemType, itemOffset, itemSize, itemAltSize); // Silence value not used after assignment warning (void)prevItemType; } // Padding at the end of RAW area itemOffset = prevItemOffset + prevItemSize; if ((UINT32)data.size() > itemOffset) { UByteArray padding = data.mid(itemOffset); // Get info name = UString("Padding"); info = usprintf("Full size: %Xh (%u)", (UINT32)padding.size(), (UINT32)padding.size()); // Add tree item model->addItem(headerSize + itemOffset, Types::Padding, getPaddingType(padding), name, UString(), info, UByteArray(), padding, UByteArray(), Fixed, index); } // Parse bodies for (int i = 0; i < model->rowCount(index); i++) { UModelIndex current = index.model()->index(i, 0, index); switch (model->type(current)) { case Types::Volume: parseVolumeBody(current); break; case Types::Microcode: // Parsing already done break; case Types::BpdtStore: // Parsing already done break; case Types::BpdtPartition: // Parsing already done break; case Types::Padding: // No parsing required break; default: return U_UNKNOWN_ITEM_TYPE; } } return U_SUCCESS; } USTATUS FfsParser::parseVolumeHeader(const UByteArray & volume, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index) { // Sanity check if (volume.isEmpty()) return U_INVALID_PARAMETER; // Check that there is space for the volume header if ((UINT32)volume.size() < sizeof(EFI_FIRMWARE_VOLUME_HEADER)) { msg(usprintf("%s: input volume size %Xh (%u) is smaller than volume header size 40h (64)", __FUNCTION__, (UINT32)volume.size(), (UINT32)volume.size())); return U_INVALID_VOLUME; } // Populate volume header const EFI_FIRMWARE_VOLUME_HEADER* volumeHeader = (const EFI_FIRMWARE_VOLUME_HEADER*)(volume.constData()); // Check sanity of HeaderLength value if ((UINT32)ALIGN8(volumeHeader->HeaderLength) > (UINT32)volume.size()) { msg(usprintf("%s: volume header overlaps the end of data", __FUNCTION__)); return U_INVALID_VOLUME; } // Check sanity of ExtHeaderOffset value if (volumeHeader->Revision > 1 && volumeHeader->ExtHeaderOffset && (UINT32)ALIGN8(volumeHeader->ExtHeaderOffset + sizeof(EFI_FIRMWARE_VOLUME_EXT_HEADER)) > (UINT32)volume.size()) { msg(usprintf("%s: extended volume header overlaps the end of data", __FUNCTION__)); return U_INVALID_VOLUME; } // Calculate volume header size UINT32 headerSize; EFI_GUID extendedHeaderGuid = {0, 0, 0, {0, 0, 0, 0, 0, 0, 0, 0 }}; bool hasExtendedHeader = false; if (volumeHeader->Revision > 1 && volumeHeader->ExtHeaderOffset) { hasExtendedHeader = true; const EFI_FIRMWARE_VOLUME_EXT_HEADER* extendedHeader = (const EFI_FIRMWARE_VOLUME_EXT_HEADER*)(volume.constData() + volumeHeader->ExtHeaderOffset); headerSize = volumeHeader->ExtHeaderOffset + extendedHeader->ExtHeaderSize; extendedHeaderGuid = extendedHeader->FvName; } else { headerSize = volumeHeader->HeaderLength; } // Extended header end can be unaligned headerSize = ALIGN8(headerSize); // Check for volume structure to be known bool isUnknown = true; bool isNvramVolume = false; bool isMicrocodeVolume = false; UINT8 ffsVersion = 0; // Check for FFS v2 volume UByteArray guid = UByteArray((const char*)&volumeHeader->FileSystemGuid, sizeof(EFI_GUID)); if (std::find(FFSv2Volumes.begin(), FFSv2Volumes.end(), guid) != FFSv2Volumes.end()) { isUnknown = false; ffsVersion = 2; } // Check for FFS v3 volume else if (std::find(FFSv3Volumes.begin(), FFSv3Volumes.end(), guid) != FFSv3Volumes.end()) { isUnknown = false; ffsVersion = 3; } // Check for VSS NVRAM volume else if (guid == NVRAM_MAIN_STORE_VOLUME_GUID || guid == NVRAM_ADDITIONAL_STORE_VOLUME_GUID) { isUnknown = false; isNvramVolume = true; } // Check for Microcode volume else if (guid == EFI_APPLE_MICROCODE_VOLUME_GUID) { isUnknown = false; isMicrocodeVolume = true; headerSize = EFI_APPLE_MICROCODE_VOLUME_HEADER_SIZE; } // Check volume revision and alignment bool msgAlignmentBitsSet = false; bool msgUnaligned = false; bool msgUnknownRevision = false; UINT32 alignment = 0x10000; // Default volume alignment is 64K if (volumeHeader->Revision == 1) { // Acquire alignment capability bit bool alignmentCap = (volumeHeader->Attributes & EFI_FVB_ALIGNMENT_CAP) != 0; if (!alignmentCap) { if (volumeHeader->Attributes & 0xFFFF0000) msgAlignmentBitsSet = true; } // Do not check for volume alignment on revision 1 volumes // No one gives a single damn about setting it correctly } else if (volumeHeader->Revision == 2) { // Acquire alignment alignment = (UINT32)(1UL << ((volumeHeader->Attributes & EFI_FVB2_ALIGNMENT) >> 16)); // Check alignment if (!isUnknown && !model->compressed(parent) // Alignment checks don't really make sense for compressed volumes because they have to be extracted into memory, and by that point it's unlikely that the module doing such extraction will misalign them && ((model->base(parent) + localOffset - imageBase) % alignment) != 0) // Explicit "is not zero" here for better code readability msgUnaligned = true; } else { msgUnknownRevision = true; } // Check attributes // Determine value of empty byte UINT8 emptyByte = volumeHeader->Attributes & EFI_FVB_ERASE_POLARITY ? 0xFF : 0x00; // Check for AppleCRC32 and UsedSpace in ZeroVector bool hasAppleCrc32 = false; UINT32 volumeSize = (UINT32)volume.size(); UINT32 appleCrc32 = *(UINT32*)(volume.constData() + 8); UINT32 usedSpace = *(UINT32*)(volume.constData() + 12); if (appleCrc32 != 0) { // Calculate CRC32 of the volume body UINT32 crc = (UINT32)crc32(0, (const UINT8*)(volume.constData() + volumeHeader->HeaderLength), volumeSize - volumeHeader->HeaderLength); if (crc == appleCrc32) { hasAppleCrc32 = true; } } // Check header checksum by recalculating it bool msgInvalidChecksum = false; if (volumeHeader->HeaderLength < sizeof(EFI_FIRMWARE_VOLUME_HEADER)) { msg(usprintf("%s: input volume header length %04Xh (%hu) is smaller than volume header size", __FUNCTION__, volumeHeader->HeaderLength, volumeHeader->HeaderLength)); return U_INVALID_VOLUME; } UByteArray tempHeader((const char*)volumeHeader, volumeHeader->HeaderLength); ((EFI_FIRMWARE_VOLUME_HEADER*)tempHeader.data())->Checksum = 0; UINT16 calculated = calculateChecksum16((const UINT16*)tempHeader.constData(), volumeHeader->HeaderLength); if (volumeHeader->Checksum != calculated) msgInvalidChecksum = true; // Get info if (headerSize >= volume.size()) { return U_INVALID_VOLUME; } UByteArray header = volume.left(headerSize); UByteArray body = volume.mid(headerSize); UString name = guidToUString(volumeHeader->FileSystemGuid); UString info = usprintf("ZeroVector:\n%02X %02X %02X %02X %02X %02X %02X %02X\n" "%02X %02X %02X %02X %02X %02X %02X %02X\nSignature: _FVH\nFileSystem GUID: ", volumeHeader->ZeroVector[0], volumeHeader->ZeroVector[1], volumeHeader->ZeroVector[2], volumeHeader->ZeroVector[3], volumeHeader->ZeroVector[4], volumeHeader->ZeroVector[5], volumeHeader->ZeroVector[6], volumeHeader->ZeroVector[7], volumeHeader->ZeroVector[8], volumeHeader->ZeroVector[9], volumeHeader->ZeroVector[10], volumeHeader->ZeroVector[11], volumeHeader->ZeroVector[12], volumeHeader->ZeroVector[13], volumeHeader->ZeroVector[14], volumeHeader->ZeroVector[15]) + guidToUString(volumeHeader->FileSystemGuid, false) \ + usprintf("\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\nRevision: %u\nAttributes: %08Xh\nErase polarity: %u\nChecksum: %04Xh", volumeSize, volumeSize, headerSize, headerSize, volumeSize - headerSize, volumeSize - headerSize, volumeHeader->Revision, volumeHeader->Attributes, (emptyByte ? 1 : 0), volumeHeader->Checksum) + (msgInvalidChecksum ? usprintf(", invalid, should be %04Xh", calculated) : UString(", valid")); // Extended header present // volumeHeader->ExtHeaderOffset should be aligned to 4 bytes if (volumeHeader->ExtHeaderOffset % 4) { msg(usprintf("%s: ExtHeaderOffset %04Xh (%hu) is not aligned by 4 bytes", __FUNCTION__, volumeHeader->ExtHeaderOffset, volumeHeader->ExtHeaderOffset)); return U_INVALID_VOLUME; } if (volumeHeader->Revision > 1 && volumeHeader->ExtHeaderOffset) { if (volume.size() < volumeHeader->ExtHeaderOffset + sizeof(EFI_FIRMWARE_VOLUME_EXT_HEADER)) { return U_INVALID_VOLUME; } const EFI_FIRMWARE_VOLUME_EXT_HEADER* extendedHeader = (const EFI_FIRMWARE_VOLUME_EXT_HEADER*)(volume.constData() + volumeHeader->ExtHeaderOffset); info += usprintf("\nExtended header size: %Xh (%u)\nVolume GUID: ", extendedHeader->ExtHeaderSize, extendedHeader->ExtHeaderSize) + guidToUString(extendedHeader->FvName, false); name = guidToUString(extendedHeader->FvName); // Replace FFS GUID with volume GUID } // Add text UString text; if (hasAppleCrc32) text += UString("AppleCRC32 "); // Add tree item UINT8 subtype = Subtypes::UnknownVolume; if (!isUnknown) { if (ffsVersion == 2) subtype = Subtypes::Ffs2Volume; else if (ffsVersion == 3) subtype = Subtypes::Ffs3Volume; else if (isNvramVolume) subtype = Subtypes::NvramVolume; else if (isMicrocodeVolume) subtype = Subtypes::MicrocodeVolume; } index = model->addItem(localOffset, Types::Volume, subtype, name, text, info, header, body, UByteArray(), Movable, parent); // Set parsing data for created volume VOLUME_PARSING_DATA pdata = {}; pdata.emptyByte = emptyByte; pdata.ffsVersion = ffsVersion; pdata.hasExtendedHeader = hasExtendedHeader ? TRUE : FALSE; pdata.extendedHeaderGuid = extendedHeaderGuid; pdata.alignment = alignment; pdata.revision = volumeHeader->Revision; pdata.hasAppleCrc32 = hasAppleCrc32; pdata.hasValidUsedSpace = FALSE; // Will be updated later, if needed pdata.usedSpace = usedSpace; pdata.isWeakAligned = (volumeHeader->Revision > 1 && (volumeHeader->Attributes & EFI_FVB2_WEAK_ALIGNMENT)); model->setParsingData(index, UByteArray((const char*)&pdata, sizeof(pdata))); // Show messages if (isUnknown) msg(usprintf("%s: unknown file system ", __FUNCTION__) + guidToUString(volumeHeader->FileSystemGuid), index); if (msgInvalidChecksum) msg(usprintf("%s: volume header checksum is invalid", __FUNCTION__), index); if (msgAlignmentBitsSet) msg(usprintf("%s: alignment bits set on volume without alignment capability", __FUNCTION__), index); if (msgUnaligned) msg(usprintf("%s: unaligned volume", __FUNCTION__), index); if (msgUnknownRevision) msg(usprintf("%s: unknown volume revision %u", __FUNCTION__, volumeHeader->Revision), index); return U_SUCCESS; } bool FfsParser::microcodeHeaderValid(const INTEL_MICROCODE_HEADER* ucodeHeader) { bool reservedBytesValid = true; // Check CpuFlags reserved bytes to be zero for (UINT32 i = 0; i < sizeof(ucodeHeader->ProcessorFlagsReserved); i++) { if (ucodeHeader->ProcessorFlagsReserved[i] != 0x00) { reservedBytesValid = false; break; } } if (!reservedBytesValid) { return false; } // Check data size to be multiple of 4 and less than 0x1000000 if (ucodeHeader->DataSize % 4 != 0 || ucodeHeader->DataSize > 0xFFFFFF) { return false; } // Check TotalSize to be greater or equal than DataSize and less than 0x1000000 if (ucodeHeader->TotalSize < ucodeHeader->DataSize || ucodeHeader->TotalSize > 0xFFFFFF) { return false; } // Check date to be sane // Check day to be in 0x01-0x09, 0x10-0x19, 0x20-0x29, 0x30-0x31 if (ucodeHeader->DateDay < 0x01 || (ucodeHeader->DateDay > 0x09 && ucodeHeader->DateDay < 0x10) || (ucodeHeader->DateDay > 0x19 && ucodeHeader->DateDay < 0x20) || (ucodeHeader->DateDay > 0x29 && ucodeHeader->DateDay < 0x30) || ucodeHeader->DateDay > 0x31) { return false; } // Check month to be in 0x01-0x09, 0x10-0x12 if (ucodeHeader->DateMonth < 0x01 || (ucodeHeader->DateMonth > 0x09 && ucodeHeader->DateMonth < 0x10) || ucodeHeader->DateMonth > 0x12) { return FALSE; } // Check year to be in 0x1990-0x1999, 0x2000-0x2009, 0x2010-0x2019, 0x2020-0x2029, 0x2030-0x2030, 0x2040-0x2049 if (ucodeHeader->DateYear < 0x1990 || (ucodeHeader->DateYear > 0x1999 && ucodeHeader->DateYear < 0x2000) || (ucodeHeader->DateYear > 0x2009 && ucodeHeader->DateYear < 0x2010) || (ucodeHeader->DateYear > 0x2019 && ucodeHeader->DateYear < 0x2020) || (ucodeHeader->DateYear > 0x2029 && ucodeHeader->DateYear < 0x2030) || (ucodeHeader->DateYear > 0x2039 && ucodeHeader->DateYear < 0x2040) || ucodeHeader->DateYear > 0x2049) { return FALSE; } // Check HeaderVersion to be 1. if (ucodeHeader->HeaderVersion != 1) { return FALSE; } // Check LoaderRevision to be 1. if (ucodeHeader->LoaderRevision != 1) { return FALSE; } return TRUE; } USTATUS FfsParser::findNextRawAreaItem(const UModelIndex & index, const UINT32 localOffset, UINT8 & nextItemType, UINT32 & nextItemOffset, UINT32 & nextItemSize, UINT32 & nextItemAlternativeSize) { UByteArray data = model->body(index); UINT32 dataSize = (UINT32)data.size(); if (dataSize < sizeof(UINT32)) return U_STORES_NOT_FOUND; UINT32 offset = localOffset; for (; offset < dataSize - sizeof(UINT32); offset++) { const UINT32* currentPos = (const UINT32*)(data.constData() + offset); UINT32 restSize = dataSize - offset; if (readUnaligned(currentPos) == INTEL_MICROCODE_HEADER_VERSION_1) {// Intel microcode // Check data size if (restSize < sizeof(INTEL_MICROCODE_HEADER)) { continue; } // Check microcode header candidate const INTEL_MICROCODE_HEADER* ucodeHeader = (const INTEL_MICROCODE_HEADER*)currentPos; if (FALSE == microcodeHeaderValid(ucodeHeader)) { continue; } // Check size candidate if (ucodeHeader->TotalSize == 0) continue; // All checks passed, microcode found nextItemType = Types::Microcode; nextItemSize = ucodeHeader->TotalSize; nextItemAlternativeSize = ucodeHeader->TotalSize; nextItemOffset = offset; break; } else if (readUnaligned(currentPos) == EFI_FV_SIGNATURE) { if (offset < EFI_FV_SIGNATURE_OFFSET) continue; // Prevent OOB access if (restSize + EFI_FV_SIGNATURE_OFFSET < sizeof(EFI_FIRMWARE_VOLUME_HEADER)) { continue; } const EFI_FIRMWARE_VOLUME_HEADER* volumeHeader = (const EFI_FIRMWARE_VOLUME_HEADER*)(data.constData() + offset - EFI_FV_SIGNATURE_OFFSET); restSize -= sizeof(EFI_FIRMWARE_VOLUME_HEADER); if (volumeHeader->FvLength < sizeof(EFI_FIRMWARE_VOLUME_HEADER) + 2 * sizeof(EFI_FV_BLOCK_MAP_ENTRY) || volumeHeader->FvLength >= 0xFFFFFFFFUL) { continue; } if (volumeHeader->Revision != 1 && volumeHeader->Revision != 2) { continue; } // Calculate alternative volume size using its BlockMap nextItemAlternativeSize = 0; // Prevent OOB access if (restSize + EFI_FV_SIGNATURE_OFFSET < sizeof(EFI_FIRMWARE_VOLUME_HEADER)) { continue; } const EFI_FV_BLOCK_MAP_ENTRY* entry = (const EFI_FV_BLOCK_MAP_ENTRY*)(data.constData() + offset - EFI_FV_SIGNATURE_OFFSET + sizeof(EFI_FIRMWARE_VOLUME_HEADER)); restSize -= sizeof(EFI_FV_BLOCK_MAP_ENTRY); while (entry->NumBlocks != 0 && entry->Length != 0) { // Check if we are past the end of the volume if (restSize + EFI_FV_SIGNATURE_OFFSET < sizeof(EFI_FV_BLOCK_MAP_ENTRY)) { // This volume is broken, but we can't use continue here because we need to continue the outer loop goto continue_searching; } nextItemAlternativeSize += entry->NumBlocks * entry->Length; restSize -= sizeof(EFI_FV_BLOCK_MAP_ENTRY); entry += 1; } // All checks passed, volume found nextItemType = Types::Volume; nextItemSize = (UINT32)volumeHeader->FvLength; nextItemOffset = offset - EFI_FV_SIGNATURE_OFFSET; break; continue_searching: {} } else if (readUnaligned(currentPos) == BPDT_GREEN_SIGNATURE || readUnaligned(currentPos) == BPDT_YELLOW_SIGNATURE) { // Check data size if (restSize < sizeof(BPDT_HEADER)) continue; const BPDT_HEADER *bpdtHeader = (const BPDT_HEADER *)currentPos; // Check NumEntries to be sane if (bpdtHeader->NumEntries > 0x100) continue; // Check HeaderVersion to be 1 if (bpdtHeader->HeaderVersion != BPDT_HEADER_VERSION_1) // Check only for IFWI 2.0 headers in raw areas continue; // Check RedundancyFlag to be 0 or 1 if (bpdtHeader->RedundancyFlag != 0 && bpdtHeader->RedundancyFlag != 1) // Check only for IFWI 2.0 headers in raw areas continue; UINT32 ptBodySize = bpdtHeader->NumEntries * sizeof(BPDT_ENTRY); UINT32 ptSize = sizeof(BPDT_HEADER) + ptBodySize; // Check data size again if (restSize < ptSize) continue; UINT32 sizeCandidate = 0; // Parse partition table const BPDT_ENTRY* firstPtEntry = (const BPDT_ENTRY*)((const UINT8*)bpdtHeader + sizeof(BPDT_HEADER)); for (UINT16 i = 0; i < bpdtHeader->NumEntries; i++) { // Populate entry header const BPDT_ENTRY* ptEntry = firstPtEntry + i; // Check that entry is present in the image if (ptEntry->Offset != 0 && ptEntry->Offset != 0xFFFFFFFF && ptEntry->Size != 0 && sizeCandidate < ptEntry->Offset + ptEntry->Size) { sizeCandidate = ptEntry->Offset + ptEntry->Size; } } // Check size candidate if (sizeCandidate == 0) continue; // All checks passed, BPDT found nextItemType = Types::BpdtStore; nextItemSize = sizeCandidate; nextItemAlternativeSize = sizeCandidate; nextItemOffset = offset; break; } } // No more stores found if (offset >= dataSize - sizeof(UINT32)) { return U_STORES_NOT_FOUND; } return U_SUCCESS; } USTATUS FfsParser::parseVolumeNonUefiData(const UByteArray & data, const UINT32 localOffset, const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // Get info UString info = usprintf("Full size: %Xh (%u)", (UINT32)data.size(), (UINT32)data.size()); // Add padding tree item UModelIndex paddingIndex = model->addItem(localOffset, Types::Padding, Subtypes::DataPadding, UString("Non-UEFI data"), UString(), info, UByteArray(), data, UByteArray(), Fixed, index); msg(usprintf("%s: non-UEFI data found in volume's free space", __FUNCTION__), paddingIndex); // Parse contents as RAW area return parseRawArea(paddingIndex); } USTATUS FfsParser::parseVolumeBody(const UModelIndex & index) { // Sanity check if (!index.isValid()) { return U_INVALID_PARAMETER; } // Get volume header size and body UByteArray volumeBody = model->body(index); UINT32 volumeHeaderSize = (UINT32)model->header(index).size(); // Parse VSS NVRAM volumes with a dedicated function if (model->subtype(index) == Subtypes::NvramVolume) { return nvramParser->parseNvramVolumeBody(index); } // Parse Microcode volume with a dedicated function if (model->subtype(index) == Subtypes::MicrocodeVolume) { return parseMicrocodeVolumeBody(index); } // Get required values from parsing data UINT8 emptyByte = 0xFF; UINT8 ffsVersion = 2; UINT32 usedSpace = 0; UINT8 revision = 2; if (model->hasEmptyParsingData(index) == false) { UByteArray data = model->parsingData(index); const VOLUME_PARSING_DATA* pdata = (const VOLUME_PARSING_DATA*)data.constData(); emptyByte = pdata->emptyByte; ffsVersion = pdata->ffsVersion; usedSpace = pdata->usedSpace; revision = pdata->revision; } // Check for unknown FFS version if (ffsVersion != 2 && ffsVersion != 3) { msg(usprintf("%s: unknown FFS version %d", __FUNCTION__, ffsVersion), index); return U_SUCCESS; } // Search for and parse all files UINT32 volumeBodySize = (UINT32)volumeBody.size(); UINT32 fileOffset = 0; while (fileOffset < volumeBodySize) { UINT32 fileSize = getFileSize(volumeBody, fileOffset, ffsVersion, revision); if (fileSize == 0) { msg(usprintf("%s: file header parsing failed with invalid size", __FUNCTION__), index); break; // Exit from parsing loop } // Check that we are at the empty space UByteArray header = volumeBody.mid(fileOffset, (int)std::min(sizeof(EFI_FFS_FILE_HEADER), (size_t)volumeBodySize - fileOffset)); if (header.count(emptyByte) == header.size()) { //Empty space // Check volume usedSpace entry to be valid if (usedSpace > 0 && usedSpace == fileOffset + volumeHeaderSize) { if (model->hasEmptyParsingData(index) == false) { UByteArray data = model->parsingData(index); VOLUME_PARSING_DATA* pdata = (VOLUME_PARSING_DATA*)data.data(); pdata->hasValidUsedSpace = TRUE; model->setParsingData(index, data); model->setText(index, model->text(index) + "UsedSpace "); } } // Check free space to be actually free UByteArray freeSpace = volumeBody.mid(fileOffset); if (freeSpace.count(emptyByte) != freeSpace.size()) { // Search for the first non-empty byte UINT32 i; UINT32 size = (UINT32)freeSpace.size(); const UINT8* current = (UINT8*)freeSpace.constData(); for (i = 0; i < size; i++) { if (*current++ != emptyByte) { break; // Exit from parsing loop } } // Align found index to file alignment // It must be possible because minimum 16 bytes of empty were found before if (i != ALIGN8(i)) { i = ALIGN8(i) - 8; } // Add all bytes before as free space if (i > 0) { UByteArray free = freeSpace.left(i); // Get info UString info = usprintf("Full size: %Xh (%u)", (UINT32)free.size(), (UINT32)free.size()); // Add free space item model->addItem(volumeHeaderSize + fileOffset, Types::FreeSpace, 0, UString("Volume free space"), UString(), info, UByteArray(), free, UByteArray(), Movable, index); } // Parse non-UEFI data parseVolumeNonUefiData(freeSpace.mid(i), volumeHeaderSize + fileOffset + i, index); } else { // Get info UString info = usprintf("Full size: %Xh (%u)", (UINT32)freeSpace.size(), (UINT32)freeSpace.size()); // Add free space item model->addItem(volumeHeaderSize + fileOffset, Types::FreeSpace, 0, UString("Volume free space"), UString(), info, UByteArray(), freeSpace, UByteArray(), Movable, index); } break; // Exit from parsing loop } // We aren't at the end of empty space // Check that the remaining space can still have a file in it if (volumeBodySize - fileOffset < sizeof(EFI_FFS_FILE_HEADER) // Remaining space is smaller than the smallest possible file || volumeBodySize - fileOffset < fileSize) { // Remaining space is smaller than non-empty file size // Parse non-UEFI data parseVolumeNonUefiData(volumeBody.mid(fileOffset), volumeHeaderSize + fileOffset, index); break; // Exit from parsing loop } // Parse current file's header UModelIndex fileIndex; USTATUS result = parseFileHeader(volumeBody.mid(fileOffset, fileSize), volumeHeaderSize + fileOffset, index, fileIndex); if (result) { msg(usprintf("%s: file header parsing failed with error ", __FUNCTION__) + errorCodeToUString(result), index); } // Move to next file fileOffset += fileSize; // TODO: check that alignment bytes are all of erase polarity bit, warn if not so fileOffset = ALIGN8(fileOffset); } // Check for duplicate GUIDs for (int i = 0; i < model->rowCount(index); i++) { UModelIndex current = index.model()->index(i, 0, index); // Skip non-file entries and padding files if (model->type(current) != Types::File || model->subtype(current) == EFI_FV_FILETYPE_PAD) { continue; } // Get current file GUID UByteArray currentGuid(model->header(current).constData(), sizeof(EFI_GUID)); // Check files after current for having an equal GUID for (int j = i + 1; j < model->rowCount(index); j++) { UModelIndex another = index.model()->index(j, 0, index); // Skip non-file entries if (model->type(another) != Types::File) { continue; } // Get another file GUID UByteArray anotherGuid(model->header(another).constData(), sizeof(EFI_GUID)); // Check GUIDs for being equal if (currentGuid == anotherGuid) { msg(usprintf("%s: file with duplicate GUID ", __FUNCTION__) + guidToUString(readUnaligned((EFI_GUID*)(anotherGuid.data()))), another); } } } // Parse bodies for (int i = 0; i < model->rowCount(index); i++) { UModelIndex current = index.model()->index(i, 0, index); switch (model->type(current)) { case Types::File: parseFileBody(current); break; case Types::Padding: case Types::FreeSpace: // No parsing required break; default: return U_UNKNOWN_ITEM_TYPE; } } return U_SUCCESS; } UINT32 FfsParser::getFileSize(const UByteArray & volume, const UINT32 fileOffset, const UINT8 ffsVersion, const UINT8 revision) { if ((UINT32)volume.size() < fileOffset + sizeof(EFI_FFS_FILE_HEADER)) { return 0; } const EFI_FFS_FILE_HEADER* fileHeader = (const EFI_FFS_FILE_HEADER*)(volume.constData() + fileOffset); if (ffsVersion == 2) { UINT32 size = uint24ToUint32(fileHeader->Size); // Special case of Lenovo large file insize FFSv2 Rev2 volume if (revision == 2 && (fileHeader->Attributes & FFS_ATTRIB_LARGE_FILE)) { if ((UINT32)volume.size() < fileOffset + sizeof(EFI_FFS_FILE_HEADER2_LENOVO)) { return 0; } const EFI_FFS_FILE_HEADER2_LENOVO* fileHeader2Lenovo = (const EFI_FFS_FILE_HEADER2_LENOVO*)(volume.constData() + fileOffset); return (UINT32)fileHeader2Lenovo->ExtendedSize; } return size; } else if (ffsVersion == 3) { if (fileHeader->Attributes & FFS_ATTRIB_LARGE_FILE) { if ((UINT32)volume.size() < fileOffset + sizeof(EFI_FFS_FILE_HEADER2)) { return 0; } const EFI_FFS_FILE_HEADER2* fileHeader2 = (const EFI_FFS_FILE_HEADER2*)(volume.constData() + fileOffset); return (UINT32)fileHeader2->ExtendedSize; } return uint24ToUint32(fileHeader->Size); } return 0; } USTATUS FfsParser::parseFileHeader(const UByteArray & file, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index) { // Sanity check if (file.isEmpty()) { return U_INVALID_PARAMETER; } if ((UINT32)file.size() < sizeof(EFI_FFS_FILE_HEADER)) { return U_INVALID_FILE; } // Obtain required information from parent volume UINT8 ffsVersion = 2; bool isWeakAligned = false; UINT32 volumeAlignment = 0xFFFFFFFF; UINT8 volumeRevision = 2; UModelIndex parentVolumeIndex = model->type(parent) == Types::Volume ? parent : model->findParentOfType(parent, Types::Volume); if (parentVolumeIndex.isValid() && model->hasEmptyParsingData(parentVolumeIndex) == false) { UByteArray data = model->parsingData(parentVolumeIndex); const VOLUME_PARSING_DATA* pdata = (const VOLUME_PARSING_DATA*)data.constData(); ffsVersion = pdata->ffsVersion; volumeAlignment = pdata->alignment; volumeRevision = pdata->revision; isWeakAligned = pdata->isWeakAligned; } // Get file header UByteArray header = file.left(sizeof(EFI_FFS_FILE_HEADER)); EFI_FFS_FILE_HEADER* tempFileHeader = (EFI_FFS_FILE_HEADER*)header.data(); if (tempFileHeader->Attributes & FFS_ATTRIB_LARGE_FILE) { if (ffsVersion == 2 && volumeRevision == 2) { if ((UINT32)file.size() < sizeof(EFI_FFS_FILE_HEADER2_LENOVO)) return U_INVALID_FILE; header = file.left(sizeof(EFI_FFS_FILE_HEADER2_LENOVO)); } if (ffsVersion == 3) { if ((UINT32)file.size() < sizeof(EFI_FFS_FILE_HEADER2)) return U_INVALID_FILE; header = file.left(sizeof(EFI_FFS_FILE_HEADER2)); } } const EFI_FFS_FILE_HEADER* fileHeader = (const EFI_FFS_FILE_HEADER*)header.constData(); // Check file alignment bool msgUnalignedFile = false; UINT8 alignmentPower = ffsAlignmentTable[(fileHeader->Attributes & FFS_ATTRIB_DATA_ALIGNMENT) >> 3]; if (volumeRevision > 1 && (fileHeader->Attributes & FFS_ATTRIB_DATA_ALIGNMENT2)) { alignmentPower = ffsAlignment2Table[(fileHeader->Attributes & FFS_ATTRIB_DATA_ALIGNMENT) >> 3]; } UINT32 alignment = (UINT32)(1UL << alignmentPower); if ((localOffset + header.size()) % alignment) { msgUnalignedFile = true; } // Check file alignment against volume alignment bool msgFileAlignmentIsGreaterThanVolumeAlignment = false; if (!isWeakAligned && volumeAlignment < alignment) { msgFileAlignmentIsGreaterThanVolumeAlignment = true; } // Get file body UByteArray body = file.mid(header.size()); // Check for file tail presence UByteArray tail; bool msgInvalidTailValue = false; if (volumeRevision == 1 && (fileHeader->Attributes & FFS_ATTRIB_TAIL_PRESENT)) { //Check file tail; UINT16 tailValue = *(UINT16*)body.right(sizeof(UINT16)).constData(); if (fileHeader->IntegrityCheck.TailReference != (UINT16)~tailValue) msgInvalidTailValue = true; // Get tail and remove it from file body tail = body.right(sizeof(UINT16)); body = body.left(body.size() - sizeof(UINT16)); } // Check header checksum UINT8 calculatedHeader = 0x100 - (calculateSum8((const UINT8*)header.constData(), (UINT32)header.size()) - fileHeader->IntegrityCheck.Checksum.Header - fileHeader->IntegrityCheck.Checksum.File - fileHeader->State); bool msgInvalidHeaderChecksum = false; if (fileHeader->IntegrityCheck.Checksum.Header != calculatedHeader) { msgInvalidHeaderChecksum = true; } // Check data checksum // Data checksum must be calculated bool msgInvalidDataChecksum = false; UINT8 calculatedData = 0; if (fileHeader->Attributes & FFS_ATTRIB_CHECKSUM) { calculatedData = calculateChecksum8((const UINT8*)body.constData(), (UINT32)body.size()); } // Data checksum must be one of predefined values else if (volumeRevision == 1) { calculatedData = FFS_FIXED_CHECKSUM; } else { calculatedData = FFS_FIXED_CHECKSUM2; } if (fileHeader->IntegrityCheck.Checksum.File != calculatedData) { msgInvalidDataChecksum = true; } // Check file type bool msgUnknownType = false; if (fileHeader->Type > EFI_FV_FILETYPE_MM_CORE_STANDALONE && fileHeader->Type != EFI_FV_FILETYPE_PAD) { msgUnknownType = true; }; // Get info UString name; UString info; if (fileHeader->Type != EFI_FV_FILETYPE_PAD) { name = guidToUString(fileHeader->Name); } else { name = UString("Padding file"); } info = UString("File GUID: ") + guidToUString(fileHeader->Name, false) + usprintf("\nType: %02Xh\nAttributes: %02Xh\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\nTail size: %Xh (%u)\nState: %02Xh", fileHeader->Type, fileHeader->Attributes, (UINT32)(header.size() + body.size() + tail.size()), (UINT32)(header.size() + body.size() + tail.size()), (UINT32)header.size(), (UINT32)header.size(), (UINT32)body.size(), (UINT32)body.size(), (UINT32)tail.size(), (UINT32)tail.size(), fileHeader->State) + usprintf("\nHeader checksum: %02Xh", fileHeader->IntegrityCheck.Checksum.Header) + (msgInvalidHeaderChecksum ? usprintf(", invalid, should be %02Xh", calculatedHeader) : UString(", valid")) + usprintf("\nData checksum: %02Xh", fileHeader->IntegrityCheck.Checksum.File) + (msgInvalidDataChecksum ? usprintf(", invalid, should be %02Xh", calculatedData) : UString(", valid")); UString text; bool isVtf = false; bool isDxeCore = false; // Check if the file is a Volume Top File UByteArray fileGuid = UByteArray((const char*)&fileHeader->Name, sizeof(EFI_GUID)); if (fileGuid == EFI_FFS_VOLUME_TOP_FILE_GUID) { // Mark it as the last VTF // This information will later be used to determine memory addresses of uncompressed image elements // Because the last byte of the last VFT is mapped to 0xFFFFFFFF physical memory address isVtf = true; text = UString("Volume Top File"); } // Check if the file is the first DXE Core else if (fileGuid == EFI_DXE_CORE_GUID || fileGuid == AMI_CORE_DXE_GUID) { // Mark is as first DXE core // This information may be used to determine DXE volume offset for old AMI or post-IBB protected ranges isDxeCore = true; } // Construct fixed state ItemFixedState fixed = (ItemFixedState)((fileHeader->Attributes & FFS_ATTRIB_FIXED) != 0); // Add tree item index = model->addItem(localOffset, Types::File, fileHeader->Type, name, text, info, header, body, tail, fixed, parent); // Set parsing data for created file FILE_PARSING_DATA pdata = {}; pdata.emptyByte = (fileHeader->State & EFI_FILE_ERASE_POLARITY) ? 0xFF : 0x00; pdata.guid = fileHeader->Name; model->setParsingData(index, UByteArray((const char*)&pdata, sizeof(pdata))); // Override lastVtf index, if needed if (isVtf) { lastVtf = index; } // Override first DXE core index, if needed if (isDxeCore && !dxeCore.isValid()) { dxeCore = index; } // Show messages if (msgUnalignedFile) msg(usprintf("%s: unaligned file", __FUNCTION__), index); if (msgFileAlignmentIsGreaterThanVolumeAlignment) msg(usprintf("%s: file alignment %Xh is greater than parent volume alignment %Xh", __FUNCTION__, alignment, volumeAlignment), index); if (msgInvalidHeaderChecksum) msg(usprintf("%s: invalid header checksum %02Xh, should be %02Xh", __FUNCTION__, fileHeader->IntegrityCheck.Checksum.Header, calculatedHeader), index); if (msgInvalidDataChecksum) msg(usprintf("%s: invalid data checksum %02Xh, should be %02Xh", __FUNCTION__, fileHeader->IntegrityCheck.Checksum.File, calculatedData), index); if (msgInvalidTailValue) msg(usprintf("%s: invalid tail value %04Xh", __FUNCTION__, *(const UINT16*)tail.constData()), index); if (msgUnknownType) msg(usprintf("%s: unknown file type %02Xh", __FUNCTION__, fileHeader->Type), index); return U_SUCCESS; } UINT32 FfsParser::getSectionSize(const UByteArray & file, const UINT32 sectionOffset, const UINT8 ffsVersion) { if ((UINT32)file.size() < sectionOffset + sizeof(EFI_COMMON_SECTION_HEADER)) { return 0; } const EFI_COMMON_SECTION_HEADER* sectionHeader = (const EFI_COMMON_SECTION_HEADER*)(file.constData() + sectionOffset); if (ffsVersion == 2) { return uint24ToUint32(sectionHeader->Size); } else if (ffsVersion == 3) { UINT32 size = uint24ToUint32(sectionHeader->Size); if (size == EFI_SECTION2_IS_USED) { if ((UINT32)file.size() < sectionOffset + sizeof(EFI_COMMON_SECTION_HEADER2)) { return 0; } const EFI_COMMON_SECTION_HEADER2* sectionHeader2 = (const EFI_COMMON_SECTION_HEADER2*)(file.constData() + sectionOffset); return sectionHeader2->ExtendedSize; } return size; } return 0; } USTATUS FfsParser::parseFileBody(const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // Do not parse non-file bodies if (model->type(index) != Types::File) return U_SUCCESS; // Parse padding file body if (model->subtype(index) == EFI_FV_FILETYPE_PAD) return parsePadFileBody(index); // Parse raw files as raw areas if (model->subtype(index) == EFI_FV_FILETYPE_RAW || model->subtype(index) == EFI_FV_FILETYPE_ALL) { UByteArray fileGuid = UByteArray(model->header(index).constData(), sizeof(EFI_GUID)); // Parse NVAR store if (fileGuid == NVRAM_NVAR_STORE_FILE_GUID) { model->setText(index, UString("NVAR store")); return nvramParser->parseNvarStore(index); } else if (fileGuid == NVRAM_NVAR_PEI_EXTERNAL_DEFAULTS_FILE_GUID) { model->setText(index, UString("NVRAM external defaults")); return nvramParser->parseNvarStore(index); } else if (fileGuid == NVRAM_NVAR_BB_DEFAULTS_FILE_GUID) { model->setText(index, UString("NVAR BB defaults")); return nvramParser->parseNvarStore(index); } // Parse vendor hash file else if (fileGuid == PROTECTED_RANGE_VENDOR_HASH_FILE_GUID_PHOENIX) { return parseVendorHashFile(fileGuid, index); } // Parse AMI ROM hole else if (fileGuid == AMI_ROM_HOLE_FILE_GUID_0 || fileGuid == AMI_ROM_HOLE_FILE_GUID_1 || fileGuid == AMI_ROM_HOLE_FILE_GUID_2 || fileGuid == AMI_ROM_HOLE_FILE_GUID_3 || fileGuid == AMI_ROM_HOLE_FILE_GUID_4 || fileGuid == AMI_ROM_HOLE_FILE_GUID_5 || fileGuid == AMI_ROM_HOLE_FILE_GUID_6 || fileGuid == AMI_ROM_HOLE_FILE_GUID_7 || fileGuid == AMI_ROM_HOLE_FILE_GUID_8 || fileGuid == AMI_ROM_HOLE_FILE_GUID_9 || fileGuid == AMI_ROM_HOLE_FILE_GUID_10 || fileGuid == AMI_ROM_HOLE_FILE_GUID_11 || fileGuid == AMI_ROM_HOLE_FILE_GUID_12 || fileGuid == AMI_ROM_HOLE_FILE_GUID_13 || fileGuid == AMI_ROM_HOLE_FILE_GUID_14 || fileGuid == AMI_ROM_HOLE_FILE_GUID_15) { model->setText(index, UString("AMI ROM hole")); // Mark ROM hole file as Fixed in the image model->setFixed(index, Fixed); // No need to parse further return U_SUCCESS; } return parseRawArea(index); } // Parse sections return parseSections(model->body(index), index, true); } USTATUS FfsParser::parsePadFileBody(const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // Check if all bytes of the file are empty UByteArray body = model->body(index); // Obtain required information from parent file UINT8 emptyByte = 0xFF; UModelIndex parentFileIndex = model->findParentOfType(index, Types::File); if (parentFileIndex.isValid() && model->hasEmptyParsingData(parentFileIndex) == false) { UByteArray data = model->parsingData(index); const FILE_PARSING_DATA* pdata = (const FILE_PARSING_DATA*)data.constData(); emptyByte = pdata->emptyByte; } // Check if the while padding file is empty if (body.size() == body.count(emptyByte)) return U_SUCCESS; // Search for the first non-empty byte UINT32 nonEmptyByteOffset; UINT32 size = (UINT32)body.size(); const UINT8* current = (const UINT8*)body.constData(); for (nonEmptyByteOffset = 0; nonEmptyByteOffset < size; nonEmptyByteOffset++) { if (*current++ != emptyByte) break; } // Add all bytes before as free space... UINT32 headerSize = (UINT32)model->header(index).size(); if (nonEmptyByteOffset >= 8) { // Align free space to 8 bytes boundary if (nonEmptyByteOffset != ALIGN8(nonEmptyByteOffset)) nonEmptyByteOffset = ALIGN8(nonEmptyByteOffset) - 8; UByteArray free = body.left(nonEmptyByteOffset); // Get info UString info = usprintf("Full size: %Xh (%u)", (UINT32)free.size(), (UINT32)free.size()); // Add tree item model->addItem(headerSize, Types::FreeSpace, 0, UString("Free space"), UString(), info, UByteArray(), free, UByteArray(), Movable, index); } else { nonEmptyByteOffset = 0; } // ... and all bytes after as a padding UByteArray padding = body.mid(nonEmptyByteOffset); // Check for that data to be recovery startup AP data for x86 // https://github.com/tianocore/edk2/blob/stable/202011/BaseTools/Source/C/GenFv/GenFvInternalLib.c#L106 if (padding.left(RECOVERY_STARTUP_AP_DATA_X86_SIZE) == RECOVERY_STARTUP_AP_DATA_X86_128K) { // Get info UString info = usprintf("Full size: %Xh (%u)", (UINT32)padding.size(), (UINT32)padding.size()); // Add tree item (void)model->addItem(headerSize + nonEmptyByteOffset, Types::StartupApDataEntry, Subtypes::x86128kStartupApDataEntry, UString("Startup AP data"), UString(), info, UByteArray(), padding, UByteArray(), Fixed, index); // Rename the file model->setName(index, UString("Startup AP data padding file")); // Do not parse contents return U_SUCCESS; } else { // Not a data array // Get info UString info = usprintf("Full size: %Xh (%u)", (UINT32)padding.size(), (UINT32)padding.size()); // Add tree item UModelIndex dataIndex = model->addItem(headerSize + nonEmptyByteOffset, Types::Padding, Subtypes::DataPadding, UString("Non-UEFI data"), UString(), info, UByteArray(), padding, UByteArray(), Fixed, index); // Show message msg(usprintf("%s: non-UEFI data found in padding file", __FUNCTION__), dataIndex); // Rename the file model->setName(index, UString("Non-empty padding file")); // Do not parse contents return U_SUCCESS; } return U_SUCCESS; } USTATUS FfsParser::parseSections(const UByteArray & sections, const UModelIndex & index, const bool insertIntoTree) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // Search for and parse all sections UINT32 bodySize = (UINT32)sections.size(); UINT32 headerSize = (UINT32)model->header(index).size(); UINT32 sectionOffset = 0; USTATUS result = U_SUCCESS; // Obtain required information from parent volume UINT8 ffsVersion = 2; UModelIndex parentVolumeIndex = model->findParentOfType(index, Types::Volume); if (parentVolumeIndex.isValid() && model->hasEmptyParsingData(parentVolumeIndex) == false) { UByteArray data = model->parsingData(parentVolumeIndex); const VOLUME_PARSING_DATA* pdata = (const VOLUME_PARSING_DATA*)data.constData(); ffsVersion = pdata->ffsVersion; } // Iterate over sections UINT32 sectionSize = 0; while (sectionOffset < bodySize) { // Get section size sectionSize = getSectionSize(sections, sectionOffset, ffsVersion); // Check section size to be sane if (sectionSize < sizeof(EFI_COMMON_SECTION_HEADER) || sectionSize > (bodySize - sectionOffset)) { // Final parsing if (insertIntoTree) { // Add padding to fill the rest of sections UByteArray padding = sections.mid(sectionOffset); // Get info UString info = usprintf("Full size: %Xh (%u)", (UINT32)padding.size(), (UINT32)padding.size()); // Add tree item UModelIndex dataIndex = model->addItem(headerSize + sectionOffset, Types::Padding, Subtypes::DataPadding, UString("Non-UEFI data"), UString(), info, UByteArray(), padding, UByteArray(), Fixed, index); // Show message msg(usprintf("%s: non-UEFI data found in sections area", __FUNCTION__), dataIndex); // Exit from parsing loop break; } // Preliminary parsing else { return U_INVALID_SECTION; } } // Parse section header UModelIndex sectionIndex; result = parseSectionHeader(sections.mid(sectionOffset, sectionSize), headerSize + sectionOffset, index, sectionIndex, insertIntoTree); if (result) { if (insertIntoTree) msg(usprintf("%s: section header parsing failed with error ", __FUNCTION__) + errorCodeToUString(result), index); else return U_INVALID_SECTION; } // Move to next section sectionOffset += sectionSize; // TODO: verify that alignment bytes are actually zero as per PI spec sectionOffset = ALIGN4(sectionOffset); } #if 0 // Do not enable this in production for now, as it needs further investigation. // The PI spec requires sections to be aligned by 4 byte boundary with bytes that are all exactly zeroes // Some images interpret "must be aligned by 4" as "every section needs to be padded for sectionSize to be divisible by 4". // Detecting this case can be done by checking for the very last section to have sectionSize not divisible by 4, while the total bodySize is. // However, such detection for a single file is unreliable because in 1/4 random cases the last section will be divisible by 4. // We also know that either PEI core or DXE core is entity that does file and section parsing, // so every single file in the volume should behave consistently. // This makes the probability of unsuccessful detection here to be 1/(4^numFilesInVolume), // which is low enough for real images out there. // It should also be noted that enabling this section alignment quirk for an image that doesn't require it // will not make the image unbootable, but will waste some space and possibly require to move some files around if (sectionOffset == bodySize) { // We are now at the very end of the file body, and sectionSize is the size of the last section if ((sectionSize % 4 != 0) // sectionSize of the very last section is not divisible by 4 && (bodySize % 4 == 0)) { // yet bodySize is, meaning that there are indeed some padding bytes added after the last section msg(usprintf("%s: section alignment quirk found", __FUNCTION__), index); } } #endif // Parse bodies, will be skipped if insertIntoTree is not required for (int i = 0; i < model->rowCount(index); i++) { UModelIndex current = index.model()->index(i, 0, index); switch (model->type(current)) { case Types::Section: parseSectionBody(current); break; case Types::Padding: // No parsing required break; default: return U_UNKNOWN_ITEM_TYPE; } } return U_SUCCESS; } USTATUS FfsParser::parseSectionHeader(const UByteArray & section, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index, const bool insertIntoTree) { // Check sanity if ((UINT32)section.size() < sizeof(EFI_COMMON_SECTION_HEADER)) { return U_INVALID_SECTION; } const EFI_COMMON_SECTION_HEADER* sectionHeader = (const EFI_COMMON_SECTION_HEADER*)(section.constData()); switch (sectionHeader->Type) { // Special case EFI_SECTION_COMPRESSION: return parseCompressedSectionHeader(section, localOffset, parent, index, insertIntoTree); case EFI_SECTION_GUID_DEFINED: return parseGuidedSectionHeader(section, localOffset, parent, index, insertIntoTree); case EFI_SECTION_FREEFORM_SUBTYPE_GUID: return parseFreeformGuidedSectionHeader(section, localOffset, parent, index, insertIntoTree); case EFI_SECTION_VERSION: return parseVersionSectionHeader(section, localOffset, parent, index, insertIntoTree); case PHOENIX_SECTION_POSTCODE: case INSYDE_SECTION_POSTCODE: return parsePostcodeSectionHeader(section, localOffset, parent, index, insertIntoTree); // Common case EFI_SECTION_DISPOSABLE: case EFI_SECTION_DXE_DEPEX: case EFI_SECTION_PEI_DEPEX: case EFI_SECTION_MM_DEPEX: case EFI_SECTION_PE32: case EFI_SECTION_PIC: case EFI_SECTION_TE: case EFI_SECTION_COMPATIBILITY16: case EFI_SECTION_USER_INTERFACE: case EFI_SECTION_FIRMWARE_VOLUME_IMAGE: case EFI_SECTION_RAW: return parseCommonSectionHeader(section, localOffset, parent, index, insertIntoTree); // Unknown default: USTATUS result = parseCommonSectionHeader(section, localOffset, parent, index, insertIntoTree); msg(usprintf("%s: section with unknown type %02Xh", __FUNCTION__, sectionHeader->Type), index); return result; } } USTATUS FfsParser::parseCommonSectionHeader(const UByteArray & section, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index, const bool insertIntoTree) { // Check sanity if ((UINT32)section.size() < sizeof(EFI_COMMON_SECTION_HEADER)) { return U_INVALID_SECTION; } // Obtain required information from parent volume UINT8 ffsVersion = 2; UModelIndex parentVolumeIndex = model->findParentOfType(parent, Types::Volume); if (parentVolumeIndex.isValid() && model->hasEmptyParsingData(parentVolumeIndex) == false) { UByteArray data = model->parsingData(parentVolumeIndex); const VOLUME_PARSING_DATA* pdata = (const VOLUME_PARSING_DATA*)data.constData(); ffsVersion = pdata->ffsVersion; } // Obtain header fields const EFI_COMMON_SECTION_HEADER* sectionHeader = (const EFI_COMMON_SECTION_HEADER*)(section.constData()); UINT32 headerSize = sizeof(EFI_COMMON_SECTION_HEADER); if (ffsVersion == 3 && uint24ToUint32(sectionHeader->Size) == EFI_SECTION2_IS_USED) headerSize = sizeof(EFI_COMMON_SECTION_HEADER2); UINT8 type = sectionHeader->Type; // Check sanity again if ((UINT32)section.size() < headerSize) { return U_INVALID_SECTION; } UByteArray header = section.left(headerSize); UByteArray body = section.mid(headerSize); // Get info UString name = sectionTypeToUString(type) + UString(" section"); UString info = usprintf("Type: %02Xh\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)", type, (UINT32)section.size(), (UINT32)section.size(), headerSize, headerSize, (UINT32)body.size(), (UINT32)body.size()); // Add tree item if (insertIntoTree) { index = model->addItem(localOffset, Types::Section, type, name, UString(), info, header, body, UByteArray(), Movable, parent); } return U_SUCCESS; } USTATUS FfsParser::parseCompressedSectionHeader(const UByteArray & section, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index, const bool insertIntoTree) { // Check sanity if ((UINT32)section.size() < sizeof(EFI_COMMON_SECTION_HEADER)) return U_INVALID_SECTION; // Obtain required information from parent volume UINT8 ffsVersion = 2; UModelIndex parentVolumeIndex = model->findParentOfType(parent, Types::Volume); if (parentVolumeIndex.isValid() && model->hasEmptyParsingData(parentVolumeIndex) == false) { UByteArray data = model->parsingData(parentVolumeIndex); const VOLUME_PARSING_DATA* pdata = (const VOLUME_PARSING_DATA*)data.constData(); ffsVersion = pdata->ffsVersion; } // Obtain header fields UINT32 headerSize; UINT8 compressionType; UINT32 uncompressedLength; const EFI_COMMON_SECTION_HEADER* sectionHeader = (const EFI_COMMON_SECTION_HEADER*)(section.constData()); const EFI_COMMON_SECTION_HEADER2* section2Header = (const EFI_COMMON_SECTION_HEADER2*)(section.constData()); if (ffsVersion == 3 && uint24ToUint32(sectionHeader->Size) == EFI_SECTION2_IS_USED) { // Check for extended header section const EFI_COMPRESSION_SECTION* compressedSectionHeader = (const EFI_COMPRESSION_SECTION*)(section2Header + 1); if ((UINT32)section.size() < sizeof(EFI_COMMON_SECTION_HEADER2) + sizeof(EFI_COMPRESSION_SECTION)) return U_INVALID_SECTION; headerSize = sizeof(EFI_COMMON_SECTION_HEADER2) + sizeof(EFI_COMPRESSION_SECTION); compressionType = compressedSectionHeader->CompressionType; uncompressedLength = compressedSectionHeader->UncompressedLength; } else { // Normal section const EFI_COMPRESSION_SECTION* compressedSectionHeader = (const EFI_COMPRESSION_SECTION*)(sectionHeader + 1); headerSize = sizeof(EFI_COMMON_SECTION_HEADER) + sizeof(EFI_COMPRESSION_SECTION); compressionType = compressedSectionHeader->CompressionType; uncompressedLength = compressedSectionHeader->UncompressedLength; } // Check sanity again if ((UINT32)section.size() < headerSize) { return U_INVALID_SECTION; } UByteArray header = section.left(headerSize); UByteArray body = section.mid(headerSize); // Get info UString name = sectionTypeToUString(sectionHeader->Type) + UString(" section"); UString info = usprintf("Type: %02Xh\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\nCompression type: %02Xh\nDecompressed size: %Xh (%u)", sectionHeader->Type, (UINT32)section.size(), (UINT32)section.size(), headerSize, headerSize, (UINT32)body.size(), (UINT32)body.size(), compressionType, uncompressedLength, uncompressedLength); // Add tree item if (insertIntoTree) { index = model->addItem(localOffset, Types::Section, sectionHeader->Type, name, UString(), info, header, body, UByteArray(), Movable, parent); // Set section parsing data COMPRESSED_SECTION_PARSING_DATA pdata = {}; pdata.compressionType = compressionType; pdata.uncompressedSize = uncompressedLength; model->setParsingData(index, UByteArray((const char*)&pdata, sizeof(pdata))); } return U_SUCCESS; } USTATUS FfsParser::parseGuidedSectionHeader(const UByteArray & section, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index, const bool insertIntoTree) { // Check sanity if ((UINT32)section.size() < sizeof(EFI_COMMON_SECTION_HEADER)) return U_INVALID_SECTION; // Obtain required information from parent volume UINT8 ffsVersion = 2; UModelIndex parentVolumeIndex = model->findParentOfType(parent, Types::Volume); if (parentVolumeIndex.isValid() && model->hasEmptyParsingData(parentVolumeIndex) == false) { UByteArray data = model->parsingData(parentVolumeIndex); const VOLUME_PARSING_DATA* pdata = (const VOLUME_PARSING_DATA*)data.constData(); ffsVersion = pdata->ffsVersion; } // Obtain header fields UINT32 headerSize; EFI_GUID guid; UINT16 dataOffset; UINT16 attributes; const EFI_COMMON_SECTION_HEADER* sectionHeader = (const EFI_COMMON_SECTION_HEADER*)(section.constData()); const EFI_COMMON_SECTION_HEADER2* section2Header = (const EFI_COMMON_SECTION_HEADER2*)(section.constData()); if (ffsVersion == 3 && uint24ToUint32(sectionHeader->Size) == EFI_SECTION2_IS_USED) { // Check for extended header section const EFI_GUID_DEFINED_SECTION* guidDefinedSectionHeader = (const EFI_GUID_DEFINED_SECTION*)(section2Header + 1); if ((UINT32)section.size() < sizeof(EFI_COMMON_SECTION_HEADER2) + sizeof(EFI_GUID_DEFINED_SECTION)) return U_INVALID_SECTION; headerSize = sizeof(EFI_COMMON_SECTION_HEADER2) + sizeof(EFI_GUID_DEFINED_SECTION); guid = guidDefinedSectionHeader->SectionDefinitionGuid; dataOffset = guidDefinedSectionHeader->DataOffset; attributes = guidDefinedSectionHeader->Attributes; } else { // Normal section const EFI_GUID_DEFINED_SECTION* guidDefinedSectionHeader = (const EFI_GUID_DEFINED_SECTION*)(sectionHeader + 1); headerSize = sizeof(EFI_COMMON_SECTION_HEADER) + sizeof(EFI_GUID_DEFINED_SECTION); guid = guidDefinedSectionHeader->SectionDefinitionGuid; dataOffset = guidDefinedSectionHeader->DataOffset; attributes = guidDefinedSectionHeader->Attributes; } // Check sanity again if ((UINT32)section.size() < headerSize) return U_INVALID_SECTION; // Check for special GUIDed sections UString additionalInfo; UByteArray baGuid((const char*)&guid, sizeof(EFI_GUID)); bool msgSignedSectionFound = false; bool msgNoAuthStatusAttribute = false; bool msgNoProcessingRequiredAttributeCompressed = false; bool msgNoProcessingRequiredAttributeSigned = false; bool msgInvalidCrc = false; bool msgUnknownCertType = false; bool msgUnknownCertSubtype = false; bool msgProcessingRequiredAttributeOnUnknownGuidedSection = false; bool msgInvalidCompressedSize = false; if (baGuid == EFI_GUIDED_SECTION_CRC32) { if ((attributes & EFI_GUIDED_SECTION_AUTH_STATUS_VALID) == 0) { // Check that AuthStatusValid attribute is set on compressed GUIDed sections msgNoAuthStatusAttribute = true; } if ((UINT32)section.size() < headerSize + sizeof(UINT32)) return U_INVALID_SECTION; UINT32 crc = *(UINT32*)(section.constData() + headerSize); additionalInfo += UString("\nChecksum type: CRC32"); // Calculate CRC32 of section data UINT32 calculated = (UINT32)crc32(0, (const UINT8*)section.constData() + dataOffset, (uInt)(section.size() - dataOffset)); if (crc == calculated) { additionalInfo += usprintf("\nChecksum: %08Xh, valid", crc); } else { additionalInfo += usprintf("\nChecksum: %08Xh, invalid, should be %08Xh", crc, calculated); msgInvalidCrc = true; } // No need to change dataOffset here } else if (baGuid == EFI_GUIDED_SECTION_LZMA || baGuid == EFI_GUIDED_SECTION_LZMA_HP || baGuid == EFI_GUIDED_SECTION_LZMAF86 || baGuid == EFI_GUIDED_SECTION_TIANO || baGuid == EFI_GUIDED_SECTION_GZIP) { if ((attributes & EFI_GUIDED_SECTION_PROCESSING_REQUIRED) == 0) { // Check that ProcessingRequired attribute is set on compressed GUIDed sections msgNoProcessingRequiredAttributeCompressed = true; } // No need to change dataOffset here } else if (baGuid == EFI_GUIDED_SECTION_ZLIB_AMD) { if ((attributes & EFI_GUIDED_SECTION_PROCESSING_REQUIRED) == 0) { // Check that ProcessingRequired attribute is set on compressed GUIDed sections msgNoProcessingRequiredAttributeCompressed = true; } if ((UINT32)section.size() < headerSize + sizeof(EFI_AMD_ZLIB_SECTION_HEADER)) return U_INVALID_SECTION; const EFI_AMD_ZLIB_SECTION_HEADER* amdZlibSectionHeader = (const EFI_AMD_ZLIB_SECTION_HEADER*)(section.constData() + headerSize); // Check the compressed size to be sane if ((UINT32)section.size() != headerSize + sizeof(EFI_AMD_ZLIB_SECTION_HEADER) + amdZlibSectionHeader->CompressedSize) { msgInvalidCompressedSize = true; } // Adjust dataOffset dataOffset += sizeof(EFI_AMD_ZLIB_SECTION_HEADER); } else if (baGuid == EFI_CERT_TYPE_RSA2048_SHA256_GUID) { if ((attributes & EFI_GUIDED_SECTION_PROCESSING_REQUIRED) == 0) { // Check that ProcessingRequired attribute is set on signed GUIDed sections msgNoProcessingRequiredAttributeSigned = true; } // Get certificate type and length if ((UINT32)section.size() < headerSize + sizeof(EFI_CERT_BLOCK_RSA2048_SHA256)) return U_INVALID_SECTION; // Adjust dataOffset dataOffset += sizeof(EFI_CERT_BLOCK_RSA2048_SHA256); additionalInfo += UString("\nCertificate type: RSA2048/SHA256"); msgSignedSectionFound = true; } else if (baGuid == EFI_FIRMWARE_CONTENTS_SIGNED_GUID) { if ((attributes & EFI_GUIDED_SECTION_PROCESSING_REQUIRED) == 0) { // Check that ProcessingRequired attribute is set on signed GUIDed sections msgNoProcessingRequiredAttributeSigned = true; } // Get certificate type and length if ((UINT32)section.size() < headerSize + sizeof(WIN_CERTIFICATE)) return U_INVALID_SECTION; const WIN_CERTIFICATE* winCertificate = (const WIN_CERTIFICATE*)(section.constData() + headerSize); UINT32 certLength = winCertificate->Length; UINT16 certType = winCertificate->CertificateType; // Adjust dataOffset dataOffset += certLength; // Check section size once again if ((UINT32)section.size() < dataOffset) return U_INVALID_SECTION; // Check certificate type if (certType == WIN_CERT_TYPE_EFI_GUID) { additionalInfo += UString("\nCertificate type: UEFI"); // Get certificate GUID const WIN_CERTIFICATE_UEFI_GUID* winCertificateUefiGuid = (const WIN_CERTIFICATE_UEFI_GUID*)(section.constData() + headerSize); UByteArray certTypeGuid((const char*)&winCertificateUefiGuid->CertType, sizeof(EFI_GUID)); if (certTypeGuid == EFI_CERT_TYPE_RSA2048_SHA256_GUID) { additionalInfo += UString("\nCertificate subtype: RSA2048/SHA256"); } else { additionalInfo += UString("\nCertificate subtype: unknown, GUID ") + guidToUString(winCertificateUefiGuid->CertType); msgUnknownCertSubtype = true; } } else { additionalInfo += usprintf("\nCertificate type: unknown (%04Xh)", certType); msgUnknownCertType = true; } msgSignedSectionFound = true; } // Check that ProcessingRequired attribute is not set on GUIDed sections with unknown GUID else if ((attributes & EFI_GUIDED_SECTION_PROCESSING_REQUIRED) == EFI_GUIDED_SECTION_PROCESSING_REQUIRED) { msgProcessingRequiredAttributeOnUnknownGuidedSection = true; } UByteArray header = section.left(dataOffset); UByteArray body = section.mid(dataOffset); // Get info UString name = guidToUString(guid); UString info = UString("Section GUID: ") + guidToUString(guid, false) + usprintf("\nType: %02Xh\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\nAttributes: %04Xh", sectionHeader->Type, (UINT32)section.size(), (UINT32)section.size(), (UINT32)header.size(), (UINT32)header.size(), (UINT32)body.size(), (UINT32)body.size(), attributes); // Append additional info info += additionalInfo; // Add tree item if (insertIntoTree) { index = model->addItem(localOffset, Types::Section, sectionHeader->Type, name, UString(), info, header, body, UByteArray(), Movable, parent); // Set parsing data GUIDED_SECTION_PARSING_DATA pdata = {}; pdata.guid = guid; model->setParsingData(index, UByteArray((const char*)&pdata, sizeof(pdata))); // Show messages if (msgSignedSectionFound) msg(usprintf("%s: GUIDed section signature may become invalid after modification", __FUNCTION__), index); if (msgNoAuthStatusAttribute) msg(usprintf("%s: CRC32 GUIDed section without AuthStatusValid attribute", __FUNCTION__), index); if (msgNoProcessingRequiredAttributeCompressed) msg(usprintf("%s: compressed GUIDed section without ProcessingRequired attribute", __FUNCTION__), index); if (msgNoProcessingRequiredAttributeSigned) msg(usprintf("%s: signed GUIDed section without ProcessingRequired attribute", __FUNCTION__), index); if (msgInvalidCrc) msg(usprintf("%s: CRC32 GUIDed section with invalid checksum", __FUNCTION__), index); if (msgUnknownCertType) msg(usprintf("%s: signed GUIDed section with unknown certificate type", __FUNCTION__), index); if (msgUnknownCertSubtype) msg(usprintf("%s: signed GUIDed section with unknown certificate subtype", __FUNCTION__), index); if (msgProcessingRequiredAttributeOnUnknownGuidedSection) msg(usprintf("%s: processing required bit set for GUIDed section with unknown GUID", __FUNCTION__), index); if (msgInvalidCompressedSize) msg(usprintf("%s: AMD Zlib-compressed section with invalid compressed size", __FUNCTION__), index); } return U_SUCCESS; } USTATUS FfsParser::parseFreeformGuidedSectionHeader(const UByteArray & section, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index, const bool insertIntoTree) { // Check sanity if ((UINT32)section.size() < sizeof(EFI_COMMON_SECTION_HEADER)) return U_INVALID_SECTION; // Obtain required information from parent volume UINT8 ffsVersion = 2; UModelIndex parentVolumeIndex = model->findParentOfType(parent, Types::Volume); if (parentVolumeIndex.isValid() && model->hasEmptyParsingData(parentVolumeIndex) == false) { UByteArray data = model->parsingData(parentVolumeIndex); const VOLUME_PARSING_DATA* pdata = (const VOLUME_PARSING_DATA*)data.constData(); ffsVersion = pdata->ffsVersion; } // Obtain header fields UINT32 headerSize; EFI_GUID guid; UINT8 type; const EFI_COMMON_SECTION_HEADER* sectionHeader = (const EFI_COMMON_SECTION_HEADER*)(section.constData()); const EFI_COMMON_SECTION_HEADER2* section2Header = (const EFI_COMMON_SECTION_HEADER2*)(section.constData()); if (ffsVersion == 3 && uint24ToUint32(sectionHeader->Size) == EFI_SECTION2_IS_USED) { // Check for extended header section const EFI_FREEFORM_SUBTYPE_GUID_SECTION* fsgSectionHeader = (const EFI_FREEFORM_SUBTYPE_GUID_SECTION*)(section2Header + 1); if ((UINT32)section.size() < sizeof(EFI_COMMON_SECTION_HEADER2) + sizeof(EFI_FREEFORM_SUBTYPE_GUID_SECTION)) return U_INVALID_SECTION; headerSize = sizeof(EFI_COMMON_SECTION_HEADER2) + sizeof(EFI_FREEFORM_SUBTYPE_GUID_SECTION); guid = fsgSectionHeader->SubTypeGuid; type = section2Header->Type; } else { // Normal section const EFI_FREEFORM_SUBTYPE_GUID_SECTION* fsgSectionHeader = (const EFI_FREEFORM_SUBTYPE_GUID_SECTION*)(sectionHeader + 1); headerSize = sizeof(EFI_COMMON_SECTION_HEADER) + sizeof(EFI_FREEFORM_SUBTYPE_GUID_SECTION); guid = fsgSectionHeader->SubTypeGuid; type = sectionHeader->Type; } // Check sanity again if ((UINT32)section.size() < headerSize) return U_INVALID_SECTION; UByteArray header = section.left(headerSize); UByteArray body = section.mid(headerSize); // Get info UString name = sectionTypeToUString(type) + (" section"); UString info = usprintf("Type: %02Xh\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\nSubtype GUID: ", type, (UINT32)section.size(), (UINT32)section.size(), (UINT32)header.size(), (UINT32)header.size(), (UINT32)body.size(), (UINT32)body.size()) + guidToUString(guid, false); // Add tree item if (insertIntoTree) { index = model->addItem(localOffset, Types::Section, type, name, UString(), info, header, body, UByteArray(), Movable, parent); // Set parsing data FREEFORM_GUIDED_SECTION_PARSING_DATA pdata = {}; pdata.guid = guid; model->setParsingData(index, UByteArray((const char*)&pdata, sizeof(pdata))); // Rename section model->setName(index, guidToUString(guid)); } return U_SUCCESS; } USTATUS FfsParser::parseVersionSectionHeader(const UByteArray & section, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index, const bool insertIntoTree) { // Check sanity if ((UINT32)section.size() < sizeof(EFI_COMMON_SECTION_HEADER)) return U_INVALID_SECTION; // Obtain required information from parent volume UINT8 ffsVersion = 2; UModelIndex parentVolumeIndex = model->findParentOfType(parent, Types::Volume); if (parentVolumeIndex.isValid() && model->hasEmptyParsingData(parentVolumeIndex) == false) { UByteArray data = model->parsingData(parentVolumeIndex); const VOLUME_PARSING_DATA* pdata = (const VOLUME_PARSING_DATA*)data.constData(); ffsVersion = pdata->ffsVersion; } // Obtain header fields UINT32 headerSize; UINT16 buildNumber; UINT8 type; const EFI_COMMON_SECTION_HEADER* sectionHeader = (const EFI_COMMON_SECTION_HEADER*)(section.constData()); const EFI_COMMON_SECTION_HEADER2* section2Header = (const EFI_COMMON_SECTION_HEADER2*)(section.constData()); if (ffsVersion == 3 && uint24ToUint32(sectionHeader->Size) == EFI_SECTION2_IS_USED) { // Check for extended header section const EFI_VERSION_SECTION* versionHeader = (const EFI_VERSION_SECTION*)(section2Header + 1); headerSize = sizeof(EFI_COMMON_SECTION_HEADER2) + sizeof(EFI_VERSION_SECTION); buildNumber = versionHeader->BuildNumber; type = section2Header->Type; } else { // Normal section const EFI_VERSION_SECTION* versionHeader = (const EFI_VERSION_SECTION*)(sectionHeader + 1); headerSize = sizeof(EFI_COMMON_SECTION_HEADER) + sizeof(EFI_VERSION_SECTION); buildNumber = versionHeader->BuildNumber; type = sectionHeader->Type; } // Check sanity again if ((UINT32)section.size() < headerSize) return U_INVALID_SECTION; UByteArray header = section.left(headerSize); UByteArray body = section.mid(headerSize); // Get info UString name = sectionTypeToUString(type) + (" section"); UString info = usprintf("Type: %02Xh\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\nBuild number: %u", type, (UINT32)section.size(), (UINT32)section.size(), (UINT32)header.size(), (UINT32)header.size(), (UINT32)body.size(), (UINT32)body.size(), buildNumber); // Add tree item if (insertIntoTree) { index = model->addItem(localOffset, Types::Section, type, name, UString(), info, header, body, UByteArray(), Movable, parent); } return U_SUCCESS; } USTATUS FfsParser::parsePostcodeSectionHeader(const UByteArray & section, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index, const bool insertIntoTree) { // Check sanity if ((UINT32)section.size() < sizeof(EFI_COMMON_SECTION_HEADER)) return U_INVALID_SECTION; // Obtain required information from parent volume UINT8 ffsVersion = 2; UModelIndex parentVolumeIndex = model->findParentOfType(parent, Types::Volume); if (parentVolumeIndex.isValid() && model->hasEmptyParsingData(parentVolumeIndex) == false) { UByteArray data = model->parsingData(parentVolumeIndex); const VOLUME_PARSING_DATA* pdata = (const VOLUME_PARSING_DATA*)data.constData(); ffsVersion = pdata->ffsVersion; } // Obtain header fields UINT32 headerSize; UINT32 postCode; UINT8 type; const EFI_COMMON_SECTION_HEADER* sectionHeader = (const EFI_COMMON_SECTION_HEADER*)(section.constData()); const EFI_COMMON_SECTION_HEADER2* section2Header = (const EFI_COMMON_SECTION_HEADER2*)(section.constData()); if (ffsVersion == 3 && uint24ToUint32(sectionHeader->Size) == EFI_SECTION2_IS_USED) { // Check for extended header section const POSTCODE_SECTION* postcodeHeader = (const POSTCODE_SECTION*)(section2Header + 1); headerSize = sizeof(EFI_COMMON_SECTION_HEADER2) + sizeof(POSTCODE_SECTION); postCode = postcodeHeader->Postcode; type = section2Header->Type; } else { // Normal section const POSTCODE_SECTION* postcodeHeader = (const POSTCODE_SECTION*)(sectionHeader + 1); headerSize = sizeof(EFI_COMMON_SECTION_HEADER) + sizeof(POSTCODE_SECTION); postCode = postcodeHeader->Postcode; type = sectionHeader->Type; } // Check sanity again if ((UINT32)section.size() < headerSize) return U_INVALID_SECTION; UByteArray header = section.left(headerSize); UByteArray body = section.mid(headerSize); // Get info UString name = sectionTypeToUString(type) + (" section"); UString info = usprintf("Type: %02Xh\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\nPostcode: %Xh", type, (UINT32)section.size(), (UINT32)section.size(), (UINT32)header.size(), (UINT32)header.size(), (UINT32)body.size(), (UINT32)body.size(), postCode); // Add tree item if (insertIntoTree) { index = model->addItem(localOffset, Types::Section, sectionHeader->Type, name, UString(), info, header, body, UByteArray(), Movable, parent); } return U_SUCCESS; } USTATUS FfsParser::parseSectionBody(const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; UByteArray header = model->header(index); if ((UINT32)header.size() < sizeof(EFI_COMMON_SECTION_HEADER)) return U_INVALID_SECTION; const EFI_COMMON_SECTION_HEADER* sectionHeader = (const EFI_COMMON_SECTION_HEADER*)(header.constData()); switch (sectionHeader->Type) { // Encapsulation case EFI_SECTION_COMPRESSION: return parseCompressedSectionBody(index); case EFI_SECTION_GUID_DEFINED: return parseGuidedSectionBody(index); case EFI_SECTION_DISPOSABLE: return parseSections(model->body(index), index, true); // Leaf case EFI_SECTION_FREEFORM_SUBTYPE_GUID: return parseRawArea(index); case EFI_SECTION_VERSION: return parseVersionSectionBody(index); case EFI_SECTION_DXE_DEPEX: case EFI_SECTION_PEI_DEPEX: case EFI_SECTION_MM_DEPEX: return parseDepexSectionBody(index); case EFI_SECTION_TE: return parseTeImageSectionBody(index); case EFI_SECTION_PE32: case EFI_SECTION_PIC: return parsePeImageSectionBody(index); case EFI_SECTION_USER_INTERFACE: return parseUiSectionBody(index); case EFI_SECTION_FIRMWARE_VOLUME_IMAGE: return parseRawArea(index); case EFI_SECTION_RAW: return parseRawSectionBody(index); // No parsing needed case EFI_SECTION_COMPATIBILITY16: case PHOENIX_SECTION_POSTCODE: case INSYDE_SECTION_POSTCODE: default: return U_SUCCESS; } } USTATUS FfsParser::parseCompressedSectionBody(const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // Obtain required information from parsing data UINT8 compressionType = EFI_NOT_COMPRESSED; UINT32 uncompressedSize = (UINT32)model->body(index).size(); if (model->hasEmptyParsingData(index) == false) { UByteArray data = model->parsingData(index); const COMPRESSED_SECTION_PARSING_DATA* pdata = (const COMPRESSED_SECTION_PARSING_DATA*)data.constData(); compressionType = readUnaligned(pdata).compressionType; uncompressedSize = readUnaligned(pdata).uncompressedSize; } // Decompress section UINT8 algorithm = COMPRESSION_ALGORITHM_NONE; UINT32 dictionarySize = 0; UByteArray decompressed; UByteArray efiDecompressed; USTATUS result = decompress(model->body(index), compressionType, algorithm, dictionarySize, decompressed, efiDecompressed); if (result) { msg(usprintf("%s: decompression failed with error ", __FUNCTION__) + errorCodeToUString(result), index); return U_SUCCESS; } // Check reported uncompressed size if (uncompressedSize != (UINT32)decompressed.size()) { msg(usprintf("%s: decompressed size stored in header %Xh (%u) differs from actual %Xh (%u)", __FUNCTION__, uncompressedSize, uncompressedSize, (UINT32)decompressed.size(), (UINT32)decompressed.size()), index); model->addInfo(index, usprintf("\nActual decompressed size: %Xh (%u)", (UINT32)decompressed.size(), (UINT32)decompressed.size())); } // Check for undecided compression algorithm, this is a special case if (algorithm == COMPRESSION_ALGORITHM_UNDECIDED) { // Try preparse of sections decompressed with Tiano algorithm if (U_SUCCESS == parseSections(decompressed, index, false)) { algorithm = COMPRESSION_ALGORITHM_TIANO; } // Try preparse of sections decompressed with EFI 1.1 algorithm else if (U_SUCCESS == parseSections(efiDecompressed, index, false)) { algorithm = COMPRESSION_ALGORITHM_EFI11; decompressed = efiDecompressed; } else { msg(usprintf("%s: can't guess the correct decompression algorithm, both preparse steps are failed", __FUNCTION__), index); } } // Add info model->addInfo(index, UString("\nCompression algorithm: ") + compressionTypeToUString(algorithm)); if (algorithm == COMPRESSION_ALGORITHM_LZMA || algorithm == COMPRESSION_ALGORITHM_LZMA_INTEL_LEGACY) { model->addInfo(index, usprintf("\nLZMA dictionary size: %Xh", dictionarySize)); } // Set compression data if (algorithm != COMPRESSION_ALGORITHM_NONE) { model->setUncompressedData(index, decompressed); model->setCompressed(index, true); } // Set parsing data COMPRESSED_SECTION_PARSING_DATA pdata = {}; pdata.algorithm = algorithm; pdata.dictionarySize = dictionarySize; pdata.compressionType = compressionType; pdata.uncompressedSize = uncompressedSize; model->setParsingData(index, UByteArray((const char*)&pdata, sizeof(pdata))); // Parse decompressed data return parseSections(decompressed, index, true); } USTATUS FfsParser::parseGuidedSectionBody(const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // Obtain required information from parsing data EFI_GUID guid = { 0, 0, 0, {0, 0, 0, 0, 0, 0, 0, 0 }}; if (model->hasEmptyParsingData(index) == false) { UByteArray data = model->parsingData(index); const GUIDED_SECTION_PARSING_DATA* pdata = (const GUIDED_SECTION_PARSING_DATA*)data.constData(); guid = readUnaligned(pdata).guid; } // Check if section requires processing UByteArray processed = model->body(index); UByteArray efiDecompressed; UString info; bool parseCurrentSection = true; UINT8 algorithm = COMPRESSION_ALGORITHM_NONE; UINT32 dictionarySize = 0; UByteArray baGuid = UByteArray((const char*)&guid, sizeof(EFI_GUID)); // Tiano compressed section if (baGuid == EFI_GUIDED_SECTION_TIANO) { USTATUS result = decompress(model->body(index), EFI_STANDARD_COMPRESSION, algorithm, dictionarySize, processed, efiDecompressed); if (result) { msg(usprintf("%s: decompression failed with error ", __FUNCTION__) + errorCodeToUString(result), index); return U_SUCCESS; } // Check for undecided compression algorithm, this is a special case if (algorithm == COMPRESSION_ALGORITHM_UNDECIDED) { // Try preparse of sections decompressed with Tiano algorithm if (U_SUCCESS == parseSections(processed, index, false)) { algorithm = COMPRESSION_ALGORITHM_TIANO; } // Try preparse of sections decompressed with EFI 1.1 algorithm else if (U_SUCCESS == parseSections(efiDecompressed, index, false)) { algorithm = COMPRESSION_ALGORITHM_EFI11; processed = efiDecompressed; } else { msg(usprintf("%s: can't guess the correct decompression algorithm, both preparse steps are failed", __FUNCTION__), index); parseCurrentSection = false; } } info += UString("\nCompression algorithm: ") + compressionTypeToUString(algorithm); info += usprintf("\nDecompressed size: %Xh (%u)", (UINT32)processed.size(), (UINT32)processed.size()); } // LZMA compressed section else if (baGuid == EFI_GUIDED_SECTION_LZMA || baGuid == EFI_GUIDED_SECTION_LZMA_HP) { USTATUS result = decompress(model->body(index), EFI_CUSTOMIZED_COMPRESSION, algorithm, dictionarySize, processed, efiDecompressed); if (result) { msg(usprintf("%s: decompression failed with error ", __FUNCTION__) + errorCodeToUString(result), index); return U_SUCCESS; } if (algorithm == COMPRESSION_ALGORITHM_LZMA) { info += UString("\nCompression algorithm: LZMA"); info += usprintf("\nDecompressed size: %Xh (%u)", (UINT32)processed.size(), (UINT32)processed.size()); info += usprintf("\nLZMA dictionary size: %Xh", dictionarySize); } else { info += UString("\nCompression algorithm: unknown"); parseCurrentSection = false; } } // LZMAF86 compressed section else if (baGuid == EFI_GUIDED_SECTION_LZMAF86) { USTATUS result = decompress(model->body(index), EFI_CUSTOMIZED_COMPRESSION_LZMAF86, algorithm, dictionarySize, processed, efiDecompressed); if (result) { msg(usprintf("%s: decompression failed with error ", __FUNCTION__) + errorCodeToUString(result), index); return U_SUCCESS; } if (algorithm == COMPRESSION_ALGORITHM_LZMAF86) { info += UString("\nCompression algorithm: LZMAF86"); info += usprintf("\nDecompressed size: %Xh (%u)", (UINT32)processed.size(), (UINT32)processed.size()); info += usprintf("\nLZMA dictionary size: %Xh", dictionarySize); } else { info += UString("\nCompression algorithm: unknown"); parseCurrentSection = false; } } // GZip compressed section else if (baGuid == EFI_GUIDED_SECTION_GZIP) { USTATUS result = gzipDecompress(model->body(index), processed); if (result) { msg(usprintf("%s: decompression failed with error ", __FUNCTION__) + errorCodeToUString(result), index); return U_SUCCESS; } algorithm = COMPRESSION_ALGORITHM_GZIP; info += UString("\nCompression algorithm: GZip"); info += usprintf("\nDecompressed size: %Xh (%u)", (UINT32)processed.size(), (UINT32)processed.size()); } // Zlib compressed section else if (baGuid == EFI_GUIDED_SECTION_ZLIB_AMD) { USTATUS result = zlibDecompress(model->body(index), processed); if (result) { msg(usprintf("%s: decompression failed with error ", __FUNCTION__) + errorCodeToUString(result), index); return U_SUCCESS; } algorithm = COMPRESSION_ALGORITHM_ZLIB; info += UString("\nCompression algorithm: Zlib"); info += usprintf("\nDecompressed size: %Xh (%u)", (UINT32)processed.size(), (UINT32)processed.size()); } // Add info model->addInfo(index, info); // Set parsing data GUIDED_SECTION_PARSING_DATA pdata = {}; pdata.dictionarySize = dictionarySize; model->setParsingData(index, UByteArray((const char*)&pdata, sizeof(pdata))); // Set compression data if (algorithm != COMPRESSION_ALGORITHM_NONE) { model->setUncompressedData(index, processed); model->setCompressed(index, true); } if (!parseCurrentSection) { msg(usprintf("%s: GUID defined section can not be processed", __FUNCTION__), index); return U_SUCCESS; } return parseSections(processed, index, true); } USTATUS FfsParser::parseVersionSectionBody(const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // Add info model->addInfo(index, UString("\nVersion string: ") + uFromUcs2(model->body(index).constData())); return U_SUCCESS; } USTATUS FfsParser::parseDepexSectionBody(const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; UByteArray body = model->body(index); UString parsed; // Check data to be present if (body.size() < 2) { // 2 is a minimal sane value, i.e TRUE + END msg(usprintf("%s: DEPEX section too short", __FUNCTION__), index); return U_DEPEX_PARSE_FAILED; } const EFI_GUID * guid; const UINT8* current = (const UINT8*)body.constData(); // Special cases of first opcode switch (*current) { case EFI_DEP_BEFORE: if (body.size() != 2 * EFI_DEP_OPCODE_SIZE + sizeof(EFI_GUID)) { msg(usprintf("%s: DEPEX section too long for a section starting with BEFORE opcode", __FUNCTION__), index); return U_SUCCESS; } guid = (const EFI_GUID*)(current + EFI_DEP_OPCODE_SIZE); parsed += UString("\nBEFORE ") + guidToUString(readUnaligned(guid)); current += EFI_DEP_OPCODE_SIZE + sizeof(EFI_GUID); if (*current != EFI_DEP_END){ msg(usprintf("%s: DEPEX section ends with non-END opcode", __FUNCTION__), index); return U_SUCCESS; } // No further parsing required return U_SUCCESS; case EFI_DEP_AFTER: if (body.size() != 2 * EFI_DEP_OPCODE_SIZE + sizeof(EFI_GUID)){ msg(usprintf("%s: DEPEX section too long for a section starting with AFTER opcode", __FUNCTION__), index); return U_SUCCESS; } guid = (const EFI_GUID*)(current + EFI_DEP_OPCODE_SIZE); parsed += UString("\nAFTER ") + guidToUString(readUnaligned(guid)); current += EFI_DEP_OPCODE_SIZE + sizeof(EFI_GUID); if (*current != EFI_DEP_END) { msg(usprintf("%s: DEPEX section ends with non-END opcode", __FUNCTION__), index); return U_SUCCESS; } // No further parsing required return U_SUCCESS; case EFI_DEP_SOR: if (body.size() <= 2 * EFI_DEP_OPCODE_SIZE) { msg(usprintf("%s: DEPEX section too short for a section starting with SOR opcode", __FUNCTION__), index); return U_SUCCESS; } parsed += UString("\nSOR"); current += EFI_DEP_OPCODE_SIZE; break; } // Parse the rest of depex while (current - (const UINT8*)body.constData() < body.size()) { switch (*current) { case EFI_DEP_BEFORE: { msg(usprintf("%s: misplaced BEFORE opcode", __FUNCTION__), index); return U_SUCCESS; } case EFI_DEP_AFTER: { msg(usprintf("%s: misplaced AFTER opcode", __FUNCTION__), index); return U_SUCCESS; } case EFI_DEP_SOR: { msg(usprintf("%s: misplaced SOR opcode", __FUNCTION__), index); return U_SUCCESS; } case EFI_DEP_PUSH: // Check that the rest of depex has correct size if ((UINT32)body.size() - (UINT32)(current - (const UINT8*)body.constData()) <= EFI_DEP_OPCODE_SIZE + sizeof(EFI_GUID)) { parsed.clear(); msg(usprintf("%s: remains of DEPEX section too short for PUSH opcode", __FUNCTION__), index); return U_SUCCESS; } guid = (const EFI_GUID*)(current + EFI_DEP_OPCODE_SIZE); parsed += UString("\nPUSH ") + guidToUString(readUnaligned(guid)); current += EFI_DEP_OPCODE_SIZE + sizeof(EFI_GUID); break; case EFI_DEP_AND: parsed += UString("\nAND"); current += EFI_DEP_OPCODE_SIZE; break; case EFI_DEP_OR: parsed += UString("\nOR"); current += EFI_DEP_OPCODE_SIZE; break; case EFI_DEP_NOT: parsed += UString("\nNOT"); current += EFI_DEP_OPCODE_SIZE; break; case EFI_DEP_TRUE: parsed += UString("\nTRUE"); current += EFI_DEP_OPCODE_SIZE; break; case EFI_DEP_FALSE: parsed += UString("\nFALSE"); current += EFI_DEP_OPCODE_SIZE; break; case EFI_DEP_END: parsed += UString("\nEND"); current += EFI_DEP_OPCODE_SIZE; // Check that END is the last opcode if (current - (const UINT8*)body.constData() < body.size()) { parsed.clear(); msg(usprintf("%s: DEPEX section ends with non-END opcode", __FUNCTION__), index); } break; default: msg(usprintf("%s: unknown opcode %02Xh", __FUNCTION__, *current), index); // No further parsing required return U_SUCCESS; } } // Add info model->addInfo(index, UString("\nParsed expression:") + parsed); return U_SUCCESS; } USTATUS FfsParser::parseUiSectionBody(const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; UString text = uFromUcs2(model->body(index).constData()); // Add info model->addInfo(index, UString("\nText: ") + text); // Rename parent file model->setText(model->findParentOfType(index, Types::File), text); return U_SUCCESS; } USTATUS FfsParser::parseAprioriRawSection(const UByteArray & body, UString & parsed) { // Sanity check if (body.size() % sizeof(EFI_GUID)) { msg(usprintf("%s: apriori file has size is not a multiple of 16", __FUNCTION__)); } parsed.clear(); UINT32 count = (UINT32)(body.size() / sizeof(EFI_GUID)); if (count > 0) { for (UINT32 i = 0; i < count; i++) { const EFI_GUID* guid = (const EFI_GUID*)body.constData() + i; parsed += "\n" + guidToUString(readUnaligned(guid)); } } return U_SUCCESS; } USTATUS FfsParser::parseRawSectionBody(const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // Check for apriori file UModelIndex parentFile = model->findParentOfType(index, Types::File); if (!parentFile.isValid()) return U_INVALID_RAW_AREA; // Get parent file parsing data UByteArray parentFileGuid(model->header(parentFile).constData(), sizeof(EFI_GUID)); if (parentFileGuid == EFI_PEI_APRIORI_FILE_GUID) { // PEI apriori file // Set parent file text model->setText(parentFile, UString("PEI apriori file")); // Parse apriori file list UString str; USTATUS result = parseAprioriRawSection(model->body(index), str); if (!result && !str.isEmpty()) model->addInfo(index, UString("\nFile list:") + str); return result; } else if (parentFileGuid == EFI_DXE_APRIORI_FILE_GUID) { // DXE apriori file // Rename parent file model->setText(parentFile, UString("DXE apriori file")); // Parse apriori file list UString str; USTATUS result = parseAprioriRawSection(model->body(index), str); if (!result && !str.isEmpty()) model->addInfo(index, UString("\nFile list:") + str); return result; } else if (parentFileGuid == NVRAM_NVAR_EXTERNAL_DEFAULTS_FILE_GUID) { // AMI NVRAM external defaults // Rename parent file model->setText(parentFile, UString("NVRAM external defaults")); // Parse NVAR area return nvramParser->parseNvarStore(index); } else if (parentFileGuid == PROTECTED_RANGE_VENDOR_HASH_FILE_GUID_AMI) { // AMI vendor hash file // Parse AMI vendor hash file return parseVendorHashFile(parentFileGuid, index); } // Parse as raw area return parseRawArea(index); } USTATUS FfsParser::parsePeImageSectionBody(const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // Get section body UByteArray body = model->body(index); if ((UINT32)body.size() < sizeof(EFI_IMAGE_DOS_HEADER)) { msg(usprintf("%s: section body size is smaller than DOS header size", __FUNCTION__), index); return U_SUCCESS; } UString info; const EFI_IMAGE_DOS_HEADER* dosHeader = (const EFI_IMAGE_DOS_HEADER*)body.constData(); if (dosHeader->e_magic != EFI_IMAGE_DOS_SIGNATURE) { info += usprintf("\nDOS signature: %04Xh, invalid", dosHeader->e_magic); msg(usprintf("%s: PE32 image with invalid DOS signature", __FUNCTION__), index); model->addInfo(index, info); return U_SUCCESS; } const EFI_IMAGE_PE_HEADER* peHeader = (EFI_IMAGE_PE_HEADER*)(body.constData() + dosHeader->e_lfanew); if (body.size() < (UINT8*)peHeader - (UINT8*)dosHeader) { info += UString("\nDOS header: invalid"); msg(usprintf("%s: PE32 image with invalid DOS header", __FUNCTION__), index); model->addInfo(index, info); return U_SUCCESS; } if (peHeader->Signature != EFI_IMAGE_PE_SIGNATURE) { info += usprintf("\nPE signature: %08Xh, invalid", peHeader->Signature); msg(usprintf("%s: PE32 image with invalid PE signature", __FUNCTION__), index); model->addInfo(index, info); return U_SUCCESS; } const EFI_IMAGE_FILE_HEADER* imageFileHeader = (const EFI_IMAGE_FILE_HEADER*)(peHeader + 1); if (body.size() < (UINT8*)imageFileHeader - (UINT8*)dosHeader) { info += UString("\nPE header: invalid"); msg(usprintf("%s: PE32 image with invalid PE header", __FUNCTION__), index); model->addInfo(index, info); return U_SUCCESS; } info += usprintf("\nDOS signature: %04Xh\nPE signature: %08Xh", dosHeader->e_magic, peHeader->Signature) + UString("\nMachine type: ") + machineTypeToUString(imageFileHeader->Machine) + usprintf("\nNumber of sections: %u\nCharacteristics: %04Xh", imageFileHeader->NumberOfSections, imageFileHeader->Characteristics); EFI_IMAGE_OPTIONAL_HEADER_POINTERS_UNION optionalHeader = {}; optionalHeader.H32 = (const EFI_IMAGE_OPTIONAL_HEADER32*)(imageFileHeader + 1); if (body.size() < (UINT8*)optionalHeader.H32 - (UINT8*)dosHeader) { info += UString("\nPE optional header: invalid"); msg(usprintf("%s: PE32 image with invalid PE optional header", __FUNCTION__), index); model->addInfo(index, info); return U_SUCCESS; } if (optionalHeader.H32->Magic == EFI_IMAGE_PE_OPTIONAL_HDR32_MAGIC) { info += usprintf("\nOptional header signature: %04Xh\nSubsystem: %04Xh\nAddress of entry point: %Xh\nBase of code: %Xh\nImage base: %Xh", optionalHeader.H32->Magic, optionalHeader.H32->Subsystem, optionalHeader.H32->AddressOfEntryPoint, optionalHeader.H32->BaseOfCode, optionalHeader.H32->ImageBase); } else if (optionalHeader.H32->Magic == EFI_IMAGE_PE_OPTIONAL_HDR64_MAGIC) { info += usprintf("\nOptional header signature: %04Xh\nSubsystem: %04Xh\nAddress of entry point: %Xh\nBase of code: %Xh\nImage base: %" PRIX64 "h", optionalHeader.H64->Magic, optionalHeader.H64->Subsystem, optionalHeader.H64->AddressOfEntryPoint, optionalHeader.H64->BaseOfCode, optionalHeader.H64->ImageBase); } else { info += usprintf("\nOptional header signature: %04Xh, unknown", optionalHeader.H32->Magic); msg(usprintf("%s: PE32 image with invalid optional PE header signature", __FUNCTION__), index); } model->addInfo(index, info); return U_SUCCESS; } USTATUS FfsParser::parseTeImageSectionBody(const UModelIndex & index) { // Check sanity if (!index.isValid()) return U_INVALID_PARAMETER; // Get section body UByteArray body = model->body(index); if ((UINT32)body.size() < sizeof(EFI_IMAGE_TE_HEADER)) { msg(usprintf("%s: section body size is smaller than TE header size", __FUNCTION__), index); return U_SUCCESS; } UString info; const EFI_IMAGE_TE_HEADER* teHeader = (const EFI_IMAGE_TE_HEADER*)body.constData(); if (teHeader->Signature != EFI_IMAGE_TE_SIGNATURE) { info += usprintf("\nSignature: %04Xh, invalid", teHeader->Signature); msg(usprintf("%s: TE image with invalid TE signature", __FUNCTION__), index); } else { info += usprintf("\nSignature: %04Xh", teHeader->Signature) + UString("\nMachine type: ") + machineTypeToUString(teHeader->Machine) + usprintf("\nNumber of sections: %u\nSubsystem: %02Xh\nStripped size: %Xh (%u)\n" "Base of code: %Xh\nAddress of entry point: %Xh\nImage base: %" PRIX64 "h\nAdjusted image base: %" PRIX64 "h", teHeader->NumberOfSections, teHeader->Subsystem, teHeader->StrippedSize, teHeader->StrippedSize, teHeader->BaseOfCode, teHeader->AddressOfEntryPoint, teHeader->ImageBase, teHeader->ImageBase + teHeader->StrippedSize - sizeof(EFI_IMAGE_TE_HEADER)); } // Update parsing data TE_IMAGE_SECTION_PARSING_DATA pdata = {}; pdata.imageBaseType = EFI_IMAGE_TE_BASE_OTHER; // Will be determined later pdata.originalImageBase = (UINT32)teHeader->ImageBase; pdata.adjustedImageBase = (UINT32)(teHeader->ImageBase + teHeader->StrippedSize - sizeof(EFI_IMAGE_TE_HEADER)); model->setParsingData(index, UByteArray((const char*)&pdata, sizeof(pdata))); // Add TE info model->addInfo(index, info); return U_SUCCESS; } USTATUS FfsParser::performSecondPass(const UModelIndex & index) { // Sanity check if (!index.isValid() || !lastVtf.isValid()) return U_INVALID_PARAMETER; // Check for compressed lastVtf if (model->compressed(lastVtf)) { msg(usprintf("%s: the last VTF appears inside compressed item, the image may be damaged", __FUNCTION__), lastVtf); return U_SUCCESS; } // Calculate address difference const UINT32 vtfSize = (UINT32)(model->header(lastVtf).size() + model->body(lastVtf).size() + model->tail(lastVtf).size()); addressDiff = 0xFFFFFFFFULL - model->base(lastVtf) - vtfSize + 1; // Parse reset vector data parseResetVectorData(); // Find and parse FIT fitParser->parseFit(index); // Check protected ranges checkProtectedRanges(index); // Check TE files to have original or adjusted base checkTeImageBase(index); return U_SUCCESS; } USTATUS FfsParser::parseResetVectorData() { // Sanity check if (!lastVtf.isValid()) return U_SUCCESS; // Check VTF to have enough space at the end to fit Reset Vector Data UByteArray vtf = model->header(lastVtf) + model->body(lastVtf) + model->tail(lastVtf); if ((UINT32)vtf.size() < sizeof(X86_RESET_VECTOR_DATA)) return U_SUCCESS; const X86_RESET_VECTOR_DATA* resetVectorData = (const X86_RESET_VECTOR_DATA*)(vtf.constData() + vtf.size() - sizeof(X86_RESET_VECTOR_DATA)); // Add info UString info = usprintf("\nAP entry vector: %02X %02X %02X %02X %02X %02X %02X %02X\n" "Reset vector: %02X %02X %02X %02X %02X %02X %02X %02X\n" "PEI core entry point: %08Xh\n" "AP startup segment: %08Xh\n" "BootFV base address: %08Xh\n", resetVectorData->ApEntryVector[0], resetVectorData->ApEntryVector[1], resetVectorData->ApEntryVector[2], resetVectorData->ApEntryVector[3], resetVectorData->ApEntryVector[4], resetVectorData->ApEntryVector[5], resetVectorData->ApEntryVector[6], resetVectorData->ApEntryVector[7], resetVectorData->ResetVector[0], resetVectorData->ResetVector[1], resetVectorData->ResetVector[2], resetVectorData->ResetVector[3], resetVectorData->ResetVector[4], resetVectorData->ResetVector[5], resetVectorData->ResetVector[6], resetVectorData->ResetVector[7], resetVectorData->PeiCoreEntryPoint, resetVectorData->ApStartupSegment, resetVectorData->BootFvBaseAddress); model->addInfo(lastVtf, info); return U_SUCCESS; } USTATUS FfsParser::checkTeImageBase(const UModelIndex & index) { // Sanity check if (!index.isValid()) { return U_INVALID_PARAMETER; } // Determine relocation type of uncompressed TE image sections if (model->compressed(index) == false && model->type(index) == Types::Section && model->subtype(index) == EFI_SECTION_TE) { // Obtain required values from parsing data UINT32 originalImageBase = 0; UINT32 adjustedImageBase = 0; UINT8 imageBaseType = EFI_IMAGE_TE_BASE_OTHER; if (model->hasEmptyParsingData(index) == false) { UByteArray data = model->parsingData(index); const TE_IMAGE_SECTION_PARSING_DATA* pdata = (const TE_IMAGE_SECTION_PARSING_DATA*)data.constData(); originalImageBase = readUnaligned(pdata).originalImageBase; adjustedImageBase = readUnaligned(pdata).adjustedImageBase; } if (originalImageBase != 0 || adjustedImageBase != 0) { // Check data memory address to be equal to either OriginalImageBase or AdjustedImageBase UINT64 address = addressDiff + model->base(index); UINT32 base = (UINT32)(address + model->header(index).size()); if (originalImageBase == base) { imageBaseType = EFI_IMAGE_TE_BASE_ORIGINAL; } else if (adjustedImageBase == base) { imageBaseType = EFI_IMAGE_TE_BASE_ADJUSTED; } else { // Check for one-bit difference UINT32 xored = base ^ originalImageBase; // XOR result can't be zero if ((xored & (xored - 1)) == 0) { // Check that XOR result is a power of 2, i.e. has exactly one bit set imageBaseType = EFI_IMAGE_TE_BASE_ORIGINAL; } else { // The same check for adjustedImageBase xored = base ^ adjustedImageBase; if ((xored & (xored - 1)) == 0) { imageBaseType = EFI_IMAGE_TE_BASE_ADJUSTED; } } } // Show message if imageBaseType is still unknown if (imageBaseType == EFI_IMAGE_TE_BASE_OTHER) { msg(usprintf("%s: TE image base is neither zero, nor original, nor adjusted, nor top-swapped", __FUNCTION__), index); } // Update parsing data TE_IMAGE_SECTION_PARSING_DATA pdata = {}; pdata.imageBaseType = imageBaseType; pdata.originalImageBase = originalImageBase; pdata.adjustedImageBase = adjustedImageBase; model->setParsingData(index, UByteArray((const char*)&pdata, sizeof(pdata))); } } // Process child items for (int i = 0; i < model->rowCount(index); i++) { checkTeImageBase(index.model()->index(i, 0, index)); } return U_SUCCESS; } USTATUS FfsParser::addInfoRecursive(const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // Add offset model->addInfo(index, usprintf("Offset: %Xh\n", model->offset(index)), false); // Add current base if the element is not compressed // or it's compressed, but its parent isn't if ((!model->compressed(index)) || (index.parent().isValid() && !model->compressed(index.parent()))) { // Add physical address of the whole item or its header and data portions separately UINT64 address = addressDiff + model->base(index); if (address <= 0xFFFFFFFFUL) { UINT32 headerSize = (UINT32)model->header(index).size(); if (headerSize) { model->addInfo(index, usprintf("Data address: %08Xh\n", (UINT32)address + headerSize),false); model->addInfo(index, usprintf("Header address: %08Xh\n", (UINT32)address), false); } else { model->addInfo(index, usprintf("Address: %08Xh\n", (UINT32)address), false); } } // Add base model->addInfo(index, usprintf("Base: %Xh\n", model->base(index)), false); } model->addInfo(index, usprintf("Fixed: %s\n", model->fixed(index) ? "Yes" : "No"), false); // Process child items for (int i = 0; i < model->rowCount(index); i++) { addInfoRecursive(index.model()->index(i, 0, index)); } return U_SUCCESS; } USTATUS FfsParser::checkProtectedRanges(const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // QByteArray (Qt builds) supports obtaining data from invalid offsets in QByteArray, // so mid() here doesn't throw anything for UEFITool, just returns ranges with all zeroes // UByteArray (non-Qt builds) throws an exception that needs to be caught every time or the tools will crash. // Calculate digest for BG-protected ranges UByteArray protectedParts; bool bgProtectedRangeFound = false; try { for (UINT32 i = 0; i < (UINT32)protectedRanges.size(); i++) { if (protectedRanges[i].Type == PROTECTED_RANGE_INTEL_BOOT_GUARD_IBB) { bgProtectedRangeFound = true; if ((UINT64)protectedRanges[i].Offset >= addressDiff) { protectedRanges[i].Offset -= (UINT32)addressDiff; } else { msg(usprintf("%s: suspicious protected range offset", __FUNCTION__), index); } protectedParts += openedImage.mid(protectedRanges[i].Offset, protectedRanges[i].Size); markProtectedRangeRecursive(index, protectedRanges[i]); } } } catch (...) { bgProtectedRangeFound = false; } if (bgProtectedRangeFound) { UINT8 digest[SHA512_HASH_SIZE] = {}; UString digestString; UString ibbDigests; // SHA1 digestString = ""; sha1(protectedParts.constData(), protectedParts.size(), digest); for (UINT8 i = 0; i < SHA1_HASH_SIZE; i++) { digestString += usprintf("%02X", digest[i]); } ibbDigests += UString("Computed IBB Hash (SHA1): ") + digestString + "\n"; // SHA256 digestString = ""; sha256(protectedParts.constData(), protectedParts.size(), digest); for (UINT8 i = 0; i < SHA256_HASH_SIZE; i++) { digestString += usprintf("%02X", digest[i]); } ibbDigests += UString("Computed IBB Hash (SHA256): ") + digestString + "\n"; // SHA384 digestString = ""; sha384(protectedParts.constData(), protectedParts.size(), digest); for (UINT8 i = 0; i < SHA384_HASH_SIZE; i++) { digestString += usprintf("%02X", digest[i]); } ibbDigests += UString("Computed IBB Hash (SHA384): ") + digestString + "\n"; // SHA512 digestString = ""; sha512(protectedParts.constData(), protectedParts.size(), digest); for (UINT8 i = 0; i < SHA512_HASH_SIZE; i++) { digestString += usprintf("%02X", digest[i]); } ibbDigests += UString("Computed IBB Hash (SHA512): ") + digestString + "\n"; // SM3 digestString = ""; sm3(protectedParts.constData(), protectedParts.size(), digest); for (UINT8 i = 0; i < SM3_HASH_SIZE; i++) { digestString += usprintf("%02X", digest[i]); } ibbDigests += UString("Computed IBB Hash (SM3): ") + digestString + "\n"; securityInfo += ibbDigests + "\n"; } // Calculate digests for vendor-protected ranges for (UINT32 i = 0; i < (UINT32)protectedRanges.size(); i++) { if (protectedRanges[i].Type == PROTECTED_RANGE_INTEL_BOOT_GUARD_POST_IBB) { if (!dxeCore.isValid()) { msg(usprintf("%s: can't determine DXE volume offset, post-IBB protected range hash can't be checked", __FUNCTION__), index); } else { // Offset will be determined as the offset of root volume with first DXE core UModelIndex dxeRootVolumeIndex = model->findLastParentOfType(dxeCore, Types::Volume); if (!dxeRootVolumeIndex.isValid()) { msg(usprintf("%s: can't determine DXE volume offset, post-IBB protected range hash can't be checked", __FUNCTION__), index); } else { try { protectedRanges[i].Offset = model->base(dxeRootVolumeIndex); protectedRanges[i].Size = (UINT32)(model->header(dxeRootVolumeIndex).size() + model->body(dxeRootVolumeIndex).size() + model->tail(dxeRootVolumeIndex).size()); protectedParts = openedImage.mid(protectedRanges[i].Offset, protectedRanges[i].Size); // Calculate the hash UByteArray digest(SHA512_HASH_SIZE, '\x00'); if (protectedRanges[i].AlgorithmId == TCG_HASH_ALGORITHM_ID_SHA1) { sha1(protectedParts.constData(), protectedParts.size(), digest.data()); digest = digest.left(SHA1_HASH_SIZE); } else if (protectedRanges[i].AlgorithmId == TCG_HASH_ALGORITHM_ID_SHA256) { sha256(protectedParts.constData(), protectedParts.size(), digest.data()); digest = digest.left(SHA256_HASH_SIZE); } else if (protectedRanges[i].AlgorithmId == TCG_HASH_ALGORITHM_ID_SHA384) { sha384(protectedParts.constData(), protectedParts.size(), digest.data()); digest = digest.left(SHA384_HASH_SIZE); } else if (protectedRanges[i].AlgorithmId == TCG_HASH_ALGORITHM_ID_SHA512) { sha512(protectedParts.constData(), protectedParts.size(), digest.data()); digest = digest.left(SHA512_HASH_SIZE); } else if (protectedRanges[i].AlgorithmId == TCG_HASH_ALGORITHM_ID_SM3) { sm3(protectedParts.constData(), protectedParts.size(), digest.data()); digest = digest.left(SM3_HASH_SIZE); } else { msg(usprintf("%s: post-IBB protected range [%Xh:%Xh] uses unknown hash algorithm %04Xh", __FUNCTION__, protectedRanges[i].Offset, protectedRanges[i].Offset + protectedRanges[i].Size, protectedRanges[i].AlgorithmId), model->findByBase(protectedRanges[i].Offset)); } // Check the hash if (digest != protectedRanges[i].Hash) { msg(usprintf("%s: post-IBB protected range [%Xh:%Xh] hash mismatch, opened image may refuse to boot", __FUNCTION__, protectedRanges[i].Offset, protectedRanges[i].Offset + protectedRanges[i].Size), model->findByBase(protectedRanges[i].Offset)); } markProtectedRangeRecursive(index, protectedRanges[i]); } catch(...) { // Do nothing, this range is likely not found in the image } } } } else if (protectedRanges[i].Type == PROTECTED_RANGE_VENDOR_HASH_AMI_V1) { if (!dxeCore.isValid()) { msg(usprintf("%s: can't determine DXE volume offset, AMI v1 protected range hash can't be checked", __FUNCTION__), index); } else { // Offset will be determined as the offset of root volume with first DXE core UModelIndex dxeRootVolumeIndex = model->findLastParentOfType(dxeCore, Types::Volume); if (!dxeRootVolumeIndex.isValid()) { msg(usprintf("%s: can't determine DXE volume offset, AMI v1 protected range hash can't be checked", __FUNCTION__), index); } else { try { protectedRanges[i].Offset = model->base(dxeRootVolumeIndex); protectedParts = openedImage.mid(protectedRanges[i].Offset, protectedRanges[i].Size); UByteArray digest(SHA256_HASH_SIZE, '\x00'); sha256(protectedParts.constData(), protectedParts.size(), digest.data()); if (digest != protectedRanges[i].Hash) { msg(usprintf("%s: AMI v1 protected range [%Xh:%Xh] hash mismatch, opened image may refuse to boot", __FUNCTION__, protectedRanges[i].Offset, protectedRanges[i].Offset + protectedRanges[i].Size), model->findByBase(protectedRanges[i].Offset)); } markProtectedRangeRecursive(index, protectedRanges[i]); } catch (...) { // Do nothing, this range is likely not found in the image } } } } else if (protectedRanges[i].Type == PROTECTED_RANGE_VENDOR_HASH_AMI_V2) { try { protectedRanges[i].Offset -= (UINT32)addressDiff; protectedParts = openedImage.mid(protectedRanges[i].Offset, protectedRanges[i].Size); UByteArray digest(SHA256_HASH_SIZE, '\x00'); sha256(protectedParts.constData(), protectedParts.size(), digest.data()); if (digest != protectedRanges[i].Hash) { msg(usprintf("%s: AMI v2 protected range [%Xh:%Xh] hash mismatch, opened image may refuse to boot", __FUNCTION__, protectedRanges[i].Offset, protectedRanges[i].Offset + protectedRanges[i].Size), model->findByBase(protectedRanges[i].Offset)); } markProtectedRangeRecursive(index, protectedRanges[i]); } catch(...) { // Do nothing, this range is likely not found in the image } } else if (protectedRanges[i].Type == PROTECTED_RANGE_VENDOR_HASH_AMI_V3) { try { protectedRanges[i].Offset -= (UINT32)addressDiff; protectedParts = openedImage.mid(protectedRanges[i].Offset, protectedRanges[i].Size); markProtectedRangeRecursive(index, protectedRanges[i]); // Process second range if (i + 1 < (UINT32)protectedRanges.size() && protectedRanges[i + 1].Type == PROTECTED_RANGE_VENDOR_HASH_AMI_V3) { protectedRanges[i + 1].Offset -= (UINT32)addressDiff; protectedParts += openedImage.mid(protectedRanges[i + 1].Offset, protectedRanges[i + 1].Size); markProtectedRangeRecursive(index, protectedRanges[i + 1]); // Process third range if (i + 2 < (UINT32)protectedRanges.size() && protectedRanges[i + 2].Type == PROTECTED_RANGE_VENDOR_HASH_AMI_V3) { protectedRanges[i + 2].Offset -= (UINT32)addressDiff; protectedParts += openedImage.mid(protectedRanges[i + 2].Offset, protectedRanges[i + 2].Size); markProtectedRangeRecursive(index, protectedRanges[i + 2]); // Process fourth range if (i + 3 < (UINT32)protectedRanges.size() && protectedRanges[i + 3].Type == PROTECTED_RANGE_VENDOR_HASH_AMI_V3) { protectedRanges[i + 3].Offset -= (UINT32)addressDiff; protectedParts += openedImage.mid(protectedRanges[i + 3].Offset, protectedRanges[i + 3].Size); markProtectedRangeRecursive(index, protectedRanges[i + 3]); i += 3; // Skip 3 already processed ranges } else { i += 2; // Skip 2 already processed ranges } } else { i += 1; // Skip 1 already processed range } } UByteArray digest(SHA256_HASH_SIZE, '\x00'); sha256(protectedParts.constData(), protectedParts.size(), digest.data()); if (digest != protectedRanges[i].Hash) { msg(usprintf("%s: AMI v3 protected ranges hash mismatch, opened image may refuse to boot", __FUNCTION__)); } } catch (...) { // Do nothing, this range is likely not found in the image } } else if (protectedRanges[i].Type == PROTECTED_RANGE_VENDOR_HASH_PHOENIX) { try { protectedRanges[i].Offset += (UINT32)protectedRegionsBase; protectedParts = openedImage.mid(protectedRanges[i].Offset, protectedRanges[i].Size); UByteArray digest(SHA256_HASH_SIZE, '\x00'); sha256(protectedParts.constData(), protectedParts.size(), digest.data()); if (digest != protectedRanges[i].Hash) { msg(usprintf("%s: Phoenix protected range [%Xh:%Xh] hash mismatch, opened image may refuse to boot", __FUNCTION__, protectedRanges[i].Offset, protectedRanges[i].Offset + protectedRanges[i].Size), model->findByBase(protectedRanges[i].Offset)); } markProtectedRangeRecursive(index, protectedRanges[i]); } catch(...) { // Do nothing, this range is likely not found in the image } } else if (protectedRanges[i].Type == PROTECTED_RANGE_VENDOR_HASH_MICROSOFT_PMDA) { try { protectedRanges[i].Offset -= (UINT32)addressDiff; protectedParts = openedImage.mid(protectedRanges[i].Offset, protectedRanges[i].Size); // Calculate the hash UByteArray digest(SHA512_HASH_SIZE, '\x00'); if (protectedRanges[i].AlgorithmId == TCG_HASH_ALGORITHM_ID_SHA1) { sha1(protectedParts.constData(), protectedParts.size(), digest.data()); digest = digest.left(SHA1_HASH_SIZE); } else if (protectedRanges[i].AlgorithmId == TCG_HASH_ALGORITHM_ID_SHA256) { sha256(protectedParts.constData(), protectedParts.size(), digest.data()); digest = digest.left(SHA256_HASH_SIZE); } else if (protectedRanges[i].AlgorithmId == TCG_HASH_ALGORITHM_ID_SHA384) { sha384(protectedParts.constData(), protectedParts.size(), digest.data()); digest = digest.left(SHA384_HASH_SIZE); } else if (protectedRanges[i].AlgorithmId == TCG_HASH_ALGORITHM_ID_SHA512) { sha512(protectedParts.constData(), protectedParts.size(), digest.data()); digest = digest.left(SHA512_HASH_SIZE); } else if (protectedRanges[i].AlgorithmId == TCG_HASH_ALGORITHM_ID_SM3) { sm3(protectedParts.constData(), protectedParts.size(), digest.data()); digest = digest.left(SM3_HASH_SIZE); } else { msg(usprintf("%s: Microsoft PMDA protected range [%Xh:%Xh] uses unknown hash algorithm %04Xh", __FUNCTION__, protectedRanges[i].Offset, protectedRanges[i].Offset + protectedRanges[i].Size, protectedRanges[i].AlgorithmId), model->findByBase(protectedRanges[i].Offset)); } // Check the hash if (digest != protectedRanges[i].Hash) { msg(usprintf("%s: Microsoft PMDA protected range [%Xh:%Xh] hash mismatch, opened image may refuse to boot", __FUNCTION__, protectedRanges[i].Offset, protectedRanges[i].Offset + protectedRanges[i].Size), model->findByBase(protectedRanges[i].Offset)); } markProtectedRangeRecursive(index, protectedRanges[i]); } catch(...) { // Do nothing, this range is likely not found in the image } } } return U_SUCCESS; } USTATUS FfsParser::markProtectedRangeRecursive(const UModelIndex & index, const PROTECTED_RANGE & range) { if (!index.isValid()) return U_SUCCESS; // Mark compressed items UModelIndex parentIndex = model->parent(index); if (parentIndex.isValid() && model->compressed(index) && model->compressed(parentIndex)) { model->setMarking(index, model->marking(parentIndex)); } // Mark normal items else { UINT32 currentOffset = model->base(index); UINT32 currentSize = (UINT32)(model->header(index).size() + model->body(index).size() + model->tail(index).size()); if (std::min(currentOffset + currentSize, range.Offset + range.Size) > std::max(currentOffset, range.Offset)) { if (range.Offset <= currentOffset && currentOffset + currentSize <= range.Offset + range.Size) { // Mark as fully in range if (range.Type == PROTECTED_RANGE_INTEL_BOOT_GUARD_IBB) { model->setMarking(index, BootGuardMarking::BootGuardFullyInRange); } else { model->setMarking(index, BootGuardMarking::VendorFullyInRange); } } else { // Mark as partially in range model->setMarking(index, BootGuardMarking::PartiallyInRange); } } } for (int i = 0; i < model->rowCount(index); i++) { markProtectedRangeRecursive(index.model()->index(i, 0, index), range); } return U_SUCCESS; } USTATUS FfsParser::parseVendorHashFile(const UByteArray & fileGuid, const UModelIndex & index) { // Check sanity if (!index.isValid()) { return U_INVALID_PARAMETER; } const UByteArray& body = model->body(index); UINT32 size = (UINT32)body.size(); if (fileGuid == PROTECTED_RANGE_VENDOR_HASH_FILE_GUID_PHOENIX) { if (size < sizeof(PROTECTED_RANGE_VENDOR_HASH_FILE_HEADER_PHOENIX)) { msg(usprintf("%s: unknown or corrupted Phoenix protected ranges hash file", __FUNCTION__), index); } else { const PROTECTED_RANGE_VENDOR_HASH_FILE_HEADER_PHOENIX* header = (const PROTECTED_RANGE_VENDOR_HASH_FILE_HEADER_PHOENIX*)body.constData(); if (header->Signature == BG_VENDOR_HASH_FILE_SIGNATURE_PHOENIX) { if (size < sizeof(PROTECTED_RANGE_VENDOR_HASH_FILE_HEADER_PHOENIX) + header->NumEntries * sizeof(PROTECTED_RANGE_VENDOR_HASH_FILE_ENTRY)) { msg(usprintf("%s: unknown or corrupted Phoenix protected ranges hash file", __FUNCTION__), index); } else { if (header->NumEntries > 0) { bool protectedRangesFound = false; for (UINT32 i = 0; i < header->NumEntries; i++) { const PROTECTED_RANGE_VENDOR_HASH_FILE_ENTRY* entry = (const PROTECTED_RANGE_VENDOR_HASH_FILE_ENTRY*)(header + 1) + i; if (entry->Base != 0xFFFFFFFF && entry->Size != 0 && entry->Size != 0xFFFFFFFF) { protectedRangesFound = true; PROTECTED_RANGE range = {}; range.Offset = entry->Base; range.Size = entry->Size; range.AlgorithmId = TCG_HASH_ALGORITHM_ID_SHA256; range.Hash = UByteArray((const char*)entry->Hash, sizeof(entry->Hash)); range.Type = PROTECTED_RANGE_VENDOR_HASH_PHOENIX; protectedRanges.push_back(range); } } if (protectedRangesFound) { securityInfo += usprintf("Phoenix hash file found at base %08Xh\nProtected ranges:\n", model->base(index)); for (UINT32 i = 0; i < header->NumEntries; i++) { const PROTECTED_RANGE_VENDOR_HASH_FILE_ENTRY* entry = (const PROTECTED_RANGE_VENDOR_HASH_FILE_ENTRY*)(header + 1) + i; securityInfo += usprintf("RelativeOffset: %08Xh Size: %Xh\nHash: ", entry->Base, entry->Size); for (UINT8 j = 0; j < sizeof(entry->Hash); j++) { securityInfo += usprintf("%02X", entry->Hash[j]); } securityInfo += "\n"; } } } } } } model->setText(index, UString("Phoenix protected ranges hash file")); } else if (fileGuid == PROTECTED_RANGE_VENDOR_HASH_FILE_GUID_AMI) { UModelIndex fileIndex = model->parent(index); if (size == sizeof(PROTECTED_RANGE_VENDOR_HASH_FILE_HEADER_AMI_V1)) { securityInfo += usprintf("AMI protected ranges hash file v1 found at base %08Xh\nProtected range:\n", model->base(fileIndex)); const PROTECTED_RANGE_VENDOR_HASH_FILE_HEADER_AMI_V1* entry = (const PROTECTED_RANGE_VENDOR_HASH_FILE_HEADER_AMI_V1*)(body.constData()); securityInfo += usprintf("Size: %Xh\nHash (SHA256): ", entry->Size); for (UINT8 i = 0; i < sizeof(entry->Hash); i++) { securityInfo += usprintf("%02X", entry->Hash[i]); } securityInfo += "\n"; if (entry->Size != 0 && entry->Size != 0xFFFFFFFF) { PROTECTED_RANGE range = {}; range.Offset = 0; range.Size = entry->Size; range.AlgorithmId = TCG_HASH_ALGORITHM_ID_SHA256; range.Hash = UByteArray((const char*)entry->Hash, sizeof(entry->Hash)); range.Type = PROTECTED_RANGE_VENDOR_HASH_AMI_V1; protectedRanges.push_back(range); } model->setText(fileIndex, UString("AMI v1 protected ranges hash file")); } else if (size == sizeof(PROTECTED_RANGE_VENDOR_HASH_FILE_HEADER_AMI_V2)) { const PROTECTED_RANGE_VENDOR_HASH_FILE_HEADER_AMI_V2* entry = (const PROTECTED_RANGE_VENDOR_HASH_FILE_HEADER_AMI_V2*)(body.constData()); securityInfo += usprintf("AMI v2 protected ranges hash file found at base %08Xh\nProtected ranges:", model->base(fileIndex)); securityInfo += usprintf("\nAddress: %08Xh, Size: %Xh\nHash (SHA256): ", entry->Hash0.Base, entry->Hash0.Size); for (UINT8 j = 0; j < sizeof(entry->Hash0.Hash); j++) { securityInfo += usprintf("%02X", entry->Hash0.Hash[j]); } securityInfo += usprintf("\nAddress: %08Xh, Size: %Xh\nHash (SHA256): ", entry->Hash1.Base, entry->Hash1.Size); for (UINT8 j = 0; j < sizeof(entry->Hash1.Hash); j++) { securityInfo += usprintf("%02X", entry->Hash1.Hash[j]); } securityInfo += "\n"; if (entry->Hash0.Base != 0xFFFFFFFF && entry->Hash0.Size != 0 && entry->Hash0.Size != 0xFFFFFFFF) { PROTECTED_RANGE range = {}; range.Offset = entry->Hash0.Base; range.Size = entry->Hash0.Size; range.AlgorithmId = TCG_HASH_ALGORITHM_ID_SHA256; range.Hash = UByteArray((const char*)entry->Hash0.Hash, sizeof(entry->Hash0.Hash)); range.Type = PROTECTED_RANGE_VENDOR_HASH_AMI_V2; protectedRanges.push_back(range); } if (entry->Hash1.Base != 0xFFFFFFFF && entry->Hash1.Size != 0 && entry->Hash1.Size != 0xFFFFFFFF) { PROTECTED_RANGE range = {}; range.Offset = entry->Hash1.Base; range.Size = entry->Hash1.Size; range.AlgorithmId = TCG_HASH_ALGORITHM_ID_SHA256; range.Hash = UByteArray((const char*)entry->Hash1.Hash, sizeof(entry->Hash1.Hash)); range.Type = PROTECTED_RANGE_VENDOR_HASH_AMI_V2; protectedRanges.push_back(range); } model->setText(fileIndex, UString("AMI v2 protected ranges hash file")); } else if (size == sizeof(PROTECTED_RANGE_VENDOR_HASH_FILE_HEADER_AMI_V3)) { const PROTECTED_RANGE_VENDOR_HASH_FILE_HEADER_AMI_V3* entry = (const PROTECTED_RANGE_VENDOR_HASH_FILE_HEADER_AMI_V3*)(body.constData()); securityInfo += usprintf("AMI v3 protected ranges hash file found at base %08Xh\nProtected ranges:", model->base(fileIndex)); securityInfo += usprintf("\nFvBaseSegment 0 Address: %08Xh, Size: %Xh", entry->FvMainSegmentBase[0], entry->FvMainSegmentSize[0]); securityInfo += usprintf("\nFvBaseSegment 1 Address: %08Xh, Size: %Xh", entry->FvMainSegmentBase[1], entry->FvMainSegmentSize[1]); securityInfo += usprintf("\nFvBaseSegment 2 Address: %08Xh, Size: %Xh", entry->FvMainSegmentBase[2], entry->FvMainSegmentSize[2]); securityInfo += usprintf("\nNestedFvBase Address: %08Xh, Size: %Xh", entry->NestedFvBase, entry->NestedFvSize); securityInfo += usprintf("\nHash (SHA256): "); for (UINT8 j = 0; j < sizeof(entry->Hash); j++) { securityInfo += usprintf("%02X", entry->Hash[j]); } securityInfo += "\n"; if (entry->FvMainSegmentBase[0] != 0xFFFFFFFF && entry->FvMainSegmentSize[0] != 0 && entry->FvMainSegmentSize[0] != 0xFFFFFFFF) { PROTECTED_RANGE range = {}; range.Offset = entry->FvMainSegmentBase[0]; range.Size = entry->FvMainSegmentSize[0]; range.AlgorithmId = TCG_HASH_ALGORITHM_ID_SHA256; range.Hash = UByteArray((const char*)entry->Hash, sizeof(entry->Hash)); range.Type = PROTECTED_RANGE_VENDOR_HASH_AMI_V3; protectedRanges.push_back(range); } if (entry->FvMainSegmentBase[1] != 0xFFFFFFFF && entry->FvMainSegmentSize[1] != 0 && entry->FvMainSegmentSize[1] != 0xFFFFFFFF) { PROTECTED_RANGE range = {}; range.Offset = entry->FvMainSegmentBase[1]; range.Size = entry->FvMainSegmentSize[1]; range.AlgorithmId = TCG_HASH_ALGORITHM_ID_SHA256; range.Hash = UByteArray((const char*)entry->Hash, sizeof(entry->Hash)); range.Type = PROTECTED_RANGE_VENDOR_HASH_AMI_V3; protectedRanges.push_back(range); } if (entry->FvMainSegmentBase[2] != 0xFFFFFFFF && entry->FvMainSegmentSize[2] != 0 && entry->FvMainSegmentSize[2] != 0xFFFFFFFF) { PROTECTED_RANGE range = {}; range.Offset = entry->FvMainSegmentBase[2]; range.Size = entry->FvMainSegmentSize[2]; range.AlgorithmId = TCG_HASH_ALGORITHM_ID_SHA256; range.Hash = UByteArray((const char*)entry->Hash, sizeof(entry->Hash)); range.Type = PROTECTED_RANGE_VENDOR_HASH_AMI_V3; protectedRanges.push_back(range); } if (entry->NestedFvBase != 0xFFFFFFFF && entry->NestedFvSize != 0 && entry->NestedFvSize != 0xFFFFFFFF) { PROTECTED_RANGE range = {}; range.Offset = entry->NestedFvBase; range.Size = entry->NestedFvSize; range.AlgorithmId = TCG_HASH_ALGORITHM_ID_SHA256; range.Hash = UByteArray((const char*)entry->Hash, sizeof(entry->Hash)); range.Type = PROTECTED_RANGE_VENDOR_HASH_AMI_V3; protectedRanges.push_back(range); } model->setText(fileIndex, UString("AMI v3 protected ranges hash file")); } else { msg(usprintf("%s: unknown or corrupted AMI protected ranges hash file", __FUNCTION__), fileIndex); } } return U_SUCCESS; } USTATUS FfsParser::parseMicrocodeVolumeBody(const UModelIndex & index) { const UINT32 headerSize = (UINT32)model->header(index).size(); const UINT32 bodySize = (UINT32)model->body(index).size(); UINT32 offset = 0; USTATUS result = U_SUCCESS; while(true) { // Parse current microcode UModelIndex currentMicrocode; UByteArray ucode = model->body(index).mid(offset); // Check for empty area if (ucode.size() == ucode.count('\xFF') || ucode.size() == ucode.count('\x00')) { result = U_INVALID_MICROCODE; } else { result = parseIntelMicrocodeHeader(ucode, headerSize + offset, index, currentMicrocode); } // Add the rest as padding if (result) { if (offset < bodySize) { // Get info UString name = UString("Padding"); UString info = usprintf("Full size: %Xh (%u)", (UINT32)ucode.size(), (UINT32)ucode.size()); // Add tree item model->addItem(headerSize + offset, Types::Padding, getPaddingType(ucode), name, UString(), info, UByteArray(), ucode, UByteArray(), Fixed, index); } return U_SUCCESS; } // Get to next candidate offset += model->header(currentMicrocode).size() + model->body(currentMicrocode).size() + model->tail(currentMicrocode).size(); if (offset >= bodySize) break; } return U_SUCCESS; } USTATUS FfsParser::parseIntelMicrocodeHeader(const UByteArray & microcode, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index) { // We have enough data to fit the header if ((UINT32)microcode.size() < sizeof(INTEL_MICROCODE_HEADER)) { return U_INVALID_MICROCODE; } const INTEL_MICROCODE_HEADER* ucodeHeader = (const INTEL_MICROCODE_HEADER*)microcode.constData(); if (!microcodeHeaderValid(ucodeHeader)) { return U_INVALID_MICROCODE; } // We have enough data to fit the whole TotalSize if ((UINT32)microcode.size() < ucodeHeader->TotalSize) { return U_INVALID_MICROCODE; } // Valid microcode found UINT32 dataSize = ucodeHeader->DataSize; if (dataSize == 0) { dataSize = INTEL_MICROCODE_REAL_DATA_SIZE_ON_ZERO; } // Cross check DataSize and TotalSize if (ucodeHeader->TotalSize < sizeof(INTEL_MICROCODE_HEADER) + dataSize) { return U_INVALID_MICROCODE; } // Recalculate the whole microcode checksum UByteArray tempMicrocode = microcode; INTEL_MICROCODE_HEADER* tempUcodeHeader = (INTEL_MICROCODE_HEADER*)(tempMicrocode.data()); tempUcodeHeader->Checksum = 0; UINT32 calculated = calculateChecksum32((const UINT32*)tempMicrocode.constData(), tempUcodeHeader->TotalSize); bool msgInvalidChecksum = (ucodeHeader->Checksum != calculated); // Construct header, body and tail UByteArray header = microcode.left(sizeof(INTEL_MICROCODE_HEADER)); UByteArray body = microcode.mid(sizeof(INTEL_MICROCODE_HEADER), dataSize); UByteArray tail; // Check if the tail is present if (ucodeHeader->TotalSize > sizeof(INTEL_MICROCODE_HEADER) + dataSize) { tail = microcode.mid(sizeof(INTEL_MICROCODE_HEADER) + dataSize, ucodeHeader->TotalSize - (sizeof(INTEL_MICROCODE_HEADER) + dataSize)); } // Check if we have extended header in the tail UString extendedHeaderInfo; bool msgUnknownOrDamagedMicrocodeTail = false; if ((UINT32)tail.size() >= sizeof(INTEL_MICROCODE_EXTENDED_HEADER)) { const INTEL_MICROCODE_EXTENDED_HEADER* extendedHeader = (const INTEL_MICROCODE_EXTENDED_HEADER*)tail.constData(); // Reserved bytes are all zeroes bool extendedReservedBytesValid = true; for (UINT8 i = 0; i < sizeof(extendedHeader->Reserved); i++) { if (extendedHeader->Reserved[i] != 0x00) { extendedReservedBytesValid = false; break; } } // We have more than 0 entries and they are all in the tail if (extendedReservedBytesValid && extendedHeader->EntryCount > 0 && (UINT32)tail.size() == sizeof(INTEL_MICROCODE_EXTENDED_HEADER) + extendedHeader->EntryCount * sizeof(INTEL_MICROCODE_EXTENDED_HEADER_ENTRY)) { // Recalculate extended header checksum INTEL_MICROCODE_EXTENDED_HEADER* tempExtendedHeader = (INTEL_MICROCODE_EXTENDED_HEADER*)(tempMicrocode.data() + sizeof(INTEL_MICROCODE_HEADER) + dataSize); tempExtendedHeader->Checksum = 0; UINT32 extendedCalculated = calculateChecksum32((const UINT32*)tempExtendedHeader, sizeof(INTEL_MICROCODE_EXTENDED_HEADER) + extendedHeader->EntryCount * sizeof(INTEL_MICROCODE_EXTENDED_HEADER_ENTRY)); extendedHeaderInfo = usprintf("\nExtended header entries: %u\nExtended header checksum: %08Xh, ", extendedHeader->EntryCount, extendedHeader->Checksum) + (extendedHeader->Checksum == extendedCalculated ? UString("valid") : usprintf("invalid, should be %08Xh", extendedCalculated)); const INTEL_MICROCODE_EXTENDED_HEADER_ENTRY* firstEntry = (const INTEL_MICROCODE_EXTENDED_HEADER_ENTRY*)(extendedHeader + 1); for (UINT32 i = 0; i < extendedHeader->EntryCount; i++) { const INTEL_MICROCODE_EXTENDED_HEADER_ENTRY* entry = (const INTEL_MICROCODE_EXTENDED_HEADER_ENTRY*)(firstEntry + i); // Recalculate checksum after patching tempUcodeHeader->Checksum = 0; tempUcodeHeader->ProcessorFlags = entry->ProcessorFlags; tempUcodeHeader->ProcessorSignature = entry->ProcessorSignature; UINT32 entryCalculated = calculateChecksum32((const UINT32*)tempMicrocode.constData(), sizeof(INTEL_MICROCODE_HEADER) + dataSize); extendedHeaderInfo += usprintf("\nCPU signature #%u: %08Xh\nCPU flags #%u: %02Xh\nChecksum #%u: %08Xh, ", i + 1, entry->ProcessorSignature, i + 1, entry->ProcessorFlags, i + 1, entry->Checksum) + (entry->Checksum == entryCalculated ? UString("valid") : usprintf("invalid, should be %08Xh", entryCalculated)); } } else { msgUnknownOrDamagedMicrocodeTail = true; } } else if (tail.size() != 0) { msgUnknownOrDamagedMicrocodeTail = true; } // Get microcode binary UByteArray microcodeBinary = microcode.left(ucodeHeader->TotalSize); // Add info UString name("Intel microcode"); UString info = usprintf("Full size: %Xh (%u)\nHeader size: 0h (0u)\nBody size: %Xh (%u)\nTail size: 0h (0u)\n" "Date: %02X.%02X.%04x\nCPU signature: %08Xh\nRevision: %08Xh\nCPU flags: %02Xh\nChecksum: %08Xh, ", (UINT32)microcodeBinary.size(), (UINT32)microcodeBinary.size(), (UINT32)microcodeBinary.size(), (UINT32)microcodeBinary.size(), ucodeHeader->DateDay, ucodeHeader->DateMonth, ucodeHeader->DateYear, ucodeHeader->ProcessorSignature, ucodeHeader->UpdateRevision, ucodeHeader->ProcessorFlags, ucodeHeader->Checksum) + (ucodeHeader->Checksum == calculated ? UString("valid") : usprintf("invalid, should be %08Xh", calculated)) + extendedHeaderInfo; // Add tree item index = model->addItem(localOffset, Types::Microcode, Subtypes::IntelMicrocode, name, UString(), info, UByteArray(), microcodeBinary, UByteArray(), Fixed, parent); if (msgInvalidChecksum) msg(usprintf("%s: invalid microcode checksum %08Xh, should be %08Xh", __FUNCTION__, ucodeHeader->Checksum, calculated), index); if (msgUnknownOrDamagedMicrocodeTail) msg(usprintf("%s: extended header of size %Xh (%u) found, but it's damaged or has unknown format", __FUNCTION__, (UINT32)tail.size(), (UINT32)tail.size()), index); // No need to parse the body further for now return U_SUCCESS; } USTATUS FfsParser::parseBpdtRegion(const UByteArray & region, const UINT32 localOffset, const UINT32 sbpdtOffsetFixup, const UModelIndex & parent, UModelIndex & index) { UINT32 regionSize = (UINT32)region.size(); // Check region size if (regionSize < sizeof(BPDT_HEADER)) { msg(usprintf("%s: BPDT region too small to fit BPDT partition table header", __FUNCTION__), parent); return U_INVALID_ME_PARTITION_TABLE; } // Populate partition table header const BPDT_HEADER* ptHeader = (const BPDT_HEADER*)(region.constData()); // Check region size again UINT32 ptBodySize = ptHeader->NumEntries * sizeof(BPDT_ENTRY); UINT32 ptSize = sizeof(BPDT_HEADER) + ptBodySize; if (regionSize < ptSize) { msg(usprintf("%s: BPDT region too small to fit BPDT partition table", __FUNCTION__), parent); return U_INVALID_ME_PARTITION_TABLE; } // Get info UByteArray header = region.left(sizeof(BPDT_HEADER)); UByteArray body = region.mid(sizeof(BPDT_HEADER), ptBodySize); UString name = UString("BPDT partition table"); UString info = usprintf("Full size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\n" "Number of entries: %u\nVersion: %02Xh\nRedundancyFlag: %Xh\n" "IFWI version: %Xh\nFITC version: %u.%u.%u.%u", ptSize, ptSize, (UINT32)header.size(), (UINT32)header.size(), ptBodySize, ptBodySize, ptHeader->NumEntries, ptHeader->HeaderVersion, ptHeader->RedundancyFlag, ptHeader->IfwiVersion, ptHeader->FitcMajor, ptHeader->FitcMinor, ptHeader->FitcHotfix, ptHeader->FitcBuild); // Add tree item index = model->addItem(localOffset, Types::BpdtStore, 0, name, UString(), info, header, body, UByteArray(), Fixed, parent); // Adjust offset UINT32 offset = sizeof(BPDT_HEADER); // Add partition table entries std::vector partitions; const BPDT_ENTRY* firstPtEntry = (const BPDT_ENTRY*)((const UINT8*)ptHeader + sizeof(BPDT_HEADER)); UINT16 numEntries = ptHeader->NumEntries; for (UINT16 i = 0; i < numEntries; i++) { // Populate entry header const BPDT_ENTRY* ptEntry = firstPtEntry + i; // Get info name = bpdtEntryTypeToUString(ptEntry->Type); info = usprintf("Full size: %Xh (%u)\nType: %Xh\nPartition offset: %Xh\nPartition length: %Xh", (UINT32)sizeof(BPDT_ENTRY), (UINT32)sizeof(BPDT_ENTRY), ptEntry->Type, ptEntry->Offset, ptEntry->Size) + UString("\nSplit sub-partition first part: ") + (ptEntry->SplitSubPartitionFirstPart ? "Yes" : "No") + UString("\nSplit sub-partition second part: ") + (ptEntry->SplitSubPartitionSecondPart ? "Yes" : "No") + UString("\nCode sub-partition: ") + (ptEntry->CodeSubPartition ? "Yes" : "No") + UString("\nUMA cachable: ") + (ptEntry->UmaCachable ? "Yes" : "No"); // Add tree item UModelIndex entryIndex = model->addItem(localOffset + offset, Types::BpdtEntry, 0, name, UString(), info, UByteArray(), UByteArray((const char*)ptEntry, sizeof(BPDT_ENTRY)), UByteArray(), Fixed, index); // Adjust offset offset += sizeof(BPDT_ENTRY); if (ptEntry->Offset != 0 && ptEntry->Offset != 0xFFFFFFFF && ptEntry->Size != 0) { // Add to partitions vector BPDT_PARTITION_INFO partition = {}; partition.type = Types::BpdtPartition; partition.ptEntry = *ptEntry; partition.ptEntry.Offset -= sbpdtOffsetFixup; partition.index = entryIndex; partitions.push_back(partition); } } // Check for empty set of partitions if (partitions.empty()) { // Add a single padding partition in this case BPDT_PARTITION_INFO padding = {}; padding.ptEntry.Offset = offset; padding.ptEntry.Size = (UINT32)(region.size() - padding.ptEntry.Offset); padding.type = Types::Padding; partitions.push_back(padding); } make_partition_table_consistent: if (partitions.empty()) { return U_INVALID_ME_PARTITION_TABLE; } // Sort partitions by offset std::sort(partitions.begin(), partitions.end()); // Check for intersections and paddings between partitions BPDT_PARTITION_INFO padding = {}; // Check intersection with the partition table header if (partitions.front().ptEntry.Offset < ptSize) { msg(usprintf("%s: BPDT partition has intersection with BPDT partition table, skipped", __FUNCTION__), partitions.front().index); partitions.erase(partitions.begin()); goto make_partition_table_consistent; } // Check for padding between partition table and the first partition else if (partitions.front().ptEntry.Offset > ptSize) { padding.ptEntry.Offset = ptSize; padding.ptEntry.Size = partitions.front().ptEntry.Offset - padding.ptEntry.Offset; padding.type = Types::Padding; partitions.insert(partitions.begin(), padding); } // Check for intersections/paddings between partitions for (size_t i = 1; i < partitions.size(); i++) { UINT32 previousPartitionEnd = partitions[i - 1].ptEntry.Offset + partitions[i - 1].ptEntry.Size; // Check that partition is fully present in the image if ((UINT64)partitions[i].ptEntry.Offset + (UINT64)partitions[i].ptEntry.Size > regionSize) { if ((UINT64)partitions[i].ptEntry.Offset >= (UINT64)region.size()) { msg(usprintf("%s: BPDT partition is located outside of the opened image, skipped", __FUNCTION__), partitions[i].index); partitions.erase(partitions.begin() + i); goto make_partition_table_consistent; } else { msg(usprintf("%s: BPDT partition can't fit into its region, truncated", __FUNCTION__), partitions[i].index); partitions[i].ptEntry.Size = regionSize - (UINT32)partitions[i].ptEntry.Offset; } } // Check for intersection with previous partition if (partitions[i].ptEntry.Offset < previousPartitionEnd) { // Check if current partition is located inside previous one if (partitions[i].ptEntry.Offset + partitions[i].ptEntry.Size <= previousPartitionEnd) { msg(usprintf("%s: BPDT partition is located inside another BPDT partition, skipped", __FUNCTION__), partitions[i].index); partitions.erase(partitions.begin() + i); goto make_partition_table_consistent; } else { msg(usprintf("%s: BPDT partition intersects with prevous one, skipped", __FUNCTION__), partitions[i].index); partitions.erase(partitions.begin() + i); goto make_partition_table_consistent; } } // Check for padding between current and previous partitions else if (partitions[i].ptEntry.Offset > previousPartitionEnd) { padding.ptEntry.Offset = previousPartitionEnd; padding.ptEntry.Size = partitions[i].ptEntry.Offset - previousPartitionEnd; padding.type = Types::Padding; std::vector::iterator iter = partitions.begin(); std::advance(iter, i); partitions.insert(iter, padding); } } // Partition map is consistent for (size_t i = 0; i < partitions.size(); i++) { if (partitions[i].type == Types::BpdtPartition) { // Get info UString name = bpdtEntryTypeToUString(partitions[i].ptEntry.Type); UByteArray partition = region.mid(partitions[i].ptEntry.Offset, partitions[i].ptEntry.Size); UByteArray signature = partition.left(sizeof(UINT32)); UString info = usprintf("Full size: %Xh (%u)\nType: %Xh", (UINT32)partition.size(), (UINT32)partition.size(), partitions[i].ptEntry.Type) + UString("\nSplit sub-partition first part: ") + (partitions[i].ptEntry.SplitSubPartitionFirstPart ? "Yes" : "No") + UString("\nSplit sub-partition second part: ") + (partitions[i].ptEntry.SplitSubPartitionSecondPart ? "Yes" : "No") + UString("\nCode sub-partition: ") + (partitions[i].ptEntry.CodeSubPartition ? "Yes" : "No") + UString("\nUMA cachable: ") + (partitions[i].ptEntry.UmaCachable ? "Yes" : "No"); UString text = bpdtEntryTypeToUString(partitions[i].ptEntry.Type); // Add tree item UModelIndex partitionIndex = model->addItem(localOffset + partitions[i].ptEntry.Offset, Types::BpdtPartition, 0, name, text, info, UByteArray(), partition, UByteArray(), Fixed, parent); // Special case of S-BPDT if (partitions[i].ptEntry.Type == BPDT_ENTRY_TYPE_S_BPDT) { UModelIndex sbpdtIndex; parseBpdtRegion(partition, 0, partitions[i].ptEntry.Offset, partitionIndex, sbpdtIndex); // Third parameter is a fixup for S-BPDT offset entries, because they are calculated from the start of BIOS region } // Parse code partitions if (readUnaligned((const UINT32*)partition.constData()) == CPD_SIGNATURE) { // Parse code partition contents UModelIndex cpdIndex; parseCpdRegion(partition, 0, partitionIndex, cpdIndex); } // Check for entry type to be known if (partitions[i].ptEntry.Type > BPDT_ENTRY_TYPE_PSEP) { msg(usprintf("%s: BPDT entry of unknown type found", __FUNCTION__), partitionIndex); } } else if (partitions[i].type == Types::Padding) { UByteArray padding = region.mid(partitions[i].ptEntry.Offset, partitions[i].ptEntry.Size); // Get info name = UString("Padding"); info = usprintf("Full size: %Xh (%u)", (UINT32)padding.size(), (UINT32)padding.size()); // Add tree item model->addItem(localOffset + partitions[i].ptEntry.Offset, Types::Padding, getPaddingType(padding), name, UString(), info, UByteArray(), padding, UByteArray(), Fixed, parent); } } // Add padding after the last region if ((UINT64)partitions.back().ptEntry.Offset + (UINT64)partitions.back().ptEntry.Size < regionSize) { UINT64 usedSize = (UINT64)partitions.back().ptEntry.Offset + (UINT64)partitions.back().ptEntry.Size; UByteArray padding = region.mid(partitions.back().ptEntry.Offset + partitions.back().ptEntry.Size, (int)(regionSize - usedSize)); // Get info name = UString("Padding"); info = usprintf("Full size: %Xh (%u)", (UINT32)padding.size(), (UINT32)padding.size()); // Add tree item model->addItem(localOffset + partitions.back().ptEntry.Offset + partitions.back().ptEntry.Size, Types::Padding, getPaddingType(padding), name, UString(), info, UByteArray(), padding, UByteArray(), Fixed, parent); } return U_SUCCESS; } USTATUS FfsParser::parseCpdRegion(const UByteArray & region, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index) { // Check directory size if ((UINT32)region.size() < sizeof(CPD_REV1_HEADER)) { msg(usprintf("%s: CPD too small to fit rev1 partition table header", __FUNCTION__), parent); return U_INVALID_ME_PARTITION_TABLE; } // Populate partition table header const CPD_REV1_HEADER* cpdHeader = (const CPD_REV1_HEADER*)region.constData(); // Check header version to be known UINT32 ptHeaderSize = 0; if (cpdHeader->HeaderVersion == 2) { if ((UINT32)region.size() < sizeof(CPD_REV2_HEADER)) { msg(usprintf("%s: CPD too small to fit rev2 partition table header", __FUNCTION__), parent); return U_INVALID_ME_PARTITION_TABLE; } ptHeaderSize = sizeof(CPD_REV2_HEADER); } else if (cpdHeader->HeaderVersion == 1) { ptHeaderSize = sizeof(CPD_REV1_HEADER); } // Check directory size again UINT32 ptBodySize = cpdHeader->NumEntries * sizeof(CPD_ENTRY); UINT32 ptSize = ptHeaderSize + ptBodySize; if ((UINT32)region.size() < ptSize) { msg(usprintf("%s: CPD too small to fit the whole partition table", __FUNCTION__), parent); return U_INVALID_ME_PARTITION_TABLE; } // Get info UByteArray header = region.left(ptHeaderSize); UByteArray body = region.mid(ptHeaderSize, ptBodySize); UString name = usprintf("CPD partition table"); UString info = usprintf("Full size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\nNumber of entries: %u\n" "Header version: %u\nEntry version: %u", ptSize, ptSize, (UINT32)header.size(), (UINT32)header.size(), (UINT32)body.size(), (UINT32)body.size(), cpdHeader->NumEntries, cpdHeader->HeaderVersion, cpdHeader->EntryVersion); // Add tree item index = model->addItem(localOffset, Types::CpdStore, 0, name, UString(), info, header, body, UByteArray(), Fixed, parent); // Add partition table entries std::vector partitions; UINT32 offset = ptHeaderSize; const CPD_ENTRY* firstCpdEntry = (const CPD_ENTRY*)(body.constData()); for (UINT32 i = 0; i < cpdHeader->NumEntries; i++) { // Populate entry header const CPD_ENTRY* cpdEntry = firstCpdEntry + i; UByteArray entry((const char*)cpdEntry, sizeof(CPD_ENTRY)); // Get info name = usprintf("%.12s", cpdEntry->EntryName); info = usprintf("Full size: %Xh (%u)\nEntry offset: %Xh\nEntry length: %Xh\nHuffman compressed: ", (UINT32)entry.size(), (UINT32)entry.size(), cpdEntry->Offset.Offset, cpdEntry->Length) + (cpdEntry->Offset.HuffmanCompressed ? "Yes" : "No"); // Add tree item UModelIndex entryIndex = model->addItem(offset, Types::CpdEntry, 0, name, UString(), info, UByteArray(), entry, UByteArray(), Fixed, index); // Adjust offset offset += sizeof(CPD_ENTRY); if (cpdEntry->Offset.Offset != 0 && cpdEntry->Length != 0) { // Add to partitions vector CPD_PARTITION_INFO partition; partition.type = Types::CpdPartition; partition.ptEntry = *cpdEntry; partition.index = entryIndex; partition.hasMetaData = false; partitions.push_back(partition); } } // Add padding if there's no partions to add if (partitions.size() == 0) { UByteArray partition = region.mid(ptSize); // Get info name = UString("Padding"); info = usprintf("Full size: %Xh (%u)", (UINT32)partition.size(), (UINT32)partition.size()); // Add tree item model->addItem(localOffset + ptSize, Types::Padding, getPaddingType(partition), name, UString(), info, UByteArray(), partition, UByteArray(), Fixed, parent); return U_SUCCESS; } // Sort partitions by offset std::sort(partitions.begin(), partitions.end()); // Because lenghts for all Huffmann-compressed partitions mean nothing at all, we need to split all partitions into 2 classes: // 1. CPD manifest // 2. Metadata entries UINT32 i = 1; // manifest is index 0, .met partitions start at index 1 while (i < partitions.size()) { name = usprintf("%.12s", partitions[i].ptEntry.EntryName); // Check if the current entry is metadata entry if (!name.endsWith(".met")) { // No need to parse further, all metadata partitions are parsed break; } // Parse into data block, find Module Attributes extension, and get compressed size from there UINT32 offset = 0; UINT32 length = 0xFFFFFFFF; // Special guardian value UByteArray partition = region.mid(partitions[i].ptEntry.Offset.Offset, partitions[i].ptEntry.Length); while (offset < (UINT32)partition.size()) { const CPD_EXTENTION_HEADER* extHeader = (const CPD_EXTENTION_HEADER*) (partition.constData() + offset); if (extHeader->Length <= ((UINT32)partition.size() - offset)) { if (extHeader->Type == CPD_EXT_TYPE_MODULE_ATTRIBUTES) { const CPD_EXT_MODULE_ATTRIBUTES* attrHeader = (const CPD_EXT_MODULE_ATTRIBUTES*)(partition.constData() + offset); length = attrHeader->CompressedSize; } offset += extHeader->Length; } else break; } // Search down for corresponding code partition // Construct its name by removing the .met suffix name.chop(4); // Search bool found = false; UINT32 j = 1; while (j < partitions.size()) { UString namej = usprintf("%.12s", partitions[j].ptEntry.EntryName); if (name == namej) { found = true; // Found it, update its Length if needed if (partitions[j].ptEntry.Offset.HuffmanCompressed) { partitions[j].ptEntry.Length = length; } else if (length != 0xFFFFFFFF && partitions[j].ptEntry.Length != length) { msg(usprintf("%s: partition size mismatch between partition table (%Xh) and partition metadata (%Xh)", __FUNCTION__, partitions[j].ptEntry.Length, length), partitions[j].index); partitions[j].ptEntry.Length = length; // Believe metadata } partitions[j].hasMetaData = true; // No need to search further break; } // Check the next partition j++; } if (!found) { msg(usprintf("%s: no code partition", __FUNCTION__), partitions[i].index); } // Check the next partition i++; } make_partition_table_consistent: if (partitions.empty()) { return U_INVALID_ME_PARTITION_TABLE; } // Sort partitions by offset std::sort(partitions.begin(), partitions.end()); // Check for intersections and paddings between partitions CPD_PARTITION_INFO padding = {}; // Check intersection with the partition table header if (partitions.front().ptEntry.Offset.Offset < ptSize) { msg(usprintf("%s: CPD partition has intersection with CPD partition table, skipped", __FUNCTION__), partitions.front().index); partitions.erase(partitions.begin()); goto make_partition_table_consistent; } // Check for padding between partition table and the first partition else if (partitions.front().ptEntry.Offset.Offset > ptSize) { padding.ptEntry.Offset.Offset = ptSize; padding.ptEntry.Length = partitions.front().ptEntry.Offset.Offset - padding.ptEntry.Offset.Offset; padding.type = Types::Padding; partitions.insert(partitions.begin(), padding); } // Check for intersections/paddings between partitions for (size_t i = 1; i < partitions.size(); i++) { UINT32 previousPartitionEnd = partitions[i - 1].ptEntry.Offset.Offset + partitions[i - 1].ptEntry.Length; // Check that current region is fully present in the image if ((UINT64)partitions[i].ptEntry.Offset.Offset + (UINT64)partitions[i].ptEntry.Length > (UINT64)region.size()) { if ((UINT64)partitions[i].ptEntry.Offset.Offset >= (UINT64)region.size()) { msg(usprintf("%s: CPD partition is located outside of the opened image, skipped", __FUNCTION__), partitions[i].index); partitions.erase(partitions.begin() + i); goto make_partition_table_consistent; } else { if (!partitions[i].hasMetaData && partitions[i].ptEntry.Offset.HuffmanCompressed) { msg(usprintf("%s: CPD partition is compressed but doesn't have metadata and can't fit into its region, length adjusted", __FUNCTION__), partitions[i].index); } else { msg(usprintf("%s: CPD partition can't fit into its region, truncated", __FUNCTION__), partitions[i].index); } partitions[i].ptEntry.Length = (UINT32)region.size() - (UINT32)partitions[i].ptEntry.Offset.Offset; } } // Check for intersection with previous partition if (partitions[i].ptEntry.Offset.Offset < previousPartitionEnd) { // Check if previous partition was compressed but did not have metadata if (!partitions[i - 1].hasMetaData && partitions[i - 1].ptEntry.Offset.HuffmanCompressed) { msg(usprintf("%s: CPD partition is compressed but doesn't have metadata, length adjusted", __FUNCTION__), partitions[i - 1].index); partitions[i - 1].ptEntry.Length = (UINT32)partitions[i].ptEntry.Offset.Offset - (UINT32)partitions[i - 1].ptEntry.Offset.Offset; goto make_partition_table_consistent; } // Check if current partition is located inside previous one if (partitions[i].ptEntry.Offset.Offset + partitions[i].ptEntry.Length <= previousPartitionEnd) { msg(usprintf("%s: CPD partition is located inside another CPD partition, skipped", __FUNCTION__), partitions[i].index); partitions.erase(partitions.begin() + i); goto make_partition_table_consistent; } else { msg(usprintf("%s: CPD partition intersects with previous one, skipped", __FUNCTION__), partitions[i].index); partitions.erase(partitions.begin() + i); goto make_partition_table_consistent; } } // Check for padding between current and previous partitions else if (partitions[i].ptEntry.Offset.Offset > previousPartitionEnd) { padding.ptEntry.Offset.Offset = previousPartitionEnd; padding.ptEntry.Length = partitions[i].ptEntry.Offset.Offset - previousPartitionEnd; padding.type = Types::Padding; std::vector::iterator iter = partitions.begin(); std::advance(iter, i); partitions.insert(iter, padding); } } // Check for padding after the last region if ((UINT64)partitions.back().ptEntry.Offset.Offset + (UINT64)partitions.back().ptEntry.Length < (UINT64)region.size()) { padding.ptEntry.Offset.Offset = partitions.back().ptEntry.Offset.Offset + partitions.back().ptEntry.Length; padding.ptEntry.Length = (UINT32)region.size() - padding.ptEntry.Offset.Offset; padding.type = Types::Padding; partitions.push_back(padding); } // Partition map is consistent for (size_t i = 0; i < partitions.size(); i++) { if (partitions[i].type == Types::CpdPartition) { UByteArray partition = region.mid(partitions[i].ptEntry.Offset.Offset, partitions[i].ptEntry.Length); // Get info name = usprintf("%.12s", partitions[i].ptEntry.EntryName); // It's a manifest if (name.endsWith(".man")) { if (!partitions[i].ptEntry.Offset.HuffmanCompressed && partitions[i].ptEntry.Length >= sizeof(CPD_MANIFEST_HEADER)) { const CPD_MANIFEST_HEADER* manifestHeader = (const CPD_MANIFEST_HEADER*) partition.constData(); if (manifestHeader->HeaderId == ME_MANIFEST_HEADER_ID) { UByteArray header = partition.left(manifestHeader->HeaderLength * sizeof(UINT32)); UByteArray body = partition.mid(manifestHeader->HeaderLength * sizeof(UINT32)); info = usprintf("Full size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)" "\nHeader type: %u\nHeader length: %Xh (%u)\nHeader version: %Xh\nFlags: %08Xh\nVendor: %Xh\n" "Date: %Xh\nSize: %Xh (%u)\nVersion: %u.%u.%u.%u\nSecurity version number: %u\nModulus size: %Xh (%u)\nExponent size: %Xh (%u)", (UINT32)partition.size(), (UINT32)partition.size(), (UINT32)header.size(), (UINT32)header.size(), (UINT32)body.size(), (UINT32)body.size(), manifestHeader->HeaderType, manifestHeader->HeaderLength * (UINT32)sizeof(UINT32), manifestHeader->HeaderLength * (UINT32)sizeof(UINT32), manifestHeader->HeaderVersion, manifestHeader->Flags, manifestHeader->Vendor, manifestHeader->Date, manifestHeader->Size * (UINT32)sizeof(UINT32), manifestHeader->Size * (UINT32)sizeof(UINT32), manifestHeader->VersionMajor, manifestHeader->VersionMinor, manifestHeader->VersionBugfix, manifestHeader->VersionBuild, manifestHeader->SecurityVersion, manifestHeader->ModulusSize * (UINT32)sizeof(UINT32), manifestHeader->ModulusSize * (UINT32)sizeof(UINT32), manifestHeader->ExponentSize * (UINT32)sizeof(UINT32), manifestHeader->ExponentSize * (UINT32)sizeof(UINT32)); // Add tree item UModelIndex partitionIndex = model->addItem(localOffset + partitions[i].ptEntry.Offset.Offset, Types::CpdPartition, Subtypes::ManifestCpdPartition, name, UString(), info, header, body, UByteArray(), Fixed, parent); // Parse data as extensions area parseCpdExtensionsArea(partitionIndex); } } } // It's a metadata else if (name.endsWith(".met")) { info = usprintf("Full size: %Xh (%u)\nHuffman compressed: ", (UINT32)partition.size(), (UINT32)partition.size()) + (partitions[i].ptEntry.Offset.HuffmanCompressed ? "Yes" : "No"); // Calculate SHA256 hash over the metadata and add it to its info UByteArray hash(SHA256_HASH_SIZE, '\x00'); sha256(partition.constData(), partition.size(), hash.data()); info += UString("\nMetadata hash: ") + UString(hash.toHex().constData()); // Add three item UModelIndex partitionIndex = model->addItem(localOffset + partitions[i].ptEntry.Offset.Offset, Types::CpdPartition, Subtypes::MetadataCpdPartition, name, UString(), info, UByteArray(), partition, UByteArray(), Fixed, parent); // Parse data as extensions area parseCpdExtensionsArea(partitionIndex); } // It's a code else { info = usprintf("Full size: %Xh (%u)\nHuffman compressed: ", (UINT32)partition.size(), (UINT32)partition.size()) + (partitions[i].ptEntry.Offset.HuffmanCompressed ? "Yes" : "No"); // Calculate SHA256 hash over the code and add it to its info UByteArray hash(SHA256_HASH_SIZE, '\x00'); sha256(partition.constData(), partition.size(), hash.data()); info += UString("\nHash: ") + UString(hash.toHex().constData()); UModelIndex codeIndex = model->addItem(localOffset + partitions[i].ptEntry.Offset.Offset, Types::CpdPartition, Subtypes::CodeCpdPartition, name, UString(), info, UByteArray(), partition, UByteArray(), Fixed, parent); (void)parseRawArea(codeIndex); } } else if (partitions[i].type == Types::Padding) { UByteArray partition = region.mid(partitions[i].ptEntry.Offset.Offset, partitions[i].ptEntry.Length); // Get info name = UString("Padding"); info = usprintf("Full size: %Xh (%u)", (UINT32)partition.size(), (UINT32)partition.size()); // Add tree item model->addItem(localOffset + partitions[i].ptEntry.Offset.Offset, Types::Padding, getPaddingType(partition), name, UString(), info, UByteArray(), partition, UByteArray(), Fixed, parent); } else { msg(usprintf("%s: CPD partition of unknown type found", __FUNCTION__), parent); return U_INVALID_ME_PARTITION_TABLE; } } return U_SUCCESS; } USTATUS FfsParser::parseCpdExtensionsArea(const UModelIndex & index) { if (!index.isValid()) { return U_INVALID_PARAMETER; } UByteArray body = model->body(index); UINT32 offset = 0; while (offset < (UINT32)body.size()) { const CPD_EXTENTION_HEADER* extHeader = (const CPD_EXTENTION_HEADER*) (body.constData() + offset); if (extHeader->Length > 0 && extHeader->Length <= ((UINT32)body.size() - offset)) { UByteArray partition = body.mid(offset, extHeader->Length); UString name = cpdExtensionTypeToUstring(extHeader->Type); UString info = usprintf("Full size: %Xh (%u)\nType: %Xh", (UINT32)partition.size(), (UINT32)partition.size(), extHeader->Type); // Parse Signed Package Info a bit further UModelIndex extIndex; if (extHeader->Type == CPD_EXT_TYPE_SIGNED_PACKAGE_INFO) { UByteArray header = partition.left(sizeof(CPD_EXT_SIGNED_PACKAGE_INFO)); UByteArray data = partition.mid(header.size()); const CPD_EXT_SIGNED_PACKAGE_INFO* infoHeader = (const CPD_EXT_SIGNED_PACKAGE_INFO*)header.constData(); info = usprintf("Full size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\nType: %Xh\n" "Package name: %.4s\nVersion control number: %Xh\nSecurity version number: %Xh\n" "Usage bitmap: %02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X%02X", (UINT32)partition.size(), (UINT32)partition.size(), (UINT32)header.size(), (UINT32)header.size(), (UINT32)body.size(), (UINT32)body.size(), infoHeader->ExtensionType, infoHeader->PackageName, infoHeader->Vcn, infoHeader->Svn, infoHeader->UsageBitmap[0], infoHeader->UsageBitmap[1], infoHeader->UsageBitmap[2], infoHeader->UsageBitmap[3], infoHeader->UsageBitmap[4], infoHeader->UsageBitmap[5], infoHeader->UsageBitmap[6], infoHeader->UsageBitmap[7], infoHeader->UsageBitmap[8], infoHeader->UsageBitmap[9], infoHeader->UsageBitmap[10], infoHeader->UsageBitmap[11], infoHeader->UsageBitmap[12], infoHeader->UsageBitmap[13], infoHeader->UsageBitmap[14], infoHeader->UsageBitmap[15]); // Add tree item extIndex = model->addItem(offset, Types::CpdExtension, 0, name, UString(), info, header, data, UByteArray(), Fixed, index); parseSignedPackageInfoData(extIndex); } // Parse IFWI Partition Manifest a bit further else if (extHeader->Type == CPD_EXT_TYPE_IFWI_PARTITION_MANIFEST) { const CPD_EXT_IFWI_PARTITION_MANIFEST* attrHeader = (const CPD_EXT_IFWI_PARTITION_MANIFEST*)partition.constData(); // Check HashSize to be sane. UINT32 hashSize = attrHeader->HashSize; bool msgHashSizeMismatch = false; if (hashSize > sizeof(attrHeader->CompletePartitionHash)) { hashSize = sizeof(attrHeader->CompletePartitionHash); msgHashSizeMismatch = true; } // This hash is stored reversed // Need to reverse it back to normal UByteArray hash((const char*)&attrHeader->CompletePartitionHash, hashSize); std::reverse(hash.begin(), hash.end()); info = usprintf("Full size: %Xh (%u)\nType: %Xh\n" "Partition name: %.4s\nPartition length: %Xh\nPartition version major: %Xh\nPartition version minor: %Xh\n" "Data format version: %Xh\nInstance ID: %Xh\nHash algorithm: %Xh\nHash size: %Xh\nAction on update: %Xh", (UINT32)partition.size(), (UINT32)partition.size(), attrHeader->ExtensionType, attrHeader->PartitionName, attrHeader->CompletePartitionLength, attrHeader->PartitionVersionMajor, attrHeader->PartitionVersionMinor, attrHeader->DataFormatVersion, attrHeader->InstanceId, attrHeader->HashAlgorithm, attrHeader->HashSize, attrHeader->ActionOnUpdate) + UString("\nSupport multiple instances: ") + (attrHeader->SupportMultipleInstances ? "Yes" : "No") + UString("\nSupport API version based update: ") + (attrHeader->SupportApiVersionBasedUpdate ? "Yes" : "No") + UString("\nObey full update rules: ") + (attrHeader->ObeyFullUpdateRules ? "Yes" : "No") + UString("\nIFR enable only: ") + (attrHeader->IfrEnableOnly ? "Yes" : "No") + UString("\nAllow cross point update: ") + (attrHeader->AllowCrossPointUpdate ? "Yes" : "No") + UString("\nAllow cross hotfix update: ") + (attrHeader->AllowCrossHotfixUpdate ? "Yes" : "No") + UString("\nPartial update only: ") + (attrHeader->PartialUpdateOnly ? "Yes" : "No") + UString("\nPartition hash: ") + UString(hash.toHex().constData()); // Add tree item extIndex = model->addItem(offset, Types::CpdExtension, 0, name, UString(), info, UByteArray(), partition, UByteArray(), Fixed, index); if (msgHashSizeMismatch) { msg(usprintf("%s: IFWI Partition Manifest hash size is %u, maximum allowed is %u, truncated", __FUNCTION__, attrHeader->HashSize, (UINT32)sizeof(attrHeader->CompletePartitionHash)), extIndex); } } // Parse Module Attributes a bit further else if (extHeader->Type == CPD_EXT_TYPE_MODULE_ATTRIBUTES) { const CPD_EXT_MODULE_ATTRIBUTES* attrHeader = (const CPD_EXT_MODULE_ATTRIBUTES*)partition.constData(); int hashSize = (UINT32)partition.size() - CpdExtModuleImageHashOffset; // This hash is stored reversed // Need to reverse it back to normal UByteArray hash((const char*)attrHeader + CpdExtModuleImageHashOffset, hashSize); std::reverse(hash.begin(), hash.end()); info = usprintf("Full size: %Xh (%u)\nType: %Xh\n" "Compression type: %Xh\nUncompressed size: %Xh (%u)\nCompressed size: %Xh (%u)\nGlobal module ID: %Xh\nImage hash: ", (UINT32)partition.size(), (UINT32)partition.size(), attrHeader->ExtensionType, attrHeader->CompressionType, attrHeader->UncompressedSize, attrHeader->UncompressedSize, attrHeader->CompressedSize, attrHeader->CompressedSize, attrHeader->GlobalModuleId) + UString(hash.toHex().constData()); // Add tree item extIndex = model->addItem(offset, Types::CpdExtension, 0, name, UString(), info, UByteArray(), partition, UByteArray(), Fixed, index); } // Parse everything else else { // Add tree item, if needed extIndex = model->addItem(offset, Types::CpdExtension, 0, name, UString(), info, UByteArray(), partition, UByteArray(), Fixed, index); } // There needs to be a more generic way to do it, but it is fine for now if (extHeader->Type > CPD_EXT_TYPE_TBT_METADATA && extHeader->Type != CPD_EXT_TYPE_GMF_CERTIFICATE && extHeader->Type != CPD_EXT_TYPE_GMF_BODY && extHeader->Type != CPD_EXT_TYPE_KEY_MANIFEST_EXT && extHeader->Type != CPD_EXT_TYPE_SIGNED_PACKAGE_INFO_EXT && extHeader->Type != CPD_EXT_TYPE_SPS_PLATFORM_ID) { msg(usprintf("%s: CPD extention of unknown type found", __FUNCTION__), extIndex); } offset += extHeader->Length; } else break; // TODO: add padding at the end } return U_SUCCESS; } USTATUS FfsParser::parseSignedPackageInfoData(const UModelIndex & index) { if (!index.isValid()) { return U_INVALID_PARAMETER; } UByteArray body = model->body(index); UINT32 offset = 0; while (offset < (UINT32)body.size()) { const CPD_EXT_SIGNED_PACKAGE_INFO_MODULE* moduleHeader = (const CPD_EXT_SIGNED_PACKAGE_INFO_MODULE*)(body.constData() + offset); if (sizeof(CPD_EXT_SIGNED_PACKAGE_INFO_MODULE) <= ((UINT32)body.size() - offset)) { // TODO: check sanity of moduleHeader->HashSize UByteArray module((const char*)moduleHeader, CpdExtSignedPkgMetadataHashOffset + moduleHeader->HashSize); UString name = usprintf("%.12s", moduleHeader->Name); // This hash is stored reversed // Need to reverse it back to normal UByteArray hash((const char*)moduleHeader + CpdExtSignedPkgMetadataHashOffset, moduleHeader->HashSize); std::reverse(hash.begin(), hash.end()); UString info = usprintf("Full size: %Xh (%u)\nType: %Xh\nHash algorithm: %Xh\nHash size: %Xh (%u)\nMetadata size: %Xh (%u)\nMetadata hash: ", (UINT32)module.size(), (UINT32)module.size(), moduleHeader->Type, moduleHeader->HashAlgorithm, moduleHeader->HashSize, moduleHeader->HashSize, moduleHeader->MetadataSize, moduleHeader->MetadataSize) + UString(hash.toHex().constData()); // Add tree otem model->addItem(offset, Types::CpdSpiEntry, 0, name, UString(), info, UByteArray(), module, UByteArray(), Fixed, index); offset += module.size(); } else break; // TODO: add padding at the end } return U_SUCCESS; } void FfsParser::outputInfo(void) { // Show ffsParser's messages std::vector > messages = getMessages(); for (size_t i = 0; i < messages.size(); i++) { std::cout << (const char *)messages[i].first.toLocal8Bit() << std::endl; } // Get last VTF std::vector, UModelIndex > > fitTable = getFitTable(); if (fitTable.size()) { std::cout << "---------------------------------------------------------------------------" << std::endl; std::cout << " Address | Size | Ver | CS | Type / Info " << std::endl; std::cout << "---------------------------------------------------------------------------" << std::endl; for (size_t i = 0; i < fitTable.size(); i++) { std::cout << (const char *)fitTable[i].first[0].toLocal8Bit() << " | " << (const char *)fitTable[i].first[1].toLocal8Bit() << " | " << (const char *)fitTable[i].first[2].toLocal8Bit() << " | " << (const char *)fitTable[i].first[3].toLocal8Bit() << " | " << (const char *)fitTable[i].first[4].toLocal8Bit() << " | " << (const char *)fitTable[i].first[5].toLocal8Bit() << std::endl; } } // Get security info UString secInfo = getSecurityInfo(); if (!secInfo.isEmpty()) { std::cout << "---------------------------------------------------------------------------" << std::endl; std::cout << "Security Info" << std::endl; std::cout << "---------------------------------------------------------------------------" << std::endl; std::cout << (const char *)secInfo.toLocal8Bit() << std::endl; } } UEFITool-A66/common/ffsparser.h000066400000000000000000000224531442134156300164430ustar00rootroot00000000000000/* ffsparser.h Copyright (c) 2017, LongSoft. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHWARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef FFSPARSER_H #define FFSPARSER_H #include #include "basetypes.h" #include "ustring.h" #include "ubytearray.h" #include "treemodel.h" #include "intel_microcode.h" #include "ffs.h" #include "fitparser.h" // Region info typedef struct REGION_INFO_ { UINT32 offset = 0; UINT32 length = 0; UINT8 type = 0; UByteArray data; friend bool operator< (const struct REGION_INFO_ & lhs, const struct REGION_INFO_ & rhs) { return lhs.offset < rhs.offset; } } REGION_INFO; // BPDT partition info typedef struct BPDT_PARTITION_INFO_ { BPDT_ENTRY ptEntry = {}; UINT8 type = 0; UModelIndex index; friend bool operator< (const struct BPDT_PARTITION_INFO_ & lhs, const struct BPDT_PARTITION_INFO_ & rhs) { return lhs.ptEntry.Offset < rhs.ptEntry.Offset; } } BPDT_PARTITION_INFO; // CPD partition info typedef struct CPD_PARTITION_INFO_ { CPD_ENTRY ptEntry = {}; UINT8 type = 0; bool hasMetaData = false; UModelIndex index; friend bool operator< (const struct CPD_PARTITION_INFO_ & lhs, const struct CPD_PARTITION_INFO_ & rhs) { return lhs.ptEntry.Offset.Offset < rhs.ptEntry.Offset.Offset; } } CPD_PARTITION_INFO; // Protected range typedef struct PROTECTED_RANGE_ { UINT32 Offset; UINT32 Size; UINT16 AlgorithmId; UINT8 Type; UINT8 : 8; UByteArray Hash; } PROTECTED_RANGE; #define PROTECTED_RANGE_INTEL_BOOT_GUARD_IBB 0x01 #define PROTECTED_RANGE_INTEL_BOOT_GUARD_POST_IBB 0x02 #define PROTECTED_RANGE_INTEL_BOOT_GUARD_OBB 0x03 #define PROTECTED_RANGE_VENDOR_HASH_PHOENIX 0x04 #define PROTECTED_RANGE_VENDOR_HASH_AMI_V1 0x05 #define PROTECTED_RANGE_VENDOR_HASH_AMI_V2 0x06 #define PROTECTED_RANGE_VENDOR_HASH_AMI_V3 0x07 #define PROTECTED_RANGE_VENDOR_HASH_MICROSOFT_PMDA 0x08 class FitParser; class NvramParser; class MeParser; class FfsParser { public: // Constructor and destructor FfsParser(TreeModel* treeModel); ~FfsParser(); // Obtain parser messages std::vector > getMessages() const; // Clear messages void clearMessages() { messagesVector.clear(); } // Parse firmware image USTATUS parse(const UByteArray &buffer); // Obtain parsed FIT table std::vector, UModelIndex> > getFitTable() const; // Obtain Security Info UString getSecurityInfo() const; // Obtain offset/address difference UINT64 getAddressDiff() { return addressDiff; } // Output some info to stdout void outputInfo(void); private: TreeModel *model; std::vector > messagesVector; void msg(const UString & message, const UModelIndex & index = UModelIndex()) { messagesVector.push_back(std::pair(message, index)); }; FitParser* fitParser; NvramParser* nvramParser; MeParser* meParser; UByteArray openedImage; UModelIndex lastVtf; UINT32 imageBase; UINT64 addressDiff; UString securityInfo; std::vector protectedRanges; UINT64 protectedRegionsBase; UModelIndex dxeCore; // First pass USTATUS performFirstPass(const UByteArray & imageFile, UModelIndex & index); USTATUS parseCapsule(const UByteArray & capsule, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index); USTATUS parseIntelImage(const UByteArray & intelImage, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index); USTATUS parseGenericImage(const UByteArray & intelImage, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index); USTATUS parseBpdtRegion(const UByteArray & region, const UINT32 localOffset, const UINT32 sbpdtOffsetFixup, const UModelIndex & parent, UModelIndex & index); USTATUS parseCpdRegion(const UByteArray & region, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index); USTATUS parseCpdExtensionsArea(const UModelIndex & index); USTATUS parseSignedPackageInfoData(const UModelIndex & index); USTATUS parseRawArea(const UModelIndex & index); USTATUS parseVolumeHeader(const UByteArray & volume, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index); USTATUS parseVolumeBody(const UModelIndex & index); USTATUS parseMicrocodeVolumeBody(const UModelIndex & index); USTATUS parseFileHeader(const UByteArray & file, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index); USTATUS parseFileBody(const UModelIndex & index); USTATUS parseSectionHeader(const UByteArray & section, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index, const bool insertIntoTree); USTATUS parseSectionBody(const UModelIndex & index); USTATUS parseGbeRegion(const UByteArray & gbe, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index); USTATUS parseMeRegion(const UByteArray & me, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index); USTATUS parseBiosRegion(const UByteArray & bios, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index); USTATUS parsePdrRegion(const UByteArray & pdr, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index); USTATUS parseDevExp1Region(const UByteArray & devExp1, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index); USTATUS parseGenericRegion(const UINT8 subtype, const UByteArray & region, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index); USTATUS parsePadFileBody(const UModelIndex & index); USTATUS parseVolumeNonUefiData(const UByteArray & data, const UINT32 localOffset, const UModelIndex & index); USTATUS parseSections(const UByteArray & sections, const UModelIndex & index, const bool insertIntoTree); USTATUS parseCommonSectionHeader(const UByteArray & section, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index, const bool insertIntoTree); USTATUS parseCompressedSectionHeader(const UByteArray & section, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index, const bool insertIntoTree); USTATUS parseGuidedSectionHeader(const UByteArray & section, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index, const bool insertIntoTree); USTATUS parseFreeformGuidedSectionHeader(const UByteArray & section, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index, const bool insertIntoTree); USTATUS parseVersionSectionHeader(const UByteArray & section, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index, const bool insertIntoTree); USTATUS parsePostcodeSectionHeader(const UByteArray & section, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index, const bool insertIntoTree); USTATUS parseCompressedSectionBody(const UModelIndex & index); USTATUS parseGuidedSectionBody(const UModelIndex & index); USTATUS parseVersionSectionBody(const UModelIndex & index); USTATUS parseDepexSectionBody(const UModelIndex & index); USTATUS parseUiSectionBody(const UModelIndex & index); USTATUS parseRawSectionBody(const UModelIndex & index); USTATUS parsePeImageSectionBody(const UModelIndex & index); USTATUS parseTeImageSectionBody(const UModelIndex & index); USTATUS parseAprioriRawSection(const UByteArray & body, UString & parsed); USTATUS findNextRawAreaItem(const UModelIndex & index, const UINT32 localOffset, UINT8 & nextItemType, UINT32 & nextItemOffset, UINT32 & nextItemSize, UINT32 & nextItemAlternativeSize); UINT32 getFileSize(const UByteArray & volume, const UINT32 fileOffset, const UINT8 ffsVersion, const UINT8 revision); UINT32 getSectionSize(const UByteArray & file, const UINT32 sectionOffset, const UINT8 ffsVersion); USTATUS parseIntelMicrocodeHeader(const UByteArray & store, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index); bool microcodeHeaderValid(const INTEL_MICROCODE_HEADER* ucodeHeader); USTATUS parseVendorHashFile(const UByteArray & fileGuid, const UModelIndex & index); // Second pass USTATUS performSecondPass(const UModelIndex & index); USTATUS addInfoRecursive(const UModelIndex & index); USTATUS checkTeImageBase(const UModelIndex & index); USTATUS checkProtectedRanges(const UModelIndex & index); USTATUS markProtectedRangeRecursive(const UModelIndex & index, const PROTECTED_RANGE & range); USTATUS parseResetVectorData(); #ifdef U_ENABLE_FIT_PARSING_SUPPORT friend class FitParser; // Make FFS parsing routines accessible to FitParser #endif #ifdef U_ENABLE_NVRAM_PARSING_SUPPORT friend class NvramParser; // Make FFS parsing routines accessible to NvramParser #endif #ifdef U_ENABLE_ME_PARSING_SUPPORT friend class MeParser; // Make FFS parsing routines accessible to MeParser #endif }; #endif // FFSPARSER_H UEFITool-A66/common/ffsreport.cpp000066400000000000000000000054021442134156300170100ustar00rootroot00000000000000/* fssreport.cpp Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "ffsreport.h" #include "ffs.h" #include "utility.h" std::vector FfsReport::generate() { std::vector report; // Check model pointer if (!model) { report.push_back(usprintf("%s: invalid model pointer provided", __FUNCTION__)); return report; } // Check root index to be valid UModelIndex root = model->index(0,0); if (!root.isValid()) { report.push_back(usprintf("%s: model root index is invalid", __FUNCTION__)); return report; } // Generate report recursive report.push_back(UString(" Type | Subtype | Base | Size | CRC32 | Name ")); USTATUS result = generateRecursive(report, root); if (result) { report.push_back(usprintf("%s: generateRecursive returned ", __FUNCTION__) + errorCodeToUString(result)); } return report; } USTATUS FfsReport::generateRecursive(std::vector & report, const UModelIndex & index, const UINT32 level) { if (!index.isValid()) return U_SUCCESS; // Nothing to report for invalid index // Calculate item CRC32 UByteArray data = model->header(index) + model->body(index) + model->tail(index); UINT32 crc = (UINT32)crc32(0, (const UINT8*)data.constData(), (uInt)data.size()); // Information on current item UString text = model->text(index); UString offset = "| N/A "; if ((!model->compressed(index)) || (index.parent().isValid() && !model->compressed(index.parent()))) { offset = usprintf("| %08X ", model->base(index)); } report.push_back( UString(" ") + itemTypeToUString(model->type(index)).leftJustified(16) + UString("| ") + itemSubtypeToUString(model->type(index), model->subtype(index)).leftJustified(22) + offset + usprintf("| %08X | %08X | ", (UINT32)data.size(), crc) + urepeated('-', level) + UString(" ") + model->name(index) + (text.isEmpty() ? UString() : UString(" | ") + text) ); // Information on child items for (int i = 0; i < model->rowCount(index); i++) { generateRecursive(report, index.model()->index(i,0,index), level + 1); } return U_SUCCESS; } UEFITool-A66/common/ffsreport.h000066400000000000000000000016761442134156300164660ustar00rootroot00000000000000/* fssreport.h Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef FFSREPORT_H #define FFSREPORT_H #include #include "basetypes.h" #include "ubytearray.h" #include "ustring.h" #include "treemodel.h" class FfsReport { public: FfsReport(TreeModel * treeModel) : model(treeModel) {} ~FfsReport() {}; std::vector generate(); private: TreeModel* model; USTATUS generateRecursive(std::vector & report, const UModelIndex & index, const UINT32 level = 0); }; #endif // FFSREPORT_H UEFITool-A66/common/filesystem.h000066400000000000000000000053261442134156300166340ustar00rootroot00000000000000/* filesystem.h Copyright (c) 2015, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef FILESYSTEM_H #define FILESYSTEM_H #include "basetypes.h" #include "ustring.h" #include "ubytearray.h" #include #include #if defined(_WIN32) || defined(__MINGW32__) #include #include static inline bool isExistOnFs(const UString & path) { struct _stat buf; return (_stat(path.toLocal8Bit(), &buf) == 0); } static inline bool makeDirectory(const UString & dir) { return (_mkdir(dir.toLocal8Bit()) == 0); } static inline bool changeDirectory(const UString & dir) { return (_chdir(dir.toLocal8Bit()) == 0); } static inline void removeDirectory(const UString & dir) { int r = _rmdir(dir.toLocal8Bit()); // Hack: unlike *nix, Windows does not permit deleting current directories. if (r < 0 && errno == EACCES && changeDirectory(dir + UString("/../"))) { _rmdir(dir.toLocal8Bit()); } } static inline UString getAbsPath(const UString & path) { char abs[_MAX_PATH] = {}; if (_fullpath(abs, path.toLocal8Bit(), sizeof(abs))) return UString(abs); return path; } #else #include #include static inline bool isExistOnFs(const UString & path) { struct stat buf; return (stat(path.toLocal8Bit(), &buf) == 0); } static inline bool makeDirectory(const UString & dir) { return (mkdir(dir.toLocal8Bit(), ACCESSPERMS) == 0); } static inline void removeDirectory(const UString & dir) { rmdir(dir.toLocal8Bit()); } static inline bool changeDirectory(const UString & dir) { return (chdir(dir.toLocal8Bit()) == 0); } static inline UString getAbsPath(const UString & path) { char abs[PATH_MAX] = {}; // Last is a non-standard extension for non-existent files. if (realpath(path.toLocal8Bit(), abs) || abs[0] != '\0') return UString(abs); return path; } #endif static inline USTATUS readFileIntoBuffer(const UString & inPath, UByteArray &buf) { if (!isExistOnFs(inPath)) return U_FILE_OPEN; std::ifstream inputFile(inPath.toLocal8Bit(), std::ios::in | std::ios::binary); if (!inputFile) return U_FILE_OPEN; std::vector buffer(std::istreambuf_iterator(inputFile), (std::istreambuf_iterator())); inputFile.close(); buf = buffer; return U_SUCCESS; } #endif UEFITool-A66/common/fitparser.cpp000066400000000000000000001607771442134156300170160ustar00rootroot00000000000000/* fitparser.cpp Copyright (c) 2022, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "fitparser.h" #ifdef U_ENABLE_FIT_PARSING_SUPPORT #include "intel_fit.h" #include "ffs.h" #include "parsingdata.h" #include "types.h" #include "utility.h" #include "digest/sha2.h" #include "umemstream.h" #include "kaitai/kaitaistream.h" #include "generated/intel_acbp_v1.h" #include "generated/intel_acbp_v2.h" #include "generated/intel_keym_v1.h" #include "generated/intel_keym_v2.h" #include "generated/intel_acm.h" USTATUS FitParser::parseFit(const UModelIndex & index) { // Reset parser state fitTable.clear(); securityInfo = ""; bgAcmFound = false; bgKeyManifestFound = false; bgBootPolicyFound = false; bgKmHash = UByteArray(); bgBpHashSha256 = UByteArray(); bgBpHashSha384 = UByteArray(); // Check sanity if (!index.isValid()) { return U_INVALID_PARAMETER; } // Search for FIT UModelIndex fitIndex; UINT32 fitOffset; findFitRecursive(index, fitIndex, fitOffset); // FIT not found if (!fitIndex.isValid()) { // Nothing to parse further return U_SUCCESS; } // Explicitly set the item containing FIT as fixed model->setFixed(fitIndex, true); // Special case of FIT header UByteArray fitBody = model->body(fitIndex); // This is safe, as we checked the size in findFitRecursive already const INTEL_FIT_ENTRY* fitHeader = (const INTEL_FIT_ENTRY*)(fitBody.constData() + fitOffset); // Sanity check UINT32 fitSize = fitHeader->Size * sizeof(INTEL_FIT_ENTRY); if ((UINT32)fitBody.size() - fitOffset < fitSize) { msg(usprintf("%s: not enough space to contain the whole FIT table", __FUNCTION__), fitIndex); return U_INVALID_FIT; } // Check FIT checksum, if present if (fitHeader->ChecksumValid) { // Calculate FIT entry checksum UByteArray tempFIT = model->body(fitIndex).mid(fitOffset, fitSize); INTEL_FIT_ENTRY* tempFitHeader = (INTEL_FIT_ENTRY*)tempFIT.data(); tempFitHeader->Checksum = 0; UINT8 calculated = calculateChecksum8((const UINT8*)tempFitHeader, fitSize); if (calculated != fitHeader->Checksum) { msg(usprintf("%s: invalid FIT table checksum %02Xh, should be %02Xh", __FUNCTION__, fitHeader->Checksum, calculated), fitIndex); } } // Check fit header type if (fitHeader->Type != INTEL_FIT_TYPE_HEADER) { msg(usprintf("%s: invalid FIT header type", __FUNCTION__), fitIndex); return U_INVALID_FIT; } // Add FIT header std::vector currentStrings; currentStrings.push_back(UString("_FIT_ ")); currentStrings.push_back(usprintf("%08Xh", fitSize)); currentStrings.push_back(usprintf("%04Xh", fitHeader->Version)); currentStrings.push_back(usprintf("%02Xh", fitHeader->Checksum)); currentStrings.push_back(fitEntryTypeToUString(fitHeader->Type)); currentStrings.push_back(UString()); // Empty info for FIT header fitTable.push_back(std::pair, UModelIndex>(currentStrings, fitIndex)); // Process all other entries UModelIndex acmIndex; UModelIndex kmIndex; UModelIndex bpIndex; for (UINT32 i = 1; i < fitHeader->Size; i++) { currentStrings.clear(); UString info; UModelIndex itemIndex; const INTEL_FIT_ENTRY* currentEntry = fitHeader + i; UINT32 currentEntrySize = currentEntry->Size; // Check sanity if (currentEntry->Type == INTEL_FIT_TYPE_HEADER) { msg(usprintf("%s: second FIT header found, the table is damaged", __FUNCTION__), fitIndex); return U_INVALID_FIT; } // Special case of version 0 entries for TXT and TPM policies if ((currentEntry->Type == INTEL_FIT_TYPE_TXT_POLICY || currentEntry->Type == INTEL_FIT_TYPE_TPM_POLICY) && currentEntry->Version == 0) { const INTEL_FIT_INDEX_IO_ADDRESS* policy = (const INTEL_FIT_INDEX_IO_ADDRESS*)currentEntry; info += usprintf("Index: %04Xh, BitPosition: %02Xh, AccessWidth: %02Xh, DataRegAddr: %04Xh, IndexRegAddr: %04Xh", policy->Index, policy->BitPosition, policy->AccessWidthInBytes, policy->DataRegisterAddress, policy->IndexRegisterAddress); } else if (currentEntry->Address > ffsParser->addressDiff && currentEntry->Address < 0xFFFFFFFFUL) { // Only elements in the image need to be parsed UINT32 currentEntryBase = (UINT32)(currentEntry->Address - ffsParser->addressDiff); itemIndex = model->findByBase(currentEntryBase); if (itemIndex.isValid()) { UByteArray item = model->header(itemIndex) + model->body(itemIndex) + model->tail(itemIndex); UINT32 localOffset = currentEntryBase - model->base(itemIndex); switch (currentEntry->Type) { case INTEL_FIT_TYPE_MICROCODE: (void)parseFitEntryMicrocode(item, localOffset, itemIndex, info, currentEntrySize); break; case INTEL_FIT_TYPE_STARTUP_AC_MODULE: (void)parseFitEntryAcm(item, localOffset, itemIndex, info, currentEntrySize); acmIndex = itemIndex; break; case INTEL_FIT_TYPE_BOOT_GUARD_KEY_MANIFEST: (void)parseFitEntryBootGuardKeyManifest(item, localOffset, itemIndex, info, currentEntrySize); kmIndex = itemIndex; break; case INTEL_FIT_TYPE_BOOT_GUARD_BOOT_POLICY: (void)parseFitEntryBootGuardBootPolicy(item, localOffset, itemIndex, info, currentEntrySize); bpIndex = itemIndex; break; default: // Do nothing break; } } else { msg(usprintf("%s: FIT entry #%u not found in the image", __FUNCTION__, i), fitIndex); } } // Explicitly set the item referenced by FIT as fixed if (itemIndex.isValid()) { model->setFixed(itemIndex, true); } // Add entry to fitTable currentStrings.push_back(usprintf("%016" PRIX64 "h", currentEntry->Address)); currentStrings.push_back(usprintf("%08Xh", currentEntrySize)); currentStrings.push_back(usprintf("%04Xh", currentEntry->Version)); currentStrings.push_back(usprintf("%02Xh", currentEntry->Checksum)); currentStrings.push_back(fitEntryTypeToUString(currentEntry->Type)); currentStrings.push_back(info); fitTable.push_back(std::pair, UModelIndex>(currentStrings, itemIndex)); } // Perform validation of BootGuard components if (bgAcmFound) { if (!bgKeyManifestFound) { msg(usprintf("%s: startup ACM found, but KeyManifest is not", __FUNCTION__), acmIndex); } else if (!bgBootPolicyFound) { msg(usprintf("%s: startup ACM and Key Manifest found, Boot Policy is not", __FUNCTION__), kmIndex); } else { // Check key hashes if (!bgKmHash.isEmpty() && !(bgKmHash == bgBpHashSha256 || bgKmHash == bgBpHashSha384)) { msg(usprintf("%s: Boot Policy key hash stored in Key Manifest differs from the hash of the public key stored in Boot Policy", __FUNCTION__), bpIndex); return U_SUCCESS; } } } return U_SUCCESS; } void FitParser::findFitRecursive(const UModelIndex & index, UModelIndex & found, UINT32 & fitOffset) { // Sanity check if (!index.isValid()) { return; } // Process child items for (int i = 0; i < model->rowCount(index); i++) { findFitRecursive(index.model()->index(i, 0, index), found, fitOffset); if (found.isValid()) { // Found it, no need to process further return; } } // Check for all FIT signatures in item body UByteArray lastVtfBody = model->body(ffsParser->lastVtf); UINT64 fitSignatureValue = INTEL_FIT_SIGNATURE; UByteArray fitSignature((const char*)&fitSignatureValue, sizeof(fitSignatureValue)); UINT32 storedFitAddress = *(const UINT32*)(lastVtfBody.constData() + lastVtfBody.size() - INTEL_FIT_POINTER_OFFSET); for (INT32 offset = (INT32)model->body(index).indexOf(fitSignature); offset >= 0; offset = (INT32)model->body(index).indexOf(fitSignature, offset + 1)) { // FIT candidate found, calculate its physical address UINT32 fitAddress = (UINT32)(model->base(index) + (UINT32)ffsParser->addressDiff + model->header(index).size() + (UINT32)offset); // Check FIT address to be stored in the last VTF if (fitAddress == storedFitAddress) { // Valid FIT table must have at least two entries if ((UINT32)model->body(index).size() < offset + 2*sizeof(INTEL_FIT_ENTRY)) { msg(usprintf("%s: FIT table candidate found, too small to contain real FIT", __FUNCTION__), index); } else { // Real FIT found found = index; fitOffset = offset; msg(usprintf("%s: real FIT table found at physical address %08Xh", __FUNCTION__, fitAddress), found); break; } } else if (model->rowCount(index) == 0) { // Show messages only to leaf items msg(usprintf("%s: FIT table candidate found, but not referenced from the last VTF", __FUNCTION__), index); } } } USTATUS FitParser::parseFitEntryMicrocode(const UByteArray & microcode, const UINT32 localOffset, const UModelIndex & parent, UString & info, UINT32 &realSize) { U_UNUSED_PARAMETER(parent); if ((UINT32)microcode.size() - localOffset < sizeof(INTEL_MICROCODE_HEADER)) { return U_INVALID_MICROCODE; } const INTEL_MICROCODE_HEADER* ucodeHeader = (const INTEL_MICROCODE_HEADER*)(microcode.constData() + localOffset); if (!ffsParser->microcodeHeaderValid(ucodeHeader)) { return U_INVALID_MICROCODE; } if ((UINT32)microcode.size() - localOffset < ucodeHeader->TotalSize) { return U_INVALID_MICROCODE; } // Valid microcode found info = usprintf("CpuSignature: %08Xh, Revision: %08Xh, Date: %02X.%02X.%04X", ucodeHeader->ProcessorSignature, ucodeHeader->UpdateRevision, ucodeHeader->DateDay, ucodeHeader->DateMonth, ucodeHeader->DateYear); realSize = ucodeHeader->TotalSize; return U_SUCCESS; } USTATUS FitParser::parseFitEntryAcm(const UByteArray & acm, const UINT32 localOffset, const UModelIndex & parent, UString & info, UINT32 &realSize) { try { umemstream is(acm.constData(), acm.size()); is.seekg(localOffset, is.beg); kaitai::kstream ks(&is); intel_acm_t parsed(&ks); intel_acm_t::header_t* header = parsed.header(); realSize = header->module_size(); // Check header version to be of a known value if (header->header_version() != intel_acm_t::KNOWN_HEADER_VERSION_V0_0 && header->header_version() != intel_acm_t::KNOWN_HEADER_VERSION_V3_0) { msg(usprintf("%s: Intel ACM with unknown header version %08Xh found", __FUNCTION__, header->header_version()), parent); } // Valid ACM found info = usprintf("LocalOffset: %08Xh, EntryPoint: %08Xh, ACM SVN: %04Xh, Date: %02X.%02X.%04X", localOffset, header->entry_point(), header->acm_svn(), header->date_day(), header->date_month(), header->date_year()); // Populate ACM info UString acmInfo; if (header->module_subtype() == intel_acm_t::MODULE_SUBTYPE_TXT) { acmInfo = "TXT ACM "; } else if(header->module_subtype() == intel_acm_t::MODULE_SUBTYPE_STARTUP) { acmInfo = "Startup ACM "; } else if (header->module_subtype() == intel_acm_t::MODULE_SUBTYPE_BOOT_GUARD) { acmInfo = "BootGuard ACM "; } else { acmInfo = usprintf("Unknown ACM (%04Xh)", header->module_subtype()); msg(usprintf("%s: Intel ACM with unknown subtype %04Xh found", __FUNCTION__, header->module_subtype()), parent); } acmInfo += usprintf("found at base %Xh\n" "ModuleType: %04Xh\n" "ModuleSubtype: %04Xh\n" "HeaderSize: %08Xh\n" "HeaderVersion: %08Xh\n" "ChipsetId: %04Xh\n" "Flags: %04Xh\n" "ModuleVendor: %04Xh\n" "Date: %02X.%02X.%04X\n" "ModuleSize: %08Xh\n" "AcmSvn: %04Xh\n" "SeSvn: %04Xh\n" "CodeControlFlags: %08Xh\n" "ErrorEntryPoint: %08Xh\n" "GdtMax: %08Xh\n" "GdtBase: %08Xh\n" "SegmentSel: %08Xh\n" "EntryPoint: %08Xh\n" "KeySize: %08Xh\n" "ScratchSpaceSize: %08Xh\n", model->base(parent) + localOffset, header->module_type(), header->module_subtype(), header->header_size() * (UINT32)sizeof(UINT32), header->header_version(), header->chipset_id(), header->flags(), header->module_vendor(), header->date_day(), header->date_month(), header->date_year(), header->module_size() * (UINT32)sizeof(UINT32), header->acm_svn(), header->se_svn(), header->code_control_flags(), header->error_entry_point(), header->gdt_max(), header->gdt_base(), header->segment_sel(), header->entry_point(), header->key_size() * (UINT32)sizeof(UINT32), header->scratch_space_size() * (UINT32)sizeof(UINT32)); // Add RsaPublicKey if (header->_is_null_rsa_exponent() == false) { acmInfo += usprintf("ACM RSA Public Key Exponent: %Xh\n", header->rsa_exponent()); } else { acmInfo += usprintf("ACM RSA Public Key Exponent: %Xh\n", INTEL_ACM_HARDCODED_RSA_EXPONENT); } acmInfo += usprintf("ACM RSA Public Key:"); for (UINT32 i = 0; i < header->rsa_public_key().size(); i++) { if (i % 32 == 0) acmInfo += "\n"; acmInfo += usprintf("%02X", (UINT8)header->rsa_public_key().at(i)); } acmInfo += "\n"; // Add RsaSignature acmInfo += UString("ACM RSA Signature:"); for (UINT32 i = 0; i < header->rsa_signature().size(); i++) { if (i % 32 == 0) acmInfo +="\n"; acmInfo += usprintf("%02X", (UINT8)header->rsa_signature().at(i)); } acmInfo += "\n"; securityInfo += acmInfo + "\n"; bgAcmFound = true; return U_SUCCESS; } catch (...) { msg(usprintf("%s: unable to parse ACM", __FUNCTION__), parent); return U_INVALID_ACM; } } USTATUS FitParser::parseFitEntryBootGuardKeyManifest(const UByteArray & keyManifest, const UINT32 localOffset, const UModelIndex & parent, UString & info, UINT32 &realSize) { U_UNUSED_PARAMETER(realSize); // v1 try { umemstream is(keyManifest.constData(), keyManifest.size()); is.seekg(localOffset, is.beg); kaitai::kstream ks(&is); intel_keym_v1_t parsed(&ks); // Valid KM found info = usprintf("LocalOffset: %08Xh, Version: %02Xh, KM Version: %02Xh, KM SVN: %02Xh", localOffset, parsed.version(), parsed.km_version(), parsed.km_svn()); // Populate KM info UString kmInfo = usprintf("Intel BootGuard Key manifest found at base %Xh\n" "Tag: '__KEYM__'\n" "Version: %02Xh\n" "KmVersion: %02Xh\n" "KmSvn: %02Xh\n" "KmId: %02Xh\n", model->base(parent) + localOffset, parsed.version(), parsed.km_version(), parsed.km_svn(), parsed.km_id()); // Add KM hash kmInfo += UString("KM Hash (") + hashTypeToUString(parsed.km_hash()->hash_algorithm_id()) + "): "; for (UINT16 j = 0; j < parsed.km_hash()->len_hash(); j++) { kmInfo += usprintf("%02X", (UINT8) parsed.km_hash()->hash().data()[j]); } kmInfo += "\n"; // Add Key Signature const intel_keym_v1_t::key_signature_t* key_signature = parsed.key_signature(); kmInfo += usprintf("Key Manifest Key Signature:\n" "Version: %02Xh\n" "KeyId: %04Xh\n" "SigScheme: %04Xh\n", key_signature->version(), key_signature->key_id(), key_signature->sig_scheme()); // Add PubKey kmInfo += usprintf("Key Manifest Public Key Exponent: %Xh\n", key_signature->public_key()->exponent()); kmInfo += usprintf("Key Manifest Public Key:"); for (UINT16 i = 0; i < (UINT16)key_signature->public_key()->modulus().length(); i++) { if (i % 32 == 0) kmInfo += UString("\n"); kmInfo += usprintf("%02X", (UINT8)key_signature->public_key()->modulus().at(i)); } kmInfo += "\n"; // One of those hashes is what's getting written into Field Programmable Fuses // Calculate the hashes of public key modulus only UINT8 hash[SHA384_HASH_SIZE] = {}; sha256(key_signature->public_key()->modulus().data(), key_signature->public_key()->modulus().length(), hash); kmInfo += usprintf("Key Manifest Public Key Hash (Modulus Only, SHA256): "); for (UINT8 i = 0; i < SHA256_HASH_SIZE; i++) { kmInfo += usprintf("%02X", hash[i]); } kmInfo += "\n"; sha384(key_signature->public_key()->modulus().data(), key_signature->public_key()->modulus().length(), hash); kmInfo += usprintf("Key Manifest Public Key Hash (Modulus Only, SHA384): "); for (UINT8 i = 0; i < SHA384_HASH_SIZE; i++) { kmInfo += usprintf("%02X", hash[i]); } kmInfo += "\n"; // Calculate the hashes of public key modulus + exponent UByteArray dataToHash; dataToHash += UByteArray(key_signature->public_key()->modulus().data(), key_signature->public_key()->modulus().length()); UINT32 exponent = key_signature->public_key()->exponent(); dataToHash += UByteArray((const char*)&exponent, sizeof(exponent)); sha256(dataToHash.constData(), dataToHash.size(), hash); kmInfo += usprintf("Key Manifest Public Key Hash (Modulus+Exponent, SHA256): "); for (UINT8 i = 0; i < SHA256_HASH_SIZE; i++) { kmInfo += usprintf("%02X", hash[i]); } kmInfo += "\n"; sha384(dataToHash.constData(), dataToHash.size(), hash); kmInfo += usprintf("Key Manifest Public Key Hash (Modulus+Exponent, SHA384): "); for (UINT8 i = 0; i < SHA384_HASH_SIZE; i++) { kmInfo += usprintf("%02X", hash[i]); } kmInfo += "\n"; // Add Signature kmInfo += UString("Key Manifest Signature: "); for (UINT16 i = 0; i < (UINT16)key_signature->signature()->signature().length(); i++) { if (i % 32 == 0) kmInfo += UString("\n"); kmInfo += usprintf("%02X", (UINT8)key_signature->signature()->signature().at(i)); } kmInfo += "\n"; securityInfo += kmInfo + "\n"; bgKeyManifestFound = true; return U_SUCCESS; } catch (...) { // Do nothing here, will try parsing as v2 next } // v2 try { umemstream is(keyManifest.constData(), keyManifest.size()); is.seekg(localOffset, is.beg); kaitai::kstream ks(&is); intel_keym_v2_t parsed(&ks); intel_keym_v2_t::header_t* header = parsed.header(); // Valid KM found info = usprintf("LocalOffset: %08Xh, Version: %02Xh, KM Version: %02Xh, KM SVN: %02Xh", localOffset, header->version(), parsed.km_version(), parsed.km_svn()); // Populate KM info UString kmInfo = usprintf("Intel BootGuard Key manifest found at base %Xh\n" "Tag: '__KEYM__'\n" "Version: %02Xh\n" "KmVersion: %02Xh\n" "KmSvn: %02Xh\n" "KmId: %02Xh\n" "KeySignatureOffset: %04Xh\n" "FPFHashAlgorithmId: %04Xh\n" "HashCount: %04Xh\n", model->base(parent) + localOffset, header->version(), parsed.km_version(), parsed.km_svn(), parsed.km_id(), parsed.key_signature_offset(), parsed.fpf_hash_algorithm_id(), parsed.num_km_hashes()); // Add KM hashes if (parsed.num_km_hashes() == 0) { kmInfo += UString("KM Hashes: N/A\n"); msg(usprintf("%s: Key Manifest without KM hashes", __FUNCTION__), parent); } else { kmInfo += UString("KM Hashes:\n"); for (UINT16 i = 0; i < parsed.num_km_hashes(); i++) { const auto & current_km_hash = parsed.km_hashes()->at(i); // Add KM hash kmInfo += usprintf("UsageFlags: %016" PRIX64 "h, ", current_km_hash->usage_flags()) + hashTypeToUString(current_km_hash->hash_algorithm_id()) + ": "; for (UINT16 j = 0; j < current_km_hash->len_hash(); j++) { kmInfo += usprintf("%02X", (UINT8)current_km_hash->hash().data()[j]); } kmInfo += "\n"; if (current_km_hash->usage_flags() == intel_keym_v2_t::KM_USAGE_FLAGS_BOOT_POLICY_MANIFEST) { bgKmHash = UByteArray((const char*)current_km_hash->hash().data(), current_km_hash->hash().size()); } } } // Add Key Signature const intel_keym_v2_t::key_signature_t* key_signature = parsed.key_signature(); kmInfo += usprintf("Key Manifest Key Signature:\n" "Version: %02Xh\n" "KeyId: %04Xh\n" "SigScheme: %04Xh\n", key_signature->version(), key_signature->key_id(), key_signature->sig_scheme()); // Add PubKey kmInfo += usprintf("Key Manifest Public Key Exponent: %Xh\n", key_signature->public_key()->exponent()); kmInfo += usprintf("Key Manifest Public Key:"); for (UINT16 i = 0; i < (UINT16)key_signature->public_key()->modulus().length(); i++) { if (i % 32 == 0) kmInfo += UString("\n"); kmInfo += usprintf("%02X", (UINT8)key_signature->public_key()->modulus().at(i)); } kmInfo += "\n"; // One of those hashes is what's getting written into Field Programmable Fuses // Calculate the hashes of public key modulus only UINT8 hash[SHA384_HASH_SIZE] = {}; sha256(key_signature->public_key()->modulus().data(), key_signature->public_key()->modulus().length(), hash); kmInfo += usprintf("Key Manifest Public Key Hash (Modulus Only, SHA256): "); for (UINT8 i = 0; i < SHA256_HASH_SIZE; i++) { kmInfo += usprintf("%02X", hash[i]); } kmInfo += "\n"; sha384(key_signature->public_key()->modulus().data(), key_signature->public_key()->modulus().length(), hash); kmInfo += usprintf("Key Manifest Public Key Hash (Modulus Only, SHA384): "); for (UINT8 i = 0; i < SHA384_HASH_SIZE; i++) { kmInfo += usprintf("%02X", hash[i]); } kmInfo += "\n"; // Calculate the hashes of public key modulus + exponent UByteArray dataToHash; dataToHash += UByteArray(key_signature->public_key()->modulus().data(), key_signature->public_key()->modulus().length()); UINT32 exponent = key_signature->public_key()->exponent(); dataToHash += UByteArray((const char*)&exponent, sizeof(exponent)); sha256(dataToHash.constData(), dataToHash.size(), hash); kmInfo += usprintf("Key Manifest Public Key Hash (Modulus+Exponent, SHA256): "); for (UINT8 i = 0; i < SHA256_HASH_SIZE; i++) { kmInfo += usprintf("%02X", hash[i]); } kmInfo += "\n"; sha384(dataToHash.constData(), dataToHash.size(), hash); kmInfo += usprintf("Key Manifest Public Key Hash (Modulus+Exponent, SHA384): "); for (UINT8 i = 0; i < SHA384_HASH_SIZE; i++) { kmInfo += usprintf("%02X", hash[i]); } kmInfo += "\n"; // Add Signature kmInfo += UString("Key Manifest Signature: "); for (UINT16 i = 0; i < (UINT16)key_signature->signature()->signature().length(); i++) { if (i % 32 == 0) kmInfo += UString("\n"); kmInfo += usprintf("%02X", (UINT8)key_signature->signature()->signature().at(i)); } kmInfo += "\n"; securityInfo += kmInfo + "\n"; bgKeyManifestFound = true; return U_SUCCESS; } catch (...) { msg(usprintf("%s: unable to parse Key Manifest", __FUNCTION__), parent); return U_INVALID_BOOT_GUARD_KEY_MANIFEST; } } USTATUS FitParser::parseFitEntryBootGuardBootPolicy(const UByteArray & bootPolicy, const UINT32 localOffset, const UModelIndex & parent, UString & info, UINT32 &realSize) { U_UNUSED_PARAMETER(realSize); // v1 try { umemstream is(bootPolicy.constData(), bootPolicy.size()); is.seekg(localOffset, is.beg); kaitai::kstream ks(&is); intel_acbp_v1_t parsed(&ks); // Valid BPM found info = usprintf("LocalOffset: %08Xh, Version: %02Xh, BP SVN: %02Xh, ACM SVN: %02Xh", localOffset, parsed.version(), parsed.bp_svn(), parsed.acm_svn()); UString bpInfo = usprintf("Intel BootGuard Boot Policy Manifest found at base %Xh\n" "StructureId: '__ACBP__'\n" "Version: %02Xh\n" "BPMRevision: %02Xh\n" "BPSVN: %02Xh\n" "ACMSVN: %02Xh\n" "NEMDataSize: %04Xh\n", model->base(parent) + localOffset, parsed.version(), parsed.bpm_revision(), parsed.bp_svn(), parsed.acm_svn(), parsed.nem_data_size()); bpInfo += UString("Boot Policy Elements:\n"); for (const auto & element : *parsed.elements()) { const auto & element_header = element->header(); UINT64 structure_id = (UINT64) element_header->structure_id(); const char* structure_id_bytes = (const char*)&structure_id; bpInfo += usprintf("StructureId: '%c%c%c%c%c%c%c%c'\n" "Version: %02Xh\n", structure_id_bytes[0], structure_id_bytes[1], structure_id_bytes[2], structure_id_bytes[3], structure_id_bytes[4], structure_id_bytes[5], structure_id_bytes[6], structure_id_bytes[7], element_header->version()); // IBBS if (element->_is_null_ibbs_body() == false) { const intel_acbp_v1_t::ibbs_body_t* ibbs_body = element->ibbs_body(); // Valid IBBS element found bpInfo += usprintf("Flags: %08Xh\n" "MchBar: %016" PRIX64 "h\n" "VtdBar: %016" PRIX64 "h\n" "DmaProtectionBase0: %08Xh\n" "DmaProtectionLimit0: %08Xh\n" "DmaProtectionBase1: %016" PRIX64 "h\n" "DmaProtectionLimit1: %016" PRIX64 "h\n" "IbbEntryPoint: %08Xh\n" "IbbSegmentsCount: %02Xh\n", ibbs_body->flags(), ibbs_body->mch_bar(), ibbs_body->vtd_bar(), ibbs_body->dma_protection_base0(), ibbs_body->dma_protection_limit0(), ibbs_body->dma_protection_base1(), ibbs_body->dma_protection_limit1(), ibbs_body->ibb_entry_point(), ibbs_body->num_ibb_segments()); // Check for non-empty PostIbbHash if (ibbs_body->post_ibb_hash()->len_hash() == 0) { bpInfo += UString("PostIBB Hash: N/A\n"); } else { // Add postIbbHash protected range UByteArray postIbbHash(ibbs_body->post_ibb_hash()->hash().data(), ibbs_body->post_ibb_hash()->len_hash()); if (postIbbHash.count('\x00') != postIbbHash.size() && postIbbHash.count('\xFF') != postIbbHash.size()) { PROTECTED_RANGE range = {}; range.Type = PROTECTED_RANGE_INTEL_BOOT_GUARD_POST_IBB; range.AlgorithmId = ibbs_body->post_ibb_hash()->hash_algorithm_id(); range.Hash = postIbbHash; ffsParser->protectedRanges.push_back(range); } // Add PostIbbHash bpInfo += UString("PostIBB Hash (") + hashTypeToUString(ibbs_body->post_ibb_hash()->hash_algorithm_id()) + "): "; for (UINT16 i = 0; i < ibbs_body->post_ibb_hash()->len_hash(); i++) { bpInfo += usprintf("%02X", (UINT8)ibbs_body->post_ibb_hash()->hash().data()[i]); } bpInfo += "\n"; } // Add IbbHash bpInfo += UString("IBB Hash (") + hashTypeToUString(ibbs_body->ibb_hash()->hash_algorithm_id()) + "): "; for (UINT16 j = 0; j < ibbs_body->ibb_hash()->len_hash(); j++) { bpInfo += usprintf("%02X", (UINT8)ibbs_body->ibb_hash()->hash().data()[j]); } bpInfo += "\n"; // Check for non-empty IbbSegments if (ibbs_body->num_ibb_segments() == 0) { bpInfo += UString("IBB Segments: N/A\n"); msg(usprintf("%s: Boot Policy without IBB segments", __FUNCTION__), parent); } else { bpInfo += UString("IBB Segments:\n"); for (UINT8 i = 0; i < ibbs_body->num_ibb_segments(); i++) { const auto & current_segment = ibbs_body->ibb_segments()->at(i); bpInfo += usprintf("Flags: %04Xh, Address: %08Xh, Size: %08Xh\n", current_segment->flags(), current_segment->base(), current_segment->size()); if (current_segment->flags() == intel_acbp_v1_t::IBB_SEGMENT_TYPE_IBB && current_segment->base() != 0xFFFFFFFF && current_segment->size() != 0 && current_segment->size() != 0xFFFFFFFF) { PROTECTED_RANGE range = {}; range.Offset = current_segment->base(); range.Size = current_segment->size(); range.AlgorithmId = TCG_HASH_ALGORITHM_ID_SHA256; range.Type = PROTECTED_RANGE_INTEL_BOOT_GUARD_IBB; ffsParser->protectedRanges.push_back(range); } } } } // PMDA else if (element->_is_null_pmda_body() == false) { intel_acbp_v1_t::pmda_body_t* pmda_body = element->pmda_body(); // Valid Microsoft PMDA element found bpInfo += usprintf("TotalSize: %04Xh\n" "Version: %08Xh\n" "NumEntries: %08Xh\n", pmda_body->total_size(), pmda_body->version(), pmda_body->num_entries()); if (pmda_body->num_entries() == 0) { bpInfo += UString("PMDA Entries: N/A\n"); } else { bpInfo += UString("PMDA Entries:\n"); // v1 entries if (pmda_body->_is_null_entries_v1() == false) { for (UINT32 i = 0; i < pmda_body->num_entries(); i++) { const auto & current_element = pmda_body->entries_v1()->at(i); // Add element bpInfo += usprintf("Address: %08Xh, Size: %08Xh\n", current_element->base(), current_element->size()); // Add hash bpInfo += "SHA256: "; for (UINT16 j = 0; j < (UINT16)current_element->hash().size(); j++) { bpInfo += usprintf("%02X", (UINT8)current_element->hash().data()[j]); } bpInfo += "\n"; // Add protected range if (current_element->base() != 0xFFFFFFFF && current_element->size() != 0 && current_element->size() != 0xFFFFFFFF) { PROTECTED_RANGE range = {}; range.Offset = current_element->base(); range.Size = current_element->size(); range.Type = PROTECTED_RANGE_VENDOR_HASH_MICROSOFT_PMDA; range.AlgorithmId = TCG_HASH_ALGORITHM_ID_SHA256; range.Hash = UByteArray(current_element->hash().data(), current_element->hash().size()); ffsParser->protectedRanges.push_back(range); } } } // v2 entries else if (pmda_body->_is_null_entries_v2() == false) { for (UINT32 i = 0; i < pmda_body->num_entries(); i++) { const auto & current_element = pmda_body->entries_v2()->at(i); // Add element bpInfo += usprintf("Address: %08Xh, Size: %08Xh\n", current_element->base(), current_element->size()); // Add hash bpInfo += hashTypeToUString(current_element->hash()->hash_algorithm_id()) + ": "; for (UINT16 j = 0; j < (UINT16)current_element->hash()->hash().size(); j++) { bpInfo += usprintf("%02X", (UINT8)current_element->hash()->hash().data()[j]); } bpInfo += "\n"; // Add protected range if (current_element->base() != 0xFFFFFFFF && current_element->size() != 0 && current_element->size() != 0xFFFFFFFF) { PROTECTED_RANGE range = {}; range.Offset = current_element->base(); range.Size = current_element->size(); range.Type = PROTECTED_RANGE_VENDOR_HASH_MICROSOFT_PMDA; range.AlgorithmId = current_element->hash()->hash_algorithm_id(); range.Hash = UByteArray(current_element->hash()->hash().data(), current_element->hash()->hash().size()); ffsParser->protectedRanges.push_back(range); } } } } } // PMSG else if (element->_is_null_pmsg_body() == false) { const intel_acbp_v1_t::pmsg_body_t* key_signature = element->pmsg_body(); bpInfo += usprintf("Boot Policy Key Signature:\n" "Version: %02Xh\n" "KeyId: %04Xh\n" "SigScheme: %04Xh\n", key_signature->version(), key_signature->key_id(), key_signature->sig_scheme()); // Add PubKey bpInfo += usprintf("Boot Policy Public Key Exponent: %Xh\n", key_signature->public_key()->exponent()); bpInfo += usprintf("Boot Policy Public Key:"); for (UINT16 i = 0; i < (UINT16)key_signature->public_key()->modulus().length(); i++) { if (i % 32 == 0) bpInfo += UString("\n"); bpInfo += usprintf("%02X", (UINT8)key_signature->public_key()->modulus().at(i)); } bpInfo += "\n"; // Calculate and add PubKey hashes UINT8 hash[SHA384_HASH_SIZE]; // SHA256 sha256(key_signature->public_key()->modulus().data(), key_signature->public_key()->modulus().length() , hash); bpInfo += UString("Boot Policy Public Key Hash (SHA256): "); for (UINT8 i = 0; i < SHA256_HASH_SIZE; i++) { bpInfo += usprintf("%02X", hash[i]); } bpInfo += "\n"; bgBpHashSha256 = UByteArray((const char*)hash, SHA256_HASH_SIZE); // SHA384 sha384(key_signature->public_key()->modulus().data(), key_signature->public_key()->modulus().length() , hash); bpInfo += UString("Boot Policy Public Key Hash (SHA384): "); for (UINT8 i = 0; i < SHA384_HASH_SIZE; i++) { bpInfo += usprintf("%02X", hash[i]); } bpInfo += "\n"; bgBpHashSha384 = UByteArray((const char*)hash, SHA384_HASH_SIZE); // Add Signature bpInfo += UString("Boot Policy Signature: "); for (UINT16 i = 0; i < (UINT16)key_signature->signature()->signature().length(); i++) { if (i % 32 == 0) bpInfo += UString("\n"); bpInfo += usprintf("%02X", (UINT8)key_signature->signature()->signature().at(i)); } bpInfo += "\n"; } } securityInfo += bpInfo + "\n"; bgBootPolicyFound = true; return U_SUCCESS; } catch (...) { // Do nothing here, will try parsing as v2 next } // v2 try { umemstream is(bootPolicy.constData(), bootPolicy.size()); is.seekg(localOffset, is.beg); kaitai::kstream ks(&is); intel_acbp_v2_t parsed(&ks); // This already verified the version to be >= 0x20 // Valid BPM found info = usprintf("LocalOffset: %08Xh, Version: %02Xh, BP SVN: %02Xh, ACM SVN: %02Xh", localOffset, parsed.version(), parsed.bp_svn(), parsed.acm_svn()); // Add BP header and body info UString bpInfo = usprintf("Intel BootGuard Boot Policy Manifest found at base %Xh\n" "StructureId: '__ACBP__'\n" "Version: %02Xh\n" "HeaderSpecific: %02Xh\n" "TotalSize: %04Xh\n" "KeySignatureOffset: %04Xh\n" "BPMRevision: %02Xh\n" "BPSVN: %02Xh\n" "ACMSVN: %02Xh\n" "NEMDataSize: %04Xh\n", model->base(parent) + localOffset, parsed.version(), parsed.header_specific(), parsed.total_size(), parsed.key_signature_offset(), parsed.bpm_revision(), parsed.bp_svn(), parsed.acm_svn(), parsed.nem_data_size()); bpInfo += UString("Boot Policy Elements:\n"); for (const auto & element : *parsed.elements()) { const intel_acbp_v2_t::header_t* element_header = element->header(); UINT64 structure_id = element_header->structure_id(); const char* structure_id_bytes = (const char*)&structure_id; bpInfo += usprintf("StructureId: '%c%c%c%c%c%c%c%c'\n" "Version: %02Xh\n" "HeaderSpecific: %02Xh\n" "TotalSize: %04Xh\n", structure_id_bytes[0], structure_id_bytes[1], structure_id_bytes[2], structure_id_bytes[3], structure_id_bytes[4], structure_id_bytes[5], structure_id_bytes[6], structure_id_bytes[7], element_header->version(), element_header->header_specific(), element_header->total_size()); // IBBS if (element->_is_null_ibbs_body() == false) { const intel_acbp_v2_t::ibbs_body_t* ibbs_body = element->ibbs_body(); // Valid IBBS element found bpInfo += usprintf("SetNumber: %02Xh\n" "PBETValue: %02Xh\n" "Flags: %08Xh\n" "MchBar: %016" PRIX64 "h\n" "VtdBar: %016" PRIX64 "h\n" "DmaProtectionBase0: %08Xh\n" "DmaProtectionLimit0: %08Xh\n" "DmaProtectionBase1: %016" PRIX64 "h\n" "DmaProtectionLimit1: %016" PRIX64 "h\n" "IbbEntryPoint: %08Xh\n" "IbbDigestsSize: %02Xh\n" "IbbDigestsCount: %02Xh\n" "IbbSegmentsCount: %02Xh\n", ibbs_body->set_number(), ibbs_body->pbet_value(), ibbs_body->flags(), ibbs_body->mch_bar(), ibbs_body->vtd_bar(), ibbs_body->dma_protection_base0(), ibbs_body->dma_protection_limit0(), ibbs_body->dma_protection_base1(), ibbs_body->dma_protection_limit1(), ibbs_body->ibb_entry_point(), ibbs_body->ibb_digests_size(), ibbs_body->num_ibb_digests(), ibbs_body->num_ibb_segments()); // Check for non-empty PostIbbHash if (ibbs_body->post_ibb_digest()->len_hash() == 0) { bpInfo += UString("PostIBB Hash: N/A\n"); } else { // Add postIbbHash protected range UByteArray postIbbHash(ibbs_body->post_ibb_digest()->hash().data(), ibbs_body->post_ibb_digest()->len_hash()); if (postIbbHash.count('\x00') != postIbbHash.size() && postIbbHash.count('\xFF') != postIbbHash.size()) { PROTECTED_RANGE range = {}; range.Type = PROTECTED_RANGE_INTEL_BOOT_GUARD_POST_IBB; range.AlgorithmId = ibbs_body->post_ibb_digest()->hash_algorithm_id(); range.Hash = postIbbHash; ffsParser->protectedRanges.push_back(range); } // Add PostIbbDigest bpInfo += UString("PostIBB Hash (") + hashTypeToUString(ibbs_body->post_ibb_digest()->hash_algorithm_id()) + "): "; for (UINT16 i = 0; i < ibbs_body->post_ibb_digest()->len_hash(); i++) { bpInfo += usprintf("%02X", (UINT8)ibbs_body->post_ibb_digest()->hash().data()[i]); } bpInfo += "\n"; } // Check for non-empty ObbHash if (ibbs_body->obb_digest() == 0) { bpInfo += UString("OBB Hash: N/A\n"); } else { // Add ObbHash bpInfo += UString("OBB Hash (") + hashTypeToUString(ibbs_body->obb_digest()->hash_algorithm_id()) + "): "; for (UINT16 i = 0; i < ibbs_body->obb_digest()->len_hash(); i++) { bpInfo += usprintf("%02X", (UINT8)ibbs_body->obb_digest()->hash().data()[i]); } bpInfo += "\n"; // Add ObbHash protected range UByteArray obbHash(ibbs_body->obb_digest()->hash().data(), ibbs_body->obb_digest()->len_hash()); if (obbHash.count('\x00') != obbHash.size() && obbHash.count('\xFF') != obbHash.size()) { PROTECTED_RANGE range = {}; range.Type = PROTECTED_RANGE_INTEL_BOOT_GUARD_OBB; range.AlgorithmId = ibbs_body->obb_digest()->hash_algorithm_id(); range.Hash = obbHash; ffsParser->protectedRanges.push_back(range); } } // Check for non-empty IbbDigests if (ibbs_body->num_ibb_digests() == 0) { bpInfo += UString("IBB Hashes: N/A\n"); msg(usprintf("%s: Boot Policy without IBB digests", __FUNCTION__), parent); } else { bpInfo += UString("IBB Hashes:\n"); for (UINT16 i = 0; i < ibbs_body->num_ibb_digests(); i++) { const auto & current_hash = ibbs_body->ibb_digests()->at(i); bpInfo += hashTypeToUString(current_hash->hash_algorithm_id()) + ": "; for (UINT16 j = 0; j < current_hash->len_hash(); j++) { bpInfo += usprintf("%02X", (UINT8)current_hash->hash().data()[j]); } bpInfo += "\n"; } } // Check for non-empty IbbSegments if (ibbs_body->num_ibb_segments() == 0) { bpInfo += UString("IBB Segments: N/A\n"); msg(usprintf("%s: Boot Policy without IBB segments", __FUNCTION__), parent); } else { bpInfo += UString("IBB Segments:\n"); for (UINT8 i = 0; i < ibbs_body->num_ibb_segments(); i++) { const auto & current_segment = ibbs_body->ibb_segments()->at(i); bpInfo += usprintf("Flags: %04Xh, Address: %08Xh, Size: %08Xh\n", current_segment->flags(), current_segment->base(), current_segment->size()); if (current_segment->flags() == intel_acbp_v2_t::IBB_SEGMENT_TYPE_IBB && current_segment->base() != 0xFFFFFFFF && current_segment->size() != 0 && current_segment->size() != 0xFFFFFFFF) { PROTECTED_RANGE range = {}; range.Offset = current_segment->base(); range.Size =current_segment->size(); range.Type = PROTECTED_RANGE_INTEL_BOOT_GUARD_IBB; range.AlgorithmId = TCG_HASH_ALGORITHM_ID_SHA256; ffsParser->protectedRanges.push_back(range); } } } } // PMDA else if (element->_is_null_pmda_body() == false) { const intel_acbp_v2_t::pmda_body_t* pmda_body = element->pmda_body(); // Valid Microsoft PMDA element found bpInfo += usprintf("TotalSize: %04Xh\n" "Version: %08Xh\n" "NumEntries: %08Xh\n", pmda_body->total_size(), pmda_body->version(), pmda_body->num_entries()); if (pmda_body->num_entries() == 0) { bpInfo += UString("PMDA Entries: N/A\n"); } else { bpInfo += UString("PMDA Entries:\n"); for (UINT32 i = 0; i < pmda_body->num_entries(); i++) { const auto & current_entry = pmda_body->entries()->at(i); UINT64 entry_id = current_entry->entry_id(); const char* entry_id_bytes = (const char*)&entry_id; // Add element bpInfo += usprintf("EntryId: '%c%c%c%c', Version: %04Xh, Address: %08Xh, Size: %08Xh\n", entry_id_bytes[0], entry_id_bytes[1], entry_id_bytes[2], entry_id_bytes[3], current_entry->version(), current_entry->base(), current_entry->size()); // Add hash bpInfo += hashTypeToUString(current_entry->hash()->hash_algorithm_id()) + ": "; for (UINT16 j = 0; j < current_entry->hash()->len_hash(); j++) { bpInfo += usprintf("%02X", (UINT8)current_entry->hash()->hash().data()[j]); } bpInfo += "\n"; // Add protected range if (current_entry->base() != 0xFFFFFFFF && current_entry->size() != 0 && current_entry->size() != 0xFFFFFFFF) { PROTECTED_RANGE range = {}; range.Offset = current_entry->base(); range.Size = current_entry->size(); range.Type = PROTECTED_RANGE_VENDOR_HASH_MICROSOFT_PMDA; range.AlgorithmId = current_entry->hash()->hash_algorithm_id(); range.Hash = UByteArray(current_entry->hash()->hash().data(), current_entry->hash()->hash().size()); ffsParser->protectedRanges.push_back(range); } } } } bpInfo += "\n"; } // Add Key Signature const intel_acbp_v2_t::key_signature_t* key_signature = parsed.key_signature(); bpInfo += usprintf("Boot Policy Key Signature:\n" "Version: %02Xh\n" "KeyId: %04Xh\n" "SigScheme: %04Xh\n", key_signature->version(), key_signature->key_id(), key_signature->sig_scheme()); // Add PubKey bpInfo += usprintf("Boot Policy Public Key Exponent: %Xh\n", key_signature->public_key()->exponent()); bpInfo += usprintf("Boot Policy Public Key:"); for (UINT16 i = 0; i < (UINT16)key_signature->public_key()->modulus().length(); i++) { if (i % 32 == 0) bpInfo += UString("\n"); bpInfo += usprintf("%02X", (UINT8)key_signature->public_key()->modulus().at(i)); } bpInfo += "\n"; // Calculate and add PubKey hashes UINT8 hash[SHA384_HASH_SIZE]; // SHA256 sha256(key_signature->public_key()->modulus().data(), key_signature->public_key()->modulus().length() , hash); bpInfo += UString("Boot Policy Public Key Hash (SHA256): "); for (UINT8 i = 0; i < SHA256_HASH_SIZE; i++) { bpInfo += usprintf("%02X", hash[i]); } bpInfo += "\n"; bgBpHashSha256 = UByteArray((const char*)hash, SHA256_HASH_SIZE); // SHA384 sha384(key_signature->public_key()->modulus().data(), key_signature->public_key()->modulus().length() , hash); bpInfo += UString("Boot Policy Public Key Hash (SHA384): "); for (UINT8 i = 0; i < SHA384_HASH_SIZE; i++) { bpInfo += usprintf("%02X", hash[i]); } bpInfo += "\n"; bgBpHashSha384 = UByteArray((const char*)hash, SHA384_HASH_SIZE); // Add Signature bpInfo += UString("Boot Policy Signature: "); for (UINT16 i = 0; i < (UINT16)key_signature->signature()->signature().length(); i++) { if (i % 32 == 0) bpInfo += UString("\n"); bpInfo += usprintf("%02X", (UINT8)key_signature->signature()->signature().at(i)); } bpInfo += "\n"; securityInfo += bpInfo + "\n"; bgBootPolicyFound = true; return U_SUCCESS; } catch (...) { msg(usprintf("%s: unable to parse Boot Policy", __FUNCTION__), parent); return U_INVALID_BOOT_GUARD_BOOT_POLICY; } } #endif // U_ENABLE_ME_PARSING_SUPPORT UEFITool-A66/common/fitparser.h000066400000000000000000000072461442134156300164520ustar00rootroot00000000000000/* fitparser.h Copyright (c) 2022, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php. THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef FITPARSER_H #define FITPARSER_H #include #include "basetypes.h" #include "ustring.h" #include "ubytearray.h" #include "treemodel.h" #include "intel_fit.h" #include "intel_microcode.h" #include "ffsparser.h" class FfsParser; #ifdef U_ENABLE_FIT_PARSING_SUPPORT class FitParser { public: // Default constructor and destructor FitParser(TreeModel* treeModel, FfsParser* parser) : model(treeModel), ffsParser(parser), bgAcmFound(false), bgKeyManifestFound(false), bgBootPolicyFound(false) {} ~FitParser() {} // Returns messages std::vector > getMessages() const { return messagesVector; } // Clears messages void clearMessages() { messagesVector.clear(); } // Obtain parsed FIT table std::vector, UModelIndex> > getFitTable() const { return fitTable; } // Obtain security info UString getSecurityInfo() const { return securityInfo; } // FIT parsing USTATUS parseFit(const UModelIndex & index); private: TreeModel *model; FfsParser *ffsParser; std::vector > messagesVector; std::vector, UModelIndex> > fitTable; bool bgAcmFound; bool bgKeyManifestFound; bool bgBootPolicyFound; UByteArray bgKmHash; UByteArray bgBpHashSha256; UByteArray bgBpHashSha384; UString securityInfo; void msg(const UString message, const UModelIndex index = UModelIndex()) { messagesVector.push_back(std::pair(message, index)); } void findFitRecursive(const UModelIndex & index, UModelIndex & found, UINT32 & fitOffset); USTATUS parseFitEntryMicrocode(const UByteArray & microcode, const UINT32 localOffset, const UModelIndex & parent, UString & info, UINT32 &realSize); USTATUS parseFitEntryAcm(const UByteArray & acm, const UINT32 localOffset, const UModelIndex & parent, UString & info, UINT32 &realSize); USTATUS parseFitEntryBootGuardKeyManifest(const UByteArray & keyManifest, const UINT32 localOffset, const UModelIndex & parent, UString & info, UINT32 &realSize); USTATUS parseFitEntryBootGuardBootPolicy(const UByteArray & bootPolicy, const UINT32 localOffset, const UModelIndex & parent, UString & info, UINT32 &realSize); }; #else // U_ENABLE_FIT_PARSING_SUPPORT class FitParser { public: // Default constructor and destructor FitParser(TreeModel* treeModel, FfsParser* parser) { U_UNUSED_PARAMETER(treeModel); U_UNUSED_PARAMETER(parser); } ~FitParser() {} // Returns messages std::vector > getMessages() const { return std::vector >(); } // Clears messages void clearMessages() {} // Obtain parsed FIT table std::vector, UModelIndex> > getFitTable() const { return std::vector, UModelIndex> >(); } // Obtain security info UString getSecurityInfo() const { return UString(); } // FIT parsing USTATUS parseFit(const UModelIndex & index) { U_UNUSED_PARAMETER(index); return U_SUCCESS; } }; #endif // U_ENABLE_FIT_PARSING_SUPPORT #endif // FITPARSER_H UEFITool-A66/common/gbe.h000066400000000000000000000015711442134156300152030ustar00rootroot00000000000000/* gbe.h Copyright (c) 2015, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHWARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef GBE_H #define GBE_H #include "basetypes.h" // Make sure we use right packing rules #pragma pack(push, 1) typedef struct GBE_MAC_ADDRESS_ { UINT8 vendor[3]; UINT8 device[3]; } GBE_MAC_ADDRESS; #define GBE_VERSION_OFFSET 10 typedef struct GBE_VERSION_ { UINT8 id : 4; UINT8 minor : 4; UINT8 major; } GBE_VERSION; // Restore previous packing rules #pragma pack(pop) #endif // GBE_H UEFITool-A66/common/generated/000077500000000000000000000000001442134156300162275ustar00rootroot00000000000000UEFITool-A66/common/generated/ami_nvar.cpp000066400000000000000000000317321442134156300205350ustar00rootroot00000000000000// This is a generated file! Please edit source .ksy file and use kaitai-struct-compiler to rebuild #include "ami_nvar.h" #include "../kaitai/exceptions.h" ami_nvar_t::ami_nvar_t(kaitai::kstream* p__io, kaitai::kstruct* p__parent, ami_nvar_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = this; (void)p__root; m_entries = nullptr; _read(); } void ami_nvar_t::_read() { m_entries = std::unique_ptr>>(new std::vector>()); { int i = 0; nvar_entry_t* _; do { _ = new nvar_entry_t(m__io, this, m__root); m_entries->push_back(std::move(std::unique_ptr(_))); i++; } while (!( ((_->signature_first() != 78) || (_io()->is_eof())) )); } } ami_nvar_t::~ami_nvar_t() { _clean_up(); } void ami_nvar_t::_clean_up() { } ami_nvar_t::nvar_attributes_t::nvar_attributes_t(kaitai::kstream* p__io, ami_nvar_t::nvar_entry_t* p__parent, ami_nvar_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; _read(); } void ami_nvar_t::nvar_attributes_t::_read() { m_valid = m__io->read_bits_int_be(1); m_auth_write = m__io->read_bits_int_be(1); m_hw_error_record = m__io->read_bits_int_be(1); m_extended_header = m__io->read_bits_int_be(1); m_data_only = m__io->read_bits_int_be(1); m_local_guid = m__io->read_bits_int_be(1); m_ascii_name = m__io->read_bits_int_be(1); m_runtime = m__io->read_bits_int_be(1); } ami_nvar_t::nvar_attributes_t::~nvar_attributes_t() { _clean_up(); } void ami_nvar_t::nvar_attributes_t::_clean_up() { } ami_nvar_t::ucs2_string_t::ucs2_string_t(kaitai::kstream* p__io, ami_nvar_t::nvar_entry_body_t* p__parent, ami_nvar_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; m_ucs2_chars = nullptr; _read(); } void ami_nvar_t::ucs2_string_t::_read() { m_ucs2_chars = std::unique_ptr>(new std::vector()); { int i = 0; uint16_t _; do { _ = m__io->read_u2le(); m_ucs2_chars->push_back(_); i++; } while (!(_ == 0)); } } ami_nvar_t::ucs2_string_t::~ucs2_string_t() { _clean_up(); } void ami_nvar_t::ucs2_string_t::_clean_up() { } ami_nvar_t::nvar_extended_attributes_t::nvar_extended_attributes_t(kaitai::kstream* p__io, ami_nvar_t::nvar_entry_body_t* p__parent, ami_nvar_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; _read(); } void ami_nvar_t::nvar_extended_attributes_t::_read() { m_reserved_high = m__io->read_bits_int_be(2); m_time_based_auth = m__io->read_bits_int_be(1); m_auth_write = m__io->read_bits_int_be(1); m_reserved_low = m__io->read_bits_int_be(3); m_checksum = m__io->read_bits_int_be(1); } ami_nvar_t::nvar_extended_attributes_t::~nvar_extended_attributes_t() { _clean_up(); } void ami_nvar_t::nvar_extended_attributes_t::_clean_up() { } ami_nvar_t::nvar_entry_t::nvar_entry_t(kaitai::kstream* p__io, ami_nvar_t* p__parent, ami_nvar_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; m_attributes = nullptr; m_body = nullptr; m__io__raw_body = nullptr; f_offset = false; f_end_offset = false; _read(); } void ami_nvar_t::nvar_entry_t::_read() { n_invoke_offset = true; if (offset() >= 0) { n_invoke_offset = false; m_invoke_offset = m__io->read_bytes(0); } m_signature_first = m__io->read_u1(); n_signature_rest = true; if (signature_first() == 78) { n_signature_rest = false; m_signature_rest = m__io->read_bytes(3); if (!(signature_rest() == std::string("\x56\x41\x52", 3))) { throw kaitai::validation_not_equal_error(std::string("\x56\x41\x52", 3), signature_rest(), _io(), std::string("/types/nvar_entry/seq/2")); } } n_size = true; if (signature_first() == 78) { n_size = false; m_size = m__io->read_u2le(); { uint16_t _ = size(); if (!(_ > ((4 + 2) + 4))) { throw kaitai::validation_expr_error(size(), _io(), std::string("/types/nvar_entry/seq/3")); } } } n_next = true; if (signature_first() == 78) { n_next = false; m_next = m__io->read_bits_int_le(24); } m__io->align_to_byte(); n_attributes = true; if (signature_first() == 78) { n_attributes = false; m_attributes = std::unique_ptr(new nvar_attributes_t(m__io, this, m__root)); } n_body = true; if (signature_first() == 78) { n_body = false; m__raw_body = m__io->read_bytes((size() - ((4 + 2) + 4))); m__io__raw_body = std::unique_ptr(new kaitai::kstream(m__raw_body)); m_body = std::unique_ptr(new nvar_entry_body_t(m__io__raw_body.get(), this, m__root)); } n_invoke_end_offset = true; if ( ((signature_first() == 78) && (end_offset() >= 0)) ) { n_invoke_end_offset = false; m_invoke_end_offset = m__io->read_bytes(0); } } ami_nvar_t::nvar_entry_t::~nvar_entry_t() { _clean_up(); } void ami_nvar_t::nvar_entry_t::_clean_up() { if (!n_invoke_offset) { } if (!n_signature_rest) { } if (!n_size) { } if (!n_next) { } if (!n_attributes) { } if (!n_body) { } if (!n_invoke_end_offset) { } } int32_t ami_nvar_t::nvar_entry_t::offset() { if (f_offset) return m_offset; m_offset = (int32_t)_io()->pos(); f_offset = true; return m_offset; } int32_t ami_nvar_t::nvar_entry_t::end_offset() { if (f_end_offset) return m_end_offset; m_end_offset = (int32_t)_io()->pos(); f_end_offset = true; return m_end_offset; } ami_nvar_t::nvar_entry_body_t::nvar_entry_body_t(kaitai::kstream* p__io, ami_nvar_t::nvar_entry_t* p__parent, ami_nvar_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; m_ucs2_name = nullptr; m_extended_header_attributes = nullptr; f_extended_header_attributes = false; f_data_start_offset = false; f_extended_header_size_field = false; f_extended_header_timestamp = false; f_data_size = false; f_extended_header_checksum = false; f_data_end_offset = false; f_extended_header_size = false; f_extended_header_hash = false; _read(); } void ami_nvar_t::nvar_entry_body_t::_read() { n_guid_index = true; if ( ((!(_parent()->attributes()->local_guid())) && (!(_parent()->attributes()->data_only())) && (_parent()->attributes()->valid())) ) { n_guid_index = false; m_guid_index = m__io->read_u1(); } n_guid = true; if ( ((_parent()->attributes()->local_guid()) && (!(_parent()->attributes()->data_only())) && (_parent()->attributes()->valid())) ) { n_guid = false; m_guid = m__io->read_bytes(16); } n_ascii_name = true; if ( ((_parent()->attributes()->ascii_name()) && (!(_parent()->attributes()->data_only())) && (_parent()->attributes()->valid())) ) { n_ascii_name = false; m_ascii_name = kaitai::kstream::bytes_to_str(m__io->read_bytes_term(0, false, true, true), std::string("ASCII")); } n_ucs2_name = true; if ( ((!(_parent()->attributes()->ascii_name())) && (!(_parent()->attributes()->data_only())) && (_parent()->attributes()->valid())) ) { n_ucs2_name = false; m_ucs2_name = std::unique_ptr(new ucs2_string_t(m__io, this, m__root)); } n_invoke_data_start = true; if (data_start_offset() >= 0) { n_invoke_data_start = false; m_invoke_data_start = m__io->read_bytes(0); } m_data = m__io->read_bytes_full(); } ami_nvar_t::nvar_entry_body_t::~nvar_entry_body_t() { _clean_up(); } void ami_nvar_t::nvar_entry_body_t::_clean_up() { if (!n_guid_index) { } if (!n_guid) { } if (!n_ascii_name) { } if (!n_ucs2_name) { } if (!n_invoke_data_start) { } if (f_extended_header_attributes && !n_extended_header_attributes) { } if (f_extended_header_size_field && !n_extended_header_size_field) { } if (f_extended_header_timestamp && !n_extended_header_timestamp) { } if (f_extended_header_checksum && !n_extended_header_checksum) { } if (f_extended_header_hash && !n_extended_header_hash) { } } ami_nvar_t::nvar_extended_attributes_t* ami_nvar_t::nvar_entry_body_t::extended_header_attributes() { if (f_extended_header_attributes) return m_extended_header_attributes.get(); n_extended_header_attributes = true; if ( ((_parent()->attributes()->valid()) && (_parent()->attributes()->extended_header()) && (extended_header_size() >= (1 + 2))) ) { n_extended_header_attributes = false; std::streampos _pos = m__io->pos(); m__io->seek((_io()->pos() - extended_header_size())); m_extended_header_attributes = std::unique_ptr(new nvar_extended_attributes_t(m__io, this, m__root)); m__io->seek(_pos); f_extended_header_attributes = true; } return m_extended_header_attributes.get(); } int32_t ami_nvar_t::nvar_entry_body_t::data_start_offset() { if (f_data_start_offset) return m_data_start_offset; m_data_start_offset = (int32_t)_io()->pos(); f_data_start_offset = true; return m_data_start_offset; } uint16_t ami_nvar_t::nvar_entry_body_t::extended_header_size_field() { if (f_extended_header_size_field) return m_extended_header_size_field; n_extended_header_size_field = true; if ( ((_parent()->attributes()->valid()) && (_parent()->attributes()->extended_header()) && (_parent()->size() > (((4 + 2) + 4) + 2))) ) { n_extended_header_size_field = false; std::streampos _pos = m__io->pos(); m__io->seek((_io()->pos() - 2)); m_extended_header_size_field = m__io->read_u2le(); m__io->seek(_pos); f_extended_header_size_field = true; } return m_extended_header_size_field; } uint64_t ami_nvar_t::nvar_entry_body_t::extended_header_timestamp() { if (f_extended_header_timestamp) return m_extended_header_timestamp; n_extended_header_timestamp = true; if ( ((_parent()->attributes()->valid()) && (_parent()->attributes()->extended_header()) && (extended_header_size() >= ((1 + 8) + 2)) && (extended_header_attributes()->time_based_auth())) ) { n_extended_header_timestamp = false; std::streampos _pos = m__io->pos(); m__io->seek(((_io()->pos() - extended_header_size()) + 1)); m_extended_header_timestamp = m__io->read_u8le(); m__io->seek(_pos); f_extended_header_timestamp = true; } return m_extended_header_timestamp; } int32_t ami_nvar_t::nvar_entry_body_t::data_size() { if (f_data_size) return m_data_size; m_data_size = ((data_end_offset() - data_start_offset()) - extended_header_size()); f_data_size = true; return m_data_size; } uint8_t ami_nvar_t::nvar_entry_body_t::extended_header_checksum() { if (f_extended_header_checksum) return m_extended_header_checksum; n_extended_header_checksum = true; if ( ((_parent()->attributes()->valid()) && (_parent()->attributes()->extended_header()) && (extended_header_size() >= ((1 + 1) + 2)) && (extended_header_attributes()->checksum())) ) { n_extended_header_checksum = false; std::streampos _pos = m__io->pos(); m__io->seek(((_io()->pos() - 2) - 1)); m_extended_header_checksum = m__io->read_u1(); m__io->seek(_pos); f_extended_header_checksum = true; } return m_extended_header_checksum; } int32_t ami_nvar_t::nvar_entry_body_t::data_end_offset() { if (f_data_end_offset) return m_data_end_offset; m_data_end_offset = (int32_t)_io()->pos(); f_data_end_offset = true; return m_data_end_offset; } uint16_t ami_nvar_t::nvar_entry_body_t::extended_header_size() { if (f_extended_header_size) return m_extended_header_size; m_extended_header_size = ((_parent()->attributes()->extended_header()) ? (((extended_header_size_field() >= (1 + 2)) ? (extended_header_size_field()) : (0))) : (0)); f_extended_header_size = true; return m_extended_header_size; } std::string ami_nvar_t::nvar_entry_body_t::extended_header_hash() { if (f_extended_header_hash) return m_extended_header_hash; n_extended_header_hash = true; if ( ((_parent()->attributes()->valid()) && (_parent()->attributes()->extended_header()) && (extended_header_size() >= (((1 + 8) + 32) + 2)) && (extended_header_attributes()->time_based_auth()) && (!(_parent()->attributes()->data_only()))) ) { n_extended_header_hash = false; std::streampos _pos = m__io->pos(); m__io->seek((((_io()->pos() - extended_header_size()) + 1) + 8)); m_extended_header_hash = m__io->read_bytes(32); m__io->seek(_pos); f_extended_header_hash = true; } return m_extended_header_hash; } UEFITool-A66/common/generated/ami_nvar.h000066400000000000000000000251611442134156300202010ustar00rootroot00000000000000#pragma once // This is a generated file! Please edit source .ksy file and use kaitai-struct-compiler to rebuild #include "../kaitai/kaitaistruct.h" #include #include #include #if KAITAI_STRUCT_VERSION < 9000L #error "Incompatible Kaitai Struct C++/STL API: version 0.9 or later is required" #endif class ami_nvar_t : public kaitai::kstruct { public: class nvar_attributes_t; class ucs2_string_t; class nvar_extended_attributes_t; class nvar_entry_t; class nvar_entry_body_t; ami_nvar_t(kaitai::kstream* p__io, kaitai::kstruct* p__parent = nullptr, ami_nvar_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~ami_nvar_t(); class nvar_attributes_t : public kaitai::kstruct { public: nvar_attributes_t(kaitai::kstream* p__io, ami_nvar_t::nvar_entry_t* p__parent = nullptr, ami_nvar_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~nvar_attributes_t(); private: bool m_valid; bool m_auth_write; bool m_hw_error_record; bool m_extended_header; bool m_data_only; bool m_local_guid; bool m_ascii_name; bool m_runtime; ami_nvar_t* m__root; ami_nvar_t::nvar_entry_t* m__parent; public: bool valid() const { return m_valid; } bool auth_write() const { return m_auth_write; } bool hw_error_record() const { return m_hw_error_record; } bool extended_header() const { return m_extended_header; } bool data_only() const { return m_data_only; } bool local_guid() const { return m_local_guid; } bool ascii_name() const { return m_ascii_name; } bool runtime() const { return m_runtime; } ami_nvar_t* _root() const { return m__root; } ami_nvar_t::nvar_entry_t* _parent() const { return m__parent; } }; class ucs2_string_t : public kaitai::kstruct { public: ucs2_string_t(kaitai::kstream* p__io, ami_nvar_t::nvar_entry_body_t* p__parent = nullptr, ami_nvar_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~ucs2_string_t(); private: std::unique_ptr> m_ucs2_chars; ami_nvar_t* m__root; ami_nvar_t::nvar_entry_body_t* m__parent; public: std::vector* ucs2_chars() const { return m_ucs2_chars.get(); } ami_nvar_t* _root() const { return m__root; } ami_nvar_t::nvar_entry_body_t* _parent() const { return m__parent; } }; class nvar_extended_attributes_t : public kaitai::kstruct { public: nvar_extended_attributes_t(kaitai::kstream* p__io, ami_nvar_t::nvar_entry_body_t* p__parent = nullptr, ami_nvar_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~nvar_extended_attributes_t(); private: uint64_t m_reserved_high; bool m_time_based_auth; bool m_auth_write; uint64_t m_reserved_low; bool m_checksum; ami_nvar_t* m__root; ami_nvar_t::nvar_entry_body_t* m__parent; public: uint64_t reserved_high() const { return m_reserved_high; } bool time_based_auth() const { return m_time_based_auth; } bool auth_write() const { return m_auth_write; } uint64_t reserved_low() const { return m_reserved_low; } bool checksum() const { return m_checksum; } ami_nvar_t* _root() const { return m__root; } ami_nvar_t::nvar_entry_body_t* _parent() const { return m__parent; } }; class nvar_entry_t : public kaitai::kstruct { public: nvar_entry_t(kaitai::kstream* p__io, ami_nvar_t* p__parent = nullptr, ami_nvar_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~nvar_entry_t(); private: bool f_offset; int32_t m_offset; public: int32_t offset(); private: bool f_end_offset; int32_t m_end_offset; public: int32_t end_offset(); private: std::string m_invoke_offset; bool n_invoke_offset; public: bool _is_null_invoke_offset() { invoke_offset(); return n_invoke_offset; }; private: uint8_t m_signature_first; std::string m_signature_rest; bool n_signature_rest; public: bool _is_null_signature_rest() { signature_rest(); return n_signature_rest; }; private: uint16_t m_size; bool n_size; public: bool _is_null_size() { size(); return n_size; }; private: uint64_t m_next; bool n_next; public: bool _is_null_next() { next(); return n_next; }; private: std::unique_ptr m_attributes; bool n_attributes; public: bool _is_null_attributes() { attributes(); return n_attributes; }; private: std::unique_ptr m_body; bool n_body; public: bool _is_null_body() { body(); return n_body; }; private: std::string m_invoke_end_offset; bool n_invoke_end_offset; public: bool _is_null_invoke_end_offset() { invoke_end_offset(); return n_invoke_end_offset; }; private: ami_nvar_t* m__root; ami_nvar_t* m__parent; std::string m__raw_body; bool n__raw_body; public: bool _is_null__raw_body() { _raw_body(); return n__raw_body; }; private: std::unique_ptr m__io__raw_body; public: std::string invoke_offset() const { return m_invoke_offset; } uint8_t signature_first() const { return m_signature_first; } std::string signature_rest() const { return m_signature_rest; } uint16_t size() const { return m_size; } uint64_t next() const { return m_next; } nvar_attributes_t* attributes() const { return m_attributes.get(); } nvar_entry_body_t* body() const { return m_body.get(); } std::string invoke_end_offset() const { return m_invoke_end_offset; } ami_nvar_t* _root() const { return m__root; } ami_nvar_t* _parent() const { return m__parent; } std::string _raw_body() const { return m__raw_body; } kaitai::kstream* _io__raw_body() const { return m__io__raw_body.get(); } }; class nvar_entry_body_t : public kaitai::kstruct { public: nvar_entry_body_t(kaitai::kstream* p__io, ami_nvar_t::nvar_entry_t* p__parent = nullptr, ami_nvar_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~nvar_entry_body_t(); private: bool f_extended_header_attributes; std::unique_ptr m_extended_header_attributes; bool n_extended_header_attributes; public: bool _is_null_extended_header_attributes() { extended_header_attributes(); return n_extended_header_attributes; }; private: public: nvar_extended_attributes_t* extended_header_attributes(); private: bool f_data_start_offset; int32_t m_data_start_offset; public: int32_t data_start_offset(); private: bool f_extended_header_size_field; uint16_t m_extended_header_size_field; bool n_extended_header_size_field; public: bool _is_null_extended_header_size_field() { extended_header_size_field(); return n_extended_header_size_field; }; private: public: uint16_t extended_header_size_field(); private: bool f_extended_header_timestamp; uint64_t m_extended_header_timestamp; bool n_extended_header_timestamp; public: bool _is_null_extended_header_timestamp() { extended_header_timestamp(); return n_extended_header_timestamp; }; private: public: uint64_t extended_header_timestamp(); private: bool f_data_size; int32_t m_data_size; public: int32_t data_size(); private: bool f_extended_header_checksum; uint8_t m_extended_header_checksum; bool n_extended_header_checksum; public: bool _is_null_extended_header_checksum() { extended_header_checksum(); return n_extended_header_checksum; }; private: public: uint8_t extended_header_checksum(); private: bool f_data_end_offset; int32_t m_data_end_offset; public: int32_t data_end_offset(); private: bool f_extended_header_size; uint16_t m_extended_header_size; public: uint16_t extended_header_size(); private: bool f_extended_header_hash; std::string m_extended_header_hash; bool n_extended_header_hash; public: bool _is_null_extended_header_hash() { extended_header_hash(); return n_extended_header_hash; }; private: public: std::string extended_header_hash(); private: uint8_t m_guid_index; bool n_guid_index; public: bool _is_null_guid_index() { guid_index(); return n_guid_index; }; private: std::string m_guid; bool n_guid; public: bool _is_null_guid() { guid(); return n_guid; }; private: std::string m_ascii_name; bool n_ascii_name; public: bool _is_null_ascii_name() { ascii_name(); return n_ascii_name; }; private: std::unique_ptr m_ucs2_name; bool n_ucs2_name; public: bool _is_null_ucs2_name() { ucs2_name(); return n_ucs2_name; }; private: std::string m_invoke_data_start; bool n_invoke_data_start; public: bool _is_null_invoke_data_start() { invoke_data_start(); return n_invoke_data_start; }; private: std::string m_data; ami_nvar_t* m__root; ami_nvar_t::nvar_entry_t* m__parent; public: uint8_t guid_index() const { return m_guid_index; } std::string guid() const { return m_guid; } std::string ascii_name() const { return m_ascii_name; } ucs2_string_t* ucs2_name() const { return m_ucs2_name.get(); } std::string invoke_data_start() const { return m_invoke_data_start; } std::string data() const { return m_data; } ami_nvar_t* _root() const { return m__root; } ami_nvar_t::nvar_entry_t* _parent() const { return m__parent; } }; private: std::unique_ptr>> m_entries; ami_nvar_t* m__root; kaitai::kstruct* m__parent; public: std::vector>* entries() const { return m_entries.get(); } ami_nvar_t* _root() const { return m__root; } kaitai::kstruct* _parent() const { return m__parent; } }; UEFITool-A66/common/generated/intel_acbp_v1.cpp000066400000000000000000000262471442134156300214540ustar00rootroot00000000000000// This is a generated file! Please edit source .ksy file and use kaitai-struct-compiler to rebuild #include "intel_acbp_v1.h" #include "../kaitai/exceptions.h" intel_acbp_v1_t::intel_acbp_v1_t(kaitai::kstream* p__io, kaitai::kstruct* p__parent, intel_acbp_v1_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = this; (void)p__root; m_elements = nullptr; _read(); } void intel_acbp_v1_t::_read() { m_structure_id = static_cast(m__io->read_u8le()); if (!(structure_id() == intel_acbp_v1_t::STRUCTURE_IDS_ACBP)) { throw kaitai::validation_not_equal_error(intel_acbp_v1_t::STRUCTURE_IDS_ACBP, structure_id(), _io(), std::string("/seq/0")); } m_version = m__io->read_u1(); { uint8_t _ = version(); if (!(_ < 32)) { throw kaitai::validation_expr_error(version(), _io(), std::string("/seq/1")); } } m_reserved0 = m__io->read_u1(); m_bpm_revision = m__io->read_u1(); m_bp_svn = m__io->read_u1(); m_acm_svn = m__io->read_u1(); m_reserved1 = m__io->read_u1(); m_nem_data_size = m__io->read_u2le(); m_elements = std::unique_ptr>>(new std::vector>()); { int i = 0; acbp_element_t* _; do { _ = new acbp_element_t(m__io, this, m__root); m_elements->push_back(std::move(std::unique_ptr(_))); i++; } while (!( ((_->header()->structure_id() == intel_acbp_v1_t::STRUCTURE_IDS_PMSG) || (_io()->is_eof())) )); } } intel_acbp_v1_t::~intel_acbp_v1_t() { _clean_up(); } void intel_acbp_v1_t::_clean_up() { } intel_acbp_v1_t::pmsg_body_t::pmsg_body_t(kaitai::kstream* p__io, intel_acbp_v1_t::acbp_element_t* p__parent, intel_acbp_v1_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; m_public_key = nullptr; m_signature = nullptr; _read(); } void intel_acbp_v1_t::pmsg_body_t::_read() { m_version = m__io->read_u1(); m_key_id = m__io->read_u2le(); m_public_key = std::unique_ptr(new public_key_t(m__io, this, m__root)); m_sig_scheme = m__io->read_u2le(); m_signature = std::unique_ptr(new signature_t(m__io, this, m__root)); } intel_acbp_v1_t::pmsg_body_t::~pmsg_body_t() { _clean_up(); } void intel_acbp_v1_t::pmsg_body_t::_clean_up() { } intel_acbp_v1_t::acbp_element_t::acbp_element_t(kaitai::kstream* p__io, intel_acbp_v1_t* p__parent, intel_acbp_v1_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; m_header = nullptr; m_ibbs_body = nullptr; m_pmda_body = nullptr; m_pmsg_body = nullptr; _read(); } void intel_acbp_v1_t::acbp_element_t::_read() { m_header = std::unique_ptr(new common_header_t(m__io, this, m__root)); n_ibbs_body = true; if (header()->structure_id() == intel_acbp_v1_t::STRUCTURE_IDS_IBBS) { n_ibbs_body = false; m_ibbs_body = std::unique_ptr(new ibbs_body_t(m__io, this, m__root)); } n_pmda_body = true; if (header()->structure_id() == intel_acbp_v1_t::STRUCTURE_IDS_PMDA) { n_pmda_body = false; m_pmda_body = std::unique_ptr(new pmda_body_t(m__io, this, m__root)); } n_pmsg_body = true; if (header()->structure_id() == intel_acbp_v1_t::STRUCTURE_IDS_PMSG) { n_pmsg_body = false; m_pmsg_body = std::unique_ptr(new pmsg_body_t(m__io, this, m__root)); } n_invalid_body = true; if ( ((header()->structure_id() != intel_acbp_v1_t::STRUCTURE_IDS_PMSG) && (header()->structure_id() != intel_acbp_v1_t::STRUCTURE_IDS_PMDA) && (header()->structure_id() != intel_acbp_v1_t::STRUCTURE_IDS_IBBS)) ) { n_invalid_body = false; m_invalid_body = m__io->read_bytes(0); { std::string _ = invalid_body(); if (!(false)) { throw kaitai::validation_expr_error(invalid_body(), _io(), std::string("/types/acbp_element/seq/4")); } } } } intel_acbp_v1_t::acbp_element_t::~acbp_element_t() { _clean_up(); } void intel_acbp_v1_t::acbp_element_t::_clean_up() { if (!n_ibbs_body) { } if (!n_pmda_body) { } if (!n_pmsg_body) { } if (!n_invalid_body) { } } intel_acbp_v1_t::common_header_t::common_header_t(kaitai::kstream* p__io, intel_acbp_v1_t::acbp_element_t* p__parent, intel_acbp_v1_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; _read(); } void intel_acbp_v1_t::common_header_t::_read() { m_structure_id = static_cast(m__io->read_u8le()); m_version = m__io->read_u1(); } intel_acbp_v1_t::common_header_t::~common_header_t() { _clean_up(); } void intel_acbp_v1_t::common_header_t::_clean_up() { } intel_acbp_v1_t::signature_t::signature_t(kaitai::kstream* p__io, intel_acbp_v1_t::pmsg_body_t* p__parent, intel_acbp_v1_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; _read(); } void intel_acbp_v1_t::signature_t::_read() { m_version = m__io->read_u1(); m_size_bits = m__io->read_u2le(); m_hash_algorithm_id = m__io->read_u2le(); m_signature = m__io->read_bytes((size_bits() / 8)); } intel_acbp_v1_t::signature_t::~signature_t() { _clean_up(); } void intel_acbp_v1_t::signature_t::_clean_up() { } intel_acbp_v1_t::pmda_entry_v1_t::pmda_entry_v1_t(kaitai::kstream* p__io, intel_acbp_v1_t::pmda_body_t* p__parent, intel_acbp_v1_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; _read(); } void intel_acbp_v1_t::pmda_entry_v1_t::_read() { m_base = m__io->read_u4le(); m_size = m__io->read_u4le(); m_hash = m__io->read_bytes(32); } intel_acbp_v1_t::pmda_entry_v1_t::~pmda_entry_v1_t() { _clean_up(); } void intel_acbp_v1_t::pmda_entry_v1_t::_clean_up() { } intel_acbp_v1_t::ibb_segment_t::ibb_segment_t(kaitai::kstream* p__io, intel_acbp_v1_t::ibbs_body_t* p__parent, intel_acbp_v1_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; _read(); } void intel_acbp_v1_t::ibb_segment_t::_read() { m_reserved = m__io->read_u2le(); m_flags = m__io->read_u2le(); m_base = m__io->read_u4le(); m_size = m__io->read_u4le(); } intel_acbp_v1_t::ibb_segment_t::~ibb_segment_t() { _clean_up(); } void intel_acbp_v1_t::ibb_segment_t::_clean_up() { } intel_acbp_v1_t::public_key_t::public_key_t(kaitai::kstream* p__io, intel_acbp_v1_t::pmsg_body_t* p__parent, intel_acbp_v1_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; _read(); } void intel_acbp_v1_t::public_key_t::_read() { m_version = m__io->read_u1(); m_size_bits = m__io->read_u2le(); m_exponent = m__io->read_u4le(); m_modulus = m__io->read_bytes((size_bits() / 8)); } intel_acbp_v1_t::public_key_t::~public_key_t() { _clean_up(); } void intel_acbp_v1_t::public_key_t::_clean_up() { } intel_acbp_v1_t::hash_t::hash_t(kaitai::kstream* p__io, kaitai::kstruct* p__parent, intel_acbp_v1_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; _read(); } void intel_acbp_v1_t::hash_t::_read() { m_hash_algorithm_id = m__io->read_u2le(); m_len_hash = m__io->read_u2le(); m_hash = m__io->read_bytes(32); } intel_acbp_v1_t::hash_t::~hash_t() { _clean_up(); } void intel_acbp_v1_t::hash_t::_clean_up() { } intel_acbp_v1_t::pmda_entry_v2_t::pmda_entry_v2_t(kaitai::kstream* p__io, intel_acbp_v1_t::pmda_body_t* p__parent, intel_acbp_v1_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; m_hash = nullptr; _read(); } void intel_acbp_v1_t::pmda_entry_v2_t::_read() { m_base = m__io->read_u4le(); m_size = m__io->read_u4le(); m_hash = std::unique_ptr(new hash_t(m__io, this, m__root)); } intel_acbp_v1_t::pmda_entry_v2_t::~pmda_entry_v2_t() { _clean_up(); } void intel_acbp_v1_t::pmda_entry_v2_t::_clean_up() { } intel_acbp_v1_t::ibbs_body_t::ibbs_body_t(kaitai::kstream* p__io, intel_acbp_v1_t::acbp_element_t* p__parent, intel_acbp_v1_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; m_reserved = nullptr; m_post_ibb_hash = nullptr; m_ibb_hash = nullptr; m_ibb_segments = nullptr; _read(); } void intel_acbp_v1_t::ibbs_body_t::_read() { m_reserved = std::unique_ptr>(new std::vector()); const int l_reserved = 3; for (int i = 0; i < l_reserved; i++) { m_reserved->push_back(std::move(m__io->read_u1())); } m_flags = m__io->read_u4le(); m_mch_bar = m__io->read_u8le(); m_vtd_bar = m__io->read_u8le(); m_dma_protection_base0 = m__io->read_u4le(); m_dma_protection_limit0 = m__io->read_u4le(); m_dma_protection_base1 = m__io->read_u8le(); m_dma_protection_limit1 = m__io->read_u8le(); m_post_ibb_hash = std::unique_ptr(new hash_t(m__io, this, m__root)); m_ibb_entry_point = m__io->read_u4le(); m_ibb_hash = std::unique_ptr(new hash_t(m__io, this, m__root)); m_num_ibb_segments = m__io->read_u1(); m_ibb_segments = std::unique_ptr>>(new std::vector>()); const int l_ibb_segments = num_ibb_segments(); for (int i = 0; i < l_ibb_segments; i++) { m_ibb_segments->push_back(std::move(std::unique_ptr(new ibb_segment_t(m__io, this, m__root)))); } } intel_acbp_v1_t::ibbs_body_t::~ibbs_body_t() { _clean_up(); } void intel_acbp_v1_t::ibbs_body_t::_clean_up() { } intel_acbp_v1_t::pmda_body_t::pmda_body_t(kaitai::kstream* p__io, intel_acbp_v1_t::acbp_element_t* p__parent, intel_acbp_v1_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; m_entries_v1 = nullptr; m_entries_v2 = nullptr; _read(); } void intel_acbp_v1_t::pmda_body_t::_read() { m_total_size = m__io->read_u2le(); m_version = m__io->read_u4le(); m_num_entries = m__io->read_u4le(); n_entries_v1 = true; if (version() == 1) { n_entries_v1 = false; m_entries_v1 = std::unique_ptr>>(new std::vector>()); const int l_entries_v1 = num_entries(); for (int i = 0; i < l_entries_v1; i++) { m_entries_v1->push_back(std::move(std::unique_ptr(new pmda_entry_v1_t(m__io, this, m__root)))); } } n_entries_v2 = true; if (version() == 2) { n_entries_v2 = false; m_entries_v2 = std::unique_ptr>>(new std::vector>()); const int l_entries_v2 = num_entries(); for (int i = 0; i < l_entries_v2; i++) { m_entries_v2->push_back(std::move(std::unique_ptr(new pmda_entry_v2_t(m__io, this, m__root)))); } } } intel_acbp_v1_t::pmda_body_t::~pmda_body_t() { _clean_up(); } void intel_acbp_v1_t::pmda_body_t::_clean_up() { if (!n_entries_v1) { } if (!n_entries_v2) { } } UEFITool-A66/common/generated/intel_acbp_v1.h000066400000000000000000000336421442134156300211160ustar00rootroot00000000000000#pragma once // This is a generated file! Please edit source .ksy file and use kaitai-struct-compiler to rebuild #include "../kaitai/kaitaistruct.h" #include #include #include #if KAITAI_STRUCT_VERSION < 9000L #error "Incompatible Kaitai Struct C++/STL API: version 0.9 or later is required" #endif class intel_acbp_v1_t : public kaitai::kstruct { public: class pmsg_body_t; class acbp_element_t; class common_header_t; class signature_t; class pmda_entry_v1_t; class ibb_segment_t; class public_key_t; class hash_t; class pmda_entry_v2_t; class ibbs_body_t; class pmda_body_t; enum ibb_segment_type_t { IBB_SEGMENT_TYPE_IBB = 0, IBB_SEGMENT_TYPE_NON_IBB = 1 }; enum structure_ids_t : uint64_t { STRUCTURE_IDS_PMDA = 6872283318001360735LL, STRUCTURE_IDS_PMSG = 6872289979495636831LL, STRUCTURE_IDS_ACBP = 6872299801917087583LL, STRUCTURE_IDS_IBBS = 6872303100435717983LL }; intel_acbp_v1_t(kaitai::kstream* p__io, kaitai::kstruct* p__parent = nullptr, intel_acbp_v1_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~intel_acbp_v1_t(); class pmsg_body_t : public kaitai::kstruct { public: pmsg_body_t(kaitai::kstream* p__io, intel_acbp_v1_t::acbp_element_t* p__parent = nullptr, intel_acbp_v1_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~pmsg_body_t(); private: uint8_t m_version; uint16_t m_key_id; std::unique_ptr m_public_key; uint16_t m_sig_scheme; std::unique_ptr m_signature; intel_acbp_v1_t* m__root; intel_acbp_v1_t::acbp_element_t* m__parent; public: uint8_t version() const { return m_version; } uint16_t key_id() const { return m_key_id; } public_key_t* public_key() const { return m_public_key.get(); } uint16_t sig_scheme() const { return m_sig_scheme; } signature_t* signature() const { return m_signature.get(); } intel_acbp_v1_t* _root() const { return m__root; } intel_acbp_v1_t::acbp_element_t* _parent() const { return m__parent; } }; class acbp_element_t : public kaitai::kstruct { public: acbp_element_t(kaitai::kstream* p__io, intel_acbp_v1_t* p__parent = nullptr, intel_acbp_v1_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~acbp_element_t(); private: std::unique_ptr m_header; std::unique_ptr m_ibbs_body; bool n_ibbs_body; public: bool _is_null_ibbs_body() { ibbs_body(); return n_ibbs_body; }; private: std::unique_ptr m_pmda_body; bool n_pmda_body; public: bool _is_null_pmda_body() { pmda_body(); return n_pmda_body; }; private: std::unique_ptr m_pmsg_body; bool n_pmsg_body; public: bool _is_null_pmsg_body() { pmsg_body(); return n_pmsg_body; }; private: std::string m_invalid_body; bool n_invalid_body; public: bool _is_null_invalid_body() { invalid_body(); return n_invalid_body; }; private: intel_acbp_v1_t* m__root; intel_acbp_v1_t* m__parent; public: common_header_t* header() const { return m_header.get(); } ibbs_body_t* ibbs_body() const { return m_ibbs_body.get(); } pmda_body_t* pmda_body() const { return m_pmda_body.get(); } pmsg_body_t* pmsg_body() const { return m_pmsg_body.get(); } std::string invalid_body() const { return m_invalid_body; } intel_acbp_v1_t* _root() const { return m__root; } intel_acbp_v1_t* _parent() const { return m__parent; } }; class common_header_t : public kaitai::kstruct { public: common_header_t(kaitai::kstream* p__io, intel_acbp_v1_t::acbp_element_t* p__parent = nullptr, intel_acbp_v1_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~common_header_t(); private: structure_ids_t m_structure_id; uint8_t m_version; intel_acbp_v1_t* m__root; intel_acbp_v1_t::acbp_element_t* m__parent; public: structure_ids_t structure_id() const { return m_structure_id; } uint8_t version() const { return m_version; } intel_acbp_v1_t* _root() const { return m__root; } intel_acbp_v1_t::acbp_element_t* _parent() const { return m__parent; } }; class signature_t : public kaitai::kstruct { public: signature_t(kaitai::kstream* p__io, intel_acbp_v1_t::pmsg_body_t* p__parent = nullptr, intel_acbp_v1_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~signature_t(); private: uint8_t m_version; uint16_t m_size_bits; uint16_t m_hash_algorithm_id; std::string m_signature; intel_acbp_v1_t* m__root; intel_acbp_v1_t::pmsg_body_t* m__parent; public: uint8_t version() const { return m_version; } uint16_t size_bits() const { return m_size_bits; } uint16_t hash_algorithm_id() const { return m_hash_algorithm_id; } std::string signature() const { return m_signature; } intel_acbp_v1_t* _root() const { return m__root; } intel_acbp_v1_t::pmsg_body_t* _parent() const { return m__parent; } }; class pmda_entry_v1_t : public kaitai::kstruct { public: pmda_entry_v1_t(kaitai::kstream* p__io, intel_acbp_v1_t::pmda_body_t* p__parent = nullptr, intel_acbp_v1_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~pmda_entry_v1_t(); private: uint32_t m_base; uint32_t m_size; std::string m_hash; intel_acbp_v1_t* m__root; intel_acbp_v1_t::pmda_body_t* m__parent; public: uint32_t base() const { return m_base; } uint32_t size() const { return m_size; } std::string hash() const { return m_hash; } intel_acbp_v1_t* _root() const { return m__root; } intel_acbp_v1_t::pmda_body_t* _parent() const { return m__parent; } }; class ibb_segment_t : public kaitai::kstruct { public: ibb_segment_t(kaitai::kstream* p__io, intel_acbp_v1_t::ibbs_body_t* p__parent = nullptr, intel_acbp_v1_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~ibb_segment_t(); private: uint16_t m_reserved; uint16_t m_flags; uint32_t m_base; uint32_t m_size; intel_acbp_v1_t* m__root; intel_acbp_v1_t::ibbs_body_t* m__parent; public: uint16_t reserved() const { return m_reserved; } uint16_t flags() const { return m_flags; } uint32_t base() const { return m_base; } uint32_t size() const { return m_size; } intel_acbp_v1_t* _root() const { return m__root; } intel_acbp_v1_t::ibbs_body_t* _parent() const { return m__parent; } }; class public_key_t : public kaitai::kstruct { public: public_key_t(kaitai::kstream* p__io, intel_acbp_v1_t::pmsg_body_t* p__parent = nullptr, intel_acbp_v1_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~public_key_t(); private: uint8_t m_version; uint16_t m_size_bits; uint32_t m_exponent; std::string m_modulus; intel_acbp_v1_t* m__root; intel_acbp_v1_t::pmsg_body_t* m__parent; public: uint8_t version() const { return m_version; } uint16_t size_bits() const { return m_size_bits; } uint32_t exponent() const { return m_exponent; } std::string modulus() const { return m_modulus; } intel_acbp_v1_t* _root() const { return m__root; } intel_acbp_v1_t::pmsg_body_t* _parent() const { return m__parent; } }; class hash_t : public kaitai::kstruct { public: hash_t(kaitai::kstream* p__io, kaitai::kstruct* p__parent = nullptr, intel_acbp_v1_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~hash_t(); private: uint16_t m_hash_algorithm_id; uint16_t m_len_hash; std::string m_hash; intel_acbp_v1_t* m__root; kaitai::kstruct* m__parent; public: uint16_t hash_algorithm_id() const { return m_hash_algorithm_id; } uint16_t len_hash() const { return m_len_hash; } std::string hash() const { return m_hash; } intel_acbp_v1_t* _root() const { return m__root; } kaitai::kstruct* _parent() const { return m__parent; } }; class pmda_entry_v2_t : public kaitai::kstruct { public: pmda_entry_v2_t(kaitai::kstream* p__io, intel_acbp_v1_t::pmda_body_t* p__parent = nullptr, intel_acbp_v1_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~pmda_entry_v2_t(); private: uint32_t m_base; uint32_t m_size; std::unique_ptr m_hash; intel_acbp_v1_t* m__root; intel_acbp_v1_t::pmda_body_t* m__parent; public: uint32_t base() const { return m_base; } uint32_t size() const { return m_size; } hash_t* hash() const { return m_hash.get(); } intel_acbp_v1_t* _root() const { return m__root; } intel_acbp_v1_t::pmda_body_t* _parent() const { return m__parent; } }; class ibbs_body_t : public kaitai::kstruct { public: ibbs_body_t(kaitai::kstream* p__io, intel_acbp_v1_t::acbp_element_t* p__parent = nullptr, intel_acbp_v1_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~ibbs_body_t(); private: std::unique_ptr> m_reserved; uint32_t m_flags; uint64_t m_mch_bar; uint64_t m_vtd_bar; uint32_t m_dma_protection_base0; uint32_t m_dma_protection_limit0; uint64_t m_dma_protection_base1; uint64_t m_dma_protection_limit1; std::unique_ptr m_post_ibb_hash; uint32_t m_ibb_entry_point; std::unique_ptr m_ibb_hash; uint8_t m_num_ibb_segments; std::unique_ptr>> m_ibb_segments; intel_acbp_v1_t* m__root; intel_acbp_v1_t::acbp_element_t* m__parent; public: std::vector* reserved() const { return m_reserved.get(); } uint32_t flags() const { return m_flags; } uint64_t mch_bar() const { return m_mch_bar; } uint64_t vtd_bar() const { return m_vtd_bar; } uint32_t dma_protection_base0() const { return m_dma_protection_base0; } uint32_t dma_protection_limit0() const { return m_dma_protection_limit0; } uint64_t dma_protection_base1() const { return m_dma_protection_base1; } uint64_t dma_protection_limit1() const { return m_dma_protection_limit1; } hash_t* post_ibb_hash() const { return m_post_ibb_hash.get(); } uint32_t ibb_entry_point() const { return m_ibb_entry_point; } hash_t* ibb_hash() const { return m_ibb_hash.get(); } uint8_t num_ibb_segments() const { return m_num_ibb_segments; } std::vector>* ibb_segments() const { return m_ibb_segments.get(); } intel_acbp_v1_t* _root() const { return m__root; } intel_acbp_v1_t::acbp_element_t* _parent() const { return m__parent; } }; class pmda_body_t : public kaitai::kstruct { public: pmda_body_t(kaitai::kstream* p__io, intel_acbp_v1_t::acbp_element_t* p__parent = nullptr, intel_acbp_v1_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~pmda_body_t(); private: uint16_t m_total_size; uint32_t m_version; uint32_t m_num_entries; std::unique_ptr>> m_entries_v1; bool n_entries_v1; public: bool _is_null_entries_v1() { entries_v1(); return n_entries_v1; }; private: std::unique_ptr>> m_entries_v2; bool n_entries_v2; public: bool _is_null_entries_v2() { entries_v2(); return n_entries_v2; }; private: intel_acbp_v1_t* m__root; intel_acbp_v1_t::acbp_element_t* m__parent; public: uint16_t total_size() const { return m_total_size; } uint32_t version() const { return m_version; } uint32_t num_entries() const { return m_num_entries; } std::vector>* entries_v1() const { return m_entries_v1.get(); } std::vector>* entries_v2() const { return m_entries_v2.get(); } intel_acbp_v1_t* _root() const { return m__root; } intel_acbp_v1_t::acbp_element_t* _parent() const { return m__parent; } }; private: structure_ids_t m_structure_id; uint8_t m_version; uint8_t m_reserved0; uint8_t m_bpm_revision; uint8_t m_bp_svn; uint8_t m_acm_svn; uint8_t m_reserved1; uint16_t m_nem_data_size; std::unique_ptr>> m_elements; intel_acbp_v1_t* m__root; kaitai::kstruct* m__parent; public: structure_ids_t structure_id() const { return m_structure_id; } uint8_t version() const { return m_version; } uint8_t reserved0() const { return m_reserved0; } uint8_t bpm_revision() const { return m_bpm_revision; } uint8_t bp_svn() const { return m_bp_svn; } uint8_t acm_svn() const { return m_acm_svn; } uint8_t reserved1() const { return m_reserved1; } uint16_t nem_data_size() const { return m_nem_data_size; } std::vector>* elements() const { return m_elements.get(); } intel_acbp_v1_t* _root() const { return m__root; } kaitai::kstruct* _parent() const { return m__parent; } }; UEFITool-A66/common/generated/intel_acbp_v2.cpp000066400000000000000000000256051442134156300214520ustar00rootroot00000000000000// This is a generated file! Please edit source .ksy file and use kaitai-struct-compiler to rebuild #include "intel_acbp_v2.h" #include "../kaitai/exceptions.h" intel_acbp_v2_t::intel_acbp_v2_t(kaitai::kstream* p__io, kaitai::kstruct* p__parent, intel_acbp_v2_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = this; (void)p__root; m_elements = nullptr; m_key_signature = nullptr; _read(); } void intel_acbp_v2_t::_read() { m_structure_id = static_cast(m__io->read_u8le()); if (!(structure_id() == intel_acbp_v2_t::STRUCTURE_IDS_ACBP)) { throw kaitai::validation_not_equal_error(intel_acbp_v2_t::STRUCTURE_IDS_ACBP, structure_id(), _io(), std::string("/seq/0")); } m_version = m__io->read_u1(); { uint8_t _ = version(); if (!(_ >= 32)) { throw kaitai::validation_expr_error(version(), _io(), std::string("/seq/1")); } } m_header_specific = m__io->read_u1(); m_total_size = m__io->read_u2le(); if (!(total_size() == 20)) { throw kaitai::validation_not_equal_error(20, total_size(), _io(), std::string("/seq/3")); } m_key_signature_offset = m__io->read_u2le(); m_bpm_revision = m__io->read_u1(); m_bp_svn = m__io->read_u1(); m_acm_svn = m__io->read_u1(); m_reserved = m__io->read_u1(); m_nem_data_size = m__io->read_u2le(); m_elements = std::unique_ptr>>(new std::vector>()); { int i = 0; acbp_element_t* _; do { _ = new acbp_element_t(m__io, this, m__root); m_elements->push_back(std::move(std::unique_ptr(_))); i++; } while (!( ((_->header()->total_size() == 0) || (_->header()->structure_id() == intel_acbp_v2_t::STRUCTURE_IDS_PMSG)) )); } m_key_signature = std::unique_ptr(new key_signature_t(m__io, this, m__root)); } intel_acbp_v2_t::~intel_acbp_v2_t() { _clean_up(); } void intel_acbp_v2_t::_clean_up() { } intel_acbp_v2_t::acbp_element_t::acbp_element_t(kaitai::kstream* p__io, intel_acbp_v2_t* p__parent, intel_acbp_v2_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; m_header = nullptr; m_ibbs_body = nullptr; m_pmda_body = nullptr; _read(); } void intel_acbp_v2_t::acbp_element_t::_read() { m_header = std::unique_ptr(new header_t(m__io, this, m__root)); n_ibbs_body = true; if ( ((header()->structure_id() == intel_acbp_v2_t::STRUCTURE_IDS_IBBS) && (header()->total_size() >= 12)) ) { n_ibbs_body = false; m_ibbs_body = std::unique_ptr(new ibbs_body_t(m__io, this, m__root)); } n_pmda_body = true; if ( ((header()->structure_id() == intel_acbp_v2_t::STRUCTURE_IDS_PMDA) && (header()->total_size() >= 12)) ) { n_pmda_body = false; m_pmda_body = std::unique_ptr(new pmda_body_t(m__io, this, m__root)); } n_generic_body = true; if ( ((header()->structure_id() != intel_acbp_v2_t::STRUCTURE_IDS_IBBS) && (header()->structure_id() != intel_acbp_v2_t::STRUCTURE_IDS_PMDA) && (header()->total_size() >= 12)) ) { n_generic_body = false; m_generic_body = m__io->read_bytes((header()->total_size() - 12)); } } intel_acbp_v2_t::acbp_element_t::~acbp_element_t() { _clean_up(); } void intel_acbp_v2_t::acbp_element_t::_clean_up() { if (!n_ibbs_body) { } if (!n_pmda_body) { } if (!n_generic_body) { } } intel_acbp_v2_t::key_signature_t::key_signature_t(kaitai::kstream* p__io, intel_acbp_v2_t* p__parent, intel_acbp_v2_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; m_public_key = nullptr; m_signature = nullptr; _read(); } void intel_acbp_v2_t::key_signature_t::_read() { m_version = m__io->read_u1(); m_key_id = m__io->read_u2le(); m_public_key = std::unique_ptr(new public_key_t(m__io, this, m__root)); m_sig_scheme = m__io->read_u2le(); m_signature = std::unique_ptr(new signature_t(m__io, this, m__root)); } intel_acbp_v2_t::key_signature_t::~key_signature_t() { _clean_up(); } void intel_acbp_v2_t::key_signature_t::_clean_up() { } intel_acbp_v2_t::signature_t::signature_t(kaitai::kstream* p__io, intel_acbp_v2_t::key_signature_t* p__parent, intel_acbp_v2_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; _read(); } void intel_acbp_v2_t::signature_t::_read() { m_version = m__io->read_u1(); m_size_bits = m__io->read_u2le(); m_hash_algorithm_id = m__io->read_u2le(); m_signature = m__io->read_bytes((size_bits() / 8)); } intel_acbp_v2_t::signature_t::~signature_t() { _clean_up(); } void intel_acbp_v2_t::signature_t::_clean_up() { } intel_acbp_v2_t::ibb_segment_t::ibb_segment_t(kaitai::kstream* p__io, intel_acbp_v2_t::ibbs_body_t* p__parent, intel_acbp_v2_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; _read(); } void intel_acbp_v2_t::ibb_segment_t::_read() { m_reserved = m__io->read_u2le(); m_flags = m__io->read_u2le(); m_base = m__io->read_u4le(); m_size = m__io->read_u4le(); } intel_acbp_v2_t::ibb_segment_t::~ibb_segment_t() { _clean_up(); } void intel_acbp_v2_t::ibb_segment_t::_clean_up() { } intel_acbp_v2_t::public_key_t::public_key_t(kaitai::kstream* p__io, intel_acbp_v2_t::key_signature_t* p__parent, intel_acbp_v2_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; _read(); } void intel_acbp_v2_t::public_key_t::_read() { m_version = m__io->read_u1(); m_size_bits = m__io->read_u2le(); m_exponent = m__io->read_u4le(); m_modulus = m__io->read_bytes((size_bits() / 8)); } intel_acbp_v2_t::public_key_t::~public_key_t() { _clean_up(); } void intel_acbp_v2_t::public_key_t::_clean_up() { } intel_acbp_v2_t::hash_t::hash_t(kaitai::kstream* p__io, kaitai::kstruct* p__parent, intel_acbp_v2_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; _read(); } void intel_acbp_v2_t::hash_t::_read() { m_hash_algorithm_id = m__io->read_u2le(); m_len_hash = m__io->read_u2le(); m_hash = m__io->read_bytes(len_hash()); } intel_acbp_v2_t::hash_t::~hash_t() { _clean_up(); } void intel_acbp_v2_t::hash_t::_clean_up() { } intel_acbp_v2_t::header_t::header_t(kaitai::kstream* p__io, intel_acbp_v2_t::acbp_element_t* p__parent, intel_acbp_v2_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; _read(); } void intel_acbp_v2_t::header_t::_read() { m_structure_id = static_cast(m__io->read_u8le()); m_version = m__io->read_u1(); m_header_specific = m__io->read_u1(); m_total_size = m__io->read_u2le(); } intel_acbp_v2_t::header_t::~header_t() { _clean_up(); } void intel_acbp_v2_t::header_t::_clean_up() { } intel_acbp_v2_t::pmda_entry_v3_t::pmda_entry_v3_t(kaitai::kstream* p__io, intel_acbp_v2_t::pmda_body_t* p__parent, intel_acbp_v2_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; m_hash = nullptr; _read(); } void intel_acbp_v2_t::pmda_entry_v3_t::_read() { m_entry_id = m__io->read_u4le(); m_base = m__io->read_u4le(); m_size = m__io->read_u4le(); m_total_entry_size = m__io->read_u2le(); m_version = m__io->read_u2le(); m_hash = std::unique_ptr(new hash_t(m__io, this, m__root)); } intel_acbp_v2_t::pmda_entry_v3_t::~pmda_entry_v3_t() { _clean_up(); } void intel_acbp_v2_t::pmda_entry_v3_t::_clean_up() { } intel_acbp_v2_t::ibbs_body_t::ibbs_body_t(kaitai::kstream* p__io, intel_acbp_v2_t::acbp_element_t* p__parent, intel_acbp_v2_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; m_post_ibb_digest = nullptr; m_ibb_digests = nullptr; m_obb_digest = nullptr; m_reserved2 = nullptr; m_ibb_segments = nullptr; _read(); } void intel_acbp_v2_t::ibbs_body_t::_read() { m_reserved0 = m__io->read_u1(); m_set_number = m__io->read_u1(); m_reserved1 = m__io->read_u1(); m_pbet_value = m__io->read_u1(); m_flags = m__io->read_u4le(); m_mch_bar = m__io->read_u8le(); m_vtd_bar = m__io->read_u8le(); m_dma_protection_base0 = m__io->read_u4le(); m_dma_protection_limit0 = m__io->read_u4le(); m_dma_protection_base1 = m__io->read_u8le(); m_dma_protection_limit1 = m__io->read_u8le(); m_post_ibb_digest = std::unique_ptr(new hash_t(m__io, this, m__root)); m_ibb_entry_point = m__io->read_u4le(); m_ibb_digests_size = m__io->read_u2le(); m_num_ibb_digests = m__io->read_u2le(); m_ibb_digests = std::unique_ptr>>(new std::vector>()); const int l_ibb_digests = num_ibb_digests(); for (int i = 0; i < l_ibb_digests; i++) { m_ibb_digests->push_back(std::move(std::unique_ptr(new hash_t(m__io, this, m__root)))); } m_obb_digest = std::unique_ptr(new hash_t(m__io, this, m__root)); m_reserved2 = std::unique_ptr>(new std::vector()); const int l_reserved2 = 3; for (int i = 0; i < l_reserved2; i++) { m_reserved2->push_back(std::move(m__io->read_u1())); } m_num_ibb_segments = m__io->read_u1(); m_ibb_segments = std::unique_ptr>>(new std::vector>()); const int l_ibb_segments = num_ibb_segments(); for (int i = 0; i < l_ibb_segments; i++) { m_ibb_segments->push_back(std::move(std::unique_ptr(new ibb_segment_t(m__io, this, m__root)))); } } intel_acbp_v2_t::ibbs_body_t::~ibbs_body_t() { _clean_up(); } void intel_acbp_v2_t::ibbs_body_t::_clean_up() { } intel_acbp_v2_t::pmda_body_t::pmda_body_t(kaitai::kstream* p__io, intel_acbp_v2_t::acbp_element_t* p__parent, intel_acbp_v2_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; m_entries = nullptr; _read(); } void intel_acbp_v2_t::pmda_body_t::_read() { m_reserved = m__io->read_u2le(); m_total_size = m__io->read_u2le(); m_version = m__io->read_u4le(); if (!(version() == 3)) { throw kaitai::validation_not_equal_error(3, version(), _io(), std::string("/types/pmda_body/seq/2")); } m_num_entries = m__io->read_u4le(); m_entries = std::unique_ptr>>(new std::vector>()); const int l_entries = num_entries(); for (int i = 0; i < l_entries; i++) { m_entries->push_back(std::move(std::unique_ptr(new pmda_entry_v3_t(m__io, this, m__root)))); } } intel_acbp_v2_t::pmda_body_t::~pmda_body_t() { _clean_up(); } void intel_acbp_v2_t::pmda_body_t::_clean_up() { } UEFITool-A66/common/generated/intel_acbp_v2.h000066400000000000000000000342441442134156300211160ustar00rootroot00000000000000#pragma once // This is a generated file! Please edit source .ksy file and use kaitai-struct-compiler to rebuild #include "../kaitai/kaitaistruct.h" #include #include #include #if KAITAI_STRUCT_VERSION < 9000L #error "Incompatible Kaitai Struct C++/STL API: version 0.9 or later is required" #endif class intel_acbp_v2_t : public kaitai::kstruct { public: class acbp_element_t; class key_signature_t; class signature_t; class ibb_segment_t; class public_key_t; class hash_t; class header_t; class pmda_entry_v3_t; class ibbs_body_t; class pmda_body_t; enum ibb_segment_type_t { IBB_SEGMENT_TYPE_IBB = 0, IBB_SEGMENT_TYPE_NON_IBB = 1 }; enum structure_ids_t : uint64_t { STRUCTURE_IDS_PMDA = 6872283318001360735LL, STRUCTURE_IDS_PMSG = 6872289979495636831LL, STRUCTURE_IDS_ACBP = 6872299801917087583LL, STRUCTURE_IDS_IBBS = 6872303100435717983LL, STRUCTURE_IDS_PCDS = 6872303109042888543LL, STRUCTURE_IDS_PFRS = 6872303169222762335LL, STRUCTURE_IDS_TXTS = 6872303178114948959LL }; intel_acbp_v2_t(kaitai::kstream* p__io, kaitai::kstruct* p__parent = nullptr, intel_acbp_v2_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~intel_acbp_v2_t(); class acbp_element_t : public kaitai::kstruct { public: acbp_element_t(kaitai::kstream* p__io, intel_acbp_v2_t* p__parent = nullptr, intel_acbp_v2_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~acbp_element_t(); private: std::unique_ptr m_header; std::unique_ptr m_ibbs_body; bool n_ibbs_body; public: bool _is_null_ibbs_body() { ibbs_body(); return n_ibbs_body; }; private: std::unique_ptr m_pmda_body; bool n_pmda_body; public: bool _is_null_pmda_body() { pmda_body(); return n_pmda_body; }; private: std::string m_generic_body; bool n_generic_body; public: bool _is_null_generic_body() { generic_body(); return n_generic_body; }; private: intel_acbp_v2_t* m__root; intel_acbp_v2_t* m__parent; public: header_t* header() const { return m_header.get(); } ibbs_body_t* ibbs_body() const { return m_ibbs_body.get(); } pmda_body_t* pmda_body() const { return m_pmda_body.get(); } std::string generic_body() const { return m_generic_body; } intel_acbp_v2_t* _root() const { return m__root; } intel_acbp_v2_t* _parent() const { return m__parent; } }; class key_signature_t : public kaitai::kstruct { public: key_signature_t(kaitai::kstream* p__io, intel_acbp_v2_t* p__parent = nullptr, intel_acbp_v2_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~key_signature_t(); private: uint8_t m_version; uint16_t m_key_id; std::unique_ptr m_public_key; uint16_t m_sig_scheme; std::unique_ptr m_signature; intel_acbp_v2_t* m__root; intel_acbp_v2_t* m__parent; public: uint8_t version() const { return m_version; } uint16_t key_id() const { return m_key_id; } public_key_t* public_key() const { return m_public_key.get(); } uint16_t sig_scheme() const { return m_sig_scheme; } signature_t* signature() const { return m_signature.get(); } intel_acbp_v2_t* _root() const { return m__root; } intel_acbp_v2_t* _parent() const { return m__parent; } }; class signature_t : public kaitai::kstruct { public: signature_t(kaitai::kstream* p__io, intel_acbp_v2_t::key_signature_t* p__parent = nullptr, intel_acbp_v2_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~signature_t(); private: uint8_t m_version; uint16_t m_size_bits; uint16_t m_hash_algorithm_id; std::string m_signature; intel_acbp_v2_t* m__root; intel_acbp_v2_t::key_signature_t* m__parent; public: uint8_t version() const { return m_version; } uint16_t size_bits() const { return m_size_bits; } uint16_t hash_algorithm_id() const { return m_hash_algorithm_id; } std::string signature() const { return m_signature; } intel_acbp_v2_t* _root() const { return m__root; } intel_acbp_v2_t::key_signature_t* _parent() const { return m__parent; } }; class ibb_segment_t : public kaitai::kstruct { public: ibb_segment_t(kaitai::kstream* p__io, intel_acbp_v2_t::ibbs_body_t* p__parent = nullptr, intel_acbp_v2_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~ibb_segment_t(); private: uint16_t m_reserved; uint16_t m_flags; uint32_t m_base; uint32_t m_size; intel_acbp_v2_t* m__root; intel_acbp_v2_t::ibbs_body_t* m__parent; public: uint16_t reserved() const { return m_reserved; } uint16_t flags() const { return m_flags; } uint32_t base() const { return m_base; } uint32_t size() const { return m_size; } intel_acbp_v2_t* _root() const { return m__root; } intel_acbp_v2_t::ibbs_body_t* _parent() const { return m__parent; } }; class public_key_t : public kaitai::kstruct { public: public_key_t(kaitai::kstream* p__io, intel_acbp_v2_t::key_signature_t* p__parent = nullptr, intel_acbp_v2_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~public_key_t(); private: uint8_t m_version; uint16_t m_size_bits; uint32_t m_exponent; std::string m_modulus; intel_acbp_v2_t* m__root; intel_acbp_v2_t::key_signature_t* m__parent; public: uint8_t version() const { return m_version; } uint16_t size_bits() const { return m_size_bits; } uint32_t exponent() const { return m_exponent; } std::string modulus() const { return m_modulus; } intel_acbp_v2_t* _root() const { return m__root; } intel_acbp_v2_t::key_signature_t* _parent() const { return m__parent; } }; class hash_t : public kaitai::kstruct { public: hash_t(kaitai::kstream* p__io, kaitai::kstruct* p__parent = nullptr, intel_acbp_v2_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~hash_t(); private: uint16_t m_hash_algorithm_id; uint16_t m_len_hash; std::string m_hash; intel_acbp_v2_t* m__root; kaitai::kstruct* m__parent; public: uint16_t hash_algorithm_id() const { return m_hash_algorithm_id; } uint16_t len_hash() const { return m_len_hash; } std::string hash() const { return m_hash; } intel_acbp_v2_t* _root() const { return m__root; } kaitai::kstruct* _parent() const { return m__parent; } }; class header_t : public kaitai::kstruct { public: header_t(kaitai::kstream* p__io, intel_acbp_v2_t::acbp_element_t* p__parent = nullptr, intel_acbp_v2_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~header_t(); private: structure_ids_t m_structure_id; uint8_t m_version; uint8_t m_header_specific; uint16_t m_total_size; intel_acbp_v2_t* m__root; intel_acbp_v2_t::acbp_element_t* m__parent; public: structure_ids_t structure_id() const { return m_structure_id; } uint8_t version() const { return m_version; } uint8_t header_specific() const { return m_header_specific; } uint16_t total_size() const { return m_total_size; } intel_acbp_v2_t* _root() const { return m__root; } intel_acbp_v2_t::acbp_element_t* _parent() const { return m__parent; } }; class pmda_entry_v3_t : public kaitai::kstruct { public: pmda_entry_v3_t(kaitai::kstream* p__io, intel_acbp_v2_t::pmda_body_t* p__parent = nullptr, intel_acbp_v2_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~pmda_entry_v3_t(); private: uint32_t m_entry_id; uint32_t m_base; uint32_t m_size; uint16_t m_total_entry_size; uint16_t m_version; std::unique_ptr m_hash; intel_acbp_v2_t* m__root; intel_acbp_v2_t::pmda_body_t* m__parent; public: uint32_t entry_id() const { return m_entry_id; } uint32_t base() const { return m_base; } uint32_t size() const { return m_size; } uint16_t total_entry_size() const { return m_total_entry_size; } uint16_t version() const { return m_version; } hash_t* hash() const { return m_hash.get(); } intel_acbp_v2_t* _root() const { return m__root; } intel_acbp_v2_t::pmda_body_t* _parent() const { return m__parent; } }; class ibbs_body_t : public kaitai::kstruct { public: ibbs_body_t(kaitai::kstream* p__io, intel_acbp_v2_t::acbp_element_t* p__parent = nullptr, intel_acbp_v2_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~ibbs_body_t(); private: uint8_t m_reserved0; uint8_t m_set_number; uint8_t m_reserved1; uint8_t m_pbet_value; uint32_t m_flags; uint64_t m_mch_bar; uint64_t m_vtd_bar; uint32_t m_dma_protection_base0; uint32_t m_dma_protection_limit0; uint64_t m_dma_protection_base1; uint64_t m_dma_protection_limit1; std::unique_ptr m_post_ibb_digest; uint32_t m_ibb_entry_point; uint16_t m_ibb_digests_size; uint16_t m_num_ibb_digests; std::unique_ptr>> m_ibb_digests; std::unique_ptr m_obb_digest; std::unique_ptr> m_reserved2; uint8_t m_num_ibb_segments; std::unique_ptr>> m_ibb_segments; intel_acbp_v2_t* m__root; intel_acbp_v2_t::acbp_element_t* m__parent; public: uint8_t reserved0() const { return m_reserved0; } uint8_t set_number() const { return m_set_number; } uint8_t reserved1() const { return m_reserved1; } uint8_t pbet_value() const { return m_pbet_value; } uint32_t flags() const { return m_flags; } uint64_t mch_bar() const { return m_mch_bar; } uint64_t vtd_bar() const { return m_vtd_bar; } uint32_t dma_protection_base0() const { return m_dma_protection_base0; } uint32_t dma_protection_limit0() const { return m_dma_protection_limit0; } uint64_t dma_protection_base1() const { return m_dma_protection_base1; } uint64_t dma_protection_limit1() const { return m_dma_protection_limit1; } hash_t* post_ibb_digest() const { return m_post_ibb_digest.get(); } uint32_t ibb_entry_point() const { return m_ibb_entry_point; } uint16_t ibb_digests_size() const { return m_ibb_digests_size; } uint16_t num_ibb_digests() const { return m_num_ibb_digests; } std::vector>* ibb_digests() const { return m_ibb_digests.get(); } hash_t* obb_digest() const { return m_obb_digest.get(); } std::vector* reserved2() const { return m_reserved2.get(); } uint8_t num_ibb_segments() const { return m_num_ibb_segments; } std::vector>* ibb_segments() const { return m_ibb_segments.get(); } intel_acbp_v2_t* _root() const { return m__root; } intel_acbp_v2_t::acbp_element_t* _parent() const { return m__parent; } }; class pmda_body_t : public kaitai::kstruct { public: pmda_body_t(kaitai::kstream* p__io, intel_acbp_v2_t::acbp_element_t* p__parent = nullptr, intel_acbp_v2_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~pmda_body_t(); private: uint16_t m_reserved; uint16_t m_total_size; uint32_t m_version; uint32_t m_num_entries; std::unique_ptr>> m_entries; intel_acbp_v2_t* m__root; intel_acbp_v2_t::acbp_element_t* m__parent; public: uint16_t reserved() const { return m_reserved; } uint16_t total_size() const { return m_total_size; } uint32_t version() const { return m_version; } uint32_t num_entries() const { return m_num_entries; } std::vector>* entries() const { return m_entries.get(); } intel_acbp_v2_t* _root() const { return m__root; } intel_acbp_v2_t::acbp_element_t* _parent() const { return m__parent; } }; private: structure_ids_t m_structure_id; uint8_t m_version; uint8_t m_header_specific; uint16_t m_total_size; uint16_t m_key_signature_offset; uint8_t m_bpm_revision; uint8_t m_bp_svn; uint8_t m_acm_svn; uint8_t m_reserved; uint16_t m_nem_data_size; std::unique_ptr>> m_elements; std::unique_ptr m_key_signature; intel_acbp_v2_t* m__root; kaitai::kstruct* m__parent; public: structure_ids_t structure_id() const { return m_structure_id; } uint8_t version() const { return m_version; } uint8_t header_specific() const { return m_header_specific; } uint16_t total_size() const { return m_total_size; } uint16_t key_signature_offset() const { return m_key_signature_offset; } uint8_t bpm_revision() const { return m_bpm_revision; } uint8_t bp_svn() const { return m_bp_svn; } uint8_t acm_svn() const { return m_acm_svn; } uint8_t reserved() const { return m_reserved; } uint16_t nem_data_size() const { return m_nem_data_size; } std::vector>* elements() const { return m_elements.get(); } key_signature_t* key_signature() const { return m_key_signature.get(); } intel_acbp_v2_t* _root() const { return m__root; } kaitai::kstruct* _parent() const { return m__parent; } }; UEFITool-A66/common/generated/intel_acm.cpp000066400000000000000000000051401442134156300206660ustar00rootroot00000000000000// This is a generated file! Please edit source .ksy file and use kaitai-struct-compiler to rebuild #include "intel_acm.h" #include "../kaitai/exceptions.h" intel_acm_t::intel_acm_t(kaitai::kstream* p__io, kaitai::kstruct* p__parent, intel_acm_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = this; (void)p__root; m_header = nullptr; _read(); } void intel_acm_t::_read() { m_header = std::unique_ptr(new header_t(m__io, this, m__root)); m_body = m__io->read_bytes((4 * ((header()->module_size() - header()->header_size()) - header()->scratch_space_size()))); } intel_acm_t::~intel_acm_t() { _clean_up(); } void intel_acm_t::_clean_up() { } intel_acm_t::header_t::header_t(kaitai::kstream* p__io, intel_acm_t* p__parent, intel_acm_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; _read(); } void intel_acm_t::header_t::_read() { m_module_type = m__io->read_u2le(); if (!(module_type() == 2)) { throw kaitai::validation_not_equal_error(2, module_type(), _io(), std::string("/types/header/seq/0")); } m_module_subtype = static_cast(m__io->read_u2le()); m_header_size = m__io->read_u4le(); m_header_version = m__io->read_u4le(); m_chipset_id = m__io->read_u2le(); m_flags = m__io->read_u2le(); m_module_vendor = m__io->read_u4le(); if (!(module_vendor() == 32902)) { throw kaitai::validation_not_equal_error(32902, module_vendor(), _io(), std::string("/types/header/seq/6")); } m_date_day = m__io->read_u1(); m_date_month = m__io->read_u1(); m_date_year = m__io->read_u2le(); m_module_size = m__io->read_u4le(); m_acm_svn = m__io->read_u2le(); m_se_svn = m__io->read_u2le(); m_code_control_flags = m__io->read_u4le(); m_error_entry_point = m__io->read_u4le(); m_gdt_max = m__io->read_u4le(); m_gdt_base = m__io->read_u4le(); m_segment_sel = m__io->read_u4le(); m_entry_point = m__io->read_u4le(); m_reserved = m__io->read_bytes(64); m_key_size = m__io->read_u4le(); m_scratch_space_size = m__io->read_u4le(); m_rsa_public_key = m__io->read_bytes((4 * key_size())); n_rsa_exponent = true; if (header_version() == 0) { n_rsa_exponent = false; m_rsa_exponent = m__io->read_u4le(); } m_rsa_signature = m__io->read_bytes((4 * key_size())); m_scratch_space = m__io->read_bytes((4 * scratch_space_size())); } intel_acm_t::header_t::~header_t() { _clean_up(); } void intel_acm_t::header_t::_clean_up() { if (!n_rsa_exponent) { } } UEFITool-A66/common/generated/intel_acm.h000066400000000000000000000111401442134156300203300ustar00rootroot00000000000000#pragma once // This is a generated file! Please edit source .ksy file and use kaitai-struct-compiler to rebuild #include "../kaitai/kaitaistruct.h" #include #include #if KAITAI_STRUCT_VERSION < 9000L #error "Incompatible Kaitai Struct C++/STL API: version 0.9 or later is required" #endif class intel_acm_t : public kaitai::kstruct { public: class header_t; enum module_subtype_t { MODULE_SUBTYPE_TXT = 0, MODULE_SUBTYPE_STARTUP = 1, MODULE_SUBTYPE_BOOT_GUARD = 3 }; enum known_header_version_t { KNOWN_HEADER_VERSION_V0_0 = 0, KNOWN_HEADER_VERSION_V3_0 = 196608 }; intel_acm_t(kaitai::kstream* p__io, kaitai::kstruct* p__parent = nullptr, intel_acm_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~intel_acm_t(); class header_t : public kaitai::kstruct { public: header_t(kaitai::kstream* p__io, intel_acm_t* p__parent = nullptr, intel_acm_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~header_t(); private: uint16_t m_module_type; module_subtype_t m_module_subtype; uint32_t m_header_size; uint32_t m_header_version; uint16_t m_chipset_id; uint16_t m_flags; uint32_t m_module_vendor; uint8_t m_date_day; uint8_t m_date_month; uint16_t m_date_year; uint32_t m_module_size; uint16_t m_acm_svn; uint16_t m_se_svn; uint32_t m_code_control_flags; uint32_t m_error_entry_point; uint32_t m_gdt_max; uint32_t m_gdt_base; uint32_t m_segment_sel; uint32_t m_entry_point; std::string m_reserved; uint32_t m_key_size; uint32_t m_scratch_space_size; std::string m_rsa_public_key; uint32_t m_rsa_exponent; bool n_rsa_exponent; public: bool _is_null_rsa_exponent() { rsa_exponent(); return n_rsa_exponent; }; private: std::string m_rsa_signature; std::string m_scratch_space; intel_acm_t* m__root; intel_acm_t* m__parent; public: uint16_t module_type() const { return m_module_type; } module_subtype_t module_subtype() const { return m_module_subtype; } /** * counted in 4 byte increments */ uint32_t header_size() const { return m_header_size; } uint32_t header_version() const { return m_header_version; } uint16_t chipset_id() const { return m_chipset_id; } uint16_t flags() const { return m_flags; } uint32_t module_vendor() const { return m_module_vendor; } /** * BCD */ uint8_t date_day() const { return m_date_day; } /** * BCD */ uint8_t date_month() const { return m_date_month; } /** * BCD */ uint16_t date_year() const { return m_date_year; } /** * counted in 4 byte increments */ uint32_t module_size() const { return m_module_size; } uint16_t acm_svn() const { return m_acm_svn; } uint16_t se_svn() const { return m_se_svn; } uint32_t code_control_flags() const { return m_code_control_flags; } uint32_t error_entry_point() const { return m_error_entry_point; } uint32_t gdt_max() const { return m_gdt_max; } uint32_t gdt_base() const { return m_gdt_base; } uint32_t segment_sel() const { return m_segment_sel; } uint32_t entry_point() const { return m_entry_point; } std::string reserved() const { return m_reserved; } /** * counted in 4 byte increments */ uint32_t key_size() const { return m_key_size; } /** * counted in 4 byte increments */ uint32_t scratch_space_size() const { return m_scratch_space_size; } std::string rsa_public_key() const { return m_rsa_public_key; } uint32_t rsa_exponent() const { return m_rsa_exponent; } std::string rsa_signature() const { return m_rsa_signature; } std::string scratch_space() const { return m_scratch_space; } intel_acm_t* _root() const { return m__root; } intel_acm_t* _parent() const { return m__parent; } }; private: std::unique_ptr m_header; std::string m_body; intel_acm_t* m__root; kaitai::kstruct* m__parent; public: header_t* header() const { return m_header.get(); } std::string body() const { return m_body; } intel_acm_t* _root() const { return m__root; } kaitai::kstruct* _parent() const { return m__parent; } }; UEFITool-A66/common/generated/intel_keym_v1.cpp000066400000000000000000000072641442134156300215120ustar00rootroot00000000000000// This is a generated file! Please edit source .ksy file and use kaitai-struct-compiler to rebuild #include "intel_keym_v1.h" #include "../kaitai/exceptions.h" intel_keym_v1_t::intel_keym_v1_t(kaitai::kstream* p__io, kaitai::kstruct* p__parent, intel_keym_v1_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = this; (void)p__root; m_km_hash = nullptr; m_key_signature = nullptr; _read(); } void intel_keym_v1_t::_read() { m_structure_id = static_cast(m__io->read_u8le()); if (!(structure_id() == intel_keym_v1_t::STRUCTURE_IDS_KEYM)) { throw kaitai::validation_not_equal_error(intel_keym_v1_t::STRUCTURE_IDS_KEYM, structure_id(), _io(), std::string("/seq/0")); } m_version = m__io->read_u1(); { uint8_t _ = version(); if (!(_ < 32)) { throw kaitai::validation_expr_error(version(), _io(), std::string("/seq/1")); } } m_km_version = m__io->read_u1(); m_km_svn = m__io->read_u1(); m_km_id = m__io->read_u1(); m_km_hash = std::unique_ptr(new km_hash_t(m__io, this, m__root)); m_key_signature = std::unique_ptr(new key_signature_t(m__io, this, m__root)); } intel_keym_v1_t::~intel_keym_v1_t() { _clean_up(); } void intel_keym_v1_t::_clean_up() { } intel_keym_v1_t::km_hash_t::km_hash_t(kaitai::kstream* p__io, intel_keym_v1_t* p__parent, intel_keym_v1_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; _read(); } void intel_keym_v1_t::km_hash_t::_read() { m_hash_algorithm_id = m__io->read_u2le(); m_len_hash = m__io->read_u2le(); m_hash = m__io->read_bytes(len_hash()); } intel_keym_v1_t::km_hash_t::~km_hash_t() { _clean_up(); } void intel_keym_v1_t::km_hash_t::_clean_up() { } intel_keym_v1_t::public_key_t::public_key_t(kaitai::kstream* p__io, intel_keym_v1_t::key_signature_t* p__parent, intel_keym_v1_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; _read(); } void intel_keym_v1_t::public_key_t::_read() { m_version = m__io->read_u1(); m_size_bits = m__io->read_u2le(); m_exponent = m__io->read_u4le(); m_modulus = m__io->read_bytes((size_bits() / 8)); } intel_keym_v1_t::public_key_t::~public_key_t() { _clean_up(); } void intel_keym_v1_t::public_key_t::_clean_up() { } intel_keym_v1_t::signature_t::signature_t(kaitai::kstream* p__io, intel_keym_v1_t::key_signature_t* p__parent, intel_keym_v1_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; _read(); } void intel_keym_v1_t::signature_t::_read() { m_version = m__io->read_u1(); m_size_bits = m__io->read_u2le(); m_hash_algorithm_id = m__io->read_u2le(); m_signature = m__io->read_bytes((size_bits() / 8)); } intel_keym_v1_t::signature_t::~signature_t() { _clean_up(); } void intel_keym_v1_t::signature_t::_clean_up() { } intel_keym_v1_t::key_signature_t::key_signature_t(kaitai::kstream* p__io, intel_keym_v1_t* p__parent, intel_keym_v1_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; m_public_key = nullptr; m_signature = nullptr; _read(); } void intel_keym_v1_t::key_signature_t::_read() { m_version = m__io->read_u1(); m_key_id = m__io->read_u2le(); m_public_key = std::unique_ptr(new public_key_t(m__io, this, m__root)); m_sig_scheme = m__io->read_u2le(); m_signature = std::unique_ptr(new signature_t(m__io, this, m__root)); } intel_keym_v1_t::key_signature_t::~key_signature_t() { _clean_up(); } void intel_keym_v1_t::key_signature_t::_clean_up() { } UEFITool-A66/common/generated/intel_keym_v1.h000066400000000000000000000121621442134156300211500ustar00rootroot00000000000000#pragma once // This is a generated file! Please edit source .ksy file and use kaitai-struct-compiler to rebuild #include "../kaitai/kaitaistruct.h" #include #include #if KAITAI_STRUCT_VERSION < 9000L #error "Incompatible Kaitai Struct C++/STL API: version 0.9 or later is required" #endif class intel_keym_v1_t : public kaitai::kstruct { public: class km_hash_t; class public_key_t; class signature_t; class key_signature_t; enum structure_ids_t : uint64_t { STRUCTURE_IDS_KEYM = 6872296602200661855LL }; intel_keym_v1_t(kaitai::kstream* p__io, kaitai::kstruct* p__parent = nullptr, intel_keym_v1_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~intel_keym_v1_t(); class km_hash_t : public kaitai::kstruct { public: km_hash_t(kaitai::kstream* p__io, intel_keym_v1_t* p__parent = nullptr, intel_keym_v1_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~km_hash_t(); private: uint16_t m_hash_algorithm_id; uint16_t m_len_hash; std::string m_hash; intel_keym_v1_t* m__root; intel_keym_v1_t* m__parent; public: uint16_t hash_algorithm_id() const { return m_hash_algorithm_id; } uint16_t len_hash() const { return m_len_hash; } std::string hash() const { return m_hash; } intel_keym_v1_t* _root() const { return m__root; } intel_keym_v1_t* _parent() const { return m__parent; } }; class public_key_t : public kaitai::kstruct { public: public_key_t(kaitai::kstream* p__io, intel_keym_v1_t::key_signature_t* p__parent = nullptr, intel_keym_v1_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~public_key_t(); private: uint8_t m_version; uint16_t m_size_bits; uint32_t m_exponent; std::string m_modulus; intel_keym_v1_t* m__root; intel_keym_v1_t::key_signature_t* m__parent; public: uint8_t version() const { return m_version; } uint16_t size_bits() const { return m_size_bits; } uint32_t exponent() const { return m_exponent; } std::string modulus() const { return m_modulus; } intel_keym_v1_t* _root() const { return m__root; } intel_keym_v1_t::key_signature_t* _parent() const { return m__parent; } }; class signature_t : public kaitai::kstruct { public: signature_t(kaitai::kstream* p__io, intel_keym_v1_t::key_signature_t* p__parent = nullptr, intel_keym_v1_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~signature_t(); private: uint8_t m_version; uint16_t m_size_bits; uint16_t m_hash_algorithm_id; std::string m_signature; intel_keym_v1_t* m__root; intel_keym_v1_t::key_signature_t* m__parent; public: uint8_t version() const { return m_version; } uint16_t size_bits() const { return m_size_bits; } uint16_t hash_algorithm_id() const { return m_hash_algorithm_id; } std::string signature() const { return m_signature; } intel_keym_v1_t* _root() const { return m__root; } intel_keym_v1_t::key_signature_t* _parent() const { return m__parent; } }; class key_signature_t : public kaitai::kstruct { public: key_signature_t(kaitai::kstream* p__io, intel_keym_v1_t* p__parent = nullptr, intel_keym_v1_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~key_signature_t(); private: uint8_t m_version; uint16_t m_key_id; std::unique_ptr m_public_key; uint16_t m_sig_scheme; std::unique_ptr m_signature; intel_keym_v1_t* m__root; intel_keym_v1_t* m__parent; public: uint8_t version() const { return m_version; } uint16_t key_id() const { return m_key_id; } public_key_t* public_key() const { return m_public_key.get(); } uint16_t sig_scheme() const { return m_sig_scheme; } signature_t* signature() const { return m_signature.get(); } intel_keym_v1_t* _root() const { return m__root; } intel_keym_v1_t* _parent() const { return m__parent; } }; private: structure_ids_t m_structure_id; uint8_t m_version; uint8_t m_km_version; uint8_t m_km_svn; uint8_t m_km_id; std::unique_ptr m_km_hash; std::unique_ptr m_key_signature; intel_keym_v1_t* m__root; kaitai::kstruct* m__parent; public: structure_ids_t structure_id() const { return m_structure_id; } uint8_t version() const { return m_version; } uint8_t km_version() const { return m_km_version; } uint8_t km_svn() const { return m_km_svn; } uint8_t km_id() const { return m_km_id; } km_hash_t* km_hash() const { return m_km_hash.get(); } key_signature_t* key_signature() const { return m_key_signature.get(); } intel_keym_v1_t* _root() const { return m__root; } kaitai::kstruct* _parent() const { return m__parent; } }; UEFITool-A66/common/generated/intel_keym_v2.cpp000066400000000000000000000120631442134156300215040ustar00rootroot00000000000000// This is a generated file! Please edit source .ksy file and use kaitai-struct-compiler to rebuild #include "intel_keym_v2.h" #include "../kaitai/exceptions.h" intel_keym_v2_t::intel_keym_v2_t(kaitai::kstream* p__io, kaitai::kstruct* p__parent, intel_keym_v2_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = this; (void)p__root; m_header = nullptr; m_reserved = nullptr; m_km_hashes = nullptr; m_key_signature = nullptr; _read(); } void intel_keym_v2_t::_read() { m_header = std::unique_ptr(new header_t(m__io, this, m__root)); m_key_signature_offset = m__io->read_u2le(); m_reserved = std::unique_ptr>(new std::vector()); const int l_reserved = 3; for (int i = 0; i < l_reserved; i++) { m_reserved->push_back(std::move(m__io->read_u1())); } m_km_version = m__io->read_u1(); m_km_svn = m__io->read_u1(); m_km_id = m__io->read_u1(); m_fpf_hash_algorithm_id = m__io->read_u2le(); m_num_km_hashes = m__io->read_u2le(); m_km_hashes = std::unique_ptr>>(new std::vector>()); const int l_km_hashes = num_km_hashes(); for (int i = 0; i < l_km_hashes; i++) { m_km_hashes->push_back(std::move(std::unique_ptr(new km_hash_t(m__io, this, m__root)))); } m_key_signature = std::unique_ptr(new key_signature_t(m__io, this, m__root)); } intel_keym_v2_t::~intel_keym_v2_t() { _clean_up(); } void intel_keym_v2_t::_clean_up() { } intel_keym_v2_t::key_signature_t::key_signature_t(kaitai::kstream* p__io, intel_keym_v2_t* p__parent, intel_keym_v2_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; m_public_key = nullptr; m_signature = nullptr; _read(); } void intel_keym_v2_t::key_signature_t::_read() { m_version = m__io->read_u1(); m_key_id = m__io->read_u2le(); m_public_key = std::unique_ptr(new public_key_t(m__io, this, m__root)); m_sig_scheme = m__io->read_u2le(); m_signature = std::unique_ptr(new signature_t(m__io, this, m__root)); } intel_keym_v2_t::key_signature_t::~key_signature_t() { _clean_up(); } void intel_keym_v2_t::key_signature_t::_clean_up() { } intel_keym_v2_t::km_hash_t::km_hash_t(kaitai::kstream* p__io, intel_keym_v2_t* p__parent, intel_keym_v2_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; _read(); } void intel_keym_v2_t::km_hash_t::_read() { m_usage_flags = m__io->read_u8le(); m_hash_algorithm_id = m__io->read_u2le(); m_len_hash = m__io->read_u2le(); m_hash = m__io->read_bytes(len_hash()); } intel_keym_v2_t::km_hash_t::~km_hash_t() { _clean_up(); } void intel_keym_v2_t::km_hash_t::_clean_up() { } intel_keym_v2_t::signature_t::signature_t(kaitai::kstream* p__io, intel_keym_v2_t::key_signature_t* p__parent, intel_keym_v2_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; _read(); } void intel_keym_v2_t::signature_t::_read() { m_version = m__io->read_u1(); m_size_bits = m__io->read_u2le(); m_hash_algorithm_id = m__io->read_u2le(); m_signature = m__io->read_bytes((size_bits() / 8)); } intel_keym_v2_t::signature_t::~signature_t() { _clean_up(); } void intel_keym_v2_t::signature_t::_clean_up() { } intel_keym_v2_t::public_key_t::public_key_t(kaitai::kstream* p__io, intel_keym_v2_t::key_signature_t* p__parent, intel_keym_v2_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; _read(); } void intel_keym_v2_t::public_key_t::_read() { m_version = m__io->read_u1(); m_size_bits = m__io->read_u2le(); m_exponent = m__io->read_u4le(); m_modulus = m__io->read_bytes((size_bits() / 8)); } intel_keym_v2_t::public_key_t::~public_key_t() { _clean_up(); } void intel_keym_v2_t::public_key_t::_clean_up() { } intel_keym_v2_t::header_t::header_t(kaitai::kstream* p__io, intel_keym_v2_t* p__parent, intel_keym_v2_t* p__root) : kaitai::kstruct(p__io) { m__parent = p__parent; m__root = p__root; _read(); } void intel_keym_v2_t::header_t::_read() { m_structure_id = static_cast(m__io->read_u8le()); if (!(structure_id() == intel_keym_v2_t::STRUCTURE_IDS_KEYM)) { throw kaitai::validation_not_equal_error(intel_keym_v2_t::STRUCTURE_IDS_KEYM, structure_id(), _io(), std::string("/types/header/seq/0")); } m_version = m__io->read_u1(); { uint8_t _ = version(); if (!(_ >= 32)) { throw kaitai::validation_expr_error(version(), _io(), std::string("/types/header/seq/1")); } } m_header_specific = m__io->read_u1(); m_total_size = m__io->read_u2le(); if (!(total_size() == 0)) { throw kaitai::validation_not_equal_error(0, total_size(), _io(), std::string("/types/header/seq/3")); } } intel_keym_v2_t::header_t::~header_t() { _clean_up(); } void intel_keym_v2_t::header_t::_clean_up() { } UEFITool-A66/common/generated/intel_keym_v2.h000066400000000000000000000153601442134156300211540ustar00rootroot00000000000000#pragma once // This is a generated file! Please edit source .ksy file and use kaitai-struct-compiler to rebuild #include "../kaitai/kaitaistruct.h" #include #include #include #if KAITAI_STRUCT_VERSION < 9000L #error "Incompatible Kaitai Struct C++/STL API: version 0.9 or later is required" #endif class intel_keym_v2_t : public kaitai::kstruct { public: class key_signature_t; class km_hash_t; class signature_t; class public_key_t; class header_t; enum structure_ids_t : uint64_t { STRUCTURE_IDS_KEYM = 6872296602200661855LL }; enum km_usage_flags_t { KM_USAGE_FLAGS_BOOT_POLICY_MANIFEST = 1, KM_USAGE_FLAGS_FIT_PATCH_MANIFEST = 2, KM_USAGE_FLAGS_ACM_MANIFEST = 4, KM_USAGE_FLAGS_SDEV = 8 }; intel_keym_v2_t(kaitai::kstream* p__io, kaitai::kstruct* p__parent = nullptr, intel_keym_v2_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~intel_keym_v2_t(); class key_signature_t : public kaitai::kstruct { public: key_signature_t(kaitai::kstream* p__io, intel_keym_v2_t* p__parent = nullptr, intel_keym_v2_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~key_signature_t(); private: uint8_t m_version; uint16_t m_key_id; std::unique_ptr m_public_key; uint16_t m_sig_scheme; std::unique_ptr m_signature; intel_keym_v2_t* m__root; intel_keym_v2_t* m__parent; public: uint8_t version() const { return m_version; } uint16_t key_id() const { return m_key_id; } public_key_t* public_key() const { return m_public_key.get(); } uint16_t sig_scheme() const { return m_sig_scheme; } signature_t* signature() const { return m_signature.get(); } intel_keym_v2_t* _root() const { return m__root; } intel_keym_v2_t* _parent() const { return m__parent; } }; class km_hash_t : public kaitai::kstruct { public: km_hash_t(kaitai::kstream* p__io, intel_keym_v2_t* p__parent = nullptr, intel_keym_v2_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~km_hash_t(); private: uint64_t m_usage_flags; uint16_t m_hash_algorithm_id; uint16_t m_len_hash; std::string m_hash; intel_keym_v2_t* m__root; intel_keym_v2_t* m__parent; public: uint64_t usage_flags() const { return m_usage_flags; } uint16_t hash_algorithm_id() const { return m_hash_algorithm_id; } uint16_t len_hash() const { return m_len_hash; } std::string hash() const { return m_hash; } intel_keym_v2_t* _root() const { return m__root; } intel_keym_v2_t* _parent() const { return m__parent; } }; class signature_t : public kaitai::kstruct { public: signature_t(kaitai::kstream* p__io, intel_keym_v2_t::key_signature_t* p__parent = nullptr, intel_keym_v2_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~signature_t(); private: uint8_t m_version; uint16_t m_size_bits; uint16_t m_hash_algorithm_id; std::string m_signature; intel_keym_v2_t* m__root; intel_keym_v2_t::key_signature_t* m__parent; public: uint8_t version() const { return m_version; } uint16_t size_bits() const { return m_size_bits; } uint16_t hash_algorithm_id() const { return m_hash_algorithm_id; } std::string signature() const { return m_signature; } intel_keym_v2_t* _root() const { return m__root; } intel_keym_v2_t::key_signature_t* _parent() const { return m__parent; } }; class public_key_t : public kaitai::kstruct { public: public_key_t(kaitai::kstream* p__io, intel_keym_v2_t::key_signature_t* p__parent = nullptr, intel_keym_v2_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~public_key_t(); private: uint8_t m_version; uint16_t m_size_bits; uint32_t m_exponent; std::string m_modulus; intel_keym_v2_t* m__root; intel_keym_v2_t::key_signature_t* m__parent; public: uint8_t version() const { return m_version; } uint16_t size_bits() const { return m_size_bits; } uint32_t exponent() const { return m_exponent; } std::string modulus() const { return m_modulus; } intel_keym_v2_t* _root() const { return m__root; } intel_keym_v2_t::key_signature_t* _parent() const { return m__parent; } }; class header_t : public kaitai::kstruct { public: header_t(kaitai::kstream* p__io, intel_keym_v2_t* p__parent = nullptr, intel_keym_v2_t* p__root = nullptr); private: void _read(); void _clean_up(); public: ~header_t(); private: structure_ids_t m_structure_id; uint8_t m_version; uint8_t m_header_specific; uint16_t m_total_size; intel_keym_v2_t* m__root; intel_keym_v2_t* m__parent; public: structure_ids_t structure_id() const { return m_structure_id; } uint8_t version() const { return m_version; } uint8_t header_specific() const { return m_header_specific; } uint16_t total_size() const { return m_total_size; } intel_keym_v2_t* _root() const { return m__root; } intel_keym_v2_t* _parent() const { return m__parent; } }; private: std::unique_ptr m_header; uint16_t m_key_signature_offset; std::unique_ptr> m_reserved; uint8_t m_km_version; uint8_t m_km_svn; uint8_t m_km_id; uint16_t m_fpf_hash_algorithm_id; uint16_t m_num_km_hashes; std::unique_ptr>> m_km_hashes; std::unique_ptr m_key_signature; intel_keym_v2_t* m__root; kaitai::kstruct* m__parent; public: header_t* header() const { return m_header.get(); } uint16_t key_signature_offset() const { return m_key_signature_offset; } std::vector* reserved() const { return m_reserved.get(); } uint8_t km_version() const { return m_km_version; } uint8_t km_svn() const { return m_km_svn; } uint8_t km_id() const { return m_km_id; } uint16_t fpf_hash_algorithm_id() const { return m_fpf_hash_algorithm_id; } uint16_t num_km_hashes() const { return m_num_km_hashes; } std::vector>* km_hashes() const { return m_km_hashes.get(); } key_signature_t* key_signature() const { return m_key_signature.get(); } intel_keym_v2_t* _root() const { return m__root; } kaitai::kstruct* _parent() const { return m__parent; } }; UEFITool-A66/common/guiddatabase.cpp000066400000000000000000000074641442134156300174250ustar00rootroot00000000000000/* guiddatabase.cpp Copyright (c) 2017, LongSoft. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHWARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "guiddatabase.h" #include "ubytearray.h" #include "ffs.h" #include #include #if defined(U_ENABLE_GUID_DATABASE_SUPPORT) #include #include #include static GuidDatabase gLocalGuidDatabase; #ifdef QT_CORE_LIB #include #include // This is required to be able to read Qt-embedded paths static std::string readGuidDatabase(const UString &path) { QFile guids(path); if (guids.open(QFile::ReadOnly | QFile::Text)) return QTextStream(&guids).readAll().toStdString(); return std::string {}; } #else static std::string readGuidDatabase(const UString &path) { std::ifstream guids(path.toLocal8Bit()); std::stringstream ret; if (ret) ret << guids.rdbuf(); return ret.str(); } #endif void initGuidDatabase(const UString & path, UINT32* numEntries) { gLocalGuidDatabase.clear(); std::stringstream file(readGuidDatabase(path)); while (!file.eof()) { std::string line; std::getline(file, line); // Use sharp symbol as commentary if (line.size() == 0 || line[0] == '#') continue; // GUID and name are comma-separated std::vector lineParts; std::string::size_type prev = 0, curr = 0; while ((curr = line.find(',', curr)) != std::string::npos) { std::string substring( line.substr(prev, curr-prev) ); lineParts.push_back(UString(substring.c_str())); prev = ++curr; } lineParts.push_back(UString(line.substr(prev, curr-prev).c_str())); if (lineParts.size() < 2) continue; EFI_GUID guid; if (!ustringToGuid(lineParts[0], guid)) continue; gLocalGuidDatabase[guid] = lineParts[1]; } if (numEntries) *numEntries = (UINT32)gLocalGuidDatabase.size(); } UString guidDatabaseLookup(const EFI_GUID & guid) { return gLocalGuidDatabase[guid]; } #else void initGuidDatabase(const UString & path, UINT32* numEntries) { U_UNUSED_PARAMETER(path); if (numEntries) *numEntries = 0; } UString guidDatabaseLookup(const EFI_GUID & guid) { U_UNUSED_PARAMETER(guid); return UString(); } #endif GuidDatabase guidDatabaseFromTreeRecursive(TreeModel * model, const UModelIndex index) { GuidDatabase db; if (!index.isValid()) return db; for (int i = 0; i < model->rowCount(index); i++) { GuidDatabase tmpDb = guidDatabaseFromTreeRecursive(model, index.model()->index(i, index.column(), index)); db.insert(tmpDb.begin(), tmpDb.end()); } if (model->type(index) == Types::File && !model->text(index).isEmpty()) db[readUnaligned((const EFI_GUID*)model->header(index).left(16).constData())] = model->text(index); return db; } USTATUS guidDatabaseExportToFile(const UString & outPath, GuidDatabase & db) { std::ofstream outputFile(outPath.toLocal8Bit(), std::ios::out | std::ios::trunc); if (!outputFile) return U_FILE_OPEN; for (GuidDatabase::iterator it = db.begin(); it != db.end(); it++) { std::string guid(guidToUString (it->first, false).toLocal8Bit()); std::string name(it->second.toLocal8Bit()); outputFile << guid << ',' << name << '\n'; } return U_SUCCESS; } UEFITool-A66/common/guiddatabase.h000066400000000000000000000023171442134156300170620ustar00rootroot00000000000000/* guiddatabase.h Copyright (c) 2017, LongSoft. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHWARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef GUID_DATABASE_H #define GUID_DATABASE_H #include #include #include "basetypes.h" #include "ustring.h" #include "ffsparser.h" #include "ffs.h" #include "utility.h" struct OperatorLessForGuids { bool operator()(const EFI_GUID& lhs, const EFI_GUID& rhs) const { return (memcmp(&lhs, &rhs, sizeof(EFI_GUID)) < 0); } }; typedef std::map GuidDatabase; UString guidDatabaseLookup(const EFI_GUID & guid); void initGuidDatabase(const UString & path = "", UINT32* numEntries = NULL); GuidDatabase guidDatabaseFromTreeRecursive(TreeModel * model, const UModelIndex index); USTATUS guidDatabaseExportToFile(const UString & outPath, GuidDatabase & db); #endif // GUID_DATABASE_H UEFITool-A66/common/guids.csv000066400000000000000000007002211442134156300161230ustar00rootroot0000000000000000000000-0000-0000-0000-000000000000,ZeroGuid 00026AEB-F334-4C15-A7F0-E1E897E9FE91,NvmeRecovery 0013BE6B-2198-43F1-93BA-2A7ED7B1E1CC,SystemUsbSwitchDxe 00160F8D-2B35-4DF2-BBE0-B272A8D631F0,FirmwarePerformanceDxe 0029DE6A-E024-4EB8-A91D-9F23AA1F4E92,NetworkStackSetupScreen 00364A4C-6A0A-4F08-8FFD-0937F3DBB13E,IdeBusBoard 0049858F-8CA7-4CCD-918B-D952CBF32975,VirtioFdtDxe 00504624-8A59-4EEB-BD0F-6B36E96128E0,FpNvStorage 0053D9D6-2659-4599-A26B-EF4536E631A9,ShellAliasGuid 0065D394-9951-4144-82A3-0AFC8579C251,EfiPeiRscHandlerPpiGuid 00720665-67EB-4A99-BAF7-D3C33A1C7CC9,EfiTcp4ServiceBindingProtocolGuid 00781CA1-5DE3-405F-ABB8-379C3C076984,AmiRomLayoutGuid 00B46EC9-2712-486B-A6A4-E2933581C28B,HstiPlatformDxe 00C86DB8-013B-4FF4-B8E9-208F4FCF1C00,LibSignal 00CA959F-6CFA-4DB1-95BC-E46C47514390,EfiTlsProtocolGuid 00D6B14B-7DD0-4062-8821-E5F96A2A1B00,FspReservedMemoryResourceHobMiscGuid 00DBD91D-55E9-420F-9639-5E9F8437B44F,EfiExtendedSalStatusCodeServicesProtocolGuid 00DC20A3-66A2-4D14-BBD7-5BA938E556DE,LenovoSmbios 010216CD-9C09-4EB5-B7DA-D0A2865092D4,ProjectDXE 01359D99-9446-456D-ADA4-50A711C03ADA,CpuInitPei 01359D99-9446-456D-ADA4-50A711C03ADB,CpuPeim 01368881-C4AD-4B1D-B631-D57A8EC8DB6B,AmiGlobalVariableGuid 0154DD51-9079-4A10-895C-9C0772815788,PlatformBootManagerStringPackGuid 01631791-F34E-4C0A-B15D-0B6CE22B27A8,TcgPeiAfterMem 0167CCC4-D0F7-4F21-A3EF-9E64B7CDCE8B,ScsiBus 0167CCC4-D0F7-4F21-A3EF-9E64B7CDCE8C,SystemAhciBusDxe 0170F60C-1D40-4651-956D-F0BD9879D527,Virtio10 0174B2B5-F505-4B12-AA60-59DFF8D6EA37,ShellNetwork2HiiGuid 0182244E-F95D-43FC-91EC-60594EF47599,Lpc47m18xDxe 018A5C7A-12EB-429D-9DEF-6FCC410B04E8,IioCfgUpdateDxeLightningRidgeEXECB4 018AA4F0-773E-46F3-B62D-2C70EA32E0D0,EfiSystemPartCapsuleStorage 018E1925-D6A2-4A2A-8958-817610A15ADF,PeiS3LibNull 01D127EA-F6F1-4EF6-9415-8A000093F89D,UEfiCorebootPayloadPkgTokenSpaceGuid 01ED6C55-0D2E-4859-BB57-3044737A3679,PhConSplitterDxe 01F34D25-4DE2-23AD-3FF3-36353FF323F1,EfiPeiPcdPpiGuid 020BC7C9-80E5-476D-B187-0FB754850CAB,PvnvramDxe 021722D8-522B-4079-852A-FE44C2C13F49,SataController 021BD2CA-51D2-11E3-8E56-B75417C70B44,UsbDeviceProtocolGuid 022218B8-FE5E-4EBC-BC96-74058A4E7E83,ErrorGlobeBorder 02337E07-2CF2-46BE-BCF7-834945FCCEB9,EfiUnbootablePartitionGuid 024DEE41-33E7-11D3-9D69-0008C781F39F,EfiPartTypeLegacyMbrGuid 025BBFC7-E6A9-4B8B-82AD-6815A1AEAF4A,MnpDxe 025F738B-4EBD-4D55-B728-5F421B601F1F,PlatformInfoDxe 025F738B-4EBD-4D55-B728-5F421B601F20,PlatformCpuInfoDxe 0284F846-2CB7-4960-8DB2-47AA71513AD5,menu_selection 02AC0805-155F-473A-A302-0D89D6E1E6CC,AsusSLP2 02B01AD5-7E59-43E8-A6D8-238180613A5A,EmuVariableRuntimeDxe 02BD55C2-AB1D-4B75-B0FD-9A63AE09B31D,BaseMemoryLibOptDxe 02CE967A-DD7E-4FFC-9EE7-810CF0470880,EfiEndOfDxeEventGroupGuid 02E800BE-8F01-4AA6-946B-D71388E1833F,EFI_MTFTP4_SERVICE_BINDING_PROTOCOL_GUID 02EEA107-98DB-400E-9830-460A1542D799,Ip6ConfigNvDataGuid 02F04694-2C0A-4F1E-B0CE-64BE25890B03,DebugAgentTimerLibNull 0325A554-05BE-466B-BC8C-70BE3C9DAFB1,AmiTcg2InfoProtocolGuid 0325B5A1-0937-4A4F-B8AF-EC3F80EE6B35,SataControllerDxe 03583FF6-CB36-4940-947E-B9B39F4AFAF7,EfiSmbiosProtocolGuid 036F84E1-7F37-428C-A79E-575FDFAA84EC,EfiIommuDMArErrorSectionGuid 0379BE4E-D706-437D-B037-EDB82FB772A4,EfiDevicePathUtilitiesProtocolGuid 0397B0C9-22E8-459E-A4FF-99BC65270929,Tpm2StartupLocalityHobGuid 03AF477A-8336-0142-8A65-B4BD93B1A1A9,FirmwareExtension 03C1F5C8-48F1-416E-A6B6-992DF3BBACA6,A01SmmServiceBody 03C4E603-AC28-11D3-9A2D-0090273FC14D,EfiPxeBaseCodeProtocolGuid 03C70B0D-67E6-5C16-8E57-312DF246A961,BootChimeAudio 03DA99B3-DDF4-4C7E-8CCA-216FC3F1F311,BaseFspSecPlatformLibNull 03DBB540-E186-4615-8A7F-A427863B4E56,PoofAnimationState1 03FDF171-1D67-4ACE-A904-3E36D338FA74,SeCPlatformReadyToBootGuid 0412A7A1-C050-42C2-877A-77C379F9F5F1,FirewireOhciDxe 0419F582-0625-4531-8A33-85A9965C95BC,WinNtBusDriverGuid 041FD986-B016-47CE-AFC5-2269EDD4AD64,ACPIS4Dxe 044310AB-77FD-402A-AF1A-87D4120E7329,FirmwarePerformanceSmm 045B6F49-9102-4590-A0A5-35311B0AEFC3,EfiDpsdRSA1024AndSHA256SignatureVerificationProtocolGuid 0468A601-C535-46FD-A95D-BBAB991B178C,EfiPowerOnHobGuid 046C44DB-59DF-41B3-AF53-EF707B930E9A,FtRecovery 04877BE8-FAC0-448E-801D-F0F895CCB012,SmbiosDmiEditSsi 04A76C80-06B9-445E-B73E-CB8C61A6A964,SIO791 04B37FE8-F6AE-480B-BDD5-37D98C5E89AA,EdkiiVarErrorFlagGuid 04DD0ECD-4844-426D-AE59-1EF632C5EA4C,SystemDxeToSmmEventDxe 04EAAAA1-29A1-11D7-8838-00500473D4EB,USBRT 04F75442-A593-4281-BD4B-095935B7D2F8,wifi_1bar 05041A6B-4DEE-47BB-9E58-5944D1870EE5,UsbConfigGuid 050EB8C6-C12E-4B86-892B-40985E8B3137,UefiDevicePathLibDevicePathProtocol 0515BC05-2959-4E91-89C6-6B3A3F1FCB65,TCG_MPDriver 0541150C-E33B-4DAF-A263-02E4BB4BF1CF,SecurityErrorHandlingDxe 054F2504-E2BC-4641-83FC-502588FE1F28,CpuInitDxe 0565365C-2FE1-4F88-B3BE-624C04623A20,MicrocodeUpdateDxe 05687F4A-3CA7-4D19-9BC5-E180CEA3569F,AmiPlatformSecurityChipGuid 056BCA18-2F19-41EE-84EA-83746CB5069A,CrystalRidgeSMM 056E7324-A718-465B-9A84-228F06642B4F,PlatformDxe 057A449A-1FDC-4C06-BFC9-F53F6A99BB92,EfiPciCfg2PpiGuid 0583D694-AF8B-4BAA-9583-813CEDF40843,CsmInt10Block 0584FC67-72B9-4D46-AE3E-AD330452D9B4,InputDeviceAggregatorDxe 05984E1A-D8BB-5D8A-A8E6-90E6FB2AB7DA,AlertUI 05AD34BA-6F02-4214-952E-4DA0398E2BB9,EfiDxeServicesTableGuid 05C99A21-C70F-4AD2-8A5F-35DF3343F51E,EfiDevicePathFromTextProtocolGuid 05DFCA46-141F-11DF-8508-E38C0891C4E2,HfsPlusDxe 05F7AA70-A64A-432C-8CEE-4CDECB8671D7,A01ODMDxeDriver 05FFB44D-EE01-40E1-9866-FD27FD4FBE92,ThunderboltDeviceDxe 060CC026-4C0D-4DDA-8F41-595FEF00A502,MemoryStatusCodeRecordGuid 0619F5C2-4858-4CAA-A86A-73A21A18DF6B,GenericWatchdogDxe 062ACC82-1D1E-4F61-AA94-8B0C47236A3D,BootScriptSaveOnS3SaveStateThunk 0639408B-19A6-4B5D-BAFB-12A2F5114032,Acoustic 0650F140-439A-2D4F-9807-C92669339399,AppleEvent 06B5947E-FF53-457D-98BC-C5ABC777FD5A,SetupMouseDxe 06D20D84-A032-4E25-969A-346D255E46D1,CpuCsrAccess 06DE824A-A4E2-4295-A3F6-03B3FEF5B109,LenovoSecurityVariableDxe 06E81C58-4AD7-44BC-8390-F10265F72480,PcdPpiGuid 0718AD81-F26A-4850-A6EC-F268E309D707,Tpm20PlatformDxe 071A3DBE-CFF4-4B73-83F0-598C13DCFDD5,Slp21Markers 0723F88B-810F-4E44-92A0-A5C83B433698,PchFlashControllerDxe 073E2576-F6C1-4B91-92A9-D4675DDA34B1,PttPassThruProtocolGuid 073E7E01-2611-4E85-B896-A3B6767CBA00,AmiTsePasswordPromptEnterGuid 074993A4-19A1-4E0D-B892-8FBCC6D79F35,SaveMemoryConfig 074E1E48-8132-47A1-8C2C-3F14AD9A66DC,EfiGlobalNvsAreaProtocolGuid 07525079-2616-4599-93FA-5EE9E3F0295C,CsmPolicy 07709C98-414A-4039-B7D0-29C21F105E92,AcpiPlatformFeatures 077A3100-1667-45FA-B98C-37651B5073EE,TpmSmbiosDxe 078485F1-0C1F-4B1B-AFB3-4A09C0EF87A1,It8728SmmFeatures 0784924F-E296-11D4-9A49-0090273FC14D,EfiDriverDiagnosticsProtocolGuid 078F54D4-CC22-4048-9E94-879C214D562F,DefaultFvPadFileNameGuid 079E8E98-AE93-4B9A-8A71-1DC869F23E09,ShellSortTestApp 07A50B13-7539-41CB-B924-9E72B870C6D3,UsbVhcDxe 07A9330A-F347-11D4-9A49-0090273FC14D,LegacyMetronome 07B37006-9302-408E-B416-B524D110DD7F,AppleHidInterface 07D75280-27D4-4D69-90D0-5643E238B341,EfiPciPlatformProtocolGuid 08018188-42CD-BB48-100F-5387D53DED3D,EfiPersistentVirtualCdGuid 081CCA80-AE21-AFC8-1AC8-3091A8F1CBC5,SmcOobPlatformPolicySmm 0823A088-1248-4285-9616-0111CC76D3C5,SmbusRecovery 0833A84D-8A39-431F-BD1C-30965AAE71DD,ProcessorStartup 08464531-4C99-4C4C-A887-8D8BA4BBB063,Ps2MouseDxe 08497E75-0BF6-40E2-8ABF-B98DFB464C93,SpiFlashPeiLibNull 085DDD80-CE41-4FA8-B298-6071E8F62BC5,SmcOobPlatformPolicyDxe 087E9760-1FB5-49F7-879A-853D2B214CC7,LenovoSlp2Dxe 08A2CA63-3B65-472C-874E-5E138E947324,ASUSITERT 08A92691-926C-414F-A0B5-E785D90B9853,Memory_OK_DXE 08B2E586-35A8-4A3F-A9ED-E48134891601,SmcInBandSmm 08B97689-86AF-4A36-9E35-117B4D2EF26A,AfscDxe 08EFD15D-EC55-4023-B648-7BA40DF7D05D,PeiRamBoot 08F2C63B-08DE-4CCD-8670-ACFE644A1C48,PchS3Support 08F74BAA-EA36-41D9-9521-21A70F8780BC,EfiDiskInfoScsiInterfaceGuid 0903DD14-2CA0-458A-B5EB-0C0CA30D785C,AmiSmbiosBoardProtocolGuid 0922E604-F5EC-42EF-980D-A35E9A2B1844,IpSecConfig 093E0FAE-A6C4-4F50-9F1B-D41E2B89C19A,EfiCertSha512Guid 09576E91-6D3F-11D2-8E39-00A0C969723B,EfiDevicePathProtocolGuid 09576E92-6D3F-11D2-8E39-00A0C969723B,EfiFileInfoGuid 09576E93-6D3F-11D2-8E39-00A0C969723B,EfiFileSystemInfoGuid 09767DB6-412A-45BA-8026-F087CAE210E3,DTSPolicy 09831032-6FA3-4484-AF4F-0A000A8D3A82,PL180MciDxe 09D13410-2718-463A-8B15-DA93C3CA0A64,UsbCdcEcm 09D445BE-3C89-4E4F-ABE0-51FA84C2E4FF,ScGeneralConfigGuid 09D5B53F-F4B0-4F59-A0B1-7B57D35C0E05,NicIp4ConfigNvDataGuid 09EA8911-BE0D-4230-A003-EDC693B48E11,VlvPeiInitPpiGuid 09EA894A-BE0D-4230-A003-EDC693B48E95,PchInitPpiGuid 0A1D4FD8-4704-4501-85EB-93399492CBED,DevShell 0A2FBD15-1C25-407E-8915-60C5652BC2AA,SystemFirmwareUpdateDxe 0A4D622D-01F4-4974-B3F5-2BFE9888EF92,SLP20OEMPublicKeyVariableGuid 0A5EA2E1-BE0B-44A0-A775-F429C9A018A0,PlatformEarlyInit 0A602C5B-05A0-40C4-9181-EDCD891D0001,OememDxeCore 0A602C5B-05A0-40C4-9181-EDCD891D0003,OememPeiCore 0A66E322-3740-4CCE-AD62-BD172CECCA35,ScsiDisk 0A845224-8675-4241-8AE9-4D94C93DEB90,PauseKey 0A8BADD5-03B8-4D19-B128-7B8F0EDAA596,EfiConfigKeywordHandlerProtocolGuid 0AA31BC6-3379-41E8-825A-53F82CC0F254,AmiTpm32Bin 0ABD8284-6DA3-4616-971A-83A5148067BA,IsaFloppyDxe 0AC12AB3-DD33-4460-87F5-82694D3D7402,SmcOFBDNull 0AC2D35D-1C77-1033-A6F8-7CA55DF7D0AA,CpuPolicyPei 0AD3D31B-B3D8-4506-AE71-2EF11006D90F,UefiAcpiBoardInfoGuid 0ADFB62D-FF74-484C-8944-F85C4BEA87A8,AmiEfiKeycodeProtocolGuid 0AE8CE5D-E448-4437-A8D7-EBF5F194F731,EfiDxeIplPpiGuid 0AF0B742-63EC-45BD-8DB6-71AD7F2FE8E8,ShellDriver1HiiGuid 0AF7C79C-65B5-4319-B0AE-44EC484E4AD7,EfiHashAlgorithmMD5Guid 0B04B2ED-861C-42CD-A22F-C3AAFACCB896,BiosVideoDxe 0B2CFBF2-3E08-4C4E-A74D-59748A9F930F,LegacyRegionDxe 0B4AE6BE-6DA6-4908-8A71-7E6A8A33B11C,MeFwVersion 0B4BDCFF-74B2-45AD-91E1-8F6634C8A1DC,SIOBasicIOPei 0B64AAB0-5429-11D4-9816-00A0C91FADCF,EfiBisProtocolGuid 0B6E5233-A65C-44C9-9407-D9AB83BFC8BD,EfiCertSha224Guid 0B6F5CA7-4F53-445A-B76E-2E365B806366,ArmVirtTokenSpaceGuid 0B7E694D-B909-4097-9C03-5E728489F709,HybridGraphicsConfigGuid 0BA8263C-A8BD-4AAD-B402-6A6AF2F7E77D,BlockDeviceCapsuleGuid 0BB51CDD-A750-442F-A15E-7DEADFBA30FF,Mtftp4Dxe2 0BBC6CAB-F228-4F20-8C6A-847CDEE3FF24,OFCDxeDriver 0BCB2808-FEA5-6047-9A60-8767A46A72A1,AppleUdp4Dxe 0BF70067-D53B-42DF-B770-E92C91C61411,EfiTdtProtocolGuid 0C0F3B43-44DE-4907-B478-225F6F6289DC,UsbKeyboardLayoutPackageGuid 0C0FA9B6-F3AF-49BD-89C5-6C2D43969072,MmioSerialUart 0C34B372-2622-4A13-A46E-BFD0DEB48BFF,I2cBusDxe 0C375A90-4C4C-4428-8EA0-531BE8959BF7,FlashDriverSmm 0C3798AA-D22E-4DD6-8CB4-3C9CFB1D86D3,SIOSLPSMI 0C396FCA-6BDA-4A15-B6A3-A6FA4544BDB7,EcFwUpdateDxe 0C3B7B59-28E5-4C99-85E5-D0116DBFAAF2,IsctWakeReason 0C5FCE90-1C03-4ED2-9EFE-B1D02E72B3B0,menu_bottom_mid 0C85DF8A-4212-4CC1-A4AA-1A7A36E8DA97,FpgaPlatformEarlyInit 0C88B3B5-6A1D-4657-AA88-1B7D92FF3699,CMFCSwSmi 0C95A916-A006-11D4-BCFA-0080C73C8881,WinNtThunkDxe 0C95A928-A006-11D4-BCFA-0080C73C8881,EfiWinNtVirtualDisksGuid 0C95A92F-A006-11D4-BCFA-0080C73C8881,EfiWinNtPhysicalDisksGuid 0C95A935-A006-11D4-BCFA-0080C73C8881,EfiWinNtFileSystemGuid 0C95A93D-A006-11D4-BCFA-0080C73C8881,EfiWinNtSerialPortGuid 0C95A940-A006-11D4-BCFA-0080C73C8881,WinNtBusDriverDxe 0C989D41-F4B4-4244-9D7F-E9FFB4163273,FastBootOption 0CDA5D94-951A-4C61-8DD5-E5BF34BA69EC,SlotDataUpdateDxeLightningRidgeEXECB1 0D1ED2F7-E92B-4562-92DD-5C82EC917EAE,CRBPei 0D244DF9-6CE3-4133-A1CF-53200AB663AC,FspsWrapperPeim 0D3FB176-9569-4D51-A3EF-7D61C64FEABA,EfiSecurityPkgTokenSpaceGuid 0D51905B-B77E-452A-A2C0-ECA0CC8D514A,EdkiiNonDiscoverableDeviceProtocolGuid 0D648466-36BD-42C6-B287-7C3BAA2575C0,LenovoSetupUnderOsDxe 0D79A645-1D91-40A6-A81F-61E6982B32B4,EfiNt32PkgTokenSpaceGuid 0D8039FF-49E9-4CC9-A806-BB7C31B0BCB0,AmiTpm20PlatformPei 0D82A9EC-1289-4FD4-AC0B-4C6B1A25ABC6,SwitchableGraphicsDxe 0D8E6E4E-B029-475F-9122-60A3FEDBA8C0,DxeIoLibEsal 0D9A1427-E02A-437D-926B-AA521FD722BA,EfiPciLanInfoGuid 0DA55BC9-45F8-4BB4-8719-5224F18A4D45,EfiWiFiProtocolGuid 0DB48A36-4E54-EA9C-9B09-1EA5BE3A660B,EfiRestProtocolGuid 0DBF0B49-604C-40D4-9121-77AC41942626,FixedBootOrder 0DC65ADC-A973-4130-8DF0-2ADBEB9E4A31,FirmwarePerformanceS3PointerGuid 0DC73AED-CBF6-4A25-A68D-59C80F44C7C3,EfiDFUVerGuid 0DCA793A-EA96-42D8-BD7B-DC7F684E38C1,LegacyRomLayout 0DCE384D-007C-4BA5-94BD-0F6EB64D2AA9,PeiNtAutoScanPpiGuid 0DCF3594-318C-4596-B00F-BE61842DE3E2,SystemBootTypePeiPei 0DE2CE25-446A-45A7-BFC9-37DA26344B37,EfiPeiDeviceRecoveryModulePpiGuid 0DED86EE-6E79-4764-AA83-37A472F48123,FtBbUpdate 0E00B084-2D16-4A27-B172-B1F68C2CC55D,MicrocodeUpdates 0E1D2972-65AF-4AC1-BFA3-CEF4AB0C38FE,EfiCapsuleCrashGuid 0E2DAF63-8A4F-4026-A899-DE2D7F46E5EC,SgTpvPei 0E4D805D-746C-4EBC-8795-31A286CCA620,TcgPeiPolicyHobGuid 0E84FC69-29CC-4C6D-92AC-6D476921850F,UpdateDriverDxe 0E8C545B-A2EE-470D-8E26-BDA1A13C0AA3,LastEnumLangGuid 0E93C52B-4B73-5C32-86D5-69250A0BA723,AppleThemeFileNames 0EB84DA1-267A-40B4-8347-1F48694C8B47,PeCoffExtraActionLibNull 0ECC666B-4662-47F9-9DD5-D096FF7DA49E,PeiSecPerformancePpiGuid 0EDC9494-2743-4BA5-8818-0AEF5213F188,EfiExtendedSalCacheServicesProtocolGuid 0EEC96BC-0B82-4573-9791-C414E4DCEE64,IhisiService 0EF53039-3A38-42D1-BCEC-CE966E87061A,PeiFrb 0EF8A3B1-388A-4B62-8BE6-C7877D50AEDF,UefiPxeBcDxe 0EF98D3A-3E33-497A-A401-77BE3EB74F38,EfiAcpiS3ContextGuid 0EFC6282-F1E5-469A-8A70-194A8761F9AA,XenAcpiPlatformDxe 0F0B1735-87A0-4193-B266-538C38AF48CE,EfiIfrTianoGuid 0F17CECC-653A-C343-9CFA-FAA27A07EFE5,AppleCrypto 0F500BE6-ECE4-4ED8-9081-9AA9A523FB7B,HstiPublishCompleteProtocolGuid 0F5EF786-17A0-40C6-BC18-1B3272A00987,IccInit 0F6499B1-E9AD-493D-B9C2-2F90815C6CBC,EfiPhysicalPresenceGuid 0F69F6D7-0E4B-43A6-BFC2-6871694369B0,WdtAppPei 0F729F33-25C1-41A7-86B2-23A737A91823,IntelSnbGopVbt 0F7EC77A-1EE1-400F-A99D-7CBD1FEB181E,PcatPciRootBridge 0F886E75-3029-4ECF-B694-22894D3F2143,PLEDDXE 0F99E33C-CA0C-4AA2-887D-B57EC9050278,SaveMemoryConfig 0F9D89E8-9259-4F76-A5AF-0C89E34023DF,EfiFirmwareContentsSignedGuid 0FAAECB1-226E-4782-AACE-7DB9BCBF4DAF,EfiFtp4ServiceBindingProtocolGuid 0FAD5644-7BDF-4A75-B568-287AE2EBD3A6,SmcSwSmiFlashSmm 0FB7C852-ADCA-4853-8D0F-FBA71B1CE11A,EfiFormBrowserCompatibilityProtocolGuid 0FC50878-1633-432A-BDE4-841357FC15E9,AmiScsiPassThruInitProtocolGuid 0FC9013A-0568-4BA9-9B7E-C9C390A6609B,EfiLegacyRegionProtocolGuid 0FD96974-23AA-4CDC-B9CB-98D17750322A,EfiHiiStringProtocolGuid 0FDB764B-E669-4C69-83AC-5EDD99A2711E,ReadOnlyVariableOnReadOnlyVariable2Thunk 0FE159B5-076F-4C36-BF26-D724F2831252,BdsCtrl 0FE9DA53-043D-4265-A94D-FD77FEDE2EB4,TcgPlatformSetupPeiPolicy 0FFBCE19-324C-4690-A009-98C6AE2EB186,RecoveryOnFatUsbDiskGuid 100C2CFA-B586-4198-9B4C-1683D195B1DA,MMC 10149626-5583-4364-822F-A459B8121302,SystemFirmwareDeviceDxe 1015EA63-7421-417D-BB51-E5193061C551,DxeIpmiUsb 10164673-D365-4BE2-8513-1497CC07611D,ScPolicyPpiGuid 102287B4-6B12-4D41-91E1-EBEE1F3AA614,UefiDebugLibDebugPortProtocol 1051EC65-F6FC-41EA-BA51-344C37F60CDF,BoardConfigInitPreMem 105FF0EA-A0C0-48A8-B8F7-E8B4D62A1019,FmpAuthenticationLibRsa2048Sha256 106A2FD5-11FF-42EA-AFBA-B4969A702616,BaseOobLibrary 106C877F-C2BA-4C46-876C-BDFE6171CD7E,DebugCommunicationLibUsb3Pei 106F3545-B788-4CB5-9D2A-CE0CDB208DF5,EfiHiiThunkProducerGuid 107A772B-D5E1-11D4-9A46-0090273FC14D,EfiDriverConfigurationProtocolGuid 107A772C-D5E1-11D4-9A46-0090273FC14D,EfiComponentNameProtocolGuid 10952220-AA32-11DF-A438-0002A5D5C51B,PL35xSmc 10B12ADD-F5E2-CC78-5CA0-B77F76223ACD,AmiCpuFeaturesDxe 10BA6BBE-A97E-41C3-9A07-607AD9BD60E5,EfiVlv2VariableGuid 10C22623-DB6F-4721-AA30-4C12AF4230A7,IdeRecovery 10C22623-DB6F-4721-AA30-9C12AF4230F8,ExtRecovery 10DB0A54-F6F9-4CA2-A75E-F9AACAE70970,BiosGuardConfigGuid 10E26DF1-8775-4EE1-B50A-3AE82893703A,SeCfTPMPpiGuid 10EE5462-B207-4A4F-ABD8-CB522ECAA3A4,Udp4Dxe 10EE54AE-B207-4A4F-ABD8-CB522ECAA3A4,Udp6Dxe 11354A0C-781E-44A1-A787-C0178C8D570F,P2sbConfigGuid 11399A01-0423-49CC-8368-85291533C35D,FprSynapticsMetallicaDriver 113B2126-FC8A-11E3-BD6C-B8E8562CBAFA,EfiBootManagerPolicyConnectAllGuid 113FD31A-BE8B-418B-B034-7EAFE5C60C99,EsaInterfacesForTseProtocolGuid 114B7105-6CC9-453C-BADC-16DF227BB4EF,TrEESmm 114BA15A-6189-180D-BFC0-2053B3480949,EfiBoardSelectGuid 114CA60C-D965-4C13-BEF7-C4062248E1FA,EcIoDxe 114DA5EF-2CF1-4E12-9BBB-C470B55205D9,EfiAdapterInfoSanMacAddressGuid 11527125-78B2-4D3E-A0DF-41E75C221F5A,CpuS3 1156EFC6-EA32-4396-B5D5-26932E83C313,EfiSpiProtocolGuid 11668FCA-73BA-4B58-85A2-98AC4DF59A2C,SystemSmmCommunicationBufferManagerDxe 116E1ACF-2533-4CC2-820A-BBC10A2AB07C,CpuSpSmi 11777581-2B67-4075-8EB4-F691A47ECEC7,ProcMemInit 1188F1FC-06E9-49B8-A615-F5A0886FCF89,UhciInitPei 1191BBF5-DCB9-44F4-827E-95359744C987,PlatformStage2Pei 11A03A8E-A9C5-4DB9-90CF-4434B01586C4,BootPerformanceLog 11A6EDF6-A9BE-426D-A6CC-B22FE51D9224,PciHotPlugInitDxe 11ADE65F-956B-4D0E-B368-86DBC92F01AA,VariableSmiInt15Dxe 11B34006-D85B-4D0A-A290-D5A571310EF7,PcdProtocolGuid 11D8AC35-FB8A-44D1-8D09-0B5606D321B9,DSDT 11D92DFB-3CA9-4F93-BA2E-4780ED3E03B5,VirtioBlkDxe 11FBFDFB-10D2-43E6-B5B1-B4386EDCCB9A,EfiSeCRcInfoProtocolGuid 12025686-3984-466C-980B-8B5E89DA0319,AmiReadyToLoadDxeCorePpiGuid 1206F7CA-A475-4624-A83E-E6FC9BB38E49,SmmControl2Dxe 120D28AA-6630-46F0-8157-C0ADC2383BF5,AmiLegacyBootProtocolGuid 1216BD2A-C05E-4C6D-91E7-EB8E37AD3B7A,aDefaultDXE 12345678-930A-4A95-AB04-2E6CFDFF6631,TcgPeiAftermem 1259F60D-B754-468E-A789-4DB85D55E87E,EfiSwapAddressRangeProtocolGuid 125F2DE1-FB85-440C-A54C-4D99358A8D38,EfiAcpiS3SaveProtocolGuid 126A762D-5758-4FCA-8531-201A7F57F850,LenovoSetupStartupDxe 126F424E-F45B-4406-801E-2AACF404167F,AmiSetPhysicalPresenceGuid 127C1C4E-9135-46E3-B006-F9808B0559A5,Slp20Markers 128FB770-5E79-4176-9E51-9BB268A17DD1,PciHostBridgeDxe 129F6AA7-AB69-4CB8-AED1-40985001115E,SerialMuxControl 12AEDBEA-392D-4E2A-8789-5F6DC6B23661,OemBadgingSupportDxe 12BFCA88-7A2F-4AB5-9A5D-C40CA68BF75F,BootOrderSection 12C67BE1-AD2E-4F13-A95F-6EDC2C4392DE,MePolicyInitPei 12CADD30-6007-4C83-89D7-FF237F7B947A,SetupCompleteRedrawGuid 12D1D3A2-99F7-420B-BC69-8BB1D492A355,Logoid 12E2306C-1EBD-3140-B92E-EFA9099E82D2,CacheManager 12F38E73-B34D-4559-99E5-AE2DCD002156,BaseFspWrapperPlatformLibSample 12F75401-5415-4FF3-A981-A39BEE9F369E,SerialRecovery 130B8BA5-E63E-44A0-85DB-4D4E571C526A,IioCfgUpdateDxeNeonCityEPECB 1310BA34-D7B4-4A80-A645-8C0417C6AA55,AmiMemoryInfoConfig 1314216C-CB8D-421C-B854-06231386E642,PlatformInfoDxe 1317F0D5-7842-475C-B1CA-6EDC20DCBE7D,HashLibTpm2 131AAC21-2145-49E6-A3E1-A97BCE090020,AcpiSpcr 1323C7F8-DAD5-4126-A54B-7A05FBF41515,SmmAccess 132EC73B-3025-4FBF-B193-8ACB50EFBD89,QFlash 132EC73B-BD26-4FBF-B193-8ACB50EFBD89,UserDefSetupDxe 1353DE63-B74A-4BEF-80FD-2C5CFA83040B,GifDecoderDxe 135902E7-9709-4B41-8FD2-4069DAF0546A,TcEfiGlobalVariableGuid 136A3048-752A-4BF6-A757-0936119538ED,UiStringPackGuid 137B3044-F6D7-473E-A625-9FB92505C180,EfiSpiBusProtocolGuid 1388066E-3A57-4EFA-98F3-C12F3A958A29,EfiPeiSecurityPpiGuid 1390954D-DA95-4227-9328-7282C217DAA8,EfiSmmBaseProtocolGuid 13A3F0F6-264A-3EF0-F2E0-DEC512342F34,EfiPcdProtocolGuid 13AC6DD0-73D0-11D4-B06B-00AA00BD6DE7,EbcDxe 13AC6DD1-73D0-11D4-B06B-00AA00BD6DE7,EfiEbcProtocolGuid 13B00AAE-4FD2-964E-B30F-94627017370A,BmpConvert 13C5506E-8231-415E-9EBC-88DD115E3818,SmbiosElog 13ECD928-87AB-4460-BBE0-B520F9EB1D32,IconNetBoot 13F40F6E-50C1-4B73-B1E2-6E72D21CB04A,EfiUsbLegacyPlatformProtocolGuid 13F4EA8E-BFF1-43BF-8F44-80BCC96040F1,FpgaDxe 13FA7698-C831-49C7-87EA-8F43FCC25196,EfiEventVirtualAddressChangeGuid 1400F9E6-4BAB-4B68-A53F-58FD240818E6,Reset_Modify 14045170-CA65-47BC-9C15-2DE36D44AEE9,SmcInBandDxe 140E8004-16E1-4DE1-A352-C6EF51110ECF,ArmSmcLibNull 1410C6AC-9F4B-495B-9C23-8A5AEB0165E9,SmmSwDispatch2OnSmmSwDispatchThunk 142204E2-C7B1-4AF9-A729-923758D96D03,AmiLegx16Bin 14257B56-BDA2-4FAF-8E4F-C885DF75583C,IccPlatform 143B7632-B81B-4CB7-ABD3-B625A5B9BFFE,EfiExtScsiPassThruProtocolGuid 1448C340-0202-4711-9C4B-2D063AA6475B,ProgressBarEmptyLeftEndcap 145372BC-66B9-476D-81BC-2127C376BB66,FFS.pad 145971E9-AD52-4094-A8C8-BE5B3FECC82D,CpuPeim 14610837-4E97-4427-96E0-21D9B2956996,EsalVariableDxeSal 1484EBE8-2681-45F1-A2E5-12ECAD893B62,ArmJunoDxe 14982A4F-B0ED-45B8-A811-5A7A9BC232DF,EfiHiiKeyBoardLayoutGuid 149A6B53-FAFA-44F9-8BAF-F50C68A05236,ScInitDxe 14A7C46F-BC02-4047-9F18-A5D725D8BD19,EfiDFUResultGuid 14BB6DA5-0C47-4F2C-9348-8DC272619998,VmwSvgaDxe 14F95E01-D562-432E-844A-95A43905107E,GuidBase 14FC52BE-01DC-426C-91AE-A23C3E220AE8,EfiSmmSxDispatchProtocolGuid 14FF38A8-ACBA-4228-A7D7-A73260C7559B,PiSmmStatusCodeOnFrameworkSmmStatusCodeThunk 151C8EAE-7F2C-472C-9E54-9828194F6A88,EfiDiskIo2ProtocolGuid 15344673-D365-4BE2-8513-1497CC07611D,PchPlatformPolicyPpiGuid 154774EC-4350-40D4-AF66-7D1837BCD559,EfiHeciTrustedChannelSmmProtocolGuid 1547B4F3-3E8A-4FEF-81C8-328ED647AB1A,Csm16 154CAB4A-52B5-46CD-99C3-4368ABBACFFD,MetronomeDxe 1551A247-BB31-4393-8BB4-10509AE2F18F,ChargeLedDebugPei 1555ACF3-BD07-4685-B668-A86945A4124D,CpuPeiBeforeMem 157C666C-7C74-4E4A-B639-7BBA21487CE1,QFanDXE 15853D7C-3DDF-43E0-A1CB-EBF85B8F872C,EfiDeferredImageLoadProtocolGuid 158DC712-F15A-44DC-93BB-1675045BE066,HashLibBaseCryptoRouterDxe 158DEF5A-F656-419C-B027-7A3192C079D2,ShellVariableGuid 15B985C5-7103-4F35-B59D-2235FC5F3FFE,UsbTypeC 15B9B6DA-00A9-4DE7-B8E8-ED7AFB88F16E,CpuPolicyInitDxe 15C5E761-58D8-461A-9173-CAB020916264,VAminiPort 15CCACBE-2A4A-45ED-9EC2-53135F98AB24,BmcAcpi 15CF24A9-F9AB-46D0-8DCF-83664C632FD8,MemDetect 15FE2940-B426-479A-A002-5454A34C7A6E,FlashMapBin 1601E050-BE0C-41B7-8F96-9F48F72B7E26,OnboardControllerCtrl 16036A73-E8EF-46D0-953C-9B8E96527D13,Reset 1612CCDF-2549-466A-BF6F-D06DAAE60958,AppleKeyMapAggregator 161BE597-E9C5-49DB-AE50-C462AB54EEDA,PowerManagementAcpiTables2 16271FCA-55D9-4A33-93FC-5A3EB128DE21,MiscSubclassDxe 16271FCA-55D9-4A33-93FC-5A3EB128DEB6,CRBDxe 166C533A-8F1E-4D34-A60E-0F68D8D61308,OemKey 1682FE44-BD7A-4407-B7C7-DCA37CA3922D,EfiTlsConfigurationProtocolGuid 168D1A6E-F4A5-448A-9E95-795661BB3067,ArmPciCpuIo2Dxe 16958446-19B7-480B-B047-7485AD3F716D,FdtHobGuid 16A4ADD0-EF11-4C86-B159-88A2A8C4501C,wifi_3bars 16AD4FE0-B5B1-11DF-8CBF-0002A5D5C51B,PL310L2Cache 16B45DA2-7D70-4AEA-A58D-760E9ECB841D,FD_Drv_X86 16B6109E-194C-440F-94F8-C7CCCCC32DEB,EfiCseEndofPostProtocolGuid 16C58600-554B-4587-8C62-A40997CFE206,ASRockNetSmtpBin 16C8A6D0-FE8A-4082-A208-CF89C4290433,UefiSystemTableInfoGuid 16D0A23E-C09C-407D-A14A-AD058FDD0CA1,ACPI 16DBCD0A-ED77-442C-A4AB-3DCADE378A1C,ThunderboltNhi 17088572-377F-44EF-8F4E-B09FFF46A070,Microcode 170E13C0-BF1B-4218-871D-2ABDC6F887BC,EfiOEMBadgingProtocolGuid 171E9188-31D3-40F5-B10C-539B2DB940CD,EfiShellPkgTokenSpaceGuid 171F43DC-C4D9-47A6-9641-65DDCDD5AA30,UsbRtDxe 174CF46D-B167-4E6A-B1CD-D41E24EFA0F9,ASUSBackupSmm 17689034-F11B-468B-8CC4-E114C77F41B1,AsusPTTDxe 17706D27-83FE-4770-875F-4CEF4CB8F63D,AmiAhciPlatformPolicyProtocolGuid 17772369-D262-4B90-9F31-BDC41F2663A5,mebx_main 177B2C74-9674-45F4-AAEB-43F5506AE0FE,ASUSPOSTMessage 177D39D2-43B8-40C8-9AE1-3C5198D6941E,PeiTcgPpiGuid 177E63C1-AED6-4D88-917E-9B4FB9FE4092,PhoenixSmmCoreServicesProtocolGuid 17851FBF-45C4-4FF7-A2A0-C3B12D63C27E,SdBlockIoPei 17985E6F-E778-4D94-AEFA-C5DD2B77E186,QemuFwCfgAcpiPlatform 17A0A3D7-C0A5-4635-BBD5-072187DFE2EE,EmbeddedGpioProtocolGuid 17D09362-326C-4920-A50C-76F8A116A093,SeCPolicyInitDxe 17EE496A-D8E4-4B9A-94D1-CE8272300850,EfiPeiBootInRecoveryModePpiGuid 180636A5-871B-496D-B8F3-E83EF196D100,menu_top_right 1807040D-5934-41A2-A088-8E0F777F71AB,NvramDxe 1810AB4A-2314-4DF6-81EB-67C6EC058591,BootScriptTableBaseGuid 1830A6DD-E03D-4BC0-B115-94D91950FE4A,SioDynamicSetup 18435CD7-8003-4CED-AFA4-ECBC440C0F30,FwBlockServiceDxe 18633BFC-1735-4217-8AC9-17239282D3F8,EfiBttAbstractionGuid 18A031AB-B443-4D1A-A5C0-0C09261E9F71,EfiDriverBindingProtocolGuid 18A3C6DC-5EEA-48C8-A1C1-B53389F98999,EfiSmmSwDispatch2ProtocolGuid 18C040D4-15E4-4148-B7B3-582764710BBC,FprValidityRaptorDriver 18EF8946-68F5-49E6-B202-CE90C3EEF1C9,IchSmmDispatcherDxe 1905FCF3-DDB6-49BB-A785-1E50C807160D,SystemSlotInfoDxe 1967DD9B-B72C-4328-8C80-D4ACFC83FDF8,PciHotPlug 196CA3D8-9A5A-4735-B328-8FFC1D93D188,TcgPlatformSetupPolicy 197DB236-F856-4924-90F8-CDF12FB875F3,Microcode 1988A1D8-04FC-4D68-B58D-636F36F30D82,SoftStrapsPeim 199C1EF0-6400-41C5-B0A4-FFBF219DCBAE,QuarkPlatformTokenSpaceGuid 199FD111-0785-4132-A9B3-1F66573F0060,GenericComponentsSmm 19A84692-4AAD-C04B-90E9-E017360A9860,DiskImage 19AD5244-FD6B-4E5C-826A-414646D6DA6A,EfiGlkVariableGuid 19CB87AB-2CB9-4665-8360-DDCF6054F79D,EfiPciHotPlugRequestProtocolGuid 19D17940-BA8D-4FA7-A704-F33D9FAFAB9D,LibStringlist 19DBBDC1-DEDF-4DED-8684-2476B99FAC91,AST2500DxeInit 19DF145A-B1D4-453F-8507-38816676D7F6,AtaBusDxe 19E3BBBA-BEB1-43E8-B32D-9ACBB22C7639,BasePostCodeLibDebug 1A10742F-FA80-4B79-9DA6-357058CC397B,ArrowCursor 1A1241E6-8F19-41A9-BC0E-E8EF39E06546,EfiHiiImageExProtocolGuid 1A1E4886-9517-440E-9FDE-3BE44CEE2136,CpuDxe 1A345BC0-CC35-9ABC-1CEA-1CAD7D33ADDF,SmcLsiRaidOOBSetup 1A3558EC-13BB-4451-A589-74DFBD9A27AD,LidPoller 1A36E4E7-FAB6-476A-8E75-695A0576FDD7,EfiPeiDecompressPpiGuid 1A481E8E-342F-40AA-AF31-F4FB7C99D428,AmtInt16 1A6853C8-F362-4F68-A77E-0B304A194C05,UseSocketDxe 1A7E4468-2F55-4A56-903C-01265EB7622B,TcpDxe 1A819E49-D8EE-48CB-9A9C-0AA0D2810A38,DxePchPolicyUpdateProtocolGuid 1A8E9D96-66E6-461B-95D6-882C984D0B00,TbtPei 1A926325-2764-47C8-9E1C-4F83B1723336,VirtualEcDxe 1A931FB8-C466-454A-B684-73ADA2CB050B,ASUSPOSTMessagePEI 1AA6D900-89D1-4C21-9C50-EDC7390A67C3,SlotDataUpdateDxeNeonCityFPGA 1B05DE41-C93B-4BB4-AD47-2A78AC0FC9E4,HstiProtocolGuid 1B0FB9BF-699D-4FDD-A7C3-2546681BF63B,EfiWiFi2ProtocolGuid 1B1183FA-1823-46A7-8872-9C578755409D,EfiSmmPowerButtonDispatch2ProtocolGuid 1B1924C3-6321-484F-83EF-8894B21DE258,AmiPeiCrbInfoPpiGuid 1B2C4952-D778-4B64-BDA1-15A36F5FA545,Slp20PubKey 1B45CC0A-156A-428A-AF62-49864DA0E6E6,AprioriPei 1B59CCDA-7DB2-4A55-AFC2-4364F824D288,McBankErrorInjection 1B5C27FE-F01C-4FBC-AEAE-341B2E992A17,FspSFirmwareFileSystemFvGuid 1B6BC809-C986-4937-934F-1EA58622FE50,AmiTseBootOrderChangeGuid 1B6E9D50-12E4-4B55-81D9-1ABFEC59D4FC,WakeupCtrlSmm 1BA0062E-C779-4582-8566-336AE8F78F09,Volume Top File 1BB13967-8B24-411B-9828-18D285A9CC4D,AmiPpiGuid 1BB737EF-427A-4144-8B3B-B76EF38515E6,SdMmcPciHcPei 1BE14579-D805-4C3B-8874-410B818674E9,RealtekPxe 1BE65202-9318-492D-A551-08DF2BD60AEE,AmtPlatformPolicy 1BF06AEA-5BEC-4A8D-9576-749B09562D30,ProcessorProducerGuid 1BFC532E-F48A-4EBE-B2FB-2B286D70A6EB,IconUsbHD 1C0C34F6-D380-41FA-A049-8AD06C1A66AA,EfiEdidDiscoveredProtocolGuid 1C178237-6897-459E-9D36-67CE8EF94F76,EfiKmsFormatMd5sha128Guid 1C58AAC6-76C9-D94D-A14C-0059E13B96A3,AppleMtftp4Dxe 1C6B2FAF-D8BD-44D1-A91E-7321B4C2F3D1,ScriptSaveDxe 1C8B7F78-1699-40E6-AF33-9B995D16B043,PiSmmCommunicationPei 1C98780A-C67D-4D9B-A9D8-4AC0487A6D6E,PcdRecoveryPei 1CBFC9B6-7F1E-4E9E-801F-FBCE4D92A76D,AmiTseBeforeTimeOutGuid 1CE12314-AFBC-11F0-8A3E-AB44B8EE3120,PpmPolicyInitDxe 1CF3F8B3-C5B1-49A2-AA59-5EEF92FFA63C,EfiIa32X64ErrorTypeBusCheckGuid 1CF40D19-EEAD-4C73-93DB-BBB8B6ACF929,UserIdentificationDxe 1D000AE9-756B-4937-B736-1F3D96A5A8F0,Dptf 1D0CFB9B-EB00-43A6-819C-D218DF8DC4B4,BootMode 1D201235-2F40-4FBC-8650-8502092D62AB,LenovoEaiaDxe 1D202CAB-C8AB-4D5C-94F7-3CFCC0D3D335,EfiSmmCpuServiceProtocolGuid 1D292105-2653-11E5-B46F-B8E8562CBAFA,AppleCapsuleRuntimeDxe 1D3DE7F0-0807-424F-AA69-11A54E19A46F,EfiExtScsiPassThruProtocolGuid 1D3E9CB8-43AF-490B-830A-3516AA532047,EdkiiFaultTolerantWriteGuid 1D57B5D5-BAB4-4D2B-B7EB-0EB41D7B189C,LibGlob 1D6F730F-5A55-4078-869B-E0A18324BDC8,TemplateSec 1D6F853E-0006-40D8-9B4B-79618A5733B0,AmiTseOemPortingVar3Guid 1D85CD7F-F43D-11D2-9A0C-0090273FC14D,EfiUnicodeCollationProtocolGuid 1D88C542-9DF7-424A-AA90-02B61F286938,WdtPei 1DA353A3-6400-4241-9AB0-E3E65C690EF7,IchSmbusArpDisabled 1DA97072-BDDC-4B30-99F1-72A0B56FFF2A,EfiMonotonicCounterArchProtocolGuid 1DACE8EE-CD97-491E-8A0C-305D6437323C,OnBrdDevDXE 1DB29AE0-9DCB-43BC-8D87-5DA14964DDE2,EfiUserInfoAccessSetupNormalGuid 1DB43EC9-DF5F-4CF5-AAF0-0E85DB4E149A,BootGuardDxe 1DCFF17C-AA53-4B78-B234-864027555035,LibUefi 1DD1D619-F9B8-463E-8681-D1DC7C07B72C,EdkiiNonDiscoverableSdhciDeviceGuid 1DDBFD6A-3423-462F-9150-A7FFA66FF0CA,StaticSkuDataDxeLightningRidgeEXRP 1DE0B8C2-FFB6-4BDF-97F5-0FFB33979038,BaseReportStatusCodeLibNull 1DF18DA0-A18B-11DF-8C3A-0002A5D5C51B,SataSiI3132 1DFB7BFA-BF8E-4D11-9766-2FB0D0442310,AmiAgesaDxe 1DFFE9F3-7B5F-4B44-8EBD-39A739EBA903,AcpiPlatform 1E2ACC41-E26A-483D-AFC7-A056C34E087B,EfiPlatformInfoGuid 1E2ACC41-E26A-483D-AFC7-A056C34E087C,EfiNorthPeakGuid 1E2ED096-30E2-4254-BD89-863BBEF82325,EfiTcg2FinalEventsTableGuid 1E30E33D-1854-437A-BD68-FC1553AA8BE4,CseEmmcSelectPpiGuid 1E43298F-3478-41A7-B577-86064635C728,OptionRomPkgTokenSpaceGuid 1E469095-EFC8-4147-97DB-4D68B727E2E0,FwBlockService 1E4EAAB1-E637-443E-A5D6-56E60D97C619,UsbComboPeimPei 1E5668E2-8481-11D4-BCF1-0080C73C8881,EfiVariableArchProtocolGuid 1E753E16-DCEF-47D0-9A38-7ADECDB983ED,TcmLegX16FileGuid 1E75E77F-8A15-4653-964D-542C157EF40A,SgPeiPolicyInit 1E77550E-E429-4FA9-BEBF-B515ACF7D919,Ip6 1E82B556-4EB6-479F-955A-78A5FE0C0CB2,BroadcomWirelessDxe 1E843AD6-E237-42FC-BDA2-DE78542E16DD,SstSpiFlash 1E93E633-D65A-459E-AB84-93D9EC266D18,EfiTapeIoProtocolGuid 1E93F29B-A3B2-F340-A605-DE31EE3DA031,EdkTerminal 1EA81BEC-F01A-4D98-A201-4A61CE2FC022,PerformanceExProtocolGuid 1EBE5AB9-2129-49E7-84D7-EEB9FCE5DEDD,EfiEmmcCardInfoProtocolGuid 1EC0EFC9-C93A-4B62-9B27-C059ABD80E92,VlvPlatformInitDxe 1EC0F53A-FDE0-4576-8F25-7A1A410F58EB,StatusCodePei 1EDC318F-4005-488D-AF3A-9BB5179BC6F1,GmchMbiDxe 1EEA2BFE-01CB-40CC-A34E-CB224C800AA2,Tpm2DeviceLibSeC 1F18C5B3-29ED-4D9E-A504-6D978E7ED569,QncS3CodeInLockBoxGuid 1F2CCB4F-D817-404E-98E7-80E4851FB33E,GdbStub 1F2D63E1-FEBD-4DC7-9CC5-BA2B1CEF9C5B,FileExploreFormSetGuid 1F36527E-A97C-45F8-B24A-9D95B0A940FE,AppleBrightnessControl 1F3CDFBE-F7AE-4453-8C48-C1AD35A4FD98,SmbiosDmiEditProtocol 1F4C6F90-B06B-48D8-A201-BAE5F1CD7D56,EfiPeiStallPpiGuid 1F642910-3D7B-4627-8D18-DC62671E0554,BiosReservedMemoryPolicyPpiGuid 1F73B18D-4630-43C1-A1DE-6F80855D7DA4,EfiFormBrowserExProtocolGuid 1F77FFD9-C00D-4245-B2AC-F5F43E333C39,PtuLoader 1F78349D-7FBA-4686-8098-FA017EDA35FB,ArmShellCmdRunAxf 1FA1F39E-FEFF-4AAE-BD7B-38A070A3B609,PartitionDxe 1FA4DAFE-FA5D-4D75-BEA6-5863862C520A,TcgConfigDxe 1FBD2960-4130-41E5-94AC-D2CF037FB37C,EfiAdapterInfoNetworkBootGuid 1FFF93C2-8C76-49E4-8AB3-43D92F5445EF,LogoJpg 201A92E1-2D0F-48E9-A3AB-93E1695A92F2,AppleHDA 202A2922-8C27-4943-9855-26180BF9F113,VariableInfo 202A2B0E-9A31-4812-B291-8747DF152439,Ps2MouseDxe 204810E0-4941-4C66-B99A-6BEE4F84453C,AtherosWiFi 204C3D37-D83F-49AB-883F-9B5D6C647762,FspTempRamExitGuid 20605BBA-7FB9-4279-959F-8DBF74CDB0C6,VideoBios 208117F2-25F8-479D-B726-10C10BED6DC1,AppleLegacyRegion 20830080-CC28-4169-9836-7F42B8D0C8C9,GraphicsOutputDxe 20B181E2-33E8-4211-B9D7-9B8696764E66,WheaElog 20D8FFFE-15C3-4EA9-9D28-CFE2745D78F3,CryptoDxe 20DAF0FC-5548-44DC-A42A-60EAF0A22E47,DxePlatformTdtPolicyGuid 20DE009A-B0B3-43DA-8047-B5E2B19D6CC0,FlashOemHooKDxe 21094ECB-9F20-4781-AE4B-50728B389A6E,IchInit 210DCB72-BC14-4A19-A29B-F696EB7DE12B,EzSetup 2119BBD7-9432-4F47-B5E2-5C4EA31B6BDC,DxeIpl 21429B90-5F67-4E93-AF55-1D314D646E12,MemoryProfileInfo 2145F72F-E6F1-4440-A828-59DC9AAB5F89,EmmcDxe 215FDD18-BD50-4FEB-890B-58CA0B4739E9,EfiSioProtocolGuid 2167F964-7298-4A8F-9A2A-BFE498D600A8,HddReadySmi 21891A9E-763E-4377-8841-8D5C90D88C51,NetworkStackSetupScreen 21A05FD5-DB4A-4CFC-B84B-EB0DBB569934,IconGenericCD 21ADC483-021F-4F3B-8DCE-613CC981A269,menu_dots_selected 21AF95E1-371F-4712-9C07-798E3CB019E4,LockSMRAMEntryDxe 21CCF0B7-246B-412C-A334-0B65A07B28DF,SmmBaseOnSmmBase2Thunk 21E34727-3881-4DEE-8020-D8908A980311,EpuHwModeDxe 21E70404-DF72-4122-B030-281306EB7BE3,VbtEdpTypeCGuid 21F302AD-6E94-471B-84BC-B14800403A1D,EfiSmmCpuSaveStateProtocolGuid 21FF1FEE-D33A-4FCE-A65E-955EA3C41F40,QNCMemoryInitPpiGuid 22046D50-F390-498C-92E5-5BA4F8E7F8B6,SBSATAIDE 220E73B6-6BDB-4413-8405-B974B108619A,EfiFirmwareVolume2ProtocolGuid 221521AE-0A35-44CD-B580-5AEDBB770B1D,glyphs 22198FD5-4835-4842-BF31-EB957C7DD70D,GetNetByAddr 221F1D4F-034C-4BEA-B2BB-B7A9672B06D7,CRBSMI 222C386D-5ABC-4FB4-B124-FBB82488ACF4,PlatformPei 224FBFE4-ADB6-4DF2-B835-602182AEEF20,Clock 22597239-6107-DF44-AD3F-5F053E92222E,EmuSnpDxe 228F344D-B3DE-43BB-A4D7-EA200B1B1482,EfiSmMonitorInitProtocolGuid 229832D3-7A30-4B36-B827-F40CB7D45436,EfiPeiStatusCodePpiGuid 22B194B4-CC0E-46C7-9FCE-DA10D6ED1731,PchSmbusArpEnabled 22BDEE84-C807-452E-B56E-F683FD76C989,BuslogicDxe 22DC2B60-FE40-42AC-B01F-3AB1FAD9AAD8,EmuVariableFvbRuntimeDxe 22EA234F-E72A-11E4-91F9-28D2447C4829,HttpUtilitiesDxe 2338337A-47B0-4C41-9CA7-0160FB94DFF4,PlatformFlashDxe 233C2592-1CEC-494A-A097-15DC96379777,FwVolDxe 2342CA44-3B35-4A34-995B-CEDEEB1A9576,Intel945Uga 2354D320-3EB3-4C81-99F4-CC4AE143463E,EfiEdkCompatibilityPkgTokenSpaceGuid 2362EA9C-84E5-4DFF-83BC-B5ACECB57CBB,AmiCsmThunkDriverGuid 2366C20F-E15A-11E3-8BF1-E4115B28BC50,HttpDxe 2374EDDF-F203-4FC0-A20E-61BAD73089D6,IoTrap 2383608E-C6D0-4E3E-858D-45DFAC3543D5,PciHostBridgeDxe 239421F6-F025-429C-9889-AB854E00EEE6,CheckRaid 23A089B3-EED5-4AC5-B2AB-43E3298C2343,VariableSmm 23A464AD-CB83-48B8-94AB-1A6FEFCFE522,EfiSioPpiGuid 23D1280D-43F0-4713-90B2-0E5E4221AF4C,BatteryState1 23EED05D-1B93-4A1A-8E1B-931D69E37952,Omap35xxBoardInterruptDxe 23F69CD0-FF46-4DB6-B982-63EDF1A901FF,AmiTseOemPortingGuid2 240612B5-A063-11D4-9A3A-0090273FC14D,IsaBusDxe 240612B5-A063-11D4-9A3A-0090273FC18E,SmmCoreDispatcher 240612B7-A063-11D4-9A3A-0090273FC14D,UsbBusDxe 240612B7-A063-11D4-9A3A-0090273FC14E,SystemUsbSupportPolicyDxe 24169E35-2454-4940-92BC-82321A2C7562,VlvInitPeim 24486226-F8C2-41F5-B9DD-783E9E56DEA0,EfiMmioDeviceProtocolGuid 245DCA21-FB7B-11D3-8F01-00A0C969723B,EfiPxeBaseCodeCallbackProtocolGuid 2477BE9E-8E1A-431E-B705-14E663717377,PsmiComboBufferGuid 2480271C-09C6-4F36-AD75-5E1390BD9929,QNCSmmDispatcher 2486829B-D3F3-47EC-827A-FC104907FC5C,SmmGenericSio 24A2D66F-EEDD-4086-9042-F26E4797EE69,RootBridgesConnectedEventGroupGuid 24A44CAF-0BF2-4514-90C4-C794B3E778F5,MePolicyInitDxe 24B09ABE-4E47-481C-A9AD-CEF12C392327,Omap35xxTokenSpaceGuid 24C5DC2F-53E2-40CA-9ED6-A5D9A49F463B,EfiHashAlgorithmSha1NoPadGuid 24C6F3E2-6ACD-436B-A604-56A5CF742A55,BaseFspPlatformInfoLibSample 24CCD374-3DF6-4181-86F6-E3C66920A145,UpdateMemoryRecord 24E70042-D5C5-4260-8C39-0AD3AA32E93D,EfiSmmEndOfDxeProtocolGuid 24E9A512-3A25-4CBA-A0AE-67C053BDF3B6,DxeVideoTextOut 253E85E9-993B-439B-B74C-6120F77B4723,PlatformReset 254901AD-7DB7-45F8-93C8-93D579398D9F,PeiPciSegmentLibPciCfg2 2554EF5E-C9CA-4A48-9D94-249EB1E87C2D,LenovoCryptService 25566B03-B577-4CBF-958C-ED663EA24380,EfiSmmGpiDispatch2ProtocolGuid 25A4FD4A-9703-4BA9-A190-B7C84EFB3E57,FdtVariableGuid 25A8824E-6BBF-4FB2-A200-84B0F7BECE6B,B57785 25ACF158-DD61-4E64-9A49-55851E9A26C7,CsmBlockIo 25F200AA-D3CB-470A-BF51-E7D162D22E6F,ShellDebug1HiiGuid 25F49067-A65B-48F5-BBBE-35418C488836,TcgDxeMainDxe 263631D7-5836-4B74-BE48-EE22E92CE5D3,WinNtConsoleDxe 26452F27-45DE-4A94-807A-0E6FDC1CB962,EmuPeiGateDxe 266E31CC-13C5-4807-B9DC-39A6BA88FF1A,CpuInitDataHobGuid 26703ED8-9171-40A3-95C2-56436F8A5E56,EfiBpCommonPkgTokenSpaceGuid 26841BDE-920A-4E7A-9FBE-637F477143A6,Ip4ConfigDxe 2686340E-665C-427F-8819-05BA54F030F5,IdeController2 2688B232-9C02-4C12-BE1F-857C0FF2AAE3,TcgDxeplatform 268F33A9-CCCD-48BE-8817-86053AC32ED6,PeiSmmAccessPpiGuid 26A2481E-4424-46A2-9943-CC4039EAD8F8,S3Save 26BACCB1-6F42-11D4-BCE7-0080C73C8881,EfiCpuArchProtocolGuid 26BACCB2-6F42-11D4-BCE7-0080C73C8881,EfiMetronomeArchProtocolGuid 26BACCB3-6F42-11D4-BCE7-0080C73C8881,EfiTimerArchProtocolGuid 26C628F2-CED5-466C-8237-433CA4D24241,MemoryEvContent 26CC0FAD-BEB3-478A-91B2-0C188F726198,EfiPeiVirtualBlockIo2PpiGuid 26DDBA9F-5B0D-4E80-86B2-80DAE4D01B0E,FdiskOemDxe 26EEB3DE-B689-492E-80F0-BE8BD7DA4BA7,EfiSmmConfigurationProtocolGuid 26FDEB7E-B8AF-4CCF-AA97-02633CE48CA7,EfiProcessorSubClassGuid 2700F72F-E0EA-4767-9A1E-D172F0704778,PeiSelStatusCode 270279D6-2554-47BE-97D0-6AE5AD18B973,OemEeprom 2707E46D-DBD7-41C2-9C04-C9FDB8BAD86C,JpegDecoderDxe 271B424E-A4CC-4E0E-90A2-7EA4841F12F3,ExportHiiDb 271DD6F2-54CB-45E6-8585-8C923C1AC706,PchS3Peim 271F1343-20D6-4E14-9B62-3C0297F56F07,SmmPowerManagement 274F0C8F-9E57-41D8-9966-29CCD48D31C2,SmmAccess 2755590C-6F3C-42FA-9EA4-A3BA543CDA25,EfiDebugSupportProtocolGuid 2799A453-FC10-4334-9E66-D3D6EF09D0EE,AmiTseOemPortingVar5Guid 27ABF055-B1B8-4C26-8048-748F37BAA2DF,EfiEventExitBootServicesGuid 27BA7E67-D54D-4983-BE18-9DF07D2389DC,SystemNvmeServiceOwnerDxe 27BEDA18-AE2B-43C2-AF6B-74952441DE28,MonitorKeyDxe 27CFAC87-46CC-11D4-9A38-0090273FC14D,EfiRealTimeClockArchProtocolGuid 27CFAC88-46CC-11D4-9A38-0090273FC14D,EfiResetArchProtocolGuid 27E569D5-0AFC-4D8F-8C90-783AC4A318AB,SaAcpiTables 27F05AF5-1644-4EF4-8944-48C4F75675A0,RealTimeClockDxe 27F4917B-A707-4AAD-9676-26DF168CBF0D,PchSpiSmm 27F51949-1577-4CF6-B2E2-AE9392A4EBB7,BootPriority 283FA2EE-532C-484D-9383-9F93B36F0B7E,EfiUpdateDataFileGuid 28451AA4-B4C4-4AA9-BE3A-1BBCC2E5553A,GptRecovery 286BF25A-C2C3-408C-B3B4-25E6758B7317,EfiTpmDeviceInstanceTpm20DtpmGuid 2890B3EA-053D-1643-AD0C-D64808DA3FF1,HardwareInterruptProtocolGuid 2894EC46-C67A-4256-87DE-34A741D85982,MctPei 2899C94A-1FB6-4B1A-B96B-8364975303E0,Ps2MouseAbsolutePointerDxe 28A03FF4-12B3-4305-A417-BB1A4F94081E,RamDiskDxe 28A88A39-DD84-483F-9BEF-BA1168C2F850,UbaInitPei 28BDE99C-E8A7-4E3E-9A8A-E66CD64F31C6,BasePciLibCf8 28D46803-7646-4DFE-90ED-8575584ED6E6,AMTPolicy 2906CC1F-09CA-4457-9A4F-C212C545D3D3,AppleEpidGroupPublicKeysRl 290B026F-6905-4612-BA0F-F635DDE35285,ErrorTriangle 290EA249-6E88-423C-B0DA-75CDDE7920CC,AmtPetAlert 29142FB2-26D9-4C3A-A4BA-7BBD0364EEAE,BaseSmbusLibNull 291A3B75-C685-475E-876B-2E40A6A7E18A,SetTimerPeriodDxe 291E46D4-CA63-4D33-9857-1397C9AD7C0D,LegacySmmSredir 29206FC2-9EAB-4612-ACA1-1E3D098FB1B3,LegacyVideoRom 2928D39C-917D-4F2F-9510-16AB73F204B2,BiosAcm_Field 294B196A-A3CC-4A43-857F-EEC26147857B,Tpm2DeviceLibSeC 294B1CEF-9BEB-42D5-9971-0C8963CDAF02,SmLogo 296EB418-C4C8-4E05-AB59-39E8AF56F00A,EdkiiSmmExitBootServicesProtocolGuid 2977064F-AB96-4FA9-8545-F9C40251E07F,EfiPlatformPolicyProtocolGuid 299141BB-211A-48A5-92C0-6F9A0A3A006E,PowerManagementAcpiTables2 29926D4A-E531-490C-A529-C05E8A1D60D3,FwhFlashLibNull 299D6F8B-2EC9-4E40-9EC6-DDAA7EBF5FD9,SiInit 29B3C4C6-E5AA-49E4-8CE0-2772F782DDC2,WinNtGopDxe 29BE380A-FBC0-462B-A6C2-5C5A076CAFDE,ProjectPEI 29CBB005-C972-49F3-960F-292E2202CECD,FspNotifyPhasePeim 29CF55F8-B675-4F5D-8F2F-B87A3ECFD063,CsmVideo 29D02CE2-4A2C-45E1-9DC1-E7049B7DB321,SaDataHobGuid 29D8DD19-C836-45D9-8F05-322C27129C2A,SecureVariable 29E0564F-B702-4352-A3A1-15FABD4A4E4A,IioCfgUpdateDxeLightningRidgeEXECB3 29E3DB8C-3B30-49D7-9262-53FB917B9A6B,BochsVga 2A1E1C92-AABA-4D62-AC40-F3A4C3387356,PeiSmbusLibSmbus2Ppi 2A205AA9-F7EA-47BE-B3BD-7631E99B4351,G3WakeupPei 2A304EE1-F3C3-4F35-95CD-93DD0DA00F2E,SystemSmbiosBcpDxe 2A32CCEA-5D78-46D7-BAED-8E53A1B31357,AcpiPlatformDxe 2A3CFEBD-27E8-4D0A-8B79-D688C2A3E1C0,EfiSmmLockBoxCommunicationGuid 2A4224A1-2609-40A7-88E2-A68DC0F1D180,SpiFlashProDxe 2A43BA5F-AC29-4FDC-8A3B-0328D0256F8C,SocketDxe 2A46715F-3581-4A55-8E73-2B769AAA30C5,RamDiskFormSetGuid 2A4D1ADF-21DC-4B81-A42F-8B8EE2380060,EfiSmartCardReaderProtocolGuid 2A500CFB-920E-49F4-9988-5CE4C0EFD3AB,SmbiosDmiEditAfriSmi 2A534210-9280-41D8-AE79-CADA01A2B127,EfiDriverHealthProtocolGuid 2A571201-4966-47F6-8B86-F31E41F32F10,EfiEventLegacyBootGuid 2A591128-6CC7-42B1-8AF0-58933B682DBB,EfiExtendedSalMcaServicesProtocolGuid 2A6E902B-F1F3-4275-BC7B-40FD4B5481E7,FlashUpdBootModePpiGuid 2A72D11E-7376-40F6-9C68-23FA2FE363F1,EfiEbcSimpleDebuggerProtocolGuid 2A7946E3-1AB2-49A9-ACCB-C6275139C1A5,TrEEDxe 2A9D5E7F-A43A-4FC7-A25E-6E28D412FA6F,efi_pop_RT 2AB86EF5-ECB5-4134-B556-3854CA1FE1B4,EfiPeiReadOnlyVariable2PpiGuid 2AD0FC59-2314-4BF3-8633-13FA22A624A0,PlatformPei 2AD511C7-1B60-4002-841D-2998DDC138EE,CryptoSMM 2AD8E2D2-2E91-4CD1-95F5-E78FE5EBE316,EfiUsbProtocolGuid 2ADB8F5B-C7D4-4E7E-BE2A-23634DF668A1,MouseDriver 2AE9D80F-3FB2-4095-B7B1-E93157B946B6,EfiHashAlgorithmSha1Guid 2B0585EB-D8B8-49A9-8B8C-E21B01AEF2B7,AppleLegacyLoad 2B1D0832-2184-4C8F-A90D-8E4AF9DE5BCD,BootModePeim 2B2F68D6-0CD2-44CF-8E8B-BBA20B1B5B75,EfiUsbIoProtocolGuid 2B341C7B-0B32-4A65-9D46-E1B3ABD4C25C,Smbios131 2B3685C5-CF90-4A67-8A48-9134BA32D677,PlatformStage1Pei 2B4034AE-8566-412F-9CA5-67FD698FC261,TcoSmi 2B73B074-2E67-498B-82AC-CE38FB770FFC,DxeSalLibEsal 2B8A4061-9131-4D2A-A20B-D845D0EB1D83,Smbrun 2B9FFB52-1B13-416F-A87B-BC930DEF92A8,TcgEventEntryHobGuid 2BB5AFA9-FF33-417B-8497-CB773C2B93BF,CpuPei 2BBED685-6633-455F-A840-43A22B791FFF,AcpiFPDTSupport 2BC1C74A-122F-40B2-B223-082B7465225D,FspWrapperTokenSpaceGuid 2BDED685-F733-455F-A840-43A22B791FB3,AcpiS3SaveDxe 2BE1E4A6-6505-43B3-9FFC-A3C8330E0432,TcgPei 2C03C536-4594-4515-9E7A-D3D204FE1363,EfiFileExplorerProtocolGuid 2C181BE1-8BAC-4433-873C-E5074CB5A723,UbaConfigDatabasePei 2C194230-54B6-4C95-B809-877E83309358,ASUSGamingBoard 2C29929E-27CF-4DD5-BB97-E5525791F5BA,DRYDXE 2C6B9CB7-A13B-4EEE-80C0-1A240C8A69EE,IccOverClocking 2C6CACC6-6C3C-4AA7-B2DE-384DAE2B0352,RegAccessPeim 2C8759D5-5C2D-66EF-925F-B66C101957E2,EfiIp6ProtocolGuid 2C878DFE-F92E-4D00-BCED-146AFE099841,MemCacheInit 2CA88B53-D296-4080-A4A5-CAD9BAE24B09,LoadFixedAddressConfigurationTableGuid 2CB4F37A-0026-43AF-A948-D71976A96860,CpuIoDxe 2CE5604F-A982-4D2E-8FD0-D1600C2E1515,PciDynamicSetup 2D1E361C-7B3F-4D15-8B1F-66E551FABDC7,SaLateInitSmm 2D27C618-7DCD-41F5-BB10-21166BE7E143,BiosAc 2D2E62AA-9ECF-43B7-8219-94E7FC713DFE,UsbMouseDxe 2D2E62CF-9ECF-43B7-8219-94E7FC713DFE,UsbKbDxe 2D3F7085-BA63-4739-A15F-C8802B6B807B,NCT3933Pei 2D408713-4023-4324-B8EA-53C02A83D941,PeCoffExtraActionLibSmm 2D59F041-53A4-40D0-A6CD-844DC0DFEF17,SmmS3SaveState 2D61B52A-69EF-497D-8317-5574AEC89BE4,FirmwarePassword 2D6BB83D-84A2-404A-B4CA-3E7AC0EFB3D2,BootOptionPolicyDxe 2D6F6BCC-9681-8E42-8579-B57DCD0060F0,AutoScanPei 2D9BD72A-B238-4BFF-9BB9-B51E0D4D553C,SlotDataUpdateDxeLightningRidgeEXECB3 2DA064D8-5A52-4DAC-B60F-54471A7FC372,CspFlashLibNull 2DCBE49A-1E5B-486E-BC23-48156B8282C9,X11DxeDriver 2DCE8BB1-BDD7-450E-B9AD-9CF4EBD4F890,EfiEventNotificationTypeCmcGuid 2DDFEDFE-C2D5-43E3-9E10-46DB2C7C1F26,SmbiosElogSetupScreen 2DE2AE4B-7489-4D91-9B63-9B12CC564540,A01DxeServiceBody 2DE648CB-3102-43CA-A02E-42E38EA5E789,ProcessorErrorHandler 2DEAE482-5796-40F2-8DF5-D87419D6F362,ASUSHDDPW 2DED8109-2355-41F8-A657-D608D5CC1022,SdxcDxe 2DF10014-CF21-4280-8C3F-E539B8EE5150,PpmPolicyInitDxe 2E058B2B-EDC1-4431-87D9-C6C4EA102BE3,ScNvsAreaProtocolGuid 2E1C3FF9-DC75-41C5-BD48-26087B5DC92A,EdkiiVariableStorageIoCompletionProtocolGuid 2E2D1233-435E-F56F-7CC3-348CE660D1CF,SystemErrorEventsDxe 2E3044AC-879F-490F-9760-BBDFAF695F50,EfiLegacyBiosGuid 2E3AB8B6-AC9D-4D70-A675-54F52FB22D66,AtaPassThru 2E3D2E75-9B2E-412D-B4B1-70416B8700FF,RecoveryOnFatFloppyDiskGuid 2E5CFC2C-9CC0-4D78-BEAF-D84CBF20D1C8,efi_pop_LF 2E6A521C-F697-402D-9774-98B2B7E140F3,PlatformInitDxe 2E6FECFB-B0E1-4580-8966-29178C72022E,SmmS3BootScriptLibS3SmmSaveStateProtocol 2E7472A2-D7BF-4F5E-8FE4-BF19247856D0,SecCore 2E7D322C-0E5C-11DF-A0DE-1BF2A44EDC7E,VmwExtCfgDevDxe 2E7DB7A7-608E-4041-B45F-00359E0766C6,FvbServicesSmm 2E8CD01A-BDB7-40B4-8376-E7C26EAC21FF,PciPlatform 2EA77912-80A8-4947-BE69-CDD00AFBE556,EdkiiNonDiscoverableUfsDeviceGuid 2EA84160-ABA0-11DF-9896-0002A5D5C51B,PL301Axi 2EAA04AA-5EED-4C27-B9EE-26916EC25A8F,RtkUndiDxeX64_011 2EBE0275-6458-4AF9-91ED-D3F4EDB100AA,SignOn 2EC3760F-B7FC-4FC7-B8B4-CF371C9628FF,ThunderboltXDomainDevice 2EC499F9-0337-4DA1-91CA-6BC4E8C03DA2,Mtftp6Dxe2 2EC9DA37-EE35-4DE9-86C5-6D9A81DC38A7,AmdSevDxe 2ECED69B-2793-4388-BA3C-823040EBCCD2,EfiOSInfo 2EE72E7C-FB9E-4318-B888-33A315C7A91D,PpmPolicy 2EE81ACB-64B2-41AE-8635-7030D16C4AA8,PchBiosWriteProtect 2F08C089-2073-4BD9-9E7E-308A18327B53,IconWirelessSmall 2F2295B6-1BB6-4CB7-BB9E-15C2C3424277,PcieSataController 2F240E12-E14D-475C-83B0-EFFF22D77BE7,EfiKmsFormatSha512512Guid 2F3962B2-57C5-44EC-9EFC-A69FD302032B,TopOfTemporaryRamPpiGuid 2F4DDD35-F8C0-46D2-B0E3-A701360D7499,PcieLaneDXE 2F62A818-4A72-CD40-90B9-FF00DAABEE7B,EmuThunk 2F707EBB-4A1A-11D4-9A38-0090273FC14D,EfiPciRootBridgeIoProtocolGuid 2F72309E-D5B0-4A9D-84A9-1AB38C698F78,EcPs2Kbd 2F87BA6A-5C04-4385-A780-F3BF78A97BEC,EfiBlockIoCryptoAlgoAesXtsGuid 2FA2A6DA-11D5-4DC3-999A-749648B03C56,PiSmmIpl 2FB92EFA-2EE0-4BAE-9EB6-7464125E1EF7,UhciDxe 2FC3B2D3-6EBA-42B0-A4A7-14C7A84B5D22,EslIp6ServiceGuid 2FD21CF6-E6E8-4FF2-A9CA-3B9F00E92889,rmHwA9x4Guid 2FD8B7AD-F8FA-4021-9FC0-0AA572147CDC,CpuPei 2FDACAF6-669D-4F8C-8368-C3B3E6E32535,UsbBbs 2FE800BE-8F01-4AA6-946B-D71388E1833F,EfiMtftp4ServiceBindingProtocolGuid 2FF29FA7-5E80-4ED9-B380-017D3C554FF4,EfiSmmRscHandlerProtocolGuid 300DE6C5-765C-4F89-BD6D-A623785ABC27,PchLibNull 301A0BC3-BA16-49F9-858B-DEE05F91E7B8,TpAcpiNvsInitDxe 301AF449-E0D7-43A3-8B1B-BC16725D374B,DxeDebugDispatchProtocolGuid 3022E512-B94A-4F12-806D-7EF1177899D8,PciHotPlug 3073D8AC-EFAB-4055-9B37-F62CD93A200A,IrqAllocatorDxe 3079818C-46D4-4A73-AEF3-E3E46CF1EEDB,EfiBootScriptExecutorVariableGuid 30806658-1E9C-4A13-971E-707A69E958C8,Int15Microcode 3095CD79-5B45-49DF-B27F-EF43843B8480,IrqBoardInfoSct 309DE7F1-7F5E-4ACE-B49C-531BE5AA95EF,EfiGenericMemTestProtocolGuid 30AC275E-BB30-4B84-A1CD-0AF1322C89C0,PeiSpeakerInterfacePpiGuid 30AD2B83-ADD0-414B-B11C-F93CC1D0B79B,AmiProcessTcgPpiRequestGuid 30B6EB8F-08A3-4E66-8279-D8681D127F59,LenovoTpmFwWufuDxe 30CC8A21-0476-4C80-B5C5-B26947E1891D,XhciDebugger 30CFE3E7-3DE1-4586-BE20-DEABA1B3B793,EfiPciEnumerationCompleteProtocolGuid 30EB0F26-FC0A-4FD2-B9C9-751EA2BB1980,DataSource 30FD316A-6728-2E41-A690-0D1333D8CAC1,EmuGraphicsWindowProtocolGuid 310B3904-0728-4977-A90C-06B8ECD85A9F,BootOptionService 3137130C-D0A7-467E-9E8F-513816F159D8,OpromUpdateDxeNeonCityEPRP 3138C825-83ED-064A-A62A-CD13674E3F89,AppleDhcp4 31401EE7-1600-437C-A11C-B1035D8E6070,PchAcpiTables 3141FD4D-EA02-4A70-9BCE-97EE837319AC,TrEEConfigDxe 3152BCA5-EADE-433D-862E-C01CDC291F44,EfiRngProtocolGuid 316B1230-0500-4592-8C09-EABA0FB6B07F,SmmHddSecurity 316C608A-4429-49FC-9E2C-0B814D5EE4F3,PlatformPolicyManagerDxe 316C618A-4429-493C-9E2C-0BA14D5EE4F3,SstSpiChipDxe 31740724-5F96-48CA-AA0F-332ACA6B9A75,SpcrAcpiDxe 3175E6B9-4B01-496A-9A2B-64AF02D87E34,CpuExceptionHandlerLibNull 31878C87-0B75-11D5-9A4F-0090273FC14D,EfiSimplePointerProtocolGuid 319CE8BB-DA2E-4FF2-B69B-0A854146B489,SystemUsbHidParserDxe 31A0B6EF-A400-4419-8327-0FB134AA59E7,Mxm30Dxe 31A4878F-230D-4FC2-90BB-DA5F41A44B1B,DxeDebugportExtProtocolGuid 31A6406A-6BDF-4E46-B2A2-EBAA89C40920,EfiHiiImageProtocolGuid 31CA5D1A-D511-4931-B782-AE6B2B178CD7,EfiIfrFrameworkGuid 31CE593D-108A-485D-ADB2-78F21F2966BE,EfiLegacyInterruptProtocolGuid 31E147A6-D39A-4147-9DA3-BEFD4D523243,CdExpressPei 31F5B262-7D9E-4FCC-9BB8-0E415D0CD748,BFGPei 31FD7EAF-80A7-435E-8E0A-3F185F8667DD,UsbCoreDxe 320AFE62-E593-49CB-A9F1-D4C2F4AF014C,EfiS3SmmSaveStateProtocolGuid 320BDC39-3FA0-4BA9-BF2D-B33F72BA9CA1,AmiTpmSupportTypeProtocolguid 320E0C11-B5FE-4C20-B8A8-815A20700CEF,AppleIpAgentDxe 3233B6B9-F4AC-4FE1-9021-71D0B4F0AD82,BiosMeFwLayout 3237418A-478C-4700-B59F-768E2CCBC726,CmosDxe 3242A9D8-CE70-4AA0-955D-5E7B140DE4D2,EfiSmmCpuIo2ProtocolGuid 32442D09-1D11-4E27-8AAB-90FE6ACB0489,SystemFormBrowserCoreDxe 3262D1AD-A8A8-4597-825E-DE6F167C3407,PlatformErrorHandler 326AE723-AE32-4589-98B8-CAC23CDCC1B1,PcAtChipsetPkgTokenSpaceGuid 326E7ACE-2133-1BA2-800A-B9C00ACCB17D,CpuSmmSaveRes 326E9CC6-9839-4885-B2ED-275903B668E1,SmmAccess2 32C1C9F8-D53F-41C8-94D0-F6739F231011,BiosExtensionLoader 32CBA21F-F308-4CBC-9AB5-F5A3699F044A,EfiUserCredentialClassFingerprintGuid 32D2963A-FE5D-4F30-B633-6E5DC55803CC,EfiUsbFunctionIoProtocolGuid 32FF59CD-0C33-48D0-A244-4BB811336403,EslUdp6ServiceGuid 330D4706-F2A0-4E4F-A369-B66FA8D54385,EfiHiiConfigAccessProtocolGuid 3316A5D0-FE16-40E2-8114-75E5724449F8,IntelLANDxe 331DEB15-454B-48D8-9B74-70D01F3F3556,UefiDriverEntryPoint 332A0926-429B-4624-9211-A36B23DF0389,OhciPei 333BB2A3-4F20-4C8B-AC38-0672D74315F8,AcpiPlatformPei 333BB2A3-4F20-4CCC-AC38-0672D7412345,FastBootPei 334D5254-6160-4E4A-A78C-E15D3B3B3334,MmcHost 335984BD-E805-409A-B8F8-D27ECE5FF7A6,EfiStatusCodeSpecificDataGuid 335B0F6A-FCBD-402A-B4BB-0C3EEDAAF9D3,EhciRouting 336074B2-2A13-46CD-B458-FD4AEBBA28A9,AmiGlkCpuPkgTokenSpaceGuid 3370A4BD-8C23-4565-A2A2-065FEEDE6080,SecSMIFlash 337F4407-5AEE-4B83-B2A7-4EADCA3088CD,EfiHiiUserCredentialFormsetGuid 338695EA-CA84-4FA2-9DA8-5C4BB87905C6,XenioFdtDxe 3389A820-4A27-4FA9-ADBD-39AB18078FA7,AmdSb900PeiSmbus 339370BD-CFC6-4454-8EF7-704653120818,ThunderboltDROM 3399DA41-CE44-4FDD-8D32-E578381FEBE0,menu_bottom_right 339EC458-9B6A-4CEC-A47A-712873653299,StdFlashLibNull 33C27B86-0A39-48DA-9497-68A3E5C3928D,OemDxeHook 33C6406D-2F6B-41B5-8705-52BAFB633C09,AlertStandardFormatDxe 33C6B455-87A9-4C8C-A4F6-6DB508A6260E,SkipScanRemovableDev 33CB97AF-6C33-4C42-986B-07581FA366D4,BlockMmioToBlockIoDxe 33D33BF3-349E-4768-9459-836A9F7558FB,DxeIoLibCpuIo2 33FB3535-F15E-4C17-B303-5EB94595ECB6,SmmLockBox 340436B0-EBFA-408A-9B8B-565B1F77CF2C,Lpc47N20x 345ECC0E-0CB6-4B75-BB57-1B129C47333E,EfiPlatformToDriverConfigurationClpGuid 346B093A-9002-4E99-A2F2-27A16C3DCD89,OemModifyOpRegion 3470CCF0-6054-11DD-AD8B-0800200C9A66,EzFlash 348C4D62-BFBD-4882-9ECE-C80BB1C4783B,HiiDatabase 348CA223-637B-4430-BAF3-1CE5D322B3FD,SetupBoot 34989D8E-930A-4A95-AB04-2E6CFDFF6631,TcgPei 349CF818-C0BA-4C43-929A-C8A1B1B3D255,InternalTpm2DeviceInterfaceGuid 34B78650-B0BA-428F-87B1-A1AC762F7FBF,EfiHeciRuntimeProtocolGuid 34C8C28F-B61C-45A2-8F2E-89E46BECC63B,PeiVariablePei 34CC6167-7AE7-403E-8AB2-23837F398A30,PlatformInfo 34E5798E-F44F-4526-A08C-39BCA6E8D7D5,ProgramGPIOPei 34F60DB9-D3E4-428B-B770-3541C8E05112,SgxConfig 34F85EE2-93C2-4481-B710-D3490CCA6333,ACPIRAMSMM 34FB5A1B-E3CD-4893-9403-0A39BA62FDA0,SvSmmSupport 35034CE2-A6E5-4FB4-BABE-A0156E9B2549,PlatDriOverrideDxe 3513C4E2-06D6-4921-9C2B-E938777BA79E,EblCmdLibNull 35169D2C-2426-45CC-8AF4-5B618BC9A00A,EfiHeci2PmProtocolGuid 352C6AF8-315B-4BD6-B04F-31D4ED1EBE57,CbSupportPeim 3543EC9D-4B27-4FA9-ADBD-1DE118078FA7,AmdSb900Pei 3543EC9D-4B27-4FA9-ADBD-1DF118078FA7,AmdSb800_PeiPei 355FBDA9-4572-49BC-95B9-545E71DEF9F9,FpgaSmm 35628CFC-3CFF-444F-99C1-D5F06A069914,EfiDevicePathPropertyDatabase 356C2B12-3124-4451-BF66-B502D88A0074,XhciDxe_ 35B72237-3926-CF4A-A7F3-1449F9E0E4BD,EmuSimpleFileSystem 35B898CA-B6A9-49CE-8C72-904735CC49B7,DxeMainDxe 35C0C168-2607-4E51-BB53-448E3ED1A87F,PciBusNoEnumerationDxe 35C5AB3E-B77A-450C-8854-159B2F0D32A5,Ich7MSmmDispatcher 35D13CFD-0BAF-11E8-AE0A-B8E8562CBAFA,AppleHpetTimerDxe 36164812-A023-44E5-BD85-05BF3C7700AA,EfiFindFvPpiGuid 36232936-0E76-31C8-A13A-3AF2FC1C3932,AmiDebuServiceProtocolGuid 3629DDB1-228C-452E-B616-09ED316A9700,EfiPaddingNoneGuid 362C7275-4D8F-4607-8D8F-28893A8ACD60,EpuHwModePei 36544866-6D93-7A48-88FB-669582D2516B,ApplePlatformInfoDatabaseDxe 3672557A-06A7-43EF-60C3-1964F3DD1198,SmcOutBand 3677770F-EFB2-43B2-B8AE-B302E9604882,AmiTseEventBeforeBootGuid 3677D529-326F-4603-A926-EAACE01DCBB0,EfiPciExpressBaseAddressGuid 368B3649-F204-4CD0-89A8-091077C070FA,AcpiPlatform 3698D2B0-E727-4537-A636-A8770736ABFB,GetHostByDns 36B37F21-9D04-44B5-95EC-4DE4CB2FE6FB,menu_locked_selected 37087B94-EF41-4977-93E2-3F6ADFDD06E1,LenovoSplashDxe 37347E20-5C3D-47B7-B233-1E353A7E0145,AppleHttpClient 37499A9D-542F-4C89-A026-35DA142094E4,EfiUartDevicePathGuid 374DE830-81C5-4CC8-B2AB-28F0AB73710B,SmmCpuFeaturesLibStm 377C66A3-8FE7-4EE8-85B8-F1A282569E3B,EfiPlatformIdeInitProtocolGuid 377C79B2-1A40-441E-B6F5-A170E3753725,LenovoTpmMeasureDxe 378D7B65-8DA9-4773-B6E4-A47826A833E1,PcRtcDxe 378D7B65-8DA9-4773-B6E4-A47826A833E2,PcRtcSmm 3792095A-E309-4C1E-AA01-85F5655A17F1,EfiSmmAccessProtocolGuid 3792FF94-8614-45ED-902B-1207BF1490A8,PrintThunk 37A01080-2346-4A54-9900-D22B7B687C22,SmmPciRbIo 37AFCF55-2E8C-4722-B950-B48B9165C56B,LenovoSetupMainDxe 37D43B2A-43A0-4AEA-AB79-E4FEF53C0F12,MicroCodepointerGuid 37DA43A1-BB9A-4805-9B92-0BDE11191149,ACPIRAM 3812723D-7E48-4E29-BC27-F5A39AC94EF1,ItkDataVarGuid 38321DBA-4FE0-4E17-8AEC-413055EAEDC1,EfiLegacy8259ProtocolGuid 3863C4B4-AD58-4383-AB89-0E0B768DDB70,AplLayoutParsing 3868FC3B-7E45-43A7-906C-4BA47DE1754D,EfiSmmFaultTolerantWriteProtocolGuid 386A4B1C-DDE4-4FC5-9B03-9C928FCC6FD2,gear1 38705437-5697-4715-85C6-29933073C212,SystemBoardPpi 387477C1-69C7-11D2-8E39-00A0C969723B,EfiSimpleTextInProtocolGuid 387477C2-69C7-11D2-8E39-00A0C969723B,EfiSimpleTextOutProtocolGuid 388278D3-7B85-42F0-ABA9-FB4BFD69F5AB,EfiBluetoothIoServiceBindingProtocolGuid 38965BB5-8097-40F5-B742-8CC14A649B64,AmiPeiSbCustomPpiGuid 389F751F-1838-4388-8390-CD8154BD27F8,EfiFirmwareVolumeProtocolGuid 38A0EC22-FBE7-4911-8BC1-176E0D6C1DBD,IsaAcpi 38D65EC3-8F39-4660-B8A6-F36AA3925475,AmiBdsConnectPolicyProtocolGuid 38DDFE8F-8991-44AA-9889-83F4918465B0,EfiGpioOperationProtocolGuid 38E93FAE-C5F4-4700-940D-DC10E2FDB6C0,OemPeiRuntime 39045756-FCA3-49BD-8DAE-C7BAE8389AFF,Tcg2Dxe 39136FC7-1A11-49DE-BF35-0E78DDB524FC,EfiLegacySpiControllerProtocolGuid 3915886B-D833-4C23-B3ED-1453CCE7C5F2,IioCfgUpdateDxeLightningRidgeEXECB2 3920405B-C897-44DA-88F3-4C498A6FF736,EfiSmmIchnDispatchExProtocolGuid 392744DA-DF68-4C3B-966B-F20F0F47BC23,acer_SetupUtility_interface 395C33FE-287F-413E-A055-8088C0E1D43E,SmmRsTableGuid 396E583B-D2DD-45F6-86E8-119885777CDE,SmmAtaLegacy 398262C1-5165-4725-87FC-BB786A972582,IchPowerButton 399CF3A7-82C7-4D9B-9123-DB11842986D3,DpcDxe 39B3CE2B-82D0-4C7E-B949-D5E65181B98A,IshFwLayout 39B68C46-F7FB-441B-B6EC-16B0F69821F3,EfiCapsuleReportGuid 39B7902B-2377-4F73-9835-B35128ABB8D1,AppleUpdateMTRR 39C8FAEE-FBEE-41A3-9282-123F18C48CD9,BroadwaterMemoryInitPei 39D1EDC0-C9ED-4663-90DB-7457FF0548C5,AmiErrorHandlerMain 39E8CA1A-7A69-4A73-834A-D06381933286,UsbPei 39F62CCE-6825-4669-BB56-541ABA753A07,EfiGraphicsInfoHobGuid 39FD1631-64CB-410C-874D-240F88AED5F1,IGD 3A3300AB-C929-487D-AB34-159BC13562C0,PchResetCallbackProtocolGuid 3A35EE58-8286-4F00-9A5B-1B6AB7680815,amiFVhoblistguid 3A4D7A7C-018A-4B42-81B3-DC10E3B591BD,UsbKeyboardLayoutKeyGuid 3A4E4376-4871-4B0E-A02F-ED36F2AECD00,AmiCsmVideoPolicyProtocolGuid 3A53114D-5673-4DD9-B5B3-CB72C347669B,BFGSmm 3A61FD45-69A0-42AD-B261-24DA451BF442,ForceRecovery 3A666558-43E3-4D25-9169-DB81F5DB42E1,PKeyFileX509Guid 3AA83745-9454-4F7A-A7C0-90DBD02FAB8E,BdsConnectDriversProtocolGuid 3AB14680-5D3F-4A4D-BCDC-CC380018C7F7,EfiDiskInfoNvmeInterfaceGuid 3AB6529E-6F90-4863-AFFA-F5BA08DEA9AA,SbBeepLibPcAt 3ACC966D-8E33-45C6-B4FE-62724BCD15A9,AhciBusDxe 3ACEB0C0-3C72-11E4-9A56-74D435052646,TlsDxe 3ACF33EE-D892-40F4-A2FC-3854D2E1323D,EfiPeiCapsulePpiGuid 3AD9DF29-4501-478D-B1F8-7F7FE70E50F3,EfiUdp4ProtocolGuid 3AE3D6F0-6483-45D6-9395-303C9789208D,TrEEConfigPei 3AF9647D-C46B-11E4-AA1D-B8E8562CBAFA,ChunkManager 3AFAA9D7-4A0C-4AAA-8C09-05199B22428C,OCMR_Setup_IGD 3B0673A3-5197-454C-BA76-E2D0C8C48EFD,GenericElog 3B1DEAB5-C75D-442E-9238-8E2FFB62B0BB,UefiPxe4BcDxe 3B1E4B7C-09D8-944F-A408-1309EB8B4427,EmuThreadThunkProtocolGuid 3B24F79D-91A0-46FF-BE29-458AE211FAC5,KbcEmul 3B3EE27E-9BEF-463F-B03A-A5C9A098B7B5,CpuOverclockingConfigGuid 3B42EF57-16D3-44CB-8632-9FDB06B41451,MemoryInit 3B43161F-AEB4-43EC-9E1B-8050171B4899,BiosGuardRecoveryHook 3B4D9B23-95AC-44F6-9FCD-0E9594586C72,BdsLibStringPackageGuid 3B6686BD-0D76-4030-B70E-B5519E2FC5A0,EfiCapsuleGuid 3B68E4AC-78DC-4198-B5B0-9F341E503B7D,ProjectSMI 3B8C8162-188C-46A4-AEC9-BE43F1D65697,EfiFwDisplayCapsuleGuid 3B95AA31-3793-434B-8667-C8070892E05E,EfiIp4ConfigProtocolGuid 3BBCB209-26C8-4BA9-AD25-B95B45A04D26,BatteryState3 3BC1B285-8A15-4A82-AABF-4D7D13FB3265,EfiBusSpecificDriverOverrideProtocolGuid 3BC1F6DE-693E-4547-A300-21823CA420B2,PeiUsbControllerPpiGuid 3BC2BD12-AD2E-11D5-87DD-00062945C3B9,CpuStatusCodeDataTypeExceptionHandlerGuid 3BC42C6D-ABEC-41BA-8CCB-D8E0EF1CEF85,PCHPolicy 3BD2A492-96C0-4079-B420-FCF98EF103ED,EfiCertX509Sha256Guid 3BD2F4EC-E524-46E4-A9D8-510117425562,EfiHiiStandardFormGuid 3BEB6B06-09CE-4386-8884-F323ADD04F1F,GlobeTile 3BF4AF16-AB7C-4B43-898D-AB26AC5DDC6C,SecSMIFlash 3BF66866-3F8B-4CD8-B74C-B994111F535F,FfsIntegrityCheckDxe 3C0ED5E2-91EA-4B94-820D-9DAF9A3BB4A2,DmarAcpiTable 3C14C099-3143-46EF-AF18-DE4AD2C3A799,SystemHiiImageDisplayDxe 3C1DE39F-D207-408A-AACC-731CFB7F1DD7,PciBus 3C35B99D-D4B7-4885-ABD9-2BEA4B9F3A01,ASUSFTMDXE 3C485EA4-449A-46CE-BB08-2A336EA96B4E,EfiCk505ClockPlatformInfoGuid 3C5766E8-269C-4E34-AA14-ED776E85B3B6,EfiCertRsa2048Guid 3C5C631D-7995-4415-8B16-9F4A8AD36FCF,Int10ToSmi 3C5C987D-7996-4415-8B16-9F4A8AD36FDD,Int10ToSmiDxe 3C699197-093C-4C69-B06B-128AE3481DC9,EfiAcpiDescriptionGuid 3C7200E9-005F-4EA4-87DE-A3DFAC8A27C3,EfiShellDynamicCommandProtocolGuid 3C7BC880-41F8-4869-AEFC-870A3ED28299,EfiHeciProtocolGuid 3C7D193C-682C-4C14-A68F-552DEA4F437E,PcdDataBaseSignatureGuid 3C8B9970-870A-11E4-B7C6-B8E8562CBAFA,ChipsetGpioDxe 3C8D294C-5FC3-4451-BB31-C4C032295E6C,IdleLoopEventGuid 3CA59AB6-67CB-4385-9EDD-407C49F0D9BC,AMIOSB 3CCD3DD8-8D45-4FED-962D-2B38CD82B3C4,UserIdentifyManagerGuid 3CD652B4-6D33-4DCE-89DB-83DF9766FCCA,EfiVectorHandoffInfoPpiGuid 3CDC90C6-13FB-4A75-9E79-59E9DD78B9FA,EfiPeiReadOnlyVariablePpiGuid 3CEC37DF-90AD-4D88-AFF4-093056A6807D,SystemSecureFlashSleepTrapSmmDxe 3CEF354A-3B7A-4519-AD70-72A134698311,Ebl 3D3CA290-B9A5-11E3-B75D-B8AC6F7D65E6,XenBusProtocolGuid 3D5ABD30-4175-87CE-6D64-D2ADE523C4BB,EfiVirtualCdGuid 3D61A466-AB40-409A-A698-F362D464B38F,EfiEventNotificationTypeBootGuid 3D9FC54D-19E5-4AD0-B986-02D687D760E5,ASRLOGODXE 3DC5DC4A-824A-44C5-89D0-D4547191E3F4,RstOneClickEnable 3DC82376-637B-40A6-A8FC-A565417F2C38,Ps2KeyboardDxe 3DD406D4-5EC9-4198-9907-F674E60B2994,BaseTraceHubInitLibNull 3DD7A87B-D5BD-44AF-986F-2E13DB5D274C,SnpDxe 3DE30DC2-D84E-48EA-8E38-A9C17D743F10,TimerSMISmm 3DFC255F-9C86-48BC-972D-E522533768DB,LenovoRebootCp 3DFE0FAB-70C7-4B53-9855-985F14DB2DDA,RawIp4Tx 3E197E9C-D8DC-42D3-89CE-B04FA9833756,RegularExpressionDxe 3E1C696D-FCF0-45A7-85A7-E86C2A1C1080,UefiDevicePathLibOptionalDevicePathProtocol 3E3099F5-CBCC-4AE8-AEA0-2B7D1E7F8294,LpssDxe 3E35C163-4074-45DD-431E-23989DD86B32,EfiHttpUtilitiesProtocolGuid 3E4817FD-2742-4351-B59F-91493280329C,AlertStandardFormatPei 3E591C00-9E4A-11DF-9244-0002A5D5C51B,EfiMmcHostProtocolGuid 3E625104-1920-44B1-AE2C-1BDA57ED73EA,KtiRas 3E745226-9818-45B6-A2AC-D7CD0E8BA2BC,EfiUsb2HcProtocolGuid 3E7D2B56-3F47-42AA-8F6B-22F519818DAB,ScPcieSmiDispatchProtocolGuid 3EA824D1-81E3-4FF5-BD43-BB9C65DF7C46,AmiCsmStartedProtocolGuid 3EAF5E3A-E4B2-48E6-A9F1-B75CF204BCC8,PeiBoardConfigInit 3EB9F0D3-40D0-435B-B692-809151807FF4,TCM_MPDriver 3EBD8C7C-733B-4667-8FD1-4ABEA366C95B,ASUSDirectKeyPEI 3EBD9E82-2C78-4DE6-9786-8D4BFCB7C881,EfiFaultTolerantWriteProtocolGuid 3EBDAF20-6667-40D8-B4EE-F5999AC1B71F,EfiSecHobDataPpiGuid 3EBFA8E6-511D-4B5B-A95F-FB38260F1C27,DeviceManagerFormSetGuid 3ED700B5-3A13-43BE-9450-00122E8B83D7,DataHubRecordPolicy 3EF7500E-CF55-474F-8E7E-009E0EACECD2,AmiUsbSmmProtocolGuid 3F5A74B2-BF80-4850-8591-4F2DF5F9CB2B,PhoenixGdiProtocolGuid 3F7753EF-D36F-45CC-8A1A-2EAAFF1038B6,PciPlatform 3F78CB8D-72EE-414E-B023-DACA003BDDF5,ProjectSxSMI 3F78CB8D-72EE-414E-B023-DACA003EFCDE,APM 3FA0BB4A-180B-4458-9F12-6EA68F69E6CC,PxeRomB571699 3FA4F847-D8EB-4DF4-BD49-103A0A847BBC,EfiKmsFormatMdc4128Guid 3FD1D3A2-99F7-420B-BC69-8BB1D492A332,Fid 3FDDA605-A76E-4F46-AD29-12F4531B3D08,EfiMpServiceProtocolGuid 3FE2A8A3-C400-48F8-832F-7881A394C250,IohInitDxe 3FE57AC2-C675-46B1-8458-AC6206588424,SgTpvDxe 3FE72C6D-3612-4061-84AF-80C5B7AC6E25,PeiIpmiCmosClear 3FEEC852-F14C-4E7F-97FD-4C3A8C5BBECC,FWkey 3FFCAE95-23CF-4967-94F5-16352F68E43B,PpmInitialize 3FFFB2AA-4692-42E8-865E-7E111986FABE,wifi_2bars 40008162-93D0-48F2-80DA-7E32F4C98F8B,Udp6Dxe_ 4004DE5A-09A5-4F0C-94D7-82322E096AA7,DxeCapsuleLibNull 4004E454-89A0-11E3-89AA-97EF9D942ABC,ArmVExpressFastBootDxe 4006C0C1-FCB3-403E-996D-4A6C8724E06D,EfiLoadFile2ProtocolGuid 40093F23-630C-4626-9C48-40373B19CBBE,EfiKmsFormatGeneric2048Guid 40096A3A-5C2A-4FBC-AEF7-5475DD7AB334,BasePcdLibNull 400B4476-3081-11D6-87ED-00062945C3B9,EfiSpeakerInterfaceProtocolGuid 405B2307-6839-4D52-AEB9-BECE64252800,ArmFvpDxe 405DA936-3737-4C0C-8E3F-E6172A568592,FileExplorerDxe 405F8FE6-5213-4B85-B821-97B77AFF795B,ASM104X_DXE 407868F3-D1A7-46C6-9FCB-6F67A5E3C7D9,HdAudioConfigGuid 407B4008-BF5B-11DF-9547-CF16E0D72085,PL111LcdGraphicsDxe 408EDCEC-CF6D-477C-A5A8-B4844E3DE281,ConSplitterDxe 40B09B5A-F0EF-4627-93D5-27F04B754D05,AmtReadyToBootGuid 40BEAB40-CECE-4909-B133-20A413AE19E9,CpuMpDxe 40E064B2-0AE0-48B1-A07D-F8CF1E1A2310,EfiNetworkPkgTokenSpaceGuid 40FDF4FC-B7CC-4AC5-9BA2-A050D26656A7,SmcOptimizePei 41015350-BA3B-4916-B043-4615408A87B3,OememSmiCore 410C1D0C-656F-4769-8DFB-90F9A0303E9F,IconFireWireHD 4110465D-5FF3-4F4B-B580-24ED0D06747A,SmbiosPlatformDxe 411F7E6F-4666-58B2-D69E-D680C0F68BE2,SystemAcpiAddedValueDxe 41292206-4069-42A6-AC38-C4A5C123C6E5,BaseTraceHubLibNull 41401688-2862-431B-BAAC-6ECADAC384AB,PciCfg2OnPciCfgThunk 414D94AD-998D-47D2-BFCD-4E882241DE32,FwCapsuleHdr 414E6BDD-E47B-47CC-B244-BB61020CF516,EfiHardwareErrorVariableGuid 41789FB9-02AC-4484-BD40-A3147D7EDA25,PeiRecoveryLibNull 41A4631C-BB02-45AF-BEDD-AEDC56E53E79,SuperMPei 41B13735-0E0A-4F67-96D1-B15DA28205FA,SIOBasicIODXE 41D94CD2-35B6-455A-8258-D4E51334AADD,EfiIp4ProtocolGuid 41E26B9C-ADA6-45B3-808E-2357A35B60D6,ArmBootMonFsFileInfoGuid 41E89AB0-BD3D-44B6-A431-E4836EFBF2CB,PowerManagement2_ 42293093-76B9-4482-8C02-3BEFDEA9B35D,TcgSmm 4250CEC2-DDDB-400B-8C62-CF9864F6D154,AmiSioPortCompatibilityProtocolGuid 4278A574-4769-4D60-B090-DD4916691590,RecoveryModuleLoadPei 42857F0A-13F2-4B21-8A23-53D3F714B840,CapsuleRuntimeDxe 42881C98-A4F3-44B0-A39D-DFA18667D8CD,EfiHashServiceBindingProtocolGuid 42BB673D-09F3-4E2E-9FEE-D081131DED5B,BootScriptSaveDxe 42C078EF-14A8-4E30-9329-6F12D796E54A,LibWchar 42CF2D4A-78B4-4B80-80F9-96A83A630D70,UsbDeviceDxe 42EF76CE-A606-4881-BEA6-AD3F3EC9F754,Memory_OK_PEI 42F58B27-5DC3-4FA7-844D-5A7DBFF06432,Enquire 42F5F135-3F50-4319-98A2-3B22DF559D20,SmbiosMemory 42FCB444-B881-49D8-A6E9-5A1695FC9F3E,SysPassword 4308B1F6-60F0-49FE-9E51-3A25992515BF,PoofAnimationState0 430AC2F7-EEC6-4093-94F7-9F825A7C1C40,SdDxe 4311EDC0-6054-46D4-9E40-893EA952FCCC,EfiHiiPopupProtocolGuid 43172851-CF7E-4345-9FE0-D7012BB17B88,iFfsSmm 4344558D-4EF9-4725-B1E4-3376E8D6974F,ShellLevel3HiiGuid 4356B162-D0B2-11E1-8952-4437E6A60EA5,Lan9118Dxe 435CB0E4-7C9A-4BB7-9907-8FD4643E978A,AuthVariableLibNull 43679142-87C4-44AD-AF02-B47F782D6CF3,PeiIpmiLibIpmiPpi 43788BEB-638F-434C-8A84-46D33A589E76,BmcElog 4391AA92-6644-4D8A-9A84-DDD405C312F3,AppleBootPolicy 43A110CE-9CCD-402B-8C29-4A6D8AF77990,EslUdp4ServiceGuid 43A4C605-C66D-473E-A06A-37E9143FC439,PcRtc 43AC4333-472C-4B91-8C5C-52A8B4374256,IioCfgUpdateDxeNeonCityFPGA 43B93232-AFBE-11D4-BD0F-0080C73C8881,PartitionDxe 43BB9EAB-7D57-4DEF-B0A2-A3A9F9C6EAE3,LenovoMailBoxDxe 43BE0B44-874B-4EAD-B09C-241A4FBD7EB3,EfiKmsFormatGeneric1024Guid 43DECD73-77CB-474D-BD6F-1A98E7E2B6C6,LenovoErrorManagerDxe 43E7ABDD-E352-4CFB-A230-4CDC1D350E5C,GraphicsConsole 4414D6D8-232C-4972-A4F7-2B21D4298786,I2cHost 441FFA18-8714-421E-8C95-587080796FEE,AmiSmmDebuServiceProtocolGuid 4426CCB2-E684-4A8A-AE40-20D4B025B710,EfiPeiS3ResumePpiGuid 442BE18B-CA6E-4A23-9A99-9AFE8A213A32,PlatformPeiSystemInformation 44577A0D-361A-45B2-B33D-BB9EE60D5A4F,ArmRealViewEbPkgTokenSpaceGuid 44640C32-33D7-4FB0-B1F9-6C7B232E994D,SpsPei 446DBF63-2502-4CDA-BCFA-2465D2B0FE9D,EfiCertX509Sha512Guid 447559F0-D02E-4CF1-99BC-CA11654054C2,StdLibTokenSpaceGuid 447A1B58-8F3E-4658-ABAA-9E7B2280B90A,NvramSmm 44883EC1-C77C-1749-B73D-30C7B468B556,ExFatDxe 448F5DA4-6DD7-4FE1-9307-69224192215D,EfiSectionExtractionProtocolGuid 4495E47E-42A9-4007-8C17-B6664F909D04,BlockIoDxe 44A20657-10B8-4049-A148-ACD8812AF257,Tcg2Smm 44A2AD5D-612C-47B3-B06E-C8F50BFBF07D,OpalExtraInfoVariableGuid 44BA7D87-FD96-45B8-93D3-A8A0A94D0985,AmtConfig 44CDFA70-2C7C-4791-9AA3-EAE8777F0A8B,X11PeiDriver 44F0DE6E-4D8C-4045-A8C7-4DD168856B9E,EfiRngAlgorithmSp80090Ctr256Guid 44F23590-DC88-11DD-AD8B-0800200C9A66,SystemAhciAtaAtapiPassThruDxe 44FE07D3-C312-4AD4-B892-269AB069C8E1,BiosGuardSmm 45055A79-B385-4705-A3AC-11CE99A1CB47,StaticSkuDataDxeNeonCityEPRP 453368F6-7C85-434A-A98A-72D1B7FFA926,EmuIoThunkProtocolGuid 453C5E5A-482D-43F0-87C9-5941F3A38AC2,EfiKmsFormatSha1160Guid 45424D0C-E6AF-4AF2-AD99-FA77168742D1,SmartTimerDxe 4549AB47-6E60-4293-B91D-31B610AD8056,EfiEsrtOperationProtocolGuid 454DB25C-E506-4F90-A6DF-69E0223E3F2B,PramAddrDataGuid 4551F2F5-C684-4F27-936F-C7B04A5C5FF1,SecureBootDXE 455D16DC-E3AF-4B5F-A9AD-A4BC198085BD,BaseDebugDeviceLibNull 456D2859-A84B-4E47-A2EE-3276D886997D,EfiSmmSxDispatch2ProtocolGuid 4579B72D-7EC4-4DD4-8486-083C86B182A7,IScsi4Dxe 4589CBF3-03F9-4998-9D6F-26343C69562A,LenovoComputraceLoaderDxe 459504D7-72D7-4BB2-956D-C9FA899920E8,OemFwLnk 459C70C3-9344-4484-9F93-7822530D0D11,MePciPlatform 45AC8863-E3FA-4A38-A23C-00BCD10CBD50,AmiNvramSmmCommunicationGuid 45BCD98E-59AD-4174-9546-344A07485898,EfiSupplicantServiceBindingProtocolGuid 45D68DB9-8B4E-48C0-99E9-F21F262DB653,XhciPei 45F9602A-3475-4D1E-9FE9-BAC99F42AD49,AppleBacklightController 461B2833-3DA5-4556-95F2-BA506131051B,ExtCfgDevDrvDxe 462CAA21-7614-4503-836E-8AB6F4662331,UiApp 46310243-7B03-4132-BE44-2243FACA7CDD,CMDB 465FDE84-E8B0-B04B-A843-A03F68F617A9,ThunkPpiList 466C4F69-2CE5-4163-99E7-5A673F9C431C,VGAInformation 467313DE-4E30-43F1-943E-323F89845DB5,EfiBluetoothIoProtocolGuid 46805D61-0BB8-4680-A9BE-C96C751AB5A4,BaseIpmiLibNull 469FC080-AEC1-11DF-927C-0002A5D5C51B,ArmPlatformPrePeiCore 46B94C2D-AF5D-4915-814D-159323AE780A,PowerButtonHandler 46E3256A-E5C1-4D2A-8282-505AFB41CE65,DuetFwh 46E44855-BD60-4AB7-AB0D-A679B9447D77,EfiTcp6ProtocolGuid 46F9D8DA-2670-44B2-9E42-C9B130CE2465,SmbiosMisc 470CB248-E8AC-473C-BB4F-81069A1FE6FD,SmmFaultTolerantWriteDxe 470E1529-B79E-4E32-A0FE-6A156D29F9B2,EfiBootScriptSaveProtocolGuid 47144F62-B423-4524-AC6A-90106BAA89FB,AmiTpm20MeasureConfigurationInfoGuid 472A583E-70CF-465A-BB77-53ADFCDB5883,OCMR_DXE 4776E33F-DB47-479A-A25F-A1CD0AFAB38B,EfiKmsFormatAesxts128Guid 47889FB2-D671-4FAB-A0CA-DF0E44DF70D6,EfiPkcs7VerifyProtocolGuid 47970A28-8F4A-4CB2-91DE-BF344153189A,AmiCspFlashLibNull 47AA8FEE-48D0-11E4-A6D3-B8E8562CBAFA,SpiLockDxe 47B7FA8C-F4BD-4AF6-8200-333086F0D2C8,EfiSmmReadyToLockProtocolGuid 47C7B221-C42A-11D2-8E57-00A0C969723B,EfiShellEnvironment2Guid 47C7B223-C42A-11D2-8E57-00A0C969723B,EfiShellInterfaceGuid 47E87E67-FBC0-4C01-9002-4A0A6ECB92FF,AmiTseOemPortingVar4Guid 47F48C99-CB23-4CF8-9D7D-CE7C86EF22A3,UsbTouchPanelDxe 47FD99EB-C1E6-4F77-A31A-9F7FB4A8E7DE,menu_down_arrow 480F8AE9-0C46-4AA9-BC89-DB9FBA619806,EfiDpcProtocolGuid 4839023B-4C12-4EB2-B2B8-C91B42D878A0,IsctAcpi 4862AFF3-667C-5458-B274-A1C62DF8BA80,HeciInit 48925241-D2ED-46D4-8A87-A18D153C2802,SmmOemEeprom 4896840D-46BB-412B-A30A-A62ABFB3682F,SpsAcpiSsdt 48AB7F57-DC34-4F6C-A7D3-B0B5B0A74314,EfiIa32X64ErrorTypeMsCheckGuid 48D51913-F340-4798-83D7-5CAB3D5C6DA7,AppleEffaceableBCENOR 48E40CAD-A6D2-4756-8AEB-81F468D4A856,Tpm20ShutdownOverrideguid 48ECB431-FB72-45C0-A922-F458FE040BD5,EfiEdidOverrideProtocolGuid 48FB21BF-47E5-406C-A73E-D83D00767214,FwhFlashPeiLibNull 4904B42F-9FC0-4C2E-BB3F-A2AB35123530,DebugAgentLibNull 490D0119-4448-440D-8F5C-F58FB53EE057,PolicyInitDxe 490E9D85-8AEF-4193-8E56-F734A9FFAC8B,PeiSerialPortPpiGuid 49152E77-1ADA-4764-B7A2-7AFEFED95E8B,EfiDebugImageInfoTableGuid 492CB3AE-66DB-4F1E-91AE-534C48F2F83D,WheaSupport 4953F720-006D-41F5-990D-0AC7742ABB60,IntelGigabitLan 4953F720-006D-41F5-990D-0AC7742ABB61,Intel10GLan 495AA584-63D4-45F0-A4EF-36042B19A201,AppleVariablePolicy 49818FD1-7413-4C71-84CF-6BFE670C6496,PEbiosinterface 49970331-E3FA-4637-9ABC-3B7868676970,AcpiPlatform 49B7F3E1-6C08-4A5B-911C-E9E397ED4178,AcpiVariableHobOnSmramReserveHobThunk 49EA041E-6752-42CA-B0B1-7344FE2546B7,ArmTimerDxe 49EDB1C1-BF21-4761-BB12-EB0031AABB39,EfiPeiFirmwareVolumeInfoPpiGuid 49F8C35C-B9EF-402A-AB44-871C139EB00D,FastBootSetupDxe 4A3602BC-1A05-4C82-99B4-588CD2A32CD5,LEGACYSREDIR 4A37320B-3FB3-4365-9730-9E89C600395D,SmmDispatcher 4A4ECE10-61EB-4FC4-8839-F7CFDD962074,IccPei 4A5227D3-0BEF-4CAA-ACBD-EC84446C5C6C,MiscGaIoDxe 4A538818-5AE0-4EB2-B2EB-488B23657022,FvMainCompact 4A6D890F-93C3-4B6D-A67D-5F2C4DCE347B,RuntimeSmm 4A9B9DB8-EC62-4A92-818F-8AA0246D246E,MiscSubclassDxe 4AAFD29D-68DF-49EE-8AA9-347D375665A7,EfiCertPkcs7Guid 4AAFE3AA-DEEE-4D81-80F3-82D226C71C4B,PvScsiPassThruDxe 4AC94F68-E651-4B38-A1D8-2D5DEFFA0F60,HDAudioSmi 4AC99A7C-1DCF-4A51-8F06-5EEDFE8A8864,CryptoServiceRuntimeDxe 4ACA697E-F883-446F-98F7-096416FFFFFF,OhciDxe 4AE7E1E8-9DFE-4E3E-85B4-A5F6ABD470FB,Cpuid 4B0165A9-61D6-4E23-A0B5-3EC79C2E30D5,DxePchPlatformPolicyProtocolGuid 4B215191-9A25-43FD-86B5-74E7AF723315,AmiNvmePassThruProtocolGuid 4B28E4C7-FF36-4E10-93CF-A82159E777C5,ResetSystemRuntimeDxe 4B3029CC-6B98-47FB-BC96-76DCB80441F0,EfiDiskInfoUfsInterfaceGuid 4B3082A3-80C6-4D7E-9CD0-583917265DF1,AmiSmbiosNvramGuid 4B3828AE-0ACE-45B6-8CDB-DAFC28BBF8C5,VAROEM 4B47D616-A8D6-4552-9D44-CCAD2E0F4CF9,IScsiConfigGuid 4B4D31BE-88C6-446A-A4A9-4AD0F612B32E,EvaluateDefaults4FirstBootGuid 4B680E2D-0D63-4F62-B930-7AE995B9B3A3,SmBusDxe 4B837B03-6587-4D19-B82B-EDFAD836C0A0,SecMain 4B94F4FD-8FB9-4CF1-A0D8-EA03B4467BE2,OemThermal 4BB346D2-8076-4671-8BC9-7B95CBB9A6DF,MonoStatusCode 4BC80B15-255D-4858-8072-51D6D98CF90E,SetHostName 4BD56BE3-4975-4D8A-A0AD-C491204B5D4D,EfiAdapterInfoUndiIpv6SupportGuid 4C006CD9-19BA-4617-8483-609194A1ACFC,UsbInt13 4C19049F-4137-4DD3-9C10-8B97A83FFDFA,EfiMemoryTypeInformationGuid 4C26DF71-EBE7-4DEA-B5E2-0B5980433908,GetAddrInfo 4C494E55-5849-5342-4554-544552212121,SlpSupport 4C5C6A74-BAB7-46D6-8688-3B2E7F246E3F,SataController 4C6E0267-C77D-410D-8100-1495911A989D,MetronomeDxe 4C862FC6-0E54-4E36-8C8F-FF6F3167951F,FtwLiteDxe 4C8A2451-C207-405B-9694-99EA13251341,EfiDebugMaskProtocolGuid 4C8BDF60-2085-4577-8A46-96CB180967BC,Tpm20Acpi 4CBB6611-3608-492B-92A7-DD92FD6FE4FE,OEMBOARDPei 4CC14F19-C626-4AB6-9DEA-CA6C01FD10CD,ASUSHeaderPEI 4CE9D7AE-61B2-4461-9446-AB0376B4A7F7,FboSce 4CEC368E-8E8E-4D71-8BE1-958C45FC8A53,EfiSmmPeriodicTimerDispatch2ProtocolGuid 4CEF31DA-8682-4274-9CC4-AEE7516A5E7B,CapsuleApp 4CF484CD-135F-4FDC-BAFB-1AA104B48D36,HfsPlusDxe 4CF5B200-68B8-4CA5-9EEC-B23E3F50029A,EfiPciIoProtocolGuid 4D00EF14-C4E0-426B-81B7-30A00A14AAD6,NandFlash 4D06B832-6987-40F2-B76D-D170B42DB182,TrEEPhysicalPresenceDxe 4D20583A-7765-4E7A-8A67-DCDE74EE3EC5,HttpBootConfigGuid 4D2E57EE-0E3F-44DD-93C4-D3B57E96945D,CpuS3DataDxe 4D330321-025F-4AAC-90D8-5ED900173B63,EfiDriverDiagnostics2ProtocolGuid 4D35A5A7-622E-4955-A5D2-CDA812940D74,FwBlockService 4D37DA42-3A0C-4EDA-B9EB-BC0E1DB4713B,PpisNeededByDxeCorePei 4D478675-9D19-4EB2-9960-CBC88D6C3935,PlatformHmacShaSmm 4D7161BC-BE35-43AF-879B-956EB37983D6,AmiMemoryPresentFunctionOverrideGuid 4D7267F0-F48C-4050-AE55-8FE1708096A0,ASRockNetFtpBin 4D8B155B-C059-4C8F-8926-06FD4331DB8A,GetPcdInfoPpiGuid 4D8B77D9-E923-48F8-B070-4053D78B7E56,Tpm12DeviceLibTcg 4D9CBEF0-15A0-4D0C-83DB-5213E710C23F,Tcg2ConfigDxe 4DCAAB0A-1990-4352-8D2F-2D8F135598A5,EslTcp4ServiceGuid 4DCBF9BA-DEC1-42B0-8A09-01555694F6CF,GbtCustomizeButtonSmm 4DE01DE6-7CBB-4786-9F2A-9B9C7C97AC06,S3RestoreAcpiPei 4DF19259-DC71-4D46-BEF1-357BB578C418,EfiPs2PolicyProtocolGuid 4DF53F89-D421-4F9D-8392-BE3BECC6288E,AhciInt13Dxe 4E0F9BD4-E338-4B26-843E-BD3AD9B2837B,PRKeyGuid 4E11E955-CCCA-11D4-BD0D-0080C73C8881,EfiWinNtGopGuid 4E1356C2-0EED-463F-8147-9933ABDBC7D5,EfiKmsFormatRsasha2563072Guid 4E1C4F95-90EA-47DE-9ACC-B8920189A1F5,SecPeiFspPlatformSecLibSample 4E28CA50-D582-44AC-A11F-E3D56526DB34,EdkiiPiSmmCommunicationRegionTableGuid 4E292F96-D843-4A55-A8C2-D481F27EBEEE,EfiEventNotificationTypeCpeGuid 4E304BC0-3B03-4A97-BB55-91375189A31D,iFlashDxeBin 4E3A82E6-E43F-460A-866E-9B5AAB804448,EslIp4ServiceGuid 4E509696-E33F-408E-9AF5-CC8C20065385,SoftwareGuardConfigGuid 4E76928F-50AD-4334-B06B-A84213108A57,NtFwhPpiGuid 4E82091E-32A1-4689-8A00-CDE41ED63CDD,SioDxeInit 4E8F4EBB-64B9-4E05-9B18-4CFE49235097,EfiMemorySubClassGuid 4EA43463-747C-46EB-97FB-B0E5C5F05306,UsbMouseAbsolutePointerDxe 4EA97C46-7491-4DFD-B442-747010F3CE5F,Main 4EB6E09C-D256-4E1E-B50A-874BD284B3DE,FspSiliconInitDonePpiGuid 4EC8B120-8307-11E0-BC91-0002A5D5C51B,PL011Uart 4ECB6C53-C641-4370-8CB2-3B0E496E8378,EfiExtendedSalVariableServicesProtocolGuid 4ED4BF27-4092-42E9-807D-527B1D00C9BD,EfiHobMemoryAllocStackGuid 4EFC51DA-23A6-4790-A292-4985C7F5CDEF,LenovoComputraceEnablerDxe 4EFFB560-B28B-4E57-9DAD-4344E32EA3BA,MiscSubclass 4F1F379F-2A62-48BB-AC34-D3F135C6E2B7,PcatSingleSegmentPciCfg2Pei 4F44FA64-A8D6-4C19-B61D-63109D77D3D2,AmiVerifyTcgVariablesGuid 4F4EF7F0-AA29-4CE9-BA41-643E0123A99F,HiiResourceSamleFormSetGuid 4F4FF580-B8A0-4332-A6B0-E2E568E36C9C,ASFVerbosity 4F6C5507-232F-4787-B95E-72F862490CB1,EventExitBootServicesFailedGuid 4F792E68-E8C8-794E-B1D8-3703F3F2D5A5,EmulatorPkgTokenSpaceGuid 4F821C7C-8E33-412A-AE63-D149F376CD1B,SmmWheaDxe 4F89E208-E144-4804-9EC8-0F894F7E36D7,EfiPeiSectionExtractionPpiGuid 4F9147CB-972E-4F5C-B869-A02182C9D93C,PataController 4F921013-4F71-4C6C-BCF8-419B2B801932,SetupBrowser2 4F948815-B4B9-43CB-8A33-90E060B34955,EfiUdp6ProtocolGuid 4FA7E1F2-CE8B-4D38-A3F8-342DC4515446,IioCfgUpdateDxeNeonCityEPRP 4FB2CE1F-1A3A-42E3-BD0C-7B84F954189A,AcpiCallbacksSmm 4FC0733F-6FD2-491B-A890-5374521BF48F,AmiBoardInfo2ProtocolGuid 4FD1BA49-8F90-471A-A2C9-173C7A732FD0,SeCfTPMPolicyPpiGuid 4FE772E8-FE3E-4086-B638-8C493C490488,PhysicalPresencePei 4FF2E88A-A404-46F7-9A2A-35E00844F6E6,SpiDeviceDxe 4FFF2014-2086-4EE6-9B58-886D1967861C,SecPeiDxeTimerLibUefiCpu 5007A40E-A5E0-44F7-86AE-662F9A91DA26,FvOnFv2Thunk 5011522C-7B0E-4ACB-8E30-9B1D133CF2E0,FmpAuthenticationLibNull 501F30E9-D14F-47DA-AE60-B101E4189D07,AhciInt13Smm 5029FBE0-39E9-43F8-A9F0-E78E1789FC27,SystemSwSmiAllocatorDxe 502B04F3-71AB-47B4-BEAE-4736EA190AA4,PciDxeInit 503E70FE-047A-410B-A55F-4F63C9382C1E,CpuIo2OnCpuIoThunk 5053697E-2CBC-4819-90D9-0580DEEE5754,EfiCapsuleArchProtocolGuid 5058F21C-BC34-11D4-BD18-0080C73C8881,Fat2 506533A6-E626-4500-B14F-17939C0E5B60,AcpiSupportDxe 5074C00E-698B-4763-91E6-41663F6CC7C9,PBSPeiInitPei 508A61DC-2C57-4848-A54A-58015179C94A,ApplePowerState 5091388A-4BB6-4DA5-A493-5EE7A90CEA5E,OemBoardID 50A18017-37AD-8743-BCF2-DF1A8FF12FAB,EmuReset 50B4FAD4-9D0D-440B-812C-D8E3EC21244D,XhciHandlerCommon 50DC5C90-1D33-4FD6-87E5-063B1DFA2170,AmiSerialProtocolGuid 50F6096D-7C98-4C78-9A1D-C5A1833B6A88,AmiTcgNvflagSample 510DF6A1-B6C1-4948-AEE7-59F220F898BD,SataController 51116915-C34B-4D8E-86DB-6A70F2E60DAA,NVMe 51116915-C34B-4D8E-86DB-6A70F2E60DAC,IOBufferCopyController 5112A2AA-E175-477E-A4E4-D0B7E689BA9F,EventLogDxe 5122FA7B-17A3-4A8B-89AE-A93ADE92EADF,DigitalThermalSensor 51271E13-7DE3-43AF-8BC2-71AD3B824325,ShellMapGuid 514D2AFD-2096-4283-9DA6-700CD27DC7A5,ScSmmIoTrapControlGuid 5167FD5D-AAA2-4FE1-9D0D-5CFCAB36C14C,LegacyRegion2OnLegacyRegionThunk 5169AF60-8C5A-4243-B3E9-56C56D18EE26,SmmIpmiProtocolGuid 51739E2A-A022-4D73-ADB9-91F0C9BC7142,MpServicesOnFrameworkMpServicesThunk 51924AE9-BE81-4820-94BA-7C9546E702D0,Tcg2PpVendorLibNull 5199296F-2808-4AFA-94C4-99F6B06C871E,ACPIS4Smm 51AA59DE-FDF2-4EA3-BC63-875FB7842EE9,EfiHashAlgorithmSha256Guid 51AA65FC-82B6-49E6-95E2-E6827A8D7DB4,AmiHddHpaProtocolGuid 51C4C059-67F0-4E3C-9A55-FF42A8291C8C,PeiSmbusLibSmbusPpi 51C9F40C-5243-4473-B265-B3C8FFAFF9FA,Crc32SectionExtractDxe 51CCF399-4FDF-4E55-A45B-E123F84D456A,ConPlatformDxe 51E9B4F9-555D-476C-8BB5-BD18D9A68878,EfiAmiSioProtocolGuid 523FA0E8-8639-47BB-B859-939A450DBF77,EnhancedFat 5242AADB-BDAB-4B92-B7D5-A58B6E0EEE6B,IchSmbusArpDisabledPei 524685A0-89A0-11E3-9D4D-BFA9F6A40308,AndroidFastbootPlatformProtocolGuid 525B672C-8C8F-0361-AE8E-565EE0F563B8,MemInfo 52715B77-04A5-487A-B980-CDC371B5BEC8,AsusPostErrPei 529D3F93-E8E9-4E73-B1E1-BDF6A9D50113,ArpDxe 52B3DBA7-9565-48E8-8E13-EC7196721B3C,PlatformInfoPei 52C05B14-0B98-496C-BC3B-04B50211D680,PeiCore 52C78312-8EDC-4233-98F2-1A1AA5E388A5,EfiNvmExpressPassThruProtocolGuid 52C877FD-C27C-4779-B750-7880B28B4306,SetupConfigUpdateDxeNeonCityEPRP 52CE9845-5AF4-43E2-BAFD-230812547AC2,PlatformGpioProtocolGuid 52DAA304-DEB3-449B-AFB8-A88A54F28F95,OhciPei 52F934EE-7F15-4723-90CF-4E37127718A5,TcgPeiPei 534A6A34-CF78-4A56-BEDB-CB49A8D8060C,RTCWakeup 534BA4FD-D74C-1E41-AA7D-BB551364FBAD,AppleDebugSupportDxe 53531469-558E-4AF1-803A-F966F27C573B,BatteryState2 535A720E-06C0-4BB9-B563-452216ABBED4,HdLcdArmVExpress 5360BFF6-3911-4495-AE3C-B02FF004B585,DxePciLibI440FxQ35 536DF136-BD96-4E1E-ADF5-6B637C139063,UuidDxe 53A58D06-AC27-4D8C-B5E9-F08A80654170,EfiExtendedSalStallServicesProtocolGuid 53AB1ACD-EDB1-4E3A-A2C7-978D721D179D,FspSecCoreS 53BCC14F-C24F-434C-B294-8ED2D4CC1860,DataHubDxe 53CD299F-2BC1-40C0-8C07-23F64FDB30E0,EdkiiPlatformLogoProtocolGuid 53F019E9-BB0C-424B-870A-1FAF10B1CB4C,iFfsPei 541D5A75-95EE-43C7-9E5D-2394DC486249,AmiTseAdminPasswordValidGuid 542D6248-4198-4960-9F59-2384646D63B4,AmiOpromPolicyProtocolGuid 543323CE-9F0C-4DDF-A33C-BC3B3A5AC227,SmmBmcElog 5446C293-339B-47CD-B719-585DE39408CC,PostReport 546AD295-0C64-4CE6-A06F-FB9CD04B41CD,SystemFlashCommunicationDxe 5473C07A-3DCB-4DCA-BD6F-1E9689E7349A,EfiFirmwareFileSystem3Guid 547957B2-D791-4CFF-8808-8024897B4D98,PLX8605PEI 5479662B-6AE4-49E8-A6BD-6DE4B625811F,BiosKeyboardDxe 5479E09C-2E74-481B-89F8-B0172E388D1F,StartWatchDog 547C5CAE-2640-4ACF-9532-0E25B3F03F05,WheaDxe 54891A9E-763E-4377-8841-8D5C90D88CDE,TerminalSrc 54975633-0945-4D9C-97C2-E0CC6469A5A3,MeLibPei 54A85D82-3A54-4006-9C0E-E527295C4FA8,SetupLangService 54AB7A17-AD08-4F86-83C2-4CF398EBC0AD,AsusPostErrDxe 54CE6010-2A6D-42AA-B1E2-FD97DE9C4DA8,AppleDebugSupportFireWireInit 54D2878F-25CD-4A2B-8420-EBD18E609C76,OemHookStatusCodeLibNull 54FCC43E-AA89-4333-9A85-CDEA24051E9E,EfiSupplicantProtocolGuid 550303D2-F033-4468-857A-442C10E199E9,LenovoDriveEraseDxe 5507247A-846B-4F22-B55F-72B4049435EF,AmtLockKBD 5507E3F0-9C84-47DC-8CEA-C29A01B7CD5D,SioBdsPlugin 550E42E1-B6FA-4E99-BBD9-1A901F001D7A,AmiVendorKeysNvGuid 553087F6-BAAC-4D7F-97B4-31D8179AAE15,GetNameInfo 5542CCE1-DF5C-4D1B-ABCA-364F77D399FB,EfiHiiCompatibilityProtocolGuid 5552575A-7E00-4D61-A3A4-F7547351B49E,SmmBaseRuntime 555F76EA-785F-40D7-9174-153C43636C68,CirrusLogic5430Dxe 5568E42E-DD33-4F6C-867F-7E73451104FE,StaticSkuDataDxeLightningRidgeEXECB4 55961E20-B0D9-4553-9948-E3ECF0BE0889,PlatformConfigPei 55B1D734-C5E1-49DB-9647-B16AFB0E305B,EfiHash2ProtocolGuid 55B71FB5-17C6-410E-B5BD-5FA2E3D4466B,EfiI2cBusConfigurationManagementProtocolGuid 55D460DB-8FEA-415A-B95D-70145AE0675C,DxePrintLibPrint2Protocol 55E76644-78A5-4A82-A900-7126A5798892,HeciInitDxe 5604D863-BF24-439B-BBF6-636D72036E07,SpiUtil 560BF58A-1E0D-4D7E-953F-2980A261E031,EfiSioVariableGuid 5639867A-8C8E-408D-AC2F-4B61BDC0BBBB,EfiBluetoothAttributeServiceBindingProtocolGuid 563C75D2-045D-43FD-A7C0-A472B0AD0255,gear6 563F8EDE-1FA5-45A2-BE23-B0B6A07DE239,DramPolicyPpiGuid 56417BED-6BBE-4882-86A0-3AE8BB17F8F9,EfiKmsFormatRsasha11024Guid 564B33CD-C92A-4593-90BF-2473E43C6322,EfiHobMemoryAllocBspStoreGuid 565D3FCA-F06D-4FED-95EB-370EDFFA9E57,AsrBootOptionDxe 565EC8BA-A484-11E3-802B-B8AC6F7D65E6,XenBusDxe 56B70419-7103-4D0E-83F4-F3546BD21E40,EzFileBrowser 56BF094C-69F6-49DD-8C1C-1ECEFF71C9E5,CsmRt32 56D60EE4-5CCF-485C-BBBB-FEDAE2B24146,RegAccessDxe 56EC3091-954C-11D2-8E3F-00A0C969723B,EfiLoadFileProtocolGuid 56ED21B6-BA23-429E-8932-376D8E182EE3,FspPerformanceDataGuid 571A2DDE-E141-4D73-927D-85F5A7BB187E,AmiTcgLibDxe 572528F4-9BC6-41BD-9D14-5AAD93464A51,NationalPC8374L 577D959C-E967-4546-8620-C778FAE5DA05,EfiDebuggerConfigurationProtocolGuid 5788464F-3773-4A29-8AF7-E81BBEE419C3,ATAIdentify 578C315A-68CF-4E81-B5C6-22DB40D010BC,EfiI2cMasterProtocolGuid 578C3195-D8C1-44F1-8A06-2B592FBE6AF3,TouchInputFilterDriver 57E56594-CE95-46AD-9531-3C49310CA7CE,OFBD 57F48613-300A-4101-A76D-4F73C533B5B8,PriorBootDxe 57F55732-CF55-43C7-B66B-216CE2282888,MonoStatusCodePei 5802BCE4-EEEE-4E33-A130-EBAD27F0E439,MsegSmramGuid 58053681-13F3-47F6-B137-CDB3E888D9A4,ExtendedDataGuid 580DD900-385D-11D7-883A-00500473D4EB,UHCD 5810798A-ED30-4080-8DD7-B9667A748C02,HashInstanceLibSha256 581F20FE-3C59-46EB-8D9F-47E6D38A1C3B,IsvtCheckpointDxe 5820EEB4-C135-4854-9D2A-AA9EFC4475E9,MeFwDowngrade 5848FD2D-D6AF-474B-8275-95DDE70AE823,SmramCpuDataHeaderGuid 584CC99F-4BE8-43D1-A45A-933DC39479FC,AmiPeiNbCustomPpiGuid 5859CB76-6BEF-468A-BE2D-B3DD1A27F012,EfiUsbPolicyProtocolGuid 587E72D7-CC50-4F79-8209-CA291FC1A10F,EfiHiiConfigRoutingProtocolGuid 58830DE7-9739-4869-88BE-DC8CA24CE9C1,AutoMeud 58A90A52-929F-44F8-AC35-A7E1AB18AC91,FPVARBAK 58C518B1-76F3-11D4-BCEA-0080C73C8881,EfiWinNtThunkProtocolGuid 58DC368D-7BFA-4E77-ABBC-0E29418DF930,EfiSmmIoTrapDispatch2ProtocolGuid 58E26F0D-CBAC-4BBA-B70F-18221415665A,VirtioRngDxe 58E6ED63-1694-440B-9388-E98FED6B65AF,EfiSocketProtocolGuid 58E8A611-AB19-47DC-9850-3985DE8DF1FD,PsmiMapHobGuid 5917EF16-F723-4BB9-A64B-D8C532F4D8B5,EfiUserCredentialClassHandprintGuid 591F64F9-1CB8-4029-8868-F5A2C0CF3600,I2cMmioDeviceDxe 59242DD8-E7CF-4979-B60E-A6067E2A185F,LegacyRegion 59287178-59B2-49CA-BC63-532B12EA2C53,PchSmbusSmm 59324945-EC44-4C0D-B1CD-9DB139DF070C,EfiIScsiInitiatorNameProtocolGuid 5959E027-BAB0-4342-AA4B-8F73F017B485,OemRuntimeFunction 595A6EDC-6D2C-474A-9082-3B992851DFFE,OemCapsuleGuid 597F29A1-F354-4FBB-AFF4-BCBDA6A87C2C,LpcFlashPeiLibNull 59ADD62D-A1C0-44C5-A90F-A1168770468C,PlatformInit 59AF16B0-661D-4865-A381-38DE68385D8D,OpalSecurity 59B90A53-461B-4C50-A79F-A32773C319AE,IdeBusSrc 59D1C24F-50F1-401A-B101-F33E0DAED443,EfiGenericVariableGuid 5A235B65-4BA0-4A97-89A2-C127DEA193A2,AsusOnBoardDimm 5A38B969-CD6A-4814-82E6-559F840BBC58,ISPDxe 5A3F3BD1-B7A6-404B-A0F7-285E1B898B00,DiskControllerSmbios 5AAB83E5-F027-4CA7-BFD0-16358CC9E453,WdtDxe 5AC804F2-7D19-5B5C-A22D-FAF4A8FE5178,AcpiVariableHobOnSmramReserveHob 5AD621B8-C28A-4417-B67A-F77FD14BFBE4,AmiHeciDeliverSmmRuntimeDxe 5AE0C053-C2B3-4E7D-ADD9-FD3CEBC6D3D9,SlotDataUpdateDxeLightningRidgeEXRP 5AE3F37E-4EAE-41AE-8240-35465B5E81EB,CORE_DXE 5AEA42B5-31E1-4515-BC31-B8D5257565A6,EfiExtendedSalBaseIoServicesProtocolGuid 5B02E5E0-C169-49F9-879A-CE1806F0357A,IpmiBoot 5B1B31A1-9562-11D2-8E3F-00A0C969723B,EfiLoadedImageProtocolGuid 5B232086-350A-42C7-A70E-3497B5765D85,OEMSSDT 5B446ED1-E30B-4FAA-871A-3654ECA36080,EfiIp4Config2ProtocolGuid 5B51FEF7-C79D-4434-8F1B-AA62DE3E2C64,EfiDMArGenericErrorSectionGuid 5B60CCFD-1011-4BCF-B7D1-BB99CA96A603,FatPei 5B6DAB96-195D-4D24-9727-A7D0E93665C6,IconSD 5B74C741-4A5F-4A8E-B689-D804AB4368FD,DxeRealtekCrcInit 5B85965C-455D-4CC6-9C4C-7F086967D2B0,PKeyFileSha256Guid 5B94E419-C795-414D-A0D4-B80A877BE5FE,FspSecCoreT 5BAB88BA-E0E2-4674-B6AD-B812F6881CD6,DxeVlvPlatformPolicyGuid 5BAD89FF-B7E6-42C9-814A-CF2485D6E98A,EfiEventNotificationTypeNmiGuid 5BBA83E5-F027-4CA7-BFD0-16358CC9E123,IccOverClocking 5BBA83E6-F027-4CA7-BFD0-16358CC9E123,IntelIvbGopDriver 5BDDE605-B107-419E-9510-AA3C434EBBE4,PlatformCsmDxe 5BE3BDF4-53CF-46A3-A6A9-73C34A6E5EE3,NvmExpressDxe 5BE40F57-FA68-4610-BBBF-E9C5FCDAD365,GetPcdInfoProtocolGuid 5BEDB5CC-D830-4EB2-8742-2D4CC9B54F2C,Ip6Dxe 5BF3654C-7E7D-4FBA-8BC6-2AEBCD6F68EB,Apple80211 5C08E2E2-AD70-4C99-94A2-AE604EA033DA,IcnsConvert 5C0FB3B9-F7BB-467B-A4DC-89D7D5A58432,ResLoader 5C198761-16A8-4E69-972C-89D67954F81D,EfiDriverSupportedEfiVersionProtocolGuid 5C1997D7-8D45-4F21-AF3C-2206B8ED8BEC,PL061GpioDxe 5C1D737E-36D6-45B1-862C-6B9C244F4C07,PlatformStatusCodeHandlerDxe 5C266089-E103-4D43-9AB5-12D7095BE2AF,IntelSaGopDriver 5C44EAF7-FF0B-462E-87F4-2D46460BF48F,TraceHubStatusCodeHandlerSmm 5C7F8702-838F-43DF-91E6-7833B6F2A067,DxeCoreReportStatusCodeLibFromHob 5C98DE6E-CB69-465F-B6B9-F661E26E6F9D,LibGdtoa 5CAC0099-0DC9-48E5-8068-BB95F5400A9F,RecoveryOnDataCdGuid 5CB5C776-60D5-45EE-883C-452708CD743F,EfiLoadPeImageProtocolGuid 5CBEF321-9B75-3120-88CD-5D123412CBCD,ATIPwrXSmi 5CDDFAF3-E9A7-4D16-BDCE-1E002DF475BB,UefiDebugLibConOut 5CDEEC47-2538-11E7-A438-B8E8562CBAFA,AppleVoiceOver 5CEA02C9-4D07-69D3-269F-4496FBE096F9,EfiPersistentVirtualDiskGuid 5CF308B5-FA23-4100-8A76-F326C2814880,AmiMeasureCPUMicrocodeGuid 5CF32E0B-8EDF-2E44-9CDA-93205E99EC1C,EmuThunkProtocolGuid 5CF32E68-7660-449B-80E6-7EA36E03F6A8,EfiUserCredentialClassUnknownGuid 5D1F3F9E-8CEE-4299-93C2-4C64EBB58977,GetServByName 5D337D63-2677-4868-8251-B97C6D1F0E90,YukonEthernet 5D758BFB-B323-4F6C-9017-A3238CE65163,LenovoSetupRestartDxe 5D8111C9-B4F9-46F3-9DDB-73A41AC696C5,password_capslock_indicator 5D9F96DB-E731-4CAA-A00D-72E187CD7762,EfiEapProtocolGuid 5DAF50A5-EA81-4DE2-8F9B-CABDA9CF5C14,SecureBootConfigFormSetGuid 5DC03827-C9CB-4C83-B15F-6EAFBF86476C,AppleUartDxe 5DEF82D2-6ED7-47DE-B0AC-11E55BAFFB05,LpcFlashLibNull 5DF9946D-8170-4FB5-854F-A98865F9878F,gear5 5E3848D4-0DB5-4FC0-9729-3F353D4F879F,EfiLegacySpiSmmFlashProtocolGuid 5E523CB4-D397-4986-87BD-A6DD8B22F455,AtaAtapiPassThruDxe 5E559C23-1FAA-4AE1-8D4A-C6CF026C766F,FirmwareIdGuid 5E5CF20F-B63F-11E1-835E-386077F11E9D,I2cTouchPanelDxe 5E90A50D-6955-4A49-9032-DA3812F8E8E5,AmiSmbiosProtocolGuid 5E93C847-456D-40B3-A6B4-78B0C9CF7F20,EfiEapManagement2ProtocolGuid 5E948FE3-26D3-42B5-AF17-610287188DEC,EfiDiskInfoIdeInterfaceGuid 5E975522-176F-4E2D-BB25-64ADCC7792A4,BaseDebugDeviceLibNull 5E9CABA3-F2B1-497A-ADAC-24F575E9CDE9,TcgDxe 5EC9DF0F-9FB9-4CD5-9BAE-12872F032A6A,PeiIpmiUsb 5F03BA33-8C6B-4C24-AA2E-14A2657BD454,EfiUserCredentialClassSmartCardGuid 5F05B20F-4A56-C231-FA0B-A7B1F110041D,EfiRegexSyntaxTypePosixExtendedGuid 5F171F5F-8385-4086-A69B-1FCF06AE4A3D,AmiOsPpiConfirmationOverrideGuid 5F1B0D5B-DB44-4B81-A69D-553C591AF092,OCMR_DXE 5F439A0B-45D8-4682-A4F4-F0576B513441,EfiSmmCpuIoGuid 5F4735F7-DCF9-40FD-8858-026F931942A9,DxeIchInit 5F5F605D-1583-4A2D-A6B2-EB12DAB4A2B6,ShellBcfgHiiGuid 5F65D21A-8867-45D3-A41A-526F9FE2C598,SystemImageDecoderDxe 5F65DFDB-AC20-4F43-9B21-269E81A0EA7E,PdmWindowButtonGuid 5F6A843E-D188-41A3-BA3C-A83D8997DC7F,BootPriority 5F7CE43D-565A-4420-B4F8-22ECA7245755,AmiDbrFileGuid 5F7D4E0E-3D6D-42BC-A942-0E91E83E3C31,EfiPeiTcgLogHobGuid 5F82BC22-85E1-489D-93A1-42BBD664B434,IioCfgUpdateDxeLightningRidgeEXECB1 5F864C8D-F2AE-4221-B8CA-F64ECFB0ACA7,OemDebug 5F87BA17-957D-433D-9E15-C0E7C8798899,AmiDigitalSignatureProtocolGuid 5FAC7360-D4F2-4C9E-A7ED-F2595E670889,SctIsaHcProtocolGuid 5FAD2389-2BC7-4BD2-83D3-429FB6AEA33F,EfiSerialPortTokenSpaceGuid 5FB81FA3-BF65-43AD-A47B-DF70C3112B5A,SvSmmHandler 5FC8EEE0-9BF2-498F-B4D3-C51ED4C87BB4,LenovoSetupConfigDxe 5FCEA791-516E-4B61-892C-7229D4FF23D4,Int15ActiveLFP 5FD88B4C-B658-4650-B3CE-A59BB991BFD4,IgdPanelConfigGuid 5FECEF6B-5FA4-4570-8163-0CF72A9C04C5,Ps2Main 6010BEA0-A051-408D-9A6E-B744D468A05D,WinCapsuleUpdate 602160C7-E080-4AFE-BE4A-BB5D9B87042D,AcpiTableDxe 6046E678-24EF-4005-BA39-BDA11F6D555D,AmtInt16_csm 6048B8EC-6D17-45C0-9BCF-63D164B41AB3,LanRom 605CED2C-583B-4171-9311-AA6E146B1A4B,I2cPortA0Pio 605E41B8-E923-47CC-87B1-A6E38526E78D,SmbiosCompatiInfo 605EA650-C65C-42E1-BA80-91A52AB618C6,EfiEndOfPeiSignalPpiGuid 6069277B-246B-45D5-BD6D-81820E10C11F,CommonSmiCallBack 60740CF3-D428-4500-80E6-04A5798241ED,HstiIhvProviderDxe 6074610C-93C6-4A50-9AAA-0927DE7C6975,FirewireDeviceDxe 60798953-1E91-46C9-B521-316623424522,WheaErrorLog 607F766C-7455-42BE-930B-E4D76DB2720F,EfiTrEEProtocolGuid 60812E8C-505B-4D3E-A5B7-1715656CE362,ProjectDxeDriver 60A14F6F-55B9-47A3-B067-01A93027F3FE,AppleMemoryTest 60AC3A8F-4D66-4CD4-895A-C3F06E6665EE,iFfsAcpiTables 60B27E1A-D65E-4DB0-B2BB-C16FA71E44AB,PdmWindowSpinGuid 60B5E939-0FCF-4227-BA83-6BBED45BC0E3,EfiBootStateGuid 60B751F7-43B9-4238-8819-6B862B68C889,PhPlatformDxe 60EC7720-512B-4490-9FD1-A336769AE01F,SmmControlPei 60FABA47-419B-4E50-85C7-20E86AEE00FC,ASRockNetTcpWrapper 60FF8964-E906-41D0-AFED-F241E974E08E,EfiDxeSmmReadyToLockProtocolGuid 6107BE23-5BAA-4FC9-8FC9-F2AEA77B07A7,FireWireOhci 61422D26-81EC-47FF-B6CF-939EAEE73FBA,StatusCodeDxe 617076FC-65EE-4340-9B18-7E72FEC05D5A,SmcAOCPei 6195F786-D7B1-45F1-9AC7-82EF976ADF4C,SmcNVDIMMSmmDriver 61A4D49E-6F68-4F1B-B922-A86EED0B07A2,EfiUgaIoProtocolGuid 61AD3083-DCAD-4850-A50C-73B23B3B14F9,IsaIoDxe 61AFA223-8AC8-4440-9AB5-762B1BF05156,Mtftp4Dxe 61AFA251-8AC8-4440-9AB5-762B1BF05156,Mtftp6Dxe 61C68702-4D7E-4F43-8DEF-A74305CE74C5,PeiSmmControlPpiGuid 61EC04FC-48E6-D813-25C9-8DAA44750B12,EfiPlatformMemory2ErrorSectionGuid 61ED3D94-30D8-408C-97DF-DEDF2740F630,AmtLockPbtn 621734D8-8B5E-4C01-B330-9F89A1081710,PlatformHookLibSerialPortPpi 621DE6C6-0F5E-4EE3-A102-0BDE769A0AD4,LenovoRemoteConfigUpdateDxe 62331B78-D8D0-4C8C-8CCB-D27DFE32DB9B,EfiLegacySpiSmmControllerProtocolGuid 62408AD5-4EAC-432B-AB9B-C4B85BFAED02,DxeIpmiLibIpmiProtocol 627EE2DA-3BF9-439B-929F-2E0E6E9DBA62,BootScriptSmmPrivateDataGuid 628A497D-2BF6-4264-8741-069DBD3399D6,ConSplitter 62960CF3-40FF-4263-A77C-DFDEBD191B4B,EfiBluetoothConfigProtocolGuid 6298FE18-D5EF-42B7-BB0C-2953283F5704,SleepSmi 62C1E22F-BF7A-462E-A037-BF97BBC3ADF9,EzConfigDxe 62CEEF5A-1D7C-4943-9B3A-95E2494C8990,Emul6064KbdInputProtocolGuid 62D171CB-78CD-4480-8678-C6A2A797A8DE,CpuInitDxe 62DA6A56-13FB-485A-A8DA-A3DD7912CB6B,AmiResetSystemEventGuid 62DC08AC-A651-4EE9-AF81-EAA9261E9780,S3NvramSave 62E135CA-88C1-4F15-93E1-01193B3499F4,ASiXUsbEthernet 62FC1B9A-8851-4654-90AD-CEA8C07FE259,IchSpi 63017E66-D790-4EE6-A0AC-6192AA74ACF7,UCR 6302D008-7F9B-4F30-87AC-60C9FEF5DA4E,EfiShellProtocolGuid 630AEB10-2106-4234-9DB3-836A3663F50D,BaseCacheAsRamLibNull 63296C52-01CF-4EEA-A47C-782A14DA6894,SmramSaveInfoHandlerSmm 632D5625-B73D-43B8-AF30-8D225D96168E,BasePalLibNull 633194BE-1697-11E1-B5F0-2CB24824019B,AmiPeiEndOfMemDetectGuid 6339D487-26BA-424B-9A5D-687E25D740BC,Tcg2ConfigFormSetGuid 634E8DB5-C432-43BE-A653-9CA2922CC458,Nvme 6372357A-06D7-43EF-B55C-1964F3DD6916,DxeIpmiBmcInitialize 637E0BA6-C5BB-41B7-A23B-3A65CFC3E9DB,BatteryState5 63809859-F029-41C3-9F34-EEEB9EA787A5,IioInit 63811871-CCD2-1042-AACB-5E5B88FF6E68,DiagAccess 63819805-67BB-46EF-AA8D-1524A19A01E4,SmallLogo 63819805-DDDD-46EF-AA8D-1524A19A01E4,SmallLogo 6388CB0C-CD3A-4D1E-B26C-4D823D8B4BDF,PciExpressDxe 639707CE-F961-4F3D-99BD-7DFAFFCB1D54,PlatformInit 63AAAFFA-53BD-4ED1-B5A3-A8A5619C563F,SlotDataUpdateDxeLightningRidgeEXECB2 63B2BC2D-DF5D-419B-873C-2C78A6604A7A,SgDxePolicyInit 63B6E435-32BC-49C6-81BD-B7A1A0FE1A6C,PeiSmbusPolicyPpiGuid 63C4785A-CA34-4012-A3C8-0B6A324F5546,EfiRngAlgorithmX9313DesGuid 63D1F792-7731-4A44-BC8E-9180A36FD0A8,IccOverClocking 63DAB9CE-5D03-4560-8A89-D81366363A2C,ChipsetErrReporting 63E3BDCF-2AC7-4AC0-9B92-03A7541422FF,Hash2DxeCrypto 63E60A51-497D-D427-C4A5-B8ABDC3AAEB6,EfiRegexSyntaxTypePerlGuid 63EA1463-FBFA-428A-B97F-E222755852D7,HighMemDxe 63FA7900-6DD2-4BB3-9976-870FE27A53C2,BackButtonSmall 64196C76-58E3-0B4D-9484-B54F7C4349CA,BootModePei 642237C7-35D4-472D-8365-12E0CCF27A22,BootMaintFormSetGuid 642CD590-8059-4C0A-A958-C5EC07D23C4B,EfiPlatformToDriverConfigurationProtocolGuid 643DF777-F312-42ED-81CC-1B1F57E18AD6,PchSmbusArpDisabled 6441F818-6362-4E44-B570-7DBA31DD2453,EfiVariableWriteArchProtocolGuid 645462F4-AF50-4FC5-838F-1DFBE3225511,UsbCdcNcm 6456ED61-3579-41C9-8A26-0A0BD62B78FC,Ip4IScsiConfigGuid 64980BB9-7BA3-4CB0-AA83-FE396A7F6724,UbaMainPeim 64A11188-5B86-4F59-A702-73365896E65E,AcpiVTD 64A892DC-5561-4536-92C7-799BFC183355,EfiIsaAcpiProtocolGuid 64AAEAE0-92DF-4980-8668-6EB5EAAF4393,FvInfoPei 64C96700-6B4C-480C-A3E1-B8BDE8F602B2,AmiPeiAfterMrcGuid 650DFE73-6AC8-45E6-9215-9872BEC8B276,ICCDXE 65289AE5-1589-484C-A610-90E10AC2DB28,SiSaPolicyPpiGuid 652B38A9-77F4-453F-89D5-E7BDC352FC53,PeiUsbHostControllerPpiGuid 654FE61A-2EDA-4749-A76A-56ED7ADE1CBE,CmosPei 65530BC7-A359-410F-B010-5AADC7EC2B62,EfiTcp4ProtocolGuid 655E4C19-9D7B-4491-AD10-A49FF355C00A,FastBootOptionBds 6568A3D6-015F-4B4A-9C89-1D146314130A,EfiSmmBaseThunkCommunicationGuid 6572045F-B1BF-458E-BC02-706762C609AE,EfiHeciSmmRuntimeProtocolGuid 65A18235-5096-4032-8C63-214F0249CE8D,BaseMemoryLibSse2 65E5746E-9C14-467D-B5B3-932A66D59F79,XhciPei 662AD66E-F52D-47F6-A350-488DB9F8AF68,FirmwareUserInterface 6653876C-F6A1-45BB-A027-20455093BC6D,SecPeiFspPlatformSecLibVlv2 66595A32-1877-4AE1-8748-809666EDADC7,AppleVTdDxe 665D3F60-AD3E-4CAD-8E26-DB46EEE9F1B5,RnRConfig 665E3FF5-46CC-11D4-9A38-0090273FC14D,EfiWatchdogTimerArchProtocolGuid 665E3FF6-46CC-11D4-9A38-0090273FC14D,EfiBdsArchProtocolGuid 667A8B1C-9C97-4B2A-AE7E-568772FE45F3,BaseResetSystemLibNull 667DD791-C6B3-4C27-8A6B-0F8E722DEB41,EfiEventNotificationTypeDmarGuid 6683D10C-CF6E-4914-B5B4-AB8ED7370ED7,AmiValidBootImageCertTblGuid 6684D675-EE06-49B2-876F-79C58FDDA5B7,IrmtAcpiTableStorageGuid 668706B2-BCFC-4AD4-A185-75E79F3FE169,NvmeDynamicSetup 669346EF-FDAD-4AEB-08A6-21462D3FEF7D,PerformancePkgTokenSpaceGuid 6695974D-968C-420B-80B9-7870CD20118F,PlatformSecLibNull 6696936D-3637-467C-87CB-14EA8248948C,SimpleTextInOutSerial 66BF079F-2A14-47ED-A0F2-90CAF356E088,ASM108XPEI 66D54351-4C4B-4470-9599-F17A32752871,AplRecoveryPei 66DE8584-DE01-4BAB-B5D0-8B99594372FC,IchUhciPei 66ED4721-3C98-4D3E-81E3-D03DD39A7254,EfiUdp6ServiceBindingProtocolGuid 66EECF40-6312-4A1A-A83A-B3B2F8D8A71A,LenovoVariableDxe 6707536E-46AF-42D3-8F6C-15F2F202C234,MXMdat 67269263-0AF1-45DD-93C8-299921D0E1E9,SmbiosUpdateDataProtocolGuid 672A0C68-2BF0-46F9-93C3-C4E7DC0FA555,UsbCredentialProvider 6737F69B-B8CC-45BC-9327-CCF5EEF70CDE,AmiPlatformIdeProtocolGuid 67439E94-FD37-4A32-BD53-3B97386432E4,Ahci 67451698-1825-4AC5-999D-F350CC7D5D72,CryptoPPI 6776572C-FE56-42CA-9B93-3D0960E7583A,IconBrokenBoot 67791E00-0C05-4AE7-A921-FC4057221653,TxtOneTouchDxe 67820532-7613-4DD3-9ED7-3D9BE3A7DA63,Aint13 67A54A24-3F4F-4048-8787-3E5AA2A0B7D2,SAPolicy 67AC0B1E-54C2-41A6-B57E-C2A321416ABC,ActiveBios2 67B495CF-17CE-424B-9633-49773AE63908,UsbWorkaroundDxe 67BC3883-7E79-4BC1-A33E-3AF7D17589BA,AmiHddPowerMgmtProtocolGuid 67C4F112-3385-4E55-9C5B-C05B717C4228,EfiSmmSwapAddressRangeProtocolGuid 67C53648-DA56-4726-AE21-FBA4D04686B3,RsdpPlus 67C63A11-F89D-4500-8270-D9DB251EB2AF,Ps2KeyboardPei 67F8444F-8743-48F1-A328-1EAAB8736080,EfiCertRsa2048Sha1Guid 67FA951E-4FA2-9F4E-A658-4DBD954AC22E,PlatformSmbiosDxe 6806C45F-13C4-4274-B8A3-055EF641A060,DxeFileExplorerProtocol 6807217E-E8DE-42D0-91D9-60AECED7420D,Stall 681D2368-4540-4FA9-8C1D-8B79DBF6B9AE,HybridGraphicDxe 681F3771-6F1D-42DE-9AA2-F82BBCDBC5F9,WinNtFlashMapPei 682FC854-D0CB-4C9F-A8C4-F4F97A39EF3E,OemProcMemInitLibPpi 6834FE45-4AEE-4FC6-BCB5-FF45B7A871E2,BeagleBoardTokenSpaceGuid 6847CC74-E9EC-4F8F-A29D-AB44E754A8FC,ArmMpCoreInfoPpiGuid 68501047-111F-4BD2-AA33-6C1ECE271259,ApplePlatformInitDxe 6869C5B3-AC8D-4973-8B37-E354DBF34ADD,CmosManagerSmm 6877BA45-7E87-449F-984F-FD04503D7A28,SmcSetPowerStatusSmm 687A830D-55FB-415A-9520-182789353284,SetupExit 6888A4AE-AFCE-E84B-9102-F7B9DAE6A030,EmuBlockIoProtocolGuid 6895F6F0-8879-45B8-A9D9-9639E532319E,UhciPeiUsb 689CDA29-29A8-42F6-93FC-46BA5F180651,ImagePasswordProceed 689E4C62-70BF-4CF3-88BB-33B318268670,EfiBlockIoCryptoAlgoAesCbcMsBitlockerGuid 68B81E51-2583-4582-95DB-C5723236C4F1,NonSmmEmul6064TrapProtocolGuid 68D076CD-D8F3-409B-987F-1012CDB88242,SlotDataUpdateDxeLightningRidgeEXECB4 68D89864-C0A8-490D-BE18-C83D67240928,SmbiosDataUpdateDxeNeonCityFPGA 6903A447-CB4F-45F6-89A2-7E7E2F9EE14C,InstallMsdm 69282DF3-778F-4269-91AA-D7DF6E193317,Uc2OnUcThunk 6950AFFF-6EE3-11DD-AD8B-0800200C9A66,AmdAgesaDxeDriv 695BEC93-82AE-4C17-BDAD-7F184F4E651D,LibC 695D8AA1-42EE-4C46-805C-6EA6BCE799E3,EfiPeiVirtualBlockIoPpiGuid 69735520-DA83-444A-93DC-BDDD59E59182,Heci3Smm 697CFA95-B1F2-4ED7-A0D2-7AC6E47B3C99,SwitchableGraphicsDxe 697D81A2-CF18-4DC0-9E0D-06113B618A3F,EfiExtendedSalMpServicesProtocolGuid 6987936E-ED34-44DB-AE97-1FA5E4ED2116,HelloWorld 699ADD70-8554-4993-83F6-D2CDC081DD85,SerialCapsuleGuid 69A79759-1373-4367-A6C4-C7F59EFD986E,FspReservedMemoryResourceHobGuid 69D13BF0-AF91-4D96-AA9F-2184C5CE3BC0,PlatformModuleTokenSpaceGuid 69E1A19F-BC8C-4021-B3D9-E0B2545092C6,OC_Tuner 69E6DD6D-F09E-485F-9627-EB70E9CFC82A,UbaInitDxe 69FD8E47-A161-4550-B01A-5594CEB2B2B2,IdeBusDxe 6A056C67-3128-4102-9EC7-265E73AAB860,GopCardEnabler 6A061113-FE54-4A07-A28E-0A69359EB069,SgTpvACPI 6A1EE763-D47A-43B4-AABE-EF1DE2AB56FC,EfiHiiPackageListProtocolGuid 6A3DEF38-0A45-4107-A74E-ABF2B8EAED86,MemorySubClass 6A504489-884E-4465-A02F-03B248CDEF13,UserInterfaceTheme 6A628EFE-3682-4FDC-A31E-C635BDF18CC8,BdsMilestone 6A7A5CFF-E8D9-4F70-BADA-75AB3025CE14,EfiComponentName2ProtocolGuid 6A7B1C86-590E-47A7-971A-C49B408D5ED7,LenovoSetupSecurityDxe 6A8A395F-4C07-49D1-B94C-22ED50D425F8,LenovoSecureKeyDxe 6AC5D123-C6E5-41BA-9BE3-A0371EE54B78,SetupConfigUpdateDxeNeonCityFPGA 6ADFFA83-55AE-4C9F-94A4-800C469BDABC,StaticSkuDataDxeLightningRidgeEXECB2 6AEA1B20-6384-4B5F-ABAC-776A11698DED,LegacyBiosReverseThunk 6AFD2B77-98C1-4ACD-A6F9-8A9439DE0FB1,EfiSmmStatusCodeProtocolGuid 6B1AB225-2E47-4A61-8FF5-B8EA42EE3EA8,SecureFlashDxe 6B1C5323-297E-4720-B959-56D6F30FEE00,YieldingDelayDxe 6B1EFA14-06B8-4127-975A-5B2DCF5392E2,SmcPostMsgHotKey_DXE 6B26DE1E-3DF2-4A1D-9B7F-B816B8C90872,ComputraceSmm 6B309956-6617-472B-BBC7-2A09E55E3E52,ProgressBarFullLeftEndcap 6B30C738-A391-11D4-9A3B-0090273FC14D,EfiPlatformDriverOverrideProtocolGuid 6B38F7B4-AD98-40E9-9093-ACA2B5A253C4,DiskIoDxe 6B41B553-A649-11D4-BD02-0080C73C8881,WinNtSerialIoDxe 6B4FDBD2-47E1-4A09-BA8E-8E041F208B95,PchUsbPei 6B558CE3-69E5-4C67-A634-F7FE72ADBE84,BlockMmioProtocolGuid 6B6FD380-2C55-42C6-98BF-CBBC5A9AA666,SocketSetup 6B7067C7-A843-A34C-9530-48446963B740,KeyMapLibNull 6B789215-B063-45FD-868A-668A49F00EC6,TXTWrapperPei 6B844C5B-6B75-42CA-8E8E-1CB94412B59B,TcgPeiplatform 6B8947C2-4287-4D91-8FE0-A381EA5B568F,rmHwA15Guid 6B9FD3F7-16DF-45E8-BD39-B94A66541A5D,EdkiiPiSmmMemoryAttributesTableGuid 6BB4F5CD-8022-448D-BC6D-771BAE935FC6,EfiKmsFormatSha256256Guid 6BE18C9C-BF61-499E-88EC-5CD57430460C,PchSmiDispatcher_ 6BE272C7-1320-4CCD-9017-D4612C012B25,AdapterInfoPlatformSecurityGuid 6C077FAF-8258-4C08-B86D-B8DC632632B4,SmmPlatform 6C0E75B4-B0B9-44D1-8210-3377D7B4E066,SmmAccessPei 6C160B26-E04C-4098-A6AC-C8C7B6471A86,SetupConfigUpdateDxeLightningRidgeEXECB2 6C2004EF-4E0E-4BE4-B14C-340EB4AA5891,StatusCodeHandlerRuntimeDxe 6C289241-E240-483F-9E3E-872C0396B599,FlashSmiSmm 6C79BA9B-5926-4295-A450-46B3401D95A5,AcpiPlatform1 6CC094E8-8278-47AB-868C-D826539968C1,AsusPcie2ClkReqMapping 6CC45765-CCE4-42FD-BC56-011AAAC6C9A8,EfiPeiReset2PpiGuid 6CDDBF28-89AC-4E01-9692-616B8A1009C8,FvFileLoaderOnLoadFileThunk 6CE6B0DE-781C-4F6C-B42D-98346C614BEC,HpetTimerDxe 6D1D13B3-8874-4E92-AED5-22FC7C4F7391,BiosGuardDxe 6D33944A-EC75-4855-A54D-809C75241F6C,BdsDxe 6D497A7A-D7DA-467C-B485-B7FB3493C41F,DxePciSegementLibEsal 6D4BAA0B-F431-4370-AF19-99D6209239F6,BiosGuardServices 6D582DBC-DB85-4514-8FCC-5ADF6227B147,EfiPeiS3Resume2PpiGuid 6D5C61C2-7694-4775-9F03-ED1E80DEC318,menu_top_mid 6D6963AB-906D-4A65-A7CA-BD40E5D6AF2B,Udp4Dxe 6D6963AB-906D-4A65-A7CA-BD40E5D6AF4D,Tcp4Dxe 6D86FB36-BA90-472C-B583-3FBED3FB209A,FspHobGuid 6D9BF711-A90D-42F9-A3FB-DD08B6E89037,SLP20EncryptedOEMPublicKeyVariableGuid 6DA670E8-3D73-4EB2-A721-A2DDF682FDD8,Tpm12MeasureConfigurationInfoFuncGuid 6DADA47D-645A-4128-B292-57A475E1456A,AppleSecureBootDxe 6DADF1D1-D4CC-4910-BB6E-82B1FD80FF3D,EfiSmmPeiSmramMemoryReserveGuid 6DB075DE-449E-2644-96D0-CC5A1B4C3B2A,FirmwareVolumePei 6DB9486F-6AF6-4090-984D-238482CE3EA4,BdatAccessHandler 6DC01095-9001-4E4D-B852-AF429EADFF57,OemPowerMgmtDxe 6DCBD5ED-E82D-4C44-BDA1-7194199AD92A,EfiFmpCapsuleGuid 6DDBF08B-CFC9-43CC-9E81-0784BA312CA0,BeagleBoardTimerDxe 6DFD6E9F-9278-48D8-8F45-B6CFF2C2B69C,TpmMeasurementLibNull 6E056FF9-C695-4364-9E2C-6126F5CEEAAE,EfiPeiFirmwareVolumeInfoMeasurementExcludedPpiGuid 6E057ECF-FA99-4F39-95BC-59F9921D17E4,EdkiiSmmReadyToBootProtocolGuid 6E2FFCF4-6899-414C-9B55-3A08842E650C,AppleIvyBridgeGop 6E53E391-40FC-4539-9055-06469C50AFBC,AmiPciAccessCspBaseLibOverride 6E59DF06-62D3-40B0-82B5-175CF84A94E4,OEMPEI 6E5ED30F-EC52-4136-8A41-3F4324218E41,DeviceIoOnPciRootBridgeIoThunk 6E66DAE5-4108-40B5-89A9-C6103F0639EC,GlobeBorder 6E6EBC2D-77AB-46CF-B2A7-CC968B0E8AF3,mAmiTcgInterfaceVarGuid 6E72A82C-14A5-4F02-A377-4A423BB1817F,WindowsNameLabel 6E851687-A7A9-4AA2-8DD0-673E03E51433,SetSockOpt 6E9A4C69-57C6-4FCD-B083-4F2C3BDB6051,FdtPlatformDxe 6EA0F71C-614A-437E-8F49-243AD4E83268,Emul6064TrapProtocolGuid 6EB44D26-1D39-4FEB-A993-4DAAFB5F8D85,HybridDriver 6ECD1463-4A4A-461B-AF5F-5A33E3B2162B,EfiPeiGraphicsPpiGuid 6ECEFFFD-614D-452E-A81D-25E56B0DEF98,BatteryState0 6ECFCE51-5724-450C-A38A-58553E954422,SmmAccessPeim 6EE1B483-A9B8-4EAF-9AE1-3B28C5CFF36B,SkipTpmStartupGuid 6EEDE20E-8F32-4FE2-BEB7-7A00F3CCDBC3,OpromUpdateDxeLightningRidgeEXRP 6EFAC84F-0AB0-4747-81BE-855562590449,XenIoProtocolGuid 6F0198AA-1F1D-426D-AE3E-39AB633FCC28,Cf9ResetDxe 6F0CF054-AE6A-418C-A7CE-3C7A7CD74EC0,LogoPcx 6F1B1FA2-561D-47C3-A22D-DBDC21246D8F,TrustedChannelSmm 6F20F7C8-E5EF-4F21-8D19-EDC5F0C496AE,MemInfoProtocolGuid 6F2C06A8-D4B4-4A93-9F78-2B480BE80E0F,EfiSmiFlashProtocolGuid 6F71926E-60CE-428D-AA58-A3D9FB879429,IfConfig6 6F871ADD-9D86-4676-8BAD-68E2E451FC5B,MicrocodeFlashAccessLibNull 6F8C2B35-FEF4-448D-8256-E11B19D61077,EfiSecPlatformInformationPpiGuid 6F92E393-03C0-427B-BBEB-4EF807B55BD8,IconNetworkRecovery 6FC01D84-46C5-4E83-91B7-FD8FBABD7B12,BiosInfo 6FCE3BB9-9742-4CFD-8E9E-39F98DCA3271,AmiPciSmmHandoffProtocolGuid 6FD1DCC5-B5B9-4A82-8728-8D854428A4A3,DxeFfsGfxDriver 6FD5B00C-D426-4283-9887-6CF5CF1CB1FE,EfiUserManagerProtocolGuid 6FDE3AF8-37AD-43FC-B728-F4D341F39240,PhoenixSmmWatchdogTimerProtocolGuid 6FE38843-6500-42C2-A535-7769DEA56AA4,FpgaLoaderPeim 6FF23F1D-877C-4B1B-93FC-F142B2EEA6A7,EfiGopDisplayBrightnessProtocolGuid 6FF479F5-6120-4A41-A8C9-D9500F7DF594,Mdot2Driver 6FFEC78D-7DBF-4F8B-968D-2F43A080C13F,PhoenixDesktopWindowProtocolGuid 70101EAF-0085-440C-B356-8EE36FEF24F0,EfiLegacyRegion2ProtocolGuid 70232FB4-81F4-49F6-AA05-51D99EBDC352,PciPlatform 7030AB02-B04D-4ABE-8801-20201D0C566A,ASUSFancyStart 704EA695-F373-42D4-BF1B-44BB7F60C295,menu_bottom_left 704EBEA2-5EE6-4898-9659-018B74B44789,EfiSeCOperationProtocolGuid 7064F130-846E-4CE2-83C1-4BBCBCBF1AE5,AppleBootPolicy 7076876E-80C2-4EE6-AAD2-28B349A6865B,EfiCertX509Sha384Guid 707BE83E-0BF6-40A5-BE64-34C03AA0B8E2,EfiSmbusArpMapGuid 7081E22F-CAC6-4053-9468-675782CF88E5,EfiEventDxeDispatchGuid 709E6472-1BCD-43BD-8B6B-CD2D6D08B967,AcpiAtd 70A4D159-1F01-4203-A598-7C2794151CE6,EfiOsBootOptionNames 70AEBF01-9EA0-48D8-AE17-3A184B12DBFE,TseDefaultBootOrder 70B221AF-FDFF-4FDE-9968-1AF623A956D9,EfiI2cHostProtocolGuid 70D57D67-7F05-494D-A014-B75D7345B700,StorageSecurityCommand 70E1A818-0BE1-4449-BFD4-9EF68C7F02A8,ReFlash 70E56C5E-280C-44B0-A497-09681ABC375E,DmiDataGuid 70EEECBE-727A-4244-904C-DB6BF0055392,EfiEcAccessProtocolGuid 70F64793-C323-4261-AC2C-D876F27C5345,EfiKmsFormatGeneric256Guid 70FB9CE0-2CB1-4FD7-80EE-AB4B6CF4B43F,GetHostByName 70FFF0FF-A543-45B9-8BE3-1BDB90412080,TcgInternalflagGuid 710E415A-6A5B-4AEA-973F-6DD3F9CB0056,PLEDPEI 7112633D-590A-434E-8F99-80EBAEE13170,LenovoVariableChkDxe 71148D39-5926-4022-91AC-CB252AF74530,ASUSEZFlash 711C703F-C285-4B10-A3B0-36ECBD3C8BE2,EfiCapsuleVendorGuid 711E7D64-1131-494B-A2D1-84806CD72D53,EfiTcgTreeLogHobGuid 71202EEE-5F53-40D9-AB3D-9E0C26D96657,AmiTseSetupEnterGuid 71298B1B-26AA-44D8-87CD-91A087C3481A,SmbiosDataUpdateDxeLightningRidgeEXECB3 714845FE-F8B8-4B45-9AAE-708ECDDFCB77,ExFatDxe 716EF0D9-FF83-4F69-81E9-518BD39A8E70,EfiSdMmcPassThruProtocolGuid 71761D37-32B2-45CD-A7D0-B0FEDD93E8CF,EfiDirectedIoDMArErrorSectionGuid 717886AB-C40A-44CF-9114-4119E84B0DC7,PciCfgOnPciCfg2Thunk 71A8917B-0891-4E27-8A73-A9B334840393,AmiPeiBeforeMrcGuid 71C4C155-D54B-4D59-A2C1-F9A5723C65A8,EfiIsPlatformSupportWheaProtocolGuid 71E218BA-0F3F-46B6-A42E-93A2C1195A31,AmdRadeonDriver 71ED12D1-250B-42FB-8C17-10DCFA771701,LegacyInterrupt 71EE5E94-65B9-45D5-821A-3A4D86CFE6BE,EfiUserCredentialProtocolGuid 71F3B066-936A-4C84-9228-23230FD47C79,ImagePasswordFill 71F7CA83-96C5-4742-BAA2-76B807A06B95,SctGopVbeBltBin 71FD84CD-353B-464D-B7A4-6EA7B96995CB,NonDiscoverablePciDeviceDxe 71FE861A-5450-48B6-BFB0-B93522616F99,TPS65950 721ACF02-4D77-4C2A-B3DC-270B7BA9E4B0,FspNonVolatileStorageHobGuid 721C8B66-426C-4E86-8E99-3457C46AB0B9,TextSetupDxe 72234213-0FD7-48A1-A59F-B41BC107FBCD,ACPIOSFRVariableGuid 7235C51C-0C80-4CAB-87AC-3B084A6304B1,OvmfPlatformConfigGuid 7279D04D-AAAE-994A-8A5C-5AEA41D1FE3A,AppleArpDxe 728CAE6C-1FFC-449B-8681-BB2A621E0022,ContinueButtonSmall 72D78EA6-4DEE-11E3-8100-F3842A48D0A0,Isp1761PeriphDxe 72E40094-2EE1-497A-8F33-4C934A9E9C0C,EfiSmmSmbusProtocolGuid 72FE44FF-44FC-4653-918A-0D5E76C416D2,SetupConfigUpdateDxeLightningRidgeEXECB3 7300C4A1-43F2-4017-A51B-C81A7F40585B,EfiSmmStandbyButtonDispatch2ProtocolGuid 733CBAC2-B23F-4B92-BC8E-FB01CE5907B7,FvbServicesRuntimeDxe 734F8167-996B-4C5D-BBA3-815A72167FF8,BFGDxe 735F8C64-D696-44D0-BDF2-447FD05A5406,EmbeddedExternalDeviceProtocolGuid 736D8886-6D2B-4684-ADDE-84BFAB0F2737,SmiFlashLibs 737FE1C2-15E7-45D6-B37B-319FE880F733,SmmBase 7385DBBE-8050-4FAF-8B64-4C386E1FAA88,CodeAccessCheckS3Pei 738A9314-82C1-4592-8FF7-C1BDF1B20ED4,ShellTftpHiiGuid 738C6917-71F0-4D45-AB68-91744136AEEA,AppleIpAgent 73905351-EB4D-4637-A83B-D1BF6C1C48EB,TSEInvalidateBgrtStatusProtocolGuid 73995A5C-C2AB-48CC-A404-E39B38505C56,PlatformRecoveryOrderGuid 739C2226-3264-4454-991C-8DC44A73D6AF,ProjectPeiDriver 73ADAAC0-9857-4D74-B0D7-EC6094882D99,BaseTraceHubDebugLibNull 73DAB30F-3F9C-4160-B064-439CE16C3EDE,SystemBootManagerDxe 73E6F6B4-D029-4E87-8405-6067C8BD02A6,UsbPei 73E9457A-CEA1-4917-9A9C-9F1F0F0FD322,DebugPortDxe 73F70B77-943B-4090-99E8-4F8E4D824A43,wifi_none 73FF4F56-AA8E-4451-B316-36353667AD44,FspBootLoaderTolumHobGuid 7408D748-FC8C-4EE6-9288-C4BEC092A410,EfiPeiMasterBootModePpiGuid 742F95A8-714A-5C43-88BA-B3361F12EEE6,BootRomFlash 74346897-9E0C-4B41-BF1F-BAA1ECB85DA6,IioCfgUpdateDxeLightningRidgeEXRP 744C9DBD-74DE-424D-AB59-AA398305871F,EDIDParserDriver 7462660F-1CBD-48DA-AD11-91717913831C,EfiPciOptionRomTableGuid 7465BA75-88A7-4B61-9A7E-6D4EDF6804DC,AmiUdfMediaGuid 7474A4C6-7F30-4DE1-BC68-DA5EFE615B52,SmbiosDataUpdateDxeNeonCityEPRP 748221BC-2BA9-1545-8AA9-A03A8591999E,AppleNetVolume 7497B957-20C3-4E47-A2C0-594966FD28FD,UefiDriverPolicyDXE 74BD9FE0-8902-11E3-B9D3-F72238FC9A31,AndroidFastbootTransportProtocolGuid 74CBEC3C-8190-42A0-9C02-D1C5ADC706D7,AppleAirport 74D3B506-EE9C-47ED-B749-41261401DA78,QNCInitDxe 74D936FA-D8BD-4633-B64D-6424BDD23D24,FwBlockServiceSmm 75032015-D156-423E-BFA3-7A65ABA47105,EfiI2cBusConfigurationManagementProtocolGuid 750890A6-7ACF-4F4F-81BD-B400C2BEA95A,AcpiModeEnable 750D5755-A0C9-42D3-A326-B5D465413523,AppleSEPDxe 752F3136-4E16-4FDC-A22A-E5F46812F4CA,EfiShellParametersProtocolGuid 753630C9-FAE5-47A9-BBBF-88D621CD7282,SmmChildDispatcher 754AAF56-099B-440D-8DCD-626F4E2C52F4,RsaIScsiSupport 755877A6-4F10-4A5C-9B2E-852123B9682C,FlashSmiDxe 755B6596-6896-4BA3-B3DD-1C629FD1EA88,AmiFlashProtocolGuid 7576CC89-8FA3-4CAD-BA02-6119B46ED44A,AmiSioSmmHandoffProtocolGuid 7578B307-B25B-44F9-892E-209B0E3993C6,Emul6064MsInputProtocolGuid 7585C771-3CE4-41FE-B780-845CD85BA444,FirmwarePassword 75B0886E-CD6A-469F-AE0B-8CED9033D199,EfiBpdtLibBp2DataGuid 75CA7C9D-502E-468A-9AAF-7F2A29E6DBCF,AmiSbHddPolicyProtocolGuid 75FBCDBA-28C4-455A-A71D-536C9AB65093,SmcSetupModify 760F874E-B8CB-405E-AA32-A46AE2F3D680,VariableDefaultUpdate 7671D9D0-53DB-4173-AA69-2327F21F0BC7,EfiAuthenticationInfoProtocolGuid 768007EF-E607-4417-8F5D-BCFE16DAE336,SmbusConfigGuid 768BEDFD-7B4B-4C9F-B2FF-6377E3387243,NTFS 76A7B4FC-C8D5-462D-A4D2-6E88338A772A,PlatformCpuPolicy 76B6BDFA-2ACD-4462-9E3F-CB58C969D937,PerformanceProtocolGuid 76D5CF91-0C55-434E-97C2-D2825C82E610,OemActivation 76F3992D-529E-4EFE-8BBE-8E1ED432C223,AmiMeasurePciopromGuid 76FDC1AE-A42A-416A-98E3-A2F29146DAC3,AppleDhcpProtocolDxe 7701AA8F-27EB-4562-8C59-4731CAA24E7C,ScPmcFunctionDisableResetHobGuid 7701D7E5-7D1D-4432-A468-673DAB8ADE60,LdrMemoryDescriptorGuid 77148690-7E43-4673-AFAE-34532CDD4248,SmmControlDxe 772484B2-7482-4B91-9F9A-AD43F81C5881,EfiMiscSubClassGuid 7739F24C-93D7-11D4-9A3A-0090273FC14D,EfiHobListGuid 773CB08B-511A-4BD5-85AD-41D4F4B64A52,AmtSetup 77475D4F-7965-4038-B970-863FC73E0761,BSDP 77786445-99AC-4C2E-9FF1-990965770530,NCT3933Smm 77892615-7C7A-4AEF-A320-2A0C15C44B95,BiosRegionLock 77A6009E-116E-464D-8EF8-B35201A022DD,DigitalThermalSensorSmm 77AB535A-45FC-624B-5560-F7B281D1F96E,EfiVirtualDiskGuid 77B35E10-AC21-4DFB-B094-DDA8878A6521,ASM1061Pei 77C0B0CB-0406-4868-AEB5-C36B01D42FF6,MemoryInitWrapper 77CB5A2E-59C8-490E-B69D-A3862BE5B3A0,EobonPriorityMap 77E5B618-2612-4C28-BCDF-A2B14D8A3EFE,IFlashDxe 77EB6C06-FD48-488B-A1B3-AE0A70801369,CryptoDXE 7807E404-8281-4FF1-8457-0B54BABE263F,HitachiH8s2113Dxe 78092548-48CF-449B-9BDB-F63849856460,AmiProtocolInternalHlxeGuid 78097BB6-48CF-449B-9BDB-F63849856460,mAmiPpiInternalVarGuid 78247C57-63DB-4708-99C2-A8B4A9A61F6B,EfiMtftp4ProtocolGuid 78270D5E-9450-4FAE-8818-B91EA39864CD,ChipsetLibServicesSmm 7827D4B0-926E-48F9-8ABD-69816EF86D16,AppleDmgBootDxe 7833616E-AE0D-594F-870C-80E68682D587,ThunkProtocolList 783658A3-4172-4421-A299-E009079C0CB4,EfiLegacyBiosPlatformProtocolGuid 783AA974-DFB0-487B-906F-120FB9486E88,SetupConfigUpdateDxeLightningRidgeEXECB4 783D7527-85EE-4A95-A909-03F745E4E91D,TimerSmiDxe 786DA51A-86A5-47C5-BF8D-04877BE47260,AmiPciExpressGen3LibNull 786EC0AC-65AE-4D1B-B137-0D110A483797,IScsiCHAPAuthInfoGuid 788DD6A1-F1EE-4BBA-A925-C0E7D66271BD,SystemBoardDxe 788E1D9F-1EAB-47D2-A2F3-78CAE87D6012,IdccDataHubGuid 78941450-90AB-4FB1-B75F-589214E24A0C,FontPackageGuid 78965B98-B0BF-449E-8B22-D2914E498A98,EfiSmmStandbyButtonDispatchProtocolGuid 78B9EC8B-C000-46C5-AC93-24A0C1BB00CE,PwdCredentialProviderGuid 78BE11C4-EE44-4A22-9F05-03852EC5C978,EfiKmsFormatMd2128Guid 78BEE926-692F-48FD-9EDB-01422EF0D7AB,EfiEventMemoryMapChangeGuid 78BF418F-559B-43D5-940A-EFFA174217F7,DrySMI 78E4D245-CD4D-4A05-A2BA-4743E86CFCAB,EfiSecurityPolicyProtocolGuid 78FFCA55-4869-4393-BEE9-72E58BD3BE38,SystemFixedBusNumbersDxe 7914C493-F439-4C6C-AB23-7F72150E72D4,ImageAppleLogo 79263F9A-1701-4382-98C2-573F3558E6C8,PlatformFvbLibNull 7942EDD0-C023-4357-93ED-F6626D711E9E,PeiIpmiBmcInitialize 794B23CB-ECCE-497F-A14D-96E1AFCB00E3,NPKReserveMemGuid 795231E2-A205-4B8D-8C8D-7353B713DF7D,efi_pop_mid_pressed 798E722E-15B2-4E13-8AE9-6BA30FF7F167,IntelSmbiosDataHobGuid 79971BCB-D5C6-4D5A-9C24-BCA46C2ADBBE,BdsDriverProxy 79AA6086-035A-4AD9-A89A-A6D5AA27F0E2,NBPEI 79C3AC4A-DEC6-48F1-AFFE-E7B95A1CCB32,PoofAnimationState2 79C5C7B7-1083-42A6-AD15-2A4E7C4274D7,DxeSmmDriverEntryPoint 79CA4208-BBA1-4A9A-8456-E1E66A81484E,Legacy8259Dxe 79CB58C4-AC51-442F-AFD7-98E47D2E9908,EfiBootScriptExecutorContextGuid 79CD78D8-6EDC-4978-BD02-3299C387AB17,StatusCodeHandlerSmm 79DED328-7FCE-4909-9AFD-D66176AF97A6,OobRx 79E0EDD7-9D1D-4F41-AE1A-F896169E5216,LenovoWmaPolicyDxe 79E4A61C-ED73-4312-94FE-E3E7563362A9,PrintDxe 79E5F681-59F4-4415-8E46-8C223CF517E6,EfiBootMediaHobGuid 79FBAD19-F9E1-4D08-B7BC-358453195E41,AmiTpmRollbackSmmProtocolGuid 7A08CB98-E9BC-41C3-BE19-B302F3F1F595,Terminal 7A1CC2C0-7AF6-4F68-A564-CC03558FC3C5,SuperMDxe 7A28436A-E113-406A-AFF9-0DBF7F643E02,EfiTcgPrivateInterfaceGuid 7A422A24-0CF1-407D-AAF1-6A74C0103B98,SystemUsbHidPointerDxe 7A54B36F-F745-462C-B11F-16E03E52B617,AsusSpdTransfer 7A564231-240D-4BDB-8B87-8F589A988E13,SystemVspBcpRuntimeDxe 7A59B29B-910B-4171-8242-A85A0DF25B5B,EfiHttpProtocolGuid 7A5DBC75-5B2B-4E67-BDE1-D48EEE761562,EfiSmmSpiReadyProtocolGuid 7A627E16-679D-4814-8F82-EEAF3881F098,BatteryState6 7A699129-DAA0-4224-8629-7338DE5D45ED,TpmDriver 7A6CA3B8-EE1B-489C-B300-24544A7BD418,ShellCTestApp 7A9354D9-0468-444A-81CE-0BF617D890DF,EfiFirmwareFileSystemGuid 7A9A372D-3487-402E-B489-5FC551A43BD1,X11DPHDxeDriver 7AB22C56-2510-4FD2-AC18-57394419FBAB,UsbOcUpdateDxeNeonCityFPGA 7AB33A91-ACE5-4326-B572-E7EE33D39F16,EfiManagedNetworkProtocolGuid 7ABBC454-F737-4322-931C-B1BB62A01D6F,BootMonFs 7ADBAD98-7FE1-4774-9260-747327435E6D,SpsAcpiHooks 7AE3CEB7-2EE2-48FA-AA49-3510BC83CABF,PeiSeCPlatformPolicyPpiGuid 7AF77F94-4C38-4FF1-8CCD-3E084F2FFEC0,SkylakeGraphics 7B07D184-02D0-4BFD-AD6E-554C39353A13,LenovoSysConfigReqDxe 7B2349E0-522D-4F8E-B927-69D97C9E795F,EfiPaddingRsassaPssGuid 7B6F1DA6-EA4F-4938-A79F-0C58E1442AA1,LenovoPopManagerDxe 7B7B65B6-E350-4139-8FE4-665772D32A45,IhisiSmm 7B7B65B6-E350-4139-8FE4-665772D32A47,Ihisi 7B8DB049-C7C7-4D3B-809F-926DEE47CCA2,SBSMI 7B9A0A12-42F8-4D4C-82B6-32F0CA1953F4,AmiBoardInfoFileGuid 7BAC95D3-0DDF-42F3-9E24-7C644940379A,BdsStringPackGuid 7BAEC70B-57E0-4C76-8E87-2F9E28088343,EfiVT100PlusGuid 7BB28B99-61BB-11D5-9A5D-0090273FC14D,Logo 7BBC4123-5D5E-4C1C-95D1-30EBA48701CA,S4SlpDelaySmm 7BE725B2-F56C-41C7-9F03-1E7B56B65971,SystemUsbMemoryManagerDxe 7C04A583-9E3E-4F1C-AD65-E05268D0B4D1,UefiShellFileGuid 7C069ADA-DE4E-488C-B0FC-4F2E057D96D8,DUFontDriver 7C0D8842-B2D7-4E06-863D-F84218013BC7,LenovoPttPolicyDxe 7C29785C-66B9-49FC-B797-1CA5550EF283,PeiUsbIoPpiGuid 7C79AC8C-5E6C-4E3D-BA6F-C260EE7C172E,SmmRuntime 7C81C66A-4F11-47AB-82D3-67C4D635AED1,LegacyMebxLaunch 7C9A98F8-2B2B-4027-8F16-F7D277D58025,IntelBootGuardKeyManifest 7C9E5A63-B987-435E-B17F-9E9CFA53F880,SmmPlatform 7CA1024F-EB17-11E5-9DBA-28D2447C4829,TlsAuthConfigDxe 7CBD5702-C8E3-4F7E-BA08-EC7EF1BB2D67,IrqTableInfo 7CC1567C-CCB8-4C50-80BA-D44A3B667415,AmdSb800_PeiInterfacePei 7CC1667C-CCB8-4C50-80BA-D44A3B667415,SbInterfacePei 7CCB2D7E-CD15-417E-A5C8-003DA6325B9F,PowerStateManager 7CE75114-8272-45AF-B536-761BD38852CE,Slp21PubKey 7CE88FB3-4BD7-4679-87A8-A8D8DEE50D2B,EfiEventReadyToBootGuid 7CEA4F7E-2052-46ED-BEFD-E22A44DC65E7,Tpm20HobGuid 7D019990-8CE1-46F5-A776-3C5198676AA0,EfiExtendedSalResetServicesProtocolGuid 7D113AA9-6280-48C6-BACE-DFE7668E8307,AmiMpTpmBin 7D17EF81-57C8-4210-957C-6FDAA8EA1DD6,PciHotPlugDxe 7D24A234-A8C2-4718-BF60-A2EF070F414E,OpalPasswordSmm 7D2BD134-500D-4F42-AEE2-26ACCFB6CB1D,LibStdio 7D3DCEEE-CBCE-4EA7-8709-6E552F1EDBDE,FlaSStatusguid 7D574D54-D364-4D4A-95E3-4945DB7AD3EE,ShellInstall1HiiGuid 7D5FF0E3-2FB7-4E19-8419-44266CB60000,DP 7D77B32E-BAB2-4CC7-8378-7550513F3FCA,UsbOcUpdateDxeLightningRidgeEXECB4 7D84B2C2-22A1-4372-B12C-EBB232D3A6A3,VlvPolicyPpiGuid 7D916D80-5BB1-458C-A48F-E25FDD51EF94,EfiTtyTermGuid 7D9DDBFB-FB67-4303-90B0-9A7A7FF29B57,OpromUpdateDxeLightningRidgeEXECB1 7DADBC98-6489-4D1C-907A-8EE243AF805B,ASUS_EUPPEI 7DC20199-DE28-4A91-A89C-FF06F237352C,PrePostHotkey 7E0C6E3E-C80F-47D1-8ADA-554926B2B6B3,GenericMemoryTestDxe 7E1F0D85-04FF-4BB2-866A-31A2996A48A8,EfiPeiFvFileLoaderPpiGuid 7E374E25-8E01-4FEE-87F2-390C23C606CD,PlatformAcpiTable 7E3D95E4-89F8-41B9-B788-5FB22D77F9A3,SmcNVDIMMDxeDriver 7E4B2ACB-7391-408F-B143-3A0B07C6E165,FdoModeEnabledHobGuid 7E631AA5-AFCE-437B-81FA-FA34EA14B3C3,ExFatRecovery 7E7369CE-0188-4183-8C2D-DAF7B730E42B,AmiCmosBadHobGuid 7E97A470-EFDB-4D02-8FCE-6190D27BA296,EfiExtendedSalRtcServicesProtocolGuid 7E983BCE-5C99-4BE0-B3D0-210E8FDDD3C0,VlanceDxe 7E99BC9E-EDE9-48C1-85B9-689432817F8F,SystemEsrtDxe 7EB7126D-C45E-4BD0-9357-7F507C5C9CF9,RomLayoutPei 7EB88C46-22FF-4CBD-8FE7-495383FAB1E4,PciBoardDxeInit 7ECD9C20-68B9-4A6F-B515-D64FF500B109,FsRecovery 7ED59FC2-3395-5DD2-A31C-1EF2F098E166,GopConsole 7EDE6A1F-548E-453E-A95C-66939FE0295C,SwitchableGraphicsPei 7EE2BD44-3DA0-11D4-9A38-0090273FC14D,EfiIsaIoProtocolGuid 7EF21E8C-2FC1-4BC3-A84A-73025EAAB896,ProgressBarFullMiddle 7F0013A7-DC79-4B22-8099-11F75FDC829D,EfiCacheSubClassGuid 7F06A90F-AE0D-4887-82C0-FEC7F4F68B29,EmmcBlockIoPei 7F1647C8-B76E-44B2-A565-F70FF19CD19E,EfiDns6ServiceBindingProtocolGuid 7F4158D3-074D-456D-8CB2-01F9C8F79DAA,EfiTpmDeviceSelectedGuid 7F480A20-7A19-4764-A5CA-4E9B8AECAF1E,PchPciBus 7F4A3A75-538C-4259-B420-C44818CBC553,ATIPwrXDXE 7F4F86F6-EBC9-4603-A4C2-C7CC8B4476DB,Heci2BarSaveRestoreGuid 7F6E0A24-DBFD-43DF-9755-0292D7D3DD48,IsaFloppyPei 7F8D35BD-0CE3-4654-B5D3-73FC4B38AABF,PlatformEarlyDxe 7F955A3E-AFB5-4122-B925-4B1171F693F5,AmiBlockIoWriteProtectionProtocolGuid 7FA68D82-10A4-4E71-9524-D3D9500D3CDF,PlatformSecureLibNull 7FD082A9-3D6B-44E3-9C31-74D6B80F965C,SetupConfigUpdateDxeLightningRidgeEXECB1 7FED72EE-0170-4814-9878-A8FB1864DFAF,SmmRelocateDxe 7FFF52C8-82DE-4820-8960-5093102E484D,IncompatiblePciDevice 80023209-6386-4C1D-909B-63506A2146FF,HWM_SetupDXE 801ADCA0-815E-46A4-84F7-657F53621A57,SectionExtractionDxe 801E9DEF-DDBB-4CA3-9698-C9158EB86AEA,AmiPeriodicSmiControlProtocolGuid 8041F38B-0A34-49D7-A905-03AEEF4826F7,PlatformSsdtImageGuid 805B032B-6A00-46F5-8501-CB88A21D5321,BcmDhd 80897901-91F6-4EFE-9579-3353A0C02DAB,SDMediaDevice 809FBBFD-127A-4249-88BC-FD0E767F4FFD,IconInternalHD 80CF7257-87AB-47F9-A3FE-D50B76D89541,PcdDxe 80D7491A-F7D9-479D-A8F7-1B393B02ED66,FastBootRuntime 80DBD530-B74C-4F11-8C03-418665532831,EfiMemoryConfigDataGuid 80E66E0A-CCD1-43FA-A7B1-2D5EE0F13910,PciRootBridge 8108AC4E-9F11-4D59-850E-E21A522C59B2,BmAutoCreateBootOptionGuid 81212A96-09ED-4996-9471-8D729C8E69ED,EfiFirmwareErrorSectionGuid 812136D3-4D3A-433A-9418-29BB9BF78F6E,EdkiiSystemFmpCapsuleConfigFileGuid 81A4F912-E72F-44ED-8931-16A9FE9650E0,KbcEmulDxe 81CD3462-6A1A-42F8-829B-8D77481DDB64,AmiPciExpressGen2LibNull 81E4B34A-268C-4FCC-8E39-1C1D3E6F6E69,HddReadyDXE 81E67795-D8A3-43B2-8B5F-E0326F76AB91,wifi_4bars 820C59BB-274C-43B2-83EA-DAC673035A59,SataController 8217E118-1058-4C9B-936E-5B3027C2394B,PchLpcDxe 8218965D-20C0-4DD6-81A0-845C52270743,LenovoSetupDateTimeDxe 821C9A09-541A-40F6-9F43-0AD193A12CFE,EdkiiMemoryProfileGuid 821D8B77-246D-4E96-8E10-3467D56AB1BA,SetupAdvanced 821D8B77-246D-4E96-8E10-3467D56AB1BB,SetupMain 823B8A1A-6D01-45A6-8098-20DDD1C7B3D0,PlatformLtDxeLibNull 825880CC-DBB5-4955-8AFF-B26FA33C84AA,AppleFirmwareFeatures 826BCF56-BAC4-43F4-8EA1-8CDF0A121ABD,LenovoTranslateService 826CA512-CF10-4AC9-B187-BE01496631BD,EfiCertSha1Guid 82805649-7247-4DA4-8643-C8144D27E2E5,ProcMemErrReporting 8296AF37-D183-4416-B3B6-19D2A80AD4A8,EbcDebugger 82988420-7467-4490-9059-FEB448DD1963,MeConfig 829FDCA9-6917-4713-A3AD-F04CF3E1B25F,S4SlpDelayDxe 82ECEE48-9571-4427-8485-85A5A45A0F39,DxeSmmReadyToLockOnExitPmAuthThunk 82EF44E3-2C70-11E7-8DF1-B8E8562CBAFA,AppleVariableRuntimeDxe 83381B06-2EEA-4CF3-9B5F-D75B9B5C93DE,GetServByPort 83410FC1-2C86-470A-AF66-3966A1ED42BD,PhAmtSupport 834C0C5F-ADB3-4372-AEEB-03E4E9E6C591,IntelFspPkgTokenSpaceGuid 8378AB1E-4147-400A-8D84-E3DE981C0453,TamperResistantBoot 837DCA9E-E874-4D82-B29A-23FE0E23D1E2,VirtioMmioTransportGuid 838DCF34-907B-4D55-9A4B-A0EF7167B5F4,NvramPei 83C30E53-7A4C-4273-A686-65E9DC09D75B,AcpiDebugTable 83DD3B39-7CAF-4FAC-A542-E050B767E3A7,VirtioPciDeviceDxe 83F01464-99BD-45E5-B383-AF6305D8E9E6,EfiUdp4ServiceBindingProtocolGuid 83FA5AED-5171-4949-BDC9-0CBC9E123663,FwCapsuleRecoveryPPI 8401A045-6F70-4505-8471-7015B40355E3,UsbBusPei 8401A046-6F70-4505-8471-7015B40355E3,UsbBotPei 8404B613-EA35-466F-BC7B-9F51C965198E,AsusBackDoorPW 842A454A-75E5-408B-8B1C-36420E4E3F21,NvramSmi 8434DA1F-5CEB-402E-A93C-038CBE0F3F0E,SmmOemActivation 843DC720-AB1E-42CB-9357-8A0078F3561B,EfiSmmControl2ProtocolGuid 84562A94-1CFF-11DF-AB3F-FB61AA51C41C,PmRuntimeDxe 847BC3FE-B974-446D-9449-5AD5412E993B,BootManagerFormSetGuid 848377A0-A78D-469D-B766-87186AA6770D,EpuHwModeDxe 8489334D-4219-4CA1-9B42-1D46B0B75861,TcgPpVendorLibNull 848E908E-BD11-428E-94F9-7A0EEFCD37A6,BaseCsrToPcieLibNull 84DA4361-EE8A-4769-9368-4F28A1C92032,EfiBxtTokenSpaceGuid 84DDA68C-CA5A-4C30-9261-DD6DE7E45A95,EzSetupPortingDxe 84E7016D-1EB8-4637-B01E-9EED018C7AE0,BiosGuardNvs 84FA65AF-21BC-43BE-85FF-8AA7E7832A1D,AmiPciExpressLibNull 855328E7-F96F-4398-9E7F-1F0A8C014E2C,AppleMeDriverDxe 856C6A10-F3B8-4C2E-A273-7868C09BE8EA,MmcMediaDevice 85768E4A-6CDC-444E-93DF-936685B5DFCC,VlvRefCodePkgTokenSpaceGuid 858031F3-96A2-406E-ABCC-ED264A3A31D6,CryptRuntimeDxe 858EBE6F-360F-415B-B7DC-463AAEB03412,TcgLegacy 85A084FA-6B0E-BD4C-A20E-156E46103155,Legacy8259 85A6D3E6-B65B-4AFC-B38F-C6D54AF6DDC8,EfiSpiConfigurationProtocolGuid 85A8AB57-0644-4110-850F-981322047070,EdkiiSmmLegacyBootProtocolGuid 85B75607-F7CE-471E-B7E4-2AEA5F7232EE,EfiUserInfoAccessSetupAdminGuid 8600C3A8-4213-456E-832A-D51E8E5F4AB1,AppleHeciDxe 8614567D-35BE-4415-8D88-BD7D0C9C70C0,PlatformOverridesManagerGuid 86212936-0E76-41C8-A03A-2AF2FC1C39E2,EfiRscHandlerProtocolGuid 8628752A-6CB7-4814-96FC-24A815AC2226,EfiHashAlgorithmSha256NoPadGuid 863D214F-0920-437B-8CAD-88EA83A24E97,DatahubStatusCodeHandlerDxe 864693E2-EDE8-4DF8-8871-38C0BAA157EB,PeiFspWrapperHobProcessLibSample 8650A9D0-3A80-43F2-85D8-6D10CDBF611E,SuperMSmm 8657015B-EA43-440D-949A-AF3BE365C0FC,IoMmuDxe 865A5A9B-B85D-474C-8455-65D1BE844BE2,EfiDebugAgentGuid 865A5AAB-B85D-474C-8455-65D1BE844BE2,EfiSourceLevelDebugPkgTokenSpaceGuid 86787704-8FED-11E3-B3FF-F33B73ACFEC2,TcpFastbootTransportDxe 86843F56-675D-40A5-9530-BC858372F103,OsSelectionVariableGuid 86C29AA5-0DB0-4343-BD52-7A729F37C96D,AmiDigitalSignaturePPIGuid 86C77A67-0B97-4633-A187-49104D0685C7,EfiFirmwareManagementProtocolGuid 86CDDF93-4872-4597-8AF9-A35AE4D3725F,IScsiDxe 86D70125-BAA3-4296-A62F-602BEBBB9081,DxeIplPei 86F5680A-155C-4BC8-AC77-573848E2AD3D,AmiTreePpiGuid 86F61BDF-5BFD-46D3-B0F9-E43728DA1D2E,OCMR_CPU_POWER_MANAGEMENT_DXE 870CAF91-B79B-4EBA-920F-71E3DD4789F4,HeciRuntimeDxe 870E0F5A-1981-45F6-AE26-0391425CC46F,CpuCsrAccessSMM 8714C537-6D4B-4247-AA6C-29E8495F9100,FspNotifyDxe 87438836-AD8D-4E3E-9249-895120A67240,DebugCommunicationLibUsb 876730C9-9A69-4508-9579-CEBD1462A5FE,AmiSsidInit 878AC2CC-5343-46F2-B563-51F89DAF56BA,IntelIGopVbt 87AB821C-79B8-4EF6-A913-21D22063F55F,AcpiPlatform 87C76262-F1F3-4452-B805-47438A6793A7,SgDxePolicyInit 87C8BAD7-0595-4053-8297-DEDE395F5D5B,EfiDhcp6ProtocolGuid 87D402CD-8B07-4B93-B38B-F8799F28B033,TXTWrapperDxe 87DD3539-0667-4BB7-9FB2-47D3C50B021B,PhoenixDesktopMessageProtocolGuid 87E1BB14-4D5C-7C4E-A90E-E1415687D062,EmuTimer 87E36301-0406-44DB-AAF3-9E0E591F3725,VConfig 87E4A8F8-B74A-40B5-B019-E10A5DE11236,VbiosHook 87EA012D-CBAD-44C1-8431-61193A060941,PeriodicSmiControl 87FFC11C-D0AB-4D12-A779-0A5474050759,OemProtocol 8803FA9A-0D33-4022-856B-AB5932A0F8BF,AmdInitPostPeimPei 880AACA3-4ADC-4A04-9079-B747340825E5,EfiPropertiesTableGuid 882C5E65-D37B-441B-A1D9-6C89C5CC3AE1,UsbDonglePei 8863C0AD-7724-C84B-88E5-A33B116D1485,Host 8868E871-E4F1-11D3-BC22-0080C73C8881,EfiAcpi20TableGuid 88888888-8888-8888-8888-888888888888,WholeFv 889004EE-8388-43BE-8975-C593FC50BB4A,EmulatedEepromDxe 88A15A4F-977D-4682-B17C-DA1F316C1F32,RomLayout 88B468B3-A48B-4B87-ABE2-8E56DFFDAF8D,DualBiosSMM 88B49226-A63F-4505-9D3C-B5A67B846133,FrameworkSmmStatusCodeOnPiSmmStatusCodeThunk 88C065E7-900D-4899-B7B0-CD404E113F95,PchPortCF9hTrap 88C61F0D-DFA9-4087-8687-626A8B010E0C,PasswordLockSmall 88C9D306-0900-4EB5-8260-3E2DBEDA1F89,PeiPostScriptTablePpiGuid 88EA1FCB-3A5D-4ACF-A0B3-AACB36D4E90F,UsbLegacyControl 88EC827F-6CDE-41DD-8B55-BD62449C4F1B,VbtMipiPanel2Guid 88FAE289-0A6A-4097-9CCA-2BED645B094D,AplDxeIpl 890A3508-E816-41CF-B7E6-ED28E5BB5C28,AmtCompatiblity 890C2CEF-43C8-4209-A78D-AE14AA1798B4,AmiTcgPlatformPpiAfterMem 893BF598-FA5D-4B6C-8829-6016ECC443E7,MainErrorHandler 8958EDFF-02F7-4E49-87B1-FBA4BE4E8768,SmbiosDataUpdateDxeLightningRidgeEXECB4 8962C28B-0DFE-4739-A73F-092D374A7A13,efi_pop_RT_pressed 897508C5-FCDA-4DB9-8A7E-6214CF6C246C,LenovoNvmeInit 897508C5-FCDA-4DB9-8A7E-6214CF6CFFFF,LenovoHstiUpdate 8977B212-0A43-4048-993B-B39AC7B0FE21,gear9 8987081E-DAEB-44A9-8BEF-A195B22D9417,BasePciLibPciExpress 898890E9-84B2-4F3A-8C58-D8577813E0AC,EfiBluetoothAttributeProtocolGuid 899407D7-99FE-43D8-9A21-79EC328CAC21,Setup 899AFD18-75E8-408B-A41A-6E2E7ECDF454,EfiExtendedSalMtcServicesProtocolGuid 89A1B278-A1A1-4DF7-B137-DE5AD7C47913,EfiPchTokenSpaceGuid 89ADA336-4455-11E0-B7E6-A801E0D72085,InitResetArch 89E3C1DC-B5E3-4D34-AEAD-DD7EB2828C18,UsbTimingPolicyProtocolGuid 89E549B0-7CFE-449D-9BA3-10D8B2312D71,S3Resume2Pei 89F09528-C33A-47FB-BA19-FADE80A39F76,DxePlatformDxe 8A002AF2-EC39-4B01-BC64-84284267DF44,ASM104X_PEI 8A107CC5-DCDA-4FB7-A272-4243B41AFBFE,AppleGraphicsPolicy 8A219718-4EF5-4761-91C8-C0F04BDA9E56,EfiDhcp4ProtocolGuid 8A4E8240-74F8-4024-AE2B-B39221C9FA59,NvOptimusSMM 8A6B4A83-42FE-45D2-A2EF-46F06C7D9852,EfiUserCredentialClassSecureCardGuid 8A78B107-0FDD-4CC8-B7BA-DC3E13CB8524,PeiCpuIoPei 8A91B1E1-56C7-4ADC-ABEB-1C2CA1729EFF,AmiPostManagerProtocolGuid 8A97B11E-EE8E-11E2-B664-047D7B99E097,AcpiOverride 8AAEDB2A-A6BB-47C6-94CE-1B8096423F2A,EfiSocketServiceBindingProtocolGuid 8AC88C0F-6220-F243-8E27-56E17CC503DB,AppleNetLoadFile2 8B01E5B6-4F19-46E8-AB93-1C53671B90CC,EfiTpmDeviceInstanceTpm12Guid 8B12F29F-7135-4EAB-AFDA-0512F74B65EA,AmdSb900Dxe 8B24E4D4-C84C-4FFC-81E5-D3EACC3F08DD,ApplePlatformInfoDB 8B5FBABD-F51F-4942-BF16-16AAA38AE52B,AcpiPlatform 8B68002A-817B-0361-BABA-6341A44EA052,DPTFPolicy 8B7E5420-1B71-442A-9916-C13A4FE02482,SmbiosDataUpdateDxeLightningRidgeEXRP 8B8214F9-4ADB-47DD-AC62-8313C537E9FA,SmmBasePeim 8B843E20-8132-4852-90CC-551A4E4A7F1C,EfiDevicePathToTextProtocolGuid 8B9D3EE0-4BA4-433B-9C48-4E830B3B40FD,FloppyCtrl 8BA65DE3-39E1-4AFD-A8FE-7DD0BAFEFCC0,DxePalLibEsal 8BBE7DE7-6FFB-4128-8C33-23852EBC7920,EarlyVideoPei 8BC1714D-FFCB-41C3-89DC-6C74D06D98EA,EfiSmmPciRootBridgeIoProtocolGuid 8BCEDDD7-E285-4168-9B3F-09AF66C93FFE,S3ResumePei 8BE4DF61-93CA-11D2-AA0D-00E098032B8C,EfiGlobalVariableGuid 8BEEDB0D-A31A-0361-A312-5DC8574C65F1,AzaliaPolicyPei 8C2487EA-9AF3-11E3-B966-B8AC6F7D65E6,XenPvBlkDxe 8C376010-2400-4D7D-B47B-9D851DF3C9D1,PchMeUma 8C3CFB87-F7AE-4A36-AAFF-931FDC5F436E,AzaliaInitPei 8C439043-85CA-467A-96F1-CB14F4D0DCDA,LegacyRegionDxe 8C4C9A41-BF56-4627-9E0A-C8386D66115C,EfiTcgPlatformProtocolGuid 8C542316-A1E5-4001-89E7-15EDFF12577D,gear11 8C783970-F02A-4A4D-AF09-8797A51EEC8D,PowerManagement 8C87E0A0-B390-4BE3-819C-7C6C83CAE4EB,SmmBaseHelper 8C8CE578-8A3D-4F1C-9935-896185C32DD3,EfiFirmwareFileSystem2Guid 8C927876-EC71-4DE4-A91D-8AD478CA9539,CpuRas 8C939604-0700-4415-9D62-1161DB8164A6,AmiTcgPlatformProtocolguid 8C9D8537-9479-40F4-8C82-70D1EF5F7353,UsbOcUpdateDxeLightningRidgeEXECB2 8CB71915-531F-4AF5-82BF-A09140817BAA,FLASHMAPBIN 8CC435C5-6330-4269-B0C3-E3BD05C86FB8,DebugCommunicationLibSerialPort 8CE0E1E9-26DC-4F24-ADBD-6871B8223703,PciSdxcDxe 8CE65FC0-8F33-42A7-A2EA-46DEBE231EA6,XhciDxe 8CE8BC38-805D-442D-8DB0-479275CB1BF2,SystemErrorLogDxe 8CF2F62C-BC9B-4821-808D-EC9EC421A1A0,EfiPartitionInfoProtocolGuid 8CFC5233-23C6-49E3-8A2D-7E581AB305BA,EdbCfg 8CFDB8C8-D6B2-40F3-8E97-02307CC98B7C,EfiVariableIndexTableGuid 8D12E231-C667-4FD1-98F2-2449A7E7B2E5,EfiSmmControlProtocolGuid 8D1933CD-E806-4D83-9F9D-FF10E64D76D5,ISL95856Pei 8D1AE715-7F82-449D-A26C-62AC650AF73F,Int15PanelType 8D1F8D27-31C2-4B5B-B736-4BB5B4A25FBA,ASRGetDLSiteWrapper 8D22D303-69D5-40C9-A71E-5C38C951FC18,LegacyUsbIrqSolutionWADxe 8D25EF2C-2015-416E-B8AA-2369FECD4BDA,CTA9x4ArmVExpressLibSec 8D3BE215-D6F6-4264-BEA6-28073FB13AAA,ChipsetSmmThunk 8D3BE215-D6F6-4264-BEA6-28073FB13AEA,SmmThunk 8D463051-692F-4924-9AEC-0A833B1BA49B,PxeRomAr8132 8D48BD70-C8A3-4C06-901B-747946AAC358,EfiIsaHcPpiGuid 8D4A8276-1994-4E82-983A-A71753617797,menu_checked_selected 8D59D32B-C655-4AE9-9B15-F25904992A43,EfiAbsolutePointerProtocolGuid 8D59EBC8-B85E-400E-970A-1F995D1DB91E,IntelSnbGopDriver 8D6756B9-E55E-4D6A-A3A5-5E4D72DDF772,PciHostBridge 8D7AE6A9-B490-45E1-8795-C2BEAADC3814,RawIp4Rx 8DA47F11-AA15-48C8-B0A7-23EE4852086B,A01WMISmmHandler 8DA5D50B-A39C-4FF7-AB4F-7426A145D0E4,RandomNumberGen 8DD9176D-EE87-4F0E-8A84-3F998311F930,Dhcp6Dxe 8DD9176E-EE87-4F0E-8A84-3F998311F930,Dhcp4Dxe 8DD91798-EE87-4F0E-8A84-3F998311F930,ArpDxe 8DE287AC-9460-465C-B8FA-F6E9866AE56D,xgbe_atl 8DEEC992-D39C-4A5C-AB6B-986E14242B9D,EfiDiskInfoSdMmcInterfaceGuid 8DF01A06-9BD5-4BF7-B021-DB4FD9CCF45B,EfiHashAlgorithmSha224Guid 8DFAE5D4-B50E-4C10-96E6-F2C266CACBB6,VideoRom 8E008510-9BB1-457D-9F70-897ABA865DB9,EfiLegacyBiosExtProtocolGuid 8E325979-3FE1-4927-AAE2-8F5C4BD2AF0D,SdMmcPciHcDxe 8E477676-55FD-48CF-9210-15A99B27D740,Slp10 8E61FD6B-7A8B-404F-B83F-AA90A47CABDF,SmmSmbiosElog 8E68E3C5-FC59-4280-8467-3800D31A8162,IccOverClocking9_5 8EB48F19-CC92-4031-8D3D-EE473CCC87EB,SystemPrivateKey 8EE41730-CD91-FE40-A83A-F60F1ECB492D,IcnsConvert 8EEF9AD2-463E-425F-A4FE-2F6783D6F97E,GenericSio 8EF61509-890B-4FF2-B352-1C0E9CDDEC8B,I2CLibPei 8F0B5301-C79B-44F1-8FD3-26D73E316700,PowerMgmtSmm 8F1AC44A-CE7E-4E29-95BB-92E321BB1573,SecFspWrapperPlatformSecLibSample 8F26EF0A-4F7F-4E4B-9802-8C22B700FFAC,EnglishDxe 8F2C127E-117D-484B-8A44-FBD911BE125E,IpmiRedirFru 8F3F1DE2-2FE4-4D5C-A8EC-49E8CCA17EBC,RsdpPlus 8F4B8F82-9B91-4028-86E6-F4DB7D4C1DFF,Bds 8F4CD826-A5A0-4E93-9522-CFB0AB72926C,SataController 8F5A2E02-538C-4D59-B920-C4786ACBC552,Ahci 8F5C2D02-AF2B-49DE-B8D8-DF90130A2512,FlashMeDxe 8F644FA9-E850-4DB1-9CE2-0B44698E8DA4,EfiFirmwareVolumeBlock2ProtocolGuid 8F76DA58-1F99-4275-A4EC-4756515B1CE8,EfiBluetoothLeConfigProtocolGuid 8F7D7B1D-0E1C-4C98-B12E-4EC99C4081AC,EmptyApplication 8F92960E-2880-4659-B857-915A8901BDC8,Ip6Dxe 8F92960F-2880-4659-B857-915A8901BDC8,Ip4Dxe 8F9296EF-2880-4659-B857-915A8901BDC8,Ip4Config 8F98528C-F736-4A84-AAA3-376A8E43BF51,ImagePasswordEmpty 8FAAD0A7-02B4-432F-8F5C-B880965D8B41,SmmCommunicationBufferDxe 8FBECFE2-1313-4CF6-AD2C-D3B9472F62D3,SmartTimer 8FE545E5-DCA9-4D52-BFCD-8F13E717015F,AmiReflashProtocolGuid 9006872D-3A86-4BAE-A2F0-E527B9D7119E,IntelLanUefiDriver 9029F23E-E1EE-40D1-9382-36DD61A63EAA,NCT6683DPeiInit 9042A9DE-23DC-4A38-96FB-7ADED080516A,EfiGraphicsOutputProtocolGuid 905CF1B3-32F8-489C-A641-46A714583262,PcieErrorEnable 905DC1AD-C44D-4965-98AC-B6B4444BFD65,UfsPciHcPei 9069C144-0A7E-41EF-9C07-418BCA9BF939,AcpiDebugSmm 907125C0-A5F1-11E3-A3FE-A3198B49350C,FvSimpleFileSystem 9073E4E0-60EC-4B6E-9903-4C223C260F3C,EfiVendorKeysNvGuid 908C3852-B61B-4F26-AB66-F74F97E7DC1C,AMTbypass 9096EB5B-59D1-49F8-866C-78D24631A6B4,EndOfDxeBeforePciEnumEventGroupGuid 90A330BD-6F89-4900-933A-C25EB4356348,SDController 90B2B846-CA6D-4D6E-A8D3-C140A8E110AC,SystemFirmwareDescriptor 90C8D394-4E04-439C-BA55-2D8CFCB414ED,SataDriver 90CB75DB-71FC-489D-AACF-943477EC7212,SmartTimer 90E01103-F784-4020-91AC-C51E8BF553B2,LenovoWmaPciDxe 90EC42CB-B780-4EB8-8E99-C8E3E5F37530,UefiPciLibPciRootBridgeIo 90FAE0B9-AC26-4482-B532-9BED052A8F8B,VmwVariableDxe 9100696B-368F-4F9A-984A-D606E578CCC1,SetupConfigUpdateDxeLightningRidgeEXRP 910DCA07-1F94-4EE7-AF2F-FF72F3154353,EfiSmmBaseHelperReadyProtocolGuid 911D584C-35F7-4955-BEF9-B452769DDC3A,DebugSupportDxe 912740BE-2284-4734-B971-84B027353F0C,FspHeaderFileGuid 914AEBE7-4635-459B-AA1C-11E219B03A10,EfiMdePkgTokenSpaceGuid 91538AC9-A5D3-4DEF-9A70-28A087DEFA79,AppleDataHubUpdate 9168384A-5F66-4CF7-AEB6-845BDEBD3012,PlatformFlashAccessLibDxe 9173C39B-08DA-429A-BE15-0F7481CF72CE,AMTLockUsbKBD 918211CE-A1D2-43A0-A04E-75B5BF44500E,EfiCPTokenSpaceGuid 918ABA30-3D8D-4BB5-B849-45CC4FC7DE7C,DptfDxe 919B9699-8DD0-4376-AA0B-0E54CCA47D8F,FPVARIABLE 91A1DDCF-5374-4939-8951-D7293F1A786F,EnhancedSpeedstepProtocolGuid 91A737E6-7B54-4B5F-A491-ED5EF5C5A732,LastBootErrorLog 91ABC830-16FC-4D9E-A189-5FC8BB411402,AmiSmmDigitalSignatureProtocolGuid 91B43F81-DFCA-4EBA-93E1-FAD501E8F6D2,AmiScceMMCEnabledPpiGuid 91B4D9C1-141C-4824-8D02-3C298E36EB3F,SataDriver 91B886FD-2636-4FA8-A4A9-2EB04F235E09,CpuPeiBeforeMem 91BAC015-3A26-40FF-9F3E-C3F4FE9D24F9,SystemSmbiosAddedValueDxe 91C74E50-361D-4CDA-A16B-C92BE4BF16EE,AmiTcmSignalguid 91F6E9EB-9902-44B3-A487-C8E148D0F4EE,EmcaErrorLog 9204A71D-2050-4AB7-AD42-749CF9ADB4EB,Lpc47N20x 9205CDE5-5AE5-4A4B-BFBF-F6211967EEF9,LibLocale 921B35BF-0255-4722-BF5A-5B8B69093593,IchInitPei 921CD783-3E22-4579-A71F-00D74197FCC8,HeciSmm 921CD783-3E22-4579-A71F-00D74197FCC9,SpsSmm 9221315B-30BB-46B5-813E-1B1BF4712BD3,Defaults 9221BC02-8F2E-4CCA-BA89-EA6F91A4175E,CsmLoader 9257B1B6-82DF-4B69-A83B-C16D671B9A9F,ScreenCap 92685943-D810-47FF-A112-CC8490776A1F,CORE_PEI 926C9CD0-4BB8-479B-9AC4-8A2A23F85307,BaseIoLibIntrinsic 9282ED2E-F8CE-CA47-AF50-3542332F7D53,AppleDnsResolver 928EF6D4-72BC-4686-B57B-1EEB6ABD4F93,AcpiReset 929189C9-0670-4C0B-AF7D-135D1550C8C0,RecvDgram 929E8A68-0FB6-4F20-AC5E-D294C50B1CBB,TcpConnect_DXE 92BA9255-2819-4479-867A-1C58F072C5B2,TCG_MADriver 92C6033D-A685-BB41-AA2F-6F6E2CD374A2,AppleSmbios 92D11080-496F-4D95-BE7E-037488382B0A,EfiStatusCodeDataTypeStringGuid 92E33E65-20F0-455D-9D71-02C09D5060AE,PciPort 92F7436E-7395-4DA1-A7BE-F352F0BCD79C,LibContainer 93022F8C-1F09-47EF-BBB2-5814FF609DF5,FileSystem 93039971-8545-4B04-B45E-32EB8326040E,EfiHiiPlatformSetupFormsetGuid 9317EC24-7CB0-4D0E-8B32-2ED9209CD8AF,EfiPaddingRsassaPkcs1V1P5Guid 931FC048-C71D-4455-8930-470630E30EE5,SmmPerformanceExProtocolGuid 932C56C9-EB98-43C6-8514-2EB8A31B5277,HpIOXAccess 932F47E6-2362-4002-803E-3CD54B138F85,EfiScsiIoProtocolGuid 93390241-7D4D-4986-8A06-D46C982F5ECD,CrystalRidgePeim 934CE8DA-5E2A-4184-8A15-8E0847988431,AmiOptionRomPolicyProtocolGuid 935D2F78-3A1F-4DE6-B28D-123A40DD2DEC,SmmGenericElog 937FE521-95AE-4D1A-8929-48BCD90AD31A,EfiIp6ConfigProtocolGuid 93B80003-9FB3-11D4-9A3A-0090273FC14D,IsaSerialDxe 93B80004-9FB3-11D4-9A3A-0090273FC14D,PciBusDxe 93BA1826-DFFB-45DD-82A7-E7DCAA3BBDF3,SmmVariableWriteGuid 93BB96AF-B9F2-4EB8-9462-E0BA74564236,UefiOvmfPkgTokenSpaceGuid 93C81A74-B648-4F7F-925E-E4A0CDCC776D,VlvInitDxe 93C95FC4-B741-4587-9304-1C5A2BE6F742,ApplePlatformSecurityPolicy 93E18521-9E52-4EEB-A230-7C24B2EC03E8,LenovoMfgDoneDxe 93E1BD6D-6CC6-4EFA-A047-3C1ED9E95F89,LenovoTpmConfigDxe 93E34C7E-B50E-11DF-9223-2443DFD72085,ArmVeNorFlashDxe 93F1025B-B6D4-4F2F-A4A9-A4ABA0CF604F,aDefaultDxe 9400D59B-0E9C-4F6C-B59A-FC20009DB9EC,AmiPciIrqProgramGuid 9401BD4F-1A00-4990-AB56-DAF0E4E348DE,AmiHddSmartInitProtocolGuid 9437D7F5-6D31-4494-9A4B-F6EEB21B6CC3,SioScriptPEI 943D6B8B-D4D0-4005-81A0-AF26E5E07F03,MeFwLayout 94440339-CC93-4506-B4C6-EE8D0F4CA191,EdkiiNonDiscoverableAmbaDeviceGuid 945A0C97-4882-410A-9F30-E31C99398F7B,DxeIchSpiDxe 94621F9E-B5CA-4CFD-82BE-0C542EB0D9BE,TftpServer 94734718-0BBC-47FB-96A5-EE7A5AE6A2AD,Dhcp4Dxe 947558B9-64EB-4764-9F74-5EDBEA0C7481,DxePlatform 94796E10-7CF6-4A20-A3A0-4CF1A8341A16,menu_dots 949822BC-26D3-4BC6-954B-F2C581342DE1,SystemXhciDxe 94AB2F58-1438-4EF1-9152-18941A3A0E68,EfiSecurity2ArchProtocolGuid 94B9E8AE-8877-479A-9842-F5974B82CED3,EfiBoardFeaturesGuid 94E24C26-80FA-427D-80FB-E374E9E9BF85,Dhcp6 94ED2946-24EA-11DF-AF40-4300B0D2BA57,LegacyMemoryAllocatorDxe 94EDD12A-419B-447F-9434-9B3B70783903,DxePlatform 950216A2-A621-479C-A13D-2990617BDFE7,ReadOnlyVariable2OnReadOnlyVariableThunk 950E191B-8524-4F51-80A1-5C4F1B03F35C,PeiSha256HashPpiGuid 951B65E5-8872-41ED-AD1D-D5681F4AF033,EfiSpiHostProtocolGuid 952821AA-EACD-465B-B478-5429DFC9A747,OA2 952CB795-FF36-48CF-A249-4DF486D6AB8D,EfiTlsServiceBindingProtocolGuid 952EEE95-A6AF-43DA-A559-F349A46D710A,SimpleBootFlag 9546E07C-2CBB-4C88-986C-CD341086F044,EfiDebugSupportPeriodicCallbackProtocolGuid 9588502A-5370-11E3-8631-D7C5951364C8,AndroidFastbootApp 95A1046F-5EA7-4C6D-86A7-AA91B7421E68,CspFlashPeiLibNull 95A9A93E-A86E-4926-AAEF-9918E772D987,EfiEraseBlockProtocolGuid 95AF7E4D-C45D-47FF-AEB2-D9BC13466B3F,AppleAhciController 95BF86AD-A1E0-4143-B487-004B1C2E05FA,DxeCmosInit 95C3AB19-59C2-4418-A35F-CAB8724F8028,USRATraceLibNull 95C894B4-DAEC-46E1-8600-3C4C7FC985D6,BiosGuardRecovery 95C8D770-E1A4-4422-B263-E32F14FD8186,Ax88772b 95DFCAE5-BB28-4D6B-B1E2-3AF3A6BF434F,PTID 95E3669D-34BE-4775-A651-7EA41B69D89E,Dhcp6Dxe 95E8152B-1B98-4F11-8A77-DB26583EBC42,AmiPeiSbInitPolicyGuid 95ECB758-627E-4A2E-B7B8-DC863EFE3425,AmiDeviceGuardApi 96107C8E-9490-4767-9D0D-5590F1F6E1FC,PhysicalPresenceDxe 961578FE-B6B7-44C3-AF35-6BC705CD2B1F,FatDxe 961578FE-B6B7-44C3-AF35-6BC705CD3B3F,MacMiscDxe 9618C0DC-50A4-496C-994F-7241F282ED01,PlatformEarlyInitPei 961C19BE-D1AC-4BA7-87AF-4AE0F09DF2A6,TrEEPei 9622E42C-8E38-4A08-9E8F-54F784652F6B,AcpiTableDxe 964E5B21-6459-11D2-8E39-00A0C969723B,EfiBlockIoProtocolGuid 964E5B22-6459-11D2-8E39-00A0C969723B,EfiSimpleFileSystemProtocolGuid 966DFABF-A140-4BBA-83CA-12021090BB44,DxeIchSmbusLightDxe 968C1D9F-80C4-43B7-8CAE-668AA56C4E71,SmbiosPeim 96B5C032-DF4C-4B6E-8232-438DCF448D0E,NullMemoryTestDxe 96BDEA61-C364-4513-B6B3-037E9AD54CE4,SetSsidSvidDxe 96D4FDCD-1502-424D-9D4C-9B12D2DCAE5C,MicrocodeFmpImageTypeIdGuid 96DED71A-B9E7-4EAD-962C-01693CED2A64,I2CPeiInitGuid 96E198EC-CDBC-4C21-9743-EB4577648E59,IccDxe 96EB4AD6-A32A-11D4-BCFD-0080C73C8881,EfiWinNtIoProtocolGuid 96F1AC24-2B21-45FA-A0B5-67010C95E9D8,AhciMmioSmm 97159409-CE5F-4C1C-BDAE-7BD6981C2C11,SmcSetPowerStatus 97159409-CE5F-4C1C-BDAE-7BD6981C2C4F,SmcOpromCtl 9727502C-034E-472B-8E1B-67BB28C6CFDB,DebugAgentDxe 9737D7CA-D869-45E5-A5EF-75D9438688DE,PlatformGOPPolicy 9759BD61-F11E-4FEE-9004-1E8C88E72223,gear10 977C97C1-47E1-4B6B-9669-436699CBE45B,SiPkgTokenSpaceGuid 978D7247-98EA-4A14-BF98-32A35F34566B,AcpiPowerButton 978FE043-D7AF-422E-8A92-2B48E463BDE6,EfiKmsFormatGeneric512Guid 97AF1D95-203C-42DE-8D6B-D13EB7E5A55A,PEfirmwareupdateEfi 97B53FD2-A84C-4469-803F-A16D13AF1479,HeciSmmRuntimeDxe 97B97368-1831-434C-A9D8-A20440A91C48,Vmxnet2Dxe 97BB442B-F9FE-45E3-8A28-439EEDCD1813,DualBiosPei 97C81E5D-8FA0-486A-AAEA-0EFDF090FE4F,SerialIo 97CC7188-79C9-449F-B969-065B64BF9C69,BiosExtensionLoader 97CDCF04-4C8E-42FE-8015-11CC8A6E9D81,Tpm2DeviceLibRouterPei 97E35ADE-233D-4F18-828A-8A0524EBEDDE,menu_none_selected 97E8965F-C761-4F48-B6E4-9FFA9CB2A2D6,AmiDeploymentModeNvGuid 97F91E78-EA12-4EA6-B7B3-7B0678C28673,AmiPeiPciTableInitPpiGuid 981A25E0-0D83-436D-9184-C1AA53BB143A,SmmOemServicesDriver 981AD9CD-8685-4AAB-AFDA-0512F74B65EA,SB900SmbusLight 982C298B-F4FA-41CB-B838-77AA688FB839,EfiUgaDrawProtocolGuid 982DDBE9-2B79-485F-9AC3-FA67B508C913,Vmxnet3Dxe 9842073D-95D9-9F49-BD3F-2E29525125DF,EmuBusDriver 9851740C-22E0-440D-9090-EF2D71C251C9,AmiCmosAccessDxeProtocolGuid 98584C0B-49D6-4BAF-B542-ECEE2582409C,ASUSBackup 9876CCAD-47B4-4BDB-B65E-16F193C4F3DB,EfiProcessorGenericErrorSectionGuid 987EA6EA-FBFD-4273-B819-A7210ADF6760,StatusCodeReport 98948C4A-70F2-4035-8E9F-5927493CFC07,FaultTolerantWriteSmmDxe 989B6C1C-6FE1-D64E-A292-1313C410F0F2,Ip4Config 98B8D59B-E8BA-48EE-98DD-C295392F1EDB,EfiConfigFileNameGuid 98BBCDA4-18B4-46D3-BD1F-6A3A52D44CF8,SmmAccess2OnSmmAccessThunk 98C281E5-F906-43DD-A92B-B003BF2765DA,PeiNtThunkPpiGuid 98C8588C-640A-4BB4-AEA0-3F81CDE17524,FspDxeIpl 994C5A88-FCE2-43E5-9EA4-2FABCB15301D,SmmStatusCode 9950A4C8-F315-4FCE-ADC8-E1BB61F1CCCB,PeiHeciPei 99549F44-49BB-4820-B9D2-901329412D67,IdeController 995C6ECA-171B-45FD-A3AA-FD4C9C9DEF59,EfiSpiSmmConfigurationProtocolGuid 9962883C-C025-4EBB-B699-4EA4D147C8A8,AmiTxtTcgPeim 996EC11C-5397-4E73-B58F-827E52906DEF,EfiVectorHandoffTableGuid 99796403-CF03-42EC-A817-7183411D79E2,PchSmbusDxe_ 999BD818-7DF7-4A9A-A502-9B75033E6A0F,EsrtDxe 99C20A37-042A-46E2-80F4-E4027FDBC86F,PlatformSmm 99E7FEA1-9A6F-4D68-A754-30793B78A738,RasInit 99E87DCF-6162-40C5-9FA1-32111F5197F7,WebServer 99F03B99-98D8-49DD-A8D3-3219D0FFE41E,Mtftp6Dxe 99F2839C-57C3-411E-ABC3-ADE5267D960D,OzmosisDefaults 99FDC8FD-849B-4EBA-AD13-FB9699C90A4D,CustomizedDisplayLibGuid 9A08BC1A-7561-4A68-8875-C0977C91573C,NetBootUI 9A473A4A-4CEB-B95A-415E-5BA0BC639B2E,EfiRegexSyntaxTypeEcma262Guid 9A4E9246-D553-11D5-87E2-00062945C3B9,EfiStatusCodeDataTypeDebugGuid 9A55DA14-D845-4B3D-92DC-332143CC5C1C,HDAudioDxe 9A6DC1AC-94C0-43B1-8714-4C70FD58A815,BaseS3BootScriptLibNull 9A7A6AB4-9DA6-4AA4-90CB-6D4B79EDA7B9,HashInstanceLibSha1 9A871B00-1C16-4F61-8D2C-93B6654B5AD6,FdtClientDxe 9A8D3433-9FE8-42B6-870B-1E31C84EBE3B,BootScriptExecutorImageGuid 9A9A912B-5F53-4586-8820-704485A29D21,MePlatformReset 9AADE345-E064-4355-A815-874564DCA760,AccessPoint80211 9AB047AF-C26E-4DBF-B468-27AC6536482E,TraceHubStatusCodeHandlerPei 9AB9A129-B8FA-4045-BB05-48DBCE724F82,HWMINIT 9AE51047-E0B9-4A50-9E72-84E359D20189,OpromUpdateDxeLightningRidgeEXECB2 9B0FF2C0-E245-11E1-8EFF-D0DF9A35C106,ChipsetSvcDxe 9B182CEE-AED5-4D95-B2A9-A2CF6CDFEAA8,OemAcpiPlatform 9B3ADA4F-AE56-4C24-8DEA-F03B7558AE50,PcdPeim 9B3F28D5-10A6-46C8-BA72-BD40B847A71A,AmiTcgPlatformPeiAfterMem 9B680FCE-AD6B-4F3A-B60B-F59899003443,DevicePathDriverDxe 9B942747-154E-4D29-A436-BF7100C8B53B,Ip4Config2NvDataGuid 9BA1D976-0624-41A3-8650-28165E8D9AE8,BaseDebugLibNull 9BA21891-7E7D-4E94-B8DF-F4D2D320801C,ROMss 9BB65D37-8CA8-4789-BE45-EE18536EE089,UsbOcUpdateDxeNeonCityEPECB 9BBE29E9-FDA1-41EC-AD52-452213742D2E,EdkiiFormDisplayEngineProtocolGuid 9BEC7109-6D7A-413A-8E4B-019CED0503E1,AmiBoardInfoSectionGuid 9C0AAED4-74C5-4043-B417-A3223814CE76,ArmPlatformTokenSpaceGuid 9C1080EE-D02E-487F-9432-F3BF086EC180,GenericMemoryTestDxe 9C109E5E-BF38-4A78-9CAC-43DE7E726F9E,AmiMemoryAbsentOverrideGuid 9C25E18B-76BA-43DA-A132-DBB0997CEFEF,WinNtSimpleFileSystemDxe 9C53CE0E-0E9F-4F20-B1A1-150E4349D777,Tpm12PPILockOverrideguid 9C5FA4C6-746B-40A3-91CE-EC045F9D3716,SmbiosRecoveryDmiEdit 9C76C900-1E8C-11E0-8766-0002A5D5C51B,L2X0CacheLibNull 9C7C3AA7-5332-4917-82B9-56A5F3E62A07,FspReservedMemoryResourceHobGfxGuid 9C7CCB02-9154-4864-9E4B-DC0487E37660,DhcpDummyDxe 9C939BA6-1FCC-46F6-B4E1-102DBE186567,EfiAcpiDisDispatchProtocolGuid 9C98C00A-2E9B-4896-95C8-AC64358284E5,AmiDxeHashInterfaceguid 9CA93627-B65B-4324-A202-C0B461764543,EfiPeiSmbus2PpiGuid 9CB0F5CC-B0F3-4ADD-8583-3C8AF6C00DE0,DxeS3BootScriptLibS3SaveStateProtocol 9CB2E73F-7325-40F4-A484-659BB344C3CD,SgxPolicyStatusGuid 9CBA9D12-A029-4366-AB1E-172B81914757,OntarioGenericVBios 9CC55D7D-FBFF-431C-BC14-334EAEA6052B,SmmCoreDispatcherDxe 9CCA03FC-4C9E-4A19-9B06-ED7B479BDE55,EfiSmmPeriodicTimerDispatchProtocolGuid 9CE4D938-9C87-41D0-9E55-34923FAF8B4F,AmiPeiNbInitPolicyGuid 9CF30325-DC5C-4556-A8B0-74215C5F7FC4,HeciPei 9CFD802C-09A1-43D6-8217-AA49C1F90D2C,Mebx 9D0CEA63-745B-417D-BBA4-E5193061C907,DxeFrb 9D1A8B60-6CB0-11DE-8E91-0002A5D5C51B,ThunderboltNhiDxe 9D225237-FA01-464C-A949-BAABC02D31D0,StatusCodeHandlerPei 9D36F7EF-6078-4419-8C46-2BBDB0E0C7B3,AmiBoardSioInitProtocolGuid 9D52E46E-F07E-44E8-9A90-F8576C91C211,BaseFspDebugLibSerialPort 9D60F495-DBF2-4B06-AFCA-F62C1C89647F,PasswordLockWhite 9D7A05E9-F740-44C3-858B-75586A8F9C8E,dbxVar 9D9A39D8-BD42-4A73-A4D5-8EE94BE11380,EfiDhcp4ServiceBindingProtocolGuid 9DA34AE0-EAF9-4BBF-8EC3-FD60226C44BE,EfiResetNotificationProtocolGuid 9DC0DDAA-56BD-447A-95CC-5180433110F9,menu_top_left 9E0C30BC-3F06-4BA6-8288-09179B855DBE,FrameworkBdsFrontPageFormsetGuid 9E23D768-D2F3-4366-9FC3-3A7ABA864374,EfiVlanConfigProtocolGuid 9E498932-4ABC-45AF-A34D-0247787BE7C6,EfiDiskInfoAhciInterfaceGuid 9E5628D5-ECD5-41A2-868B-99EB933A326E,AhciRom 9E58292B-7C68-497D-A0CE-6500FD9F1B95,EdkiiWorkingBlockSignatureGuid 9E625A27-4840-47CC-A6B5-1E9311CFC60E,Pkpub 9E6584F1-FB33-4BD0-922D-47E5B7F5DBF1,GMUXDriver 9E66F251-727C-418C-BFD6-C2B4252818EA,EfiHiiImageDecoderProtocolGuid 9E7C00CF-355A-4D4E-BF60-0428CFF95540,BaseSerialPortLib16550 9E85F0D5-5185-482B-8D50-5671307FEA80,AppleDiagnosticVault 9E863906-A40F-4875-977F-5B93FF237FC6,TerminalDxe 9E8AD3F4-383D-4EC3-816E-7A4749371290,FvbSmmDxe 9E8DD95D-868B-41A4-966C-107338C291BB,SmbiosDataUpdateDxeLightningRidgeEXECB2 9E9F374B-8F16-4230-9824-5846EE766A97,EfiSecPlatformInformation2PpiGuid 9EA28D33-0175-4788-BEA8-6950516030A5,SmBusPei 9EBA2D25-BBE3-4AC2-A2C6-C87F44A1278C,PasswordUI 9EDCBD06-3C78-4822-BD6E-A6847F7531C4,FastBootTseHook 9EE4CD62-7FA7-4183-9012-F6C4CF6E2C7D,NVBIOSINFO 9EF82BFE-707F-468F-A944-A61626E47DC9,AcpiGlobalVariable 9EF8C276-B3E6-4AD9-8FE7-C74F71C47248,AAFTblSMI 9EFE0B7E-27E8-46D5-8387-CDDAFD2C3A67,ASRockNetDnsBin 9F3A0016-AE55-4288-829D-D22FD344C347,AmiBoardInfo 9F3A0016-AE55-4288-829D-D55FD3AAC347,AmiBoardInfo2 9F3A00FF-AEFF-42FF-82FF-D22FD344C3FF,IrqBoardInfo 9F455D3B-2B8A-4C06-960B-A71B9714B9CD,StatusCodeDxe 9F49A879-3D71-42B3-A0AD-DDB1F33010A3,EfiSpiAcpiProtocolGuid 9F53EC68-49A7-7F4B-88DE-C41A96FDBAA6,Ip4Dxe 9F7DCADE-11EA-448A-A46F-76E003657DD1,VariableSmmRuntimeDxe 9F8B12CF-E796-408F-9D59-3ACDDC0AFBE3,Datahub2SmbiosThunk 9FA1B225-3346-461B-A069-ED01B673D240,EfiI2cBusProtocolGuid 9FAAD0FF-0E0C-4885-A738-BAB4E4FA1E66,FspmWrapperPeim 9FB1A1F3-3B71-4324-B39A-745CBB015FFF,Ip4Dxe 9FB4B4A7-42C0-4BCD-8540-9BCC6711F83E,UsbMassStorageDxe 9FB9A8A1-2F4A-43A6-889C-D0F7B6C47AD5,EfiDhcp6ServiceBindingProtocolGuid 9FD2360E-6B48-11D5-8E71-00902707B35E,PciHostBridge1 9FE0FCFF-B023-49A1-A2C8-ACCE1AA010BB,FboSmiFlashLink 9FE1D71B-3F91-4103-AE62-3FEECA4D2BAA,SpiFlash 9FE7DE69-0AEA-470A-B50A-139813649189,KekVar A00490BA-3F1A-4B4C-AB90-4FA99726A1E8,EfiBlockIoCryptoProtocolGuid A017BA59-DCAD-473B-BBB3-294E9AF20D34,OemPeiHook A01E498C-96E8-2A4C-95F4-85248F989753,FwBlockService A023D3F6-F297-4307-8552-E6572B30B520,menu_mid_mid A023D4A1-05A1-4797-B84F-03B854FD05F1,EneDXE A030D115-54DD-447B-9064-F206883D7CCC,PeiTpmInitializationDonePpiGuid A0337044-949C-423E-B581-DAE2AD435534,VbtInfoGuid A034147D-690C-4154-8DE6-C044641DE942,FspVariableNvDataHobGuid A03A9429-C570-4EF9-9E00-C7A673976E5F,SmmControlDxe A04A27F4-DF00-4D42-B552-39511302113D,DriverSampleFormSetGuid A0534D92-9776-4E4E-9234-C9DC1849DBB5,PlatformFlashAccessLibNull A053F561-F56B-4140-8901-B4CB5D70929E,BootScriptThunkGuid A05B6FFD-87AF-4E42-95C9-6228B63CF3F3,EfiSmmUsbDispatchProtocolGuid A05ECE52-15A8-424E-BFD3-FCF3D566A09C,AmtPeiPolicyInit A05F5C06-1782-48AA-962A-86A0892022B6,ASM1061Dxe A062CF1F-8473-4AA3-8793-600BC4FFA9A9,EfiLegacySredirProtocolGuid A062CF1F-8473-4AA3-8793-600BC4FFE9A8,CsmDxe A071C476-F78C-41C2-A173-B43D699A2C80,AppleEfiSocShutdown A07D8A73-D4F9-4AA0-BC25-391CCFC47E98,I2cControllerTemplate A08276EC-A0FE-4E06-8670-385336C7D093,x86Thunk A0AAFF71-35DA-41EE-863F-A24F429E59E4,IconSelected A0BAD9F7-AB78-491B-B583-C52B7F84B9E0,SmmControl A0C0B7EF-99FF-417F-8B9F-5AD4701D90D6,Tpm12DeviceLibAtmelI2c A0C98B77-CBA5-4BB8-993B-4AF6CE33ECE4,Tcg2Pei A0E8E04C-9B5A-43BE-8B7D-C98760492B68,SectionExtractionDxe A0E8EE6A-0E92-44D4-861B-0EAA4ACA44A2,EfiKmsFormatAescbc128Guid A0EAF572-69D8-4825-B1B0-9EE3B4C64FA7,ASUSGamingBoard A0EF80E3-F9AB-4CBA-98FD-704620F4048D,SecFlashUpdDxe A1147A20-3144-4F8D-8295-B48311C8E4A4,ArmJunoTokenSpaceGuid A11585B7-8FA2-4F1C-AA6F-DD6309469613,MEFwUpdLcl A14694E4-78DF-4EF1-A118-7654FF6CFA9D,IpmiSdrReader A16BA302-6514-4287-BEE3-6223B7DE2C21,NVRAMID A17F4A89-5F19-444F-B7BE-48195E0575DB,SmbiosGenDxe A17F8AAB-42F9-4D94-82CD-A099E1DD52DF,BootTimeDxe A18596AC-1FC5-478D-BF14-0B415813D71F,Ohci A1902AB9-5394-45F2-857A-12824213EEFB,MSOA A19832B9-AC25-11D3-9A2D-0090273FC14D,EfiSimpleNetworkProtocolGuid A19A6C36-7053-4E2C-8BD0-E8286230E473,PciHostBridgeLibNull A19B1FE7-C1BC-49F8-875F-54A5D542443F,CpuIo2Dxe A19FB0EE-05F4-4CD6-8F28-59B782FF95C6,PciExpress A1AFF049-FDEB-442A-B320-13AB4CB72BBC,EfiMdeModulePkgTokenSpaceGuid A1B0B230-67DC-431E-A94A-A96AF1EBE637,Tpm2DeviceLibTcg2 A1C85085-3053-4C4B-A9F6-724D22A76EF9,AmiLegacyTpmguid A1DD808E-1E95-4399-ABC0-653C82E8530C,JunoAcpiTableFile A1E37052-80D9-4E65-A317-3E9A55C43EC9,EfiIdeControllerInitProtocolGuid A1F436EA-A127-4EF8-957C-8048606FF670,UndiRuntimeDxe A210F973-229D-4F4D-AA37-9895E6C9EABA,DpcDxe A216E8AB-19A4-43FF-86A3-C57938F03B06,FireWireDevice A2271DF1-BCBB-4F1D-98A9-06BC172F071A,EfiExtendedSalFvBlockServicesProtocolGuid A29A63E3-E4E7-495F-8A6A-07738300CBB3,AmiTcgPlatformDXE A2AB9D42-967A-45B3-9507-28CCC7021F51,UnknownBoot A2C74B0C-F38F-42F6-A147-379013ED92ED,OemSMBIOS A2CC7663-4D7C-448A-AAB5-4C034B6FDAB7,rmHwA5Guid A2CF63C6-D44F-4CD0-8AF6-722A0138C021,ArmPlatformLibSecNull A2DE77BB-797D-4BB5-80C4-19AEB8B5CD29,ASUSFAKESMI A2F436EA-A127-4EF8-957C-8048606FF670,SnpDxe A30D9B7C-DED3-48D6-83A6-3FF43444C37A,AppleDxeManufacturingFixture A31280AD-481E-41B6-95E8-127F4C984779,TianoCustomDecompressGuid A31B1AF7-3A9B-424A-8636-9885E9DE06F6,ASUSPei A340C064-723C-4A9C-A4DD-D5B47A26FBB0,EsrtManagementProtocolGuid A34CF082-0F50-4F0D-898A-3D39302BC51E,IntelFsp2WrapperTokenSpaceGuid A3527D16-E6CC-42F5-BADB-BF3DE177742B,UsbCbi0Dxe A3610442-E69F-4DF3-82CA-2360C4031A23,ReportStatusCodeRouterPei A36495C1-C205-414E-B71F-4BE3476D699C,FSVariable A368D636-4C77-4B50-AAE8-F99E2DA40440,PnpRuntimeDxe A38C6898-2B5C-4FF6-9326-2E63212E56C2,PeiSpiPpiGuid A3979E64-ACE8-4DDC-BC07-4D66B8FD0977,EfiIpSec2ProtocolGuid A3AD355A-13D0-4DCF-9C21-3D2C5F1BAD5F,FboGroupForm A3B3E6F8-EFCA-4BC1-88FB-CB87339B2579,EfiKmsFormatGeneric160Guid A3BC19A6-3572-4AF4-BCE4-CD43A8D1F6AF,ASUSITEBS A3CD8EAC-B4E6-4B68-9641-0D3763799890,Int15Backlight A3CF349D-639C-4D08-AC4A-C95341FB4F94,AppleIrRemoteDxe A3D5ABB6-9DA4-43EE-BE3B-BDC47D70F8FA,CPULowSpeed A3EAAB3C-BA3A-4524-9DC7-7E339996F496,ASUSRT A3F436EA-A127-4EF8-957C-8048606FF670,BCDxe A3FF0EF5-0C28-42F5-B544-8C7DE1E80014,PiSmmCpuDxeSmm A40DAE55-2F33-42F5-B064-C8D62CCF3B87,AppleSystemInitialization A42B4684-26EA-40D0-AA38-94C21C3C4E59,ATIPwrXPEI A42F4ACF-5A88-4DE3-A54D-EE7CA94C1246,AppleSpiIoCnl A4524A9C-0B5E-492D-AEC9-308631B189B4,AmiSetTcgReadytobootGuid A45E60D1-C719-44AA-B07A-AA777F85906D,PeiAtaControllerPpiGuid A46423E3-4617-49F1-B9FF-D1BFA9115839,EfiSecurityArchProtocolGuid A469DDBD-16D0-4535-BAE3-77274BD70B4C,FwBlockServiceSmm A46B1A31-AD66-4905-92F6-2B4659DC3063,EfiExtendedSalPciServicesProtocolGuid A46BA67D-B169-4E04-9AAC-1845CBDEE0AA,AcpiMetronomeDxe A46C3330-BE36-4977-9D24-A7CF92EEF0FE,PxeDhcp4Dxe A477AF13-877D-4060-BAA1-25D1BEA08AD3,EfiKmsFormatRsasha2562048Guid A47EE2D8-F60E-42FD-8E58-7BD65EE4C29B,CpuIo2Smm A487A478-51EF-48AA-8794-7BEE2A0562F1,tftpDynamicCommand A4C751FC-23AE-4C3E-92E9-4964CF63F349,EfiUnicodeCollation2ProtocolGuid A4E7949F-F818-49DE-AEC0-08B0DB6E250C,T23SmbiosOverride A4EC8ADB-B7A8-47D1-8E52-EC820D0ACF6F,FvbSmm A4EE0728-E5D7-4AC5-B21E-658ED857E834,ArmMpCoreInfoGuid A4F2909C-5E2A-438A-91BA-272B0923049A,PlatformSetup A510A614-2192-11DF-AF29-2754E86B3594,PciExpressHostBridge A52509C7-5ECD-42D1-85A2-46C37135D12D,GopPolicy A5288050-8828-46C4-8F72-1CD735A56520,Slp20Dxe A55701F5-E3EF-43DE-AC72-249B573FAD2C,EfiIa32X64ErrorTypeCacheCheckGuid A56074DB-65FE-45F7-BD21-2D2BDD8E9652,EfiLegacyDevOrderVariableGuid A5683620-7998-4BB2-A377-1C1E31E1E215,TcgDxe A56897A1-A77F-4600-84DB-22B0A801FA9A,SmmRuntime A56FAD72-A264-4370-85C5-00584654DCE2,InstallVerbTablePei A58C5D1D-C22B-4845-90BC-8C94FCE96457,FastBootOption A59A0056-3341-44B5-9C9C-6D76F7673817,SignOn A59E8FCF-BDA0-43BB-90B1-D3732ECAA877,EfiScsiPassThruProtocolGuid A5AAB9E3-C727-48CD-8BBF-427233854948,EfiI2cHostProtocolGuid A5BC1114-6F64-4EDE-B863-3E83ED7C83B1,EfiPlatformMemoryErrorSectionGuid A5C059A1-94E4-4AA7-87B5-AB155C2BF072,EfiCertX509Guid A5C1EF72-9379-4370-B4C7-0F5126CAC38E,TrEEConfigPei A5C6D68B-E78A-4426-9278-A8F0D9EB4D8F,UsbMassStorageDxe A6077307-B297-4051-9AC0-A0DC8147E601,menu_locked A60C6B59-E459-425D-9C69-0BCC9CB27D81,EfiGetPcdInfoPpiGuid A622E42C-8E38-4A08-9E8F-54F784652F6B,SystemAcpiOA30Dxe A62D933A-9293-4D9F-9A16-CE81994CC4F2,AppleDebugSupport A630B937-3AB3-4263-85B1-A63E98F29949,PcieErrorHandler A671FACE-B99F-48AB-B3B0-F25E5EE4B115,TcgSetupDxe A673005A-69F6-4597-8AF9-7AACA0039296,Int15BootDisplay A6885402-D022-4B0E-A509-4711B90F2A39,ReportStatusCodeRouterSmm A6A72875-2962-4C18-9F46-8DA644CCFE00,EfiIScsiInitiatorNameProtocolGuid A6A79162-E325-4C30-BCC3-59373064EFB3,EfiTcoResetProtocolGuid A6AEF1F6-F25A-4082-AF39-2229BCF5A6E1,AmtStatusCodePei A6F691AC-31C8-4444-854C-E2C1A6950F92,DuetBds A732241F-383D-4D9C-8AE1-8E09837589D7,XenBusRootDeviceGuid A73D663D-A491-4278-9A69-9521BE3379F2,ArmVeTimerDxe A76B4E22-B50A-401D-8B35-5124B0BA4104,TcgPeiPolicyGuid A770C357-B693-4E6D-A6CF-D21C728E550B,EdkiiFormBrowserEx2ProtocolGuid A7717414-C616-4977-9420-844712A735BF,EfiCertTypeRsa2048Sha256Guid A7732DA8-11AA-4366-9715-CD92CFB7D362,SataController A77B2472-E282-4E9F-A245-C2C0E27BBCC1,EfiBlockIo2ProtocolGuid A79EED97-4B98-4974-9690-37B32D6A5B56,RTSMArmVExpressLibSec A7AF67CB-603B-4D42-BA21-70BFB6293F96,EfiRngAlgorithmSp80090Hash256Guid A7C0687A-E8B9-42EC-B8A5-A950DF6EF94A,AlternativeDefaultMemoryQuota A7C619FF-9A64-4A89-947B-E7953E2427CB,ASUSBS A7CED760-C71C-4E1A-ACB1-89604D5216CB,EfiIioUdsProtocolGuid A7EDEBD8-A8D7-48F8-81FB-837656B82077,AmiNvramBackupRomAreaGuid A8021F3B-B649-4C18-8270-A796ACCF32E1,EfiEmmcWpHobGuid A80E8FC8-332C-4359-9622-84E83D90FD5A,BiosCriticalInfo A8154B55-2021-4D40-AE81-2E23A02DCC46,FtdiUsbSerialDxe A8499E65-A6F6-48B0-96DB-45C266030D83,SiInitPreMem A84B495B-79F4-40AB-8B60-653F69DCD944,AmiHeciDeliverProtocolGuid A85027FC-0E09-4FA9-A407-CAD206FB4F1D,PlatformStage1Pei A85DCA1B-198F-4E14-A673-874264687E85,DataSink A883FD70-4E7E-4B17-8EBB-C5646FF154CA,SpiMouseDxe A8913EC1-C00C-4C3A-A245-077C0CA35738,AspmOverrideDxe A89EC8E0-0BA1-40AA-A03E-ABDDA5295CDE,PciExpressDxe A8A2093B-FEFA-43C1-8E62-CE526847265E,AmitcEfiOsVariableGuid A8BC51CC-5A30-41D5-8B1A-EB46ABC527FA,IioRas A8C67255-E029-4B1A-968E-ECA6E9C11C73,AmtSmbios A8CDA0A2-4F37-4A1B-8E10-8EF3CC3BF3A8,EdkiiNonDiscoverableUhciDeviceGuid A8CF6278-8758-458D-ADFB-3471F5AD50B1,HdPwdPeimPei A8E80DDF-A3BB-4880-9DB2-9BB1B8BB1212,SbMetronome A8F634A5-28F1-4456-A9D5-7E24B99BDB65,PcxDecoder A8F960C6-4CC3-4417-8AD9-2A3B3F8027EA,AmiMemoryInfoGuid A912F198-7F0E-4803-B908-B757B806EC83,Hello A92CDB4B-82F1-4E0B-A516-8A655D371524,VirtioNetDxe A95C1D60-CB9F-4BD8-A030-3F1C4A185156,SecureBootMod A9620E5C-5FA1-40B7-8B21-50B632F88F38,EfiLoader A9731431-D968-4277-B752-A3A9A6AE1898,PeiIpmiPpiGuid A9759271-49CD-49BE-8764-5DEBFBE68F73,AmdResetManagerPei A9ACE824-4486-44E6-915A-8FBAED0799B9,SetupDataProviderDxe A9B700CF-019E-4D8B-A3A7-88E1EA01699E,HddSecurity A9CE66D5-6D37-451E-A9BF-F58F7A0B3CC2,ASM1061_DXE A9DC6F60-F861-47D1-8751-ECAAE7D27291,LibMath A9DD1597-F2C5-4CB6-AA7B-EE01AE806185,AmiSmmNvmeControllerProtocolGuid A9F634A5-29F1-4456-A9D5-6E24B88BDB65,BmpDecoderDxe A9F8D54E-1107-4F0A-ADD0-4587E7A4A735,IntelSiliconPkgTokenSpaceGuid AA0E8BC1-DABC-46B0-A844-37B8169B2BEA,EfiPciHotPlugInitProtocolGuid AA382865-12B0-44E5-A731-6DEF4DF34CE7,LenovoPromptService AA48FBB2-9F87-4DFD-B416-575938F0C8F4,PropertiesTableAttributesDxe AA506A03-4A54-492B-8F2B-9AD9A949358A,UfsBootLunIdHobGuid AA5324ED-DC11-4D5D-A52B-FABDD7E80634,PlacementDxe AA652CB9-2D52-4624-9FAE-D4E58B67CA46,PchSpiPeim AA6E8785-726E-441D-ACB8-F75FB0B2B9F2,CoreEG2 AA7B4695-00B4-4468-AD92-99370AC031C5,LegacyRegion2 AA893E19-A641-4819-AD23-011B7C24250D,IT8728SioAcBackSmm AA924214-DFCB-4BEE-AA33-FAE9729AF000,A01ODMSmmServiceDriver AAB18F19-FE14-4666-8604-87FF6D662C9A,EfiSpiSmmNorFlashProtocolGuid AABE9A45-B345-49D2-88EF-6AD0B85ED7E6,AmiRomLayoutProtocolGuid AABF95D6-F40C-405F-8360-6A59794B8040,BasePciSegmentLibPci AAC33064-9ED0-4B89-A5AD-3EA767960B22,FaultTolerantWritePei AAC9B0AF-A46A-49D8-8016-9B9DAD2C7F5E,DxeBoardConfigInit AAD10051-5D94-4B9F-B778-E4555EE3CCCA,IioSmm AAD8B9F8-2C83-4E4B-96E8-C5B8B8AC56BF,JedecNvDimmSMM AADFA1AC-E923-4673-B1B8-714AD849F790,SystemFormBrowserSimpleTextViewLayoutDxe AAE65279-0761-41D1-BA13-4A3C1383603F,Ozmosis AAEACCFD-F27B-4C17-B610-75CA1F2DFB52,EfiEbcVmTestProtocolGuid AAECDC89-2A49-46F1-A163-F7979C039998,IdeBusSrc AAF32C78-947B-439A-A180-2E144EC37792,EfiAuthenticatedVariableGuid AB1404CA-4801-4208-98BF-30D521DAD4D3,AmiTseUserPasswordValidGuid AB1C1816-D542-4E6F-9B1E-8ECD9253E2E7,ArmGlobalVariablePpiGuid AB248E8D-ABE1-11D4-BD0D-0080C73C8881,WinNtUgaDxe AB248E99-ABE1-11D4-BD0D-0080C73C8881,EfiWinNtUgaGuid AB294A92-EAF5-4CF3-AB2B-2D4BED4DB63D,PeiMfgMemoryTestPpiGuid AB2BEE2F-C1A6-4399-853D-C07C774FFD0D,EfiLpcWpce791PolicyProtocolGuid AB38A0DF-6873-44A9-87E6-D4EB56148449,EfiRamDiskProtocolGuid AB3E46F0-844B-456E-8911-5D4546172410,EventCtrl AB5A4DF4-F0D7-49A8-BF5C-F25DA04C2533,CpuGlobalNvsAreaProtocolGuid AB7ED12E-1D78-4635-AB87-23F00A911EC7,RomLayoutDxe AB8F1705-7EB6-4D08-A9B3-918BDE24F479,UpdatePcdPei ABAA46B8-84A3-4E74-882F-6368F6EDC9B8,HddPwdDxe ABB50A68-0CA7-4C9F-8DB4-56C34E01CB95,SystemFirmwareDeviceBlockDxe ABB74F50-FD2D-4072-A321-CAFC72977EFA,SmmRelocatePei ABBCE13D-E25A-4D9F-A1F9-2F7710786892,Platform ABC36AAC-2031-4422-896E-0A3B899AD0B4,Microcode ABD42895-78CF-4872-8444-1B5C180BFBDA,EfiPeiSmbusPpiGuid ABD42895-78CF-4872-8444-1B5C180BFBFF,EfiPeiBootScriptExecuterPpiGuid AC05BF33-995A-4ED4-AAB8-EF7AE80F5CB0,UefiCpuPkgTokenSpaceGuid AC255206-DCF9-4837-8353-72BBBC0AC849,OzmosisTheme AC3435BB-B1D3-4EF8-957C-8048606FF671,FrameworkHiiOnUefiHiiThunk AC3DA503-65E7-4153-96FC-8707FB7594FB,ASUSBIOSInfo AC4CE557-F5CD-439E-963C-40F09683DAC5,AppleKeyMapAggregator AC5E14DD-4567-41F7-9E29-5F52CD314214,X11DPHSmmDriver AC60ED9F-523E-4F5B-94CA-3961346A00BA,LenovoVariableInitDxe AC6993CF-43C8-4FCB-840C-B7CF2E079977,PciHotPlug2 AC874606-8727-41A0-BCCD-43A4237466DD,EneUpdDXE AC95AD3D-4366-44BF-9A62-E4B29D7A2206,SmmAccess2Dxe ACA24109-6C7A-4CEC-9133-5FB9D8274910,IntelLtsxFit ACAEAA7A-C039-4424-88DA-F42212EA0E55,PchPcieSmm ACB93B08-5CDC-4A8F-93D4-06E342DF182E,PchPeiInitPpiGuid ACD03321-777E-4D3D-B1C8-20CFD88820C9,EfiRngAlgorithmX931AesGuid ACD28235-075B-48B5-98A1-DA04FCAF84F3,SiInitDxe AD0D149F-BA67-4E0B-A6A2-4E8853673EA5,ErrorGlobeTile AD14AC1B-DA15-4CE5-A7E2-1F5437EDB4B3,SmbiosMemory AD15A0D6-8BEC-4ACF-A073-D01DE77E2D88,EfiVTUTF8Guid AD1F487A-BA56-48DC-8EAA-E8FBEA74B8F2,ASM104X_SMI AD21F7A0-7F5B-47FE-8CC0-241F318CABF5,AppleLegacyStartup AD3D267D-50E1-4B94-95D3-1025EF5B8391,SecFlashUpdDXE AD414DD9-076F-40FA-8B6A-1B6779ADECA3,AcpiDebugTables AD416CE3-A483-45B1-94C2-4B4E4D575562,TcgMor AD49E1DA-5E83-4A0F-ACC7-67F08CAEAA78,TrEEPei AD608272-D07F-4964-801E-7BD3B7888652,MonotonicCounterRuntimeDxe AD61999A-507E-47E6-BA28-79CC609FA1A4,FspWrapperNotifyDxe AD61F191-AE5F-4C0E-B9FA-E869D288C64F,EfiCpuIo2ProtocolGuid AD651C7D-3C22-4DBF-92E8-38A7CDAE87B2,VirtualUncachedPagesProtocolGuid AD70855E-0CC5-4ABF-8979-BE762A949EA3,IncompatiblePciDeviceSupport AD77AE29-4C20-4FDD-8504-8176619B676A,AmiHddSecurityEndProtocolGuid AD9C4381-1EDE-430C-8D42-23767C465D52,EfiUsbKeyboardConnectGuid ADD70A4D-1067-4FA3-A669-94C82877F106,TpmNvmeSupport ADF01BF6-47D6-495D-B95B-687777807214,FirmwarePerformancePei ADF3A128-416D-4060-8DDF-30A1D7AAB699,EfiSmmIchnDispatch2ProtocolGuid AE2020DF-C175-4344-B755-BBA47744F8B1,PeiVideoTextOut AE265864-CF5D-41A8-913D-71C155E76442,CpuIoPei AE3356F4-F95B-404B-B1DE-64EB5D5E5BBE,MemRas AE3D28CC-E05B-4FA1-A011-7EB55A3F1401,EfiDns4ProtocolGuid AE4C11C8-1D6C-F24E-A183-E1CA36D1A8A9,HfsPlus AE587172-CA15-48E1-8BE1-29DDF05C6A1E,OemSpecVtdRmrr AE587172-CC15-48E1-8BE0-29DDF05C6A1F,DxeSelStatusCode AE587172-CC15-48E1-8BE1-29DDF05C6A1E,OemVtdRmrr AE717C2F-1A42-4F2B-8861-78B79CA07E07,FV_MAIN_NESTED AE724F8D-62C6-4638-A065-0138F47B6D23,UefiPxeBcDxe_ AE80D021-618E-11D4-BCD7-0080C73C8881,EfiDataHubProtocolGuid AE933E1C-CC47-4E38-8F0E-E2F61D2605DF,EfiPeiSmmCommunicationPpiGuid AEA6B965-DCF5-4311-B4B8-0F12464494D2,BootScriptDataGuid AEB9C5C1-94F1-4D02-BFD9-4602DB2D3C54,EfiTcg2PhysicalPresenceGuid AEBFFA01-7EDC-49FF-8D88-CB848C5E8670,SiPolicyPpiGuid AEC4159D-F2FC-4090-95CE-38317A8ED64C,FirmwarePerformanceTable AED6AA78-D5BF-4BC5-8CC5-F9EE47CF9299,CapsuleRuntimeDxe AEDA2428-9A22-4637-9B21-545E28FBB829,EfiEblAddCommandProtocolGuid AEE17FF6-B810-4A8A-9D4D-8B9C3289C1AC,SmcSwSMI AEF82756-87F2-4CF6-BE80-E59055295AA1,PEbiosinterface AEFAF26C-FB6D-4FEF-AF7A-9D78FF201FCA,FirmwareUpdate AF060190-5E3A-4025-AFBD-E1F905BFAA4C,EfiHiiImageDecoderNamePngGuid AF23B340-97B4-4685-8D4F-A3F28169B21D,EdkiiVarCheckProtocolGuid AF382531-52E6-4CC4-B247-DB8E320CBBA3,SmbiosDMIEditBoard AF43E178-C2E9-4712-A7CD-08BFDAC7482C,UfsPciHcDxe AF4A1998-4949-4545-9C4C-C1E7C042E056,ScPcieDeviceTablePpiGuid AF4CC162-D41C-455A-AB45-6DBCC1CD32F3,LpssDummyProtocolGuid AF59F2F5-5E28-4E03-80E2-4727545AF811,PchReset AF6AC311-84C3-11D2-8E3C-00A0C969723B,EfiDeviceIoProtocolGuid AF9FFD67-EC10-488A-9DFC-6CBF5EE22C2E,EfiAcpiVariableGuid AFA4CF3F-AF71-4C30-A4FB-2910E771F9B0,AmiNvmeControllerProtocolGuid AFBFDE41-2E6E-4262-BA65-62B9236E5495,EfiTimestampProtocolGuid AFC04099-0D39-405D-BE46-846F08C51A31,AcpiPlatform AFFC90DD-B014-4737-89E9-D1A0F50CD25E,CPLDPEI AFFE115B-8589-456D-BAB5-8F2EDA53AEB7,ArmPlatformUpdateFdtEventGuid B017C09D-EDC1-4940-B13E-57E95660C90F,AhciRom B03ABACF-A532-5E78-ACA0-B11F765B3AFD,CpuDxe B03D4E0D-5156-44AB-BEDB-9675A3D57D41,PhPlatformSiSmmCodeCheckDxe B053ED84-880C-4F7E-A57E-2C82C6E9BCBF,OemWlanBT B0732526-38C8-4B40-8877-61C7B06AAC45,EfiCpuIoProtocolGuid B0767CBC-4705-4D35-8866-17A9B85E3843,EfiMemoryConfigVariableGuid B0792197-ABC3-4BB1-9FD3-CBEA8FD41373,BaseAmiBeepLibNull B091E7D2-05A0-4198-94F0-74B7B8C55459,EfiFlashMapHobGuid B093BDD6-2DE2-4871-8768-EE1DA57249B4,TcgPasswordAuthenticationGuid B09CB87C-67D8-412B-BB9D-9F4B214D720A,VTd B09ED1E3-DDDF-429F-9780-C3B0C4857924,ScsConfigGuid B0AE3E81-C6B0-4D35-AD51-9117E0651EA3,PlatformEmmcHs400TuningInfoGuid B0C2372B-9393-4CBC-9CAF-53913C9DCE29,FlashDeviceFvbRuntimeDxe B0D6ED53-B844-43F5-BD2F-61095264E77E,PchSmiDispatcher B0D8F3C1-B7DE-4C11-BC89-2FB562C8C411,EdkiiSmmVarCheckProtocolGuid B0E11362-00DA-4611-8D7D-10EF2527F653,VideoBiosDataBlock B0EAE4F8-9A04-4C6D-A748-793DAA0F65DF,TlsAuthConfigGuid B0EE53D4-A049-4A79-B2FF-19D9FAEFAA94,EcpPeiPciCfgPpiGuid B0F901E4-C424-45DE-9081-95E20BDE6FB5,TcgConfigFormSetGuid B1095967-FCF4-4C53-BC16-7E3DF9C247EB,StdFlashPeiLibNull B10ADFA1-9E43-487F-AAF3-A7A9BDEAF4AC,ProgressBarFullRightEndcap B11216C5-44E4-472C-ACB7-128A5A3AD7A1,OpromUpdateDxeNeonCityFPGA B11E930D-A082-42E2-A7F2-C63767A4D3E7,SI_BoardDxe B122A262-3551-4F48-8892-55F6C0614290,EfiFirmwareClassGuid B122A263-3661-4F68-9929-78F8B0D62180,EfiSystemResourceTableGuid B13EDD38-684C-41ED-A305-D7B7E32497DF,SMBios B144E169-AFB1-4426-B0EC-099728909342,MuxGraphicsSwitch B15239D6-6A01-4808-A0F7-B7F20F073555,Ax88772 B1625D3C-9D2D-4E0D-B864-8A763EE4EC50,TcpDxe B1659B1F-F74E-4866-9D66-2930900391A5,FwBlockService B180019E-9820-4DC0-8B40-A773E23D4F35,RamDisk B199DEA9-FD5C-4A84-8082-2F4170780305,EarlyPL011BaseAddressGuid B1B621D5-F19C-41A5-830B-D9152C69AAE0,FdtTableGuid B1BE0BC5-6C28-442D-AA37-151B4257BD78,EdkiiNonDiscoverableXhciDeviceGuid B1CAA183-FA67-44F5-8D77-B528C309207E,DxeDbgModuleLocator B1CD7448-319C-41AA-821D-3E606BF6F90D,SmcOemActivation B1DA0ADF-4F77-4070-A88E-BFFE1C60529A,AMITSE B1E9E2CA-B078-4070-BCCD-87449AC7D2A6,CpuS3Pei B1EE129E-DA36-4181-91F8-04A4923766A7,EfiDriverFamilyOverrideProtocolGuid B1FBF84A-C091-4A80-A744-23442A2B7BDF,AmiChipsetPkgTokenSpaceGuid B20005B0-BB2D-496F-869C-230B4479E7D1,EdkiiNonDiscoverableOhciDeviceGuid B219E140-DFFC-11E3-B956-0022681E6906,DnsDxe B2360B42-7173-420A-8696-46CA6BAB1060,MeasuredFvHobGuid B2585B69-FB63-4220-844A-8FBEA8BF01AF,PeiIoLibCpuIo B26B30A8-2172-4A46-9B4F-4D5B08DD6E40,T23OwnerStringService B273CC44-E62A-41DC-9CAD-BDB4235459D8,UnicodeCollationDxe B295BD1C-63E3-48E3-B265-F7DFA2070123,AmiMultiLanSupportProtocolGuid B2A191A9-9BAC-4C83-A2F3-D5F6E71EFD03,ArmPlatformSysConfigLibNull B2CD74DE-11F9-418C-BF2E-DAC3035AAB7A,IsPlatformSupportWhea B2DEDC91-D59F-48D2-898A-12490C74A4E0,EfiIfrBootMaintenanceGuid B2FA4764-3B6E-43D3-91DF-87D15A3E5668,AmiAhciBusProtocolGuid B2FA5764-3B6E-43D3-91DF-87D15A3E5668,AmiAhciSmmProtocolGuid B30DFEED-947F-4396-B15A-DFBDB916DC24,EdkiiPeiSdMmcHostControllerPpiGuid B323179B-97FB-477E-B0FE-D88591FA11AB,PeCoffLoaderProtocolGuid B326872A-4DC2-4DB3-88B2-F6C4475F8C91,CpuConfigGuid B336F62D-4135-4A55-AE4E-4971BBF0885D,RealTimeClock B347F047-AF8C-490E-AC07-0AA9B7E53858,EfiWinNtSystemConfigGuid B34ADD50-05D4-4C99-BC55-F3F2F7F52E1A,LegacyToEfi B34E5765-2E04-4DAF-867F-7F40BE6FC33D,ExtFs B35AD166-FCBA-4D4D-89C7-4B47104E3AFD,AppleSpiIoSkl B3738534-9051-40D1-9333-91284A5990CE,AmiPciHotPlugLibNull B3762FA2-54D6-4EBC-84DE-4CFA9340FCB3,AcpiAMLDxe B38573B6-6200-4AC5-B51D-82E65938D783,RecoveryOnFatIdeDiskGuid B3903068-7482-4424-BA4B-405F8FD7654E,SiPolicyHobGuid B3930571-BEBA-4FC5-9203-9427242E6A43,EfiBluetoothHcProtocolGuid B3B0654A-969D-4096-86CB-27E262A02083,PeiCoreEntryPoint B3B88F4B-7042-488E-A255-66F965E8D435,PasswordPopupDxe B3BFAB9B-9F9C-4E8B-AD37-7F8C51FC6280,EfiPeiI2cMasterPpiGuid B3C14FF3-BAE8-456C-8631-27FE0CEB340C,ScEspiSmiDispatchProtocolGuid B3D3502E-CB82-4017-AB34-2F17D2D7035F,PepBccdSmm B3E123D0-7A1E-4DB4-AF66-BED41E9C6638,ScDeviceTableHobGuid B3F56470-6141-4621-8F19-704E577AA9E8,DriverSampleInventoryGuid B3F79D9A-436C-DC11-B052-CD85DF524CE6,EfiRegularExpressionProtocolGuid B40612B2-A063-11D4-9A3A-0090273FC14D,UsbCbi1Dxe B40612B9-A063-11D4-9A3A-0090273FC14D,UsbBotDxe B41956E1-7CA2-42DB-9562-168389F0F066,BootGuardPei B422FB70-E835-448D-A921-EBA460E105B6,SmmIpmiLibSmmIpmiProtocol B4339807-7CAC-49BA-9FB7-6231C622F270,BeginStickyBootButton B4598C09-DA08-5F75-A956-2CFF901B1C24,MonacoFont B47417C7-E21F-4AC9-B0A2-7A158223A137,SetupConfigUpdateDxeNeonCityEPECB B494DF39-A5F8-48A1-B2D0-EF523AD91C55,PeiPolicyInit B4C26857-8FE5-42BE-968B-39F45E921D45,AppleDxePState B4DE05C0-1BD0-11E1-8F0E-77F34724019B,TbtOemBoard B4E0CDFC-30CD-4B29-A445-B0AA95A532E4,SmmAccessPei B4E58F43-730A-46D7-B15F-1E06203EFC28,BxtRefCodePkgTokenSpaceGuid B50AB2CA-48D0-11E4-A6D3-B8E8562CBAFA,SerialMojoDxe B535ABF6-967D-43F2-B494-A1EB8E21A28E,AppleRomInformation B540A530-6978-4DA7-91CB-7207D764D262,FastBootVariableGuid B55A4515-5895-4EA8-845B-75B7480F6502,SmmControl2OnSmmControlThunk B579B530-C797-4839-883E-EFCABD7756E9,VerbTable B57A1DF6-FFDB-4247-A3DF-3A562176751A,UefiDebugLibStdErr B57EC3FE-F833-4BA6-8578-2A7D6A87444B,EfiSpiNorFlashProtocolGuid B58A69FE-163E-4CC0-A487-304D34D5489F,EfiTcgMADriverHobGuid B5A05743-9B71-489B-A0ED-A0EB3950D23B,SecPeiDxeTimerLibCpu B5AF1D7A-B8CF-4EB3-8925-A820E16B687D,BootScriptDataBootTimeGuid B5B35764-460C-4A06-99FC-77A17C1B5CEB,EfiPciOverrideProtocolGuid B5E7C7AF-A3E7-4D3C-B217-04596E4C368F,AmiRedFishSecBootApiGuid B5F33FB5-66D5-4901-BAF1-F0C774FC6588,VgaDriverPolicy B601F8C4-43B7-4784-95B1-F4226CB40CEE,RuntimeDxe B60A3E6B-18C4-46E5-A29A-C9A10665A28E,EfiI2cIoProtocolGuid B60DC6E8-3B6F-11D5-AF09-00A0C944A05B,EfiSalMcaInitPmiProtocolGuid B619A1FF-3B3F-4941-B0F4-2B053BBD1720,FpgaFvDataLibPei B625B186-E063-44F7-8905-6A74DC6F52B4,EfiDns4ServiceBindingProtocolGuid B62EFBBB-3923-4CB9-A6E8-DB818E828A80,MebxSetupBrowser B63F8EC7-A9C9-4472-A4C0-4D8BF365CC51,EfiSdHostIoProtocolGuid B65971BE-BABF-49ED-9DD2-48EC8DB4ABD3,LenovoSoundService B65BF670-FC37-4225-AB85-EC960A7A1ED9,UsraRegisterFilterLibNull B6A2AFF3-767C-5658-C37A-D1C82EF76543,MeUma B6B5FAB9-75C4-4AAE-8314-7FFFA7156EAA,VARBAK B6B9295F-CABF-4CEC-BB14-FE4246F2173A,iFfsDxe B6C0DCB6-434E-4BEC-BDAC-8EE7ED8A4EC8,ArithChk B6C1C466-E78A-4202-801A-B7950E956E0B,ProjectDXE B6C9FA82-9B26-4BE9-8C40-87A370E48365,AmiPlatformWrapperPei B6E9A733-EB75-41B6-B30C-009BCF3801C8,BasePostCodeLibPort80 B6EC423C-21D2-490D-85C6-DD5864EAA674,PeiBaseMemoryTestPpiGuid B6F44CC0-9E45-11DF-BE21-0002A5D5C51B,MmcDxe B703C820-4D3D-4658-8EED-5B2F9DE54711,efi_pop_LF_pressed B709EFA0-47A6-4B41-B931-12ECE7A8EE56,EfiSmmPowerButtonDispatchProtocolGuid B7139637-C114-447C-B73E-CDBCD307BEBB,WinCSMDxe B716A6F8-F3A1-4B8E-8582-5A303F1CDD64,PchSpiWrap B723EFF4-EE4A-40BD-BD7B-22272E36B3E7,ObbyFirmwareFileSystemFvGuid B733C141-E88F-4786-94AF-8B87BC4867FE,PttSsdtAcpiTableGuid B7358BEB-6A52-4D50-98F9-7EDD70B4B320,CommonPciPlatformDxe B73FE497-B92E-416E-8326-45AD0D270092,IbbrFirmwareFileSystemFvGuid B74E676E-3B2E-483F-9458-C378FE0AC69F,Tcm32FileGuid B7611005-1F26-45BA-A3DB-01F39DDB2785,BootMode B7A5041A-78BA-49E3-B73B-54C757811FB6,IdeBusPei B7A5041B-78BA-48E3-B63B-44C7578113B6,FloppyPeimPei B7BC0E96-57D2-4310-AEEF-74AC77DF0DAF,SetupXpBoot B7D19491-E55A-470D-8508-85A5DFA41974,SBDXE B7D9F0D7-EBDB-4EE4-AB77-B30C4B9093CC,TbtSmm B7DDFF7A-1726-11E6-B12F-B8E8562CBAFA,WiFiPlatformDxe B7DFB4E1-052F-449F-87BE-9818FC91B733,EfiRuntimeArchProtocolGuid B7E329EC-AD60-4D61-86E3-01A7904E223D,gear7 B7EE4835-84CE-4B15-BF52-2D11574CE470,HardwareSignatureEntry B7F50E91-A759-412C-ADE4-DCD03E7F7C28,XhciDxe B81BFAB0-0EB3-4CF9-8465-7FA986361664,EfiUfsDeviceConfigProtocolGuid B835353D-4049-410B-8F18-4C749C4C7A78,DxeSleepEvent B8502C59-B268-4BE8-ADD6-601AFEAA4BC9,SpiKeyboard B850A139-BABB-4D91-9F27-72D2EF01BF3A,VbtMipiJdiGuid B859281C-16FA-45A8-9201-1C3830A973BD,GecUpdateSMI B85C7FEA-AEBF-492B-96C6-42EA133BCF29,AmiTseHddSecurity B894C949-A1F8-41C1-A7C0-DF523AD91C15,MrcOemHooksPeim B8969637-81DE-43AF-BC9A-24D98913F2F6,HandleParsingHiiGuid B8A6E7C5-B8FD-425C-A67E-1009DF1F10B5,LenovoUserManagerDxe B8AC7FB2-4211-4C2B-B62F-504421666C87,RngTest B8B8B609-0B6C-4B8C-A731-DE03A6C3F3DC,PchBiosWriteProtect B8D62377-7970-4CE1-87F4-9DDE56AE8982,BiosGuardMeudVerifyMeCapsule B8D9777E-D72A-451F-9BDB-BAFB52A68415,ArmCpuDxe B8E62775-BB0A-43F0-A843-5BE8B14F8CCD,BootGraphicsResourceTableDxe B8E63775-BB0A-43F0-A843-5BE8B14F8CCD,SystemAcpiBgrtDxe B8FE3D49-DCF3-4CBB-8070-47B4F5A34559,GopDebugDxe B90510C4-A6DE-4E45-A50C-A46CCAFEEF91,BaseBoardDXE B912F198-7F0E-4803-B908-B757B806EC83,AppleImg4VerificationDxe B91547F5-4D24-4EEF-8507-74DDABEB71AD,AmiSmmNvmePassThruProtocolGuid B91978DF-9FC1-427D-BB05-4C828455CA27,EfiSioControlProtocolGuid B9237513-6C44-4411-A990-21E556E05ADE,EfiKmsFormatGeneric3072Guid B95E9FDA-26DE-48D2-8807-1F9107AC5E3A,UefiPxeBcDxe B981A835-6EE8-4F4C-AE0B-210AA0BFBF01,RngDxe B9846521-FF99-4953-8FA2-85C9ADCCE5AF,PeiGfxDriver B98999A4-E96F-475A-99FC-762126F50F5A,SMBIOSUpdateData B9A3F174-1B36-4AEC-99E2-F2855EB4C3DE,BoardInfoDxe B9B038B0-E2B6-4AAB-9435-4165ECFED032,AmiTsePasswordPromptExitGuid B9B13798-D409-4D58-86E5-B1836CBEF387,DxeOverClock B9B20B00-2FE5-8445-ACC5-8E29EF01A3E6,AppleMemoryTest B9C464F5-E8DF-49FB-8FE5-86DA958D8133,ASRockHDAudioDxe B9D4C360-BCFB-4F9B-9298-53C136982258,EfiFormBrowser2ProtocolGuid B9E0ABFE-5979-4914-977F-6DEE78C278A6,EfiPeiLoadFilePpiGuid B9F10C17-6CA0-40B5-9B44-6253CFC7D24B,GdbDebugAgent BA05B97C-8EBF-48B7-858D-4B0AFBF0D7DA,BiosGuardRecoveryWorker BA102EAD-5308-4F9B-9E22-C1CE4DC44F49,RSAKey BA23B311-343D-11E6-9185-5820B1D65299,EfiHttpBootCallbackProtocolGuid BA246BC7-7E2F-4AE4-817A-FFDE572E39DE,AppleSmc2 BA51887A-BEB9-45DA-8E37-98A6B46E7C58,IeHeciInit BA5B13F3-8B83-4871-8C3D-44CE683EAC1E,AmtLibPei BA658945-DEE1-42B3-9FA4-BB6B22FB03E4,efi_pop_mid BA67550C-3628-4137-A53E-42660E081604,MePlatformPolicy BA73672C-A5D3-11D4-BD00-0080C73C8881,EfiWinNtConsoleGuid BA7BE337-6CFB-4DBB-B26C-21EC2FC16073,SecCore BA7C46D1-9C5E-4FC8-943D-1A491F23FE01,AmiIso9660MediaGuid BA87DD62-AB60-46DE-8FD8-023510D52D11,gear12 BA929954-35B0-4DD3-90CD-9634BD7E1CF1,ResetDxe BAAEAD09-02A0-4131-9E0D-BC529EF0FF2A,EfiTcgMpDriverHobGuid BAB4F20F-0981-4B5F-A047-6EF83BEEAB3C,EhciPei BAE7599F-3C6B-43B7-BDF0-9CE07AA91AA6,CpuIoDxe BAF1E6DE-209E-4ADB-8D96-FD8B71F3F683,EfiEventUserProfileChangedGuid BB11ECFE-820F-4968-BBA6-F76AFE302596,ArmTokenSpaceGuid BB1A3984-D171-4003-9094-46AF866B45A2,IconPasswordLock BB1FBD4F-2E30-4793-9BED-74F672BC8FFE,PchResetRuntime BB25CF6F-F1D4-11D2-9A0C-0090273FC1FD,EfiSerialIoProtocolGuid BB2F0636-B0DD-489B-ADB6-606FE3A47258,CpuHotAdd BB3BF734-D640-4CF5-AFEA-CA8CFA6020D1,ASUS_USBFLASHBACK BB5B5907-5F8E-42AD-915D-5D98B52ED697,PlatformStage2 BB62E663-625D-40B2-A088-BBE83623A245,EfiEapManagementProtocolGuid BB65942B-521F-4EC3-BAF9-A92540CF60D2,SataController BB6CBEFF-E072-40D2-A6EB-BAB75BDE87E7,TcgPlatformSetupPolicyGuid BB83F95F-EDBC-4884-A520-CD42AF388FAE,BaseDebugLibSerialPort BB8C2CF3-A5E3-49EF-941B-4A01FAC6FD5F,SmiFlashDxe BB929DA9-68F7-4035-B22C-A3BB3F23DA55,SataControllerDriverGuid BB983CCF-151D-40E1-A07B-4A17BE168292,EfiMemoryOverwriteRequestControlLockGuid BB9C7AB7-B8D9-4BF3-9C29-9BF341E217BC,EfiPlatformCpuInfoGuid BBB31581-855A-44D7-A550-8A585D9B2DE9,BaseCryptLibRuntimeCryptProtocol BBB810BB-5EF0-4E8F-B298-AD74AA50EF0A,EfiTcgWakeEventDataHobGuid BBCB6F85-303C-4EB9-8182-AF98D4B3020C,Tpm2DeviceLibTrEE BBCFF46C-C8D3-4113-8985-B9D4F3B3F64E,FspBootLoaderTemporaryMemoryGuid BC05DC37-9DA0-4050-9728-F34DDB01E200,BiosRegionLock BC0B9FB8-97CF-4B17-9A9E-F574E62CBCC4,BmcLanConfig BC1A046C-7DBD-41F2-94E5-D7595554CAF4,SystemFirmwareReportDxe BC2B7672-A48B-4D58-B39E-AEE3707B5A23,Tpm12DeviceLibDTpm BC3245BD-B982-4F55-9F79-056AD7E987C5,AhciSmm BC327DBD-B982-4F55-9F79-056AD7E987C5,SMIFlash BC468182-0C0B-D645-A8AC-FB5D81076AE8,UserInterfaceThemeDriver BC52476E-F67E-4301-B262-369C4878AAC2,PlatformSeCHookProtocolGuid BC559DEA-2681-9345-9BE9-07850AF39E6E,ShaHash BC59E2E1-7492-4031-806E-C48DCCC3A026,FspInitPeim BC5FA650-EDBB-4D0D-B3A3-D98907F847DF,PeiBlockIoPpiGuid BC62157E-3E33-4FEC-9920-2D3B36D750DF,EfiLoadedImageDevicePathProtocolGuid BCAF98C9-22B0-3B4F-9CBD-C8A6B4DBCEE9,EmuSec BCC87E0D-86D6-4D4D-8040-2D983D368BD1,EmuGopDxe BCCAD460-4F7D-4E51-8A5D-3BBA236D9EBB,AppleBootBeep BCCDE9D2-BABD-44F5-BB3F-D7B16174F64B,AsfDxe BCD9DF8C-BE89-4007-986F-FA401A4AF94E,Int15PanelColor BCDAF080-1BDE-4E22-AE6A-43541E128EC4,EfiIsaHcProtocolGuid BCEA6548-E204-4486-8F2A-36E13C7838CE,FpgaSocketSetup BD1C1A1C-04EC-47ED-8AB7-D19319C64138,FastBoot BD22D0BF-4818-4EF8-BDCD-B3478F52A802,HeavyPciBusDebug BD26CDC9-A092-462A-877A-5AB6ADCE4812,EfiPlatformCpuProtocolGuid BD445D79-B7AD-4F04-9AD8-29BD2040EB3C,EfiLockBoxProtocolGuid BD44F629-EAE7-4198-87F1-39FAB0FD717E,FspEventEndOfFirmwareGuid BD6736AC-B126-4FEA-9D1D-174D4A899F22,SystemErrorMenuDxe BD712601-082F-4C59-8677-2C8A3C297948,LoadFileOnFv2 BD7E9A27-D6C5-416A-B245-5F507D95B2BD,WinNtBusDriverDxe BD87394D-465C-40A9-9657-FBED21789860,BinConvert BD87C547-93FF-4F4A-A890-02B1AF986F34,OverclockInterface BD88EC68-EBE4-4F7B-935A-4F666642E75F,EfiAcpiEnDispatchProtocolGuid BD8C1056-9F36-44EC-92A8-A6337F817986,EfiEdidActiveProtocolGuid BD9320EB-7BB9-4AED-A682-CF4F96BE244C,IntelMchFieldAcpiTables BDA39D3A-451B-4350-8266-81AB10FA0523,PeiDxeDebugLibReportStatusCode BDAD7D1A-4C48-4C75-B5BC-D002D17F6397,AhciRecovery BDB38125-4D63-49F4-8212-61CF5A190AF8,EfiUserInfoAccessSetupRestrictedGuid BDC8E6AF-D9BC-4379-A72A-E0C4E75DAE1C,EfiHttpServiceBindingProtocolGuid BDCE85BB-FBAA-4F4E-9264-501A2C249581,S3SaveStateDxe BDFDE060-7E41-4EAE-AD9B-E5BBA7A48A3A,EfiDevicePathPropertyDatabase BDFE430E-8F2A-4DB0-9991-6F856594777E,EhciDxe BDFE5FAA-2A35-44BB-B17A-8084D4E2B9E9,FvbServicesRuntimeDxe BE0FEABA-3443-4919-9F3A-2D4216329EA9,WinNtAutoScan BE189D38-C963-41CF-B695-D90E9E545A13,UfsBlockIoPei BE216BA8-38C4-4535-A6CA-5DCA5B43ADDF,SmiVariable BE2DB903-B7C2-4ABC-8F64-B06E705D27E7,PostWave BE731247-5FA2-4D5B-9DB6-5385CCCD59E1,UsbOcUpdateDxeLightningRidgeEXECB3 BEA39084-044A-4C88-8763-2BFAFFA8950C,LTEB BF0A78BA-EC29-49CF-A1C9-7AE54EAB6A51,EfiMtftp6ProtocolGuid BF4B9D10-13EC-43DD-8880-E90B718F27DE,EmbeddedDeviceGuid BF89F10D-B205-474F-96E3-7A7BB1B4A407,VgaClassDxe BFB01142-3061-48A4-922F-9D246E201120,AmiTcgResetVarHobGuid BFD59D42-FE0F-4251-B772-4B098A1AEC85,ActiveBios BFD7DC1D-24F1-40D9-82E7-2E09BB6B4EBE,EfiDriverConfiguration2ProtocolGuid BFE205C9-5B17-4F8F-9375-89614AF8E199,OEMDXE C020489E-6DB2-4EF2-9AA5-CA06FC11D36A,EfiAcpiVariableCompatiblityGuid C02B0573-2B4E-4A31-A31A-94567B50442C,PchUsbPolicyPpiGuid C0512F00-0181-48C0-8B71-90504B8F991E,EfiBootNameLabel C05ED2D1-5DDE-4B6E-A1AE-0B306ACB42BC,TrEEDxe C06C5A03-704C-45D6-808E-4D9E867897D3,AppleEffaceableLocker C0734D12-7927-432B-986B-A7E3A35BA005,LightPciBusPciBusDxe C076EC0C-7028-4399-A072-71EE5C448B9F,EfiCustomModeEnableGuid C07A1EB5-5C04-4100-817B-0A11BB5F15DC,CppcDxe C095791A-3001-47B2-80C9-EAC7319F2FA4,EfiFirmwarePerformanceGuid C0A2EC40-7CA9-4FF7-A17C-08B81D70DE80,ECSmmFramework C0CC43BD-C920-4064-935B-93B447379470,PowerManagementAcpiTableStorageGuid C0EC00FD-C2F8-4E47-90EF-9C8155285BEC,TcgNvramHobGuid C10194E7-DEB2-4AF4-9EEE-BFFDE4D7D4C7,TimestampDxe C118F50D-391D-45F4-B3D3-11BC931AA56D,DsdtAsl C128CADC-623E-4E41-97CB-A7138E627460,BaseFspSecPlatformLibNull C12A7328-F81F-11D2-BA4B-00A0C93EC93B,EfiPartTypeSystemPartGuid C12C4E6A-BC3D-4A91-8299-7E0A4D5B5289,SmcOemID C144476F-F118-4C84-A936-417C8AFBD437,GenericUSBDebugger C153205A-E898-4C24-8689-A4B4BCC5C8A2,PeiCachePpiGuid C184562C-6864-40A3-A081-C8D35E82B920,WinCeGuid C18B8105-AB89-44DE-8D37-50B31FAE5D1E,SgTpvAcpiS3Save C194C6EA-B68C-4981-B64B-9BD271474B20,PchSpiRuntime C19783FD-E21E-451A-830E-C7CB23DB52CC,menu_mid_left C19A6517-3FE4-49D8-94B6-C4D77350AA44,FlashUtilityDxe C1A69A12-8653-4FDE-A215-48FCD95288C3,PlatformSetupDxe C1C41626-504C-4092-ACA9-41F936934328,EfiCertSha256Guid C1C418F9-591D-461C-82A2-B9CD96DFEA86,IntelLegacyInterrupt C1D61CB0-78B0-42F0-BC3F-F54DFEC65DB2,PartialMirrorHandler C1DBFAE7-D47A-4D0D-83B5-9E6F4162D15C,EXFAT C1E63AC4-D0CF-4CE6-835B-EED0E6A8A45B,EfiPaddingRsaesOaepGuid C1E6791D-F35B-43EF-920A-BE06BA7F86A1,AmiTcgPlatformPpiBeforeMem C1E9FFFB-5557-4CB5-A5F5-1FBD902A74ED,LibIIO C1FBD624-27EA-40D1-AA48-94C3DC5C7E0D,SBPEI C1FCD448-6300-4458-B864-28DF015364BC,EfiPeiLoadedImagePpiGuid C21CF0E2-6ABC-4C3B-9DE6-3ABA8C3F83C9,DxeIchSmbus C2239ACD-21D0-4CB0-B7DB-6D35EE7B0CC1,FirmwareRevisionSyncPei C22E6B8A-8159-49A3-B353-E84B79DF19C0,VARIABLE C246FBBF-F75C-43F7-88A6-B5FD0CF1DB7F,AmiDbtFileGuid C2702B74-800C-4131-8746-8FB5B89CE4AC,EfiSmmAccess2ProtocolGuid C280C73E-15CA-11DA-B0CA-001083FFCA4D,EfiAuthenticationChapLocalGuid C2891AB9-9D96-475D-BE55-9EDF18F4D5EF,UsbIrq C2998CC8-A0AA-46E6-A634-EE32BF113188,AmtDriverPeimPei C2A743FE-9951-4299-9817-71DB147570D9,SmmPlatformDxe C2AD1A7F-D9DF-4638-8DAC-015996C88857,ScPolicyHobGuid C2C79FD0-313C-4C4D-B9F1-ED26F00CA955,XhciDxe C2F9AE46-3437-4FEF-9CB1-9A568B282FEE,FspSecCoreM C3069C81-6717-4FB6-B646-04214894BAB4,SmcSwSmiFlashDxe C30B94E3-C8F2-4AB0-91AB-FA8DF621B1C9,MnpDxe C30FFF4A-10C6-4C0F-A454-FD319BAF6CE6,IntelBootGuardBootPolicy C3158ABD-DB62-460F-B64C-FC258BB94A83,BiosLiveUpdateDxe C31A6189-639A-458B-B040-D7D506CA8F4F,GetHostByAddr C3253C90-A24F-4599-A664-1F8813778FC9,ArmGlobalVariableGuid C32A66D5-D8B7-2640-B768-082C8F083C37,ThunkPpiToProtocolPei C358B1F8-8A88-40B6-89BB-28ECD6EDDB24,PxeDriver C35F272C-97C2-465A-A216-696B668A8CFE,UserProfileManagerGuid C3811036-710B-4E39-8CF1-0AF9BE3A8198,TimerDxe C38FB0E2-0C43-49C9-B544-9B17AA4DCBA3,PowerManagementAcpiTables C39B4C90-CB56-49BC-9534-012F69A1C2CC,UuidPeiInit C3D69D87-5200-4AAB-A6DB-2569BA1A92FC,Tpm2DeviceLibRouterDxe C3E36D09-8294-4B97-A857-D5288FE33E28,EfiBiosIdGuid C40DAA42-6E1D-4F6F-96F0-5E17BC8A1D4B,AmiHeciDeliverRuntimeDxe C41E9862-D078-4E7D-9062-00E3FAC34C19,AsusEcPei C41F8C82-B3E6-47E0-A61D-0F9E429E6996,DebugCommunicationLibUsb3Dxe C4491F51-66B9-4590-95E4-E2B4AD777703,HeciSmm C463CEAC-FC57-4F36-88B7-356C750C3BCA,UhciPei C46ACCBC-5765-40E3-87D2-82A568AC991B,PcieRpConfigGuid C48D651C-9D0E-4CE7-AD39-EDD1AB836B30,AmiTseAfterFirstBootOptionGuid C498F432-B8B7-44BF-86D3-7B36F2EC1390,IFWIVersionHobGuid C4A58D6D-3677-49CB-A00A-9470765FB55E,AddPerfRecordProtocolGuid C4B50EB2-ED16-4283-A5B0-A7341C3F997B,ArmTrustedMonitorLibNull C4B8C7FB-D2E2-441C-BAD6-E5D46B1E1AA6,T23HookResetSystem C4D1F932-821F-4744-BF06-6D30F7730F8D,Ps2KeyboardDxe C4EB3614-4986-42B9-8C0D-9FE118278908,CrystalRidge C4F2D007-37FD-422D-B63D-7ED73886E6CA,IdeRControllerDxe C5046EFD-7BC3-4206-987C-32DA45026E6D,PlatformInitDxe C5068BAC-A7DC-42F1-AE80-CAA24BB4904B,PttPassThruPpiGuid C50B323E-9075-4F2A-AC8E-D2596A1085CC,EfiSmmIchnDispatchProtocolGuid C5149B43-AE85-4F53-9982-B94335D3A9E7,EfiRngAlgorithmSp80090Hmac256Guid C516673C-6C71-4F0E-83B5-57FC662376EC,LibPosix C51711E7-B4BF-404A-BFB8-0A048EF1FFE4,EfiIp4ServiceBindingProtocolGuid C5184932-DBA5-46DB-A5BA-CC0BDA9C1435,EfiHashProtocolGuid C522E695-93FF-4AC7-8220-F849C68C538F,APMDXE C53C63B4-39C1-4185-BC9B-0FE9722A0C60,SmrrEnableHobGuid C54B425F-AA79-48B4-981F-998B3C4B641C,TrEEConfigFormSetGuid C54F4B67-E527-4379-BF61-193C7A68C661,menu_none C56EDB22-3D78-4705-A222-BDD6BD154DA0,TpmClearOnRollbackSmm C5753963-3B84-4095-BF78-EDDAD3F9C9DD,EfiPciBusErrorSectionGuid C57AD6B7-0515-40A8-9D21-551652854E37,Shell C5847038-FF75-4074-9E4C-C36A2EB398A5,LibTime C58B7F84-FFA7-4112-8097-C765CF7515C8,OemGetEdid C599195F-9B5B-4910-9310-A6103F5ED3F6,POSTWarningDxe C5B9C74A-6D72-4719-99AB-C59F199091EB,SemihostFs C5D3191B-27D5-4873-8DF2-628136991A21,UserIdentifyManager C5F25542-2A79-4A26-81BB-4EA63233B309,EdkiiNonDiscoverableNvmeDeviceGuid C6068612-B6E0-48A3-BB92-60E4A4F89EDF,UefiPciSegmentLibPciRootBridgeIo C60AA7F6-E8D6-4956-8BA1-FE26298F5E87,EpcBiosDataGuid C613EC78-63ED-4B93-ACD4-54B3D4CCC268,NetworkLockerDxe C61EF796-B50D-4F98-9F78-4F6F79D800D5,MemoryInit C62CEB80-FB40-4A46-A5E5-C1D997C36DFC,CapsuleLoaderTriggerDxe C62F4B20-681E-11DF-8F0D-0002A5D5C51B,PciHostBridge C642C14C-0E9C-4AEF-94A5-A213BAA35DE0,HstiResultDxe C65A623F-2768-4700-BE2C-1D8BA2C43998,Inside C6734411-2DDA-4632-A592-920F24D6ED21,AmiAtaPassThruInitProtocolGuid C6760651-A38D-5F4F-AEAF-F6661549DF75,EmuBlockIo C68DAA4E-7AB5-41E8-A91D-5954421053F3,CbSupportDxe C68ED8E2-9DC6-4CBD-9D94-DB65ACC5C332,EfiSmmCommunicationProtocolGuid C6A957E4-8303-4761-A084-92C0692D90F9,PoofAnimationState3 C6BB86C0-16F5-4535-953E-E6C7CB6E4CB6,FpgaErrorHandler C74233C1-96FD-4CB3-9453-55C9D77CE3C8,WM00WMISmmHandler C74D1B0B-91B1-484A-A038-FE7A0847AA07,DualBiosDxe C74E5DB2-FA96-4AE2-B399-15977FE3002D,EfiSpiHcProtocolGuid C7542254-A8F7-40BA-9BB9-390D31977775,OCMR_PEI C7715FBC-E2AB-4A33-840F-5DCD0198E552,SaDxeMiscConfigGuid C7735A2F-88F5-4882-AE63-FAAC8C8B86B3,EfiVAminiPortProtocolGuid C776AEA2-AA27-446E-975B-E0BEA9078BD9,BiosGuardPeiApRecoveryCapsule C779F6D8-7113-4AA1-9648-EB1633C7D53B,CapsulePei C77DD102-1DB4-4997-AE37-4E8C521EF567,AmiProcessTcgSetupGuid C7A7030C-C3D8-45EE-BED9-5D9E76762953,MouseDriver C7B7070B-E5A8-4B86-9110-BDCA1095F496,PeiFspHobProcessLibSample C7C89169-1A42-4E5E-B34B-E6830671C9A6,AmdSb900Smm C7D35798-E4D2-4A93-B145-54889F02584B,EdkiiNonDiscoverableAhciDeviceGuid C7D4BBCF-EB0A-4C91-BD8B-FCA99F28B011,AmiTxtPei C7D4F4E3-DAEA-40B0-8846-F4CAF3135CE8,BiosProtectDxe C7DCFF6F-6F2A-4DC1-91C6-DF0BAFDBDA46,VbtMipiSharpGuid C7DF48CC-063E-4FD4-B775-75C00D9F19F6,SmbusDebugPei C7E6800D-9566-1143-81A8-B8C566AF3556,SNP C7EA9787-CA0A-43B4-B1E5-25EF87391F8D,QncS3Support C7EA9F94-1547-44F0-863F-563EAE79E1C0,TianoCompressSmm C80EA8F3-A3C9-4225-AA60-769DD4C74E43,LenovoSvpManagerDxe C810485E-D0EC-4E98-AAB5-120C7E554428,TdtAm C811FA38-42C8-4579-A9BB-60E94EDDFB34,AmiTseSetupGuid C81FFCBF-BB77-400B-BC86-C9B16CF95EAE,AppleUsbNotify C82919D6-33FD-43ED-800C-635A3369D0F3,SystemDiagnosticSummaryScreenDxe C8300EA9-869E-42DF-AEF2-5D939452A353,SetupDefaults C8339973-A563-4561-B858-D8476F9DEFC4,Metronome C85903B6-84B5-4D78-B59D-D2D6B97580F3,PngConvertDxe C866BD71-7C79-4BF1-A93B-066B830D8F9A,CpuS3Pei C88B0B6D-0DFC-49A7-9CB4-49074B4C3A78,EfiStorageSecurityCommandProtocolGuid C89D72CE-E21A-4C71-BA79-770EF373D6DA,BootSector C8B36958-00A7-4678-83EF-E5525A8CE4A4,OemFixedBootOrderIpmi C8B64E46-9819-45AB-875D-09DFDA6D8B1B,Firewire C8CA0BB8-67DA-4883-8CFC-9180CB9EEC68,OemActivation C8F23B39-C95C-4318-9233-53FB3AC44592,VariableVsr C9122295-56ED-4D4E-06A6-508D894D3E40,FspApiPerformanceGuid C91C3C17-FC74-46E5-BDBE-6F486A5A9F3C,AmiRomLayoutFfsFileGuid C952402C-F2A8-410F-96F7-2C789BE0E0A1,LenovoTamperDxe C95E6A28-FB95-49F2-AE01-F38166FD4524,OemServicesDriver C9737920-C2AD-41C3-B133-0F9C251B6743,PeiDebugDispatchPpiGuid C99E42D0-4964-4B09-B924-4A59E13E4F04,SbRunSmm C9A6DE36-FDFF-4FAF-8343-85D9E3470F43,NvmeInt13 C9E057D7-3B6D-475C-B8C2-7C955D2F58B3,gear4 C9FAF091-57F8-A64C-A07A-445B124F0D93,FlashMapPei CA0D6FF6-62A7-4B1F-BB90-52EECA01A99F,TCM_MADriver CA1BCAD9-E021-4547-A1B0-5B22C7F687F4,ACPIOSFRModelStringVariableGuid CA261A26-7718-4B9B-8A07-5178B1AE3A02,DiskIoDxe CA3668C7-AE4E-454B-9E46-DA97AAAE0FF5,X11SmmDriver CA37BC1F-A327-4AE9-828A-8C40D8506A17,EfiDns6ProtocolGuid CA3B3A50-5698-4551-8B18-CEAEEF917D50,DxeDebugCmdProtocolGuid CA4233AD-847E-4E5D-AD3F-21CABFE5E23C,WinNtOemHookStatusCodeHandlerDxe CA452C68-DF0C-45C9-82FB-EAE42B312946,EfiVLVTokenSpaceGuid CA452C6A-DF0C-4DC9-82FB-EAE2AB312946,EfiQuarkNcSocIdTokenSpaceGuid CA4853F4-E94B-42B4-8642-CDE28A7FAC2D,PeiTpmPpiGuid CA49B5C8-E977-4612-8706-91B82CD14C87,IntelMchAcpiTables CA515306-00CE-4032-874E-11B755FF6866,DataHubStdErrDxe CA5627C4-51BA-4DCB-AC62-C076EBD37DDB,Python CA599759-90A7-4FE4-BC8B-4B71C350DCAC,LibGen CA5A1928-6523-409D-A9FE-5DCC87387222,TrEEPei CA5D7EB0-1B67-4B0B-964A-F2A861F0D640,IccOverclockingDxe CA5E3DF0-940A-48F1-8C14-DB2FB5998B36,TdtWrapper CA89914D-2317-452E-B245-36C6FB77A9C6,SaSsdtAcpiTableStorageGuid CA9725C0-12E5-4FAC-AD58-D9AAB03B8F11,LenovoHdpManagerDxe CA9D8617-D652-403B-B6C5-BA47570116AD,TxtPei CAA4381E-750C-4770-B870-7A23B4E42130,EfiHashAlgorithmSha512Guid CAB0E94C-E15F-11E3-918D-B8E8562CBAFA,EfiBootManagerPolicyConsoleGuid CAC3FB95-33F5-4596-818B-68E024DDB67B,IsSecRecoveryPEI CACB3817-81E6-497E-87FF-C8FA8F24EC28,SgACPI CAD40D6E-C871-4398-910D-2D74EE94711A,AmiTseAfterTimeOutGuid CAE0AD55-47B7-4E03-A714-95E1711CC279,BcpBootOrder CAEE2F3B-3191-4DA0-AD10-A5C07E636CD1,LibString CB2C0D12-8E6A-4B12-94F4-1BC49EC460B1,AmiHstiPkgTokenSpaceGuid CB3FD86E-38A3-4C03-9A5C-90CFA3A2AB7A,EfiExtendedSalMcaLogServicesProtocolGuid CB494BAD-23FF-427E-8608-D7E138D3363B,ArmPlatformLibNull CB49CE50-3A75-11DE-8A39-0800200C9A66,PerfTuneSmm CB537AA2-F727-440B-9702-ADE9D0A293F1,PlatformStage2Pei CB73C3D9-2F01-4342-AE67-04DDE5264092,PlatformSmm CB871572-C11A-47B5-B492-675EAFA77727,EfiDiskInfoUsbInterfaceGuid CB933912-DF8F-4305-B1F9-7B44FA11395C,AcpiPlatform CBC59C4A-383A-41EB-A8EE-4498AEA567E4,FlashDriver CBC91F44-A4BC-4A5B-8696-703451D0B053,ReserveBootGuardFvMainHashKey CBD2E4D5-7068-4FF5-B462-9822B4AD8D60,VariableRuntimeDxe CBD86677-362F-4C04-9459-A741326E05CF,SeCUmaPpiGuid CBF486B7-D196-4C03-AFE2-33F38E64DA16,IntegratedTouch CC0F8A3F-3DEA-4376-9679-5426BA0A907E,PkVar CC1BAA36-11EB-45CC-9ADC-7565E273AC70,PnpSmm CC1FC04E-0B3D-4E0E-AED7-5898541E2683,CSMLinkerDxe CC243581-112F-441C-815D-6D8DB3659619,D2DRecovery CC322E80-6A08-4E80-8BCA-01A84BA6CFE4,PciHostBridge2 CC5263E8-9308-454A-89D0-340BD39BC98E,EfiEventNotificationTypeInitGuid CC54F583-3F9E-4AB0-9F7C-D2C7ED1C87A5,AppleRtcRam CC582C73-F48F-4B62-83E8-A586B4C88F84,AppleFirmwareFeatures CC664EB8-3C24-4086-B6F6-34E856BCE36E,EfiWinNtPassThroughGuid CC71B046-CF07-4DAE-AEAD-7046845BCD8A,LenovoVideoInitDxe CC84D725-DA1E-46A7-9E75-4BACF1FD3902,SystemFontDxe CC93A70B-EC27-49C5-8B34-13931EFED6E2,EfiAlertStandardFormatProtocolGuid CCA91175-03E3-442A-B3B8-2E4A335C1DEA,AmiHsti CCABD229-51C4-4DE7-AE2F-3AAF71F9ECE5,SystemSetupAdvancedDxe CCBF2786-CD6C-4308-BDFA-625870CEBF81,AmiCmosAccessPpiGuid CCC4BC8A-0D71-4197-86D5-DD12E10A97E6,InstantOn CCC5C136-ACD3-4251-9BDC-F663CD2297B7,AppleAudioDecoder CCCB0C28-4B24-11D5-9A5A-0090273FC14D,GraphicsConsoleDxe CCEC84CD-CDC5-4C75-8637-D4508FC79CCD,PngConvert CD2B6EB3-EA11-4848-B687-AFE57D3D1C0F,ApplePpiPlatformInfoDB CD31F8A8-28A6-4E49-8B3E-4142BD006C41,MeUlvCheckDxe CD31F8A8-28A6-4E49-8B3E-4142BD006C41,MeUlvCheckDxe CD3BAFB6-50FB-4FE8-8E4E-AB74D2C1A600,EnglishDxe CD3D0A05-9E24-437C-A891-1EE053DB7638,EdkiiVariableLockProtocolGuid CD51358D-6E7E-45CA-B450-57C046BDFDDC,BmpConvert CD554A69-EE4D-404F-855A-84A6A39755D7,AmiSriovLibNull CD72881F-45B5-4FEB-98C8-313DA8117462,EfiI2cMasterProtocolGuid CD7C839D-0521-4B26-9476-9FF2CB70649A,OpromUpdateDxeNeonCityEPECB CD84562C-6864-40A3-A081-C8D35E82B920,CspLibDxe CDC1C80D-E6D3-4A42-9229-75F3BEFCF109,PciOutOfResourceSetupPage CDC5DDDF-E79D-41EC-A9B0-6565490DB9D3,IgdOpRegionProtocolGuid CDE1A697-5BEB-7E4A-95D8-4078E564E70C,PngConvert CDEA2BD3-FC25-4C1C-B97C-B31186064990,EfiBootLogoProtocolGuid CDEC3671-816E-43DC-A002-DCD645229338,I2cHostDxe CE033449-3D90-9644-862E-2D7D9AA3F06A,BinConvert CE12B236-17E5-47B4-96AE-C85BBAC1E5BF,SmcAssetInfo CE345171-BA0B-11D2-8E4F-00A0C969723B,EfiDiskIoProtocolGuid CE366D33-B057-4C03-8561-CAF17738B66F,WdtAppDxe CE3DA938-6AD6-458A-8831-6B0A03DF6C86,Pentium4Base CE57B167-B0E4-41E8-A897-5F4FEB781D40,EdkiiSystemFmpCapsuleDriverFvFileGuid CE5E5929-C7A3-4602-AD9E-C9DAF94EBFCF,EfiIpSecConfigProtocolGuid CE660500-824D-11E0-AC72-0002A5D5C51B,HdLcdGraphicsDxe CE6F86BB-B800-4C71-B2D1-3897A3BC1DAE,AmiHddSecurityInitProtocolGuid CE76670A-55C0-484B-962E-84A2F65210A6,MEMPATCHPEI CE7CD764-A1D9-44E5-9857-14FEFAAE96DD,PnpDxe CE845704-1683-4D38-A4F9-7D0B50775793,EfiPlatformBootModeGuid CEA4FF9C-D7BC-4F07-96F1-03F41F2B17AE,BaseFspDebugLibSerialPort CEAB683C-EC56-4A2D-A906-4053FA4E9C16,EfiTemporaryRamDonePpiGuid CEB0203C-DE91-4ECE-A95F-0217E959E191,SystemSecureFlashAuthenticationDxe CEE19373-FB2A-4B8E-BEF5-B6D7731F4939,I2cBus CEE33516-58E3-47DB-BB3F-2758B5A76C28,FirmwareVersion CEEC2EE9-BF2D-45D9-B96A-1144B062395D,UsraQuiesceLibNull CEF5B9A3-476D-497F-9FDC-E98143E0422C,NVRAM CEF68C66-06AB-4FB3-A3ED-5FFA885B5725,SMBiosBoard CF10F9FA-45BE-088A-0DCF-37B75CFE917C,SystemSmbiosLoaderDxe CF2F5574-3C73-4D2F-976D-665CAD2E5381,ASUSDirectKeyDXE CF31FAC5-C24E-11D2-85F3-00A0C93EC93B,BlockIoVendorGuid CF569F50-DE44-4F54-B4D7-F4AE25CDA599,XenIoPciDxe CF6BCADD-D4C4-4095-B2BC-417D7247890A,StaticSkuDataDxeNeonCityFPGA CF7A379E-F788-44D4-AF65-165CE1E0ED68,SmcOptimizeDxe CF8034BE-6768-4D8B-B739-7CCE683A9FBE,EfiPciHostBridgeResourceAllocationProtocolGuid CF89079D-DE55-4618-8683-BCFB0D5C90BC,AsusSlp2Encrypt CF93C01F-1A16-4DFC-B8BC-9C4DAF67C104,EfiEventNotificationTypePcieGuid CFAA77CE-7208-43C3-B815-99E8D66A28BA,b57undix64 CFB33810-6E87-4284-B203-A66ABE07F6E8,EfiHeciProtocolGuid CFE5EC91-31ED-47E9-BE7D-9CCB59134B71,SiSaPreMemPolicyPpiGuid CFFB32F4-C2A8-48BB-A0EB-6C3CCA3FE847,ApfsJumpStart D00752EA-A49C-40AD-A6DA-921C030C4B2F,DxeIchInitDxe D024BCD2-59EA-48AC-A17F-B3221EC23A11,Int15GetMisc D038747C-D00C-4980-B319-490199A47D55,FspReservedMemoryResourceHobTsegGuid D03F3A1D-088E-46C8-A9FB-8209770F2CE2,ChipsetPlatformLibServicesDxe D04159DC-E15F-11E3-B261-B8E8562CBAFA,EfiBootManagerPolicyNetworkGuid D0632C90-AFD7-4492-B186-257C63143C61,SmmBase D083E94C-6560-42E4-B6D4-2DF75ADF6A2A,EfiDataHubStatusCodeRecordGuid D0849ED1-A88C-4BA6-B1D6-AB50E280B7A9,UsbCredentialProviderGuid D088A413-0A70-4217-BA55-9A3CB65C41B3,ExitPmAuthProtocolGuid D0893F05-B06D-4161-B947-9BE9B85AC3A1,SnpNt32Dxe D0CAA91E-2DE4-4B0D-B3DC-09C67E854E34,BiosSnp16 D0CAF5CA-3DF0-3D4F-89C5-66105356D61B,AppleBds D0F71512-9E32-4CC9-A5A3-AD679A0667B8,FlashProtectionConfigGuid D1150ED7-E582-4192-84A2-71B4EBA9A7C6,AcpiPlatformDxe D122882C-DA73-438B-A6B3-E07B7D18DB6F,FastBootSmi D124DFA7-D784-C64E-8106-29411A7F59DB,MnpDxe D1405D16-7AFC-4695-BB12-41459D3695A2,EfiNetworkStackSetupGuid D18C0912-6825-4E8F-8D5A-AF7EEDB2E5BC,LpssConfigGuid D1A26C1F-ABF5-4806-BB24-68D317E071D5,AppleEpidCertificate D1C17AA1-CAC5-400F-BE17-E2A2AE06677C,EfiKmsFormatMd4128Guid D1C4AAF9-AAB1-4AEE-ACAC-D68AEF05F0D5,UsraLibNull D1E59F50-E8C3-4545-BF61-11F002233C97,TxtPeiAp D22C15F5-818B-4940-90EB-ABB377255643,SmbiosMisc D233D6BD-F1B1-425A-BF45-5CAF2B88EDDC,WinNtOemHookStatusCodeHandlerPei D258D6AF-2FC0-4019-9C1F-1101C3DD19B5,DxeCoreEntryPoint D25F555A-30EF-49EE-8FB5-C76B5817CC2A,AppleBootUI D26374A5-7716-4708-AD9F-9C4F2C02547E,IchS3Save D26697EE-9983-48B0-8F85-7D3E66528B07,LegacyBiosDxe D26C221E-2430-4C8A-9170-3FCB4500413F,TcgEvent2EntryHobGuid D27FED59-ABB4-4FED-BEAD-2A878C7E4A7E,SmbiosMeasurementDxe D2846ADB-B41B-4103-871F-E2235F4778C7,SmcPostMsgHotKey_PEI D2B2B828-0826-48A7-B3DF-983C006024F0,EfiStatusCodeRuntimeProtocolGuid D2BC3092-92BB-4B21-A26B-CE6F7C3E9857,AtAmUi D2C18636-40E5-4EB5-A31B-36695FD42C87,EfiShellEnvironment2ExtGuid D2C69B26-82E1-4A1B-AD35-ED0261B9F347,MemoryInitPei D317F29B-A325-4712-9BF1-C61954DC198C,EfiSmartCardEdgeProtocolGuid D31EAA20-8436-4E34-9A06-C47C78E19F18,SIOBasicIODxe D31F0400-7D16-4316-BF88-6065883B402B,EfiPchInfoProtocolGuid D3231048-B7D7-46FC-80F8-2F7B229586C5,UTDMUIApp D326D041-BD31-4C01-B5A8-628BE87F0653,EfiSmmFirmwareVolumeBlockProtocolGuid D3300D09-B70F-4315-9785-FE37209EFDCB,HddSecurityBdsCall D34D3234-38BA-428B-9ACD-84E830A80785,AmiModulePkgTokenSpaceGuid D359DE86-0A1B-47BC-95D2-1D1F8FFF0AD8,ChipsetSvcSmm D35EDA81-07D0-4142-9409-B07233ED2D07,CseSpiSelectPpiGuid D36DDD2D-1C66-4210-B77A-2FD9F920E51F,ASUS_EUPSxSMI D3705011-BC19-4AF7-BE16-F68030378C15,EfiIntelFrameworkModulePkgTokenSpaceGuid D3709BB4-B194-4B71-B9C0-DBD8D2DA97AD,IntelIchLegacyInterruptDxe D3790CB3-A890-4A5A-A42E-ECB6B140D814,UHESerial D3987D4B-971A-435F-8CAF-4967EB627241,SerialDxe D398E61C-2A9C-4A6D-B265-47696CF9E442,ASUSFS2 D3AAD8DC-3A48-46AC-B1C7-28A9D3CF6755,WinNtThunkPPIToProtocolPei D3B36F2B-D551-11D4-9A46-0090273FC14D,EfiConsoleInDeviceGuid D3B36F2C-D551-11D4-9A46-0090273FC14D,EfiConsoleOutDeviceGuid D3B36F2D-D551-11D4-9A46-0090273FC14D,EfiStandardErrorDeviceGuid D3B46F3B-D441-1244-9A12-0012273FC14D,EfiXenInfoGuid D3ECC567-9FD5-44C1-86CF-5DA7A24F4B5D,EfiLpcWpc83627PolicyProtocolGuid D400D1E4-A314-442B-89ED-A92E4C8197CB,EfiQuarkCapsuleGuid D40B6B80-97D5-4282-BB1D-223A16918058,EfiNvdimmLabelProtocolGuid D42AE6BD-1352-4BFB-909A-CA72A6EAE889,LzmaF86CustomDecompressGuid D42F8F9A-9B96-4F47-B045-A8F3CD1FD9D3,SecureVariable D432A67F-14DC-484B-B3BB-3F0291849327,EfiDiskInfoProtocolGuid D4395796-6F4C-4C6B-B9D1-92DAA7199A84,AmiRedFishApi D450A69D-D8E4-C048-8E7E-0024EB541C79,NetworkInterfacePolicyDriver D458A654-F64C-49DB-B8D1-3821306BF1F6,BaseMemoryLibMmx D462AE45-FF5A-4448-A474-B986E2A0D5B1,G3WakeupDxe D487DDB4-008B-11D9-AFDC-001083FFCA4D,EfiSasDevicePathGuid D49D2EB0-44D5-4621-9FD6-1A92C9109B99,HiiResourcesSample D4A88838-EBF4-48D7-9D97-CE6789FDE0B7,CryptoPkgTest D4BECF5B-190D-46DB-92CC-3F5D74904DDA,SmmAccessDxe D4DCD37C-90A3-406E-B193-323C6AAC2428,ASUSBackup D4E79DAE-AAFC-4382-9540-3E3FA42D4255,AmiNvmeLegacyProtocolGuid D4EE25EA-0B48-43AE-A016-4D6E8B6C43B3,MemoryInit D5125E0F-1226-444F-A218-0085996ED5DA,Smbus D52B0965-681A-4DC6-92C6-B20A30208598,AAFTblPEI D52D8AD2-EA9A-470C-9E33-828FA591AB8D,AmiPeiHashInterfaceProtocolGuid D530CEA0-DD63-11DE-8A39-0800200C9A66,MemSpd D5649ACA-DA40-4C58-A4DF-8E42EB40A180,SaPolicyProtocolGuid D56A4094-570F-4D3D-8F5F-8D8AA0B396CB,EhciPei D57C852E-809F-45CF-A377-D77BC0CB78EE,IdeSmart D58EBCE1-AF26-488D-BE66-C164417F8C13,PciHostBridge D5919FF6-D708-4918-87A0-1BB21B157C08,CaseOpenDxe D5B06D16-2EA1-4DEF-98D0-A05D40728417,EfiWatchdogTimerDriverProtocolGuid D5B366C7-DB85-455F-B50B-900A694E4C8C,SlingShot D5D52FED-F8A6-49AC-97AC-7291A60405A6,FsIso9660 D5E606EB-83DF-4E90-81E8-C3DB2F77179A,rmHwA15x2A7x3Guid D6062B50-15CA-11DA-9219-001083FFCA4D,EfiAuthenticationChapRadiusGuid D6099B94-CD97-4CC5-8714-7F6312701A8A,VirtioGpuDxe D6207835-B7E3-4FF8-B276-CDE3E52206BC,SmbiosDataUpdateDxeLightningRidgeEXECB1 D6294C9B-0866-4753-AAAD-7699AFC4BEE4,DefaultFixedBootOrder D62C96E9-D7D7-4D28-B0F9-BF2CA151DDEF,IePolicyInitPei D6405DAC-92D7-4BB2-A9C9-CB7C749023F5,BIOSLD D6494E1B-E06F-4AB5-B64D-48B25AA9EB33,SmmCpuPlatformHookLibNull D65D9F72-7BCE-4F73-A673-47AF446A1A31,SmmRuntimeDxeReportStatusCodeLibFramework D684FB08-8B0E-4CAF-8CFF-1EA386279809,SwitchableGraphicsSmm D687E479-DB37-4BCE-864A-02EEF6819DF1,SystemFormBrowserSimpleTextViewDxe D69240C0-DD40-4F2D-9863-4848DA6E615F,AmiTseInvalidPasswordGuid D69A279B-58EB-45D1-A148-771BB9EB5251,EpcOsDataGuid D6A2CB7F-6A18-4E2F-B43B-9920A733700A,DxeCore D6A9928C-3397-4DD1-818F-C664BA6DCAAF,DevUtility D6A9A1B9-4BFD-D61E-F037-3FA4CA06E046,Lua D6AC4AC2-8BC2-4CDD-8776-280E1469DE02,PchPolicyInitDxe D6C589EA-DD29-49EF-97F6-1A9FE19A04E0,PwdCredentialProvider D6D2FBA6-EF60-4C38-A83E-6769814D23B0,CryptoPei D6EB696B-7EC3-4D1B-AA28-6775744C9EB5,TSEScreenMgmtProtocolGuid D6F43B1B-0F21-462B-B8B7-A033C3EB4261,BaseMemoryLibOptPei D6F76587-98CA-43DE-9E1A-59E60D0ABE73,AplFakeCapsulePei D719B2CB-3D3A-4596-A3BC-DAD00E67656F,EfiImageSecurityDatabaseGuid D71C8BA4-4AF2-4D0D-B1BA-F2409F0C20D3,UncoreInitPeim D71C9263-2E64-40F9-82B8-F25B27069D4F,EnePEI D71DB106-E32D-4225-BFF4-DE6D77871761,PowerMgmtInitDoneProtocolGuid D739F969-FB2D-4BC2-AFE7-081327D3FEDE,AMTDxe D74B7D80-4B7F-4A73-8A55-4B59D7DE747A,AmdResetManager D74CC5E6-B169-456E-91D2-BE2C2D1343A6,SpiFlashLibNull D753C57C-87D0-4636-876A-5EE0E73A6689,PlatformMilestoneHookDxe D77C900D-A1C7-41C5-B989-0C3D37FCA432,AmtWrapperDxe D79DF6B0-EF44-43BD-9797-43E93BCF5FA8,VlanConfigFormSetGuid D7A50E8B-FD3A-443A-81A9-C951DAC8B3FF,LenovoLoggingDxe D7AD636E-B997-459B-BF3F-8846897980E1,EfiHiiProtocolGuid D7B10D4E-67E6-4C74-83E9-F9AF0ACC33CC,PchInitSmm D7C74207-A831-4A26-B1F5-D193065CE8B6,EfiAdapterInfoMediaStateGuid D7E31ECB-0A17-4529-9B84-C529DE8E1C0E,AcpiFvi D7E69789-1F68-45E8-96EF-3B6407A5B2DC,EfiKmsFormatAescbc256Guid D7E6ABC1-971B-461B-B5E4-3C3766267AD9,SbInterfaceDxe D8117CFE-94A6-11D4-9A3A-0090273FC14D,EfiDecompressProtocolGuid D8117CFF-94A6-11D4-9A3A-0090273FC14D,EfiPeiPeCoffLoaderGuid D81D1706-BE6F-4734-B2AF-F885FFDCB16D,AsixUsbEthernetDxe D83977DF-34C3-4A21-A104-369B8D4FA7B7,LenovoMfgBenchEventDxe D84BEFF0-159A-4B60-9AB9-AC5C474BD3B1,AmiTseNVRAMUpdateGuid D872AEFA-7C5F-4C66-8836-AA57EFF0D9F8,IconGenericExternalHardDrive D8944553-C4DD-41F4-9B30-E1397CFB267B,EfiNicIp4ConfigVariableGuid D8A6F4A6-0E97-4A8B-A475-39F1B28B5AEC,Fv2OnFvThunk D8AAB432-93CC-48D2-9F34-3496CAF92185,SmartFanCtrlDXE D8AB1072-4B45-4828-837D-A4214377802E,BCLANDXE D8D282C4-4478-4D75-B10B-B08F5E59B5E8,BasicDiagnostics D9072C35-EB8F-43AD-A220-34D40E2A8285,EfiSmmSpiProtocolGuid D912C7BC-F098-4367-92BA-E911083C7B0E,Udp6Dxe D933DEDE-0260-4E76-A7D9-2F9F2440E5A5,NBSMI D93CE3D8-A7EB-4730-8C8E-CC466A9ECC3C,ReportStatusCodeRouterRuntimeDxe D93DE2E3-3727-4D5B-B49F-777C93A971D3,OpromUpdateDxeLightningRidgeEXECB3 D959E387-7B91-452C-90E0-A1DBAC90DDB8,ArmPlatformPrePiUniCore D96A2393-8790-4BAA-9CEB-42533F016EE9,RegAccessSMM D97435DE-E680-41FC-93BE-4A76A5C82F7F,SerialDebugInitPei D9760FF3-3CCA-4267-80F9-7527FAFA4223,EfiMtftp6ServiceBindingProtocolGuid D995E954-BBC1-430F-AD91-B44DCB3C6F35,EfiPcieErrorSectionGuid D9B07611-4ED7-38BF-B304-42116E7C966A,OSRecovery D9BEE56E-75DC-49D9-B4D7-B534210F637A,EfiCertDbGuid D9D114EF-F40B-4D48-AAA0-A3DC99C9F5BD,DebugAgentPei D9DCC5DF-4007-435E-9098-8970935504B2,PlatformDxe D9E9FA06-0FE0-41C3-96FB-83425A3394F8,EfiExtendedSalBaseServicesProtocolGuid D9F11A26-249C-46AC-9CB5-E4F77E035C90,NetworkRecoveryNameLabel D9F5B28C-9FF1-47D6-B503-3DC23BD345FF,PchEarlyInitPeim DA6855BD-07B7-4C05-9ED8-E259FD360E22,EfiPei144FloppyBlockIoPpiGuid DA7CAF76-CB17-4D80-AE21-2BD3AE421C76,RuntimeAmiFlashLibCompat DA836F8D-217F-4CA0-99C2-1CA4E16077EA,EfiHash2ServiceBindingProtocolGuid DA8CD7C4-1C00-49E2-803E-5214E701894C,EfiI2cEnumerateProtocolGuid DA964524-D0E5-4C32-90D0-010021CFB2DC,PMBUSDXE DA9F192F-BAE4-4F20-8C6C-55C1ACDE80B0,menu_checked DAA55048-BC3F-4DD9-999B-F58ABF2BBFCC,DxePlatform DAC2B117-B5FB-4964-A312-0DCC77061B9B,Font DAC3CB98-2295-412E-826D-FDEEA320CF31,AmiRecoveryImageHobGuid DACF705C-71DF-497D-AABE-10186B2E1DDE,Recovery DADE1003-1B31-4FE4-8557-26FCEFC78275,InjectorKext DADE8301-CB29-4FD5-8148-56FD246C5B88,UefiApplicationEntryPoint DAEEAFC8-D2A8-4D9F-B093-3438984E5FDD,AmiDeviceGuardSecBootApiGuid DAF4BF89-CE71-4917-B522-C89D32FBC59F,SMBiosStaticData DAF7B0E6-32DE-4619-B63A-2B9173A75B14,GetNetByName DAFF1B62-A67A-4E11-8B57-496B572E0775,SystemLoadDefaultDxe DB08F6CA-3048-4CD8-9B1F-20BED33ECFE7,StatusCodeSmm DB1ACEF4-46A0-4A81-8E1E-4B793CEAAD68,LenovoTpmFwSwitchDxe DB1C3561-4F9E-4748-A807-BCBE7FA92FC9,EzConfig DB47D7D3-FE81-11D3-9A35-0090273FC14D,EfiFileSystemVolumeLabelInfoIdGuid DB4E8151-57ED-4BED-8833-6751B5D1A8D7,ConnectConInEventGuid DB63592C-B8CC-44C8-918C-51F534598A5A,PchResetProtocolGuid DB73174E-E46A-4927-9947-CF2DBEAF1681,PowerMgmtConfigGuid DB8AF09A-34E3-4A7B-8225-8C5B0C059EB8,AppleSmc DB9A1E3D-45CB-4ABB-853B-E5387FDB2E2D,EfiLegacyBiosProtocolGuid DBA6A7E3-BB57-4BE7-8AF8-D578DB7E5687,EfiTscFrequencyGuid DBAB39F4-8FF1-45B8-B92B-107848AC07E7,CMFCSmmHook DBADD769-E86A-4819-8120-E991792C0BC1,VbtMipiAuoGuid DBB5F303-214D-41C4-BEA3-A1B56A42DA8B,IsaAcpiDriver DBC6381F-5554-4D14-8FFD-76D787B8ACBF,IpmiProtocolGuid DBC9FD21-FAD8-45B0-9E78-27158867CC93,BdsAllDriversConnectedProtocolGuid DBD5B6BA-6734-4C5D-BF53-2C210D93A012,IsctSmm DBDA3714-78BF-43FF-B30B-4BD3DBC01B54,PsmiMotBufferGuid DBE23AA9-A345-4B97-85B6-B226F1617389,EfiTemporaryRamSupportPpiGuid DBE37563-AFEF-4B41-BDCE-B01B6D1E8690,Tpm12DeviceLibInfineonI2c DBFAB6C3-6C4B-4E4F-A8FE-AD1C27D5E8BA,OFCSmmDriver DBFF9D55-89B7-46DA-BDDF-677D3DC0241D,EfiAcpiSupportProtocolGuid DC14E697-775A-4C3B-A11A-EDC38E1BE3E6,AmiCsmOpromPolicyProtocolGuid DC2CD8BD-402C-4DC4-9BE0-0C432B07FA34,UefiFrameBufferInfoGuid DC3641B8-2FA8-4ED3-BC1F-F9962A03454B,Mtftp4Dxe DC38DF16-8280-49C1-B253-D7DBB301CF78,UserCredentialPwdDxe DC3EA0B0-A144-4797-B95B-53FA242B6E1D,EfiProcessorSpecificErrorSectionGuid DC54B283-1A77-4CD6-83BB-FDDA469A2EC6,EdkiiPeiUfsHostControllerPpiGuid DC7E8613-C4BB-4DB0-8462-13511357ABE2,EfiKmsFormatAesxts256Guid DC90D1E2-556A-45CF-B3EF-9DE451807A17,SaInitDxe DC92A37B-4AC5-4117-AABB-019FFC0FD06A,FpkSetup DC952D08-C62B-41C6-BAC7-70ED054F91E5,Pkcs7VerifyDxe DCAA4B60-408F-4BAD-99B9-B880D4EF0950,TdtDxe DCBC3662-9CDA-4B52-A04C-82EB1D2348C7,EfiKmsFormatMd5128Guid DCBE6D66-D928-4138-8041-358F35CBCF80,IsaBusDxe DCC64575-FA7D-4B7B-B1AD-48427C97C74D,LibCtype DCD0BE23-9586-40F4-B643-06522CED4EDE,EfiPeiSecurity2PpiGuid DCDF614D-930E-4FDF-AFCD-F4A8A408E077,EarlyVideoDxe DCFA911D-26EB-469F-A220-38B7DC461220,EfiMemoryAttributesTableGuid DD1BB969-BE0D-4B70-9E13-2ED2E1854240,LenovoWufuEsrtDxe DD223EF8-6D1B-490A-A53E-BA86FAAEB778,MmcMediaDevice DD455A69-EC75-456C-84D2-95CAE7D3C6D3,EslTcp6ServiceGuid DD5E92D1-DDAC-48CB-907A-882D8610E89E,SavePegConfig DD787473-07CE-4C63-82CE-930B33F39C09,SmmControl2 DD9E7534-7762-4698-8C14-F58517A625AA,EfiSimpleTextInputExProtocolGuid DDABFEAC-EF63-452C-8F39-ED7FAED8265E,PpmPlatformPolicyProtocolGuid DDADFC93-FBC5-4389-B20F-EC99E4A6AE52,SmmLibNull DDB412A6-E3F3-4E9E-90A3-2A991270219C,iFfsDxePolicyInit DDCBCFBA-8EEB-488A-96D6-097831A6E50B,HashLibBaseCryptoRouterPei DDCF3616-3275-4164-98B6-FE85707FFE7D,EfiVariableInfoGuid DDE31574-3589-4FA9-BC69-1729AF6FDA4E,AmiNvramUpdateProtocolGuid DDFB5557-3E2E-4569-B459-BEFFE189B8B0,AmiSmbiosFlashDataProtocolGuid DE0EE9A4-3C7A-44F2-B78B-E3CCD69C3AF7,EfiExtendedSalBootServiceProtocolGuid DE141A05-FA40-432D-9631-5E3E990F44D5,SlotDataUpdateDxeNeonCityEPRP DE161CFE-1E60-42A1-8CC3-EE7EF0735212,EfiTpmMpDriverProtocolGuid DE23ACEE-CF55-4FB6-AA77-984AB53DE811,SaInitDxe DE23ACEE-CF55-4FB6-AA77-984AB53DE823,PchInitDxe DE24E0D1-FAEA-4906-9CC8-AC00BE3DFF3A,AmiIbbrOBBHobGuid DE28BC59-6228-41BD-BDF6-A3B9ADB58DA1,FramerworkEfiFirmwareVolumeBlockProtocolGuid DE371F7C-DEC4-4D21-ADF1-593ABCC15882,ArmGicDxe DE3E049C-A218-4891-8658-5FC06A84C783,SBCbsPEIEntryPei DE3E049C-A218-4891-8658-5FC0FA84C788,AmdProcessorInitPeimPei DE498C70-1EDA-466B-ABCF-DD3ABC3D24B4,DummyMSOA DE5FC8BF-06ED-4DC5-BA9D-29F711699A85,TraceHubStatusCodeHandlerRuntimeDxe DE9ABB5C-2F92-4352-9C56-F51BC9D5E55A,DxeFramework DEA652B0-D587-4C54-B5B4-C682E7A0AA3D,AcpiS3IdtrProfileGuid DEB0EE00-18DF-415C-AF03-74D09B0AAD87,JedecNvDimm DEC5DAA4-6781-4820-9C63-A7B0E4F1DB31,ShellLevel1HiiGuid DED3F743-CE2C-4BA6-92A2-FFCE2A6D72D9,PeiServicesTablePointerLibIdt DED7956D-7E20-4F20-91A1-190439B04D5B,SmbiosGetFlashData DEEEA15E-4A77-4513-BA75-71D26FEF78A1,SmmIoLibSmmCpuIo2 DEF30E37-7AEC-4F69-91A2-CF099E2729F2,PciTableInit DF13AA16-B7B9-42A0-A399-00EE6C81A85A,DxeBoardInit DF1CCEF6-F301-4A63-9661-FC6030DCC880,SecMain DF2D868E-32FC-4CF0-8E6B-FFD95D1343D0,EfiPrintProtocolGuid DF4F6190-42B8-4CA9-BA51-7A801B565F08,b57undix64 DF5CD25A-8E55-46BA-8CDA-BC7DB7BF9C64,MdesStatusCodeDrv DF636282-5EED-11DF-A9D6-B334FBA24BB0,IntelHdAudioDxe DF66196C-958F-472F-9393-717D82110AF6,AmiHashLogExtendExGuid DF73ABDA-7A42-4E5E-B34B-E6830671C9A6,AmdSb900SmmDisp DF8556F0-3A61-11DE-8A39-0800200C9A66,PerfTunePei DF8DE36D-D241-4947-87F1-36F9EDE545D8,ASUSFS DF934DA3-CD31-49FE-AF50-B3C87C79325F,PlatformDebugLibIoPort DF9A9591-B646-4621-AF0D-18143A73289F,AppleLegacyBootFS DFA66065-B419-11D3-9A2D-0090273FC14D,EfiVT100Guid DFB386F7-E100-43AD-9C9A-ED90D08A5E12,EfiIpSecProtocolGuid DFD8D5CC-5AED-4820-A2B6-5C55E4E640EF,AcpiPlatformSmi E008B434-0E73-440C-8612-A143F6A07BCB,Recovery E01FDFD3-48C8-432C-9555-4409DDBC6C6A,AmiFlashLibDxe E029BADD-E270-467E-9C0F-D7586C33850A,Runtime E03ABADF-E536-4E88-B3A0-B77F78EB34FE,CpuDxe E03E6451-297A-4FE9-B1F7-639B70327C52,EnhancePeiVariable E0471A15-76DC-4203-8B27-6DB4F8BA644A,UbaConfigDatabaseDxe E052D8A6-224A-4C32-8D37-2E0AE162364D,PchSmbusDxe E05B0241-2F68-4DB4-8ADF-5760DE2E1570,TpmFwUpdateDxe E062C52D-78DC-4CC5-B246-B13497A8123C,PeiDxePostCodeLibReportStatusCode E0744B81-9513-49CD-8CEA-E9245E7039DA,EfiSmmGpiDispatchProtocolGuid E0746C42-D3F9-4F8B-B211-1410957B9FF5,BootOption E07A890D-7CC3-D042-A74B-12F117DDDF15,AppleGraphicsConsole E08CA6D5-8D02-43AE-ABB1-952CC787C933,PeiDefaultVbtGuid E0ADB57E-E1B6-44EC-BF2E-842874A26C83,LenovoWmaUsbDxe E0BEC4CC-8AE8-4D15-92E5-9755A08987BB,NCT3933UPEI E0C14753-F9BE-11D2-9A0C-0090273FC14D,EfiPcAnsiGuid E0D8CA17-4276-4386-BB79-48CB813D3C4F,EmbeddedTokenSpaceGuid E0E7D776-E7EB-4E5F-9AA8-54CF3AA64A43,PeiServicesTablePointerLibKr7 E0ECBEC9-B193-4351-A488-36A655F22F9F,SaveMemoryConfigDxe E0FF720B-0140-43FE-9528-7A781357E42E,UsbOhciDxe E113F896-75CF-F640-817F-C85A79E8AE67,EmuThunkPpiGuid E11FACA0-4710-4C8E-A7A2-01BAA2591B4C,FdtClientProtocolGuid E121EC07-9C42-45EE-B0B6-FFF8EF03C521,AppleRtcRam E143C542-4FC4-4DD9-99F2-75715C44E41C,IePolicyInitDxe E1475E0C-1746-4802-862E-011C2C2D9D86,EfiRuntimeCryptProtocolGuid E159A956-3299-4EE9-9176-65181A4E5E9F,AmiIdeBusInitProtocolGuid E15C9DF9-FC62-47B0-869B-FFB41BC6EA90,DisplayLinkPxe E1628C66-2A2D-4DC5-BD41-B20F3538AAF7,BootPicker E16600D0-3C41-4798-B16A-0DBA67D2FC47,AmiCpuSmbios E18541CD-F755-4F73-928D-643C8A79B229,EfiNetworkInterfaceIdentifierProtocolGuid E19E3D16-BC11-11E4-9CAA-C2051D5D46B0,EfiArmProcessorErrorSectionGuid E1AF9F5B-7CDE-4F98-91ED-5E67868282B8,BBVideo E1C1D0A9-40B1-4632-BDCC-D9D6E5295631,EfiPaddingRsaesPkcs1V1P5Guid E1CD9D21-0FC2-438D-9703-04E66D961E57,EfiExtendedSalPalServicesProtocolGuid E1CEE6E3-6C42-4A4F-916E-38385290A556,SnpDxe E1CF12E4-762B-4576-A158-9B255A828AA7,gear2 E1E1685A-7ABC-450F-882A-4E692CC6AF7E,FpgaConfigDataDxeNeonCityFPGA E1E4A857-C970-4075-A4DA-E9C41B69ADFC,AmiTextOutProtocolGuid E1EB612F-1C6C-485D-9D06-650844881569,EfiSignedCapsulePkgTokenSpaceGuid E1F2EBA0-F7B9-4A26-8620-131221642A90,EfiPciCfgPpiInServiceTableGuid E20939BE-32D4-41BE-A150-897F85D49829,EfiMemoryOverwriteControlDataGuid E20BE735-E059-4CD5-A927-FF7D528EC650,DescriptorUpdate E21F35A8-42FF-4050-82D6-93F7CDFA7073,PiSmmCommunicationSmm E223CF65-F6CE-4122-B3AF-4BD18AFF40A1,CpuInfoProtocolGuid E227C522-D5FE-4A53-87B1-0FBE570F98E9,ObservableProtocolGuid E22BBCCA-516A-46A8-80E2-6745E83693BD,EdkiiSmmMemoryProfileGuid E23F86E1-056E-4888-B685-CFCD67C179D4,SBRun E2441B64-7EF4-41FE-B3A3-8CAA7F8D3017,PciPlatformDxe E2657A19-7CD8-5389-98BC-6E201BBF4F70,MonacoFont2x E2775B47-D453-4EE3-ADA7-391A1B05AC17,PciSioSerialDxe E287D20B-D897-4E1E-A5D9-977763936A04,EfiPchS3SupportProtocolGuid E2A74738-8934-48F5-8412-99E948C8DC1B,SmbiosDmiEdit E2B36190-879B-4A3D-AD8D-F2E7BBA32784,EfiCertRsa2048Sha256Guid E2EA6F47-E678-47FA-8C1B-02A03E825C6E,TcgMorLockSmm E2EAE962-C492-4CA4-A11F-1A7CBB050A41,English E2ECA273-A1C0-407E-9A5C-F10C55142196,BaseSmbusLibNull E2F66EA2-0313-4B7E-A74F-8E23A6FEB449,UfsPhyOverrideHobGuid E3007647-798F-FF48-AC61-E0B8D1B66327,PlatformDataRegion E3441740-3B41-4C90-9C9D-964056C7417D,DxePciLibEsal E352725A-B84A-4EBC-A994-228E19224816,SmcBMCSMI E360BDBA-C3CE-46BE-8F37-B231E5CB9F35,FD_Drv_X64 E364A338-2842-4F57-A7C7-CDC8CFDF6CD7,AppleEvent E3752948-B9A1-4770-90C4-DF41C38986BE,QemuVideoDxe E380280C-4C35-4AA3-B961-7AE489A2B926,AmiSmbiosDynamicDataGuid E3830347-4844-49F1-9570-18AA377B711C,AppleDiagnosticVault E38A1C3C-928C-4BF7-B6C1-7F0EF163FAA5,FlashDeviceLibRuntimeSmm E38C1029-E38F-45B9-8F0D-E2E60BC9B262,DisplayEngineGuid E38C11E3-968F-47B8-ACEF-ACC0693DB9FF,EfiIchTokenSpaceGuid E38CB52D-A74D-45DB-A8D0-290C9B21BBF2,UserProfileManager E3932A34-5729-4F24-9FB1-D7409B456A15,OemBadgingSupportDxe E3CACF62-3062-4E1D-978E-46807AB9747D,PlatformConfigChangeGuid E3E4048D-6C0C-43E4-AE1C-FFB579D8EF41,OpalPasswordDxe E424C009-CD92-4FEC-8029-D79D3F1CF3DE,IntelIchReset E43176D7-B6E8-4827-B784-7FFDC4B68561,EfiRngAlgorithmRaw E4541241-8897-411A-91F8-7D7E45837146,BaseSerialPortLibNull E469AA26-9268-4EB0-A087-DD4CEE37404B,SecuritySelectDXE E472DF6D-2B4F-44AC-9165-CA2FCD5AB1F5,AmiCspFlashPeiLibNull E49061CE-99A7-41D3-AB3A-36E5CFBAD63E,AtapiPassThruDxe E49061CE-99A7-41D3-AB3A-36E5CFFEDCBA,LsiLogicPassThruDxe E49D33ED-513D-4634-B698-6F55AA751C1B,EfiSmbusHcProtocolGuid E4A88140-8E28-461D-91BC-A90FF015717C,UsbOcUpdateDxeLightningRidgeEXRP E4C9411C-1268-404C-9E90-2573EF04F43F,StaticSkuDataDxeNeonCityEPECB E4ECD0B2-E277-4F2B-BECB-E4D75C9A812E,NBDXE E4F272DA-237F-454C-8868-FCF096CF1C6C,LenovoPasswordCp E4F61863-FE2C-4B56-A8F4-08519BC439DF,VlanConfigDxe E516ACEF-FA3C-4068-8CE4-888D62B0E497,AmiEfiCrbInfoProtocolGuid E51F643F-5F3C-4CFD-9126-4687305F18DA,ReadyToPxeBootGuid E53734A3-E594-4C25-B1A2-081445650F7F,SmmChildDispatcher2 E541B773-DD11-420C-B026-DF993653F8BF,EfiSmmSwDispatchProtocolGuid E54A3327-A345-4068-8842-70AC0D519855,Tpm2DeviceLibDTpm E566B097-4378-485F-91D0-1C097C190CE2,PowerButton E5769EA9-E706-454B-957F-AFC6DB4B8A0D,QncS3ContextInLockBoxGuid E58809F8-FBC1-48E2-883A-A30FDC4B441E,EfiIfrFrontPageGuid E5A1333E-E1B4-4D55-CEEB-35C3EF133443,EfiFormBrowserProtocolGuid E5B58DBB-7688-44B4-97BF-5F1D4B7CC8DB,EfiEapConfigurationProtocolGuid E5CB2AC9-D35D-4430-936E-1DE332478DE7,EfiGraphicsDeviceInfoHobGuid E5D0BBDC-1BBC-49B7-A8B6-67AAF0A1CD9E,SystemDiagnosticSplashScreenDxe E5DAFE50-10CB-41B5-9CB5-274E1CF1A8D7,Ip6BmcLanConfig E5DD1403-D622-C24E-8488-C71B17F5E802,EfiAdapterInformationProtocolGuid E5E2C9D9-5BF5-497E-8860-94F81A09ADE0,NvmeSmm E60A79D5-DC9B-47F1-87D3-51BF697B6121,CpuPei E6186D9E-2797-423D-B075-970A2C5FC338,DmiArrayVarProtect E622443C-284E-4B47-A984-FD66B482DAC0,BootManagerPolicyDxe E62F9F2F-4895-4AB5-1234-399D0D9C1234,ComputraceDxe E633E57C-BBB1-4C6A-9F45-22C49378ADD0,BootScriptThunkHelper E646C3A8-C7E2-4DC2-A7F2-E32A270B0B26,LogoThunderbolt E64ACA85-F2CF-2246-87F4-92B839CCBB78,SingleFile E660EA85-058E-4B55-A54B-F02F83A24707,DisplayEngine E68088EF-D1A4-4336-C1DB-4D3A204730A6,LcdGraphicsDxe E68DC11A-A5F4-4AC3-AA2E-29E298BFF645,BCP E69562F2-C982-4E73-87B4-63BC79CDA110,CPLDDXE E6A7A1CE-5881-4B49-80BE-69C91811685C,Setup E6AF1F7B-FC3F-46DA-A828-A3B457A44282,EfiPeiCpuIoPpiInstalledGuid E6C2F70A-B604-4877-85BA-DEEC89E117EB,PchInitVariableGuid E6C7EBB7-1604-4FCB-8F87-B3A6F48730AE,OrderedCollectionTest E6DB4007-113B-4605-8F5F-668D7364C807,SmmInt15Service E6DC9900-CCF6-452B-85FA-C7F1E52F0152,SlotDataUpdateDxeNeonCityEPECB E6ED9B13-31AF-4C92-A561-D47B2FA994F7,FastBootHandlerDxe E6F4F8F7-4992-47B2-8302-8508745E4A23,OemPir E6F930E0-BAE5-40E6-98C9-4CD2298278E7,IconNetworkVolume E6FF49A0-15DF-48FD-9ACF-D7DC271B39D5,UefiCorebootModulePkgTokenSpaceGuid E701458C-4900-4CA5-B772-3D37949F7927,StatusCodeCallbackGuid E706CB54-84B8-40BD-832F-7FB2D5CB87B3,FileExplorerLite E70E508F-4466-49F3-BBFB-FDF24E950DBC,LockDownConfigGuid E72527CF-505B-4B50-99CD-A32467FA4AA4,AsfTable E7428F24-EF0C-4AE4-B521-9D247494900E,OnBrdDevOprom E764500B-E398-4AB7-BBBC-99A8E683681F,MeSmbios E767BF7F-4DB6-5B34-1011-4FBE4CA7AFD2,VlvMmioPolicyPpiGuid E7884BF4-51A1-485B-982A-FF89129983BC,BaseMemoryLibRepStr E79A7050-8109-40D1-B3C0-2A3C74C40204,AGI E7D9CAE1-6930-46E3-BDF9-0027446E7DF2,Gpio E7E1EFA6-7607-4A78-A7DD-43E4BD72C099,AppPkgTokenSpaceGuid E7E96F88-017B-417C-8DC8-B84C2B877020,BaseFspWrapperApiTestLibNull E7F1DFF9-DAB6-498A-9ADF-57F344EDDF57,UfsPassThruDxe E82F99DE-74ED-4E56-BBA1-B143FCA3F69A,DebugAgentTimerLibNull E83C2C69-31E2-4557-A96F-0ADAB9EB7353,SmbiosDataUpdateDxeNeonCityEPECB E84D8EAE-0151-41F0-9874-2F838DB47106,PMBUSPEI E8571188-00C1-4ED4-B14E-E38451351EC4,HddPassword E857CAF6-C046-45DC-BE3F-EE0765FBA887,EfiS3SaveStateProtocolGuid E8A59290-A2AF-4099-B0AF-323FF9B7AB41,BeginBootButton E8C729FE-FB0A-4344-AD7E-48784116C9EF,SmmIpmiBmcInitialize E8DDEB8B-82D7-4B6E-A2B4-D5EAEC2B8976,IrsiRegistrationRuntimeDxe E8F56FFE-919C-4CC5-BA88-65ABE14913BB,EfiEventNotificationTypeMceGuid E8F6A75C-3CDA-4B00-9837-8CA2A1F34EAC,SpsDxe E8F8CCFB-E880-0361-BCD1-FE248B2A307E,SaveMemoryConfig E9008D70-2A4E-47EA-8EC4-72E25767E5EF,AmiBiosPpiFlaSManagementGuid E92BAE14-3DFD-4C70-9FE6-3899F36C7846,PLEDSMM E92C4950-A483-445A-B6A8-B7029CA910AA,PlatformStage1Pei E9312938-E56B-4614-A252-CF7D2F377E26,AmiTcgPlatformPeiBeforeMem E938C9BE-CFC2-4A9D-A3CD-9653D8133009,AmiChipsetModulePkgTokenSpaceGuid E94CD42A-3AAD-4EA0-9B09-945891C60CCD,DxeIoLibCpuIo E94F54CD-81EB-47ED-AEC3-856F5DC157A9,PiSmmCore E954929C-5BAC-4494-B963-3B23D4A13AD2,QuiesceSupport E974833F-A4AE-4E39-BE37-8B6780DFAD01,Int15PanelFitting E98ADB03-B8B9-4AF8-BA20-26E9114CBCE5,EfiUserCredential2ProtocolGuid E998C6D8-572B-4E18-96CC-031EA3DD558C,AmiOemCsm16BinaryGuid E9B4B126-4E13-41F5-9E4C-9BF88B3C1B0C,KbdConfig E9CA4775-8657-47FC-97E7-7ED65A084324,EfiHiiFontProtocolGuid E9DB0D58-D48D-47F6-9C6E-6F40E86C7B41,PeiTpmInitializedPpiGuid E9DD7F62-25EC-4F9D-A4AB-AAD20BF59A10,StatusCodePei E9DEB2B3-88E4-46D2-B9A4-F60CACB918DC,SmcRiserCardPei E9F02217-2093-4470-8A54-5C2CFFE73ECB,EfiSpiSmmHcProtocolGuid E9F05D70-9946-4AB9-A7F7-070E92C415BD,Int15BootTV E9F4B929-EE33-4B70-8E90-17D283AF508C,LibSoftfloat EA1D58A2-EA3D-4C14-928A-80A14545E681,WheaPlatformBoot EA296D92-0B69-423C-8C28-33B4E0A91268,PcdDataBaseHobGuid EA2EC402-2FD5-475F-922C-98EAE0376312,SystemLegacyBiosDxe EA449C41-8236-4B97-9FF9-084E4BA70020,ProgressBarEmptyMiddle EA4B0675-1F36-4ABE-BB3A-6D60760A02A2,AmiPciPortCompatibilityProtocolGuid EA4DAEE8-A851-4A9F-ABF4-B79FA2528291,CpuSmbiosDriver EA5D72C1-4455-4FF8-91A1-4352DC1EE112,gear8 EA6D974D-AD75-40ED-BCDD-FDA297AA8F8A,ChipsetLibServicesDxe EA7CA24B-DED5-4DAD-A389-BF827E8F9B38,EfiPeiFirmwareVolumeInfo2PpiGuid EA7D60A6-1050-45E4-BEDF-BF177290D4B2,EfiEmmcBootPartitionProtocolGuid EAA006CD-3256-789B-BD20-EBABCD02583F,SecureFlashPei EAA96391-9BE3-4488-8AF3-B3E6EFD157D5,EmuSecPei EAD039A6-7390-411D-A9DE-E5294B25B897,ASUSEZFlash EADD5061-93EF-4CCC-8450-F78A7F0820F0,Tcg2ConfigPei EAEE5615-0CFD-45FC-8769-A0D85695AF85,EdkiiNonDiscoverableEhciDeviceGuid EAF59C0E-BD46-413A-9AE9-DD9F6D1A927D,SmbiosDxe EB23F55A-7863-4AC2-8D3D-956535DE0375,EfiIncompatiblePciDeviceSupportProtocolGuid EB338826-681B-4295-B356-2B364C757B09,EfiFtp4ProtocolGuid EB346B97-975F-4A9F-8B22-F8E92BB3D569,EfiSmmCpuProtocolGuid EB5E4685-CA66-4769-B6A2-26068B001326,EfiPciDevErrorSectionGuid EB704011-1402-11D3-8E77-00A0C969723B,EfiMtcGuid EB740091-A494-44D7-8D96-C192F95A6394,OobTx EB97088E-CFDF-49C6-BE4B-D906A5B20E86,EfiAcpiSdtProtocolGuid EB98A90A-42EE-4A36-8DCC-AFA722C9CAB3,AmiTcgPkgTokenSpaceGuid EB9D2D2F-2D88-11D3-9A16-0090273FC14D,EfiMpsTableGuid EB9D2D30-2D88-11D3-9A16-0090273FC14D,EfiAcpi10TableGuid EB9D2D31-2D88-11D3-9A16-0090273FC14D,EfiSmbiosTableGuid EB9D2D32-2D88-11D3-9A16-0090273FC14D,EfiSalSystemTableGuid EBA4E8D2-3858-41EC-A281-2647BA9660D0,EfiDebugPortProtocolGuid EBBE2D1B-1647-4BDA-AB9A-7863E396D41A,EfiActiveBiosProtocolGuid EBC01AF5-07A9-489E-B7CE-DC089E459B2F,EdkiiUfsHostControllerProtocolGuid EBC3AEAD-CC13-49B0-A678-5BED93956955,BasePlatformHookLibNull EBD705FB-FA92-46A7-B32B-7F566D944614,SP805WatchdogDxe EBF342FE-B1D3-4EF8-957C-8048606FF670,SetupBrowserDxe EBF342FE-B1D3-4EF8-957C-8048606FF671,SetupBrowser EBF8ED7C-0DD1-4787-84F1-F48D537DCACF,DriverHealthManagerDxe EBFE50DA-14AE-4E5F-9E21-ADB76B320541,AppleMcaDumpDxe EC20EB79-6C1A-4664-9A0D-D2E4CC16D664,EfiTcp6ServiceBindingProtocolGuid EC2A6C28-2286-44ED-916B-243AB5253546,SLP20MarkerVariableGuid EC2BD1FD-E3B0-429B-ADDF-9657935A3684,AmiSmmNvmeCommunicationGuid EC2BEECA-E84A-445B-869B-F7A73C96F58A,LegacyRegion2Dxe EC2E931B-3281-48A5-8107-DF8A8BED3C5D,PlatformGOPPolicyGuid EC3A978D-7C4E-48FA-9ABE-6AD91CC8F811,EfiKmsProtocolGuid EC63428D-66CA-4BF9-82AE-840F6D5C2305,AmiBoardPciInitProtocolGuid EC761DAF-6B86-41D0-8294-350B90FC9478,SystemCapsulePolicyDxe EC835DD3-FE0F-617B-A621-B350C3E13388,EfiIp6ServiceBindingProtocolGuid EC87D643-EBA4-4BB5-A1E5-3F3E36B20DA9,EfiSetupVariableGuid EC8A3D69-6DDF-4108-9476-7337FC522136,EfiKmsFormatGeneric128Guid EC98FF95-242C-4513-B1BC-69FA24111C58,AcpiDebug ECA27516-306C-4E28-8C94-4E521096695E,DxeSiPolicyProtocolGuid ECA2AE9E-7594-4901-871C-449DA1A11660,I2cDxe ECB54CD9-E5AE-4FDC-A971-E877756068F7,EfiPramConfGuid ECB867AB-8DF4-492D-8150-A7FD1B9B5A75,AmiSmmFlashProtocolGuid ECEBCB00-D9C8-11E4-AF3D-8CDCD426C973,HttpBootDxe ECFD4BCE-4279-40F8-BAF2-DCB79638D41E,AmiTseOemPortingGuid1 ED150714-DF30-407D-B24A-4B742FD5CEA2,DuetConsoleOutConfigGuid ED2DE537-7823-4CB1-B687-85BA9BBEF0B4,RaidRom ED32D533-99E6-4209-9CC0-2D72CDD998A7,EfiSmmVariableProtocolGuid ED443008-3F06-46DB-927E-7AB2F02AF9D9,ApplePciCameraDxe ED52984E-6ED7-4445-9D5D-200C3201F51E,PlatformStage0Pei ED6E0531-F715-4A3D-9B12-C1CA5EF698A2,IntelFsp2PkgTokenSpaceGuid ED888C65-2D84-4595-9086-A15A1F66DE2B,EnableLsiDecoding ED8B5E2B-6622-4D14-9069-9BDEC54C9491,TcgPwdTseHook ED8DCDD5-D037-4B1F-98DD-BDFDAD4DD7DD,BatteryState4 EDA2B104-7A10-4519-B0A1-EBA5C52ACFCE,AmiTseOemPortingVar1Guid EDA39402-F375-4496-92D3-83B43CB8A76A,SmBiosMemory EDADEB9D-DDBA-48BD-9D22-C1C169C8C5C6,CpuMpPei EDBEDF47-6EA3-4512-83C1-70F4769D4BDE,Capsule_A.fvi EDD35E31-07B9-11D2-83A3-00A0C91FADCF,BootObjectAuthorizationParmsetGuid EDF8DA40-AAD1-11DF-A1F4-0002A5D5C51B,PL341Dmc EDFE3817-8661-42B2-A3F6-948FA7AEA20B,DxeThunderbolt EE0BFF80-2B33-4005-8EF1-3F9B23C25136,GetCpuInfoDxe EE0EA811-FBD9-4777-B95A-BA4F71101F74,PeiHeciPpiGuid EE16160A-E8BE-47A6-820A-C6900DB0250A,EfiPeiMpServicesPpiGuid EE1BB93E-54C5-4B17-9496-A20085950561,SmmUsbDispatch2OnSmmUsbDispatchThunk EE1DF00B-B4FE-4762-A330-1E8AB4D9149D,ExtfTable EE30FD26-1524-4CA2-B56D-345830DC9CDB,LenovoFingerprintCp EE4E5898-3914-4259-9D6E-DC7BD79403CF,LzmaCustomDecompressGuid EE685731-CFF3-4EE7-9388-7E63FC5A59B0,PlatformEarlyInit EE8367C0-A1D6-4565-8F89-EF628547B722,IpSecDxe EE89F590-A816-4AC5-B3A9-1BC759B12439,VerifyFwBootGuard EE90D8FC-6181-4B15-83C4-7D1CA0C36E2A,DramTweakerDxe EE993080-5197-4D4E-B63C-F1F7413E33CE,CpuDxe EE9B8D90-C5A6-40A2-BDE2-52558D33CCA1,EfiSmmUsbDispatch2ProtocolGuid EEC25BDC-67F2-4D95-B1D5-F81B2039D11D,BootManagerMenuApp EED5EA31-38E2-463D-B623-2C57702B8A1C,SectionExtractionPei EEE07404-26EE-43C9-9071-4E48008C4691,EfiWheaSupportProtocolGuid EEEE611D-F78F-4FB9-B868-55907F169280,PlatformInitPreMem EEF749C2-C047-4D6E-B1BC-D36EB3A5559C,QuarkVariableLockGuid EF0C99B6-B1D3-4025-9405-BF6A560FE0E0,SmbiosMiscDxe EF0E795C-749A-4B41-B994-7DDC6B594388,UsbOcUpdateDxeNeonCityEPRP EF14FD78-0793-4E2B-AC6D-062847E01791,MfgModeVariableGuid EF17CEE7-267D-4BFD-A257-4A6AB3EE8591,MemorySubClassDxe EF22F8A9-267E-4840-BC32-F0CFDFDFA426,PeiSmmControlPei EF251B71-CEED-484E-82E3-3A1F34F512E2,EfiQuarkSCSocIdTokenSpaceGuid EF33C296-F64C-4146-AD04-347899702C84,SmmUsbLegacyDxe EF3468E0-1B0A-46D7-842C-928E67EFE0B8,X11DPHPeiDriver EF398D58-9DFD-4103-BF94-78C6F4FE712F,EfiPeiResetPpiGuid EF402953-B819-4CC2-A44C-4C9B4CFBC889,AmiTseOemPortingVar2Guid EF598499-B25E-473A-BFAF-E7E57DCE82C4,TpmErrorHobGuid EF6619EE-F77D-4A8C-8693-D60D6AA56702,SetupSecurity EF7BF7D6-F8FF-4A76-8247-C0D0D1CC49C0,EfiSmbiosSlotPopulationGuid EF9AEFE5-2BD3-4031-AF7D-5EFE5ABB9A0D,PeiLockPhysicalPresencePpiGuid EF9FC172-A1B2-4693-B327-6D32FC416042,EfiHiiDatabaseProtocolGuid EFA96432-DE33-4DD2-AEE6-328C33DF777A,EfiHashAlgorithmSha384Guid EFB7F614-BC8B-4DDD-B09A-22079FC1512F,TbtDxe EFCB2FDB-0662-4A59-A5D7-03033EA97CAE,GTSE EFD652CC-0E99-40F0-96C0-E08C089070FC,S3Restore EFEFD093-0D9B-46EB-A856-48350700C908,EfiHiiImageDecoderNameJpegGuid EFFC8F05-B526-4EB5-B36B-8CD889923C0C,LegacyRegion F01BED57-04BC-4F3F-9660-D6F2EA228259,EfiLegacySpiFlashProtocolGuid F0384FFD-8633-452F-9010-F6B7D2EAE2F1,WinNtFirmwareVolumePei F05976EF-83F1-4F3D-8619-F7595D41E538,EfiPrint2ProtocolGuid F099D67F-71AE-4C36-B2A3-DCEB0EB2B7D8,WatchDogTimerDxe F0A30BC7-AF08-4556-99C4-001009C93A44,EfiSecureBootEnableDisableGuid F0ADC5A7-F86A-45A5-9D16-37323FCD77EE,SmcPostMsgHotKey_SMM F0B79D0F-CE2B-D148-9ACE-F204E9393CAA,Tcp4 F0BBFCA0-684E-48B3-BAE2-6C84B89E5339,EfiPchExtendedResetProtocolGuid F0D7222F-FD43-4A5D-B8BF-A259C87AE3B2,FlashDeviceLibDxe F0E6A44F-7195-41C3-AC64-54F202CD0A21,SecureBootConfigDxe F0F6F006-DAB4-44B2-A7A1-0F72EEDCA716,AcpiPlatform F103A5A5-9345-4C3F-B496-DA14F41B6269,PlatformStage1 F10CF621-1502-4130-A860-D300459E2C08,MEbxInvokeDxe F10D6C2A-A2D6-4D96-A212-2B4F6005F389,LenovoSecureBootConfigDxe F1143A53-CBEB-4833-A4DC-0826E063EC08,MeRegionUpdateVolume F122A15C-C10B-4D54-8F48-60F4F06DD1AD,LegacyBiosDxe F12DF3A4-6A2E-44BD-A3F9-2135A04E19E2,AsusEcPeiBiosReady F14F7AC4-F736-4AFE-B01A-129B1FA13A5D,AplPreMemNvram F15B92A8-6B4C-4EA3-A380-2F352AD15417,RealTekLanDriver F16BDBF0-3A61-11DE-8A39-0800200C9A66,PerfTuneDxe F18BA2F3-053D-408D-9E28-96CDA65272A8,FfsIntegrityCheckPei F19B5EA5-7CDF-4CB2-9C37-F1BE08AC588B,BroadcomGigabitEthernetDxe F19E8ED6-442B-4194-AF8E-C91435E36320,SmcTpmProvisionDxe F1A25221-A98B-4189-85F2-0BA226A370DA,FTP_DXE F1EFB523-3D59-4888-BB71-EAA5A96628FA,SecurityStubDxe F1FCD66F-8966-441E-909C-77F211AB9C3E,MERecoveryDxe F2074EA5-B8C9-4EBC-881E-30102260703E,ACPI_FACS_MODIFY F21173FE-DF86-4B8B-AFF9-C7CB77B9C7DD,PeiIchInit F22FC20C-8CF4-45EB-8E06-AD4E50B95DD3,EfiHiiDriverHealthFormsetGuid F24643C2-C622-494E-8A0D-4632579C2D5B,EfiTrEEPhysicalPresenceGuid F2765DEC-6B41-11D5-8E71-00902707B35E,Timer F276BDEC-6C41-21E5-9E71-00A13807B45E,RestoreMtrr F282908A-A6F9-4E50-9D6C-210478F1ED46,FtBbUpdate F282DD45-CA7B-40EC-9618-99381C08F409,OpaPlatCfg F2A128FF-257B-456E-9DE8-63E7C7DCDFAC,OpromStartEndProtocolGuid F2BA331A-8985-11DB-A406-0040D02B1835,EmuVirtualDisksGuid F2BDCC96-8985-11DB-8719-0040D02B1835,EmuPhysicalDisksGuid F2C1819D-10F5-4223-9236-9B4EBF1B9AE7,Logo1394 F2C1910E-F5C9-4B72-B243-6D59096A79F0,EfiI2cSlaveProtocolGuid F2FBD108-8985-11DB-B06A-0040D02B1835,MiscSubclass F2FD1544-9794-4A2C-992E-E5BBCF20E394,EfiSmbios3TableGuid F3009649-36D6-4164-AA05-E72DEEA3722F,EfiCseEndofServicesProtocolGuid F303AF22-6804-494B-A28A-A03BE7D5C742,CsmRt32Asm F30A4091-D9DF-478B-89F2-A266C1917985,OCMR_Setup F30C2915-5782-4E6A-A846-05BABCE7B6A0,EfiI2cAcpiProtocolGuid F3224A5E-17A3-47C2-A38B-481456863C74,AmiSmmNvramUpdateProtocolGuid F328E36C-23B6-4A95-854B-32E19534CD75,SmmCommunicateHeaderGuid F33261E7-23CB-11D5-BD5C-0080C73C8881,FrameworkEfiMpServiceProtocolGuid F3331DE6-4A55-44E4-B767-7453F7A1A021,MicrocodeUpdate F342BE75-274C-433C-A24D-2816F5433D50,VmwSmbios F3552032-8985-11DB-8429-0040D02B1835,RealTimeClock F35F733F-5235-4D7B-83FA-97780CEBCB20,Ping6 F363B225-4D2C-4352-80CD-8EA4280F8DC0,OemEdidFromGop F36FF770-A7E1-42CF-9ED2-56F0F271F44C,EfiManagedNetworkServiceBindingProtocolGuid F3714ADF-E3C3-473B-8FCC-5C34630C45C0,ComputeHmacSha256ProtocolGuid F3749E2C-5139-4E7A-B53A-4F5080B68B8F,PciSerialDxe F3794B60-8985-11DB-8E53-0040D02B1835,Cpu F38C34DE-9C38-438C-9AF6-69F584F17EC0,PoofAnimationState4 F3C9667B-C50C-4E9C-A1F1-78C3B1DDF2C2,LibNetUtil F3D301BB-F4A5-45A8-B0B7-FA999C6237AE,ShellNetwork1HiiGuid F3E4543D-CF35-6CEF-35C4-4FE6344DFC54,EfiFormCallbackProtocolGuid F3ED95DF-828E-41C7-BCA0-16C41965A634,TcgPpiSyncFlagGuid F3FF1468-04BA-4966-9FB2-E4A790054650,EfiCapsuleCrashLogVarGuid F426C7CF-DEB9-0361-4D4E-9F298C1B896E,SavePlatformConfiguration F429C00A-9640-46B3-9544-F8F86A28F30F,PlatformConfigChangeProtocolGuid F42A009D-977F-4F08-9440-BCA5A3BED9AF,AmiExtPciBusProtocolGuid F42F7782-012E-4C12-9956-49F94304F721,EfiConsoleControlProtocolGuid F44875AB-B9FC-4578-A280-AA335B49967C,CmosSmm F44C00EE-1F2C-4A00-AA09-1C9F3E0800A3,EfiArpServiceBindingProtocolGuid F46998C9-DD30-4C64-966C-E17777B2568A,AppleSmc F46EE6F4-4785-43A3-923D-7F786C3C8479,LenovoStartupMenuDxe F4731D79-537E-4505-BD52-C03F9B1F6B89,BaseTimerLibNullTemplate F479E147-A125-11D4-BCFC-0080C73C8881,WinNtBlockIoDxe F495F038-71E6-49DB-9A80-B2E98F7BA718,PeiDbgModuleLocator F4B2C007-94A1-4CD5-A710-F4141FCEBCA0,AmiTseOemTSEVarGuid F4B427BB-BA21-4F16-BC4E-43E416AB619C,EfiArpProtocolGuid F4C5FDD3-B99A-4229-9E0B-DB7A09E67393,LegacyUsbLan F4CCBFB7-F6E0-47FD-9DD4-10A8F150C191,EfiSmmBase2ProtocolGuid F4EA205B-7345-452C-9D62-53BA6F3B8910,FmpAuthenticationLibPkcs7 F4EF9D7A-98C5-4C1A-B4D9-D8D87265BE0C,PeiSdhcPpiGuid F4F63529-281E-4040-A313-C1D6766384BE,AmiHddSecurityProtocolGuid F5042177-1D29-45C5-BA4D-4D0EB2E88575,IT8728SioAcBack F5089266-1AA0-4953-97D8-562F8A73B519,EfiUsbHcProtocolGuid F541796D-A62E-4954-A775-9584F61B9CDD,EfiTcgProtocolGuid F5513824-BA68-0145-AED9-E0A89FAB40B9,DpcDxe F5699255-115A-4F7D-BB0C-658E9A1F42C6,PspfTpmLibNull F57D1C2E-3879-11DF-9118-931B1E0F29B0,VmwLogRuntimeDxe F5883FC5-F8EE-4E44-B386-6021FB320C9B,PchReset2 F59A5549-B879-440C-A1F6-38AF40F2773E,PcieSataController F5AC7057-5650-466E-B692-76A47223EFB0,AcpiSmmPlatform F5D14DB5-2F0C-4611-9DDC-7C182B173A71,ProgressBarEmptyRightEndcap F5E655D9-02A6-46F2-9E76-B8BE8E60AB22,EfiIfrRefreshIdOpGuid F5EF05E4-D538-4774-8F1B-E9773011E038,FspInitDonePpiGuid F5F219D3-7006-4648-AC8D-D61DFB7BC6AD,FontPackageListGuid F5F87B4F-CC3C-408D-89E3-61C59C5407C4,SataConfigGuid F617B358-12CF-414A-A069-60677BDA13B3,DxeIchPlatformPolicyProtocolGuid F617B358-12CF-414A-A069-60677BDA13B4,UsbPolicyGuid F6435590-2402-4E02-99FD-ABDD9DD40A6A,SaPolicyPpiGuid F65354B9-1FF0-46D7-A5F7-0926CB238048,MonoStatusCodePei F655D0B3-615D-4022-9645-0D1F2E9DF78A,CMFCOEMSwSmi F65ABA32-76FD-49C6-A1C4-CD7FADF96659,AmiReportFvLibCompatibility F66447D4-75A6-463E-A819-077F2DDA05E9,EfiKmsFormatRsasha12048Guid F6697AC4-A776-4EE1-B643-1FEFF2B615BB,IncompatiblePciDeviceSupportDxe F672AE85-3769-4FB8-A5A0-70B38FB0A7C4,DxeTimerLibEsal F6937495-1F44-4A8A-8A1B-5A669F9396F6,DevConsole F6994CBA-2351-4EBC-A2DA-20BAC2FE2CF3,SmmPciLibPciRootBridgeIo F6A11F0E-0CBE-440C-BD85-49FB595686EA,LegacyUcrDxe F6A59595-BB9F-415B-A7F3-DC7C09387BE6,SmBusMemoryDown F6BEC3FE-88FB-11E3-AE84-E73B77561C35,FastbootTransportUsbDxe F6D35FBB-63EA-4B25-81A5-5E62B4886292,PlatformSetup F6EE6DBB-D67F-4EA0-8B96-6A71B19D84AD,EdkiiStatusCodeDataTypeVariableGuid F706D0C8-F6FC-4F7A-AC98-96BA5CC43AAA,SandyBridgeGopDriver F7196B8E-472B-4C1D-9AB9-A69A8992F46C,LenovoVariableStoreSmmRuntimeDxe F74D20EE-37E7-48FC-97F7-9B1047749C69,LogoDxe F75BD2CD-F473-4BA1-89B3-1E69EFC8BA70,ASUS_HW_FastBootDXE F76E0A70-B5ED-4C38-AC9A-E5F54BF16E34,DriverHealthFormSetGuid F7731B4C-58A2-4DF4-8980-5645D39ECE58,PowerMgmtDxe F7763316-8C04-41D8-A87D-45B73C13C43C,BltLibSample F77CB08E-6682-4DF7-82A3-BBBB52704C1F,AppleNetLoadFileDxe F78153D0-870D-4EEE-A684-741499C9A8CE,EistDxe F78285FD-121E-49F4-9716-44E307656586,Python2710 F7A1F48E-0F6A-4F12-A74D-ED6F5B6B00F2,OpromUpdateDxeLightningRidgeEXECB4 F7AD60F8-EFA8-44A3-9113-231F399EB4C7,EfiKmsFormatMdc2128Guid F7B0E92D-AB47-4A1D-8BDE-41E529EB5A70,UnlockPswd F7CA7568-5A09-4D2C-8A9B-758468592AE2,AmiNvramControlProtocolGuid F7D22BCA-1BCA-5591-CC8B-1CA98F2890FE,AmiCpuS3Pei F7D6D25E-6243-4D5C-9BA5-C2DC48F003B0,AmiFlashLibPei F7D9FD14-9335-4389-80C5-334D6ABFCCED,ArmVirtPrePiUniCoreRelocatable F7ECF277-CD66-4DE8-A425-1D9F899492A7,ASUSFTM F7FDE4A6-294C-493C-B50F-9734553BB757,CapsuleX64 F80697E9-7FD6-4665-8646-88E33EF71DFC,SecurityStubDxe F80E66A2-1A2C-415B-9B9C-066C1F04B626,TbtDxe F821665C-0137-4F34-A7A1-57A0BD256D62,IntelPchLegacyInterrupt F84CFFF4-511E-41C8-B829-519F5152F444,LegacyBiosPlatformDxe F84D8725-5ADF-48D2-8819-1B0331AEB719,DRYPEI F8626165-6CEB-924A-BAFC-F13AB9D65728,EmuSystemConfigGuid F866226A-EAA5-4F5A-A90A-6CFBA57C588E,SmmPerformanceProtocolGuid F866AD0F-1FBB-4D52-813D-7EB95E2F19D4,menu_mid_right F8673422-16DE-449C-8728-AB0361DBF9F0,LegacyInterruptHookDxe F88BB993-9230-4CDF-916A-7A2D3BDEE690,AppleStartupManagerPolicyDxe F894643D-C449-42D1-8EA8-85BDD8C65BDE,EfiPeiMemoryDiscoveredPpiGuid F8BFF014-18FB-4EF9-B10C-AE22738DBEED,DxePlatformSeCPolicyGuid F8C6FEDE-EE15-47ED-99A4-60798A3C7DC4,StaticSkuDataDxeLightningRidgeEXECB3 F8E21975-0899-4F58-A4BE-5525A9C6D77A,EfiHobMemoryAllocModuleGuid F8E5058C-CCB6-4714-B220-3F7E3A640BD1,EfiUserCredentialClassPasswordGuid F9229745-981C-4E07-9FC6-789545CB8818,AcpiSupportDxe F9383ECA-8566-491E-8533-ED7D2EFEA80D,SmcNVDIMMPeiDriver F94700A3-F49F-4CD2-BF25-19E280B72E3B,SystemUsbDatabaseDxe F95A7CCC-4C55-4426-A7B4-DC8961950BAE,ShellLevel2HiiGuid F9D88642-0737-49BC-81B5-6889CD57D9EA,SmbiosDxe F9F1020C-CC31-4203-8850-EEC07A52A5B5,SecPchLibFsp F9F5318B-D0ED-4CA8-BE91-1881CEB57F1B,ACPIRAM F9FA662B-8361-4DF0-A419-781EB024B2B7,LenovoTpmProvisionDxe FA177FF7-1FC7-458D-A358-D9D62AE61CEC,PeimEntryPoint FA20568B-548B-4B2B-81EF-1BA08D4A3CEC,BootScriptExecutorDxe FA3AD693-D58A-4619-960B-8EE85C914870,PeiPciLibPciCfg2 FA4585F1-303B-4725-80E4-BB42BBD0249C,SupportURL FA4974FC-AF1D-4E5D-BDC5-DACD6D27BAEC,AmiNvramMainRomAreaGuid FA528024-59A6-4689-BEA0-B555D87D7DBE,FpgaFvDataLibDxe FA68BD3F-8AD7-4D41-8CD9-2E72FB387AD7,SctMilestoneTaskDxe FA7E8D10-1312-4B98-9A3B-3B5B13A25DB0,PsmiHandlerBufferGuid FA920010-6785-4941-B6EC-498C579F160A,VirtioDeviceProtocolGuid FAB5D4F4-83C0-4AAF-8480-442D11DF6CEA,VirtioScsiDxe FAB7E9E1-39DD-4F2B-8408-E20E906CB6DE,HdBootDevicePathVariablGuid FABDD96B-2DDD-4747-9612-F9E777C84A38,SetupUtility FAC2EFAD-8511-4E34-9CAE-16A257BA9488,Capsule FACFB110-7BFD-4EFB-873E-88B6B23B97EA,PhDefEfiVar FAD7933A-6C21-4234-A434-0A8A0D2B0781,EfiIsaHcServiceBindingProtocolGuid FAE06C19-0F1C-47D3-832D-E3B9C25AD020,aDefaultPEI FAF79E9F-4D40-4F02-8AC9-4B5512708F7F,BiosGuardCpuPolicyOverride FB045DB2-598E-485A-BA30-5D7B1B1BD54D,AOAC FB142B99-DF57-46CB-BC69-0BF858A734F9,SerialOverLan FB15CB3F-D373-45A1-B9B1-0079D4E9D6B2,menu_seperator FB3D20EE-CB5D-45EE-BBAE-C5AAA9C0FDFA,ChipsetSvcPeiBB FB547927-DAEC-4884-A12E-94109FEDF18C,gear3 FB62F7F0-5433-11E4-B810-402CF41D8A90,SecureEraseDxe FB6D36A2-EF7D-4B74-99AC-80B31F6BE9B1,WheaErrorInj FB6D9542-612D-4F45-872F-5CFF52E93DCF,EfiPeiRecoveryModulePpiGuid FB74A690-DE1A-4BF4-97C0-170B3535FC98,PciThunderbolt FB76E42B-EA77-48F3-A61D-208FF0535F92,TrEEPpVendorLibNull FB85101D-F422-4C8C-82C4-EF4DCD05E1BF,SmcSmBios FB925AC7-192A-9567-8586-7C6F5F710607,Cryptest FBA14D8B-BE6F-0361-93E8-4CDF18E19EDE,ICCPolicy FBA34BC8-4E37-451D-A7FF-5469F52064C6,UUDriver FBB4A01B-947E-4D82-B27D-1E207C070053,BaseCacheAsRamLibNull FBF95065-427F-47B3-8077-D13C60710998,dbVar FC06B535-5E1F-4562-9F25-0A3B9ADB63C3,EfiIa32X64ErrorTypeTlbCheckGuid FC120ED3-40E1-46DC-8C9C-AAE3CA139ACF,BasePerformanceLibNull FC1B7640-3466-4C06-B1CC-1C935394B5C2,PchSerialGpio FC1BCDB0-7D31-49AA-936A-A4600D9DD083,EfiCrc32GuidedSectionExtractionGuid FC1D4706-88FB-42B0-98B0-A4B2E607EBAA,LibErr FC4285A7-EBB5-45D2-8541-EBA3318FC2C2,UsbOcUpdateDxeLightningRidgeEXECB1 FC510EE7-FFDC-11D4-BD41-0080C73C8881,AprioriDxe FC53F573-17DD-454C-B067-ECB10B7D7FC7,EfiHeciSmmProtocolGuid FC5C7020-1A48-4198-9BE2-EAD5ABC8CF2F,BdsDxe FC63ED62-949D-4FB0-B754-D558A6367C56,EzFlashDxe FC73690C-8D4A-4F8C-B7F5-BA241F316E28,CpuInitDxe FC740D58-59BA-429B-99EF-627051737B76,ImageDecoder FC788727-C2D0-469C-BD03-5AEA03323C67,GlobeMask FC90EB7A-3E0A-483C-A26C-484D36593FF4,AcpiPlatform FCABE6A7-7953-4A84-B7EC-D29E89B62E87,EmbeddedMonotonicCounter FCCCE259-07E1-417A-A755-E0F2CF39295E,CpuInitDxe FCD337AB-B1D3-4EF8-957C-8048606FF670,HiiDatabaseDxe FCD6562A-253A-40D7-87DE-28CFF25898C6,InsideHT FCDCB9C2-7987-47DF-A9A7-BE3DBA52D50C,BootOptionPolicy FCF94301-9763-4A64-AA84-7892C4712367,IpSecDxe FD023012-19F4-4235-ADCF-D924DBE246FE,StaticSkuDataDxeLightningRidgeEXECB1 FD0C65EB-0405-4CD2-8AEE-F400EF13BAC2,NtPeiLoadFilePpiGuid FD0F4478-0EFD-461D-BA2D-E58C45FD5F5E,EfiGetPcdInfoProtocolGuid FD2340D0-3DAB-4349-A6C7-3B4F12B48EAE,EfiTlsCaCertificateGuid FD236AE7-0791-48C4-B29E-29BDEEE1A811,SaInitPeim FD236AE7-0791-48C4-B29E-29BDEEE1A838,PchInitPeim FD27652D-F758-4EFC-B1A9-283EFE51F4E9,MeFwCapsulePei FD301BA4-5E62-4679-A06F-E09AABDD2A91,EfiTdtOperationProtocolGuid FD36FEE3-7B33-4C9E-836E-9AA26A9E3149,BiosAcm_Dale FD3B7E55-FA7B-4E07-AE1D-208B81FB0BAD,FvbRuntimeDxe FD3F690E-B4B0-4D68-89DB-19A1A3318F90,MICROCODE FD44820B-F1AB-41C0-AE4E-0C55556EB9BD,SMBiosFlashData FD5FBE54-8C35-B345-8A0F-7AC8A5FD0521,EmuSnpProtocolGuid FD72B1B5-5391-4C6A-BDFD-9F59A7880A21,PlatformRelatedInfoGuid FD76FF8E-665F-4AFC-AF75-724EF5A569E5,UcOnUc2Thunk FD93F9E1-3C73-46E0-B7B8-2BBA3F718F6C,TCGSmm FDA14FA3-AFFC-469A-B7BB-34BCDD4AC096,PlatformIde FDC50ED1-ACB8-8048-8735-8098B7A13E5E,ApplePowerState FDFF263D-5F68-4591-87BA-B768F445A9AF,Tcg2Dxe FE3542FE-C1D3-4EF8-657C-8048606FF670,DriverSampleDxe FE3542FE-C1D3-4EF8-657C-8048606FF671,DriverSample FE4622E7-180F-4383-B6AF-87A18F049B4A,FirmwareVolumesInstalledPpiGuid FE5CEA76-4F72-49E8-986F-2CD899DFFE5D,FaultTolerantWriteDxe FE612B72-203C-47B1-8560-A66D946EB371,setupdata FE61BB5F-1B67-4C24-B346-73DB42E873E5,ArmHwDxe FE6F8ACD-55A6-4C6B-B448-64E659DE94B3,LegacyRegion2 FEAA2E2B-53AC-4D5E-AE10-1EFD5DA4A2BA,BeagleBoardPciEmulation FED6583D-2418-4760-AC96-B5E18F0A6326,SmmCorePlatformHookLibNull FEDD6305-E2D7-4ED5-9FAA-DA080E336C22,PeiUsb2HostControllerPpiGuid FEDE0A1B-BCA2-4A9F-BB2B-D9FD7DEC2E9F,StatusCodeRuntimeDxe FEDF8E0C-E147-11E3-9903-B8E8562CBAFA,EfiBootManagerPolicyProtocolGuid FF052503-1AF9-4AEB-83C4-C2D4CEB10CA3,PhoenixEfiSmmSwSmiProtocolGuid FF084F98-B1D2-49F8-AA57-E7EEE7C48A12,VbtMipiPanel3Guid FF0C8745-3270-4439-B74F-3E45F8C77064,IntelGopDriver FF11E702-8923-47CC-AD30-D9E0E240DD10,AAFTblDXE FF259F16-18D1-4298-8DD2-BD87FF2894A9,PchResetPeim FF3E5307-9FD0-48C9-85F1-8AD56C701E01,EfiCertSha384Guid FF456B9C-0DC7-4682-9E92-0DE84B6E4067,PeiSmmControl FF478412-38C3-4770-85F6-5D076C62125F,TargetDiskModeUI FF917E22-A228-448D-BDAA-68EFCCDDA5D3,TxtDxe FFBD9AD2-F1DB-4F92-A649-EB9EEDEA86B5,AmiHddSmartProtocolGuid FFE06BDD-6107-46A6-7BB2-5A9C7EC5275C,EfiAcpiTableProtocolGuid FFF12B8D-7696-4C8B-A985-2747075B4F50,EfiSystemNvDataFvGuid UEFITool-A66/common/intel_fit.h000077500000000000000000000153301442134156300164240ustar00rootroot00000000000000/* intel_fit.h Copyright (c) 2015, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHWARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef INTEL_FIT_H #define INTEL_FIT_H #include "basetypes.h" #include "ubytearray.h" // Make sure we use right packing rules #pragma pack(push, 1) // Memory address of a pointer to FIT, 40h back from the end of flash chip #define INTEL_FIT_POINTER_OFFSET 0x40 // Entry types // https://cdrdv2-public.intel.com/599500/Firmware-Interface-Table-BIOS-Specification-r1p4.pdf #define INTEL_FIT_TYPE_HEADER 0x00 #define INTEL_FIT_TYPE_MICROCODE 0x01 #define INTEL_FIT_TYPE_STARTUP_AC_MODULE 0x02 #define INTEL_FIT_TYPE_DIAG_AC_MODULE 0x03 #define INTEL_FIT_TYPE_PLATFORM_BOOT_POLICY 0x04 //#define INTEL_FIT_TYPE_INTEL_RESERVED_05 0x05 #define INTEL_FIT_TYPE_FIT_RESET_STATE 0x06 #define INTEL_FIT_TYPE_BIOS_STARTUP_MODULE 0x07 #define INTEL_FIT_TYPE_TPM_POLICY 0x08 #define INTEL_FIT_TYPE_BIOS_POLICY 0x09 #define INTEL_FIT_TYPE_TXT_POLICY 0x0A #define INTEL_FIT_TYPE_BOOT_GUARD_KEY_MANIFEST 0x0B #define INTEL_FIT_TYPE_BOOT_GUARD_BOOT_POLICY 0x0C //#define INTEL_FIT_TYPE_INTEL_RESERVED_0D 0x0D //#define INTEL_FIT_TYPE_INTEL_RESERVED_0E 0x0E //#define INTEL_FIT_TYPE_INTEL_RESERVED_0F 0x0F #define INTEL_FIT_TYPE_CSE_SECURE_BOOT 0x10 //#define INTEL_FIT_TYPE_INTEL_RESERVED_11 0x11 //... //#define INTEL_FIT_TYPE_INTEL_RESERVED_19 0x19 #define INTEL_FIT_TYPE_VAB_PROVISIONING_TABLE 0x1A #define INTEL_FIT_TYPE_VAB_KEY_MANIFEST 0x1B #define INTEL_FIT_TYPE_VAB_IMAGE_MANIFEST 0x1C #define INTEL_FIT_TYPE_VAB_IMAGE_HASH_DESCRIPTORS 0x1D //#define INTEL_FIT_TYPE_INTEL_RESERVED_1E 0x1E //... //#define INTEL_FIT_TYPE_INTEL_RESERVED_2B 0x2B #define INTEL_FIT_TYPE_SACM_DEBUG_RECORD 0x2C #define INTEL_FIT_TYPE_ACM_FEATURE_POLICY 0x2D #define INTEL_FIT_TYPE_SCRTM_ERROR_RECORD 0x2E #define INTEL_FIT_TYPE_JMP_DEBUG_POLICY 0x2F #define INTEL_FIT_TYPE_OEM_RESERVED_30 0x30 //... #define INTEL_FIT_TYPE_OEM_RESERVED_70 0x70 //#define INTEL_FIT_TYPE_INTEL_RESERVED_71 0x71 //... //#define INTEL_FIT_TYPE_INTEL_RESERVED_7E 0x7E #define INTEL_FIT_TYPE_EMPTY 0x7F typedef struct INTEL_FIT_ENTRY_ { UINT64 Address; // Base address of the component, must be 16-byte aligned UINT32 Size : 24; // Size of the component, in multiple of 16 bytes UINT32 Reserved : 8; // Reserved, must be set to zero UINT16 Version; // BCD, minor in lower byte, major in upper byte UINT8 Type : 7; // FIT entries must be aranged in ascending order of Type UINT8 ChecksumValid : 1;// Checksum must be ignored if this bit is not set UINT8 Checksum; // checksum8 of all the bytes in the component and this field must add to zero } INTEL_FIT_ENTRY; // // FIT Header (0x00) // // Can be exactly one entry of this type, the first one. // If ChecksumValid bit is set, the whole FIT table must checksum8 to zero. // Version must be 0x0100 #define INTEL_FIT_SIGNATURE 0x2020205F5449465FULL // '_FIT_ ' // // Microcode (0x01) // // At least one entry is required, more is optional // Each entry must point to a valid base address // Microcode slots can be empty (first 4 bytes at the base address are FF FF FF FF) // Base address must be aligned to 16 bytes // The item at the base address must not be compressed/encoded/encrypted // ChecksumValid bit must be 0 // Size is not used, should be set to 0 // // Startup Authenticated Code Module (0x02) // // Optional, required for AC boot and BootGuard // Address must point to a valid base address // Points to the first byte of ACM header // One MTRR base/limit pair is used to map Startup ACM, so // MTRR_Base must be a multiple of MTRR_Size, the can be found by the following formula // MTTR_Size = 2^(ceil(log2(Startup_ACM_Size))), i.e. the next integer that's a full power of 2 to Startup_ACM_Size // The whole area of [MTRR_Base; MTRR_Base + MTRR_Size) is named // Authenticated Code Execution Area (ACEA) and should not contain any code or data that is not the Startup ACM itself // ChecksumValid bit must be 0 // Size is not used, should be set to 0 // Version must be 0x0100 #define INTEL_ACM_HARDCODED_RSA_EXPONENT 0x10001 // // TPM Boot Policy (0x08) // // Optional, used for legacy TXT FIT boot, if used, can be only one // Address entry is INTEL_FIT_POLICY_PTR.IndexIo if Version is 0, // or INTEL_FIT_INDEX_IO_ADDRESS.FlatMemoryAddress if Version is 1 // Bit 0 at the pointed address holds the TPM policy, 0 - TPM disabled, 1 - TPM enabled // ChecksumValid bit must be 0 // Size is not used, should be set to 0 typedef struct INTEL_FIT_INDEX_IO_ADDRESS_ { UINT16 IndexRegisterAddress; UINT16 DataRegisterAddress; UINT8 AccessWidthInBytes; // 1 => 1-byte accesses, 2 => 2-byte UINT8 BitPosition; // Bit number, 15 => Bit15 UINT16 Index; } INTEL_FIT_INDEX_IO_ADDRESS; typedef union INTEL_FIT_POLICY_PTR_ { UINT64 FlatMemoryAddress; INTEL_FIT_INDEX_IO_ADDRESS IndexIo; } INTEL_FIT_POLICY_PTR; #define INTEL_FIT_POLICY_VERSION_INDEX_IO 0 #define INTEL_FIT_POLICY_VERSION_FLAT_MEMORY_ADDRESS 1 #define INTEL_FIT_POLICY_DISABLED 1 #define INTEL_FIT_POLICY_ENABLED 1 // // CSE SecureBoot (0x10) // // Optional, can be multiple, order is not important // If present, BootGuardKeyManifest and BootGuardBootPolicy should also be present // Reserved field further determines the subtype of this entry // ChecksumValid bit must be 0 // Version must be 0x0100 #define INTEL_FIT_CSE_SECURE_BOOT_RESERVED 0 #define INTEL_FIT_CSE_SECURE_BOOT_KEY_HASH 1 #define INTEL_FIT_CSE_SECURE_BOOT_CSE_MEASUREMENT_HASH 2 #define INTEL_FIT_CSE_SECURE_BOOT_BOOT_POLICY 3 #define INTEL_FIT_CSE_SECURE_BOOT_OTHER_BOOT_POLICY 4 #define INTEL_FIT_CSE_SECURE_BOOT_OEM_SMIP 5 #define INTEL_FIT_CSE_SECURE_BOOT_MRC_TRAINING_DATA 6 #define INTEL_FIT_CSE_SECURE_BOOT_IBBL_HASH 7 #define INTEL_FIT_CSE_SECURE_BOOT_IBB_HASH 8 #define INTEL_FIT_CSE_SECURE_BOOT_OEM_ID 9 #define INTEL_FIT_CSE_SECURE_BOOT_OEM_SKU_ID 10 #define INTEL_FIT_CSE_SECURE_BOOT_BOOT_DEVICE_INDICATOR 11 // 1 => SPI, 2 => eMMC, 3 => UFS, rest => reserved #define INTEL_FIT_CSE_SECURE_BOOT_FIT_PATCH_MANIFEST 12 #define INTEL_FIT_CSE_SECURE_BOOT_AC_MODULE_MANIFEST 13 #pragma pack(pop) #endif // INTEL_FIT_H UEFITool-A66/common/intel_microcode.h000066400000000000000000000072031442134156300176030ustar00rootroot00000000000000/* intel_microcode.h Copyright (c) 2022, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHWARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef INTEL_MICROCODE_H #define INTEL_MICROCODE_H #include "basetypes.h" #include "ubytearray.h" // Make sure we use right packing rules #pragma pack(push, 1) // This structure is described in Section 9.11.1 of the Intel Software Developer manual Volume 3A Part 1 typedef struct INTEL_MICROCODE_HEADER_ { UINT32 HeaderVersion; // 0x00000001 UINT32 UpdateRevision; UINT16 DateYear; // BCD UINT8 DateDay; // BCD UINT8 DateMonth; // BCD UINT32 ProcessorSignature; UINT32 Checksum; // Checksum of Update Data and Header. Used to verify the integrity of the update header and data. // Checksum is correct when the summation of all the DWORDs (including the extended Processor Signature Table) // that comprise the microcode update result in 00000000H. UINT32 LoaderRevision; // 0x00000001 UINT8 ProcessorFlags; UINT8 ProcessorFlagsReserved[3]; // Zeroes UINT32 DataSize; // Specifies the size of the encrypted data in bytes, and must be a multiple of DWORDs. // If this value is 00000000H, then the microcode update encrypted data is 2000 bytes (or 500 DWORDs). // Sane values are less than 0x1000000 UINT32 TotalSize; // Specifies the total size of the microcode update in bytes. // It is the summation of the header size, the encrypted data size and the size of the optional extended signature table. // This value is always a multiple of 1024 according to the spec, but Intel already breached it several times. // Sane values are less than 0x1000000 UINT8 Reserved[12]; // Zeroes } INTEL_MICROCODE_HEADER; #define INTEL_MICROCODE_REAL_DATA_SIZE_ON_ZERO 2000 typedef struct INTEL_MICROCODE_EXTENDED_HEADER_ { UINT32 EntryCount; UINT32 Checksum; // Checksum of extended processor signature table. // Used to verify the integrity of the extended processor signature table. // Checksum is correct when the summation of the DWORDs that comprise the extended processor signature table results in 00000000H. UINT8 Reserved[12]; // INTEL_MICROCODE_EXTENDED_HEADER_ENTRY Entries[EntryCount]; } INTEL_MICROCODE_EXTENDED_HEADER; typedef struct INTEL_MICROCODE_EXTENDED_HEADER_ENTRY_ { UINT32 ProcessorSignature; UINT32 ProcessorFlags; UINT32 Checksum; // To calculate the Checksum, substitute the Primary Processor Signature entry and the Processor Flags entry with the corresponding Extended Patch entry. // Delete the Extended Processor Signature Table entries. // Checksum is correct when the summation of all DWORDs that comprise the created Extended Processor Patch results in 00000000H. } INTEL_MICROCODE_EXTENDED_HEADER_ENTRY; #define INTEL_MICROCODE_HEADER_VERSION_1 0x00000001 #pragma pack(pop) #endif // INTEL_MICROCODE_H UEFITool-A66/common/kaitai/000077500000000000000000000000001442134156300155335ustar00rootroot00000000000000UEFITool-A66/common/kaitai/custom_decoder.h000066400000000000000000000003541442134156300207050ustar00rootroot00000000000000#ifndef KAITAI_CUSTOM_DECODER_H #define KAITAI_CUSTOM_DECODER_H #include namespace kaitai { class custom_decoder { public: virtual ~custom_decoder() {}; virtual std::string decode(std::string src) = 0; }; } #endif UEFITool-A66/common/kaitai/exceptions.h000066400000000000000000000121421442134156300200650ustar00rootroot00000000000000#ifndef KAITAI_EXCEPTIONS_H #define KAITAI_EXCEPTIONS_H #include "kaitaistream.h" #include #include // We need to use "noexcept" in virtual destructor of our exceptions // subclasses. Different compilers have different ideas on how to // achieve that: C++98 compilers prefer `throw()`, C++11 and later // use `noexcept`. We define KS_NOEXCEPT macro for that. #if __cplusplus >= 201103L || (defined(_MSC_VER) && _MSC_VER >= 1900) #define KS_NOEXCEPT noexcept #else #define KS_NOEXCEPT throw() #endif namespace kaitai { /** * Common ancestor for all error originating from Kaitai Struct usage. * Stores KSY source path, pointing to an element supposedly guilty of * an error. */ class kstruct_error: public std::runtime_error { public: kstruct_error(const std::string what, const std::string src_path): std::runtime_error(src_path + ": " + what), m_src_path(src_path) { } virtual ~kstruct_error() KS_NOEXCEPT {}; protected: const std::string m_src_path; }; /** * Error that occurs when default endianness should be decided with * a switch, but nothing matches (although using endianness expression * implies that there should be some positive result). */ class undecided_endianness_error: public kstruct_error { public: undecided_endianness_error(const std::string src_path): kstruct_error("unable to decide on endianness for a type", src_path) { } virtual ~undecided_endianness_error() KS_NOEXCEPT {}; }; /** * Common ancestor for all validation failures. Stores pointer to * KaitaiStream IO object which was involved in an error. */ class validation_failed_error: public kstruct_error { public: validation_failed_error(const std::string what, kstream* io, const std::string src_path): kstruct_error("at pos " + kstream::to_string(io->pos()) + ": validation failed: " + what, src_path), m_io(io) { } // "at pos #{io.pos}: validation failed: #{msg}" virtual ~validation_failed_error() KS_NOEXCEPT {}; protected: kstream* m_io; }; /** * Signals validation failure: we required "actual" value to be equal to * "expected", but it turned out that it's not. */ template class validation_not_equal_error: public validation_failed_error { public: validation_not_equal_error(const T& expected, const T& actual, kstream* io, const std::string src_path): validation_failed_error("not equal", io, src_path), m_expected(expected), m_actual(actual) { } // "not equal, expected #{expected.inspect}, but got #{actual.inspect}" virtual ~validation_not_equal_error() KS_NOEXCEPT {}; protected: const T& m_expected; const T& m_actual; }; /** * Signals validation failure: we required "actual" value to be greater * than or equal to "min", but it turned out that it's not. */ template class validation_less_than_error: public validation_failed_error { public: validation_less_than_error(const T& min, const T& actual, kstream* io, const std::string src_path): validation_failed_error("not in range", io, src_path), m_min(min), m_actual(actual) { } // "not in range, min #{min.inspect}, but got #{actual.inspect}" virtual ~validation_less_than_error() KS_NOEXCEPT {}; protected: const T& m_min; const T& m_actual; }; /** * Signals validation failure: we required "actual" value to be less * than or equal to "max", but it turned out that it's not. */ template class validation_greater_than_error: public validation_failed_error { public: validation_greater_than_error(const T& max, const T& actual, kstream* io, const std::string src_path): validation_failed_error("not in range", io, src_path), m_max(max), m_actual(actual) { } // "not in range, max #{max.inspect}, but got #{actual.inspect}" virtual ~validation_greater_than_error() KS_NOEXCEPT {}; protected: const T& m_max; const T& m_actual; }; /** * Signals validation failure: we required "actual" value to be from * the list, but it turned out that it's not. */ template class validation_not_any_of_error: public validation_failed_error { public: validation_not_any_of_error(const T& actual, kstream* io, const std::string src_path): validation_failed_error("not any of the list", io, src_path), m_actual(actual) { } // "not any of the list, got #{actual.inspect}" virtual ~validation_not_any_of_error() KS_NOEXCEPT {}; protected: const T& m_actual; }; /** * Signals validation failure: we required "actual" value to match * the expression, but it turned out that it doesn't. */ template class validation_expr_error: public validation_failed_error { public: validation_expr_error(const T& actual, kstream* io, const std::string src_path): validation_failed_error("not matching the expression", io, src_path), m_actual(actual) { } // "not matching the expression, got #{actual.inspect}" virtual ~validation_expr_error() KS_NOEXCEPT {}; protected: const T& m_actual; }; } #endif UEFITool-A66/common/kaitai/kaitaistream.cpp000066400000000000000000000466041442134156300207270ustar00rootroot00000000000000#include "kaitaistream.h" #define KS_STR_ENCODING_NONE // macOS #if defined(__APPLE__) #include #include #define bswap_16(x) OSSwapInt16(x) #define bswap_32(x) OSSwapInt32(x) #define bswap_64(x) OSSwapInt64(x) #define __BYTE_ORDER BYTE_ORDER #define __BIG_ENDIAN BIG_ENDIAN #define __LITTLE_ENDIAN LITTLE_ENDIAN // Windows with MS or MinGW compilers #elif defined(_MSC_VER) || defined(__MINGW32__) #include #define __LITTLE_ENDIAN 1234 #define __BIG_ENDIAN 4321 #define __BYTE_ORDER __LITTLE_ENDIAN #define bswap_16(x) _byteswap_ushort(x) #define bswap_32(x) _byteswap_ulong(x) #define bswap_64(x) _byteswap_uint64(x) // BSD #elif defined(__FreeBSD__) || defined(__NetBSD__) || defined(__DragonFly__) #include #define bswap_16(x) bswap16(x) #define bswap_32(x) bswap32(x) #define bswap_64(x) bswap64(x) #elif defined(__OpenBSD__) #include #define bswap_16(x) swap16(x) #define bswap_32(x) swap32(x) #define bswap_64(x) swap64(x) // Everything else #else #include #include #endif #include #include #include kaitai::kstream::kstream(std::istream *io) { m_io = io; init(); } kaitai::kstream::kstream(const std::string &data) : m_io_str(data) { m_io = &m_io_str; init(); } void kaitai::kstream::init() { exceptions_enable(); align_to_byte(); } void kaitai::kstream::close() { // m_io->close(); } void kaitai::kstream::exceptions_enable() const { m_io->exceptions( std::istream::eofbit | std::istream::failbit | std::istream::badbit ); } // ======================================================================== // Stream positioning // ======================================================================== bool kaitai::kstream::is_eof() const { if (m_bits_left > 0) { return false; } char t; m_io->exceptions(std::istream::badbit); m_io->get(t); if (m_io->eof()) { m_io->clear(); exceptions_enable(); return true; } else { m_io->unget(); exceptions_enable(); return false; } } void kaitai::kstream::seek(uint64_t pos) { m_io->seekg(pos); } uint64_t kaitai::kstream::pos() { return m_io->tellg(); } uint64_t kaitai::kstream::size() { std::iostream::pos_type cur_pos = m_io->tellg(); m_io->seekg(0, std::ios::end); std::iostream::pos_type len = m_io->tellg(); m_io->seekg(cur_pos); return len; } // ======================================================================== // Integer numbers // ======================================================================== // ------------------------------------------------------------------------ // Signed // ------------------------------------------------------------------------ int8_t kaitai::kstream::read_s1() { char t; m_io->get(t); return t; } // ........................................................................ // Big-endian // ........................................................................ int16_t kaitai::kstream::read_s2be() { int16_t t; m_io->read(reinterpret_cast(&t), 2); #if __BYTE_ORDER == __LITTLE_ENDIAN t = bswap_16(t); #endif return t; } int32_t kaitai::kstream::read_s4be() { int32_t t; m_io->read(reinterpret_cast(&t), 4); #if __BYTE_ORDER == __LITTLE_ENDIAN t = bswap_32(t); #endif return t; } int64_t kaitai::kstream::read_s8be() { int64_t t; m_io->read(reinterpret_cast(&t), 8); #if __BYTE_ORDER == __LITTLE_ENDIAN t = bswap_64(t); #endif return t; } // ........................................................................ // Little-endian // ........................................................................ int16_t kaitai::kstream::read_s2le() { int16_t t; m_io->read(reinterpret_cast(&t), 2); #if __BYTE_ORDER == __BIG_ENDIAN t = bswap_16(t); #endif return t; } int32_t kaitai::kstream::read_s4le() { int32_t t; m_io->read(reinterpret_cast(&t), 4); #if __BYTE_ORDER == __BIG_ENDIAN t = bswap_32(t); #endif return t; } int64_t kaitai::kstream::read_s8le() { int64_t t; m_io->read(reinterpret_cast(&t), 8); #if __BYTE_ORDER == __BIG_ENDIAN t = bswap_64(t); #endif return t; } // ------------------------------------------------------------------------ // Unsigned // ------------------------------------------------------------------------ uint8_t kaitai::kstream::read_u1() { char t; m_io->get(t); return t; } // ........................................................................ // Big-endian // ........................................................................ uint16_t kaitai::kstream::read_u2be() { uint16_t t; m_io->read(reinterpret_cast(&t), 2); #if __BYTE_ORDER == __LITTLE_ENDIAN t = bswap_16(t); #endif return t; } uint32_t kaitai::kstream::read_u4be() { uint32_t t; m_io->read(reinterpret_cast(&t), 4); #if __BYTE_ORDER == __LITTLE_ENDIAN t = bswap_32(t); #endif return t; } uint64_t kaitai::kstream::read_u8be() { uint64_t t; m_io->read(reinterpret_cast(&t), 8); #if __BYTE_ORDER == __LITTLE_ENDIAN t = bswap_64(t); #endif return t; } // ........................................................................ // Little-endian // ........................................................................ uint16_t kaitai::kstream::read_u2le() { uint16_t t; m_io->read(reinterpret_cast(&t), 2); #if __BYTE_ORDER == __BIG_ENDIAN t = bswap_16(t); #endif return t; } uint32_t kaitai::kstream::read_u4le() { uint32_t t; m_io->read(reinterpret_cast(&t), 4); #if __BYTE_ORDER == __BIG_ENDIAN t = bswap_32(t); #endif return t; } uint64_t kaitai::kstream::read_u8le() { uint64_t t; m_io->read(reinterpret_cast(&t), 8); #if __BYTE_ORDER == __BIG_ENDIAN t = bswap_64(t); #endif return t; } // ======================================================================== // Floating point numbers // ======================================================================== // ........................................................................ // Big-endian // ........................................................................ /* float kaitai::kstream::read_f4be() { uint32_t t; m_io->read(reinterpret_cast(&t), 4); #if __BYTE_ORDER == __LITTLE_ENDIAN t = bswap_32(t); #endif return reinterpret_cast(t); } double kaitai::kstream::read_f8be() { uint64_t t; m_io->read(reinterpret_cast(&t), 8); #if __BYTE_ORDER == __LITTLE_ENDIAN t = bswap_64(t); #endif return reinterpret_cast(t); } // ........................................................................ // Little-endian // ........................................................................ float kaitai::kstream::read_f4le() { uint32_t t; m_io->read(reinterpret_cast(&t), 4); #if __BYTE_ORDER == __BIG_ENDIAN t = bswap_32(t); #endif return reinterpret_cast(t); } double kaitai::kstream::read_f8le() { uint64_t t; m_io->read(reinterpret_cast(&t), 8); #if __BYTE_ORDER == __BIG_ENDIAN t = bswap_64(t); #endif return reinterpret_cast(t); } */ // ======================================================================== // Unaligned bit values // ======================================================================== void kaitai::kstream::align_to_byte() { m_bits_left = 0; m_bits = 0; } uint64_t kaitai::kstream::read_bits_int_be(int n) { uint64_t res = 0; int bits_needed = n - m_bits_left; m_bits_left = -bits_needed & 7; // `-bits_needed mod 8` if (bits_needed > 0) { // 1 bit => 1 byte // 8 bits => 1 byte // 9 bits => 2 bytes int bytes_needed = ((bits_needed - 1) / 8) + 1; // `ceil(bits_needed / 8)` if (bytes_needed > 8) throw std::runtime_error("read_bits_int_be: more than 8 bytes requested"); uint8_t buf[8]; m_io->read(reinterpret_cast(buf), bytes_needed); for (int i = 0; i < bytes_needed; i++) { res = res << 8 | buf[i]; } uint64_t new_bits = res; res = res >> m_bits_left | (bits_needed < 64 ? m_bits << bits_needed : 0); // avoid undefined behavior of `x << 64` m_bits = new_bits; // will be masked at the end of the function } else { res = m_bits >> -bits_needed; // shift unneeded bits out } uint64_t mask = (UINT64_C(1) << m_bits_left) - 1; // `m_bits_left` is in range 0..7, so `(1 << 64)` does not have to be considered m_bits &= mask; return res; } // Deprecated, use read_bits_int_be() instead. uint64_t kaitai::kstream::read_bits_int(int n) { return read_bits_int_be(n); } uint64_t kaitai::kstream::read_bits_int_le(int n) { uint64_t res = 0; int bits_needed = n - m_bits_left; if (bits_needed > 0) { // 1 bit => 1 byte // 8 bits => 1 byte // 9 bits => 2 bytes int bytes_needed = ((bits_needed - 1) / 8) + 1; // `ceil(bits_needed / 8)` if (bytes_needed > 8) throw std::runtime_error("read_bits_int_le: more than 8 bytes requested"); uint8_t buf[8]; m_io->read(reinterpret_cast(buf), bytes_needed); for (int i = 0; i < bytes_needed; i++) { res |= static_cast(buf[i]) << (i * 8); } // NB: for bit shift operators in C++, "if the value of the right operand is // negative or is greater or equal to the number of bits in the promoted left // operand, the behavior is undefined." (see // https://en.cppreference.com/w/cpp/language/operator_arithmetic#Bitwise_shift_operators) // So we define our desired behavior here. uint64_t new_bits = bits_needed < 64 ? res >> bits_needed : 0; res = res << m_bits_left | m_bits; m_bits = new_bits; } else { res = m_bits; m_bits >>= n; } m_bits_left = -bits_needed & 7; // `-bits_needed mod 8` if (n < 64) { uint64_t mask = (UINT64_C(1) << n) - 1; res &= mask; } // if `n == 64`, do nothing return res; } // ======================================================================== // Byte arrays // ======================================================================== std::string kaitai::kstream::read_bytes(std::streamsize len) { std::vector result(len); // NOTE: streamsize type is signed, negative values are only *supposed* to not be used. // http://en.cppreference.com/w/cpp/io/streamsize if (len < 0) { throw std::runtime_error("read_bytes: requested a negative amount"); } if (len > 0) { m_io->read(&result[0], len); } return std::string(result.begin(), result.end()); } std::string kaitai::kstream::read_bytes_full() { std::iostream::pos_type p1 = m_io->tellg(); m_io->seekg(0, std::ios::end); std::iostream::pos_type p2 = m_io->tellg(); size_t len = p2 - p1; // Note: this requires a std::string to be backed with a // contiguous buffer. Officially, it's a only requirement since // C++11 (C++98 and C++03 didn't have this requirement), but all // major implementations had contiguous buffers anyway. std::string result(len, ' '); m_io->seekg(p1); m_io->read(&result[0], len); return result; } std::string kaitai::kstream::read_bytes_term(char term, bool include, bool consume, bool eos_error) { std::string result; std::getline(*m_io, result, term); if (m_io->eof()) { // encountered EOF if (eos_error) { throw std::runtime_error("read_bytes_term: encountered EOF"); } } else { // encountered terminator if (include) result.push_back(term); if (!consume) m_io->unget(); } return result; } std::string kaitai::kstream::ensure_fixed_contents(std::string expected) { std::string actual = read_bytes(expected.length()); if (actual != expected) { // NOTE: I think printing it outright is not best idea, it could contain non-ASCII characters // like backspace and beeps and whatnot. It would be better to print hexlified version, and // also to redirect it to stderr. throw std::runtime_error("ensure_fixed_contents: actual data does not match expected data"); } return actual; } std::string kaitai::kstream::bytes_strip_right(std::string src, char pad_byte) { std::size_t new_len = src.length(); while (new_len > 0 && src[new_len - 1] == pad_byte) new_len--; return src.substr(0, new_len); } std::string kaitai::kstream::bytes_terminate(std::string src, char term, bool include) { std::size_t new_len = 0; std::size_t max_len = src.length(); while (new_len < max_len && src[new_len] != term) new_len++; if (include && new_len < max_len) new_len++; return src.substr(0, new_len); } // ======================================================================== // Byte array processing // ======================================================================== std::string kaitai::kstream::process_xor_one(std::string data, uint8_t key) { size_t len = data.length(); std::string result(len, ' '); for (size_t i = 0; i < len; i++) result[i] = data[i] ^ key; return result; } std::string kaitai::kstream::process_xor_many(std::string data, std::string key) { size_t len = data.length(); size_t kl = key.length(); std::string result(len, ' '); size_t ki = 0; for (size_t i = 0; i < len; i++) { result[i] = data[i] ^ key[ki]; ki++; if (ki >= kl) ki = 0; } return result; } std::string kaitai::kstream::process_rotate_left(std::string data, int amount) { size_t len = data.length(); std::string result(len, ' '); for (size_t i = 0; i < len; i++) { uint8_t bits = data[i]; result[i] = (bits << amount) | (bits >> (8 - amount)); } return result; } #ifdef KS_ZLIB #include std::string kaitai::kstream::process_zlib(std::string data) { int ret; unsigned char *src_ptr = reinterpret_cast(&data[0]); std::stringstream dst_strm; z_stream strm; strm.zalloc = Z_NULL; strm.zfree = Z_NULL; strm.opaque = Z_NULL; ret = inflateInit(&strm); if (ret != Z_OK) throw std::runtime_error("process_zlib: inflateInit error"); strm.next_in = src_ptr; strm.avail_in = data.length(); unsigned char outbuffer[ZLIB_BUF_SIZE]; std::string outstring; // get the decompressed bytes blockwise using repeated calls to inflate do { strm.next_out = reinterpret_cast(outbuffer); strm.avail_out = sizeof(outbuffer); ret = inflate(&strm, 0); if (outstring.size() < strm.total_out) outstring.append(reinterpret_cast(outbuffer), strm.total_out - outstring.size()); } while (ret == Z_OK); if (ret != Z_STREAM_END) { // an error occurred that was not EOF std::ostringstream exc_msg; exc_msg << "process_zlib: error #" << ret << "): " << strm.msg; throw std::runtime_error(exc_msg.str()); } if (inflateEnd(&strm) != Z_OK) throw std::runtime_error("process_zlib: inflateEnd error"); return outstring; } #endif // ======================================================================== // Misc utility methods // ======================================================================== int kaitai::kstream::mod(int a, int b) { if (b <= 0) throw std::invalid_argument("mod: divisor b <= 0"); int r = a % b; if (r < 0) r += b; return r; } #include void kaitai::kstream::unsigned_to_decimal(uint64_t number, char *buffer) { // Implementation from https://ideone.com/nrQfA8 by Alf P. Steinbach // (see https://www.zverovich.net/2013/09/07/integer-to-string-conversion-in-cplusplus.html#comment-1033931478) if (number == 0) { *buffer++ = '0'; } else { char *p_first = buffer; while (number != 0) { *buffer++ = static_cast('0' + number % 10); number /= 10; } std::reverse(p_first, buffer); } *buffer = '\0'; } std::string kaitai::kstream::reverse(std::string val) { std::reverse(val.begin(), val.end()); return val; } uint8_t kaitai::kstream::byte_array_min(const std::string val) { uint8_t min = 0xff; // UINT8_MAX std::string::const_iterator end = val.end(); for (std::string::const_iterator it = val.begin(); it != end; ++it) { uint8_t cur = static_cast(*it); if (cur < min) { min = cur; } } return min; } uint8_t kaitai::kstream::byte_array_max(const std::string val) { uint8_t max = 0; // UINT8_MIN std::string::const_iterator end = val.end(); for (std::string::const_iterator it = val.begin(); it != end; ++it) { uint8_t cur = static_cast(*it); if (cur > max) { max = cur; } } return max; } // ======================================================================== // Other internal methods // ======================================================================== #ifndef KS_STR_DEFAULT_ENCODING #define KS_STR_DEFAULT_ENCODING "UTF-8" #endif #ifdef KS_STR_ENCODING_ICONV #include #include #include std::string kaitai::kstream::bytes_to_str(std::string src, std::string src_enc) { iconv_t cd = iconv_open(KS_STR_DEFAULT_ENCODING, src_enc.c_str()); if (cd == (iconv_t)-1) { if (errno == EINVAL) { throw std::runtime_error("bytes_to_str: invalid encoding pair conversion requested"); } else { throw std::runtime_error("bytes_to_str: error opening iconv"); } } size_t src_len = src.length(); size_t src_left = src_len; // Start with a buffer length of double the source length. size_t dst_len = src_len * 2; std::string dst(dst_len, ' '); size_t dst_left = dst_len; char *src_ptr = &src[0]; char *dst_ptr = &dst[0]; while (true) { size_t res = iconv(cd, &src_ptr, &src_left, &dst_ptr, &dst_left); if (res == (size_t)-1) { if (errno == E2BIG) { // dst buffer is not enough to accomodate whole string // enlarge the buffer and try again size_t dst_used = dst_len - dst_left; dst_left += dst_len; dst_len += dst_len; dst.resize(dst_len); // dst.resize might have allocated destination buffer in another area // of memory, thus our previous pointer "dst" will be invalid; re-point // it using "dst_used". dst_ptr = &dst[dst_used]; } else { throw std::runtime_error("bytes_to_str: iconv error"); } } else { // conversion successful dst.resize(dst_len - dst_left); break; } } if (iconv_close(cd) != 0) { throw std::runtime_error("bytes_to_str: iconv close error"); } return dst; } #elif defined(KS_STR_ENCODING_NONE) std::string kaitai::kstream::bytes_to_str(std::string src, std::string src_enc) { (void)src_enc; return src; } #else #error Need to decide how to handle strings: please define one of: KS_STR_ENCODING_ICONV, KS_STR_ENCODING_NONE #endif UEFITool-A66/common/kaitai/kaitaistream.h000066400000000000000000000223501442134156300203640ustar00rootroot00000000000000#ifndef KAITAI_STREAM_H #define KAITAI_STREAM_H // Kaitai Struct runtime API version: x.y.z = 'xxxyyyzzz' decimal #define KAITAI_STRUCT_VERSION 10000L #include #include #include #include #include namespace kaitai { /** * Kaitai Stream class (kaitai::kstream) is an implementation of * Kaitai Struct stream API * for C++/STL. It's implemented as a wrapper over generic STL std::istream. * * It provides a wide variety of simple methods to read (parse) binary * representations of primitive types, such as integer and floating * point numbers, byte arrays and strings, and also provides stream * positioning / navigation methods with unified cross-language and * cross-toolkit semantics. * * Typically, end users won't access Kaitai Stream class manually, but would * describe a binary structure format using .ksy language and then would use * Kaitai Struct compiler to generate source code in desired target language. * That code, in turn, would use this class and API to do the actual parsing * job. */ class kstream { public: /** * Constructs new Kaitai Stream object, wrapping a given std::istream. * \param io istream object to use for this Kaitai Stream */ kstream(std::istream* io); /** * Constructs new Kaitai Stream object, wrapping a given in-memory data * buffer. * \param data data buffer to use for this Kaitai Stream */ kstream(const std::string& data); void close(); /** @name Stream positioning */ //@{ /** * Check if stream pointer is at the end of stream. Note that the semantics * are different from traditional STL semantics: one does *not* need to do a * read (which will fail) after the actual end of the stream to trigger EOF * flag, which can be accessed after that read. It is sufficient to just be * at the end of the stream for this method to return true. * \return "true" if we are located at the end of the stream. */ bool is_eof() const; /** * Set stream pointer to designated position. * \param pos new position (offset in bytes from the beginning of the stream) */ void seek(uint64_t pos); /** * Get current position of a stream pointer. * \return pointer position, number of bytes from the beginning of the stream */ uint64_t pos(); /** * Get total size of the stream in bytes. * \return size of the stream in bytes */ uint64_t size(); //@} /** @name Integer numbers */ //@{ // ------------------------------------------------------------------------ // Signed // ------------------------------------------------------------------------ int8_t read_s1(); // ........................................................................ // Big-endian // ........................................................................ int16_t read_s2be(); int32_t read_s4be(); int64_t read_s8be(); // ........................................................................ // Little-endian // ........................................................................ int16_t read_s2le(); int32_t read_s4le(); int64_t read_s8le(); // ------------------------------------------------------------------------ // Unsigned // ------------------------------------------------------------------------ uint8_t read_u1(); // ........................................................................ // Big-endian // ........................................................................ uint16_t read_u2be(); uint32_t read_u4be(); uint64_t read_u8be(); // ........................................................................ // Little-endian // ........................................................................ uint16_t read_u2le(); uint32_t read_u4le(); uint64_t read_u8le(); //@} /** @name Floating point numbers */ //@{ // ........................................................................ // Big-endian // ........................................................................ float read_f4be(); double read_f8be(); // ........................................................................ // Little-endian // ........................................................................ float read_f4le(); double read_f8le(); //@} /** @name Unaligned bit values */ //@{ void align_to_byte(); uint64_t read_bits_int_be(int n); uint64_t read_bits_int(int n); uint64_t read_bits_int_le(int n); //@} /** @name Byte arrays */ //@{ std::string read_bytes(std::streamsize len); std::string read_bytes_full(); std::string read_bytes_term(char term, bool include, bool consume, bool eos_error); std::string ensure_fixed_contents(std::string expected); static std::string bytes_strip_right(std::string src, char pad_byte); static std::string bytes_terminate(std::string src, char term, bool include); static std::string bytes_to_str(std::string src, std::string src_enc); //@} /** @name Byte array processing */ //@{ /** * Performs a XOR processing with given data, XORing every byte of input with a single * given value. * @param data data to process * @param key value to XOR with * @return processed data */ static std::string process_xor_one(std::string data, uint8_t key); /** * Performs a XOR processing with given data, XORing every byte of input with a key * array, repeating key array many times, if necessary (i.e. if data array is longer * than key array). * @param data data to process * @param key array of bytes to XOR with * @return processed data */ static std::string process_xor_many(std::string data, std::string key); /** * Performs a circular left rotation shift for a given buffer by a given amount of bits, * using groups of 1 bytes each time. Right circular rotation should be performed * using this procedure with corrected amount. * @param data source data to process * @param amount number of bits to shift by * @return copy of source array with requested shift applied */ static std::string process_rotate_left(std::string data, int amount); #ifdef KS_ZLIB /** * Performs an unpacking ("inflation") of zlib-compressed data with usual zlib headers. * @param data data to unpack * @return unpacked data * @throws IOException */ static std::string process_zlib(std::string data); #endif //@} /** * Performs modulo operation between two integers: dividend `a` * and divisor `b`. Divisor `b` is expected to be positive. The * result is always 0 <= x <= b - 1. */ static int mod(int a, int b); /** * Converts given integer `val` to a decimal string representation. * Should be used in place of std::to_string() (which is available only * since C++11) in older C++ implementations. */ template // check for C++11 support - https://stackoverflow.com/a/40512515 #if __cplusplus >= 201103L || (defined(_MSC_VER) && _MSC_VER >= 1900) // https://stackoverflow.com/a/27913885 typename std::enable_if< std::is_integral::value && // check if we don't have something too large like GCC's `__int128_t` std::numeric_limits::max() >= 0 && std::numeric_limits::max() <= std::numeric_limits::max(), std::string >::type #else std::string #endif static to_string(I val) { // in theory, `digits10 + 3` would be enough (minus sign + leading digit // + null terminator), but let's add a little more to be safe char buf[std::numeric_limits::digits10 + 5]; if (val < 0) { buf[0] = '-'; // get absolute value without undefined behavior (https://stackoverflow.com/a/12231604) unsigned_to_decimal(-static_cast(val), &buf[1]); } else { unsigned_to_decimal(val, buf); } return std::string(buf); } /** * Reverses given string `val`, so that the first character becomes the * last and the last one becomes the first. This should be used to avoid * the need of local variables at the caller. */ static std::string reverse(std::string val); /** * Finds the minimal byte in a byte array, treating bytes as * unsigned values. * @param val byte array to scan * @return minimal byte in byte array as integer */ static uint8_t byte_array_min(const std::string val); /** * Finds the maximal byte in a byte array, treating bytes as * unsigned values. * @param val byte array to scan * @return maximal byte in byte array as integer */ static uint8_t byte_array_max(const std::string val); private: std::istream* m_io; std::istringstream m_io_str; int m_bits_left; uint64_t m_bits; void init(); void exceptions_enable() const; static void unsigned_to_decimal(uint64_t number, char *buffer); static const int ZLIB_BUF_SIZE = 128 * 1024; }; } #endif UEFITool-A66/common/kaitai/kaitaistruct.h000066400000000000000000000004271442134156300204160ustar00rootroot00000000000000#ifndef KAITAI_STRUCT_H #define KAITAI_STRUCT_H #include "kaitaistream.h" namespace kaitai { class kstruct { public: kstruct(kstream *_io) { m__io = _io; } virtual ~kstruct() {} protected: kstream *m__io; public: kstream *_io() { return m__io; } }; } #endif UEFITool-A66/common/ksy/000077500000000000000000000000001442134156300150775ustar00rootroot00000000000000UEFITool-A66/common/ksy/ami_nvar.ksy000066400000000000000000000105601442134156300174250ustar00rootroot00000000000000meta: id: ami_nvar title: AMI Aptio NVRAM Storage application: AMI Aptio-based UEFI firmware file-extension: nvar tags: - firmware license: CC0-1.0 ks-version: 0.9 endian: le seq: - id: entries type: nvar_entry repeat: until repeat-until: _.signature_first != 0x4e or _io.eof types: nvar_entry: seq: - id: invoke_offset size: 0 if: offset >= 0 - id: signature_first type: u1 - id: signature_rest contents: [VAR] if: signature_first == 0x4e - id: size type: u2 valid: expr: _ > sizeof + sizeof + sizeof if: signature_first == 0x4e - id: next type: b24le if: signature_first == 0x4e - id: attributes type: nvar_attributes if: signature_first == 0x4e - id: body type: nvar_entry_body size: size - (sizeof + sizeof + sizeof) if: signature_first == 0x4e - id: invoke_end_offset size: 0 if: signature_first == 0x4e and end_offset >= 0 instances: offset: value: _io.pos end_offset: value: _io.pos nvar_attributes: seq: - id: valid type: b1 - id: auth_write type: b1 - id: hw_error_record type: b1 - id: extended_header type: b1 - id: data_only type: b1 - id: local_guid type: b1 - id: ascii_name type: b1 - id: runtime type: b1 nvar_extended_attributes: seq: - id: reserved_high type: b2 - id: time_based_auth type: b1 - id: auth_write type: b1 - id: reserved_low type: b3 - id: checksum type: b1 ucs2_string: seq: - id: ucs2_chars type: u2 repeat: until repeat-until: _ == 0 nvar_entry_body: seq: - id: guid_index type: u1 if: (not _parent.attributes.local_guid) and (not _parent.attributes.data_only) and (_parent.attributes.valid) - id: guid size: 16 if: (_parent.attributes.local_guid) and (not _parent.attributes.data_only) and (_parent.attributes.valid) - id: ascii_name type: strz encoding: ASCII if: (_parent.attributes.ascii_name) and (not _parent.attributes.data_only) and (_parent.attributes.valid) - id: ucs2_name type: ucs2_string if: (not _parent.attributes.ascii_name) and (not _parent.attributes.data_only) and (_parent.attributes.valid) - id: invoke_data_start size: 0 if: data_start_offset >= 0 - id: data size-eos: true instances: extended_header_size_field: pos: _io.pos - sizeof type: u2 if: _parent.attributes.valid and _parent.attributes.extended_header and _parent.size > sizeof + sizeof + sizeof + sizeof extended_header_size: value: '_parent.attributes.extended_header ? (extended_header_size_field >= sizeof + sizeof ? extended_header_size_field : 0) : 0' extended_header_attributes: pos: _io.pos - extended_header_size type: nvar_extended_attributes if: _parent.attributes.valid and _parent.attributes.extended_header and (extended_header_size >= sizeof + sizeof) extended_header_timestamp: pos: _io.pos - extended_header_size + sizeof type: u8 if: _parent.attributes.valid and _parent.attributes.extended_header and (extended_header_size >= sizeof + sizeof + sizeof) and extended_header_attributes.time_based_auth extended_header_hash: pos: _io.pos - extended_header_size + sizeof + sizeof size: 32 if: _parent.attributes.valid and _parent.attributes.extended_header and (extended_header_size >= sizeof + sizeof + 32 + sizeof) and extended_header_attributes.time_based_auth and (not _parent.attributes.data_only) extended_header_checksum: pos: _io.pos - sizeof - sizeof type: u1 if: _parent.attributes.valid and _parent.attributes.extended_header and (extended_header_size >= sizeof + sizeof + sizeof) and extended_header_attributes.checksum data_start_offset: value: _io.pos data_end_offset: value: _io.pos data_size: value: (data_end_offset - data_start_offset) - extended_header_size UEFITool-A66/common/ksy/intel_acbp_v1.ksy000066400000000000000000000071151442134156300203410ustar00rootroot00000000000000meta: id: intel_acbp_v1 title: Intel BootGuard Boot Policy v1 application: Intel x86 firmware file-extension: acbp_v1 tags: - firmware license: CC0-1.0 ks-version: 0.9 endian: le enums: ibb_segment_type: 0: ibb 1: non_ibb structure_ids: 0x5f5f504243415f5f: acbp 0x5f5f534242495f5f: ibbs 0x5f5f41444d505f5f: pmda 0x5f5f47534d505f5f: pmsg seq: - id: structure_id type: u8 enum: structure_ids valid: structure_ids::acbp - id: version type: u1 valid: expr: _ < 0x20 - id: reserved0 type: u1 - id: bpm_revision type: u1 - id: bp_svn type: u1 - id: acm_svn type: u1 - id: reserved1 type: u1 - id: nem_data_size type: u2 - id: elements type: acbp_element repeat: until repeat-until: _.header.structure_id == structure_ids::pmsg or _io.eof types: acbp_element: seq: - id: header type: common_header - id: ibbs_body type: ibbs_body if: header.structure_id == structure_ids::ibbs - id: pmda_body type: pmda_body if: header.structure_id == structure_ids::pmda - id: pmsg_body type: pmsg_body if: header.structure_id == structure_ids::pmsg - id: invalid_body size: 0 if: header.structure_id != structure_ids::pmsg and header.structure_id != structure_ids::pmda and header.structure_id != structure_ids::ibbs valid: expr: false common_header: seq: - id: structure_id type: u8 enum: structure_ids - id: version type: u1 hash: seq: - id: hash_algorithm_id type: u2 - id: len_hash type: u2 - id: hash size: 32 ibbs_body: seq: - id: reserved type: u1 repeat: expr repeat-expr: 3 - id: flags type: u4 - id: mch_bar type: u8 - id: vtd_bar type: u8 - id: dma_protection_base0 type: u4 - id: dma_protection_limit0 type: u4 - id: dma_protection_base1 type: u8 - id: dma_protection_limit1 type: u8 - id: post_ibb_hash type: hash - id: ibb_entry_point type: u4 - id: ibb_hash type: hash - id: num_ibb_segments type: u1 - id: ibb_segments type: ibb_segment repeat: expr repeat-expr: num_ibb_segments ibb_segment: seq: - id: reserved type: u2 - id: flags type: u2 - id: base type: u4 - id: size type: u4 pmda_body: seq: - id: total_size type: u2 - id: version type: u4 - id: num_entries type: u4 - id: entries_v1 if: version == 1 type: pmda_entry_v1 repeat: expr repeat-expr: num_entries - id: entries_v2 if: version == 2 type: pmda_entry_v2 repeat: expr repeat-expr: num_entries pmda_entry_v1: seq: - id: base type: u4 - id: size type: u4 - id: hash size: 32 pmda_entry_v2: seq: - id: base type: u4 - id: size type: u4 - id: hash type: hash pmsg_body: seq: - id: version type: u1 - id: key_id type: u2 - id: public_key type: public_key - id: sig_scheme type: u2 - id: signature type: signature public_key: seq: - id: version type: u1 - id: size_bits type: u2 - id: exponent type: u4 - id: modulus size: size_bits / 8 signature: seq: - id: version type: u1 - id: size_bits type: u2 - id: hash_algorithm_id type: u2 - id: signature size: size_bits / 8UEFITool-A66/common/ksy/intel_acbp_v2.ksy000066400000000000000000000101351442134156300203360ustar00rootroot00000000000000meta: id: intel_acbp_v2 title: Intel BootGuard Boot Policy v2 application: Intel x86 firmware file-extension: acbp_v2 tags: - firmware license: CC0-1.0 ks-version: 0.9 endian: le enums: ibb_segment_type: 0: ibb 1: non_ibb structure_ids: 0x5f5f504243415f5f: acbp 0x5f5f534242495f5f: ibbs 0x5f5f535458545f5f: txts 0x5f5f535246505f5f: pfrs 0x5f5f534443505f5f: pcds 0x5f5f41444d505f5f: pmda 0x5f5f47534d505f5f: pmsg seq: - id: structure_id type: u8 enum: structure_ids valid: structure_ids::acbp - id: version type: u1 valid: expr: _ >= 0x20 - id: header_specific type: u1 - id: total_size type: u2 valid: 0x14 - id: key_signature_offset type: u2 - id: bpm_revision type: u1 - id: bp_svn type: u1 - id: acm_svn type: u1 - id: reserved type: u1 - id: nem_data_size type: u2 - id: elements type: acbp_element repeat: until repeat-until: _.header.total_size == 0 or _.header.structure_id == structure_ids::pmsg - id: key_signature type: key_signature types: header: seq: - id: structure_id type: u8 enum: structure_ids - id: version type: u1 - id: header_specific type: u1 - id: total_size type: u2 hash: seq: - id: hash_algorithm_id type: u2 - id: len_hash type: u2 - id: hash size: len_hash pmda_entry_v3: seq: - id: entry_id type: u4 - id: base type: u4 - id: size type: u4 - id: total_entry_size type: u2 - id: version type: u2 - id: hash type: hash pmda_body: seq: - id: reserved type: u2 - id: total_size type: u2 - id: version type: u4 valid: 3 - id: num_entries type: u4 - id: entries type: pmda_entry_v3 repeat: expr repeat-expr: num_entries ibb_segment: seq: - id: reserved type: u2 - id: flags type: u2 - id: base type: u4 - id: size type: u4 ibbs_body: seq: - id: reserved0 type: u1 - id: set_number type: u1 - id: reserved1 type: u1 - id: pbet_value type: u1 - id: flags type: u4 - id: mch_bar type: u8 - id: vtd_bar type: u8 - id: dma_protection_base0 type: u4 - id: dma_protection_limit0 type: u4 - id: dma_protection_base1 type: u8 - id: dma_protection_limit1 type: u8 - id: post_ibb_digest type: hash - id: ibb_entry_point type: u4 - id: ibb_digests_size type: u2 - id: num_ibb_digests type: u2 - id: ibb_digests type: hash repeat: expr repeat-expr: num_ibb_digests - id: obb_digest type: hash - id: reserved2 type: u1 repeat: expr repeat-expr: 3 - id: num_ibb_segments type: u1 - id: ibb_segments type: ibb_segment repeat: expr repeat-expr: num_ibb_segments acbp_element: seq: - id: header type: header - id: ibbs_body type: ibbs_body if: header.structure_id == structure_ids::ibbs and header.total_size >= sizeof
- id: pmda_body type: pmda_body if: header.structure_id == structure_ids::pmda and header.total_size >= sizeof
- id: generic_body size: header.total_size - sizeof
if: header.structure_id != structure_ids::ibbs and header.structure_id != structure_ids::pmda and header.total_size >= sizeof
public_key: seq: - id: version type: u1 - id: size_bits type: u2 - id: exponent type: u4 - id: modulus size: size_bits / 8 signature: seq: - id: version type: u1 - id: size_bits type: u2 - id: hash_algorithm_id type: u2 - id: signature size: size_bits / 8 key_signature: seq: - id: version type: u1 - id: key_id type: u2 - id: public_key type: public_key - id: sig_scheme type: u2 - id: signature type: signatureUEFITool-A66/common/ksy/intel_acm.ksy000066400000000000000000000034351442134156300175670ustar00rootroot00000000000000meta: id: intel_acm title: Intel Authenticated Code Module application: Intel x86 firmware file-extension: acm tags: - executable - firmware license: CC0-1.0 ks-version: 0.9 endian: le enums: module_subtype: 0: txt 1: startup 3: boot_guard known_header_version: 0x00000000: v0_0 0x00030000: v3_0 seq: - id: header type: header - id: body size: 4 * (header.module_size - header.header_size - header.scratch_space_size) types: header: seq: - id: module_type type: u2 valid: 0x0002 - id: module_subtype type: u2 enum: module_subtype - id: header_size type: u4 doc: counted in 4 byte increments - id: header_version type: u4 - id: chipset_id type: u2 - id: flags type: u2 - id: module_vendor type: u4 valid: 0x8086 - id: date_day type: u1 doc: BCD - id: date_month type: u1 doc: BCD - id: date_year type: u2 doc: BCD - id: module_size type: u4 doc: counted in 4 byte increments - id: acm_svn type: u2 - id: se_svn type: u2 - id: code_control_flags type: u4 - id: error_entry_point type: u4 - id: gdt_max type: u4 - id: gdt_base type: u4 - id: segment_sel type: u4 - id: entry_point type: u4 - id: reserved size: 64 - id: key_size type: u4 doc: counted in 4 byte increments - id: scratch_space_size type: u4 doc: counted in 4 byte increments - id: rsa_public_key size: (4 * key_size) - id: rsa_exponent type: u4 if: header_version == 0 - id: rsa_signature size: (4 * key_size) - id: scratch_space size: (4 * scratch_space_size) UEFITool-A66/common/ksy/intel_keym_v1.ksy000066400000000000000000000023571442134156300204040ustar00rootroot00000000000000meta: id: intel_keym_v1 title: Intel BootGuard Key Manifest v1 application: Intel x86 firmware file-extension: keym_v1 tags: - firmware license: CC0-1.0 ks-version: 0.9 endian: le enums: structure_ids: 0x5f5f4d59454b5f5f: keym seq: - id: structure_id type: u8 enum: structure_ids valid: structure_ids::keym - id: version type: u1 valid: expr: _ < 0x20 - id: km_version type: u1 - id: km_svn type: u1 - id: km_id type: u1 - id: km_hash type: km_hash - id: key_signature type: key_signature types: km_hash: seq: - id: hash_algorithm_id type: u2 - id: len_hash type: u2 - id: hash size: len_hash public_key: seq: - id: version type: u1 - id: size_bits type: u2 - id: exponent type: u4 - id: modulus size: size_bits / 8 signature: seq: - id: version type: u1 - id: size_bits type: u2 - id: hash_algorithm_id type: u2 - id: signature size: size_bits / 8 key_signature: seq: - id: version type: u1 - id: key_id type: u2 - id: public_key type: public_key - id: sig_scheme type: u2 - id: signature type: signatureUEFITool-A66/common/ksy/intel_keym_v2.ksy000066400000000000000000000034111442134156300203750ustar00rootroot00000000000000meta: id: intel_keym_v2 title: Intel BootGuard Key Manifest v2 application: Intel x86 firmware file-extension: keym_v2 tags: - firmware license: CC0-1.0 ks-version: 0.9 endian: le enums: structure_ids: 0x5f5f4d59454b5f5f: keym km_usage_flags: 1: boot_policy_manifest 2: fit_patch_manifest 4: acm_manifest 8: sdev seq: - id: header type: header - id: key_signature_offset type: u2 - id: reserved type: u1 repeat: expr repeat-expr: 3 - id: km_version type: u1 - id: km_svn type: u1 - id: km_id type: u1 - id: fpf_hash_algorithm_id type: u2 - id: num_km_hashes type: u2 - id: km_hashes type: km_hash repeat: expr repeat-expr: num_km_hashes - id: key_signature type: key_signature types: header: seq: - id: structure_id type: u8 enum: structure_ids valid: structure_ids::keym - id: version type: u1 valid: expr: _ >= 0x20 - id: header_specific type: u1 - id: total_size type: u2 valid: 0x0 km_hash: seq: - id: usage_flags type: u8 - id: hash_algorithm_id type: u2 - id: len_hash type: u2 - id: hash size: len_hash public_key: seq: - id: version type: u1 - id: size_bits type: u2 - id: exponent type: u4 - id: modulus size: size_bits / 8 signature: seq: - id: version type: u1 - id: size_bits type: u2 - id: hash_algorithm_id type: u2 - id: signature size: size_bits / 8 key_signature: seq: - id: version type: u1 - id: key_id type: u2 - id: public_key type: public_key - id: sig_scheme type: u2 - id: signature type: signatureUEFITool-A66/common/me.h000066400000000000000000000061411442134156300150450ustar00rootroot00000000000000/* me.h Copyright (c) 2015, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHWARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef ME_H #define ME_H #include "basetypes.h" // Make sure we use right packing rules #pragma pack(push, 1) typedef struct ME_VERSION_ { UINT32 Signature; UINT32 Reserved; UINT16 Major; UINT16 Minor; UINT16 Bugfix; UINT16 Build; } ME_VERSION; #define ME_VERSION_SIGNATURE 0x4E414D24 //$MAN #define ME_VERSION_SIGNATURE2 0x324E4D24 //$MN2 // FPT #define ME_ROM_BYPASS_VECTOR_SIZE 0x10 #define FPT_HEADER_SIGNATURE 0x54504624 //$FPT // Header version 1.0 or 2.0, default typedef struct FPT_HEADER_ { UINT32 Signature; UINT32 NumEntries; UINT8 HeaderVersion; // 0x10 or 0x20 UINT8 EntryVersion; UINT8 HeaderLength; UINT8 HeaderChecksum; // One bit for Redundant UINT16 FlashCycleLife; // Maybe also TicksToAdd UINT16 FlashCycleLimit;// Maybe also TokensToAdd UINT32 UmaSize; // Maybe also Flags UINT32 Flags; // Maybe also FlashLayout UINT16 FitcMajor; UINT16 FitcMinor; UINT16 FitcHotfix; UINT16 FitcBuild; } FPT_HEADER; // Header version 2.1, special case #define FPT_HEADER_VERSION_21 0x21 typedef struct FPT_HEADER_21_ { UINT32 Signature; UINT32 NumEntries; UINT8 HeaderVersion; // 0x21 UINT8 EntryVersion; UINT8 HeaderLength; UINT8 Flags; // One bit for Redundant UINT16 TicksToAdd; UINT16 TokensToAdd; UINT32 SPSFlags; UINT32 HeaderCrc32; // Header + Entries sums to 0 UINT16 FitcMajor; UINT16 FitcMinor; UINT16 FitcHotfix; UINT16 FitcBuild; } FPT_HEADER_21; typedef struct FPT_HEADER_ENTRY_{ CHAR8 Name[4]; CHAR8 Owner[4]; UINT32 Offset; UINT32 Size; UINT32 Reserved[3]; UINT8 Type : 7; UINT8 CopyToDramCache : 1; UINT8 Reserved1 : 7; UINT8 BuiltWithLength1 : 1; UINT8 BuiltWithLength2 : 1; UINT8 Reserved2 : 7; UINT8 EntryValid; } FPT_HEADER_ENTRY; // IFWI typedef struct IFWI_HEADER_ENTRY_ { UINT32 Offset; UINT32 Size; } IFWI_HEADER_ENTRY; // IFWI 1.6 (ME), 2.0 (BIOS) typedef struct IFWI_16_LAYOUT_HEADER_ { UINT8 RomBypassVector[16]; IFWI_HEADER_ENTRY DataPartition; IFWI_HEADER_ENTRY BootPartition[5]; UINT64 Checksum; } IFWI_16_LAYOUT_HEADER; // IFWI 1.7 (ME) typedef struct IFWI_17_LAYOUT_HEADER_ { UINT8 RomBypassVector[16]; UINT16 HeaderSize; UINT8 Flags; UINT8 Reserved; UINT32 Checksum; IFWI_HEADER_ENTRY DataPartition; IFWI_HEADER_ENTRY BootPartition[5]; IFWI_HEADER_ENTRY TempPage; } IFWI_17_LAYOUT_HEADER; #define ME_MANIFEST_HEADER_ID 0x324E4D24 //$MN2 // Restore previous packing rules #pragma pack(pop) #endif // ME_H UEFITool-A66/common/meparser.cpp000077500000000000000000001024631442134156300166240ustar00rootroot00000000000000/* meparser.cpp Copyright (c) 2019, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php. THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include #include "ffs.h" #include "me.h" #include "meparser.h" #include "parsingdata.h" #include "utility.h" #ifdef U_ENABLE_ME_PARSING_SUPPORT struct FPT_PARTITION_INFO { FPT_HEADER_ENTRY ptEntry; UINT8 type; UModelIndex index; friend bool operator< (const FPT_PARTITION_INFO & lhs, const FPT_PARTITION_INFO & rhs){ return lhs.ptEntry.Offset < rhs.ptEntry.Offset; } }; struct IFWI_PARTITION_INFO { IFWI_HEADER_ENTRY ptEntry; UINT8 type; UINT8 subtype; friend bool operator< (const IFWI_PARTITION_INFO & lhs, const IFWI_PARTITION_INFO & rhs){ return lhs.ptEntry.Offset < rhs.ptEntry.Offset; } }; USTATUS MeParser::parseMeRegionBody(const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // Obtain ME region UByteArray meRegion = model->body(index); // Check region size if ((UINT32)meRegion.size() < ME_ROM_BYPASS_VECTOR_SIZE + sizeof(UINT32)) { msg(usprintf("%s: ME region too small to fit ROM bypass vector", __FUNCTION__), index); return U_INVALID_ME_PARTITION_TABLE; } // Check ME signature to determine it's version // ME v11 and older layout if (*(UINT32*)meRegion.constData() == FPT_HEADER_SIGNATURE || *(UINT32*)(meRegion.constData() + ME_ROM_BYPASS_VECTOR_SIZE) == FPT_HEADER_SIGNATURE) { UModelIndex ptIndex; return parseFptRegion(meRegion, index, ptIndex); } // IFWI 1.6 // Check region size if ((UINT32)meRegion.size() < sizeof(IFWI_16_LAYOUT_HEADER)) { msg(usprintf("%s: ME region too small to fit IFWI 1.6 layout header", __FUNCTION__), index); return U_INVALID_ME_PARTITION_TABLE; } const IFWI_16_LAYOUT_HEADER* ifwi16Header = (const IFWI_16_LAYOUT_HEADER*)meRegion.constData(); // Check region size if ((UINT32)meRegion.size() < ifwi16Header->DataPartition.Offset + sizeof(UINT32)) { msg(usprintf("%s: ME region too small to fit IFWI 1.6 data partition", __FUNCTION__), index); return U_INVALID_ME_PARTITION_TABLE; } // Data partition always points to FPT header if (*(UINT32*)(meRegion.constData() + ifwi16Header->DataPartition.Offset) == FPT_HEADER_SIGNATURE) { UModelIndex ptIndex; return parseIfwi16Region(meRegion, index, ptIndex); } // IFWI 1.7 if ((UINT32)meRegion.size() < sizeof(IFWI_17_LAYOUT_HEADER)) { msg(usprintf("%s: ME region too small to fit IFWI 1.7 layout header", __FUNCTION__), index); return U_INVALID_ME_PARTITION_TABLE; } const IFWI_17_LAYOUT_HEADER* ifwi17Header = (const IFWI_17_LAYOUT_HEADER*)meRegion.constData(); // Check region size if ((UINT32)meRegion.size() < ifwi17Header->DataPartition.Offset + sizeof(UINT32)) { msg(usprintf("%s: ME region too small to fit IFWI 1.7 data partition", __FUNCTION__), index); return U_INVALID_ME_PARTITION_TABLE; } // Data partition always points to FPT header if (*(UINT32*)(meRegion.constData() + ifwi17Header->DataPartition.Offset)== FPT_HEADER_SIGNATURE) { UModelIndex ptIndex; return parseIfwi17Region(meRegion, index, ptIndex); } // Something else entirely msg(usprintf("%s: unknown ME region format", __FUNCTION__), index); return U_INVALID_ME_PARTITION_TABLE; } USTATUS MeParser::parseFptRegion(const UByteArray & region, const UModelIndex & parent, UModelIndex & index) { // Check region size if ((UINT32)region.size() < sizeof(FPT_HEADER)) { msg(usprintf("%s: region too small to fit the FPT partition table header", __FUNCTION__), parent); return U_INVALID_ME_PARTITION_TABLE; } // Populate partition table header const FPT_HEADER* ptHeader = (const FPT_HEADER*)region.constData(); UINT32 romBypassVectorSize = 0; if (*(UINT32*)region.constData() != FPT_HEADER_SIGNATURE) { // Adjust the header to skip ROM bypass vector romBypassVectorSize = ME_ROM_BYPASS_VECTOR_SIZE; ptHeader = (const FPT_HEADER*)(region.constData() + romBypassVectorSize); } // Check region size again UINT32 ptBodySize = ptHeader->NumEntries * sizeof(FPT_HEADER_ENTRY); UINT32 ptSize = romBypassVectorSize + sizeof(FPT_HEADER) + ptBodySize; if ((UINT32)region.size() < ptSize) { msg(usprintf("%s: ME region too small to fit the FPT partition table", __FUNCTION__), parent); return U_INVALID_ME_PARTITION_TABLE; } // Get info UByteArray header = region.left(romBypassVectorSize + sizeof(FPT_HEADER)); UByteArray body = region.mid(header.size(), ptBodySize); UString name = UString("FPT partition table"); UString info; // Special case of FPT header version 2.1 if (ptHeader->HeaderVersion == FPT_HEADER_VERSION_21) { const FPT_HEADER_21* ptHeader21 = (const FPT_HEADER_21*)ptHeader; info = usprintf("Full size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\nROM bypass vector: %s\nNumber of entries: %u\nHeader version: %02Xh\nEntry version: %02Xh\n" "Header length: %02Xh\nFlags: %Xh\nTicks to add: %04Xh\nTokens to add: %04Xh\nSPS Flags: %Xh\nFITC version: %u.%u.%u.%u\nCRC32 Checksum: %08Xh", ptSize, ptSize, (UINT32)header.size(), (UINT32)header.size(), ptBodySize, ptBodySize, (romBypassVectorSize ? "present" : "absent"), ptHeader21->NumEntries, ptHeader21->HeaderVersion, ptHeader21->EntryVersion, ptHeader21->HeaderLength, ptHeader21->Flags, ptHeader21->TicksToAdd, ptHeader21->TokensToAdd, ptHeader21->SPSFlags, ptHeader21->FitcMajor, ptHeader21->FitcMinor, ptHeader21->FitcHotfix, ptHeader21->FitcBuild, ptHeader21->HeaderCrc32); // TODO: verify header crc32 } // Default handling for all other versions, may be too generic in some corner cases else { info = usprintf("Full size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\nROM bypass vector: %s\nNumber of entries: %u\nHeader version: %02Xh\nEntry version: %02Xh\n" "Header length: %02Xh\nFlash cycle life: %04Xh\nFlash cycle limit: %04Xh\nUMA size: %Xh\nFlags: %Xh\nFITC version: %u.%u.%u.%u\nChecksum: %02Xh", ptSize, ptSize, (UINT32)header.size(), (UINT32)header.size(), ptBodySize, ptBodySize, (romBypassVectorSize ? "present" : "absent"), ptHeader->NumEntries, ptHeader->HeaderVersion, ptHeader->EntryVersion, ptHeader->HeaderLength, ptHeader->FlashCycleLife, ptHeader->FlashCycleLimit, ptHeader->UmaSize, ptHeader->Flags, ptHeader->FitcMajor, ptHeader->FitcMinor, ptHeader->FitcHotfix, ptHeader->FitcBuild, ptHeader->HeaderChecksum); // TODO: verify header checksum8 } // Add tree item index = model->addItem(0, Types::FptStore, 0, name, UString(), info, header, body, UByteArray(), Fixed, parent); // Add partition table entries std::vector partitions; UINT32 offset = (UINT32)header.size(); UINT32 numEntries = ptHeader->NumEntries; const FPT_HEADER_ENTRY* firstPtEntry = (const FPT_HEADER_ENTRY*)(region.constData() + offset); for (UINT32 i = 0; i < numEntries; i++) { // Populate entry header const FPT_HEADER_ENTRY* ptEntry = firstPtEntry + i; // Get info name = visibleAsciiOrHex((UINT8*)ptEntry->Name, 4); info = usprintf("Full size: %Xh (%u)\nPartition offset: %Xh\nPartition length: %Xh\nPartition type: %02Xh", (UINT32)sizeof(FPT_HEADER_ENTRY), (UINT32)sizeof(FPT_HEADER_ENTRY), ptEntry->Offset, ptEntry->Size, ptEntry->Type); // Add tree item const UINT8 type = (ptEntry->Offset != 0 && ptEntry->Offset != 0xFFFFFFFF && ptEntry->Size != 0 && ptEntry->EntryValid != 0xFF) ? Subtypes::ValidFptEntry : Subtypes::InvalidFptEntry; UModelIndex entryIndex = model->addItem(offset, Types::FptEntry, type, name, UString(), info, UByteArray(), UByteArray((const char*)ptEntry, sizeof(FPT_HEADER_ENTRY)), UByteArray(), Fixed, index); // Adjust offset offset += sizeof(FPT_HEADER_ENTRY); // Add valid partitions if (type == Subtypes::ValidFptEntry) { // Skip absent and invalid partitions // Add to partitions vector FPT_PARTITION_INFO partition = {}; partition.type = Types::FptPartition; partition.ptEntry = *ptEntry; partition.index = entryIndex; partitions.push_back(partition); } } // Check for empty set of partitions if (partitions.empty()) { // Add a single padding partition in this case FPT_PARTITION_INFO padding = {}; padding.ptEntry.Offset = offset; padding.ptEntry.Size = (UINT32)(region.size() - padding.ptEntry.Offset); padding.type = Types::Padding; partitions.push_back(padding); } make_partition_table_consistent: if (partitions.empty()) { return U_INVALID_ME_PARTITION_TABLE; } // Sort partitions by offset std::sort(partitions.begin(), partitions.end()); // Check for intersections and paddings between partitions FPT_PARTITION_INFO padding = {}; // Check intersection with the partition table header if (partitions.front().ptEntry.Offset < ptSize) { msg(usprintf("%s: ME partition has intersection with ME partition table, skipped", __FUNCTION__), partitions.front().index); partitions.erase(partitions.begin()); goto make_partition_table_consistent; } // Check for padding between partition table and the first partition else if (partitions.front().ptEntry.Offset > ptSize) { padding.ptEntry.Offset = ptSize; padding.ptEntry.Size = partitions.front().ptEntry.Offset - ptSize; padding.type = Types::Padding; partitions.insert(partitions.begin(), padding); } // Check for intersections/paddings between partitions for (size_t i = 1; i < partitions.size(); i++) { UINT32 previousPartitionEnd = partitions[i - 1].ptEntry.Offset + partitions[i - 1].ptEntry.Size; // Check that current region is fully present in the image if ((UINT32)partitions[i].ptEntry.Offset + (UINT32)partitions[i].ptEntry.Size > (UINT32)region.size()) { if ((UINT32)partitions[i].ptEntry.Offset >= (UINT32)region.size()) { msg(usprintf("%s: FPT partition is located outside of the opened image, skipped", __FUNCTION__), partitions[i].index); partitions.erase(partitions.begin() + i); goto make_partition_table_consistent; } else { msg(usprintf("%s: FPT partition can't fit into the region, truncated", __FUNCTION__), partitions[i].index); partitions[i].ptEntry.Size = (UINT32)region.size() - (UINT32)partitions[i].ptEntry.Offset; } } // Check for intersection with previous partition if (partitions[i].ptEntry.Offset < previousPartitionEnd) { // Check if current partition is located inside previous one if (partitions[i].ptEntry.Offset + partitions[i].ptEntry.Size <= previousPartitionEnd) { msg(usprintf("%s: FPT partition is located inside another FPT partition, skipped", __FUNCTION__), partitions[i].index); partitions.erase(partitions.begin() + i); goto make_partition_table_consistent; } else { msg(usprintf("%s: FPT partition intersects with previous one, skipped", __FUNCTION__), partitions[i].index); partitions.erase(partitions.begin() + i); goto make_partition_table_consistent; } } // Check for padding between current and previous partitions else if (partitions[i].ptEntry.Offset > previousPartitionEnd) { padding.ptEntry.Offset = previousPartitionEnd; padding.ptEntry.Size = partitions[i].ptEntry.Offset - previousPartitionEnd; padding.type = Types::Padding; std::vector::iterator iter = partitions.begin(); std::advance(iter, i); partitions.insert(iter, padding); } } // Check for padding after the last region if ((UINT32)partitions.back().ptEntry.Offset + (UINT32)partitions.back().ptEntry.Size < (UINT32)region.size()) { padding.ptEntry.Offset = partitions.back().ptEntry.Offset + partitions.back().ptEntry.Size; padding.ptEntry.Size = (UINT32)(region.size() - padding.ptEntry.Offset); padding.type = Types::Padding; partitions.push_back(padding); } // Partition map is consistent for (size_t i = 0; i < partitions.size(); i++) { UByteArray partition = region.mid(partitions[i].ptEntry.Offset, partitions[i].ptEntry.Size); if (partitions[i].type == Types::FptPartition) { UModelIndex partitionIndex; // Get info name = visibleAsciiOrHex((UINT8*) partitions[i].ptEntry.Name, 4); info = usprintf("Full size: %Xh (%u)\nPartition type: %02Xh\n", (UINT32)partition.size(), (UINT32)partition.size(), partitions[i].ptEntry.Type); // Add tree item UINT8 type = Subtypes::CodeFptPartition + partitions[i].ptEntry.Type; partitionIndex = model->addItem(partitions[i].ptEntry.Offset, Types::FptPartition, type, name, UString(), info, UByteArray(), partition, UByteArray(), Fixed, parent); if (type == Subtypes::CodeFptPartition && partition.size() >= (int) sizeof(UINT32) && readUnaligned((const UINT32*)partition.constData()) == CPD_SIGNATURE) { // Parse code partition contents UModelIndex cpdIndex; ffsParser->parseCpdRegion(partition, partitions[i].ptEntry.Offset, partitionIndex, cpdIndex); } } else if (partitions[i].type == Types::Padding) { // Get info name = UString("Padding"); info = usprintf("Full size: %Xh (%u)", (UINT32)partition.size(), (UINT32)partition.size()); // Add tree item model->addItem(partitions[i].ptEntry.Offset, Types::Padding, getPaddingType(partition), name, UString(), info, UByteArray(), partition, UByteArray(), Fixed, parent); } } return U_SUCCESS; } USTATUS MeParser::parseIfwi16Region(const UByteArray & region, const UModelIndex & parent, UModelIndex & index) { // Check region size again if ((UINT32)region.size() < sizeof(IFWI_16_LAYOUT_HEADER)) { msg(usprintf("%s: ME region too small to fit IFWI 1.6 layout header", __FUNCTION__), parent); return U_INVALID_ME_PARTITION_TABLE; } const IFWI_16_LAYOUT_HEADER* ifwiHeader = (const IFWI_16_LAYOUT_HEADER*)region.constData(); // Add header UINT32 ptSize = sizeof(IFWI_16_LAYOUT_HEADER); UByteArray header = region.left(ptSize); UString name = UString("IFWI 1.6 header"); UString info = usprintf("Full size: %Xh (%u)\n" "Data partition offset: %Xh\nData partition size: %Xh\n" "Boot1 partition offset: %Xh\nBoot1 partition size: %Xh\n" "Boot2 partition offset: %Xh\nBoot2 partition size: %Xh\n" "Boot3 partition offset: %Xh\nBoot3 partition size: %Xh\n" "Boot4 partition offset: %Xh\nBoot4 partition size: %Xh\n" "Boot5 partition offset: %Xh\nBoot5 partition size: %Xh\n" "Checksum: %" PRIX64 "h", (UINT32)header.size(), (UINT32)header.size(), ifwiHeader->DataPartition.Offset, ifwiHeader->DataPartition.Size, ifwiHeader->BootPartition[0].Offset, ifwiHeader->BootPartition[0].Size, ifwiHeader->BootPartition[1].Offset, ifwiHeader->BootPartition[1].Size, ifwiHeader->BootPartition[2].Offset, ifwiHeader->BootPartition[2].Size, ifwiHeader->BootPartition[3].Offset, ifwiHeader->BootPartition[3].Size, ifwiHeader->BootPartition[4].Offset, ifwiHeader->BootPartition[4].Size, ifwiHeader->Checksum); // Add tree item index = model->addItem(0, Types::IfwiHeader, 0, name, UString(), info, UByteArray(), header, UByteArray(), Fixed, parent); std::vector partitions; // Add data partition { IFWI_PARTITION_INFO partition = {}; partition.type = Types::IfwiPartition; partition.subtype = Subtypes::DataIfwiPartition; partition.ptEntry = ifwiHeader->DataPartition; partitions.push_back(partition); } // Add boot partitions for (UINT8 i = 0 ; i < 4; i++) { if (ifwiHeader->BootPartition[i].Offset != 0 && ifwiHeader->BootPartition[i].Offset != 0xFFFFFFFF) { IFWI_PARTITION_INFO partition = {}; partition.type = Types::IfwiPartition; partition.subtype = Subtypes::BootIfwiPartition; partition.ptEntry = ifwiHeader->BootPartition[i]; partitions.push_back(partition); } } make_partition_table_consistent: if (partitions.empty()) { return U_INVALID_ME_PARTITION_TABLE; } // Sort partitions by offset std::sort(partitions.begin(), partitions.end()); // Check for intersections and paddings between partitions IFWI_PARTITION_INFO padding = {}; // Check intersection with the partition table header if (partitions.front().ptEntry.Offset < ptSize) { msg(usprintf("%s: IFWI partition has intersection with IFWI layout header, skipped", __FUNCTION__), index); partitions.erase(partitions.begin()); goto make_partition_table_consistent; } // Check for padding between partition table and the first partition else if (partitions.front().ptEntry.Offset > ptSize) { padding.ptEntry.Offset = ptSize; padding.ptEntry.Size = partitions.front().ptEntry.Offset - ptSize; padding.type = Types::Padding; partitions.insert(partitions.begin(), padding); } // Check for intersections/paddings between partitions for (size_t i = 1; i < partitions.size(); i++) { UINT32 previousPartitionEnd = partitions[i - 1].ptEntry.Offset + partitions[i - 1].ptEntry.Size; // Check that current region is fully present in the image if ((UINT32)partitions[i].ptEntry.Offset + (UINT32)partitions[i].ptEntry.Size > (UINT32)region.size()) { if ((UINT32)partitions[i].ptEntry.Offset >= (UINT32)region.size()) { msg(usprintf("%s: IFWI partition is located outside of the opened image, skipped", __FUNCTION__), index); partitions.erase(partitions.begin() + i); goto make_partition_table_consistent; } else { msg(usprintf("%s: IFWI partition can't fit into the region, truncated", __FUNCTION__), index); partitions[i].ptEntry.Size = (UINT32)region.size() - (UINT32)partitions[i].ptEntry.Offset; } } // Check for intersection with previous partition if (partitions[i].ptEntry.Offset < previousPartitionEnd) { // Check if current partition is located inside previous one if (partitions[i].ptEntry.Offset + partitions[i].ptEntry.Size <= previousPartitionEnd) { msg(usprintf("%s: IFWI partition is located inside another IFWI partition, skipped", __FUNCTION__), index); partitions.erase(partitions.begin() + i); goto make_partition_table_consistent; } else { msg(usprintf("%s: IFWI partition intersects with previous one, skipped", __FUNCTION__), index); partitions.erase(partitions.begin() + i); goto make_partition_table_consistent; } } // Check for padding between current and previous partitions else if (partitions[i].ptEntry.Offset > previousPartitionEnd) { padding.ptEntry.Offset = previousPartitionEnd; padding.ptEntry.Size = partitions[i].ptEntry.Offset - previousPartitionEnd; padding.type = Types::Padding; std::vector::iterator iter = partitions.begin(); std::advance(iter, i); partitions.insert(iter, padding); } } // Check for padding after the last region if ((UINT32)partitions.back().ptEntry.Offset + (UINT32)partitions.back().ptEntry.Size < (UINT32)region.size()) { padding.ptEntry.Offset = partitions.back().ptEntry.Offset + partitions.back().ptEntry.Size; padding.ptEntry.Size = (UINT32)(region.size() - padding.ptEntry.Offset); padding.type = Types::Padding; partitions.push_back(padding); } // Partition map is consistent for (size_t i = 0; i < partitions.size(); i++) { UByteArray partition = region.mid(partitions[i].ptEntry.Offset, partitions[i].ptEntry.Size); if (partitions[i].type == Types::IfwiPartition) { UModelIndex partitionIndex; if (partitions[i].subtype == Subtypes::DataIfwiPartition) { name = "Data partition"; } else if (partitions[i].subtype == Subtypes::BootIfwiPartition) { name = "Boot partition"; } // Get info info = usprintf("Full size: %Xh (%u)\n", (UINT32)partition.size(), (UINT32)partition.size()); // Add tree item partitionIndex = model->addItem(partitions[i].ptEntry.Offset, partitions[i].type, partitions[i].subtype, name, UString(), info, UByteArray(), partition, UByteArray(), Fixed, parent); // Parse partition further if (partitions[i].subtype == Subtypes::DataIfwiPartition) { UModelIndex dataPartitionFptRegionIndex; parseFptRegion(partition, partitionIndex, dataPartitionFptRegionIndex); } else if (partitions[i].subtype == Subtypes::BootIfwiPartition) { // Parse code partition contents UModelIndex bootPartitionBpdtRegionIndex; ffsParser->parseBpdtRegion(partition, 0, 0, partitionIndex, bootPartitionBpdtRegionIndex); } } else if (partitions[i].type == Types::Padding) { // Get info name = UString("Padding"); info = usprintf("Full size: %Xh (%u)", (UINT32)partition.size(), (UINT32)partition.size()); // Add tree item model->addItem(partitions[i].ptEntry.Offset, Types::Padding, getPaddingType(partition), name, UString(), info, UByteArray(), partition, UByteArray(), Fixed, parent); } } return U_SUCCESS; } USTATUS MeParser::parseIfwi17Region(const UByteArray & region, const UModelIndex & parent, UModelIndex & index) { // Check region size again if ((UINT32)region.size() < sizeof(IFWI_17_LAYOUT_HEADER)) { msg(usprintf("%s: ME region too small to fit IFWI 1.7 layout header", __FUNCTION__), parent); return U_INVALID_ME_PARTITION_TABLE; } const IFWI_17_LAYOUT_HEADER* ifwiHeader = (const IFWI_17_LAYOUT_HEADER*)region.constData(); // TODO: add check for HeaderSize to be 0x40 // Add header UINT32 ptSize = sizeof(IFWI_17_LAYOUT_HEADER); UByteArray header = region.left(ptSize); UString name = UString("IFWI 1.7 header"); UString info = usprintf("Full size: %Xh (%u)\n" "Flags: %02Xh\n" "Reserved: %02Xh\n" "Checksum: %Xh\n" "Data partition offset: %Xh\nData partition size: %Xh\n" "Boot1 partition offset: %Xh\nBoot1 partition size: %Xh\n" "Boot2 partition offset: %Xh\nBoot2 partition size: %Xh\n" "Boot3 partition offset: %Xh\nBoot3 partition size: %Xh\n" "Boot4 partition offset: %Xh\nBoot4 partition size: %Xh\n" "Boot5 partition offset: %Xh\nBoot5 partition size: %Xh\n" "Temp page offset: %Xh\nTemp page size: %Xh\n", (UINT32)header.size(), (UINT32)header.size(), ifwiHeader->Flags, ifwiHeader->Reserved, ifwiHeader->Checksum, ifwiHeader->DataPartition.Offset, ifwiHeader->DataPartition.Size, ifwiHeader->BootPartition[0].Offset, ifwiHeader->BootPartition[0].Size, ifwiHeader->BootPartition[1].Offset, ifwiHeader->BootPartition[1].Size, ifwiHeader->BootPartition[2].Offset, ifwiHeader->BootPartition[2].Size, ifwiHeader->BootPartition[3].Offset, ifwiHeader->BootPartition[3].Size, ifwiHeader->BootPartition[4].Offset, ifwiHeader->BootPartition[4].Size, ifwiHeader->TempPage.Offset, ifwiHeader->TempPage.Size); // Add tree item index = model->addItem(0, Types::IfwiHeader, 0, name, UString(), info, UByteArray(), header, UByteArray(), Fixed, parent); std::vector partitions; // Add data partition { IFWI_PARTITION_INFO partition = {}; partition.type = Types::IfwiPartition; partition.subtype = Subtypes::DataIfwiPartition; partition.ptEntry = ifwiHeader->DataPartition; partitions.push_back(partition); } // Add boot partitions for (UINT8 i = 0 ; i < 4; i++) { if (ifwiHeader->BootPartition[i].Offset != 0 && ifwiHeader->BootPartition[i].Offset != 0xFFFFFFFF) { IFWI_PARTITION_INFO partition = {}; partition.type = Types::IfwiPartition; partition.subtype = Subtypes::BootIfwiPartition; partition.ptEntry = ifwiHeader->BootPartition[i]; partitions.push_back(partition); } } // Add temp page if (ifwiHeader->TempPage.Offset != 0 && ifwiHeader->TempPage.Offset != 0xFFFFFFFF) { IFWI_PARTITION_INFO partition = {}; partition.type = Types::IfwiPartition; partition.subtype = Subtypes::DataPadding; partition.ptEntry = ifwiHeader->TempPage; partitions.push_back(partition); } make_partition_table_consistent: if (partitions.empty()) { return U_INVALID_ME_PARTITION_TABLE; } // Sort partitions by offset std::sort(partitions.begin(), partitions.end()); // Check for intersections and paddings between partitions IFWI_PARTITION_INFO padding = {}; // Check intersection with the partition table header if (partitions.front().ptEntry.Offset < ptSize) { msg(usprintf("%s: IFWI partition has intersection with IFWI layout header, skipped", __FUNCTION__), index); partitions.erase(partitions.begin()); goto make_partition_table_consistent; } // Check for padding between partition table and the first partition else if (partitions.front().ptEntry.Offset > ptSize) { padding.ptEntry.Offset = ptSize; padding.ptEntry.Size = partitions.front().ptEntry.Offset - ptSize; padding.type = Types::Padding; partitions.insert(partitions.begin(), padding); } // Check for intersections/paddings between partitions for (size_t i = 1; i < partitions.size(); i++) { UINT32 previousPartitionEnd = partitions[i - 1].ptEntry.Offset + partitions[i - 1].ptEntry.Size; // Check that current region is fully present in the image if ((UINT32)partitions[i].ptEntry.Offset + (UINT32)partitions[i].ptEntry.Size > (UINT32)region.size()) { if ((UINT32)partitions[i].ptEntry.Offset >= (UINT32)region.size()) { msg(usprintf("%s: IFWI partition is located outside of the opened image, skipped", __FUNCTION__), index); partitions.erase(partitions.begin() + i); goto make_partition_table_consistent; } else { msg(usprintf("%s: IFWI partition can't fit into the region, truncated", __FUNCTION__), index); partitions[i].ptEntry.Size = (UINT32)region.size() - (UINT32)partitions[i].ptEntry.Offset; } } // Check for intersection with previous partition if (partitions[i].ptEntry.Offset < previousPartitionEnd) { // Check if current partition is located inside previous one if (partitions[i].ptEntry.Offset + partitions[i].ptEntry.Size <= previousPartitionEnd) { msg(usprintf("%s: IFWI partition is located inside another IFWI partition, skipped", __FUNCTION__), index); partitions.erase(partitions.begin() + i); goto make_partition_table_consistent; } else { msg(usprintf("%s: IFWI partition intersects with previous one, skipped", __FUNCTION__), index); partitions.erase(partitions.begin() + i); goto make_partition_table_consistent; } } // Check for padding between current and previous partitions else if (partitions[i].ptEntry.Offset > previousPartitionEnd) { padding.ptEntry.Offset = previousPartitionEnd; padding.ptEntry.Size = partitions[i].ptEntry.Offset - previousPartitionEnd; padding.type = Types::Padding; std::vector::iterator iter = partitions.begin(); std::advance(iter, i); partitions.insert(iter, padding); } } // Check for padding after the last region if ((UINT32)partitions.back().ptEntry.Offset + (UINT32)partitions.back().ptEntry.Size < (UINT32)region.size()) { padding.ptEntry.Offset = partitions.back().ptEntry.Offset + partitions.back().ptEntry.Size; padding.ptEntry.Size = (UINT32)(region.size() - padding.ptEntry.Offset); padding.type = Types::Padding; partitions.push_back(padding); } // Partition map is consistent for (size_t i = 0; i < partitions.size(); i++) { UByteArray partition = region.mid(partitions[i].ptEntry.Offset, partitions[i].ptEntry.Size); if (partitions[i].type == Types::IfwiPartition) { UModelIndex partitionIndex; if (partitions[i].subtype == Subtypes::DataIfwiPartition) { name = "Data partition"; } else if (partitions[i].subtype == Subtypes::BootIfwiPartition){ name = "Boot partition"; } else { name = "Temp page"; } // Get info info = usprintf("Full size: %Xh (%u)\n", (UINT32)partition.size(), (UINT32)partition.size()); // Add tree item partitionIndex = model->addItem(partitions[i].ptEntry.Offset, partitions[i].type, partitions[i].subtype, name, UString(), info, UByteArray(), partition, UByteArray(), Fixed, parent); // Parse partition further if (partitions[i].subtype == Subtypes::DataIfwiPartition) { UModelIndex dataPartitionFptRegionIndex; parseFptRegion(partition, partitionIndex, dataPartitionFptRegionIndex); } else if (partitions[i].subtype == Subtypes::BootIfwiPartition) { // Parse code partition contents UModelIndex bootPartitionBpdtRegionIndex; ffsParser->parseBpdtRegion(partition, 0, 0, partitionIndex, bootPartitionBpdtRegionIndex); } } else if (partitions[i].type == Types::Padding) { // Get info name = UString("Padding"); info = usprintf("Full size: %Xh (%u)", (UINT32)partition.size(), (UINT32)partition.size()); // Add tree item model->addItem(partitions[i].ptEntry.Offset, Types::Padding, getPaddingType(partition), name, UString(), info, UByteArray(), partition, UByteArray(), Fixed, parent); } } return U_SUCCESS; } #endif // U_ENABLE_ME_PARSING_SUPPORT UEFITool-A66/common/meparser.h000077500000000000000000000045261442134156300162720ustar00rootroot00000000000000/* meparser.h Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php. THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef MEPARSER_H #define MEPARSER_H #include #include "basetypes.h" #include "ustring.h" #include "ubytearray.h" #include "treemodel.h" #include "ffsparser.h" #include "digest/sha2.h" #ifdef U_ENABLE_ME_PARSING_SUPPORT class MeParser { public: // Default constructor and destructor MeParser(TreeModel* treeModel, FfsParser* parser) : model(treeModel), ffsParser(parser) {} ~MeParser() {} // Returns messages std::vector > getMessages() const { return messagesVector; } // Clears messages void clearMessages() { messagesVector.clear(); } // ME parsing USTATUS parseMeRegionBody(const UModelIndex & index); private: TreeModel *model; FfsParser *ffsParser; std::vector > messagesVector; void msg(const UString message, const UModelIndex index = UModelIndex()) { messagesVector.push_back(std::pair(message, index)); } USTATUS parseFptRegion(const UByteArray & region, const UModelIndex & parent, UModelIndex & index); USTATUS parseIfwi16Region(const UByteArray & region, const UModelIndex & parent, UModelIndex & index); USTATUS parseIfwi17Region(const UByteArray & region, const UModelIndex & parent, UModelIndex & index); }; #else class MeParser { public: // Default constructor and destructor MeParser(TreeModel* treeModel, FfsParser* parser) { U_UNUSED_PARAMETER(treeModel); U_UNUSED_PARAMETER(parser); } ~MeParser() {} // Returns messages std::vector > getMessages() const { return std::vector >(); } // Clears messages void clearMessages() {} // ME parsing USTATUS parseMeRegionBody(const UModelIndex & index) { U_UNUSED_PARAMETER(index); return U_SUCCESS; } }; #endif // U_ENABLE_ME_PARSING_SUPPORT #endif // MEPARSER_H UEFITool-A66/common/meson.build000066400000000000000000000021641442134156300164360ustar00rootroot00000000000000lzma = static_library('lzma', sources: [ 'LZMA/LzmaDecompress.c', 'LZMA/SDK/C/Bra86.c', 'LZMA/SDK/C/LzmaDec.c', 'Tiano/EfiTianoDecompress.c', ], ) bstrlib = static_library('bstrlib', sources: [ 'bstrlib/bstrlib.c', 'bstrlib/bstrwrap.cpp', ], ) uefitoolcommon = static_library('uefitoolcommon', sources: [ 'guiddatabase.cpp', 'types.cpp', 'descriptor.cpp', 'ffs.cpp', 'nvram.cpp', 'nvramparser.cpp', 'meparser.cpp', 'fitparser.cpp', 'ffsparser.cpp', 'ffsreport.cpp', 'peimage.cpp', 'treeitem.cpp', 'treemodel.cpp', 'utility.cpp', 'ustring.cpp', 'generated/ami_nvar.cpp', 'generated/intel_acbp_v1.cpp', 'generated/intel_acbp_v2.cpp', 'generated/intel_keym_v1.cpp', 'generated/intel_keym_v2.cpp', 'generated/intel_acm.cpp', 'kaitai/kaitaistream.cpp', 'digest/sha1.c', 'digest/sha256.c', 'digest/sha512.c', 'digest/sm3.c', ], cpp_args: [ '-DU_ENABLE_NVRAM_PARSING_SUPPORT', '-DU_ENABLE_ME_PARSING_SUPPORT', '-DU_ENABLE_FIT_PARSING_SUPPORT', '-DU_ENABLE_GUID_DATABASE_SUPPORT', ], ) UEFITool-A66/common/nvram.cpp000066400000000000000000000243761442134156300161340ustar00rootroot00000000000000/* nvram.cpp Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php. THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "nvram.h" #include "ubytearray.h" // // GUIDs mentioned in by nvram.h // extern const UByteArray NVRAM_NVAR_STORE_FILE_GUID // CEF5B9A3-476D-497F-9FDC-E98143E0422C ("\xA3\xB9\xF5\xCE\x6D\x47\x7F\x49\x9F\xDC\xE9\x81\x43\xE0\x42\x2C", 16); extern const UByteArray NVRAM_NVAR_EXTERNAL_DEFAULTS_FILE_GUID // 9221315B-30BB-46B5-813E-1B1BF4712BD3 ("\x5B\x31\x21\x92\xBB\x30\xB5\x46\x81\x3E\x1B\x1B\xF4\x71\x2B\xD3", 16); extern const UByteArray NVRAM_NVAR_PEI_EXTERNAL_DEFAULTS_FILE_GUID // 77D3DC50-D42B-4916-AC80-8F469035D150 ("\x50\xDC\xD3\x77\x2B\xD4\x16\x49\xAC\x80\x8F\x46\x90\x35\xD1\x50", 16); extern const UByteArray NVRAM_NVAR_BB_DEFAULTS_FILE_GUID // AF516361-B4C5-436E-A7E3-A149A31B1461 ("\x61\x63\x51\xAF\xC5\xB4\x6E\x43\xA7\xE3\xA1\x49\xA3\x1B\x14\x61", 16); extern const UByteArray NVRAM_MAIN_STORE_VOLUME_GUID // FFF12B8D-7696-4C8B-A985-2747075B4F50 ("\x8D\x2B\xF1\xFF\x96\x76\x8B\x4C\xA9\x85\x27\x47\x07\x5B\x4F\x50", 16); extern const UByteArray NVRAM_ADDITIONAL_STORE_VOLUME_GUID // 00504624-8A59-4EEB-BD0F-6B36E96128E0 ("\x24\x46\x50\x00\x59\x8A\xEB\x4E\xBD\x0F\x6B\x36\xE9\x61\x28\xE0", 16); extern const UByteArray NVRAM_VSS2_AUTH_VAR_KEY_DATABASE_GUID // AAF32C78-947B-439A-A180-2E144EC37792 ("\x78\x2C\xF3\xAA\x7B\x94\x9A\x43\xA1\x80\x2E\x14\x4E\xC3\x77\x92"); extern const UByteArray NVRAM_VSS2_STORE_GUID // DDCF3617-3275-4164-98B6-FE85707FFE7D ("\x17\x36\xCF\xDD\x75\x32\x64\x41\x98\xB6\xFE\x85\x70\x7F\xFE\x7D"); extern const UByteArray NVRAM_FDC_STORE_GUID // DDCF3616-3275-4164-98B6-FE85707FFE7D ("\x16\x36\xCF\xDD\x75\x32\x64\x41\x98\xB6\xFE\x85\x70\x7F\xFE\x7D"); extern const UByteArray EDKII_WORKING_BLOCK_SIGNATURE_GUID // 9E58292B-7C68-497D-0ACE6500FD9F1B95 ("\x2B\x29\x58\x9E\x68\x7C\x7D\x49\x0A\xCE\x65\x00\xFD\x9F\x1B\x95", 16); extern const UByteArray VSS2_WORKING_BLOCK_SIGNATURE_GUID // 9E58292B-7C68-497D-A0CE6500FD9F1B95 ("\x2B\x29\x58\x9E\x68\x7C\x7D\x49\xA0\xCE\x65\x00\xFD\x9F\x1B\x95", 16); extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_VOLUME_HEADER // B091E7D2-05A0-4198-94F0-74B7B8C55459 ("\xD2\xE7\x91\xB0\xA0\x05\x98\x41\x94\xF0\x74\xB7\xB8\xC5\x54\x59", 16); extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_MICROCODES_GUID // FD3F690E-B4B0-4D68-89DB-19A1A3318F90 ("\x0E\x69\x3F\xFD\xB0\xB4\x68\x4D\x89\xDB\x19\xA1\xA3\x31\x8F\x90", 16); extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_CMDB_GUID // 46310243-7B03-4132-BE44-2243FACA7CDD ("\x43\x02\x31\x46\x03\x7B\x32\x41\xBE\x44\x22\x43\xFA\xCA\x7C\xDD", 16); extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_PUBKEY1_GUID // 1B2C4952-D778-4B64-BDA1-15A36F5FA545 ("\x52\x49\x2C\x1B\x78\xD7\x64\x4B\xBD\xA1\x15\xA3\x6F\x5F\xA5\x45", 16); extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_MARKER1_GUID // 127C1C4E-9135-46E3-B006-F9808B0559A5 ("\x4E\x1C\x7C\x12\x35\x91\xE3\x46\xB0\x06\xF9\x80\x8B\x05\x59\xA5", 16); extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_PUBKEY2_GUID // 7CE75114-8272-45AF-B536-761BD38852CE ("\x14\x51\xE7\x7C\x72\x82\xAF\x45\xB5\x36\x76\x1B\xD3\x88\x52\xCE", 16); extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_MARKER2_GUID // 071A3DBE-CFF4-4B73-83F0-598C13DCFDD5 ("\xBE\x3D\x1A\x07\xF4\xCF\x73\x4B\x83\xF0\x59\x8C\x13\xDC\xFD\xD5", 16); extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_EVSA1_GUID // FACFB110-7BFD-4EFB-873E-88B6B23B97EA ("\x10\xB1\xCF\xFA\xFD\x7B\xFB\x4E\x87\x3E\x88\xB6\xB2\x3B\x97\xEA", 16); extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_EVSA2_GUID // E68DC11A-A5F4-4AC3-AA2E-29E298BFF645 ("\x1A\xC1\x8D\xE6\xF4\xA5\xC3\x4A\xAA\x2E\x29\xE2\x98\xBF\xF6\x45", 16); extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_EVSA3_GUID // 4B3828AE-0ACE-45B6-8CDB-DAFC28BBF8C5 ("\xAE\x28\x38\x4B\xCE\x0A\xB6\x45\x8C\xDB\xDA\xFC\x28\xBB\xF8\xC5", 16); extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_EVSA4_GUID // C22E6B8A-8159-49A3-B353-E84B79DF19C0 ("\x8A\x6B\x2E\xC2\x59\x81\xA3\x49\xB3\x53\xE8\x4B\x79\xDF\x19\xC0", 16); extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_EVSA5_GUID // B6B5FAB9-75C4-4AAE-8314-7FFFA7156EAA ("\xB9\xFA\xB5\xB6\xC4\x75\xAE\x4A\x83\x14\x7F\xFF\xA7\x15\x6E\xAA", 16); extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_EVSA6_GUID // 919B9699-8DD0-4376-AA0B-0E54CCA47D8F ("\x99\x96\x9B\x91\xD0\x8D\x76\x43\xAA\x0B\x0E\x54\xCC\xA4\x7D\x8F", 16); extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_EVSA7_GUID // 58A90A52-929F-44F8-AC35-A7E1AB18AC91 ("\x52\x0A\xA9\x58\x9F\x92\xF8\x44\xAC\x35\xA7\xE1\xAB\x18\xAC\x91", 16); extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_SELF_GUID // 8CB71915-531F-4AF5-82BF-A09140817BAA ("\x15\x19\xB7\x8C\x1F\x53\xF5\x4A\x82\xBF\xA0\x91\x40\x81\x7B\xAA", 16); extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_SIGNATURE ("\x5F\x46\x4C\x41\x53\x48\x5F\x4D\x41\x50", 10); UString nvarAttributesToUString(const UINT8 attributes) { if (attributes == 0x00 || attributes == 0xFF) return UString(); UString str; if (attributes & NVRAM_NVAR_ENTRY_RUNTIME) str += UString(", Runtime"); if (attributes & NVRAM_NVAR_ENTRY_ASCII_NAME) str += UString(", AsciiName"); if (attributes & NVRAM_NVAR_ENTRY_GUID) str += UString(", Guid"); if (attributes & NVRAM_NVAR_ENTRY_DATA_ONLY) str += UString(", DataOnly"); if (attributes & NVRAM_NVAR_ENTRY_EXT_HEADER) str += UString(", ExtHeader"); if (attributes & NVRAM_NVAR_ENTRY_HW_ERROR_RECORD) str += UString(", HwErrorRecord"); if (attributes & NVRAM_NVAR_ENTRY_AUTH_WRITE) str += UString(", AuthWrite"); if (attributes & NVRAM_NVAR_ENTRY_VALID) str += UString(", Valid"); str.remove(0, 2); // Remove first comma and space return str; } UString nvarExtendedAttributesToUString(const UINT8 attributes) { UString str; if (attributes & NVRAM_NVAR_ENTRY_EXT_CHECKSUM) str += UString(", Checksum"); if (attributes & NVRAM_NVAR_ENTRY_EXT_AUTH_WRITE) str += UString(", AuthWrite"); if (attributes & NVRAM_NVAR_ENTRY_EXT_TIME_BASED) str += UString(", TimeBasedAuthWrite"); if (attributes & NVRAM_NVAR_ENTRY_EXT_UNKNOWN_MASK) str += UString(", Unknown"); str.remove(0, 2); // Remove first comma and space return str; } extern UString vssAttributesToUString(const UINT32 attributes) { UString str; if (attributes & NVRAM_VSS_VARIABLE_NON_VOLATILE) str += UString(", NonVolatile"); if (attributes & NVRAM_VSS_VARIABLE_BOOTSERVICE_ACCESS) str += UString(", BootService"); if (attributes & NVRAM_VSS_VARIABLE_RUNTIME_ACCESS) str += UString(", Runtime"); if (attributes & NVRAM_VSS_VARIABLE_HARDWARE_ERROR_RECORD) str += UString(", HwErrorRecord"); if (attributes & NVRAM_VSS_VARIABLE_AUTHENTICATED_WRITE_ACCESS) str += UString(", AuthWrite"); if (attributes & NVRAM_VSS_VARIABLE_TIME_BASED_AUTHENTICATED_WRITE_ACCESS) str += UString(", TimeBasedAuthWrite"); if (attributes & NVRAM_VSS_VARIABLE_APPEND_WRITE) str += UString(", AppendWrite"); if (attributes & NVRAM_VSS_VARIABLE_APPLE_DATA_CHECKSUM) str += UString(", AppleChecksum"); if (attributes & NVRAM_VSS_VARIABLE_UNKNOWN_MASK) str += UString(", Unknown"); str.remove(0, 2); // Remove first comma and space return str; } UString evsaAttributesToUString(const UINT32 attributes) { UString str; if (attributes & NVRAM_EVSA_DATA_NON_VOLATILE) str += UString(", NonVolatile"); if (attributes & NVRAM_EVSA_DATA_BOOTSERVICE_ACCESS) str += UString(", BootService"); if (attributes & NVRAM_EVSA_DATA_RUNTIME_ACCESS) str += UString(", Runtime"); if (attributes & NVRAM_EVSA_DATA_HARDWARE_ERROR_RECORD) str += UString(", HwErrorRecord"); if (attributes & NVRAM_EVSA_DATA_AUTHENTICATED_WRITE_ACCESS) str += UString(", AuthWrite"); if (attributes & NVRAM_EVSA_DATA_TIME_BASED_AUTHENTICATED_WRITE_ACCESS) str += UString(", TimeBasedAuthWrite"); if (attributes & NVRAM_EVSA_DATA_APPEND_WRITE) str += UString(", AppendWrite"); if (attributes & NVRAM_EVSA_DATA_EXTENDED_HEADER) str += UString(", ExtendedHeader"); if (attributes & NVRAM_EVSA_DATA_UNKNOWN_MASK) str += UString(", Unknown"); str.remove(0, 2); // Remove first comma and space return str; } UString efiTimeToUString(const EFI_TIME & time) { return usprintf("%04u-%02u-%02uT%02u:%02u:%02u.%u", time.Year, time.Month, time.Day, time.Hour, time.Minute, time.Second, time.Nanosecond); } UString flashMapGuidToUString(const EFI_GUID & guid) { const UByteArray baGuid((const char*)&guid, sizeof(EFI_GUID)); if (baGuid == NVRAM_PHOENIX_FLASH_MAP_VOLUME_HEADER) return UString("Volume header"); if (baGuid == NVRAM_PHOENIX_FLASH_MAP_MICROCODES_GUID) return UString("Microcodes"); if (baGuid == NVRAM_PHOENIX_FLASH_MAP_CMDB_GUID) return UString("CMDB"); if (baGuid == NVRAM_PHOENIX_FLASH_MAP_PUBKEY1_GUID || baGuid == NVRAM_PHOENIX_FLASH_MAP_PUBKEY2_GUID) return UString("SLIC pubkey"); if (baGuid == NVRAM_PHOENIX_FLASH_MAP_MARKER1_GUID || baGuid == NVRAM_PHOENIX_FLASH_MAP_MARKER2_GUID) return UString("SLIC marker"); if (baGuid == NVRAM_PHOENIX_FLASH_MAP_EVSA1_GUID || baGuid == NVRAM_PHOENIX_FLASH_MAP_EVSA2_GUID || baGuid == NVRAM_PHOENIX_FLASH_MAP_EVSA3_GUID || baGuid == NVRAM_PHOENIX_FLASH_MAP_EVSA4_GUID || baGuid == NVRAM_PHOENIX_FLASH_MAP_EVSA5_GUID || baGuid == NVRAM_PHOENIX_FLASH_MAP_EVSA6_GUID || baGuid == NVRAM_PHOENIX_FLASH_MAP_EVSA7_GUID) return UString("EVSA store"); if (baGuid == NVRAM_PHOENIX_FLASH_MAP_SELF_GUID) return UString("Flash map"); return UString("Unknown"); } UEFITool-A66/common/nvram.h000077500000000000000000000374471442134156300156070ustar00rootroot00000000000000/* nvram.h Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php. THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef NVRAM_H #define NVRAM_H #include "basetypes.h" #include "ubytearray.h" #include "ustring.h" // Make sure we use right packing rules #pragma pack(push, 1) // // NVAR store and entry // extern const UByteArray NVRAM_NVAR_STORE_FILE_GUID; // CEF5B9A3-476D-497F-9FDC-E98143E0422C extern const UByteArray NVRAM_NVAR_EXTERNAL_DEFAULTS_FILE_GUID; // 9221315B-30BB-46B5-813E-1B1BF4712BD3 extern const UByteArray NVRAM_NVAR_PEI_EXTERNAL_DEFAULTS_FILE_GUID; // 77D3DC50-D42B-4916-AC80-8F469035D150 extern const UByteArray NVRAM_NVAR_BB_DEFAULTS_FILE_GUID; // AF516361-B4C5-436E-A7E3-A149A31B1461 extern UString nvarAttributesToUString(const UINT8 attributes); extern UString nvarExtendedAttributesToUString(const UINT8 attributes); extern UString efiTimeToUString(const EFI_TIME & time); typedef struct NVAR_ENTRY_HEADER_ { UINT32 Signature; // NVAR UINT16 Size; // Size of the entry including header UINT32 Next : 24; // Offset to the next entry in a list, or empty if the latest in the list UINT32 Attributes : 8; // Attributes } NVAR_ENTRY_HEADER; // NVAR signature #define NVRAM_NVAR_ENTRY_SIGNATURE 0x5241564E // Attributes #define NVRAM_NVAR_ENTRY_RUNTIME 0x01 #define NVRAM_NVAR_ENTRY_ASCII_NAME 0x02 #define NVRAM_NVAR_ENTRY_GUID 0x04 #define NVRAM_NVAR_ENTRY_DATA_ONLY 0x08 #define NVRAM_NVAR_ENTRY_EXT_HEADER 0x10 #define NVRAM_NVAR_ENTRY_HW_ERROR_RECORD 0x20 #define NVRAM_NVAR_ENTRY_AUTH_WRITE 0x40 #define NVRAM_NVAR_ENTRY_VALID 0x80 // Extended attributes #define NVRAM_NVAR_ENTRY_EXT_CHECKSUM 0x01 #define NVRAM_NVAR_ENTRY_EXT_AUTH_WRITE 0x10 #define NVRAM_NVAR_ENTRY_EXT_TIME_BASED 0x20 #define NVRAM_NVAR_ENTRY_EXT_UNKNOWN_MASK 0xCE // // TianoCore VSS store and variables // extern const UByteArray NVRAM_MAIN_STORE_VOLUME_GUID; // FFF12B8D-7696-4C8B-A985-2747075B4F50 extern const UByteArray NVRAM_ADDITIONAL_STORE_VOLUME_GUID; // 00504624-8A59-4EEB-BD0F-6B36E96128E0 #define NVRAM_VSS_STORE_SIGNATURE 0x53535624 // $VSS #define NVRAM_APPLE_SVS_STORE_SIGNATURE 0x53565324 // $SVS #define NVRAM_APPLE_NSS_STORE_SIGNATURE 0x53534E24 // $NSS #define NVRAM_APPLE_FSYS_STORE_SIGNATURE 0x73797346 // Fsys #define NVRAM_APPLE_GAID_STORE_SIGNATURE 0x64696147 // Gaid #define NVRAM_VSS_VARIABLE_START_ID 0x55AA // Variable store header flags #define NVRAM_VSS_VARIABLE_STORE_FORMATTED 0x5a #define NVRAM_VSS_VARIABLE_STORE_HEALTHY 0xfe // Variable store status #define NVRAM_VSS_VARIABLE_STORE_STATUS_RAW 0 #define NVRAM_VSS_VARIABLE_STORE_STATUS_VALID 1 #define NVRAM_VSS_VARIABLE_STORE_STATUS_INVALID 2 #define NVRAM_VSS_VARIABLE_STORE_STATUS_UNKNOWN 3 // Variable store header typedef struct VSS_VARIABLE_STORE_HEADER_ { UINT32 Signature; // $VSS signature UINT32 Size; // Size of variable store, including store header UINT8 Format; // Store format state UINT8 State; // Store health state UINT16 Unknown; // Used in Apple $SVS varstores UINT32 : 32; } VSS_VARIABLE_STORE_HEADER; // Normal variable header typedef struct VSS_VARIABLE_HEADER_ { UINT16 StartId; // Variable start marker AA55 UINT8 State; // Variable state UINT8 Reserved; UINT32 Attributes; // Variable attributes UINT32 NameSize; // Size of variable name, stored as null-terminated UCS2 string UINT32 DataSize; // Size of variable data without header and name EFI_GUID VendorGuid; // Variable vendor GUID } VSS_VARIABLE_HEADER; // Intel variable header typedef struct VSS_INTEL_VARIABLE_HEADER_ { UINT16 StartId; // Variable start marker AA55 UINT8 State; // Variable state UINT8 Reserved; UINT32 Attributes; // Variable attributes UINT32 TotalSize; // Size of variable including header EFI_GUID VendorGuid; // Variable vendor GUID } VSS_INTEL_VARIABLE_HEADER; // Apple variation of normal variable header, with one new field typedef struct VSS_APPLE_VARIABLE_HEADER_ { UINT16 StartId; // Variable start marker AA55 UINT8 State; // Variable state UINT8 Reserved; UINT32 Attributes; // Variable attributes UINT32 NameSize; // Size of variable name, stored as null-terminated UCS2 string UINT32 DataSize; // Size of variable data without header and name EFI_GUID VendorGuid; // Variable vendor GUID UINT32 DataCrc32; // CRC32 of the data } VSS_APPLE_VARIABLE_HEADER; // Authenticated variable header, used for SecureBoot vars typedef struct VSS_AUTH_VARIABLE_HEADER_ { UINT16 StartId; // Variable start marker AA55 UINT8 State; // Variable state UINT8 Reserved; UINT32 Attributes; // Variable attributes UINT64 MonotonicCounter; // Monotonic counter against replay attack EFI_TIME Timestamp; // Time stamp against replay attack UINT32 PubKeyIndex; // Index in PubKey database UINT32 NameSize; // Size of variable name, stored as null-terminated UCS2 string UINT32 DataSize; // Size of variable data without header and name EFI_GUID VendorGuid; // Variable vendor GUID } VSS_AUTH_VARIABLE_HEADER; // VSS variable states #define NVRAM_VSS_VARIABLE_IN_DELETED_TRANSITION 0xfe // Variable is in obsolete transistion #define NVRAM_VSS_VARIABLE_DELETED 0xfd // Variable is obsolete #define NVRAM_VSS_VARIABLE_HEADER_VALID 0x7f // Variable has valid header #define NVRAM_VSS_VARIABLE_ADDED 0x3f // Variable has been completely added #define NVRAM_VSS_INTEL_VARIABLE_VALID 0xfc // Intel special variable valid #define NVRAM_VSS_INTEL_VARIABLE_INVALID 0xf8 // Intel special variable invalid // VSS variable attributes #define NVRAM_VSS_VARIABLE_NON_VOLATILE 0x00000001 #define NVRAM_VSS_VARIABLE_BOOTSERVICE_ACCESS 0x00000002 #define NVRAM_VSS_VARIABLE_RUNTIME_ACCESS 0x00000004 #define NVRAM_VSS_VARIABLE_HARDWARE_ERROR_RECORD 0x00000008 #define NVRAM_VSS_VARIABLE_AUTHENTICATED_WRITE_ACCESS 0x00000010 #define NVRAM_VSS_VARIABLE_TIME_BASED_AUTHENTICATED_WRITE_ACCESS 0x00000020 #define NVRAM_VSS_VARIABLE_APPEND_WRITE 0x00000040 #define NVRAM_VSS_VARIABLE_APPLE_DATA_CHECKSUM 0x80000000 #define NVRAM_VSS_VARIABLE_UNKNOWN_MASK 0x7FFFFF80 extern UString vssAttributesToUString(const UINT32 attributes); // // VSS2 variables // #define NVRAM_VSS2_AUTH_VAR_KEY_DATABASE_GUID_PART1 0xaaf32c78 extern const UByteArray NVRAM_VSS2_AUTH_VAR_KEY_DATABASE_GUID; // AAF32C78-947B-439A-A180-2E144EC37792 #define NVRAM_VSS2_STORE_GUID_PART1 0xddcf3617 extern const UByteArray NVRAM_VSS2_STORE_GUID; // DDCF3617-3275-4164-98B6-FE85707FFE7D extern const UByteArray NVRAM_FDC_STORE_GUID; // DDCF3616-3275-4164-98B6-FE85707FFE7D // Variable store header typedef struct VSS2_VARIABLE_STORE_HEADER_ { EFI_GUID Signature; // VSS2 Store Guid UINT32 Size; // Size of variable store, including store header UINT8 Format; // Store format state UINT8 State; // Store health state UINT16 Unknown; UINT32 : 32; } VSS2_VARIABLE_STORE_HEADER; // VSS2 entries are 4-bytes aligned in VSS2 stores // // _FDC region // #define NVRAM_FDC_VOLUME_SIGNATURE 0x4344465F typedef struct FDC_VOLUME_HEADER_ { UINT32 Signature; //_FDC signature UINT32 Size; // Size of the whole region //EFI_FIRMWARE_VOLUME_HEADER VolumeHeader; //EFI_FV_BLOCK_MAP_ENTRY FvBlockMap[2]; //VSS_VARIABLE_STORE_HEADER VssHeader; } FDC_VOLUME_HEADER; // // FTW block // #define EFI_FAULT_TOLERANT_WORKING_BLOCK_VALID 0x1 #define EFI_FAULT_TOLERANT_WORKING_BLOCK_INVALID 0x2 extern const UByteArray EDKII_WORKING_BLOCK_SIGNATURE_GUID; // 9E58292B-7C68-497D-0ACE6500FD9F1B95 extern const UByteArray VSS2_WORKING_BLOCK_SIGNATURE_GUID; // 9E58292B-7C68-497D-A0CE6500FD9F1B95 #define NVRAM_MAIN_STORE_VOLUME_GUID_DATA1 0xFFF12B8D #define EDKII_WORKING_BLOCK_SIGNATURE_GUID_DATA1 0x9E58292B typedef struct EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER32_ { EFI_GUID Signature; // NVRAM_MAIN_STORE_VOLUME_GUID UINT32 Crc; // Crc32 of the header with empty Crc and State fields UINT8 State; UINT8 Reserved[3]; UINT32 WriteQueueSize; // Size of the FTW block without the header //UINT8 WriteQueue[WriteQueueSize]; } EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER32; typedef struct EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER64_ { EFI_GUID Signature; // NVRAM_MAIN_STORE_VOLUME_GUID or EDKII_WORKING_BLOCK_SIGNATURE_GUID UINT32 Crc; // Crc32 of the header with empty Crc and State fields UINT8 State; UINT8 Reserved[3]; UINT64 WriteQueueSize; // Size of the FTW block without the header //UINT8 WriteQueue[WriteQueueSize]; } EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER64; // // Apple Fsys store // typedef struct APPLE_FSYS_STORE_HEADER_ { UINT32 Signature; // Fsys or Gaid signature UINT8 Unknown0; // Still unknown UINT32 Unknown1; // Still unknown UINT16 Size; // Size of variable store } APPLE_FSYS_STORE_HEADER; // Apple Fsys entry format // UINT8 NameLength; // CHAR8 Name[]; // UINT16 DataLength; // UINT8 Data[] // Store ends with a chunk named "EOF" without data // All free bytes in store are zeroed // Has CRC32 of the whole store without checksum field at the end // // EVSA store and entries // #define NVRAM_EVSA_STORE_SIGNATURE 0x41535645 #define NVRAM_EVSA_ENTRY_TYPE_STORE 0xEC #define NVRAM_EVSA_ENTRY_TYPE_GUID1 0xED #define NVRAM_EVSA_ENTRY_TYPE_GUID2 0xE1 #define NVRAM_EVSA_ENTRY_TYPE_NAME1 0xEE #define NVRAM_EVSA_ENTRY_TYPE_NAME2 0xE2 #define NVRAM_EVSA_ENTRY_TYPE_DATA1 0xEF #define NVRAM_EVSA_ENTRY_TYPE_DATA2 0xE3 #define NVRAM_EVSA_ENTRY_TYPE_DATA_INVALID 0x83 typedef struct EVSA_ENTRY_HEADER_ { UINT8 Type; UINT8 Checksum; UINT16 Size; } EVSA_ENTRY_HEADER; typedef struct EVSA_STORE_ENTRY_ { EVSA_ENTRY_HEADER Header; UINT32 Signature; // EVSA signature UINT32 Attributes; UINT32 StoreSize; UINT32 : 32; } EVSA_STORE_ENTRY; typedef struct EVSA_GUID_ENTRY_ { EVSA_ENTRY_HEADER Header; UINT16 GuidId; //EFI_GUID Guid; } EVSA_GUID_ENTRY; typedef struct EVSA_NAME_ENTRY_ { EVSA_ENTRY_HEADER Header; UINT16 VarId; //CHAR16 Name[]; } EVSA_NAME_ENTRY; typedef struct EVSA_DATA_ENTRY_ { EVSA_ENTRY_HEADER Header; UINT16 GuidId; UINT16 VarId; UINT32 Attributes; //UINT8 Data[]; } EVSA_DATA_ENTRY; // VSS variable attributes #define NVRAM_EVSA_DATA_NON_VOLATILE 0x00000001 #define NVRAM_EVSA_DATA_BOOTSERVICE_ACCESS 0x00000002 #define NVRAM_EVSA_DATA_RUNTIME_ACCESS 0x00000004 #define NVRAM_EVSA_DATA_HARDWARE_ERROR_RECORD 0x00000008 #define NVRAM_EVSA_DATA_AUTHENTICATED_WRITE_ACCESS 0x00000010 #define NVRAM_EVSA_DATA_TIME_BASED_AUTHENTICATED_WRITE_ACCESS 0x00000020 #define NVRAM_EVSA_DATA_APPEND_WRITE 0x00000040 #define NVRAM_EVSA_DATA_EXTENDED_HEADER 0x10000000 #define NVRAM_EVSA_DATA_UNKNOWN_MASK 0xEFFFFF80 typedef struct EVSA_DATA_ENTRY_EXTENDED_ { EVSA_ENTRY_HEADER Header; UINT16 GuidId; UINT16 VarId; UINT32 Attributes; UINT32 DataSize; //UINT8 Data[]; } EVSA_DATA_ENTRY_EXTENDED; extern UString evsaAttributesToUString(const UINT32 attributes); // // Phoenix SCT Flash Map // #define NVRAM_PHOENIX_FLASH_MAP_SIGNATURE_PART1 0x414C465F #define NVRAM_PHOENIX_FLASH_MAP_SIGNATURE_LENGTH 10 // _FLASH_MAP extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_SIGNATURE; typedef struct PHOENIX_FLASH_MAP_HEADER_ { UINT8 Signature[10]; // _FLASH_MAP signature UINT16 NumEntries; // Number of entries in the map UINT32 : 32; // Reserved field } PHOENIX_FLASH_MAP_HEADER; typedef struct PHOENIX_FLASH_MAP_ENTRY_ { EFI_GUID Guid; UINT16 DataType; UINT16 EntryType; UINT64 PhysicalAddress; UINT32 Size; UINT32 Offset; } PHOENIX_FLASH_MAP_ENTRY; #define NVRAM_PHOENIX_FLASH_MAP_ENTRY_TYPE_VOLUME 0x0000 #define NVRAM_PHOENIX_FLASH_MAP_ENTRY_TYPE_DATA_BLOCK 0x0001 extern UString flashMapGuidToUString(const EFI_GUID & guid); extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_VOLUME_HEADER; // B091E7D2-05A0-4198-94F0-74B7B8C55459 extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_MICROCODES_GUID; // FD3F690E-B4B0-4D68-89DB-19A1A3318F90 extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_CMDB_GUID; // 46310243-7B03-4132-BE44-2243FACA7CDD extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_PUBKEY1_GUID; // 1B2C4952-D778-4B64-BDA1-15A36F5FA545 extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_MARKER1_GUID; // 127C1C4E-9135-46E3-B006-F9808B0559A5 extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_PUBKEY2_GUID; // 7CE75114-8272-45AF-B536-761BD38852CE extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_MARKER2_GUID; // 071A3DBE-CFF4-4B73-83F0-598C13DCFDD5 extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_EVSA1_GUID; // FACFB110-7BFD-4EFB-873E-88B6B23B97EA extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_EVSA2_GUID; // E68DC11A-A5F4-4AC3-AA2E-29E298BFF645 extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_EVSA3_GUID; // 4B3828AE-0ACE-45B6-8CDB-DAFC28BBF8C5 extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_EVSA4_GUID; // C22E6B8A-8159-49A3-B353-E84B79DF19C0 extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_EVSA5_GUID; // B6B5FAB9-75C4-4AAE-8314-7FFFA7156EAA extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_EVSA6_GUID; // 919B9699-8DD0-4376-AA0B-0E54CCA47D8F extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_EVSA7_GUID; // 58A90A52-929F-44F8-AC35-A7E1AB18AC91 extern const UByteArray NVRAM_PHOENIX_FLASH_MAP_SELF_GUID; // 8CB71915-531F-4AF5-82BF-A09140817BAA // // SLIC pubkey and marker // typedef struct OEM_ACTIVATION_PUBKEY_ { UINT32 Type; // 0 UINT32 Size; // 0x9C UINT8 KeyType; UINT8 Version; UINT16 Reserved; UINT32 Algorithm; UINT32 Magic; // RSA1 signature UINT32 BitLength; UINT32 Exponent; UINT8 Modulus[128]; } OEM_ACTIVATION_PUBKEY; #define OEM_ACTIVATION_PUBKEY_TYPE 0x00000000 #define OEM_ACTIVATION_PUBKEY_MAGIC 0x31415352 // RSA1 typedef struct OEM_ACTIVATION_MARKER_ { UINT32 Type; // 1 UINT32 Size; // 0xB6 UINT32 Version; UINT8 OemId[6]; UINT8 OemTableId[8]; UINT64 WindowsFlag; // WINDOWS signature UINT32 SlicVersion; UINT8 Reserved[16]; UINT8 Signature[128]; } OEM_ACTIVATION_MARKER; #define OEM_ACTIVATION_MARKER_TYPE 0x00000001 #define OEM_ACTIVATION_MARKER_WINDOWS_FLAG_PART1 0x444E4957 #define OEM_ACTIVATION_MARKER_WINDOWS_FLAG 0x2053574F444E4957UL #define OEM_ACTIVATION_MARKER_RESERVED_BYTE 0x00 // // Phoenix CMDB, no londer used, requires no parsing // typedef struct PHOENIX_CMDB_HEADER_ { UINT32 Signature; // CMDB signature UINT32 HeaderSize; // Size of this header UINT32 TotalSize; // Total size of header and chunks, without strings // UINT8 StartChunk[3]; // UINT8 StringChunk[5][x]; // C_STR Strings[2*x + 1]; } PHOENIX_CMDB_HEADER; #define NVRAM_PHOENIX_CMDB_HEADER_SIGNATURE 0x42444D43 #define NVRAM_PHOENIX_CMDB_SIZE 0x100; // Restore previous packing rules #pragma pack(pop) #endif // NVRAM_H UEFITool-A66/common/nvramparser.cpp000077500000000000000000002513141442134156300173460ustar00rootroot00000000000000/* nvramparser.cpp Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php. THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifdef U_ENABLE_NVRAM_PARSING_SUPPORT #include #include "nvramparser.h" #include "parsingdata.h" #include "ustring.h" #include "utility.h" #include "nvram.h" #include "ffs.h" #include "intel_microcode.h" #include "umemstream.h" #include "kaitai/kaitaistream.h" #include "generated/ami_nvar.h" USTATUS NvramParser::parseNvarStore(const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; UByteArray nvar = model->body(index); // Nothing to parse in an empty store if (nvar.isEmpty()) return U_SUCCESS; try { const UINT32 localOffset = (UINT32)model->header(index).size(); umemstream is(nvar.constData(), nvar.size()); kaitai::kstream ks(&is); ami_nvar_t parsed(&ks); UINT16 guidsInStore = 0; UINT32 currentEntryIndex = 0; for (const auto & entry : *parsed.entries()) { UINT8 subtype = Subtypes::FullNvarEntry; UString name; UString text; UString info; UString guid; UByteArray header; UByteArray body; UByteArray tail; // This is a terminating entry, needs special processing if (entry->_is_null_signature_rest()) { UINT32 guidAreaSize = guidsInStore * sizeof(EFI_GUID); UINT32 unparsedSize = (UINT32)nvar.size() - entry->offset() - guidAreaSize; // Check if the data left is a free space or a padding UByteArray padding = nvar.mid(entry->offset(), unparsedSize); // Get info UString info = usprintf("Full size: %Xh (%u)", (UINT32)padding.size(), (UINT32)padding.size()); if ((UINT32)padding.count(0xFF) == unparsedSize) { // Free space // Add tree item model->addItem(localOffset + entry->offset(), Types::FreeSpace, 0, UString("Free space"), UString(), info, UByteArray(), padding, UByteArray(), Fixed, index); } else { // Nothing is parsed yet, but the file is not empty if (entry->offset() == 0) { msg(usprintf("%s: file can't be parsed as NVAR variable store", __FUNCTION__), index); return U_SUCCESS; } // Add tree item model->addItem(localOffset + entry->offset(), Types::Padding, getPaddingType(padding), UString("Padding"), UString(), info, UByteArray(), padding, UByteArray(), Fixed, index); } // Add GUID store area UByteArray guidArea = nvar.right(guidAreaSize); // Get info name = UString("GUID store"); info = usprintf("Full size: %Xh (%u)\nGUIDs in store: %u", (UINT32)guidArea.size(), (UINT32)guidArea.size(), guidsInStore); // Add tree item model->addItem((UINT32)(localOffset + entry->offset() + padding.size()), Types::NvarGuidStore, 0, name, UString(), info, UByteArray(), guidArea, UByteArray(), Fixed, index); return U_SUCCESS; } // This is a normal entry const auto entry_body = entry->body(); // Set default next to predefined last value NVAR_ENTRY_PARSING_DATA pdata = {}; pdata.emptyByte = 0xFF; pdata.next = 0xFFFFFF; pdata.isValid = TRUE; // Check for invalid entry if (!entry->attributes()->valid()) { subtype = Subtypes::InvalidNvarEntry; name = UString("Invalid"); pdata.isValid = FALSE; goto processing_done; } // Check for link entry if (entry->next() != 0xFFFFFF) { subtype = Subtypes::LinkNvarEntry; pdata.next = (UINT32)entry->next(); } // Check for data-only entry (nameless and GUIDless entry or link) if (entry->attributes()->data_only()) { // Search backwards for a previous entry with a link to this variable UModelIndex prevEntryIndex; if (currentEntryIndex > 0) { for (UINT32 i = currentEntryIndex - 1; i > 0; i--) { const auto & previousEntry = parsed.entries()->at(i); if (previousEntry == entry) break; if ((UINT32)previousEntry->next() + (UINT32)previousEntry->offset() == (UINT32)entry->offset()) { // Previous link is present and valid prevEntryIndex = index.model()->index(i, 0, index); // Make sure that we are linking to a valid entry NVAR_ENTRY_PARSING_DATA pd = readUnaligned((NVAR_ENTRY_PARSING_DATA*)model->parsingData(prevEntryIndex).constData()); if (!pd.isValid) { prevEntryIndex = UModelIndex(); } break; } } } // Check if the link is valid if (prevEntryIndex.isValid()) { // Use the name and text of the previous entry name = model->name(prevEntryIndex); text = model->text(prevEntryIndex); if (entry->next() == 0xFFFFFF) subtype = Subtypes::DataNvarEntry; } else { subtype = Subtypes::InvalidLinkNvarEntry; name = UString("InvalidLink"); pdata.isValid = FALSE; } goto processing_done; } // Obtain text if (!entry_body->_is_null_ascii_name()) { text = entry_body->ascii_name().c_str(); } else if (!entry_body->_is_null_ucs2_name()) { UByteArray temp; for (const auto & ch : *entry_body->ucs2_name()->ucs2_chars()) { temp += UByteArray((const char*)&ch, sizeof(ch)); } text = uFromUcs2(temp.constData()); } // Obtain GUID if (!entry_body->_is_null_guid()) { // GUID is stored in the entry itself const EFI_GUID g = readUnaligned((EFI_GUID*)entry_body->guid().c_str()); name = guidToUString(g); guid = guidToUString(g, false); } else { // GUID is stored in GUID store at the end of the NVAR store // Grow the GUID store if needed if (guidsInStore < entry_body->guid_index() + 1) guidsInStore = entry_body->guid_index() + 1; // The list begins at the end of the store and goes backwards const EFI_GUID g = readUnaligned((EFI_GUID*)(nvar.constData() + nvar.size()) - (entry_body->guid_index() + 1)); name = guidToUString(g); guid = guidToUString(g, false); } processing_done: // This feels hacky, but I haven't found a way to ask Kaitai for raw bytes header = nvar.mid(entry->offset(), sizeof(NVAR_ENTRY_HEADER) + entry_body->data_start_offset()); body = nvar.mid(entry->offset() + sizeof(NVAR_ENTRY_HEADER) + entry_body->data_start_offset(), entry_body->data_size()); tail = nvar.mid(entry->end_offset() - entry_body->extended_header_size(), entry_body->extended_header_size()); // Add GUID info for valid entries if (!guid.isEmpty()) info += UString("Variable GUID: ") + guid + "\n"; // Add GUID index information if (!entry_body->_is_null_guid_index()) info += usprintf("GUID index: %u\n", entry_body->guid_index()); // Add header, body and extended data info info += usprintf("Full size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\nTail size: %Xh (%u)", entry->size(), entry->size(), (UINT32)header.size(), (UINT32)header.size(), (UINT32)body.size(), (UINT32)body.size(), (UINT32)tail.size(), (UINT32)tail.size()); // Add attributes info const NVAR_ENTRY_HEADER entryHeader = readUnaligned((NVAR_ENTRY_HEADER*)header.constData()); info += usprintf("\nAttributes: %02Xh", entryHeader.Attributes); // Translate attributes to text if (entryHeader.Attributes != 0x00 && entryHeader.Attributes != 0xFF) info += UString(" (") + nvarAttributesToUString(entryHeader.Attributes) + UString(")"); // Add next node info if (entry->next() != 0xFFFFFF) info += usprintf("\nNext node at offset: %Xh", localOffset + entry->offset() + (UINT32)entry->next()); // Add extended header info if (entry_body->extended_header_size() > 0) { info += usprintf("\nExtended header size: %Xh (%u)", entry_body->extended_header_size(), entry_body->extended_header_size()); const UINT8 extendedAttributes = *tail.constData(); info += usprintf("\nExtended attributes: %02Xh (", extendedAttributes) + nvarExtendedAttributesToUString(extendedAttributes) + UString(")"); // Add checksum if (!entry_body->_is_null_extended_header_checksum()) { UINT8 calculatedChecksum = 0; UByteArray wholeBody = body + tail; // Include entry body UINT8* start = (UINT8*)wholeBody.constData(); for (UINT8* p = start; p < start + wholeBody.size(); p++) { calculatedChecksum += *p; } // Include entry size and flags start = (UINT8*)&entryHeader.Size; for (UINT8*p = start; p < start + sizeof(UINT16); p++) { calculatedChecksum += *p; } // Include entry attributes calculatedChecksum += entryHeader.Attributes; info += usprintf("\nChecksum: %02Xh, ", entry_body->extended_header_checksum()) + (calculatedChecksum ? usprintf(", invalid, should be %02Xh", 0x100 - calculatedChecksum) : UString(", valid")); } // Add timestamp if (!entry_body->_is_null_extended_header_timestamp()) info += usprintf("\nTimestamp: %" PRIX64 "h", entry_body->extended_header_timestamp()); // Add hash if (!entry_body->_is_null_extended_header_hash()) { UByteArray hash = UByteArray(entry_body->extended_header_hash().c_str(), entry_body->extended_header_hash().size()); info += UString("\nHash: ") + UString(hash.toHex().constData()); } } // Add tree item UModelIndex varIndex = model->addItem(localOffset + entry->offset(), Types::NvarEntry, subtype, name, text, info, header, body, tail, Fixed, index); currentEntryIndex++; // Set parsing data model->setParsingData(varIndex, UByteArray((const char*)&pdata, sizeof(pdata))); // Try parsing the entry data as NVAR storage if it begins with NVAR signature if ((subtype == Subtypes::DataNvarEntry || subtype == Subtypes::FullNvarEntry) && body.size() >= 4 && readUnaligned((const UINT32*)body.constData()) == NVRAM_NVAR_ENTRY_SIGNATURE) (void)parseNvarStore(varIndex); } } catch (...) { msg(usprintf("%s: unable to parse AMI NVAR storage", __FUNCTION__), index); return U_INVALID_STORE; } return U_SUCCESS; } USTATUS NvramParser::parseNvramVolumeBody(const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // Obtain required fields from parsing data UINT8 emptyByte = 0xFF; if (model->hasEmptyParsingData(index) == false) { UByteArray data = model->parsingData(index); const VOLUME_PARSING_DATA* pdata = (const VOLUME_PARSING_DATA*)data.constData(); emptyByte = pdata->emptyByte; } // Get local offset UINT32 localOffset = (UINT32)model->header(index).size(); // Get item data UByteArray data = model->body(index); // Search for first store USTATUS result; UINT32 prevStoreOffset; result = findNextStore(index, data, localOffset, 0, prevStoreOffset); if (result) return result; // First store is not at the beginning of volume body UString name; UString info; if (prevStoreOffset > 0) { // Get info UByteArray padding = data.left(prevStoreOffset); name = UString("Padding"); info = usprintf("Full size: %Xh (%u)", (UINT32)padding.size(), (UINT32)padding.size()); // Add tree item model->addItem(localOffset, Types::Padding, getPaddingType(padding), name, UString(), info, UByteArray(), padding, UByteArray(), Fixed, index); } // Search for and parse all stores UINT32 storeOffset = prevStoreOffset; UINT32 prevStoreSize = 0; while (!result) { // Padding between stores if (storeOffset > prevStoreOffset + prevStoreSize) { UINT32 paddingOffset = prevStoreOffset + prevStoreSize; UINT32 paddingSize = storeOffset - paddingOffset; UByteArray padding = data.mid(paddingOffset, paddingSize); // Get info name = UString("Padding"); info = usprintf("Full size: %Xh (%u)", (UINT32)padding.size(), (UINT32)padding.size()); // Add tree item model->addItem(localOffset + paddingOffset, Types::Padding, getPaddingType(padding), name, UString(), info, UByteArray(), padding, UByteArray(), Fixed, index); } // Get store size UINT32 storeSize = 0; result = getStoreSize(data, storeOffset, storeSize); if (result) { msg(usprintf("%s: getStoreSize failed with error ", __FUNCTION__) + errorCodeToUString(result), index); return result; } // Check that current store is fully present in input if (storeSize > (UINT32)data.size() || storeOffset + storeSize > (UINT32)data.size()) { // Mark the rest as padding and finish parsing UByteArray padding = data.mid(storeOffset); // Get info name = UString("Padding"); info = usprintf("Full size: %Xh (%u)", (UINT32)padding.size(), (UINT32)padding.size()); // Add tree item UModelIndex paddingIndex = model->addItem(localOffset + storeOffset, Types::Padding, getPaddingType(padding), name, UString(), info, UByteArray(), padding, UByteArray(), Fixed, index); msg(usprintf("%s: one of stores inside overlaps the end of data", __FUNCTION__), paddingIndex); // Update variables prevStoreOffset = storeOffset; prevStoreSize = (UINT32)padding.size(); break; } // Parse current store header UModelIndex storeIndex; UByteArray store = data.mid(storeOffset, storeSize); result = parseStoreHeader(store, localOffset + storeOffset, index, storeIndex); if (result) msg(usprintf("%s: store header parsing failed with error ", __FUNCTION__) + errorCodeToUString(result), index); // Go to next store prevStoreOffset = storeOffset; prevStoreSize = storeSize; result = findNextStore(index, data, localOffset, storeOffset + prevStoreSize, storeOffset); } // Padding/free space at the end storeOffset = prevStoreOffset + prevStoreSize; if ((UINT32)data.size() > storeOffset) { UByteArray padding = data.mid(storeOffset); // Add info info = usprintf("Full size: %Xh (%u)", (UINT32)padding.size(), (UINT32)padding.size()); if (padding.count(emptyByte) == padding.size()) { // Free space // Add tree item model->addItem(localOffset + storeOffset, Types::FreeSpace, 0, UString("Free space"), UString(), info, UByteArray(), padding, UByteArray(), Fixed, index); } else { // Nothing is parsed yet, but the file is not empty if (!storeOffset) { msg(usprintf("%s: can't be parsed as NVRAM volume", __FUNCTION__), index); return U_SUCCESS; } // Add tree item model->addItem(localOffset + storeOffset, Types::Padding, getPaddingType(padding), UString("Padding"), UString(), info, UByteArray(), padding, UByteArray(), Fixed, index); } } // Parse bodies for (int i = 0; i < model->rowCount(index); i++) { UModelIndex current = index.model()->index(i, 0, index); switch (model->type(current)) { case Types::FdcStore: parseFdcStoreBody(current); break; case Types::VssStore: parseVssStoreBody(current, 0); break; case Types::Vss2Store: parseVssStoreBody(current, 4); break; case Types::FsysStore: parseFsysStoreBody(current); break; case Types::EvsaStore: parseEvsaStoreBody(current); break; case Types::FlashMapStore: parseFlashMapBody(current); break; default: // Ignore unknown! break; } } return U_SUCCESS; } USTATUS NvramParser::findNextStore(const UModelIndex & index, const UByteArray & volume, const UINT32 localOffset, const UINT32 storeOffset, UINT32 & nextStoreOffset) { UINT32 dataSize = (UINT32)volume.size(); if (dataSize < sizeof(UINT32)) return U_STORES_NOT_FOUND; // TODO: add checks for restSize // TODO: remove misaligned access by doing the signature checks differently, the current way is UB is C++ // TODO: rewrite this all as Kaitai-based parser UINT32 offset = storeOffset; for (; offset < dataSize - sizeof(UINT32); offset++) { const UINT32* currentPos = (const UINT32*)(volume.constData() + offset); if (readUnaligned(currentPos) == NVRAM_VSS_STORE_SIGNATURE || readUnaligned(currentPos) == NVRAM_APPLE_SVS_STORE_SIGNATURE || readUnaligned(currentPos) == NVRAM_APPLE_NSS_STORE_SIGNATURE) { // $VSS, $SVS or $NSS signatures found, perform checks const VSS_VARIABLE_STORE_HEADER* vssHeader = (const VSS_VARIABLE_STORE_HEADER*)currentPos; if (vssHeader->Format != NVRAM_VSS_VARIABLE_STORE_FORMATTED) { msg(usprintf("%s: VSS store candidate at offset %Xh skipped, has invalid format %02Xh", __FUNCTION__, localOffset + offset, vssHeader->Format), index); continue; } if (vssHeader->Size == 0 || vssHeader->Size == 0xFFFFFFFF) { msg(usprintf("%s: VSS store candidate at offset %Xh skipped, has invalid size %Xh", __FUNCTION__, localOffset + offset, vssHeader->Size), index); continue; } // All checks passed, store found break; } else if (readUnaligned(currentPos) == NVRAM_VSS2_AUTH_VAR_KEY_DATABASE_GUID_PART1 || readUnaligned(currentPos) == NVRAM_VSS2_STORE_GUID_PART1) { // VSS2 store signatures found, perform checks UByteArray guid = UByteArray(volume.constData() + offset, sizeof(EFI_GUID)); if (guid != NVRAM_VSS2_AUTH_VAR_KEY_DATABASE_GUID && guid != NVRAM_VSS2_STORE_GUID) // Check the whole signature continue; const VSS2_VARIABLE_STORE_HEADER* vssHeader = (const VSS2_VARIABLE_STORE_HEADER*)currentPos; if (vssHeader->Format != NVRAM_VSS_VARIABLE_STORE_FORMATTED) { msg(usprintf("%s: VSS2 store candidate at offset %Xh skipped, has invalid format %02Xh", __FUNCTION__, localOffset + offset, vssHeader->Format), index); continue; } if (vssHeader->Size == 0 || vssHeader->Size == 0xFFFFFFFF) { msg(usprintf("%s: VSS2 store candidate at offset %Xh skipped, has invalid size %Xh", __FUNCTION__, localOffset + offset, vssHeader->Size), index); continue; } // All checks passed, store found break; } else if (readUnaligned(currentPos) == NVRAM_FDC_VOLUME_SIGNATURE) { // FDC signature found const FDC_VOLUME_HEADER* fdcHeader = (const FDC_VOLUME_HEADER*)currentPos; if (fdcHeader->Size == 0 || fdcHeader->Size == 0xFFFFFFFF) { msg(usprintf("%s: FDC store candidate at offset %Xh skipped, has invalid size %Xh", __FUNCTION__, localOffset + offset, fdcHeader->Size), index); continue; } // All checks passed, store found break; } else if (readUnaligned(currentPos) == NVRAM_APPLE_FSYS_STORE_SIGNATURE || readUnaligned(currentPos) == NVRAM_APPLE_GAID_STORE_SIGNATURE) { // Fsys or Gaid signature found const APPLE_FSYS_STORE_HEADER* fsysHeader = (const APPLE_FSYS_STORE_HEADER*)currentPos; if (fsysHeader->Size == 0 || fsysHeader->Size == 0xFFFF) { msg(usprintf("%s: Fsys store candidate at offset %Xh skipped, has invalid size %Xh", __FUNCTION__, localOffset + offset, fsysHeader->Size), index); continue; } // All checks passed, store found break; } else if (readUnaligned(currentPos) == NVRAM_EVSA_STORE_SIGNATURE) { //EVSA signature found if (offset < sizeof(UINT32)) continue; const EVSA_STORE_ENTRY* evsaHeader = (const EVSA_STORE_ENTRY*)(currentPos - 1); if (evsaHeader->Header.Type != NVRAM_EVSA_ENTRY_TYPE_STORE) { msg(usprintf("%s: EVSA store candidate at offset %Xh skipped, has invalid type %02Xh", __FUNCTION__, localOffset + offset - 4, evsaHeader->Header.Type), index); continue; } if (evsaHeader->StoreSize == 0 || evsaHeader->StoreSize == 0xFFFFFFFF) { msg(usprintf("%s: EVSA store candidate at offset %Xh skipped, has invalid size %Xh", __FUNCTION__, localOffset + offset, evsaHeader->StoreSize), index); continue; } // All checks passed, store found offset -= sizeof(UINT32); break; } else if (readUnaligned(currentPos) == NVRAM_MAIN_STORE_VOLUME_GUID_DATA1 || readUnaligned(currentPos) == EDKII_WORKING_BLOCK_SIGNATURE_GUID_DATA1) { // Possible FTW block signature found UByteArray guid = UByteArray(volume.constData() + offset, sizeof(EFI_GUID)); if (guid != NVRAM_MAIN_STORE_VOLUME_GUID && guid != EDKII_WORKING_BLOCK_SIGNATURE_GUID && guid != VSS2_WORKING_BLOCK_SIGNATURE_GUID) // Check the whole signature continue; // Detect header variant based on WriteQueueSize const EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER32* ftwHeader = (const EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER32*)currentPos; if (ftwHeader->WriteQueueSize % 0x10 == 0x04) { // Header with 32 bit WriteQueueSize if (ftwHeader->WriteQueueSize == 0 || ftwHeader->WriteQueueSize == 0xFFFFFFFF) { msg(usprintf("%s: FTW block candidate at offset %Xh skipped, has invalid body size %Xh", __FUNCTION__, localOffset + offset, ftwHeader->WriteQueueSize), index); continue; } } else if (ftwHeader->WriteQueueSize % 0x10 == 0x00) { // Header with 64 bit WriteQueueSize const EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER64* ftw64Header = (const EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER64*)currentPos; if (ftw64Header->WriteQueueSize == 0 || ftw64Header->WriteQueueSize >= 0xFFFFFFFF) { msg(usprintf("%s: FTW block candidate at offset %Xh skipped, has invalid body size %" PRIX64 "h", __FUNCTION__, localOffset + offset, ftw64Header->WriteQueueSize), index); continue; } } else // Unknown header continue; // All checks passed, store found break; } else if (readUnaligned(currentPos) == NVRAM_PHOENIX_FLASH_MAP_SIGNATURE_PART1) {// Phoenix SCT flash map UByteArray signature = UByteArray(volume.constData() + offset, NVRAM_PHOENIX_FLASH_MAP_SIGNATURE_LENGTH); if (signature != NVRAM_PHOENIX_FLASH_MAP_SIGNATURE) // Check the whole signature continue; // All checks passed, store found break; } else if (readUnaligned(currentPos) == NVRAM_PHOENIX_CMDB_HEADER_SIGNATURE) { // Phoenix SCT CMDB store const PHOENIX_CMDB_HEADER* cmdbHeader = (const PHOENIX_CMDB_HEADER*)currentPos; // Check size if (cmdbHeader->HeaderSize != sizeof(PHOENIX_CMDB_HEADER)) continue; // All checks passed, store found break; } else if (readUnaligned(currentPos) == INTEL_MICROCODE_HEADER_VERSION_1) {// Intel microcode const INTEL_MICROCODE_HEADER* ucodeHeader = (const INTEL_MICROCODE_HEADER*)currentPos; // TotalSize is greater then DataSize and is multiple of 1024 if (FALSE == ffsParser->microcodeHeaderValid(ucodeHeader)) { continue; } // All checks passed, store found break; } else if (readUnaligned(currentPos) == OEM_ACTIVATION_PUBKEY_MAGIC) { // SLIC pubkey if (offset < 4 * sizeof(UINT32)) continue; const OEM_ACTIVATION_PUBKEY* pubkeyHeader = (const OEM_ACTIVATION_PUBKEY*)(currentPos - 4); // Check type if (pubkeyHeader->Type != OEM_ACTIVATION_PUBKEY_TYPE) continue; // All checks passed, store found offset -= 4 * sizeof(UINT32); break; } else if (readUnaligned(currentPos) == OEM_ACTIVATION_MARKER_WINDOWS_FLAG_PART1) { // SLIC marker if (offset < 26 || offset >= dataSize - sizeof(UINT64) || *(const UINT64*)currentPos != OEM_ACTIVATION_MARKER_WINDOWS_FLAG) // Check full windows flag and structure size continue; const OEM_ACTIVATION_MARKER* markerHeader = (const OEM_ACTIVATION_MARKER*)(volume.constData() + offset - 26); // Check reserved bytes bool reservedBytesValid = true; for (UINT32 i = 0; i < sizeof(markerHeader->Reserved); i++) if (markerHeader->Reserved[i] != OEM_ACTIVATION_MARKER_RESERVED_BYTE) { reservedBytesValid = false; break; } if (!reservedBytesValid) continue; // All checks passed, store found offset -= 26; break; } } // No more stores found if (offset >= dataSize - sizeof(UINT32)) return U_STORES_NOT_FOUND; nextStoreOffset = offset; return U_SUCCESS; } USTATUS NvramParser::getStoreSize(const UByteArray & data, const UINT32 storeOffset, UINT32 & storeSize) { const UINT32* signature = (const UINT32*)(data.constData() + storeOffset); if (*signature == NVRAM_VSS_STORE_SIGNATURE || *signature == NVRAM_APPLE_SVS_STORE_SIGNATURE || *signature == NVRAM_APPLE_NSS_STORE_SIGNATURE) { const VSS_VARIABLE_STORE_HEADER* vssHeader = (const VSS_VARIABLE_STORE_HEADER*)signature; storeSize = vssHeader->Size; } else if (*signature == NVRAM_VSS2_AUTH_VAR_KEY_DATABASE_GUID_PART1 || *signature == NVRAM_VSS2_STORE_GUID_PART1) { const VSS2_VARIABLE_STORE_HEADER* vssHeader = (const VSS2_VARIABLE_STORE_HEADER*)signature; storeSize = vssHeader->Size; } else if (*signature == NVRAM_FDC_VOLUME_SIGNATURE) { const FDC_VOLUME_HEADER* fdcHeader = (const FDC_VOLUME_HEADER*)signature; storeSize = fdcHeader->Size; } else if (*signature == NVRAM_APPLE_FSYS_STORE_SIGNATURE || *signature == NVRAM_APPLE_GAID_STORE_SIGNATURE) { const APPLE_FSYS_STORE_HEADER* fsysHeader = (const APPLE_FSYS_STORE_HEADER*)signature; storeSize = fsysHeader->Size; } else if (*(signature + 1) == NVRAM_EVSA_STORE_SIGNATURE) { const EVSA_STORE_ENTRY* evsaHeader = (const EVSA_STORE_ENTRY*)signature; storeSize = evsaHeader->StoreSize; } else if (*signature == NVRAM_MAIN_STORE_VOLUME_GUID_DATA1 || *signature == EDKII_WORKING_BLOCK_SIGNATURE_GUID_DATA1) { const EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER32* ftwHeader = (const EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER32*)signature; if (ftwHeader->WriteQueueSize % 0x10 == 0x04) { // Header with 32 bit WriteQueueSize storeSize = sizeof(EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER32) + ftwHeader->WriteQueueSize; } else { // Header with 64 bit WriteQueueSize const EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER64* ftw64Header = (const EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER64*)signature; storeSize = sizeof(EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER64) + (UINT32)ftw64Header->WriteQueueSize; } } else if (*signature == NVRAM_PHOENIX_FLASH_MAP_SIGNATURE_PART1) { // Phoenix SCT flash map const PHOENIX_FLASH_MAP_HEADER* flashMapHeader = (const PHOENIX_FLASH_MAP_HEADER*)signature; storeSize = sizeof(PHOENIX_FLASH_MAP_HEADER) + sizeof(PHOENIX_FLASH_MAP_ENTRY) * flashMapHeader->NumEntries; } else if (*signature == NVRAM_PHOENIX_CMDB_HEADER_SIGNATURE) { // Phoenix SCT CMDB store storeSize = NVRAM_PHOENIX_CMDB_SIZE; // It's a predefined max size, no need to calculate } else if (*(signature + 4) == OEM_ACTIVATION_PUBKEY_MAGIC) { // SLIC pubkey const OEM_ACTIVATION_PUBKEY* pubkeyHeader = (const OEM_ACTIVATION_PUBKEY*)signature; storeSize = pubkeyHeader->Size; } else if (*(const UINT64*)(data.constData() + storeOffset + 26) == OEM_ACTIVATION_MARKER_WINDOWS_FLAG) { // SLIC marker const OEM_ACTIVATION_MARKER* markerHeader = (const OEM_ACTIVATION_MARKER*)signature; storeSize = markerHeader->Size; } else if (*signature == INTEL_MICROCODE_HEADER_VERSION_1) { // Intel microcode, must be checked after SLIC marker because of the same *signature values const INTEL_MICROCODE_HEADER* ucodeHeader = (const INTEL_MICROCODE_HEADER*)signature; storeSize = ucodeHeader->TotalSize; } else { return U_INVALID_PARAMETER; // Unreachable } return U_SUCCESS; } USTATUS NvramParser::parseVssStoreHeader(const UByteArray & store, const UINT32 localOffset, const bool sizeOverride, const UModelIndex & parent, UModelIndex & index) { const UINT32 dataSize = (UINT32)store.size(); // Check store size if (dataSize < sizeof(VSS_VARIABLE_STORE_HEADER)) { msg(usprintf("%s: volume body is too small even for VSS store header", __FUNCTION__), parent); return U_SUCCESS; } // Get VSS store header const VSS_VARIABLE_STORE_HEADER* vssStoreHeader = (const VSS_VARIABLE_STORE_HEADER*)store.constData(); // Check for size override UINT32 storeSize = vssStoreHeader->Size; if (sizeOverride) { storeSize = dataSize; } // Check store size if (dataSize < storeSize) { msg(usprintf("%s: VSS store size %Xh (%u) is greater than volume body size %Xh (%u)", __FUNCTION__, storeSize, storeSize, dataSize, dataSize), parent); return U_SUCCESS; } // Construct header and body UByteArray header = store.left(sizeof(VSS_VARIABLE_STORE_HEADER)); UByteArray body = store.mid(sizeof(VSS_VARIABLE_STORE_HEADER), storeSize - sizeof(VSS_VARIABLE_STORE_HEADER)); // Add info UString name; if (vssStoreHeader->Signature == NVRAM_APPLE_SVS_STORE_SIGNATURE) { name = UString("SVS store"); } else if (vssStoreHeader->Signature == NVRAM_APPLE_NSS_STORE_SIGNATURE) { name = UString("NSS store"); } else { name = UString("VSS store"); } UString info = usprintf("Signature: %Xh\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\nFormat: %02Xh\nState: %02Xh\nUnknown: %04Xh", vssStoreHeader->Signature, storeSize, storeSize, (UINT32)header.size(), (UINT32)header.size(), (UINT32)body.size(), (UINT32)body.size(), vssStoreHeader->Format, vssStoreHeader->State, vssStoreHeader->Unknown); // Add tree item index = model->addItem(localOffset, Types::VssStore, 0, name, UString(), info, header, body, UByteArray(), Fixed, parent); return U_SUCCESS; } USTATUS NvramParser::parseVss2StoreHeader(const UByteArray & store, const UINT32 localOffset, const bool sizeOverride, const UModelIndex & parent, UModelIndex & index) { const UINT32 dataSize = (UINT32)store.size(); // Check store size if (dataSize < sizeof(VSS2_VARIABLE_STORE_HEADER)) { msg(usprintf("%s: volume body is too small even for VSS2 store header", __FUNCTION__), parent); return U_SUCCESS; } // Get VSS2 store header const VSS2_VARIABLE_STORE_HEADER* vssStoreHeader = (const VSS2_VARIABLE_STORE_HEADER*)store.constData(); // Check for size override UINT32 storeSize = vssStoreHeader->Size; if (sizeOverride) { storeSize = dataSize; } // Check store size if (dataSize < storeSize) { msg(usprintf("%s: VSS2 store size %Xh (%u) is greater than volume body size %Xh (%u)", __FUNCTION__, storeSize, storeSize, dataSize, dataSize), parent); return U_SUCCESS; } // Construct header and body UByteArray header = store.left(sizeof(VSS2_VARIABLE_STORE_HEADER)); UByteArray body = store.mid(sizeof(VSS2_VARIABLE_STORE_HEADER), storeSize - sizeof(VSS2_VARIABLE_STORE_HEADER)); // Add info UString name = UString("VSS2 store"); UString info = UString("Signature: ") + guidToUString(vssStoreHeader->Signature, false) + usprintf("\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\nFormat: %02Xh\nState: %02Xh\nUnknown: %04Xh", storeSize, storeSize, (UINT32)header.size(), (UINT32)header.size(), (UINT32)body.size(), (UINT32)body.size(), vssStoreHeader->Format, vssStoreHeader->State, vssStoreHeader->Unknown); // Add tree item index = model->addItem(localOffset, Types::Vss2Store, 0, name, UString(), info, header, body, UByteArray(), Fixed, parent); return U_SUCCESS; } USTATUS NvramParser::parseFtwStoreHeader(const UByteArray & store, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index) { const UINT32 dataSize = (UINT32)store.size(); // Check store size if (dataSize < sizeof(EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER64)) { msg(usprintf("%s: volume body is too small even for FTW store header", __FUNCTION__), parent); return U_SUCCESS; } // Obtain required information from parent volume UINT8 emptyByte = 0xFF; UModelIndex parentVolumeIndex = model->findParentOfType(parent, Types::Volume); if (parentVolumeIndex.isValid() && model->hasEmptyParsingData(parentVolumeIndex) == false) { UByteArray data = model->parsingData(parentVolumeIndex); const VOLUME_PARSING_DATA* pdata = (const VOLUME_PARSING_DATA*)data.constData(); emptyByte = pdata->emptyByte; } // Get FTW block headers const EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER32* ftw32BlockHeader = (const EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER32*)store.constData(); const EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER64* ftw64BlockHeader = (const EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER64*)store.constData(); // Check store size UINT32 ftwBlockSize; bool has32bitHeader; if (ftw32BlockHeader->WriteQueueSize % 0x10 == 0x04) { // Header with 32 bit WriteQueueSize ftwBlockSize = sizeof(EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER32) + ftw32BlockHeader->WriteQueueSize; has32bitHeader = true; } else { // Header with 64 bit WriteQueueSize ftwBlockSize = sizeof(EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER64) + (UINT32)ftw64BlockHeader->WriteQueueSize; has32bitHeader = false; } if (dataSize < ftwBlockSize) { msg(usprintf("%s: FTW store size %Xh (%u) is greater than volume body size %Xh (%u)", __FUNCTION__, ftwBlockSize, ftwBlockSize, dataSize, dataSize), parent); return U_SUCCESS; } // Construct header and body UINT32 headerSize = has32bitHeader ? sizeof(EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER32) : sizeof(EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER64); UByteArray header = store.left(headerSize); UByteArray body = store.mid(headerSize, ftwBlockSize - headerSize); // Check block header checksum UByteArray crcHeader = header; EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER32* crcFtwBlockHeader = (EFI_FAULT_TOLERANT_WORKING_BLOCK_HEADER32*)header.data(); crcFtwBlockHeader->Crc = emptyByte ? 0xFFFFFFFF : 0; crcFtwBlockHeader->State = emptyByte ? 0xFF : 0; UINT32 calculatedCrc = (UINT32)crc32(0, (const UINT8*)crcFtwBlockHeader, headerSize); // Add info UString name("FTW store"); UString info = UString("Signature: ") + guidToUString(ftw32BlockHeader->Signature, false) + usprintf("\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\nState: %02Xh\nHeader CRC32: %08Xh", ftwBlockSize, ftwBlockSize, headerSize, headerSize, (UINT32)body.size(), (UINT32)body.size(), ftw32BlockHeader->State, ftw32BlockHeader->Crc) + (ftw32BlockHeader->Crc != calculatedCrc ? usprintf(", invalid, should be %08Xh", calculatedCrc) : UString(", valid")); // Add tree item index = model->addItem(localOffset, Types::FtwStore, 0, name, UString(), info, header, body, UByteArray(), Fixed, parent); return U_SUCCESS; } USTATUS NvramParser::parseFdcStoreHeader(const UByteArray & store, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index) { const UINT32 dataSize = (UINT32)store.size(); // Check store size if (dataSize < sizeof(FDC_VOLUME_HEADER)) { msg(usprintf("%s: volume body is too small even for FDC store header", __FUNCTION__), parent); return U_SUCCESS; } // Get Fdc store header const FDC_VOLUME_HEADER* fdcStoreHeader = (const FDC_VOLUME_HEADER*)store.constData(); // Check store size if (dataSize < fdcStoreHeader->Size) { msg(usprintf("%s: FDC store size %Xh (%u) is greater than volume body size %Xh (%u)", __FUNCTION__, fdcStoreHeader->Size, fdcStoreHeader->Size, dataSize, dataSize), parent); return U_SUCCESS; } // Construct header and body UByteArray header = store.left(sizeof(FDC_VOLUME_HEADER)); UByteArray body = store.mid(sizeof(FDC_VOLUME_HEADER), fdcStoreHeader->Size - sizeof(FDC_VOLUME_HEADER)); // Add info UString name("FDC store"); UString info = usprintf("Signature: _FDC\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)", fdcStoreHeader->Size, fdcStoreHeader->Size, (UINT32)header.size(), (UINT32)header.size(), (UINT32)body.size(), (UINT32)body.size()); // Add tree item index = model->addItem(localOffset, Types::FdcStore, 0, name, UString(), info, header, body, UByteArray(), Fixed, parent); return U_SUCCESS; } USTATUS NvramParser::parseFsysStoreHeader(const UByteArray & store, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index) { const UINT32 dataSize = (UINT32)store.size(); // Check store size if (dataSize < sizeof(APPLE_FSYS_STORE_HEADER)) { msg(usprintf("%s: volume body is too small even for Fsys store header", __FUNCTION__), parent); return U_SUCCESS; } // Get Fsys store header const APPLE_FSYS_STORE_HEADER* fsysStoreHeader = (const APPLE_FSYS_STORE_HEADER*)store.constData(); // Check store size if (dataSize < fsysStoreHeader->Size) { msg(usprintf("%s: Fsys store size %Xh (%u) is greater than volume body size %Xh (%u)", __FUNCTION__, fsysStoreHeader->Size, fsysStoreHeader->Size, dataSize, dataSize), parent); return U_SUCCESS; } // Construct header and body UByteArray header = store.left(sizeof(APPLE_FSYS_STORE_HEADER)); UByteArray body = store.mid(sizeof(APPLE_FSYS_STORE_HEADER), fsysStoreHeader->Size - sizeof(APPLE_FSYS_STORE_HEADER) - sizeof(UINT32)); // Check store checksum UINT32 storedCrc = *(UINT32*)store.right(sizeof(UINT32)).constData(); UINT32 calculatedCrc = (UINT32)crc32(0, (const UINT8*)store.constData(), (UINT32)store.size() - sizeof(UINT32)); // Add info bool isGaidStore = (fsysStoreHeader->Signature == NVRAM_APPLE_GAID_STORE_SIGNATURE); UString name = isGaidStore ? UString("Gaid store") : UString("Fsys store"); UString info = usprintf("Signature: %s\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\nUnknown0: %02Xh\nUnknown1: %08Xh\nCRC32: %08Xh", isGaidStore ? "Gaid" : "Fsys", fsysStoreHeader->Size, fsysStoreHeader->Size, (UINT32)header.size(), (UINT32)header.size(), (UINT32)body.size(), (UINT32)body.size(), fsysStoreHeader->Unknown0, fsysStoreHeader->Unknown1, storedCrc) + (storedCrc != calculatedCrc ? usprintf(", invalid, should be %08Xh", calculatedCrc) : UString(", valid")); // Add tree item index = model->addItem(localOffset, Types::FsysStore, 0, name, UString(), info, header, body, UByteArray(), Fixed, parent); return U_SUCCESS; } USTATUS NvramParser::parseEvsaStoreHeader(const UByteArray & store, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index) { const UINT32 dataSize = (UINT32)store.size(); // Check dataSize if (dataSize < sizeof(EVSA_STORE_ENTRY)) { msg(usprintf("%s: volume body is too small even for EVSA store header", __FUNCTION__), parent); return U_SUCCESS; } // Get EVSA store header const EVSA_STORE_ENTRY* evsaStoreHeader = (const EVSA_STORE_ENTRY*)store.constData(); // Check store size if (dataSize < evsaStoreHeader->StoreSize) { msg(usprintf("%s: EVSA store size %Xh (%u) is greater than volume body size %Xh (%u)", __FUNCTION__, evsaStoreHeader->StoreSize, evsaStoreHeader->StoreSize, dataSize, dataSize), parent); return U_SUCCESS; } // Construct header and body UByteArray header = store.left(evsaStoreHeader->Header.Size); UByteArray body = store.mid(evsaStoreHeader->Header.Size, evsaStoreHeader->StoreSize - evsaStoreHeader->Header.Size); // Recalculate checksum UINT8 calculated = calculateChecksum8(((const UINT8*)evsaStoreHeader) + 2, evsaStoreHeader->Header.Size - 2); // Add info UString name("EVSA store"); UString info = usprintf("Signature: EVSA\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\nType: %02Xh\nAttributes: %08Xh\nChecksum: %02Xh", evsaStoreHeader->StoreSize, evsaStoreHeader->StoreSize, (UINT32)header.size(), (UINT32)header.size(), (UINT32)body.size(), (UINT32)body.size(), evsaStoreHeader->Header.Type, evsaStoreHeader->Attributes, evsaStoreHeader->Header.Checksum) + (evsaStoreHeader->Header.Checksum != calculated ? usprintf(", invalid, should be %02Xh", calculated) : UString(", valid")); // Add tree item index = model->addItem(localOffset, Types::EvsaStore, 0, name, UString(), info, header, body, UByteArray(), Fixed, parent); return U_SUCCESS; } USTATUS NvramParser::parseFlashMapStoreHeader(const UByteArray & store, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index) { const UINT32 dataSize = (UINT32)store.size(); // Check data size if (dataSize < sizeof(PHOENIX_FLASH_MAP_HEADER)) { msg(usprintf("%s: volume body is too small even for FlashMap block header", __FUNCTION__), parent); return U_SUCCESS; } // Get FlashMap block header const PHOENIX_FLASH_MAP_HEADER* flashMapHeader = (const PHOENIX_FLASH_MAP_HEADER*)store.constData(); // Check store size UINT32 flashMapSize = sizeof(PHOENIX_FLASH_MAP_HEADER) + flashMapHeader->NumEntries * sizeof(PHOENIX_FLASH_MAP_ENTRY); if (dataSize < flashMapSize) { msg(usprintf("%s: FlashMap block size %Xh (%u) is greater than volume body size %Xh (%u)", __FUNCTION__, flashMapSize, flashMapSize, dataSize, dataSize), parent); return U_SUCCESS; } // Construct header and body UByteArray header = store.left(sizeof(PHOENIX_FLASH_MAP_HEADER)); UByteArray body = store.mid(sizeof(PHOENIX_FLASH_MAP_HEADER), flashMapSize - sizeof(PHOENIX_FLASH_MAP_HEADER)); // Add info UString name("Phoenix SCT flash map"); UString info = usprintf("Signature: _FLASH_MAP\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\nNumber of entries: %u", flashMapSize, flashMapSize, (UINT32)header.size(), (UINT32)header.size(), (UINT32)body.size(), (UINT32)body.size(), flashMapHeader->NumEntries); // Add tree item index = model->addItem(localOffset, Types::FlashMapStore, 0, name, UString(), info, header, body, UByteArray(), Fixed, parent); return U_SUCCESS; } USTATUS NvramParser::parseCmdbStoreHeader(const UByteArray & store, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index) { const UINT32 dataSize = (UINT32)store.size(); // Check store size if (dataSize < sizeof(PHOENIX_CMDB_HEADER)) { msg(usprintf("%s: volume body is too small even for CMDB store header", __FUNCTION__), parent); return U_SUCCESS; } UINT32 cmdbSize = NVRAM_PHOENIX_CMDB_SIZE; if (dataSize < cmdbSize) { msg(usprintf("%s: CMDB store size %Xh (%u) is greater than volume body size %Xh (%u)", __FUNCTION__, cmdbSize, cmdbSize, dataSize, dataSize), parent); return U_SUCCESS; } // Get store header const PHOENIX_CMDB_HEADER* cmdbHeader = (const PHOENIX_CMDB_HEADER*)store.constData(); // Construct header and body UByteArray header = store.left(cmdbHeader->TotalSize); UByteArray body = store.mid(cmdbHeader->TotalSize, cmdbSize - cmdbHeader->TotalSize); // Add info UString name("CMDB store"); UString info = usprintf("Signature: CMDB\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)", cmdbSize, cmdbSize, (UINT32)header.size(), (UINT32)header.size(), (UINT32)body.size(), (UINT32)body.size()); // Add tree item index = model->addItem(localOffset, Types::CmdbStore, 0, name, UString(), info, header, body, UByteArray(), Fixed, parent); return U_SUCCESS; } USTATUS NvramParser::parseSlicPubkeyHeader(const UByteArray & store, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index) { const UINT32 dataSize = (UINT32)store.size(); // Check data size if (dataSize < sizeof(OEM_ACTIVATION_PUBKEY)) { msg(usprintf("%s: volume body is too small even for SLIC pubkey header", __FUNCTION__), parent); return U_SUCCESS; } // Get SLIC pubkey header const OEM_ACTIVATION_PUBKEY* pubkeyHeader = (const OEM_ACTIVATION_PUBKEY*)store.constData(); // Check store size if (dataSize < pubkeyHeader->Size) { msg(usprintf("%s: SLIC pubkey size %Xh (%u) is greater than volume body size %Xh (%u)", __FUNCTION__, pubkeyHeader->Size, pubkeyHeader->Size, dataSize, dataSize), parent); return U_SUCCESS; } // Construct header and body UByteArray header = store.left(sizeof(OEM_ACTIVATION_PUBKEY)); // Add info UString name("SLIC pubkey"); UString info = usprintf("Type: 0h\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: 0h (0)\n" "Key type: %02Xh\nVersion: %02Xh\nAlgorithm: %08Xh\nMagic: RSA1\nBit length: %08Xh\nExponent: %08Xh", pubkeyHeader->Size, pubkeyHeader->Size, (UINT32)header.size(), (UINT32)header.size(), pubkeyHeader->KeyType, pubkeyHeader->Version, pubkeyHeader->Algorithm, pubkeyHeader->BitLength, pubkeyHeader->Exponent); // Add tree item index = model->addItem(localOffset, Types::SlicData, Subtypes::PubkeySlicData, name, UString(), info, header, UByteArray(), UByteArray(), Fixed, parent); return U_SUCCESS; } USTATUS NvramParser::parseSlicMarkerHeader(const UByteArray & store, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index) { const UINT32 dataSize = (UINT32)store.size(); // Check data size if (dataSize < sizeof(OEM_ACTIVATION_MARKER)) { msg(usprintf("%s: volume body is too small even for SLIC marker header", __FUNCTION__), parent); return U_SUCCESS; } // Get SLIC marker header const OEM_ACTIVATION_MARKER* markerHeader = (const OEM_ACTIVATION_MARKER*)store.constData(); // Check store size if (dataSize < markerHeader->Size) { msg(usprintf("%s: SLIC marker size %Xh (%u) is greater than volume body size %Xh (%u)", __FUNCTION__, markerHeader->Size, markerHeader->Size, dataSize, dataSize), parent); return U_SUCCESS; } // Construct header and body UByteArray header = store.left(sizeof(OEM_ACTIVATION_MARKER)); // Add info UString name("SLIC marker"); UString info = usprintf("Type: 1h\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: 0h (0)\n" "Version: %08Xh\nOEM ID: %s\nOEM table ID: %s\nWindows flag: WINDOWS\nSLIC version: %08Xh", markerHeader->Size, markerHeader->Size, (UINT32)header.size(), (UINT32)header.size(), markerHeader->Version, (const char*)UString((const char*)&(markerHeader->OemId)).left(6).toLocal8Bit(), (const char*)UString((const char*)&(markerHeader->OemTableId)).left(8).toLocal8Bit(), markerHeader->SlicVersion); // Add tree item index = model->addItem(localOffset, Types::SlicData, Subtypes::MarkerSlicData, name, UString(), info, header, UByteArray(), UByteArray(), Fixed, parent); return U_SUCCESS; } USTATUS NvramParser::parseStoreHeader(const UByteArray & store, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index) { const UINT32 dataSize = (UINT32)store.size(); const UINT32* signature = (const UINT32*)store.constData(); // Check store size if (dataSize < sizeof(UINT32)) { msg(usprintf("%s: volume body is too small even for a store signature", __FUNCTION__), parent); return U_SUCCESS; } // Check signature and run parser function needed // VSS/SVS/NSS store if (*signature == NVRAM_VSS_STORE_SIGNATURE || *signature == NVRAM_APPLE_SVS_STORE_SIGNATURE || *signature == NVRAM_APPLE_NSS_STORE_SIGNATURE) return parseVssStoreHeader(store, localOffset, false, parent, index); // VSS2 store if (*signature == NVRAM_VSS2_AUTH_VAR_KEY_DATABASE_GUID_PART1 || *signature == NVRAM_VSS2_STORE_GUID_PART1) return parseVss2StoreHeader(store, localOffset, false, parent, index); // FTW store else if (*signature == NVRAM_MAIN_STORE_VOLUME_GUID_DATA1 || *signature == EDKII_WORKING_BLOCK_SIGNATURE_GUID_DATA1) return parseFtwStoreHeader(store, localOffset, parent, index); // FDC store else if (*signature == NVRAM_FDC_VOLUME_SIGNATURE) return parseFdcStoreHeader(store, localOffset, parent, index); // Apple Fsys/Gaid store else if (*signature == NVRAM_APPLE_FSYS_STORE_SIGNATURE || *signature == NVRAM_APPLE_GAID_STORE_SIGNATURE) return parseFsysStoreHeader(store, localOffset, parent, index); // EVSA store else if (dataSize >= 2 * sizeof(UINT32) && *(signature + 1) == NVRAM_EVSA_STORE_SIGNATURE) return parseEvsaStoreHeader(store, localOffset, parent, index); // Phoenix SCT flash map else if (*signature == NVRAM_PHOENIX_FLASH_MAP_SIGNATURE_PART1) return parseFlashMapStoreHeader(store, localOffset, parent, index); // Phoenix CMDB store else if (*signature == NVRAM_PHOENIX_CMDB_HEADER_SIGNATURE) return parseCmdbStoreHeader(store, localOffset, parent, index); // SLIC pubkey else if (dataSize >= 5 * sizeof(UINT32) && *(signature + 4) == OEM_ACTIVATION_PUBKEY_MAGIC) return parseSlicPubkeyHeader(store, localOffset, parent, index); // SLIC marker else if (dataSize >= 34 && *(const UINT64*)(store.constData() + 26) == OEM_ACTIVATION_MARKER_WINDOWS_FLAG) return parseSlicMarkerHeader(store, localOffset, parent, index); // Intel microcode // Must be checked after SLIC marker because of the same *signature values else if (*signature == INTEL_MICROCODE_HEADER_VERSION_1) return ffsParser->parseIntelMicrocodeHeader(store, localOffset, parent, index); msg(usprintf("parseStoreHeader: don't know how to parse a header with signature %08Xh", *signature), parent); return U_SUCCESS; } USTATUS NvramParser::parseFdcStoreBody(const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // Get item data const UByteArray data = model->body(index); // Get local offset UINT32 localOffset = (UINT32)model->header(index).size(); // The body is a firmware volume with either a VSS or VSS2 store UModelIndex volumeIndex; USTATUS status = ffsParser->parseVolumeHeader(data, localOffset, index, volumeIndex); if (status || !volumeIndex.isValid()) { msg(usprintf("%s: store can't be parsed as FDC store", __FUNCTION__), index); return U_SUCCESS; } // Determine if it's a VSS or VSS2 store inside UByteArray store = model->body(volumeIndex); if ((UINT32)store.size() >= sizeof(UINT32) && *(const UINT32*)store.constData() == NVRAM_VSS_STORE_SIGNATURE) { UModelIndex vssIndex; status = parseVssStoreHeader(store, (UINT32)(localOffset + model->header(volumeIndex).size()), true, volumeIndex, vssIndex); if (status) return status; return parseVssStoreBody(vssIndex, 0); } else if ((UINT32)store.size() >= sizeof(EFI_GUID) && store.left(sizeof(EFI_GUID)) == NVRAM_FDC_STORE_GUID) { UModelIndex vss2Index; status = parseVss2StoreHeader(store, (UINT32)(localOffset + model->header(volumeIndex).size()), true, volumeIndex, vss2Index); if (status) return status; return parseVssStoreBody(vss2Index, 0); } else { msg(usprintf("%s: internal volume can't be parsed as VSS/VSS2 store", __FUNCTION__), index); return U_SUCCESS; } } USTATUS NvramParser::parseVssStoreBody(const UModelIndex & index, UINT8 alignment) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // Obtain required information from parent volume UINT8 emptyByte = 0xFF; UModelIndex parentVolumeIndex = model->findParentOfType(index, Types::Volume); if (parentVolumeIndex.isValid() && model->hasEmptyParsingData(parentVolumeIndex) == false) { UByteArray data = model->parsingData(parentVolumeIndex); const VOLUME_PARSING_DATA* pdata = (const VOLUME_PARSING_DATA*)data.constData(); emptyByte = pdata->emptyByte; } // Get local offset UINT32 localOffset = (UINT32)model->header(index).size(); // Get item data const UByteArray data = model->body(index); // Check that the is enough space for variable header const UINT32 dataSize = (UINT32)data.size(); if (dataSize < sizeof(VSS_VARIABLE_HEADER)) { msg(usprintf("%s: store body is too small even for VSS variable header", __FUNCTION__), index); return U_SUCCESS; } UINT32 offset = 0; // Parse all variables while (1) { bool isInvalid = true; bool isAuthenticated = false; bool isAppleCrc32 = false; bool isIntelSpecial = false; UINT32 storedCrc32 = 0; UINT32 calculatedCrc32 = 0; UINT64 monotonicCounter = 0; EFI_TIME timestamp = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }; UINT32 pubKeyIndex = 0; UINT8 subtype = 0; UString name; UString text; EFI_GUID* variableGuid = NULL; CHAR16* variableName = (CHAR16*)L""; UByteArray header; UByteArray body; UINT32 unparsedSize = dataSize - offset; // Get variable header const VSS_VARIABLE_HEADER* variableHeader = (const VSS_VARIABLE_HEADER*)(data.constData() + offset); // Check variable header to fit in still unparsed data UINT32 variableSize = 0; if (unparsedSize >= sizeof(VSS_VARIABLE_HEADER) && variableHeader->StartId == NVRAM_VSS_VARIABLE_START_ID) { // Apple VSS variable with CRC32 of the data if (variableHeader->Attributes & NVRAM_VSS_VARIABLE_APPLE_DATA_CHECKSUM) { isAppleCrc32 = true; if (unparsedSize < sizeof(VSS_APPLE_VARIABLE_HEADER)) { variableSize = 0; } else { const VSS_APPLE_VARIABLE_HEADER* appleVariableHeader = (const VSS_APPLE_VARIABLE_HEADER*)variableHeader; variableSize = sizeof(VSS_APPLE_VARIABLE_HEADER) + appleVariableHeader->NameSize + appleVariableHeader->DataSize; variableGuid = (EFI_GUID*)&appleVariableHeader->VendorGuid; variableName = (CHAR16*)(appleVariableHeader + 1); header = data.mid(offset, sizeof(VSS_APPLE_VARIABLE_HEADER) + appleVariableHeader->NameSize); body = data.mid(offset + header.size(), appleVariableHeader->DataSize); // Calculate CRC32 of the variable data storedCrc32 = appleVariableHeader->DataCrc32; calculatedCrc32 = (UINT32)crc32(0, (const UINT8*)body.constData(), (uInt)body.size()); } } // Authenticated variable else if ((variableHeader->Attributes & NVRAM_VSS_VARIABLE_AUTHENTICATED_WRITE_ACCESS) || (variableHeader->Attributes & NVRAM_VSS_VARIABLE_TIME_BASED_AUTHENTICATED_WRITE_ACCESS) || (variableHeader->Attributes & NVRAM_VSS_VARIABLE_APPEND_WRITE) || (variableHeader->NameSize == 0 && variableHeader->DataSize == 0)) { // If both NameSize and DataSize are zeros, it's auth variable with zero montonic counter isAuthenticated = true; if (unparsedSize < sizeof(VSS_AUTH_VARIABLE_HEADER)) { variableSize = 0; } else { const VSS_AUTH_VARIABLE_HEADER* authVariableHeader = (const VSS_AUTH_VARIABLE_HEADER*)variableHeader; variableSize = sizeof(VSS_AUTH_VARIABLE_HEADER) + authVariableHeader->NameSize + authVariableHeader->DataSize; variableGuid = (EFI_GUID*)&authVariableHeader->VendorGuid; variableName = (CHAR16*)(authVariableHeader + 1); header = data.mid(offset, sizeof(VSS_AUTH_VARIABLE_HEADER) + authVariableHeader->NameSize); body = data.mid(offset + header.size(), authVariableHeader->DataSize); monotonicCounter = authVariableHeader->MonotonicCounter; timestamp = authVariableHeader->Timestamp; pubKeyIndex = authVariableHeader->PubKeyIndex; } } // Intel special variable else if (variableHeader->State == NVRAM_VSS_INTEL_VARIABLE_VALID || variableHeader->State == NVRAM_VSS_INTEL_VARIABLE_INVALID) { isIntelSpecial = true; const VSS_INTEL_VARIABLE_HEADER* intelVariableHeader = (const VSS_INTEL_VARIABLE_HEADER*)variableHeader; variableSize = intelVariableHeader->TotalSize; variableGuid = (EFI_GUID*)&intelVariableHeader->VendorGuid; variableName = (CHAR16*)(intelVariableHeader + 1); UINT32 i = 0; while (variableName[i] != 0) ++i; i = sizeof(VSS_INTEL_VARIABLE_HEADER) + 2 * (i + 1); i = i < variableSize ? i : variableSize; header = data.mid(offset, i); body = data.mid(offset + header.size(), variableSize - i); } // Normal VSS variable else { variableSize = sizeof(VSS_VARIABLE_HEADER) + variableHeader->NameSize + variableHeader->DataSize; variableGuid = (EFI_GUID*)&variableHeader->VendorGuid; variableName = (CHAR16*)(variableHeader + 1); header = data.mid(offset, sizeof(VSS_VARIABLE_HEADER) + variableHeader->NameSize); body = data.mid(offset + header.size(), variableHeader->DataSize); } // Check variable state if (variableHeader->State == NVRAM_VSS_INTEL_VARIABLE_VALID || variableHeader->State == NVRAM_VSS_VARIABLE_ADDED || variableHeader->State == NVRAM_VSS_VARIABLE_HEADER_VALID) { isInvalid = false; } // Check variable size if (variableSize > unparsedSize) { variableSize = 0; } } // Can't parse further, add the last element and break the loop if (!variableSize) { // Check if the data left is a free space or a padding UByteArray padding = data.mid(offset, unparsedSize); // Get info UString info = usprintf("Full size: %Xh (%u)", (UINT32)padding.size(), (UINT32)padding.size()); if (padding.count(emptyByte) == padding.size()) { // Free space // Add tree item model->addItem(localOffset + offset, Types::FreeSpace, 0, UString("Free space"), UString(), info, UByteArray(), padding, UByteArray(), Fixed, index); } else { // Padding // Nothing is parsed yet, but the store is not empty if (!offset) { msg(usprintf("%s: store can't be parsed as VSS store", __FUNCTION__), index); return U_SUCCESS; } // Add tree item model->addItem(localOffset + offset, Types::Padding, getPaddingType(padding), UString("Padding"), UString(), info, UByteArray(), padding, UByteArray(), Fixed, index); } return U_SUCCESS; } UString info; // Rename invalid variables if (isInvalid || !variableGuid) { isInvalid = true; name = UString("Invalid"); } else { // Add GUID and text for valid variables name = guidToUString(readUnaligned(variableGuid)); info += UString("Variable GUID: ") + guidToUString(readUnaligned(variableGuid), false) + "\n"; text = uFromUcs2((const char*)variableName); } // Add info info += usprintf("Full size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\nState: %02Xh\nReserved: %02Xh\nAttributes: %08Xh (", variableSize, variableSize, (UINT32)header.size(), (UINT32)header.size(), (UINT32)body.size(), (UINT32)body.size(), variableHeader->State, variableHeader->Reserved, variableHeader->Attributes) + vssAttributesToUString(variableHeader->Attributes) + UString(")"); // Set subtype and add related info if (isInvalid) subtype = Subtypes::InvalidVssEntry; else if (isAuthenticated) { subtype = Subtypes::AuthVssEntry; info += usprintf("\nMonotonic counter: %" PRIX64 "h\nTimestamp: ", monotonicCounter) + efiTimeToUString(timestamp) + usprintf("\nPubKey index: %u", pubKeyIndex); } else if (isAppleCrc32) { subtype = Subtypes::AppleVssEntry; info += usprintf("\nData checksum: %08Xh", storedCrc32) + (storedCrc32 != calculatedCrc32 ? usprintf(", invalid, should be %08Xh", calculatedCrc32) : UString(", valid")); } else if (isIntelSpecial) { subtype = Subtypes::IntelVssEntry; } else { subtype = Subtypes::StandardVssEntry; } // Add tree item model->addItem(localOffset + offset, Types::VssEntry, subtype, name, text, info, header, body, UByteArray(), Fixed, index); // Apply alignment, if needed if (alignment) { variableSize = ((variableSize + alignment - 1) & (~(alignment - 1))); } // Move to next variable offset += variableSize; } return U_SUCCESS; } USTATUS NvramParser::parseFsysStoreBody(const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // Get local offset UINT32 localOffset = (UINT32)model->header(index).size(); // Get item data const UByteArray data = model->body(index); // Check that the is enough space for variable header const UINT32 storeDataSize = (UINT32)data.size(); UINT32 offset = 0; // Parse all variables while (1) { UINT32 unparsedSize = storeDataSize - offset; UINT32 variableSize = 0; // Get nameSize and name of the variable UINT8 nameSize = *(UINT8*)(data.constData() + offset); bool valid = !(nameSize & 0x80); // Last bit is a validity bit, 0 means valid nameSize &= 0x7F; // Check sanity if (unparsedSize >= nameSize + sizeof(UINT8)) { variableSize = nameSize + sizeof(UINT8); } UByteArray name; if (variableSize) { name = data.mid(offset + sizeof(UINT8), nameSize); // Check for EOF variable if (nameSize == 3 && name[0] == 'E' && name[1] == 'O' && name[2] == 'F') { // There is no data afterward, add EOF variable and free space and return UByteArray header = data.mid(offset, sizeof(UINT8) + nameSize); UString info = usprintf("Full size: %Xh (%u)", (UINT32)header.size(), (UINT32)header.size()); // Add EOF tree item model->addItem(localOffset + offset, Types::FsysEntry, Subtypes::NormalFsysEntry, UString("EOF"), UString(), info, header, UByteArray(), UByteArray(), Fixed, index); // Add free space offset += (UINT32)header.size(); UByteArray body = data.mid(offset); info = usprintf("Full size: %Xh (%u)", (UINT32)body.size(), (UINT32)body.size()); // Add free space tree item model->addItem(localOffset + offset, Types::FreeSpace, 0, UString("Free space"), UString(), info, UByteArray(), body, UByteArray(), Fixed, index); return U_SUCCESS; } } // Get dataSize and data of the variable const UINT16 dataSize = *(UINT16*)(data.constData() + offset + sizeof(UINT8) + nameSize); if (unparsedSize >= sizeof(UINT8) + nameSize + sizeof(UINT16) + dataSize) { variableSize = sizeof(UINT8) + nameSize + sizeof(UINT16) + dataSize; } else { // Last variable is bad, add the rest as padding and return UByteArray body = data.mid(offset); UString info = usprintf("Full size: %Xh (%u)", (UINT32)body.size(), (UINT32)body.size()); // Add padding tree item model->addItem(localOffset + offset, Types::Padding, getPaddingType(body), UString("Padding"), UString(), info, UByteArray(), body, UByteArray(), Fixed, index); // Show message msg(usprintf("%s: next variable appears too big, added as padding", __FUNCTION__), index); return U_SUCCESS; } // Construct header and body UByteArray header = data.mid(offset, sizeof(UINT8) + nameSize + sizeof(UINT16)); UByteArray body = data.mid(offset + sizeof(UINT8) + nameSize + sizeof(UINT16), dataSize); // Add info UString info = usprintf("Full size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)", variableSize, variableSize, (UINT32)header.size(), (UINT32)header.size(), (UINT32)body.size(), (UINT32)body.size()); // Add tree item model->addItem(localOffset + offset, Types::FsysEntry, valid ? Subtypes::NormalFsysEntry : Subtypes::InvalidFsysEntry, UString(name.constData()), UString(), info, header, body, UByteArray(), Fixed, index); // Move to next variable offset += variableSize; } return U_SUCCESS; } USTATUS NvramParser::parseEvsaStoreBody(const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // Obtain required information from parent volume UINT8 emptyByte = 0xFF; UModelIndex parentVolumeIndex = model->findParentOfType(index, Types::Volume); if (parentVolumeIndex.isValid() && model->hasEmptyParsingData(parentVolumeIndex) == false) { UByteArray data = model->parsingData(parentVolumeIndex); const VOLUME_PARSING_DATA* pdata = (const VOLUME_PARSING_DATA*)data.constData(); emptyByte = pdata->emptyByte; } // Get local offset UINT32 localOffset = (UINT32)model->header(index).size(); // Get item data const UByteArray data = model->body(index); // Check that the is enough space for entry header const UINT32 storeDataSize = (UINT32)data.size(); UINT32 offset = 0; std::map guidMap; std::map nameMap; // Parse all entries UINT32 unparsedSize = storeDataSize; while (unparsedSize) { UINT32 variableSize = 0; UString name; UString info; UByteArray header; UByteArray body; UINT8 subtype; UINT8 calculated; const EVSA_ENTRY_HEADER* entryHeader = (const EVSA_ENTRY_HEADER*)(data.constData() + offset); // Check entry size variableSize = sizeof(EVSA_ENTRY_HEADER); if (unparsedSize < variableSize || unparsedSize < entryHeader->Size || entryHeader->Size < 2) { body = data.mid(offset); info = usprintf("Full size: %Xh (%u)", (UINT32)body.size(), (UINT32)body.size()); if (body.count(emptyByte) == body.size()) { // Free space // Add free space tree item model->addItem(localOffset + offset, Types::FreeSpace, 0, UString("Free space"), UString(), info, UByteArray(), body, UByteArray(), Fixed, index); } else { // Add padding tree item UModelIndex itemIndex = model->addItem(localOffset + offset, Types::Padding, getPaddingType(body), UString("Padding"), UString(), info, UByteArray(), body, UByteArray(), Fixed, index); // Show message msg(usprintf("%s: variable parsing failed, the rest of unparsed store added as padding", __FUNCTION__), itemIndex); } break; } variableSize = entryHeader->Size; // Recalculate entry checksum calculated = calculateChecksum8(((const UINT8*)entryHeader) + 2, entryHeader->Size - 2); // GUID entry if (entryHeader->Type == NVRAM_EVSA_ENTRY_TYPE_GUID1 || entryHeader->Type == NVRAM_EVSA_ENTRY_TYPE_GUID2) { const EVSA_GUID_ENTRY* guidHeader = (const EVSA_GUID_ENTRY*)entryHeader; header = data.mid(offset, sizeof(EVSA_GUID_ENTRY)); body = data.mid(offset + sizeof(EVSA_GUID_ENTRY), guidHeader->Header.Size - sizeof(EVSA_GUID_ENTRY)); EFI_GUID guid = *(EFI_GUID*)body.constData(); name = guidToUString(guid); info = UString("GUID: ") + guidToUString(guid, false) + usprintf("\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\nType: %02Xh\nChecksum: %02Xh", variableSize, variableSize, (UINT32)header.size(), (UINT32)header.size(), (UINT32)body.size(), (UINT32)body.size(), guidHeader->Header.Type, guidHeader->Header.Checksum) + (guidHeader->Header.Checksum != calculated ? usprintf(", invalid, should be %02Xh", calculated) : UString(", valid")) + usprintf("\nGuidId: %04Xh", guidHeader->GuidId); subtype = Subtypes::GuidEvsaEntry; guidMap.insert(std::pair(guidHeader->GuidId, guid)); } // Name entry else if (entryHeader->Type == NVRAM_EVSA_ENTRY_TYPE_NAME1 || entryHeader->Type == NVRAM_EVSA_ENTRY_TYPE_NAME2) { const EVSA_NAME_ENTRY* nameHeader = (const EVSA_NAME_ENTRY*)entryHeader; header = data.mid(offset, sizeof(EVSA_NAME_ENTRY)); body = data.mid(offset + sizeof(EVSA_NAME_ENTRY), nameHeader->Header.Size - sizeof(EVSA_NAME_ENTRY)); name = uFromUcs2(body.constData()); info = UString("Name: ") + name + usprintf("\nFull size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\nType: %02Xh\nChecksum: %02Xh", variableSize, variableSize, (UINT32)header.size(), (UINT32)header.size(), (UINT32)body.size(), (UINT32)body.size(), nameHeader->Header.Type, nameHeader->Header.Checksum) + (nameHeader->Header.Checksum != calculated ? usprintf(", invalid, should be %02Xh", calculated) : UString(", valid")) + usprintf("\nVarId: %04Xh", nameHeader->VarId); subtype = Subtypes::NameEvsaEntry; nameMap.insert(std::pair(nameHeader->VarId, name)); } // Data entry else if (entryHeader->Type == NVRAM_EVSA_ENTRY_TYPE_DATA1 || entryHeader->Type == NVRAM_EVSA_ENTRY_TYPE_DATA2 || entryHeader->Type == NVRAM_EVSA_ENTRY_TYPE_DATA_INVALID) { const EVSA_DATA_ENTRY* dataHeader = (const EVSA_DATA_ENTRY*)entryHeader; // Check for extended header UINT32 headerSize = sizeof(EVSA_DATA_ENTRY); UINT32 dataSize = dataHeader->Header.Size - sizeof(EVSA_DATA_ENTRY); if (dataHeader->Attributes & NVRAM_EVSA_DATA_EXTENDED_HEADER) { const EVSA_DATA_ENTRY_EXTENDED* dataHeaderExtended = (const EVSA_DATA_ENTRY_EXTENDED*)entryHeader; headerSize = sizeof(EVSA_DATA_ENTRY_EXTENDED); dataSize = dataHeaderExtended->DataSize; variableSize = headerSize + dataSize; } header = data.mid(offset, headerSize); body = data.mid(offset + headerSize, dataSize); name = UString("Data"); info = usprintf("Full size: %Xh (%u)\nHeader size: %Xh (%u)\nBody size: %Xh (%u)\nType: %02Xh\nChecksum: %02Xh", variableSize, variableSize, headerSize, headerSize, dataSize, dataSize, dataHeader->Header.Type, dataHeader->Header.Checksum) + (dataHeader->Header.Checksum != calculated ? usprintf(", invalid, should be %02Xh", calculated) : UString(", valid")) + usprintf("\nVarId: %04Xh\nGuidId: %04Xh\nAttributes: %08Xh (", dataHeader->VarId, dataHeader->GuidId, dataHeader->Attributes) + evsaAttributesToUString(dataHeader->Attributes) + UString(")"); subtype = Subtypes::DataEvsaEntry; } // Unknown entry or free space else { body = data.mid(offset); info = usprintf("Full size: %Xh (%u)", (UINT32)body.size(), (UINT32)body.size()); if (body.count(emptyByte) == body.size()) { // Free space // Add free space tree item model->addItem(localOffset + offset, Types::FreeSpace, 0, UString("Free space"), UString(), info, UByteArray(), body, UByteArray(), Fixed, index); } else { // Add padding tree item UModelIndex itemIndex = model->addItem(localOffset + offset, Types::Padding, getPaddingType(body), UString("Padding"), UString(), info, UByteArray(), body, UByteArray(), Fixed, index); // Show message msg(usprintf("%s: unknown variable of type %02Xh found at offset %Xh, the rest of unparsed store added as padding", __FUNCTION__, entryHeader->Type, offset), itemIndex); } break; } // Add tree item model->addItem(localOffset + offset, Types::EvsaEntry, subtype, name, UString(), info, header, body, UByteArray(), Fixed, index); // Move to next variable offset += variableSize; unparsedSize = storeDataSize - offset; } // Reparse all data variables to detect invalid ones and assign name and test to valid ones for (int i = 0; i < model->rowCount(index); i++) { UModelIndex current = index.model()->index(i, 0, index); if (model->subtype(current) == Subtypes::DataEvsaEntry) { UByteArray header = model->header(current); const EVSA_DATA_ENTRY* dataHeader = (const EVSA_DATA_ENTRY*)header.constData(); UString guid; if (guidMap.count(dataHeader->GuidId)) guid = guidToUString(guidMap[dataHeader->GuidId], false); UString name; if (nameMap.count(dataHeader->VarId)) name = nameMap[dataHeader->VarId]; // Check for variable validity if (guid.isEmpty() && name.isEmpty()) { // Both name and guid aren't found model->setSubtype(current, Subtypes::InvalidEvsaEntry); model->setName(current, UString("Invalid")); msg(usprintf("%s: data variable with invalid GuidId and invalid VarId", __FUNCTION__), current); } else if (guid.isEmpty()) { // Guid not found model->setSubtype(current, Subtypes::InvalidEvsaEntry); model->setName(current, UString("Invalid")); msg(usprintf("%s: data variable with invalid GuidId", __FUNCTION__), current); } else if (name.isEmpty()) { // Name not found model->setSubtype(current, Subtypes::InvalidEvsaEntry); model->setName(current, UString("Invalid")); msg(usprintf("%s: data variable with invalid VarId", __FUNCTION__), current); } else { // Variable is OK, rename it if (dataHeader->Header.Type == NVRAM_EVSA_ENTRY_TYPE_DATA_INVALID) { model->setSubtype(current, Subtypes::InvalidEvsaEntry); model->setName(current, UString("Invalid")); } else { model->setName(current, guid); } model->setText(current, name); model->addInfo(current, UString("GUID: ") + guid + UString("\nName: ") + name + "\n", false); } } } return U_SUCCESS; } USTATUS NvramParser::parseFlashMapBody(const UModelIndex & index) { // Sanity check if (!index.isValid()) return U_INVALID_PARAMETER; // Get parsing data for the current item UINT32 localOffset = (UINT32)model->header(index).size(); const UByteArray data = model->body(index); const UINT32 dataSize = (UINT32)data.size(); UINT32 offset = 0; UINT32 unparsedSize = dataSize; // Parse all entries while (unparsedSize) { const PHOENIX_FLASH_MAP_ENTRY* entryHeader = (const PHOENIX_FLASH_MAP_ENTRY*)(data.constData() + offset); // Check entry size if (unparsedSize < sizeof(PHOENIX_FLASH_MAP_ENTRY)) { // Last variable is bad, add the rest as padding and return UByteArray body = data.mid(offset); UString info = usprintf("Full size: %Xh (%u)", (UINT32)body.size(), (UINT32)body.size()); // Add padding tree item model->addItem(localOffset + offset, Types::Padding, getPaddingType(body), UString("Padding"), UString(), info, UByteArray(), body, UByteArray(), Fixed, index); // Show message if (unparsedSize < entryHeader->Size) msg(usprintf("%s: next entry appears too big, added as padding", __FUNCTION__), index); break; } UString name = guidToUString(entryHeader->Guid); // Construct header UByteArray header = data.mid(offset, sizeof(PHOENIX_FLASH_MAP_ENTRY)); // Add info UString info = UString("Entry GUID: ") + guidToUString(entryHeader->Guid, false) + usprintf("\nFull size: 24h (36)\nHeader size: 24h (36)\nBody size: 0h (0)\n" "Entry type: %04Xh\nData type: %04Xh\nMemory address: %08Xh\nSize: %08Xh\nOffset: %08Xh", entryHeader->EntryType, entryHeader->DataType, (UINT32)entryHeader->PhysicalAddress, entryHeader->Size, entryHeader->Offset); // Determine subtype UINT8 subtype = 0; switch (entryHeader->DataType) { case NVRAM_PHOENIX_FLASH_MAP_ENTRY_TYPE_VOLUME: subtype = Subtypes::VolumeFlashMapEntry; break; case NVRAM_PHOENIX_FLASH_MAP_ENTRY_TYPE_DATA_BLOCK: subtype = Subtypes::DataFlashMapEntry; break; } // Add tree item model->addItem(localOffset + offset, Types::FlashMapEntry, subtype, name, flashMapGuidToUString(entryHeader->Guid), info, header, UByteArray(), UByteArray(), Fixed, index); // Move to next variable offset += sizeof(PHOENIX_FLASH_MAP_ENTRY); unparsedSize = dataSize - offset; } return U_SUCCESS; } #endif // U_ENABLE_NVRAM_PARSING_SUPPORT UEFITool-A66/common/nvramparser.h000066400000000000000000000103171442134156300170040ustar00rootroot00000000000000/* nvramparser.h Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php. THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef NVRAMPARSER_H #define NVRAMPARSER_H #include #include "basetypes.h" #include "ustring.h" #include "ubytearray.h" #include "treemodel.h" #include "ffsparser.h" #ifdef U_ENABLE_NVRAM_PARSING_SUPPORT class NvramParser { public: // Default constructor and destructor NvramParser(TreeModel* treeModel, FfsParser* parser) : model(treeModel), ffsParser(parser) {} ~NvramParser() {} // Returns messages std::vector > getMessages() const { return messagesVector; } // Clears messages void clearMessages() { messagesVector.clear(); } // NVRAM parsing USTATUS parseNvramVolumeBody(const UModelIndex & index); USTATUS parseNvarStore(const UModelIndex & index); private: TreeModel *model; FfsParser *ffsParser; std::vector > messagesVector; void msg(const UString & message, const UModelIndex & index = UModelIndex()) { messagesVector.push_back(std::pair(message, index)); }; USTATUS findNextStore(const UModelIndex & index, const UByteArray & volume, const UINT32 localOffset, const UINT32 storeOffset, UINT32 & nextStoreOffset); USTATUS getStoreSize(const UByteArray & data, const UINT32 storeOffset, UINT32 & storeSize); USTATUS parseStoreHeader(const UByteArray & store, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index); USTATUS parseVssStoreHeader(const UByteArray & store, const UINT32 localOffset, const bool sizeOverride, const UModelIndex & parent, UModelIndex & index); USTATUS parseVss2StoreHeader(const UByteArray & store, const UINT32 localOffset, const bool sizeOverride, const UModelIndex & parent, UModelIndex & index); USTATUS parseFtwStoreHeader(const UByteArray & store, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index); USTATUS parseFdcStoreHeader(const UByteArray & store, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index); USTATUS parseFsysStoreHeader(const UByteArray & store, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index); USTATUS parseEvsaStoreHeader(const UByteArray & store, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index); USTATUS parseFlashMapStoreHeader(const UByteArray & store, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index); USTATUS parseCmdbStoreHeader(const UByteArray & store, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index); USTATUS parseSlicPubkeyHeader(const UByteArray & store, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index); USTATUS parseSlicMarkerHeader(const UByteArray & store, const UINT32 localOffset, const UModelIndex & parent, UModelIndex & index); USTATUS parseFdcStoreBody(const UModelIndex & index); USTATUS parseVssStoreBody(const UModelIndex & index, const UINT8 alignment); USTATUS parseFsysStoreBody(const UModelIndex & index); USTATUS parseEvsaStoreBody(const UModelIndex & index); USTATUS parseFlashMapBody(const UModelIndex & index); }; #else class NvramParser { public: // Default constructor and destructor NvramParser(TreeModel* treeModel, FfsParser* parser) { U_UNUSED_PARAMETER(treeModel); U_UNUSED_PARAMETER(parser); } ~NvramParser() {} // Returns messages std::vector > getMessages() const { return std::vector >(); } // Clears messages void clearMessages() {} // NVRAM parsing USTATUS parseNvramVolumeBody(const UModelIndex &) { return U_SUCCESS; } USTATUS parseNvarStore(const UModelIndex &) { return U_SUCCESS; } }; #endif // U_ENABLE_NVRAM_PARSING_SUPPORT #endif // NVRAMPARSER_H UEFITool-A66/common/parsingdata.h000066400000000000000000000035711442134156300167450ustar00rootroot00000000000000/* parsingdata.h Copyright (c) 2015, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHWARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. Parsing data is an information needed for each level of image reconstruction routines without the need of backward traversal */ #ifndef PARSINGDATA_H #define PARSINGDATA_H #include "basetypes.h" typedef struct VOLUME_PARSING_DATA_ { EFI_GUID extendedHeaderGuid; UINT32 alignment; UINT32 usedSpace; BOOLEAN hasValidUsedSpace; UINT8 ffsVersion; UINT8 emptyByte; UINT8 revision; BOOLEAN hasExtendedHeader; BOOLEAN hasAppleCrc32; BOOLEAN isWeakAligned; BOOLEAN requiresSectionAlignmentQuirk; } VOLUME_PARSING_DATA; typedef struct FILE_PARSING_DATA_ { UINT8 emptyByte; EFI_GUID guid; } FILE_PARSING_DATA; typedef struct GUIDED_SECTION_PARSING_DATA_ { EFI_GUID guid; UINT32 dictionarySize; } GUIDED_SECTION_PARSING_DATA; typedef struct FREEFORM_GUIDED_SECTION_PARSING_DATA_ { EFI_GUID guid; } FREEFORM_GUIDED_SECTION_PARSING_DATA; typedef struct COMPRESSED_SECTION_PARSING_DATA_ { UINT32 uncompressedSize; UINT8 compressionType; UINT8 algorithm; UINT32 dictionarySize; } COMPRESSED_SECTION_PARSING_DATA; typedef struct TE_IMAGE_SECTION_PARSING_DATA_ { UINT32 originalImageBase; UINT32 adjustedImageBase; UINT8 imageBaseType; } TE_IMAGE_SECTION_PARSING_DATA; typedef struct NVAR_ENTRY_PARSING_DATA_ { UINT8 emptyByte; BOOLEAN isValid; UINT32 next; } NVAR_ENTRY_PARSING_DATA; #endif // PARSINGDATA_H UEFITool-A66/common/peimage.cpp000066400000000000000000000032761442134156300164140ustar00rootroot00000000000000/* peimage.cpp Copyright (c) 2015, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php. THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "peimage.h" UString machineTypeToUString(UINT16 machineType) { switch (machineType) { case EFI_IMAGE_FILE_MACHINE_AMD64: return UString("x86-64"); case EFI_IMAGE_FILE_MACHINE_ARM: return UString("ARM"); case EFI_IMAGE_FILE_MACHINE_ARMNT: return UString("ARMv7"); case EFI_IMAGE_FILE_MACHINE_APPLE_ARM: return UString("Apple ARM"); case EFI_IMAGE_FILE_MACHINE_AARCH64: return UString("AArch64"); case EFI_IMAGE_FILE_MACHINE_EBC: return UString("EBC"); case EFI_IMAGE_FILE_MACHINE_I386: return UString("x86"); case EFI_IMAGE_FILE_MACHINE_IA64: return UString("IA64"); case EFI_IMAGE_FILE_MACHINE_POWERPC: return UString("PowerPC"); case EFI_IMAGE_FILE_MACHINE_POWERPCFP: return UString("PowerPC FP"); case EFI_IMAGE_FILE_MACHINE_THUMB: return UString("ARM Thumb"); case EFI_IMAGE_FILE_MACHINE_RISCV32: return UString("RISC-V 32-bit"); case EFI_IMAGE_FILE_MACHINE_RISCV64: return UString("RISC-V 64-bit"); case EFI_IMAGE_FILE_MACHINE_RISCV128: return UString("RISC-V 128-bit"); } return usprintf("Unknown %04Xh", machineType); } UEFITool-A66/common/peimage.h000066400000000000000000000605601442134156300160600ustar00rootroot00000000000000/* peimage.h Copyright (c) 2015, Nikolaj Schlej. All rights reserved. Copyright (c) 2006 - 2010, Intel Corporation. All rights reserved. Portions copyright (c) 2008 - 2009, Apple Inc. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php. THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef PEIMAGE_H #define PEIMAGE_H #include "basetypes.h" #include "ustring.h" extern UString machineTypeToUString(UINT16 machineType); // Make sure we use right packing rules #pragma pack(push, 1) // // PE32+ Subsystem type for EFI images // #define EFI_IMAGE_SUBSYSTEM_EFI_APPLICATION 10 #define EFI_IMAGE_SUBSYSTEM_EFI_BOOT_SERVICE_DRIVER 11 #define EFI_IMAGE_SUBSYSTEM_EFI_RUNTIME_DRIVER 12 #define EFI_IMAGE_SUBSYSTEM_SAL_RUNTIME_DRIVER 13 // // PE32+ Machine type for EFI images // #define EFI_IMAGE_FILE_MACHINE_I386 0x014c // x86 #define EFI_IMAGE_FILE_MACHINE_ARM 0x01c0 // ARM little endian #define EFI_IMAGE_FILE_MACHINE_THUMB 0x01c2 // ARM or Thumb (interworking) #define EFI_IMAGE_FILE_MACHINE_ARMNT 0x01c4 // ARMv7 (or higher) Thumb mode only #define EFI_IMAGE_FILE_MACHINE_APPLE_ARM 0x01c6 // Apple ARM #define EFI_IMAGE_FILE_MACHINE_POWERPC 0x01f0 // Power PC little endian #define EFI_IMAGE_FILE_MACHINE_POWERPCFP 0x01f1 // Power PC with floating point support #define EFI_IMAGE_FILE_MACHINE_IA64 0x0200 // Itanium #define EFI_IMAGE_FILE_MACHINE_EBC 0x0ebc // EFI Byte Code #define EFI_IMAGE_FILE_MACHINE_AMD64 0x8664 // x86-64 #define EFI_IMAGE_FILE_MACHINE_AARCH64 0xaa64 // ARMv8 in 64-bit mode #define EFI_IMAGE_FILE_MACHINE_RISCV32 0x5032 // RISC-V 32-bit #define EFI_IMAGE_FILE_MACHINE_RISCV64 0x5064 // RISC-V 64-bit #define EFI_IMAGE_FILE_MACHINE_RISCV128 0x5128 // RISC-V 128-bit // // EXE file formats // #define EFI_IMAGE_DOS_SIGNATURE 0x5A4D // MZ #define EFI_IMAGE_PE_SIGNATURE 0x00004550 // PE // // PE images can start with an optional DOS header, so if an image is run // under DOS it can print an error message. // typedef struct { UINT16 e_magic; // Magic number UINT16 e_cblp; // Bytes on last page of file UINT16 e_cp; // Pages in file UINT16 e_crlc; // Relocations UINT16 e_cparhdr; // Size of header in paragraphs UINT16 e_minalloc; // Minimum extra paragraphs needed UINT16 e_maxalloc; // Maximum extra paragraphs needed UINT16 e_ss; // Initial (relative) SS value UINT16 e_sp; // Initial SP value UINT16 e_csum; // Checksum UINT16 e_ip; // Initial IP value UINT16 e_cs; // Initial (relative) CS value UINT16 e_lfarlc; // File address of relocation table UINT16 e_ovno; // Overlay number UINT16 e_res[4]; // Reserved words UINT16 e_oemid; // OEM identifier (for e_oeminfo) UINT16 e_oeminfo; // OEM information; e_oemid specific UINT16 e_res2[10]; // Reserved words UINT32 e_lfanew; // File address of new header } EFI_IMAGE_DOS_HEADER; // // COFF File Header (Object and Image) // typedef struct { UINT16 Machine; UINT16 NumberOfSections; UINT32 TimeDateStamp; UINT32 PointerToSymbolTable; UINT32 NumberOfSymbols; UINT16 SizeOfOptionalHeader; UINT16 Characteristics; } EFI_IMAGE_FILE_HEADER; // // Size of EFI_IMAGE_FILE_HEADER. // #define EFI_IMAGE_SIZEOF_FILE_HEADER 20 // // Characteristics // #define EFI_IMAGE_FILE_RELOCS_STRIPPED 0x0001 // Relocation info stripped from file #define EFI_IMAGE_FILE_EXECUTABLE_IMAGE 0x0002 // File is executable (i.e. no unresolved external references) #define EFI_IMAGE_FILE_LINE_NUMS_STRIPPED 0x0004 // Line numbers stripped from file #define EFI_IMAGE_FILE_LOCAL_SYMS_STRIPPED 0x0008 // Local symbols stripped from file #define EFI_IMAGE_FILE_BYTES_REVERSED_LO 0x0080 // Bytes of machine word are reversed #define EFI_IMAGE_FILE_32BIT_MACHINE 0x0100 // 32 bit word machine #define EFI_IMAGE_FILE_DEBUG_STRIPPED 0x0200 // Debugging info stripped from file in .DBG file #define EFI_IMAGE_FILE_SYSTEM 0x1000 // System File #define EFI_IMAGE_FILE_DLL 0x2000 // File is a DLL #define EFI_IMAGE_FILE_BYTES_REVERSED_HI 0x8000 // Bytes of machine word are reversed // // Header Data Directories. // typedef struct { UINT32 VirtualAddress; UINT32 Size; } EFI_IMAGE_DATA_DIRECTORY; // // Directory Entries // #define EFI_IMAGE_DIRECTORY_ENTRY_EXPORT 0 #define EFI_IMAGE_DIRECTORY_ENTRY_IMPORT 1 #define EFI_IMAGE_DIRECTORY_ENTRY_RESOURCE 2 #define EFI_IMAGE_DIRECTORY_ENTRY_EXCEPTION 3 #define EFI_IMAGE_DIRECTORY_ENTRY_SECURITY 4 #define EFI_IMAGE_DIRECTORY_ENTRY_BASERELOC 5 #define EFI_IMAGE_DIRECTORY_ENTRY_DEBUG 6 #define EFI_IMAGE_DIRECTORY_ENTRY_COPYRIGHT 7 #define EFI_IMAGE_DIRECTORY_ENTRY_GLOBALPTR 8 #define EFI_IMAGE_DIRECTORY_ENTRY_TLS 9 #define EFI_IMAGE_DIRECTORY_ENTRY_LOAD_CONFIG 10 #define EFI_IMAGE_NUMBER_OF_DIRECTORY_ENTRIES 16 // // EFI_IMAGE_NT_OPTIONAL_HDR32_MAGIC means PE32 and // EFI_IMAGE_OPTIONAL_HEADER32 must be used. // The data structures only vary after NT additional fields // #define EFI_IMAGE_PE_OPTIONAL_HDR32_MAGIC 0x10b // // Optional Header Standard Fields for PE32 // typedef struct { // // Standard fields. // UINT16 Magic; UINT8 MajorLinkerVersion; UINT8 MinorLinkerVersion; UINT32 SizeOfCode; UINT32 SizeOfInitializedData; UINT32 SizeOfUninitializedData; UINT32 AddressOfEntryPoint; UINT32 BaseOfCode; UINT32 BaseOfData; // PE32 contains this additional field, which is absent in PE32+. // // Optional Header Windows-Specific Fields. // UINT32 ImageBase; UINT32 SectionAlignment; UINT32 FileAlignment; UINT16 MajorOperatingSystemVersion; UINT16 MinorOperatingSystemVersion; UINT16 MajorImageVersion; UINT16 MinorImageVersion; UINT16 MajorSubsystemVersion; UINT16 MinorSubsystemVersion; UINT32 Win32VersionValue; UINT32 SizeOfImage; UINT32 SizeOfHeaders; UINT32 CheckSum; UINT16 Subsystem; UINT16 DllCharacteristics; UINT32 SizeOfStackReserve; UINT32 SizeOfStackCommit; UINT32 SizeOfHeapReserve; UINT32 SizeOfHeapCommit; UINT32 LoaderFlags; UINT32 NumberOfRvaAndSizes; EFI_IMAGE_DATA_DIRECTORY DataDirectory[EFI_IMAGE_NUMBER_OF_DIRECTORY_ENTRIES]; } EFI_IMAGE_OPTIONAL_HEADER32; // // EFI_IMAGE_NT_OPTIONAL_HDR64_MAGIC means PE32+ and // EFI_IMAGE_OPTIONAL_HEADER64 must be used. // The data structures only vary after NT additional fields // #define EFI_IMAGE_PE_OPTIONAL_HDR64_MAGIC 0x20b // // Optional Header Standard Fields for PE32+. // typedef struct { // // Standard fields. // UINT16 Magic; UINT8 MajorLinkerVersion; UINT8 MinorLinkerVersion; UINT32 SizeOfCode; UINT32 SizeOfInitializedData; UINT32 SizeOfUninitializedData; UINT32 AddressOfEntryPoint; UINT32 BaseOfCode; // // Optional Header Windows-Specific Fields. // UINT64 ImageBase; UINT32 SectionAlignment; UINT32 FileAlignment; UINT16 MajorOperatingSystemVersion; UINT16 MinorOperatingSystemVersion; UINT16 MajorImageVersion; UINT16 MinorImageVersion; UINT16 MajorSubsystemVersion; UINT16 MinorSubsystemVersion; UINT32 Win32VersionValue; UINT32 SizeOfImage; UINT32 SizeOfHeaders; UINT32 CheckSum; UINT16 Subsystem; UINT16 DllCharacteristics; UINT64 SizeOfStackReserve; UINT64 SizeOfStackCommit; UINT64 SizeOfHeapReserve; UINT64 SizeOfHeapCommit; UINT32 LoaderFlags; UINT32 NumberOfRvaAndSizes; EFI_IMAGE_DATA_DIRECTORY DataDirectory[EFI_IMAGE_NUMBER_OF_DIRECTORY_ENTRIES]; } EFI_IMAGE_OPTIONAL_HEADER64; // Union for pointers to either PE32 or PE32+ headers typedef union _EFI_IMAGE_OPTIONAL_HEADER_POINTERS_UNION { const EFI_IMAGE_OPTIONAL_HEADER32* H32; const EFI_IMAGE_OPTIONAL_HEADER64* H64; } EFI_IMAGE_OPTIONAL_HEADER_POINTERS_UNION; typedef struct { UINT32 Signature; //EFI_IMAGE_FILE_HEADER FileHeader; //EFI_IMAGE_OPTIONAL_HEADER OptionalHeader; } EFI_IMAGE_PE_HEADER; // // Other Windows Subsystem Values // #define EFI_IMAGE_SUBSYSTEM_UNKNOWN 0 #define EFI_IMAGE_SUBSYSTEM_NATIVE 1 #define EFI_IMAGE_SUBSYSTEM_WINDOWS_GUI 2 #define EFI_IMAGE_SUBSYSTEM_WINDOWS_CUI 3 #define EFI_IMAGE_SUBSYSTEM_OS2_CUI 5 #define EFI_IMAGE_SUBSYSTEM_POSIX_CUI 7 // // Length of ShortName // #define EFI_IMAGE_SIZEOF_SHORT_NAME 8 // // Section Table. This table immediately follows the optional header. // typedef struct { UINT8 Name[EFI_IMAGE_SIZEOF_SHORT_NAME]; union { UINT32 PhysicalAddress; UINT32 VirtualSize; } Misc; UINT32 VirtualAddress; UINT32 SizeOfRawData; UINT32 PointerToRawData; UINT32 PointerToRelocations; UINT32 PointerToLinenumbers; UINT16 NumberOfRelocations; UINT16 NumberOfLinenumbers; UINT32 Characteristics; } EFI_IMAGE_SECTION_HEADER; // // Size of EFI_IMAGE_SECTION_HEADER // #define EFI_IMAGE_SIZEOF_SECTION_HEADER 40 // // Section Flags Values // #define EFI_IMAGE_SCN_TYPE_NO_PAD 0x00000008 // Reserved #define EFI_IMAGE_SCN_CNT_CODE 0x00000020 #define EFI_IMAGE_SCN_CNT_INITIALIZED_DATA 0x00000040 #define EFI_IMAGE_SCN_CNT_UNINITIALIZED_DATA 0x00000080 #define EFI_IMAGE_SCN_LNK_OTHER 0x00000100 // Reserved #define EFI_IMAGE_SCN_LNK_INFO 0x00000200 // Section contains comments or some other type of information #define EFI_IMAGE_SCN_LNK_REMOVE 0x00000800 // Section contents will not become part of image #define EFI_IMAGE_SCN_LNK_COMDAT 0x00001000 #define EFI_IMAGE_SCN_ALIGN_1BYTES 0x00100000 #define EFI_IMAGE_SCN_ALIGN_2BYTES 0x00200000 #define EFI_IMAGE_SCN_ALIGN_4BYTES 0x00300000 #define EFI_IMAGE_SCN_ALIGN_8BYTES 0x00400000 #define EFI_IMAGE_SCN_ALIGN_16BYTES 0x00500000 #define EFI_IMAGE_SCN_ALIGN_32BYTES 0x00600000 #define EFI_IMAGE_SCN_ALIGN_64BYTES 0x00700000 #define EFI_IMAGE_SCN_MEM_DISCARDABLE 0x02000000 #define EFI_IMAGE_SCN_MEM_NOT_CACHED 0x04000000 #define EFI_IMAGE_SCN_MEM_NOT_PAGED 0x08000000 #define EFI_IMAGE_SCN_MEM_SHARED 0x10000000 #define EFI_IMAGE_SCN_MEM_EXECUTE 0x20000000 #define EFI_IMAGE_SCN_MEM_READ 0x40000000 #define EFI_IMAGE_SCN_MEM_WRITE 0x80000000 // // Size of a Symbol Table Record // #define EFI_IMAGE_SIZEOF_SYMBOL 18 // // Symbols have a section number of the section in which they are // defined. Otherwise, section numbers have the following meanings: // #define EFI_IMAGE_SYM_UNDEFINED (UINT16) 0 ///< Symbol is undefined or is common #define EFI_IMAGE_SYM_ABSOLUTE (UINT16) -1 ///< Symbol is an absolute value #define EFI_IMAGE_SYM_DEBUG (UINT16) -2 ///< Symbol is a special debug item // // Symbol Type (fundamental) values. // #define EFI_IMAGE_SYM_TYPE_NULL 0 // no type #define EFI_IMAGE_SYM_TYPE_VOID 1 // no valid type #define EFI_IMAGE_SYM_TYPE_CHAR 2 // type character #define EFI_IMAGE_SYM_TYPE_SHORT 3 // type short integer #define EFI_IMAGE_SYM_TYPE_INT 4 #define EFI_IMAGE_SYM_TYPE_LONG 5 #define EFI_IMAGE_SYM_TYPE_FLOAT 6 #define EFI_IMAGE_SYM_TYPE_DOUBLE 7 #define EFI_IMAGE_SYM_TYPE_STRUCT 8 #define EFI_IMAGE_SYM_TYPE_UNION 9 #define EFI_IMAGE_SYM_TYPE_ENUM 10 // enumeration #define EFI_IMAGE_SYM_TYPE_MOE 11 // member of enumeration #define EFI_IMAGE_SYM_TYPE_BYTE 12 #define EFI_IMAGE_SYM_TYPE_WORD 13 #define EFI_IMAGE_SYM_TYPE_UINT 14 #define EFI_IMAGE_SYM_TYPE_DWORD 15 // // Symbol Type (derived) values // #define EFI_IMAGE_SYM_DTYPE_NULL 0 // no derived type #define EFI_IMAGE_SYM_DTYPE_POINTER 1 #define EFI_IMAGE_SYM_DTYPE_FUNCTION 2 #define EFI_IMAGE_SYM_DTYPE_ARRAY 3 // // Storage classes // #define EFI_IMAGE_SYM_CLASS_END_OF_FUNCTION ((UINT8) -1) #define EFI_IMAGE_SYM_CLASS_NULL 0 #define EFI_IMAGE_SYM_CLASS_AUTOMATIC 1 #define EFI_IMAGE_SYM_CLASS_EXTERNAL 2 #define EFI_IMAGE_SYM_CLASS_STATIC 3 #define EFI_IMAGE_SYM_CLASS_REGISTER 4 #define EFI_IMAGE_SYM_CLASS_EXTERNAL_DEF 5 #define EFI_IMAGE_SYM_CLASS_LABEL 6 #define EFI_IMAGE_SYM_CLASS_UNDEFINED_LABEL 7 #define EFI_IMAGE_SYM_CLASS_MEMBER_OF_STRUCT 8 #define EFI_IMAGE_SYM_CLASS_ARGUMENT 9 #define EFI_IMAGE_SYM_CLASS_STRUCT_TAG 10 #define EFI_IMAGE_SYM_CLASS_MEMBER_OF_UNION 11 #define EFI_IMAGE_SYM_CLASS_UNION_TAG 12 #define EFI_IMAGE_SYM_CLASS_TYPE_DEFINITION 13 #define EFI_IMAGE_SYM_CLASS_UNDEFINED_STATIC 14 #define EFI_IMAGE_SYM_CLASS_ENUM_TAG 15 #define EFI_IMAGE_SYM_CLASS_MEMBER_OF_ENUM 16 #define EFI_IMAGE_SYM_CLASS_REGISTER_PARAM 17 #define EFI_IMAGE_SYM_CLASS_BIT_FIELD 18 #define EFI_IMAGE_SYM_CLASS_BLOCK 100 #define EFI_IMAGE_SYM_CLASS_FUNCTION 101 #define EFI_IMAGE_SYM_CLASS_END_OF_STRUCT 102 #define EFI_IMAGE_SYM_CLASS_FILE 103 #define EFI_IMAGE_SYM_CLASS_SECTION 104 #define EFI_IMAGE_SYM_CLASS_WEAK_EXTERNAL 105 // // Type packing constants // #define EFI_IMAGE_N_BTMASK 017 #define EFI_IMAGE_N_TMASK 060 #define EFI_IMAGE_N_TMASK1 0300 #define EFI_IMAGE_N_TMASK2 0360 #define EFI_IMAGE_N_BTSHFT 4 #define EFI_IMAGE_N_TSHIFT 2 // // Communal selection types // #define EFI_IMAGE_COMDAT_SELECT_NODUPLICATES 1 #define EFI_IMAGE_COMDAT_SELECT_ANY 2 #define EFI_IMAGE_COMDAT_SELECT_SAME_SIZE 3 #define EFI_IMAGE_COMDAT_SELECT_EXACT_MATCH 4 #define EFI_IMAGE_COMDAT_SELECT_ASSOCIATIVE 5 // // The following values only be referred in PeCoff, not defined in PECOFF // #define EFI_IMAGE_WEAK_EXTERN_SEARCH_NOLIBRARY 1 #define EFI_IMAGE_WEAK_EXTERN_SEARCH_LIBRARY 2 #define EFI_IMAGE_WEAK_EXTERN_SEARCH_ALIAS 3 // // Relocation format // typedef struct { UINT32 VirtualAddress; UINT32 SymbolTableIndex; UINT16 Type; } EFI_IMAGE_RELOCATION; // // Size of EFI_IMAGE_RELOCATION // #define EFI_IMAGE_SIZEOF_RELOCATION 10 // // I386 relocation types // #define EFI_IMAGE_REL_I386_ABSOLUTE 0x0000 // Reference is absolute, no relocation is necessary #define EFI_IMAGE_REL_I386_DIR16 0x0001 // Direct 16-bit reference to the symbols virtual address #define EFI_IMAGE_REL_I386_REL16 0x0002 // PC-relative 16-bit reference to the symbols virtual address #define EFI_IMAGE_REL_I386_DIR32 0x0006 // Direct 32-bit reference to the symbols virtual address #define EFI_IMAGE_REL_I386_DIR32NB 0x0007 // Direct 32-bit reference to the symbols virtual address, base not included #define EFI_IMAGE_REL_I386_SEG12 0x0009 // Direct 16-bit reference to the segment-selector bits of a 32-bit virtual address #define EFI_IMAGE_REL_I386_SECTION 0x000A #define EFI_IMAGE_REL_I386_SECREL 0x000B #define EFI_IMAGE_REL_I386_REL32 0x0014 // PC-relative 32-bit reference to the symbols virtual address // // x64 relocation types // #define EFI_IMAGE_REL_AMD64_ABSOLUTE 0x0000 #define EFI_IMAGE_REL_AMD64_ADDR64 0x0001 #define EFI_IMAGE_REL_AMD64_ADDR32 0x0002 #define EFI_IMAGE_REL_AMD64_ADDR32NB 0x0003 #define EFI_IMAGE_REL_AMD64_REL32 0x0004 #define EFI_IMAGE_REL_AMD64_REL32_1 0x0005 #define EFI_IMAGE_REL_AMD64_REL32_2 0x0006 #define EFI_IMAGE_REL_AMD64_REL32_3 0x0007 #define EFI_IMAGE_REL_AMD64_REL32_4 0x0008 #define EFI_IMAGE_REL_AMD64_REL32_5 0x0009 #define EFI_IMAGE_REL_AMD64_SECTION 0x000A #define EFI_IMAGE_REL_AMD64_SECREL 0x000B #define EFI_IMAGE_REL_AMD64_SECREL7 0x000C #define EFI_IMAGE_REL_AMD64_TOKEN 0x000D #define EFI_IMAGE_REL_AMD64_SREL32 0x000E #define EFI_IMAGE_REL_AMD64_PAIR 0x000F #define EFI_IMAGE_REL_AMD64_SSPAN32 0x0010 // // RISC-V relocation types // #define EFI_IMAGE_REL_BASED_RISCV_HI20 0x0005 #define EFI_IMAGE_REL_BASED_RISCV_LO12I 0x0007 #define EFI_IMAGE_REL_BASED_RISCV_LO12S 0x0008 // // Based relocation format // typedef struct { UINT32 VirtualAddress; UINT32 SizeOfBlock; } EFI_IMAGE_BASE_RELOCATION; // // Size of EFI_IMAGE_BASE_RELOCATION // #define EFI_IMAGE_SIZEOF_BASE_RELOCATION 8 // // Based relocation types // #define EFI_IMAGE_REL_BASED_ABSOLUTE 0 #define EFI_IMAGE_REL_BASED_HIGH 1 #define EFI_IMAGE_REL_BASED_LOW 2 #define EFI_IMAGE_REL_BASED_HIGHLOW 3 #define EFI_IMAGE_REL_BASED_HIGHADJ 4 #define EFI_IMAGE_REL_BASED_MIPS_JMPADDR 5 #define EFI_IMAGE_REL_BASED_ARM_MOV32A 5 #define EFI_IMAGE_REL_BASED_ARM_MOV32T 7 #define EFI_IMAGE_REL_BASED_IA64_IMM64 9 #define EFI_IMAGE_REL_BASED_MIPS_JMPADDR16 9 #define EFI_IMAGE_REL_BASED_DIR64 10 // // Line number format // typedef struct { union { UINT32 SymbolTableIndex; // Symbol table index of function name if line number is 0 UINT32 VirtualAddress; // Virtual address of line number } Type; UINT16 Linenumber; // Line number } EFI_IMAGE_LINENUMBER; // // Size of EFI_IMAGE_LINENUMBER // #define EFI_IMAGE_SIZEOF_LINENUMBER 6 // // Archive format // #define EFI_IMAGE_ARCHIVE_START_SIZE 8 #define EFI_IMAGE_ARCHIVE_START "!\n" #define EFI_IMAGE_ARCHIVE_END "`\n" #define EFI_IMAGE_ARCHIVE_PAD "\n" #define EFI_IMAGE_ARCHIVE_LINKER_MEMBER "/ " #define EFI_IMAGE_ARCHIVE_LONGNAMES_MEMBER "// " // // Archive Member Headers // typedef struct { UINT8 Name[16]; // File member name - `/' terminated UINT8 Date[12]; // File member date - decimal UINT8 UserID[6]; // File member user id - decimal UINT8 GroupID[6]; // File member group id - decimal UINT8 Mode[8]; // File member mode - octal UINT8 Size[10]; // File member size - decimal UINT8 EndHeader[2]; // String to end header. (0x60 0x0A) } EFI_IMAGE_ARCHIVE_MEMBER_HEADER; // // Size of EFI_IMAGE_ARCHIVE_MEMBER_HEADER // #define EFI_IMAGE_SIZEOF_ARCHIVE_MEMBER_HDR 60 // // DLL Support // // // Export Directory Table // typedef struct { UINT32 Characteristics; UINT32 TimeDateStamp; UINT16 MajorVersion; UINT16 MinorVersion; UINT32 Name; UINT32 Base; UINT32 NumberOfFunctions; UINT32 NumberOfNames; UINT32 AddressOfFunctions; UINT32 AddressOfNames; UINT32 AddressOfNameOrdinals; } EFI_IMAGE_EXPORT_DIRECTORY; // // Hint/Name Table // typedef struct { UINT16 Hint; UINT8 Name[1]; } EFI_IMAGE_IMPORT_BY_NAME; // // Import Address Table RVA (Thunk Table) // typedef struct { union { UINT32 Function; UINT32 Ordinal; EFI_IMAGE_IMPORT_BY_NAME *AddressOfData; } u1; } EFI_IMAGE_THUNK_DATA; #define EFI_IMAGE_ORDINAL_FLAG 0x80000000 // Flag for PE32. #define EFI_IMAGE_SNAP_BY_ORDINAL(Ordinal) (((Ordinal) & EFI_IMAGE_ORDINAL_FLAG) != 0) #define EFI_IMAGE_ORDINAL(Ordinal) ((Ordinal) & 0xffff) // // Import Directory Table // typedef struct { UINT32 Characteristics; UINT32 TimeDateStamp; UINT32 ForwarderChain; UINT32 Name; EFI_IMAGE_THUNK_DATA *FirstThunk; } EFI_IMAGE_IMPORT_DESCRIPTOR; // // Debug Directory Format // typedef struct { UINT32 Characteristics; UINT32 TimeDateStamp; UINT16 MajorVersion; UINT16 MinorVersion; UINT32 Type; UINT32 SizeOfData; UINT32 RVA; // The address of the debug data when loaded, relative to the image base UINT32 FileOffset; // The file pointer to the debug data } EFI_IMAGE_DEBUG_DIRECTORY_ENTRY; #define EFI_IMAGE_DEBUG_TYPE_CODEVIEW 2 // The Visual C++ debug information. // // Debug Data Structure defined in Microsoft C++ // #define CODEVIEW_SIGNATURE_NB10 0x3031424E // NB10 typedef struct { UINT32 Signature; UINT32 Unknown; UINT32 Unknown2; UINT32 Unknown3; // // Filename of .PDB goes here // } EFI_IMAGE_DEBUG_CODEVIEW_NB10_ENTRY; // // Debug Data Structure defined in Microsoft C++ // #define CODEVIEW_SIGNATURE_RSDS 0x53445352 // RSDS typedef struct { UINT32 Signature; UINT32 Unknown; UINT32 Unknown2; UINT32 Unknown3; UINT32 Unknown4; UINT32 Unknown5; // // Filename of .PDB goes here // } EFI_IMAGE_DEBUG_CODEVIEW_RSDS_ENTRY; // // Debug Data Structure defined by Apple Mach-O to COFF utility. // #define CODEVIEW_SIGNATURE_MTOC 0x434F544D // MTOC typedef struct { UINT32 Signature; UINT8 MachOUuid[16]; // // Filename of .DLL (Mach-O with debug info) goes here // } EFI_IMAGE_DEBUG_CODEVIEW_MTOC_ENTRY; // // Resource format // typedef struct { UINT32 Characteristics; UINT32 TimeDateStamp; UINT16 MajorVersion; UINT16 MinorVersion; UINT16 NumberOfNamedEntries; UINT16 NumberOfIdEntries; // // Array of EFI_IMAGE_RESOURCE_DIRECTORY_ENTRY entries goes here // } EFI_IMAGE_RESOURCE_DIRECTORY; // // Resource directory entry format // typedef struct { union { struct { UINT32 NameOffset : 31; UINT32 NameIsString : 1; } s; UINT32 Id; } u1; union { UINT32 OffsetToData; struct { UINT32 OffsetToDirectory : 31; UINT32 DataIsDirectory : 1; } s; } u2; } EFI_IMAGE_RESOURCE_DIRECTORY_ENTRY; // // Resource directory entry for string // typedef struct { UINT16 Length; CHAR16 String[1]; } EFI_IMAGE_RESOURCE_DIRECTORY_STRING; // // Resource directory entry for data array // typedef struct { UINT32 OffsetToData; UINT32 Size; UINT32 CodePage; UINT32 Reserved; } EFI_IMAGE_RESOURCE_DATA_ENTRY; // // Header format for TE images, defined in the PI Specification 1.0. // typedef struct { UINT16 Signature; // The signature for TE format = "VZ" UINT16 Machine; // From original file header UINT8 NumberOfSections; // From original file header UINT8 Subsystem; // From original optional header UINT16 StrippedSize; // Number of bytes we removed from header UINT32 AddressOfEntryPoint; // Offset to entry point -- from original optional header UINT32 BaseOfCode; // From original image -- required for ITP debug UINT64 ImageBase; // From original file header EFI_IMAGE_DATA_DIRECTORY DataDirectory[2]; // Only base relocation and debug directory } EFI_IMAGE_TE_HEADER; #define EFI_IMAGE_TE_SIGNATURE 0x5A56 // VZ // Image base types #define EFI_IMAGE_TE_BASE_OTHER 0 #define EFI_IMAGE_TE_BASE_ORIGINAL 1 #define EFI_IMAGE_TE_BASE_ADJUSTED 2 // // Data directory indexes in our TE image header // #define EFI_IMAGE_TE_DIRECTORY_ENTRY_BASERELOC 0 #define EFI_IMAGE_TE_DIRECTORY_ENTRY_DEBUG 1 // Restore previous packing rules #pragma pack(pop) #endif // PEIMAGE_H UEFITool-A66/common/treeitem.cpp000066400000000000000000000055221442134156300166170ustar00rootroot00000000000000/* treeitem.cpp Copyright (c) 2015, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "treeitem.h" #include "types.h" TreeItem::TreeItem(const UINT32 offset, const UINT8 type, const UINT8 subtype, const UString & name, const UString & text, const UString & info, const UByteArray & header, const UByteArray & body, const UByteArray & tail, const bool fixed, const bool compressed, TreeItem *parent) : itemOffset(offset), itemAction(Actions::NoAction), itemType(type), itemSubtype(subtype), itemMarking(0), itemName(name), itemText(text), itemInfo(info), itemHeader(header), itemBody(body), itemTail(tail), itemFixed(fixed), itemCompressed(compressed), parentItem(parent) { } TreeItem::~TreeItem() { std::list::iterator begin = childItems.begin(); while (begin != childItems.end()) { delete *begin; ++begin; } } UINT8 TreeItem::insertChildBefore(TreeItem *item, TreeItem *newItem) { std::list::iterator found = std::find(childItems.begin(), childItems.end(), item); if (found == childItems.end()) return U_ITEM_NOT_FOUND; childItems.insert(found, newItem); return U_SUCCESS; } UINT8 TreeItem::insertChildAfter(TreeItem *item, TreeItem *newItem) { std::list::iterator found = std::find(childItems.begin(), childItems.end(), item); if (found == childItems.end()) return U_ITEM_NOT_FOUND; childItems.insert(++found, newItem); return U_SUCCESS; } UString TreeItem::data(int column) const { switch (column) { case 0: // Name return itemName; case 1: // Action return actionTypeToUString(itemAction); case 2: // Type return itemTypeToUString(itemType); case 3: // Subtype return itemSubtypeToUString(itemType, itemSubtype); case 4: // Text return itemText; default: return UString(); } } int TreeItem::row() const { if (parentItem) { std::list::const_iterator iter = parentItem->childItems.begin(); for (int i = 0; i < (int)parentItem->childItems.size(); ++i, ++iter) { if (const_cast(this) == *iter) return i; } } return 0; } TreeItem* TreeItem::child(int row) { std::list::iterator child = childItems.begin(); std::advance(child, row); return *child; } UEFITool-A66/common/treeitem.h000066400000000000000000000110661442134156300162640ustar00rootroot00000000000000/* treeitem.h Copyright (c) 2015, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef TREEITEM_H #define TREEITEM_H #include #include #include "basetypes.h" #include "ubytearray.h" #include "ustring.h" class TreeItem { public: TreeItem(const UINT32 offset, const UINT8 type, const UINT8 subtype, const UString &name, const UString &text, const UString &info, const UByteArray & header, const UByteArray & body, const UByteArray & tail, const bool fixed, const bool compressed, TreeItem *parent = 0); ~TreeItem(); // Non-trivial implementation in CPP file // Operations with items void appendChild(TreeItem *item) { childItems.push_back(item); } void prependChild(TreeItem *item) { childItems.push_front(item); }; UINT8 insertChildBefore(TreeItem *item, TreeItem *newItem); // Non-trivial implementation in CPP file UINT8 insertChildAfter(TreeItem *item, TreeItem *newItem); // Non-trivial implementation in CPP file // Model support operations TreeItem *child(int row); // Non-trivial implementation in CPP file int childCount() const {return (int)childItems.size(); } int columnCount() const { return 5; } UString data(int column) const; // Non-trivial implementation in CPP file int row() const; // Non-trivial implementation in CPP file TreeItem *parent() { return parentItem; } // Getters and setters for item parameters UINT32 offset() const { return itemOffset; } void setOffset(const UINT32 offset) { itemOffset = offset; } UINT8 type() const { return itemType; } void setType(const UINT8 type) { itemType = type; } UINT8 subtype() const { return itemSubtype; } void setSubtype(const UINT8 subtype) { itemSubtype = subtype; } UString name() const { return itemName; } void setName(const UString &text) { itemName = text; } UString text() const { return itemText; } void setText(const UString &text) { itemText = text; } UByteArray header() const { return itemHeader; } bool hasEmptyHeader() const { return itemHeader.isEmpty(); } UByteArray body() const { return itemBody; }; bool hasEmptyBody() const { return itemBody.isEmpty(); } UByteArray tail() const { return itemTail; }; bool hasEmptyTail() const { return itemTail.isEmpty(); } UString info() const { return itemInfo; } void addInfo(const UString &info, const bool append) { if (append) itemInfo += info; else itemInfo = info + itemInfo; } void setInfo(const UString &info) { itemInfo = info; } UINT8 action() const {return itemAction; } void setAction(const UINT8 action) { itemAction = action; } bool fixed() const { return itemFixed; } void setFixed(const bool fixed) { itemFixed = fixed; } bool compressed() const { return itemCompressed; } void setCompressed(const bool compressed) { itemCompressed = compressed; } UByteArray parsingData() const { return itemParsingData; }; bool hasEmptyParsingData() const { return itemParsingData.isEmpty(); } void setParsingData(const UByteArray & pdata) { itemParsingData = pdata; } UByteArray uncompressedData() const { return itemUncompressedData; }; bool hasEmptyUncompressedData() const { return itemUncompressedData.isEmpty(); } void setUncompressedData(const UByteArray & ucdata) { itemUncompressedData = ucdata; } UINT8 marking() const { return itemMarking; } void setMarking(const UINT8 marking) { itemMarking = marking; } private: std::list childItems; UINT32 itemOffset; UINT8 itemAction; UINT8 itemType; UINT8 itemSubtype; UINT8 itemMarking; UString itemName; UString itemText; UString itemInfo; UByteArray itemHeader; UByteArray itemBody; UByteArray itemTail; bool itemFixed; bool itemCompressed; UByteArray itemParsingData; UByteArray itemUncompressedData; TreeItem* parentItem; }; #endif // TREEITEM_H UEFITool-A66/common/treemodel.cpp000066400000000000000000000422631442134156300167640ustar00rootroot00000000000000/* treemodel.cpp Copyright (c) 2015, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "treemodel.h" #include "stack" #if defined(QT_CORE_LIB) QVariant TreeModel::data(const UModelIndex &index, int role) const { if (!index.isValid()) return QVariant(); TreeItem *item = static_cast(index.internalPointer()); if (role == Qt::DisplayRole) { return item->data(index.column()).toLocal8Bit(); } #if defined (QT_GUI_LIB) else if (role == Qt::BackgroundRole) { if (markingEnabledFlag && marking(index) != BootGuardMarking::None) { switch (marking(index)) { case BootGuardMarking::BootGuardFullyInRange: return QBrush((Qt::GlobalColor)(markingDarkModeFlag ? Qt::darkRed : Qt::red )); break; case BootGuardMarking::VendorFullyInRange: return QBrush((Qt::GlobalColor)(markingDarkModeFlag ? Qt::darkCyan : Qt::cyan )); break; case BootGuardMarking::PartiallyInRange: return QBrush((Qt::GlobalColor)(markingDarkModeFlag ? Qt::darkYellow : Qt::yellow)); break; } } } #endif else if (role == Qt::UserRole) { return item->info().toLocal8Bit(); } return QVariant(); } Qt::ItemFlags TreeModel::flags(const UModelIndex &index) const { if (!index.isValid()) return Qt::NoItemFlags; return Qt::ItemIsEnabled | Qt::ItemIsSelectable; } QVariant TreeModel::headerData(int section, Qt::Orientation orientation, int role) const { if (orientation == Qt::Horizontal && role == Qt::DisplayRole) { switch (section) { case 0: return tr("Name"); case 1: return tr("Action"); case 2: return tr("Type"); case 3: return tr("Subtype"); case 4: return tr("Text"); } } return QVariant(); } #else UString TreeModel::data(const UModelIndex &index, int role) const { if (!index.isValid()) return UString(); if (role != 0 && role != 0x0100) return UString(); TreeItem *item = static_cast(index.internalPointer()); if (role == 0) return item->data(index.column()); else return item->info(); } UString TreeModel::headerData(int section, int orientation, int role) const { if (orientation == 1 && role == 0) { switch (section) { case 0: return UString("Name"); case 1: return UString("Action"); case 2: return UString("Type"); case 3: return UString("Subtype"); case 4: return UString("Text"); } } return UString(); } #endif int TreeModel::columnCount(const UModelIndex &parent) const { if (parent.isValid()) return static_cast(parent.internalPointer())->columnCount(); else return rootItem->columnCount(); } UModelIndex TreeModel::index(int row, int column, const UModelIndex &parent) const { if (!hasIndex(row, column, parent)) return UModelIndex(); TreeItem *parentItem; if (!parent.isValid()) parentItem = rootItem; else parentItem = static_cast(parent.internalPointer()); TreeItem *childItem = parentItem->child(row); if (childItem) return createIndex(row, column, childItem); else return UModelIndex(); } UModelIndex TreeModel::parent(const UModelIndex &index) const { if (!index.isValid()) return UModelIndex(); TreeItem *childItem = static_cast(index.internalPointer()); if (childItem == rootItem) return UModelIndex(); TreeItem *parentItem = childItem->parent(); if (parentItem == rootItem) return UModelIndex(); return createIndex(parentItem->row(), 0, parentItem); } int TreeModel::rowCount(const UModelIndex &parent) const { TreeItem *parentItem; if (parent.column() > 0) return 0; if (!parent.isValid()) parentItem = rootItem; else parentItem = static_cast(parent.internalPointer()); return parentItem->childCount(); } UINT32 TreeModel::base(const UModelIndex ¤t) const { // Rewrite this as loop if we ever see an image that is too deep for this naive implementation if (!current.isValid()) return 0; UModelIndex parent = current.parent(); if (!parent.isValid()) return offset(current); else { return offset(current) + base(parent); } } UINT32 TreeModel::offset(const UModelIndex &index) const { if (!index.isValid()) return 0; TreeItem *item = static_cast(index.internalPointer()); return item->offset(); } UINT8 TreeModel::type(const UModelIndex &index) const { if (!index.isValid()) return 0; TreeItem *item = static_cast(index.internalPointer()); return item->type(); } UINT8 TreeModel::subtype(const UModelIndex &index) const { if (!index.isValid()) return 0; TreeItem *item = static_cast(index.internalPointer()); return item->subtype(); } UINT8 TreeModel::marking(const UModelIndex &index) const { if (!index.isValid()) return 0; TreeItem *item = static_cast(index.internalPointer()); return item->marking(); } UByteArray TreeModel::header(const UModelIndex &index) const { if (!index.isValid()) return UByteArray(); TreeItem *item = static_cast(index.internalPointer()); return item->header(); } bool TreeModel::hasEmptyHeader(const UModelIndex &index) const { if (!index.isValid()) return true; TreeItem *item = static_cast(index.internalPointer()); return item->hasEmptyHeader(); } UByteArray TreeModel::body(const UModelIndex &index) const { if (!index.isValid()) return UByteArray(); TreeItem *item = static_cast(index.internalPointer()); return item->body(); } bool TreeModel::hasEmptyBody(const UModelIndex &index) const { if (!index.isValid()) return true; TreeItem *item = static_cast(index.internalPointer()); return item->hasEmptyBody(); } UByteArray TreeModel::tail(const UModelIndex &index) const { if (!index.isValid()) return UByteArray(); TreeItem *item = static_cast(index.internalPointer()); return item->tail(); } bool TreeModel::hasEmptyTail(const UModelIndex &index) const { if (!index.isValid()) return true; TreeItem *item = static_cast(index.internalPointer()); return item->hasEmptyTail(); } UString TreeModel::name(const UModelIndex &index) const { if (!index.isValid()) return UString(); TreeItem *item = static_cast(index.internalPointer()); return item->name(); } UString TreeModel::text(const UModelIndex &index) const { if (!index.isValid()) return UString(); TreeItem *item = static_cast(index.internalPointer()); return item->text(); } UString TreeModel::info(const UModelIndex &index) const { if (!index.isValid()) return UString(); TreeItem *item = static_cast(index.internalPointer()); return item->info(); } UINT8 TreeModel::action(const UModelIndex &index) const { if (!index.isValid()) return Actions::NoAction; TreeItem *item = static_cast(index.internalPointer()); return item->action(); } bool TreeModel::fixed(const UModelIndex &index) const { if (!index.isValid()) return false; TreeItem *item = static_cast(index.internalPointer()); return item->fixed(); } bool TreeModel::compressed(const UModelIndex &index) const { if (!index.isValid()) return false; TreeItem *item = static_cast(index.internalPointer()); return item->compressed(); } void TreeModel::setFixed(const UModelIndex &index, const bool fixed) { if (!index.isValid()) return; TreeItem *item = static_cast(index.internalPointer()); item->setFixed(fixed); if (!item->parent()) return; if (fixed) { // Special handling for uncompressed to compressed boundary if (item->compressed() && item->parent()->compressed() == FALSE) { item->setFixed(item->parent()->fixed()); return; } // Propagate fixed flag until root setFixed(index.parent(), true); } emit dataChanged(index, index); } void TreeModel::setCompressed(const UModelIndex &index, const bool compressed) { if (!index.isValid()) return; TreeItem *item = static_cast(index.internalPointer()); item->setCompressed(compressed); emit dataChanged(index, index); } void TreeModel::TreeModel::setMarkingEnabled(const bool enabled) { markingEnabledFlag = enabled; emit dataChanged(UModelIndex(), UModelIndex()); } void TreeModel::TreeModel::setMarkingDarkMode(const bool enabled) { markingDarkModeFlag = enabled; emit dataChanged(UModelIndex(), UModelIndex()); } void TreeModel::setMarking(const UModelIndex &index, const UINT8 marking) { if (!index.isValid()) return; TreeItem *item = static_cast(index.internalPointer()); item->setMarking(marking); emit dataChanged(index, index); } void TreeModel::setOffset(const UModelIndex &index, const UINT32 offset) { if (!index.isValid()) return; TreeItem *item = static_cast(index.internalPointer()); item->setOffset(offset); emit dataChanged(index, index); } void TreeModel::setType(const UModelIndex &index, const UINT8 data) { if (!index.isValid()) return; TreeItem *item = static_cast(index.internalPointer()); item->setType(data); emit dataChanged(index, index); } void TreeModel::setSubtype(const UModelIndex & index, const UINT8 subtype) { if (!index.isValid()) return; TreeItem *item = static_cast(index.internalPointer()); item->setSubtype(subtype); emit dataChanged(index, index); } void TreeModel::setName(const UModelIndex &index, const UString &data) { if (!index.isValid()) return; TreeItem *item = static_cast(index.internalPointer()); item->setName(data); emit dataChanged(index, index); } void TreeModel::setText(const UModelIndex &index, const UString &data) { if (!index.isValid()) return; TreeItem *item = static_cast(index.internalPointer()); item->setText(data); emit dataChanged(index, index); } void TreeModel::setInfo(const UModelIndex &index, const UString &data) { if (!index.isValid()) return; TreeItem *item = static_cast(index.internalPointer()); item->setInfo(data); emit dataChanged(index, index); } void TreeModel::addInfo(const UModelIndex &index, const UString &data, const bool append) { if (!index.isValid()) return; TreeItem *item = static_cast(index.internalPointer()); item->addInfo(data, append); emit dataChanged(index, index); } void TreeModel::setAction(const UModelIndex &index, const UINT8 action) { if (!index.isValid()) return; TreeItem *item = static_cast(index.internalPointer()); item->setAction(action); emit dataChanged(index, index); } UByteArray TreeModel::parsingData(const UModelIndex &index) const { if (!index.isValid()) return UByteArray(); TreeItem *item = static_cast(index.internalPointer()); return item->parsingData(); } bool TreeModel::hasEmptyParsingData(const UModelIndex &index) const { if (!index.isValid()) return true; TreeItem *item = static_cast(index.internalPointer()); return item->hasEmptyParsingData(); } void TreeModel::setParsingData(const UModelIndex &index, const UByteArray &data) { if (!index.isValid()) return; TreeItem *item = static_cast(index.internalPointer()); item->setParsingData(data); emit dataChanged(this->index(0, 0), index); } UByteArray TreeModel::uncompressedData(const UModelIndex &index) const { if (!index.isValid()) return UByteArray(); TreeItem *item = static_cast(index.internalPointer()); return item->uncompressedData(); } bool TreeModel::hasEmptyUncompressedData(const UModelIndex &index) const { if (!index.isValid()) return true; TreeItem *item = static_cast(index.internalPointer()); return item->hasEmptyUncompressedData(); } void TreeModel::setUncompressedData(const UModelIndex &index, const UByteArray &data) { if (!index.isValid()) return; TreeItem *item = static_cast(index.internalPointer()); item->setUncompressedData(data); emit dataChanged(this->index(0, 0), index); } UModelIndex TreeModel::addItem(const UINT32 offset, const UINT8 type, const UINT8 subtype, const UString & name, const UString & text, const UString & info, const UByteArray & header, const UByteArray & body, const UByteArray & tail, const ItemFixedState fixed, const UModelIndex & parent, const UINT8 mode) { TreeItem *item = 0; TreeItem *parentItem = 0; int parentColumn = 0; if (!parent.isValid()) parentItem = rootItem; else { if (mode == CREATE_MODE_BEFORE || mode == CREATE_MODE_AFTER) { item = static_cast(parent.internalPointer()); parentItem = item->parent(); parentColumn = parent.parent().column(); } else { parentItem = static_cast(parent.internalPointer()); parentColumn = parent.column(); } } TreeItem *newItem = new TreeItem(offset, type, subtype, name, text, info, header, body, tail, Movable, this->compressed(parent), parentItem); if (mode == CREATE_MODE_APPEND) { emit layoutAboutToBeChanged(); parentItem->appendChild(newItem); } else if (mode == CREATE_MODE_PREPEND) { emit layoutAboutToBeChanged(); parentItem->prependChild(newItem); } else if (mode == CREATE_MODE_BEFORE) { emit layoutAboutToBeChanged(); parentItem->insertChildBefore(item, newItem); } else if (mode == CREATE_MODE_AFTER) { emit layoutAboutToBeChanged(); parentItem->insertChildAfter(item, newItem); } else { delete newItem; return UModelIndex(); } emit layoutChanged(); UModelIndex created = createIndex(newItem->row(), parentColumn, newItem); setFixed(created, (bool)fixed); // Non-trivial logic requires additional call return created; } UModelIndex TreeModel::findParentOfType(const UModelIndex& index, UINT8 type) const { if (!index.isValid() || !index.parent().isValid()) return UModelIndex(); TreeItem *item; UModelIndex parent = index.parent(); for (item = static_cast(parent.internalPointer()); item != NULL && item != rootItem && item->type() != type; item = static_cast(parent.internalPointer())) parent = parent.parent(); if (item != NULL && item != rootItem) return parent; return UModelIndex(); } UModelIndex TreeModel::findLastParentOfType(const UModelIndex& index, UINT8 type) const { if (!index.isValid()) return UModelIndex(); UModelIndex lastParentOfType = findParentOfType(index, type); if (!lastParentOfType.isValid()) return UModelIndex(); UModelIndex currentParentOfType = findParentOfType(lastParentOfType, type); while (currentParentOfType.isValid()) { lastParentOfType = currentParentOfType; currentParentOfType = findParentOfType(lastParentOfType, type); } return lastParentOfType; } UModelIndex TreeModel::findByBase(UINT32 base) const { UModelIndex parentIndex = index(0,0); goDeeper: int n = rowCount(parentIndex); for (int i = 0; i < n; i++) { UModelIndex currentIndex = parentIndex.model()->index(i, 0, parentIndex); UINT32 currentBase = this->base(currentIndex); UINT32 fullSize = (UINT32)(header(currentIndex).size() + body(currentIndex).size() + tail(currentIndex).size()); if ((compressed(currentIndex) == false || (compressed(currentIndex) == true && compressed(currentIndex.parent()) == false)) // Base is meaningful only for true uncompressed items && currentBase <= base && base < currentBase + fullSize) { // Base must be in range [currentBase, currentBase + fullSize) // Found a better candidate parentIndex = currentIndex; goto goDeeper; } } return (parentIndex == index(0, 0) ? UModelIndex() : parentIndex); } UEFITool-A66/common/treemodel.h000066400000000000000000000174371442134156300164360ustar00rootroot00000000000000/* treemodel.h Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef TREEMODEL_H #define TREEMODEL_H enum ItemFixedState { Movable, Fixed }; enum BootGuardMarking { None = 0, // Needs to be zero PartiallyInRange, BootGuardFullyInRange, VendorFullyInRange }; #if defined(QT_CORE_LIB) // Use Qt classes #include #include #include #include #if defined(QT_GUI_LIB) #include #endif #include "ustring.h" #include "ubytearray.h" #include "basetypes.h" #include "types.h" #include "treeitem.h" #define UModelIndex QModelIndex #else // Use own implementation #include "ustring.h" #include "ubytearray.h" #include "basetypes.h" #include "types.h" #include "treeitem.h" class TreeModel; class UModelIndex { friend class TreeModel; public: inline UModelIndex() : r(-1), c(-1), i(0), m(0) {} // compiler-generated copy/move ctors/assignment operators are fine! inline int row() const { return r; } inline int column() const { return c; } inline uint64_t internalId() const { return i; } inline void *internalPointer() const { return reinterpret_cast(i); } inline UModelIndex parent() const; inline UModelIndex child(int row, int column) const; inline CBString data(int role) const; inline const TreeModel *model() const { return m; } inline bool isValid() const { return (r >= 0) && (c >= 0) && (m != 0); } inline bool operator==(const UModelIndex &other) const { return (other.r == r) && (other.i == i) && (other.c == c) && (other.m == m); } inline bool operator!=(const UModelIndex &other) const { return !(*this == other); } inline bool operator<(const UModelIndex &other) const { return r < other.r || (r == other.r && (c < other.c || (c == other.c && (i < other.i || (i == other.i && m < other.m))))); } private: inline UModelIndex(int arow, int acolumn, void *ptr, const TreeModel *amodel) : r(arow), c(acolumn), i(reinterpret_cast(ptr)), m(amodel) {} inline UModelIndex(int arow, int acolumn, uint64_t id, const TreeModel *amodel) : r(arow), c(acolumn), i(id), m(amodel) {} int r, c; uint64_t i; const TreeModel *m; }; #endif #if defined(QT_CORE_LIB) class TreeModel : public QAbstractItemModel { private: TreeItem *rootItem; bool markingEnabledFlag; bool markingDarkModeFlag; public: QVariant data(const UModelIndex &index, int role) const; Qt::ItemFlags flags(const UModelIndex &index) const; QVariant headerData(int section, Qt::Orientation orientation, int role = Qt::DisplayRole) const; TreeModel(QObject *parent = 0) : QAbstractItemModel(parent), markingEnabledFlag(true), markingDarkModeFlag(false) { rootItem = new TreeItem(0, Types::Root, 0, UString(), UString(), UString(), UByteArray(), UByteArray(), UByteArray(), true, false); } #else #define emit class TreeModel { private: TreeItem *rootItem; bool markingEnabledFlag; bool markingDarkModeFlag; void dataChanged(const UModelIndex &, const UModelIndex &) {} void layoutAboutToBeChanged() {} void layoutChanged() {} public: UString data(const UModelIndex &index, int role) const; UString headerData(int section, int orientation, int role = 0) const; TreeModel() : markingEnabledFlag(false), markingDarkModeFlag(false) { rootItem = new TreeItem(0, Types::Root, 0, UString(), UString(), UString(), UByteArray(), UByteArray(), UByteArray(), true, false); } bool hasIndex(int row, int column, const UModelIndex &parent = UModelIndex()) const { if (row < 0 || column < 0) return false; return row < rowCount(parent) && column < columnCount(parent); } UModelIndex createIndex(int row, int column, void *data) const { return UModelIndex(row, column, data, this); } #endif ~TreeModel() { delete rootItem; } bool markingEnabled() { return markingEnabledFlag; } void setMarkingEnabled(const bool enabled); bool markingDarkMode() { return markingDarkModeFlag; } void setMarkingDarkMode(const bool enabled); UModelIndex index(int row, int column, const UModelIndex &parent = UModelIndex()) const; UModelIndex parent(const UModelIndex &index) const; int rowCount(const UModelIndex &parent = UModelIndex()) const; int columnCount(const UModelIndex &parent = UModelIndex()) const; UINT8 action(const UModelIndex &index) const; void setAction(const UModelIndex &index, const UINT8 action); UINT32 base(const UModelIndex &index) const; UINT32 offset(const UModelIndex &index) const; void setOffset(const UModelIndex &index, const UINT32 offset); UINT8 type(const UModelIndex &index) const; void setType(const UModelIndex &index, const UINT8 type); UINT8 subtype(const UModelIndex &index) const; void setSubtype(const UModelIndex &index, const UINT8 subtype); UString name(const UModelIndex &index) const; void setName(const UModelIndex &index, const UString &name); UString text(const UModelIndex &index) const; void setText(const UModelIndex &index, const UString &text); UString info(const UModelIndex &index) const; void setInfo(const UModelIndex &index, const UString &info); void addInfo(const UModelIndex &index, const UString &info, const bool append = true); bool fixed(const UModelIndex &index) const; void setFixed(const UModelIndex &index, const bool fixed); bool compressed(const UModelIndex &index) const; void setCompressed(const UModelIndex &index, const bool compressed); UByteArray uncompressedData(const UModelIndex &index) const; bool hasEmptyUncompressedData(const UModelIndex &index) const; void setUncompressedData(const UModelIndex &index, const UByteArray &ucdata); UINT8 marking(const UModelIndex &index) const; void setMarking(const UModelIndex &index, const UINT8 marking); UByteArray header(const UModelIndex &index) const; bool hasEmptyHeader(const UModelIndex &index) const; UByteArray body(const UModelIndex &index) const; bool hasEmptyBody(const UModelIndex &index) const; UByteArray tail(const UModelIndex &index) const; bool hasEmptyTail(const UModelIndex &index) const; UByteArray parsingData(const UModelIndex &index) const; bool hasEmptyParsingData(const UModelIndex &index) const; void setParsingData(const UModelIndex &index, const UByteArray &pdata); UModelIndex addItem(const UINT32 offset, const UINT8 type, const UINT8 subtype, const UString & name, const UString & text, const UString & info, const UByteArray & header, const UByteArray & body, const UByteArray & tail, const ItemFixedState fixed, const UModelIndex & parent = UModelIndex(), const UINT8 mode = CREATE_MODE_APPEND); UModelIndex findParentOfType(const UModelIndex & index, UINT8 type) const; UModelIndex findLastParentOfType(const UModelIndex & index, UINT8 type) const; UModelIndex findByBase(UINT32 base) const; }; #if defined(QT_CORE_LIB) // Nothing required here #else inline UModelIndex UModelIndex::parent() const { return m ? m->parent(*this) : UModelIndex(); } inline UModelIndex UModelIndex::child(int row, int column) const { return m ? m->index(row, column, *this) : UModelIndex(); } inline UString UModelIndex::data(int role) const { return m ? m->data(*this, role) : UString(); } #endif #endif // TREEMODEL_H UEFITool-A66/common/types.cpp000077500000000000000000000347201442134156300161520ustar00rootroot00000000000000/* types.cpp Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHWARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "ustring.h" #include "types.h" #include "ffs.h" #include "intel_fit.h" UString regionTypeToUString(const UINT8 type) { switch (type) { case Subtypes::DescriptorRegion: return UString("Descriptor"); case Subtypes::BiosRegion: return UString("BIOS"); case Subtypes::MeRegion: return UString("ME"); case Subtypes::GbeRegion: return UString("GbE"); case Subtypes::PdrRegion: return UString("PDR"); case Subtypes::DevExp1Region: return UString("DevExp1"); case Subtypes::Bios2Region: return UString("BIOS2"); case Subtypes::MicrocodeRegion: return UString("Microcode"); case Subtypes::EcRegion: return UString("EC"); case Subtypes::DevExp2Region: return UString("DevExp2"); case Subtypes::IeRegion: return UString("IE"); case Subtypes::Tgbe1Region: return UString("10GbE1"); case Subtypes::Tgbe2Region: return UString("10GbE2"); case Subtypes::Reserved1Region: return UString("Reserved1"); case Subtypes::Reserved2Region: return UString("Reserved2"); case Subtypes::PttRegion: return UString("PTT"); }; return usprintf("Unknown %02Xh", type); } UString itemTypeToUString(const UINT8 type) { switch (type) { case Types::Root: return UString("Root"); case Types::Image: return UString("Image"); case Types::Capsule: return UString("Capsule"); case Types::Region: return UString("Region"); case Types::Volume: return UString("Volume"); case Types::Padding: return UString("Padding"); case Types::File: return UString("File"); case Types::Section: return UString("Section"); case Types::FreeSpace: return UString("Free space"); case Types::VssStore: return UString("VSS store"); case Types::Vss2Store: return UString("VSS2 store"); case Types::FtwStore: return UString("FTW store"); case Types::FdcStore: return UString("FDC store"); case Types::FsysStore: return UString("Fsys store"); case Types::EvsaStore: return UString("EVSA store"); case Types::CmdbStore: return UString("CMDB store"); case Types::FlashMapStore: return UString("FlashMap store"); case Types::NvarGuidStore: return UString("NVAR GUID store"); case Types::NvarEntry: return UString("NVAR entry"); case Types::VssEntry: return UString("VSS entry"); case Types::FsysEntry: return UString("Fsys entry"); case Types::EvsaEntry: return UString("EVSA entry"); case Types::FlashMapEntry: return UString("FlashMap entry"); case Types::Microcode: return UString("Microcode"); case Types::SlicData: return UString("SLIC data"); case Types::FptStore: return UString("FPT store"); case Types::FptEntry: return UString("FPT entry"); case Types::IfwiHeader: return UString("IFWI header"); case Types::IfwiPartition: return UString("IFWI partition"); case Types::FptPartition: return UString("FPT partition"); case Types::BpdtStore: return UString("BPDT store"); case Types::BpdtEntry: return UString("BPDT entry"); case Types::BpdtPartition: return UString("BPDT partition"); case Types::CpdStore: return UString("CPD store"); case Types::CpdEntry: return UString("CPD entry"); case Types::CpdPartition: return UString("CPD partition"); case Types::CpdExtension: return UString("CPD extension"); case Types::CpdSpiEntry: return UString("CPD SPI entry"); case Types::StartupApDataEntry: return UString("Startup AP data"); } return usprintf("Unknown %02Xh", type); } UString itemSubtypeToUString(const UINT8 type, const UINT8 subtype) { switch (type) { case Types::Image: if (subtype == Subtypes::IntelImage) return UString("Intel"); else if (subtype == Subtypes::UefiImage) return UString("UEFI"); break; case Types::Padding: if (subtype == Subtypes::ZeroPadding) return UString("Empty (0x00)"); else if (subtype == Subtypes::OnePadding) return UString("Empty (0xFF)"); else if (subtype == Subtypes::DataPadding) return UString("Non-empty"); break; case Types::Volume: if (subtype == Subtypes::UnknownVolume) return UString("Unknown"); else if (subtype == Subtypes::Ffs2Volume) return UString("FFSv2"); else if (subtype == Subtypes::Ffs3Volume) return UString("FFSv3"); else if (subtype == Subtypes::NvramVolume) return UString("NVRAM"); else if (subtype == Subtypes::MicrocodeVolume) return UString("Microcode"); break; case Types::Capsule: if (subtype == Subtypes::AptioSignedCapsule) return UString("Aptio signed"); else if (subtype == Subtypes::AptioUnsignedCapsule) return UString("Aptio unsigned"); else if (subtype == Subtypes::UefiCapsule) return UString("UEFI 2.0"); else if (subtype == Subtypes::ToshibaCapsule) return UString("Toshiba"); break; case Types::Region: return regionTypeToUString(subtype); case Types::File: return fileTypeToUString(subtype); case Types::Section: return sectionTypeToUString(subtype); case Types::NvarEntry: if (subtype == Subtypes::InvalidNvarEntry) return UString("Invalid"); else if (subtype == Subtypes::InvalidLinkNvarEntry) return UString("Invalid link"); else if (subtype == Subtypes::LinkNvarEntry) return UString("Link"); else if (subtype == Subtypes::DataNvarEntry) return UString("Data"); else if (subtype == Subtypes::FullNvarEntry) return UString("Full"); break; case Types::VssEntry: if (subtype == Subtypes::InvalidVssEntry) return UString("Invalid"); else if (subtype == Subtypes::StandardVssEntry) return UString("Standard"); else if (subtype == Subtypes::AppleVssEntry) return UString("Apple"); else if (subtype == Subtypes::AuthVssEntry) return UString("Auth"); else if (subtype == Subtypes::IntelVssEntry) return UString("Intel"); break; case Types::FsysEntry: if (subtype == Subtypes::InvalidFsysEntry) return UString("Invalid"); else if (subtype == Subtypes::NormalFsysEntry) return UString("Normal"); break; case Types::EvsaEntry: if (subtype == Subtypes::InvalidEvsaEntry) return UString("Invalid"); else if (subtype == Subtypes::UnknownEvsaEntry) return UString("Unknown"); else if (subtype == Subtypes::GuidEvsaEntry) return UString("GUID"); else if (subtype == Subtypes::NameEvsaEntry) return UString("Name"); else if (subtype == Subtypes::DataEvsaEntry) return UString("Data"); break; case Types::FlashMapEntry: if (subtype == Subtypes::VolumeFlashMapEntry) return UString("Volume"); else if (subtype == Subtypes::DataFlashMapEntry) return UString("Data"); break; case Types::Microcode: if (subtype == Subtypes::IntelMicrocode) return UString("Intel"); else if (subtype == Subtypes::AmdMicrocode) return UString("AMD"); break; case Types::FptEntry: if (subtype == Subtypes::ValidFptEntry) return UString("Valid"); else if (subtype == Subtypes::InvalidFptEntry) return UString("Invalid"); break; case Types::FptPartition: if (subtype == Subtypes::CodeFptPartition) return UString("Code"); else if (subtype == Subtypes::DataFptPartition) return UString("Data"); else if (subtype == Subtypes::GlutFptPartition) return UString("GLUT"); break; case Types::IfwiPartition: if (subtype == Subtypes::BootIfwiPartition) return UString("Boot"); else if (subtype == Subtypes::DataIfwiPartition) return UString("Data"); break; case Types::CpdPartition: if (subtype == Subtypes::ManifestCpdPartition) return UString("Manifest"); else if (subtype == Subtypes::MetadataCpdPartition) return UString("Metadata"); else if (subtype == Subtypes::KeyCpdPartition) return UString("Key"); else if (subtype == Subtypes::CodeCpdPartition) return UString("Code"); break; case Types::StartupApDataEntry: if (subtype == Subtypes::x86128kStartupApDataEntry) return UString("X86 128K"); break; } return UString(); } UString compressionTypeToUString(const UINT8 algorithm) { switch (algorithm) { case COMPRESSION_ALGORITHM_NONE: return UString("None"); case COMPRESSION_ALGORITHM_EFI11: return UString("EFI 1.1"); case COMPRESSION_ALGORITHM_TIANO: return UString("Tiano"); case COMPRESSION_ALGORITHM_UNDECIDED: return UString("Undecided Tiano/EFI 1.1"); case COMPRESSION_ALGORITHM_LZMA: return UString("LZMA"); case COMPRESSION_ALGORITHM_LZMA_INTEL_LEGACY: return UString("Intel legacy LZMA"); case COMPRESSION_ALGORITHM_LZMAF86: return UString("LZMAF86"); case COMPRESSION_ALGORITHM_GZIP: return UString("GZip"); case COMPRESSION_ALGORITHM_ZLIB: return UString("Zlib"); } return usprintf("Unknown %02Xh", algorithm); } UString actionTypeToUString(const UINT8 action) { switch (action) { case Actions::NoAction: return UString(); case Actions::Create: return UString("Create"); case Actions::Insert: return UString("Insert"); case Actions::Replace: return UString("Replace"); case Actions::Remove: return UString("Remove"); case Actions::Rebuild: return UString("Rebuild"); case Actions::Rebase: return UString("Rebase"); } return usprintf("Unknown %02Xh", action); } UString fitEntryTypeToUString(const UINT8 type) { switch (type & 0x7F) { case INTEL_FIT_TYPE_HEADER: return UString("FIT Header"); case INTEL_FIT_TYPE_MICROCODE: return UString("Microcode"); case INTEL_FIT_TYPE_STARTUP_AC_MODULE: return UString("Startup ACM"); case INTEL_FIT_TYPE_DIAG_AC_MODULE: return UString("Diagnostic ACM"); case INTEL_FIT_TYPE_PLATFORM_BOOT_POLICY: return UString("Platform Boot Policy"); case INTEL_FIT_TYPE_FIT_RESET_STATE: return UString("FIT Reset State"); case INTEL_FIT_TYPE_BIOS_STARTUP_MODULE: return UString("BIOS Startup Module"); case INTEL_FIT_TYPE_TPM_POLICY: return UString("TPM Policy"); case INTEL_FIT_TYPE_BIOS_POLICY: return UString("BIOS Policy"); case INTEL_FIT_TYPE_TXT_POLICY: return UString("TXT Policy"); case INTEL_FIT_TYPE_BOOT_GUARD_KEY_MANIFEST: return UString("BootGuard Key Manifest"); case INTEL_FIT_TYPE_BOOT_GUARD_BOOT_POLICY: return UString("BootGuard Boot Policy"); case INTEL_FIT_TYPE_CSE_SECURE_BOOT: return UString("CSE SecureBoot Settings"); case INTEL_FIT_TYPE_VAB_PROVISIONING_TABLE: return UString("VAB Provisioning Table"); case INTEL_FIT_TYPE_VAB_KEY_MANIFEST: return UString("VAB Key Manifest"); case INTEL_FIT_TYPE_VAB_IMAGE_MANIFEST: return UString("VAB Image Manifest"); case INTEL_FIT_TYPE_VAB_IMAGE_HASH_DESCRIPTORS: return UString("VAB Image Hash Descriptors"); case INTEL_FIT_TYPE_SACM_DEBUG_RECORD: return UString("SACM Debug Record"); case INTEL_FIT_TYPE_ACM_FEATURE_POLICY: return UString("ACM Feature Policy"); case INTEL_FIT_TYPE_SCRTM_ERROR_RECORD: return UString("SCRTM Error Record"); case INTEL_FIT_TYPE_JMP_DEBUG_POLICY: return UString("JMP Debug Policy"); case INTEL_FIT_TYPE_EMPTY: return UString("Empty"); } return usprintf("Unknown %02Xh", (type & 0x7F)); } UString hashTypeToUString(const UINT16 algorithm_id) { switch (algorithm_id) { case TCG_HASH_ALGORITHM_ID_SHA1: return UString("SHA1"); case TCG_HASH_ALGORITHM_ID_SHA256: return UString("SHA256"); case TCG_HASH_ALGORITHM_ID_SHA384: return UString("SHA384"); case TCG_HASH_ALGORITHM_ID_SHA512: return UString("SHA512"); case TCG_HASH_ALGORITHM_ID_NULL: return UString("NULL"); case TCG_HASH_ALGORITHM_ID_SM3: return UString("SM3"); } return usprintf("Unknown %04Xh", algorithm_id); } UEFITool-A66/common/types.h000077500000000000000000000103751442134156300156170ustar00rootroot00000000000000/* types.h Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef TYPES_H #define TYPES_H #include "basetypes.h" // Actions namespace Actions { enum ActionTypes { NoAction = 50, Erase, Create, Insert, Replace, Remove, Rebuild, Rebase, }; } // Types namespace Types { enum ItemTypes { Root = 60, Capsule, Image, Region, Padding, Volume, File, Section, FreeSpace, VssStore, Vss2Store, FtwStore, FdcStore, FsysStore, EvsaStore, FlashMapStore, CmdbStore, NvarGuidStore, NvarEntry, VssEntry, FsysEntry, EvsaEntry, FlashMapEntry, Microcode, SlicData, IfwiHeader, IfwiPartition, FptStore, FptEntry, FptPartition, BpdtStore, BpdtEntry, BpdtPartition, CpdStore, CpdEntry, CpdPartition, CpdExtension, CpdSpiEntry, StartupApDataEntry, }; } namespace Subtypes { enum ImageSubtypes{ IntelImage = 90, UefiImage, }; enum CapsuleSubtypes { AptioSignedCapsule = 100, AptioUnsignedCapsule, UefiCapsule, ToshibaCapsule, }; enum VolumeSubtypes { UnknownVolume = 110, Ffs2Volume, Ffs3Volume, NvramVolume, MicrocodeVolume, }; enum RegionSubtypes { DescriptorRegion = 0, BiosRegion, MeRegion, GbeRegion, PdrRegion, DevExp1Region, Bios2Region, MicrocodeRegion, EcRegion, DevExp2Region, IeRegion, Tgbe1Region, Tgbe2Region, Reserved1Region, Reserved2Region, PttRegion, }; enum PaddingSubtypes { ZeroPadding = 120, OnePadding, DataPadding, }; enum NvarEntrySubtypes { InvalidNvarEntry = 130, InvalidLinkNvarEntry, LinkNvarEntry, DataNvarEntry, FullNvarEntry, }; enum VssEntrySubtypes { InvalidVssEntry = 140, StandardVssEntry, AppleVssEntry, AuthVssEntry, IntelVssEntry, }; enum FsysEntrySubtypes { InvalidFsysEntry = 150, NormalFsysEntry, }; enum EvsaEntrySubtypes { InvalidEvsaEntry = 160, UnknownEvsaEntry, GuidEvsaEntry, NameEvsaEntry, DataEvsaEntry, }; enum FlashMapEntrySubtypes { VolumeFlashMapEntry = 170, DataFlashMapEntry, }; enum MicrocodeSubtypes { IntelMicrocode = 180, AmdMicrocode, }; enum SlicDataSubtypes { PubkeySlicData = 190, MarkerSlicData, }; // ME-specific enum IfwiPartitionSubtypes { DataIfwiPartition = 200, BootIfwiPartition, }; enum FptEntrySubtypes { ValidFptEntry = 210, InvalidFptEntry, }; enum FptPartitionSubtypes { CodeFptPartition = 220, DataFptPartition, GlutFptPartition, }; enum CpdPartitionSubtypes { ManifestCpdPartition = 230, MetadataCpdPartition, KeyCpdPartition, CodeCpdPartition, }; enum StartupApDataEntrySubtypes { x86128kStartupApDataEntry = 240, }; } // *ToUString conversion routines extern UString actionTypeToUString(const UINT8 action); extern UString itemTypeToUString(const UINT8 type); extern UString itemSubtypeToUString(const UINT8 type, const UINT8 subtype); extern UString compressionTypeToUString(const UINT8 algorithm); extern UString regionTypeToUString(const UINT8 type); extern UString fitEntryTypeToUString(const UINT8 type); extern UString hashTypeToUString(const UINT16 digest_agorithm_id); #endif // TYPES_H UEFITool-A66/common/ubytearray.h000066400000000000000000000077321442134156300166420ustar00rootroot00000000000000/* ubytearray.h Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef UBYTEARRAY_H #define UBYTEARRAY_H #if defined(QT_CORE_LIB) // Use Qt class, if Qt is available #include #define UByteArray QByteArray #else // Use own implementation #include #include #include #include class UByteArray { public: UByteArray() : d() {} UByteArray(const UByteArray & ba) : d(ba.d) {} UByteArray(const std::basic_string & bs) : d(bs) {} UByteArray(const std::vector & bc) : d(bc.data(), bc.size()) {} UByteArray(const char* bytes, int32_t size) : d(bytes, size) {} UByteArray(const size_t n, char c) : d(n, c) {} ~UByteArray() {} bool isEmpty() const { return d.length() == 0; } char* data() { return d.length() == 0 ? NULL : &(d.at(0)); /* Feels dirty, but works for all basic_string implementations I know, is fully OK in C++11 and later*/ } const char* data() const { return d.c_str(); } const char* constData() const { return d.c_str(); } void clear() { d.clear(); } UByteArray toUpper() { std::basic_string s = d; std::transform(s.begin(), s.end(), s.begin(), ::toupper); return UByteArray(s); } uint32_t toUInt(bool* ok = NULL, const uint8_t base = 10) { return (uint32_t)strtoul(d.c_str(), NULL, base); } int32_t size() const { return (int32_t)d.size(); } int32_t count(char ch) const { return (int32_t)std::count(d.begin(), d.end(), ch); } char at(uint32_t i) const { return d.at(i); } char operator[](uint32_t i) const { return d[i]; } char& operator[](uint32_t i) { return d[i]; } bool startsWith(const UByteArray & ba) const { return 0 == d.find(ba.d, 0); } int indexOf(const UByteArray & ba, int from = 0) const { return (int)d.find(ba.d, from); } int lastIndexOf(const UByteArray & ba, int from = 0) const { size_t old_index = d.npos; size_t index = d.find(ba.d, from); while (index != d.npos) { old_index = index; index = d.find(ba.d, index + 1); } return (int)old_index; } UByteArray left(int32_t len) const { return d.substr(0, len); } UByteArray right(int32_t len) const { return d.substr(d.size() - len, len); } UByteArray mid(int32_t pos, int32_t len = -1) const { return d.substr(pos, len); } UByteArray & operator=(const UByteArray & ba) { d = ba.d; return *this; } UByteArray & operator+=(const UByteArray & ba) { d += ba.d; return *this; } bool operator== (const UByteArray & ba) const { return d == ba.d; } bool operator!= (const UByteArray & ba) const { return d != ba.d; } inline void swap(UByteArray &other) { std::swap(d, other.d); } UByteArray toHex() { std::basic_string hex(size() * 2, '\x00'); for (int32_t i = 0; i < size(); i++) { uint8_t low = d[i] & 0x0F; uint8_t high = (d[i] & 0xF0) >> 4; low += (low < 10 ? '0' : 'a' - 10); high += (high < 10 ? '0' : 'a' - 10); hex[2*i] = high; hex[2*i + 1] = low; } return UByteArray(hex); } std::basic_string::iterator begin() {return d.begin();} std::basic_string::iterator end() {return d.end();} std::basic_string::const_iterator begin() const {return d.begin();} std::basic_string::const_iterator end() const {return d.end();} private: std::basic_string d; }; inline const UByteArray operator+(const UByteArray &a1, const UByteArray &a2) { return UByteArray(a1) += a2; } #endif // QT_CORE_LIB #endif // UBYTEARRAY_H UEFITool-A66/common/umemstream.h000066400000000000000000000033451442134156300166260ustar00rootroot00000000000000/* umemstream.h Copyright (c) 2023, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef UMEMSTREAM_H #define UMEMSTREAM_H #include // NOTE: this implementation is certainly not a valid replacement to std::stringstream // NOTE: because it only supports getting through the buffer once // NOTE: however, we already do it this way, so it's enough for practical purposes class umembuf : public std::streambuf { public: umembuf(const char *p, size_t l) { setg((char*)p, (char*)p, (char*)p + l); } pos_type seekoff(off_type off, std::ios_base::seekdir dir, std::ios_base::openmode which = std::ios_base::in) override { (void)which; if (dir == std::ios_base::cur) gbump((int)off); else if (dir == std::ios_base::end) setg(eback(), egptr() + off, egptr()); else if (dir == std::ios_base::beg) setg(eback(), eback() + off, egptr()); return gptr() - eback(); } pos_type seekpos(pos_type sp, std::ios_base::openmode which) override { return seekoff(sp - pos_type(off_type(0)), std::ios_base::beg, which); } }; class umemstream : public std::istream { public: umemstream(const char *p, size_t l) : std::istream(&buffer_), buffer_(p, l) { rdbuf(&buffer_); } private: umembuf buffer_; }; #endif // UMEMSTREAM_H UEFITool-A66/common/ustring.cpp000066400000000000000000000061071442134156300164740ustar00rootroot00000000000000/* ustring.cpp Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "ustring.h" #include #include #include #if defined(QT_CORE_LIB) UString usprintf(const char* fmt, ...) { UString msg; va_list vl; va_start(vl, fmt); msg = msg.vasprintf(fmt, vl); va_end(vl); return msg; }; UString urepeated(char c, int len) { return UString(len, c); } #else /* Give WATCOM C/C++, MSVC some latitude for their non-support of vsnprintf */ #if defined(__WATCOMC__) || defined(_MSC_VER) #define exvsnprintf(r,b,n,f,a) {r = _vsnprintf (b,n,f,a);} #else #ifdef BSTRLIB_NOVSNP /* This is just a hack. If you are using a system without a vsnprintf, it is not recommended that bformat be used at all. */ #define exvsnprintf(r,b,n,f,a) {vsprintf (b,f,a); r = -1;} #define START_VSNBUFF (256) #else #if defined (__GNUC__) && !defined (__PPC__) && !defined(__WIN32__) /* Something is making gcc complain about this prototype not being here, so I've just gone ahead and put it in. */ extern "C" { extern int vsnprintf(char *buf, size_t count, const char *format, va_list arg); } #endif #define exvsnprintf(r,b,n,f,a) {r = vsnprintf (b,n,f,a);} #endif #endif #ifndef START_VSNBUFF #define START_VSNBUFF (16) #endif UString usprintf(const char* fmt, ...) { UString msg; bstring b; va_list arglist; int r, n; if (fmt == NULL) { msg = ""; } else { if ((b = bfromcstr("")) == NULL) { msg = ""; } else { if ((n = (int)(2 * (strlen)(fmt))) < START_VSNBUFF) n = START_VSNBUFF; for (;;) { if (BSTR_OK != balloc(b, n + 2)) { b = bformat(""); break; } va_start(arglist, fmt); exvsnprintf(r, (char *)b->data, n + 1, fmt, arglist); va_end(arglist); b->data[n] = '\0'; b->slen = (int)(strlen)((char *)b->data); if (b->slen < n) break; if (r > n) n = r; else n += n; } msg = *b; bdestroy(b); } } return msg; } UString urepeated(char c, int len) { return UString(c, len); } #endif UString uFromUcs2(const char* str, size_t max_len) { // Naive implementation assuming that only ASCII LE part of UCS2 is used, str may not be aligned. UString msg; const char *str8 = str; size_t rest = (max_len == 0) ? SIZE_MAX : max_len; while (str8[0] && rest) { msg += str8[0]; str8 += 2; rest--; } return msg; } UEFITool-A66/common/ustring.h000066400000000000000000000017461442134156300161450ustar00rootroot00000000000000/* ustring.h Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef USTRING_H #define USTRING_H #include "basetypes.h" #if defined (QT_CORE_LIB) // Use Qt class, if Qt is available #include #define UString QString #define findreplace replace #else // Use Bstrlib #define BSTRLIB_DOESNT_THROW_EXCEPTIONS #include "bstrlib/bstrwrap.h" #define UString CBString #endif // QT_CORE_LIB UString usprintf(const char* fmt, ...) ATTRIBUTE_FORMAT_(printf, 1, 2); UString urepeated(char c, int len); UString uFromUcs2(const char* str, size_t max_len = 0); #endif // USTRING_H UEFITool-A66/common/utility.cpp000077500000000000000000000516231442134156300165120ustar00rootroot00000000000000/* utility.cpp Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include #include #include #include "treemodel.h" #include "utility.h" #include "ffs.h" #include "Tiano/EfiTianoCompress.h" #include "Tiano/EfiTianoDecompress.h" #include "LZMA/LzmaCompress.h" #include "LZMA/LzmaDecompress.h" // Returns bytes as string when all bytes are ascii visible, hex representation otherwise UString visibleAsciiOrHex(UINT8* bytes, UINT32 length) { bool ascii = true; UString asciiString; UString hexString; for (UINT32 i = 0; i < length; i++) { hexString += usprintf("%02X", bytes[i]); if (ascii && i > 0 && bytes[i] == '\x00') { // Check for the rest of the buffer being zeroes, and make the whole previous string visible, if so for (UINT32 j = i + 1; j < length; j++) { if (bytes[j] != '\x00') { ascii = false; break; } } if (ascii) { // No need to continue iterating over every symbol, we did it already break; } } else if (bytes[i] < '\x20' || bytes[i] > '\x7E') { // Explicit ascii codes to avoid locale dependency ascii = false; } if (ascii) { asciiString += usprintf("%c", bytes[i]); } } if (ascii) { return asciiString; } return hexString; } // Returns unique name string based for tree item UString uniqueItemName(const UModelIndex & index) { // Sanity check if (!index.isValid()) return UString("InvalidIndex"); // Get model from index const TreeModel* model = (const TreeModel*)index.model(); // Construct the name UString itemName = model->name(index); UString itemText = model->text(index); // Default name UString name = itemName; switch (model->type(index)) { case Types::NvarEntry: case Types::VssEntry: case Types::FsysEntry: case Types::EvsaEntry: case Types::FlashMapEntry: case Types::File: name = itemText.isEmpty() ? itemName : itemName + '_' + itemText; break; case Types::Section: { // Get parent file name UModelIndex fileIndex = model->findParentOfType(index, Types::File); UString fileText = model->text(fileIndex); name = fileText.isEmpty() ? model->name(fileIndex) : model->name(fileIndex) + '_' + fileText; // Special case of GUIDed sections if (model->subtype(index) == EFI_SECTION_GUID_DEFINED || model->subtype(index) == EFI_SECTION_FREEFORM_SUBTYPE_GUID) { name = model->name(index) +'_' + name; } } break; } // Populate subtypeString UString subtypeString = itemSubtypeToUString(model->type(index), model->subtype(index)); // Create final name name = itemTypeToUString(model->type(index)) + (subtypeString.length() ? ('_' + subtypeString) : UString()) + '_' + name; fixFileName(name, true); return name; } // Makes the name usable as a file name void fixFileName(UString &name, bool replaceSpaces) { // Replace some symbols with underscores for compatibility const char table[] = { '/', // Banned in *nix and Windows '<', '>', ':', '\"', '\\', '|', '?', '*', // Banned in Windows }; int nameLength = (int)name.length(); // Note: Qt uses int for whatever reason. for (int i = 0; i < nameLength; i++) { if ( name[i] < (char)0x20 || // ASCII control characters, banned in Windows, hard to work with in *nix name[i] > (char)0x7f || // high ASCII characters (replaceSpaces && name[i] == ' ') // Provides better readability ) { name[i] = '_'; continue; } for (size_t j = 0; j < sizeof(table); j++) { if (name[i] == table[j]) { name[i] = '_'; break; } } } if (!nameLength) { name = "_"; } } // Returns text representation of error code UString errorCodeToUString(USTATUS errorCode) { // TODO: improve switch (errorCode) { case U_SUCCESS: return UString("Success"); case U_NOT_IMPLEMENTED: return UString("Not implemented"); case U_INVALID_PARAMETER: return UString("Function called with invalid parameter"); case U_BUFFER_TOO_SMALL: return UString("Buffer too small"); case U_OUT_OF_RESOURCES: return UString("Out of resources"); case U_OUT_OF_MEMORY: return UString("Out of memory"); case U_FILE_OPEN: return UString("File can't be opened"); case U_FILE_READ: return UString("File can't be read"); case U_FILE_WRITE: return UString("File can't be written"); case U_ITEM_NOT_FOUND: return UString("Item not found"); case U_UNKNOWN_ITEM_TYPE: return UString("Unknown item type"); case U_INVALID_FLASH_DESCRIPTOR: return UString("Invalid flash descriptor"); case U_INVALID_REGION: return UString("Invalid region"); case U_EMPTY_REGION: return UString("Empty region"); case U_BIOS_REGION_NOT_FOUND: return UString("BIOS region not found"); case U_VOLUMES_NOT_FOUND: return UString("UEFI volumes not found"); case U_INVALID_VOLUME: return UString("Invalid UEFI volume"); case U_VOLUME_REVISION_NOT_SUPPORTED: return UString("Volume revision not supported"); case U_UNKNOWN_FFS: return UString("Unknown file system"); case U_INVALID_FILE: return UString("Invalid file"); case U_INVALID_SECTION: return UString("Invalid section"); case U_UNKNOWN_SECTION: return UString("Unknown section"); case U_STANDARD_COMPRESSION_FAILED: return UString("Standard compression failed"); case U_CUSTOMIZED_COMPRESSION_FAILED: return UString("Customized compression failed"); case U_STANDARD_DECOMPRESSION_FAILED: return UString("Standard decompression failed"); case U_CUSTOMIZED_DECOMPRESSION_FAILED: return UString("Customized decompression failed"); case U_UNKNOWN_COMPRESSION_TYPE: return UString("Unknown compression type"); case U_UNKNOWN_EXTRACT_MODE: return UString("Unknown extract mode"); case U_UNKNOWN_REPLACE_MODE: return UString("Unknown replace mode"); case U_UNKNOWN_IMAGE_TYPE: return UString("Unknown executable image type"); case U_UNKNOWN_PE_OPTIONAL_HEADER_TYPE: return UString("Unknown PE optional header type"); case U_UNKNOWN_RELOCATION_TYPE: return UString("Unknown relocation type"); case U_COMPLEX_BLOCK_MAP: return UString("Block map structure too complex for correct analysis"); case U_DIR_ALREADY_EXIST: return UString("Directory already exists"); case U_DIR_CREATE: return UString("Directory can't be created"); case U_DIR_CHANGE: return UString("Change directory failed"); case U_DEPEX_PARSE_FAILED: return UString("Dependency expression parsing failed"); case U_TRUNCATED_IMAGE: return UString("Image is truncated"); case U_INVALID_CAPSULE: return UString("Invalid capsule"); case U_STORES_NOT_FOUND: return UString("Stores not found"); case U_INVALID_STORE_SIZE: return UString("Invalid store size"); case U_INVALID_STORE: return UString("Invalid store"); default: return usprintf("Unknown error %02lX", errorCode); } } // Compression routines USTATUS decompress(const UByteArray & compressedData, const UINT8 compressionType, UINT8 & algorithm, UINT32 & dictionarySize, UByteArray & decompressedData, UByteArray & efiDecompressedData) { const UINT8* data; UINT32 dataSize; UINT8* decompressed; UINT8* efiDecompressed; UINT32 decompressedSize = 0; UINT8* scratch; UINT32 scratchSize = 0; const EFI_TIANO_HEADER* header; // For all but LZMA dictionary size is 0 dictionarySize = 0; switch (compressionType) { case EFI_NOT_COMPRESSED: { decompressedData = compressedData; algorithm = COMPRESSION_ALGORITHM_NONE; return U_SUCCESS; } case EFI_STANDARD_COMPRESSION: { // Set default algorithm to unknown algorithm = COMPRESSION_ALGORITHM_UNKNOWN; // Get buffer sizes data = (UINT8*)compressedData.data(); dataSize = (UINT32)compressedData.size(); // Check header to be valid header = (const EFI_TIANO_HEADER*)data; if (header->CompSize + sizeof(EFI_TIANO_HEADER) != dataSize) return U_STANDARD_DECOMPRESSION_FAILED; // Get info function is the same for both algorithms if (U_SUCCESS != EfiTianoGetInfo(data, dataSize, &decompressedSize, &scratchSize)) return U_STANDARD_DECOMPRESSION_FAILED; // Allocate memory decompressed = (UINT8*)malloc(decompressedSize); efiDecompressed = (UINT8*)malloc(decompressedSize); scratch = (UINT8*)malloc(scratchSize); if (!decompressed || !efiDecompressed || !scratch) { free(decompressed); free(efiDecompressed); free(scratch); return U_STANDARD_DECOMPRESSION_FAILED; } // Decompress section data using both algorithms USTATUS result = U_SUCCESS; // Try Tiano USTATUS TianoResult = TianoDecompress(data, dataSize, decompressed, decompressedSize, scratch, scratchSize); // Try EFI 1.1 USTATUS EfiResult = EfiDecompress(data, dataSize, efiDecompressed, decompressedSize, scratch, scratchSize); if (decompressedSize > INT32_MAX) { result = U_STANDARD_DECOMPRESSION_FAILED; } else if (EfiResult == U_SUCCESS && TianoResult == U_SUCCESS) { // Both decompressions are OK algorithm = COMPRESSION_ALGORITHM_UNDECIDED; decompressedData = UByteArray((const char*)decompressed, (int)decompressedSize); efiDecompressedData = UByteArray((const char*)efiDecompressed, (int)decompressedSize); } else if (TianoResult == U_SUCCESS) { // Only Tiano is OK algorithm = COMPRESSION_ALGORITHM_TIANO; decompressedData = UByteArray((const char*)decompressed, (int)decompressedSize); } else if (EfiResult == U_SUCCESS) { // Only EFI 1.1 is OK algorithm = COMPRESSION_ALGORITHM_EFI11; decompressedData = UByteArray((const char*)efiDecompressed, (int)decompressedSize); } else { // Both decompressions failed result = U_STANDARD_DECOMPRESSION_FAILED; } free(decompressed); free(efiDecompressed); free(scratch); return result; } case EFI_CUSTOMIZED_COMPRESSION: { // Set default algorithm to unknown algorithm = COMPRESSION_ALGORITHM_UNKNOWN; // Get buffer sizes data = (const UINT8*)compressedData.constData(); dataSize = (UINT32)compressedData.size(); // Get info as normal LZMA section if (U_SUCCESS != LzmaGetInfo(data, dataSize, &decompressedSize)) { // Get info as Intel legacy LZMA section data += sizeof(UINT32); if (U_SUCCESS != LzmaGetInfo(data, dataSize, &decompressedSize)) { return U_CUSTOMIZED_DECOMPRESSION_FAILED; } else { algorithm = COMPRESSION_ALGORITHM_LZMA_INTEL_LEGACY; } } else { algorithm = COMPRESSION_ALGORITHM_LZMA; } // Allocate memory decompressed = (UINT8*)malloc(decompressedSize); if (!decompressed) { return U_OUT_OF_MEMORY; } // Decompress section data if (U_SUCCESS != LzmaDecompress(data, dataSize, decompressed)) { free(decompressed); return U_CUSTOMIZED_DECOMPRESSION_FAILED; } if (decompressedSize > INT32_MAX) { free(decompressed); return U_CUSTOMIZED_DECOMPRESSION_FAILED; } dictionarySize = readUnaligned((UINT32*)(data + 1)); // LZMA dictionary size is stored in bytes 1-4 of LZMA properties header decompressedData = UByteArray((const char*)decompressed, (int)decompressedSize); free(decompressed); return U_SUCCESS; } case EFI_CUSTOMIZED_COMPRESSION_LZMAF86: { // Set default algorithm to unknown algorithm = COMPRESSION_ALGORITHM_UNKNOWN; // Get buffer sizes data = (const UINT8*)compressedData.constData(); dataSize = (UINT32)compressedData.size(); // Get info as normal LZMA section if (U_SUCCESS != LzmaGetInfo(data, dataSize, &decompressedSize)) { return U_CUSTOMIZED_DECOMPRESSION_FAILED; } algorithm = COMPRESSION_ALGORITHM_LZMAF86; // Allocate memory decompressed = (UINT8*)malloc(decompressedSize); if (!decompressed) { return U_OUT_OF_MEMORY; } // Decompress section data if (U_SUCCESS != LzmaDecompress(data, dataSize, decompressed)) { free(decompressed); return U_CUSTOMIZED_DECOMPRESSION_FAILED; } if (decompressedSize > INT32_MAX) { free(decompressed); return U_CUSTOMIZED_DECOMPRESSION_FAILED; } // TODO: need to correctly handle non-x86 architecture of the FW image // After LZMA decompression, the data need to be converted to the raw data. UINT32 state = 0; const UINT8 x86LookAhead = 4; if (decompressedSize != x86LookAhead + x86_Convert(decompressed, decompressedSize, 0, &state, 0)) { free(decompressed); return U_CUSTOMIZED_DECOMPRESSION_FAILED; } dictionarySize = readUnaligned((UINT32*)(data + 1)); // LZMA dictionary size is stored in bytes 1-4 of LZMA properties header decompressedData = UByteArray((const char*)decompressed, (int)decompressedSize); free(decompressed); return U_SUCCESS; } default: { algorithm = COMPRESSION_ALGORITHM_UNKNOWN; return U_UNKNOWN_COMPRESSION_TYPE; } } } // 8bit sum calculation routine UINT8 calculateSum8(const UINT8* buffer, UINT32 bufferSize) { if (!buffer) return 0; UINT8 counter = 0; while (bufferSize--) counter += buffer[bufferSize]; return counter; } // 8bit checksum calculation routine UINT8 calculateChecksum8(const UINT8* buffer, UINT32 bufferSize) { if (!buffer) return 0; return (UINT8)(0x100U - calculateSum8(buffer, bufferSize)); } // 16bit checksum calculation routine UINT16 calculateChecksum16(const UINT16* buffer, UINT32 bufferSize) { if (!buffer) return 0; UINT16 counter = 0; UINT32 index = 0; bufferSize /= sizeof(UINT16); for (; index < bufferSize; index++) { counter = (UINT16)(counter + buffer[index]); } return (UINT16)(0x10000 - counter); } // 32bit checksum calculation routine UINT32 calculateChecksum32(const UINT32* buffer, UINT32 bufferSize) { if (!buffer) return 0; UINT32 counter = 0; UINT32 index = 0; bufferSize /= sizeof(UINT32); for (; index < bufferSize; index++) { counter = (UINT32)(counter + buffer[index]); } return (UINT32)(0x100000000ULL - counter); } // Get padding type for a given padding UINT8 getPaddingType(const UByteArray & padding) { if (padding.count('\x00') == padding.size()) return Subtypes::ZeroPadding; if (padding.count('\xFF') == padding.size()) return Subtypes::OnePadding; return Subtypes::DataPadding; } static inline int char2hex(char c) { if (c >= '0' && c <= '9') return c - '0'; if (c >= 'A' && c <= 'F') return c - 'A' + 10; if (c == '.') return -2; return -1; } INTN findPattern(const UINT8 *pattern, const UINT8 *patternMask, UINTN patternSize, const UINT8 *data, UINTN dataSize, UINTN dataOff) { if (patternSize == 0 || dataSize == 0 || dataOff >= dataSize || dataSize - dataOff < patternSize) return -1; while (dataOff + patternSize < dataSize) { bool matches = true; for (UINTN i = 0; i < patternSize; i++) { if ((data[dataOff + i] & patternMask[i]) != pattern[i]) { matches = false; break; } } if (matches) return static_cast(dataOff); dataOff++; } return -1; } bool makePattern(const CHAR8 *textPattern, std::vector &pattern, std::vector &patternMask) { UINTN len = std::strlen(textPattern); if (len == 0 || len % 2 != 0) return false; len /= 2; pattern.resize(len); patternMask.resize(len); for (UINTN i = 0; i < len; i++) { int v1 = char2hex(std::toupper(textPattern[i * 2])); int v2 = char2hex(std::toupper(textPattern[i * 2 + 1])); if (v1 == -1 || v2 == -1) return false; if (v1 != -2) { patternMask[i] = 0xF0; pattern[i] = static_cast(v1) << 4; } if (v2 != -2) { patternMask[i] |= 0x0F; pattern[i] |= static_cast(v2); } } return true; } USTATUS gzipDecompress(const UByteArray & input, UByteArray & output) { output.clear(); if (input.size() == 0) return U_SUCCESS; z_stream stream = {}; stream.next_in = (z_const Bytef *)input.data(); stream.avail_in = (uInt)input.size(); stream.zalloc = Z_NULL; stream.zfree = Z_NULL; stream.opaque = Z_NULL; // 15 for the maximum history buffer, 16 for gzip only input int ret = inflateInit2(&stream, 15U | 16U); if (ret != Z_OK) return U_GZIP_DECOMPRESSION_FAILED; while (ret == Z_OK) { Bytef out[0x1000] = {}; stream.next_out = out; stream.avail_out = sizeof(out); ret = inflate(&stream, Z_NO_FLUSH); if ((ret == Z_OK || ret == Z_STREAM_END) && stream.avail_out != sizeof(out)) output += UByteArray((char *)out, sizeof(out) - stream.avail_out); } inflateEnd(&stream); return ret == Z_STREAM_END ? U_SUCCESS : U_GZIP_DECOMPRESSION_FAILED; } USTATUS zlibDecompress(const UByteArray& input, UByteArray& output) { output.clear(); if (input.size() == 0) return U_SUCCESS; z_stream stream = {}; stream.next_in = (z_const Bytef*)input.data(); stream.avail_in = (uInt)input.size(); stream.zalloc = Z_NULL; stream.zfree = Z_NULL; stream.opaque = Z_NULL; // 15 for the maximum history buffer int ret = inflateInit2(&stream, 15U); if (ret != Z_OK) return U_ZLIB_DECOMPRESSION_FAILED; while (ret == Z_OK) { Bytef out[0x1000] = {}; stream.next_out = out; stream.avail_out = sizeof(out); ret = inflate(&stream, Z_NO_FLUSH); if ((ret == Z_OK || ret == Z_STREAM_END) && stream.avail_out != sizeof(out)) output += UByteArray((char*)out, sizeof(out) - stream.avail_out); } inflateEnd(&stream); return ret == Z_STREAM_END ? U_SUCCESS : U_ZLIB_DECOMPRESSION_FAILED; } UEFITool-A66/common/utility.h000077500000000000000000000050121442134156300161460ustar00rootroot00000000000000/* utility.h Copyright (c) 2016, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef UTILITY_H #define UTILITY_H #include #include "../common/zlib/zlib.h" #include "basetypes.h" #include "ustring.h" #include "treemodel.h" #include "parsingdata.h" // Returns bytes as string when all bytes are ascii visible, hex representation otherwise UString visibleAsciiOrHex(UINT8* bytes, UINT32 length); // Returns unique name for tree item UString uniqueItemName(const UModelIndex & index); // Makes the name usable as a file name void fixFileName(UString &name, bool replaceSpaces); // Converts error code to UString UString errorCodeToUString(USTATUS errorCode); // EFI/Tiano/LZMA decompression routine USTATUS decompress(const UByteArray & compressed, const UINT8 compressionType, UINT8 & algorithm, UINT32 & dictionarySize, UByteArray & decompressed, UByteArray & efiDecompressed); // GZIP decompression routine USTATUS gzipDecompress(const UByteArray & compressed, UByteArray & decompressed); // ZLIB decompression routine USTATUS zlibDecompress(const UByteArray& compressed, UByteArray& decompressed); // 8bit sum calculation routine UINT8 calculateSum8(const UINT8* buffer, UINT32 bufferSize); // 8bit checksum calculation routine UINT8 calculateChecksum8(const UINT8* buffer, UINT32 bufferSize); // 16bit checksum calculation routine UINT16 calculateChecksum16(const UINT16* buffer, UINT32 bufferSize); // 32bit checksum calculation routine UINT32 calculateChecksum32(const UINT32* buffer, UINT32 bufferSize); // Return padding type from it's contents UINT8 getPaddingType(const UByteArray & padding); // Make pattern from a hexstring with an assumption of . being any char bool makePattern(const CHAR8 *textPattern, std::vector &pattern, std::vector &patternMask); // Find pattern in a binary blob INTN findPattern(const UINT8 *pattern, const UINT8 *patternMask, UINTN patternSize, const UINT8 *data, UINTN dataSize, UINTN dataOff); // Safely dereferences misaligned pointers template inline T readUnaligned(const T *v) { T tmp = {}; memcpy(&tmp, v, sizeof(T)); return tmp; } #endif // UTILITY_H UEFITool-A66/common/zlib/000077500000000000000000000000001442134156300152315ustar00rootroot00000000000000UEFITool-A66/common/zlib/adler32.c000077500000000000000000000121241442134156300166340ustar00rootroot00000000000000/* adler32.c -- compute the Adler-32 checksum of a data stream * Copyright (C) 1995-2011, 2016 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ /* @(#) $Id$ */ #include "zutil.h" local uLong adler32_combine_ OF((uLong adler1, uLong adler2, z_off64_t len2)); #define BASE 65521U /* largest prime smaller than 65536 */ #define NMAX 5552 /* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */ #define DO1(buf,i) {adler += (buf)[i]; sum2 += adler;} #define DO2(buf,i) DO1(buf,i); DO1(buf,i+1); #define DO4(buf,i) DO2(buf,i); DO2(buf,i+2); #define DO8(buf,i) DO4(buf,i); DO4(buf,i+4); #define DO16(buf) DO8(buf,0); DO8(buf,8); /* use NO_DIVIDE if your processor does not do division in hardware -- try it both ways to see which is faster */ #ifdef NO_DIVIDE /* note that this assumes BASE is 65521, where 65536 % 65521 == 15 (thank you to John Reiser for pointing this out) */ # define CHOP(a) \ do { \ unsigned long tmp = a >> 16; \ a &= 0xffffUL; \ a += (tmp << 4) - tmp; \ } while (0) # define MOD28(a) \ do { \ CHOP(a); \ if (a >= BASE) a -= BASE; \ } while (0) # define MOD(a) \ do { \ CHOP(a); \ MOD28(a); \ } while (0) # define MOD63(a) \ do { /* this assumes a is not negative */ \ z_off64_t tmp = a >> 32; \ a &= 0xffffffffL; \ a += (tmp << 8) - (tmp << 5) + tmp; \ tmp = a >> 16; \ a &= 0xffffL; \ a += (tmp << 4) - tmp; \ tmp = a >> 16; \ a &= 0xffffL; \ a += (tmp << 4) - tmp; \ if (a >= BASE) a -= BASE; \ } while (0) #else # define MOD(a) a %= BASE # define MOD28(a) a %= BASE # define MOD63(a) a %= BASE #endif /* ========================================================================= */ uLong ZEXPORT adler32_z(adler, buf, len) uLong adler; const Bytef *buf; z_size_t len; { unsigned long sum2; unsigned n; /* split Adler-32 into component sums */ sum2 = (adler >> 16) & 0xffff; adler &= 0xffff; /* in case user likes doing a byte at a time, keep it fast */ if (len == 1) { adler += buf[0]; if (adler >= BASE) adler -= BASE; sum2 += adler; if (sum2 >= BASE) sum2 -= BASE; return adler | (sum2 << 16); } /* initial Adler-32 value (deferred check for len == 1 speed) */ if (buf == Z_NULL) return 1L; /* in case short lengths are provided, keep it somewhat fast */ if (len < 16) { while (len--) { adler += *buf++; sum2 += adler; } if (adler >= BASE) adler -= BASE; MOD28(sum2); /* only added so many BASE's */ return adler | (sum2 << 16); } /* do length NMAX blocks -- requires just one modulo operation */ while (len >= NMAX) { len -= NMAX; n = NMAX / 16; /* NMAX is divisible by 16 */ do { DO16(buf); /* 16 sums unrolled */ buf += 16; } while (--n); MOD(adler); MOD(sum2); } /* do remaining bytes (less than NMAX, still just one modulo) */ if (len) { /* avoid modulos if none remaining */ while (len >= 16) { len -= 16; DO16(buf); buf += 16; } while (len--) { adler += *buf++; sum2 += adler; } MOD(adler); MOD(sum2); } /* return recombined sums */ return adler | (sum2 << 16); } /* ========================================================================= */ uLong ZEXPORT adler32(adler, buf, len) uLong adler; const Bytef *buf; uInt len; { return adler32_z(adler, buf, len); } /* ========================================================================= */ local uLong adler32_combine_(adler1, adler2, len2) uLong adler1; uLong adler2; z_off64_t len2; { unsigned long sum1; unsigned long sum2; unsigned rem; /* for negative len, return invalid adler32 as a clue for debugging */ if (len2 < 0) return 0xffffffffUL; /* the derivation of this formula is left as an exercise for the reader */ MOD63(len2); /* assumes len2 >= 0 */ rem = (unsigned)len2; sum1 = adler1 & 0xffff; sum2 = rem * sum1; MOD(sum2); sum1 += (adler2 & 0xffff) + BASE - 1; sum2 += ((adler1 >> 16) & 0xffff) + ((adler2 >> 16) & 0xffff) + BASE - rem; if (sum1 >= BASE) sum1 -= BASE; if (sum1 >= BASE) sum1 -= BASE; if (sum2 >= ((unsigned long)BASE << 1)) sum2 -= ((unsigned long)BASE << 1); if (sum2 >= BASE) sum2 -= BASE; return sum1 | (sum2 << 16); } /* ========================================================================= */ uLong ZEXPORT adler32_combine(adler1, adler2, len2) uLong adler1; uLong adler2; z_off_t len2; { return adler32_combine_(adler1, adler2, len2); } uLong ZEXPORT adler32_combine64(adler1, adler2, len2) uLong adler1; uLong adler2; z_off64_t len2; { return adler32_combine_(adler1, adler2, len2); } UEFITool-A66/common/zlib/compress.c000077500000000000000000000052131442134156300172340ustar00rootroot00000000000000/* compress.c -- compress a memory buffer * Copyright (C) 1995-2005, 2014, 2016 Jean-loup Gailly, Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ /* @(#) $Id$ */ #define ZLIB_INTERNAL #include "zlib.h" /* =========================================================================== Compresses the source buffer into the destination buffer. The level parameter has the same meaning as in deflateInit. sourceLen is the byte length of the source buffer. Upon entry, destLen is the total size of the destination buffer, which must be at least 0.1% larger than sourceLen plus 12 bytes. Upon exit, destLen is the actual size of the compressed buffer. compress2 returns Z_OK if success, Z_MEM_ERROR if there was not enough memory, Z_BUF_ERROR if there was not enough room in the output buffer, Z_STREAM_ERROR if the level parameter is invalid. */ int ZEXPORT compress2 (dest, destLen, source, sourceLen, level) Bytef *dest; uLongf *destLen; const Bytef *source; uLong sourceLen; int level; { z_stream stream; int err; const uInt max = (uInt)-1; uLong left; left = *destLen; *destLen = 0; stream.zalloc = (alloc_func)0; stream.zfree = (free_func)0; stream.opaque = (voidpf)0; err = deflateInit(&stream, level); if (err != Z_OK) return err; stream.next_out = dest; stream.avail_out = 0; stream.next_in = (z_const Bytef *)source; stream.avail_in = 0; do { if (stream.avail_out == 0) { stream.avail_out = left > (uLong)max ? max : (uInt)left; left -= stream.avail_out; } if (stream.avail_in == 0) { stream.avail_in = sourceLen > (uLong)max ? max : (uInt)sourceLen; sourceLen -= stream.avail_in; } err = deflate(&stream, sourceLen ? Z_NO_FLUSH : Z_FINISH); } while (err == Z_OK); *destLen = stream.total_out; deflateEnd(&stream); return err == Z_STREAM_END ? Z_OK : err; } /* =========================================================================== */ int ZEXPORT compress (dest, destLen, source, sourceLen) Bytef *dest; uLongf *destLen; const Bytef *source; uLong sourceLen; { return compress2(dest, destLen, source, sourceLen, Z_DEFAULT_COMPRESSION); } /* =========================================================================== If the default memLevel or windowBits for deflateInit() is changed, then this function needs to be updated. */ uLong ZEXPORT compressBound (sourceLen) uLong sourceLen; { return sourceLen + (sourceLen >> 12) + (sourceLen >> 14) + (sourceLen >> 25) + 13; } UEFITool-A66/common/zlib/crc32.c000077500000000000000000000333451442134156300163240ustar00rootroot00000000000000/* crc32.c -- compute the CRC-32 of a data stream * Copyright (C) 1995-2006, 2010, 2011, 2012, 2016 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h * * Thanks to Rodney Brown for his contribution of faster * CRC methods: exclusive-oring 32 bits of data at a time, and pre-computing * tables for updating the shift register in one step with three exclusive-ors * instead of four steps with four exclusive-ors. This results in about a * factor of two increase in speed on a Power PC G4 (PPC7455) using gcc -O3. */ /* @(#) $Id$ */ /* Note on the use of DYNAMIC_CRC_TABLE: there is no mutex or semaphore protection on the static variables used to control the first-use generation of the crc tables. Therefore, if you #define DYNAMIC_CRC_TABLE, you should first call get_crc_table() to initialize the tables before allowing more than one thread to use crc32(). DYNAMIC_CRC_TABLE and MAKECRCH can be #defined to write out crc32.h. */ #ifdef MAKECRCH # include # ifndef DYNAMIC_CRC_TABLE # define DYNAMIC_CRC_TABLE # endif /* !DYNAMIC_CRC_TABLE */ #endif /* MAKECRCH */ #include "zutil.h" /* for STDC and FAR definitions */ /* Definitions for doing the crc four data bytes at a time. */ #if !defined(NOBYFOUR) && defined(Z_U4) # define BYFOUR #endif #ifdef BYFOUR local unsigned long crc32_little OF((unsigned long, const unsigned char FAR *, z_size_t)); local unsigned long crc32_big OF((unsigned long, const unsigned char FAR *, z_size_t)); # define TBLS 8 #else # define TBLS 1 #endif /* BYFOUR */ /* Local functions for crc concatenation */ local unsigned long gf2_matrix_times OF((unsigned long *mat, unsigned long vec)); local void gf2_matrix_square OF((unsigned long *square, unsigned long *mat)); local uLong crc32_combine_ OF((uLong crc1, uLong crc2, z_off64_t len2)); #ifdef DYNAMIC_CRC_TABLE local volatile int crc_table_empty = 1; local z_crc_t FAR crc_table[TBLS][256]; local void make_crc_table OF((void)); #ifdef MAKECRCH local void write_table OF((FILE *, const z_crc_t FAR *)); #endif /* MAKECRCH */ /* Generate tables for a byte-wise 32-bit CRC calculation on the polynomial: x^32+x^26+x^23+x^22+x^16+x^12+x^11+x^10+x^8+x^7+x^5+x^4+x^2+x+1. Polynomials over GF(2) are represented in binary, one bit per coefficient, with the lowest powers in the most significant bit. Then adding polynomials is just exclusive-or, and multiplying a polynomial by x is a right shift by one. If we call the above polynomial p, and represent a byte as the polynomial q, also with the lowest power in the most significant bit (so the byte 0xb1 is the polynomial x^7+x^3+x+1), then the CRC is (q*x^32) mod p, where a mod b means the remainder after dividing a by b. This calculation is done using the shift-register method of multiplying and taking the remainder. The register is initialized to zero, and for each incoming bit, x^32 is added mod p to the register if the bit is a one (where x^32 mod p is p+x^32 = x^26+...+1), and the register is multiplied mod p by x (which is shifting right by one and adding x^32 mod p if the bit shifted out is a one). We start with the highest power (least significant bit) of q and repeat for all eight bits of q. The first table is simply the CRC of all possible eight bit values. This is all the information needed to generate CRCs on data a byte at a time for all combinations of CRC register values and incoming bytes. The remaining tables allow for word-at-a-time CRC calculation for both big-endian and little- endian machines, where a word is four bytes. */ local void make_crc_table() { z_crc_t c; int n, k; z_crc_t poly; /* polynomial exclusive-or pattern */ /* terms of polynomial defining this crc (except x^32): */ static volatile int first = 1; /* flag to limit concurrent making */ static const unsigned char p[] = {0,1,2,4,5,7,8,10,11,12,16,22,23,26}; /* See if another task is already doing this (not thread-safe, but better than nothing -- significantly reduces duration of vulnerability in case the advice about DYNAMIC_CRC_TABLE is ignored) */ if (first) { first = 0; /* make exclusive-or pattern from polynomial (0xedb88320UL) */ poly = 0; for (n = 0; n < (int)(sizeof(p)/sizeof(unsigned char)); n++) poly |= (z_crc_t)1 << (31 - p[n]); /* generate a crc for every 8-bit value */ for (n = 0; n < 256; n++) { c = (z_crc_t)n; for (k = 0; k < 8; k++) c = c & 1 ? poly ^ (c >> 1) : c >> 1; crc_table[0][n] = c; } #ifdef BYFOUR /* generate crc for each value followed by one, two, and three zeros, and then the byte reversal of those as well as the first table */ for (n = 0; n < 256; n++) { c = crc_table[0][n]; crc_table[4][n] = ZSWAP32(c); for (k = 1; k < 4; k++) { c = crc_table[0][c & 0xff] ^ (c >> 8); crc_table[k][n] = c; crc_table[k + 4][n] = ZSWAP32(c); } } #endif /* BYFOUR */ crc_table_empty = 0; } else { /* not first */ /* wait for the other guy to finish (not efficient, but rare) */ while (crc_table_empty) ; } #ifdef MAKECRCH /* write out CRC tables to crc32.h */ { FILE *out; out = fopen("crc32.h", "w"); if (out == NULL) return; fprintf(out, "/* crc32.h -- tables for rapid CRC calculation\n"); fprintf(out, " * Generated automatically by crc32.c\n */\n\n"); fprintf(out, "local const z_crc_t FAR "); fprintf(out, "crc_table[TBLS][256] =\n{\n {\n"); write_table(out, crc_table[0]); # ifdef BYFOUR fprintf(out, "#ifdef BYFOUR\n"); for (k = 1; k < 8; k++) { fprintf(out, " },\n {\n"); write_table(out, crc_table[k]); } fprintf(out, "#endif\n"); # endif /* BYFOUR */ fprintf(out, " }\n};\n"); fclose(out); } #endif /* MAKECRCH */ } #ifdef MAKECRCH local void write_table(out, table) FILE *out; const z_crc_t FAR *table; { int n; for (n = 0; n < 256; n++) fprintf(out, "%s0x%08lxUL%s", n % 5 ? "" : " ", (unsigned long)(table[n]), n == 255 ? "\n" : (n % 5 == 4 ? ",\n" : ", ")); } #endif /* MAKECRCH */ #else /* !DYNAMIC_CRC_TABLE */ /* ======================================================================== * Tables of CRC-32s of all single-byte values, made by make_crc_table(). */ #include "crc32.h" #endif /* DYNAMIC_CRC_TABLE */ /* ========================================================================= * This function can be used by asm versions of crc32() */ const z_crc_t FAR * ZEXPORT get_crc_table() { #ifdef DYNAMIC_CRC_TABLE if (crc_table_empty) make_crc_table(); #endif /* DYNAMIC_CRC_TABLE */ return (const z_crc_t FAR *)crc_table; } /* ========================================================================= */ #define DO1 crc = crc_table[0][((int)crc ^ (*buf++)) & 0xff] ^ (crc >> 8) #define DO8 DO1; DO1; DO1; DO1; DO1; DO1; DO1; DO1 /* ========================================================================= */ unsigned long ZEXPORT crc32_z(crc, buf, len) unsigned long crc; const unsigned char FAR *buf; z_size_t len; { if (buf == Z_NULL) return 0UL; #ifdef DYNAMIC_CRC_TABLE if (crc_table_empty) make_crc_table(); #endif /* DYNAMIC_CRC_TABLE */ #ifdef BYFOUR if (sizeof(void *) == sizeof(ptrdiff_t)) { z_crc_t endian; endian = 1; if (*((unsigned char *)(&endian))) return crc32_little(crc, buf, len); else return crc32_big(crc, buf, len); } #endif /* BYFOUR */ crc = crc ^ 0xffffffffUL; while (len >= 8) { DO8; len -= 8; } if (len) do { DO1; } while (--len); return crc ^ 0xffffffffUL; } /* ========================================================================= */ unsigned long ZEXPORT crc32(crc, buf, len) unsigned long crc; const unsigned char FAR *buf; uInt len; { return crc32_z(crc, buf, len); } #ifdef BYFOUR /* This BYFOUR code accesses the passed unsigned char * buffer with a 32-bit integer pointer type. This violates the strict aliasing rule, where a compiler can assume, for optimization purposes, that two pointers to fundamentally different types won't ever point to the same memory. This can manifest as a problem only if one of the pointers is written to. This code only reads from those pointers. So long as this code remains isolated in this compilation unit, there won't be a problem. For this reason, this code should not be copied and pasted into a compilation unit in which other code writes to the buffer that is passed to these routines. */ /* ========================================================================= */ #define DOLIT4 c ^= *buf4++; \ c = crc_table[3][c & 0xff] ^ crc_table[2][(c >> 8) & 0xff] ^ \ crc_table[1][(c >> 16) & 0xff] ^ crc_table[0][c >> 24] #define DOLIT32 DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4 /* ========================================================================= */ local unsigned long crc32_little(crc, buf, len) unsigned long crc; const unsigned char FAR *buf; z_size_t len; { register z_crc_t c; register const z_crc_t FAR *buf4; c = (z_crc_t)crc; c = ~c; while (len && ((ptrdiff_t)buf & 3)) { c = crc_table[0][(c ^ *buf++) & 0xff] ^ (c >> 8); len--; } buf4 = (const z_crc_t FAR *)(const void FAR *)buf; while (len >= 32) { DOLIT32; len -= 32; } while (len >= 4) { DOLIT4; len -= 4; } buf = (const unsigned char FAR *)buf4; if (len) do { c = crc_table[0][(c ^ *buf++) & 0xff] ^ (c >> 8); } while (--len); c = ~c; return (unsigned long)c; } /* ========================================================================= */ #define DOBIG4 c ^= *buf4++; \ c = crc_table[4][c & 0xff] ^ crc_table[5][(c >> 8) & 0xff] ^ \ crc_table[6][(c >> 16) & 0xff] ^ crc_table[7][c >> 24] #define DOBIG32 DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4 /* ========================================================================= */ local unsigned long crc32_big(crc, buf, len) unsigned long crc; const unsigned char FAR *buf; z_size_t len; { register z_crc_t c; register const z_crc_t FAR *buf4; c = ZSWAP32((z_crc_t)crc); c = ~c; while (len && ((ptrdiff_t)buf & 3)) { c = crc_table[4][(c >> 24) ^ *buf++] ^ (c << 8); len--; } buf4 = (const z_crc_t FAR *)(const void FAR *)buf; while (len >= 32) { DOBIG32; len -= 32; } while (len >= 4) { DOBIG4; len -= 4; } buf = (const unsigned char FAR *)buf4; if (len) do { c = crc_table[4][(c >> 24) ^ *buf++] ^ (c << 8); } while (--len); c = ~c; return (unsigned long)(ZSWAP32(c)); } #endif /* BYFOUR */ #define GF2_DIM 32 /* dimension of GF(2) vectors (length of CRC) */ /* ========================================================================= */ local unsigned long gf2_matrix_times(mat, vec) unsigned long *mat; unsigned long vec; { unsigned long sum; sum = 0; while (vec) { if (vec & 1) sum ^= *mat; vec >>= 1; mat++; } return sum; } /* ========================================================================= */ local void gf2_matrix_square(square, mat) unsigned long *square; unsigned long *mat; { int n; for (n = 0; n < GF2_DIM; n++) square[n] = gf2_matrix_times(mat, mat[n]); } /* ========================================================================= */ local uLong crc32_combine_(crc1, crc2, len2) uLong crc1; uLong crc2; z_off64_t len2; { int n; unsigned long row; unsigned long even[GF2_DIM]; /* even-power-of-two zeros operator */ unsigned long odd[GF2_DIM]; /* odd-power-of-two zeros operator */ /* degenerate case (also disallow negative lengths) */ if (len2 <= 0) return crc1; /* put operator for one zero bit in odd */ odd[0] = 0xedb88320UL; /* CRC-32 polynomial */ row = 1; for (n = 1; n < GF2_DIM; n++) { odd[n] = row; row <<= 1; } /* put operator for two zero bits in even */ gf2_matrix_square(even, odd); /* put operator for four zero bits in odd */ gf2_matrix_square(odd, even); /* apply len2 zeros to crc1 (first square will put the operator for one zero byte, eight zero bits, in even) */ do { /* apply zeros operator for this bit of len2 */ gf2_matrix_square(even, odd); if (len2 & 1) crc1 = gf2_matrix_times(even, crc1); len2 >>= 1; /* if no more bits set, then done */ if (len2 == 0) break; /* another iteration of the loop with odd and even swapped */ gf2_matrix_square(odd, even); if (len2 & 1) crc1 = gf2_matrix_times(odd, crc1); len2 >>= 1; /* if no more bits set, then done */ } while (len2 != 0); /* return combined crc */ crc1 ^= crc2; return crc1; } /* ========================================================================= */ uLong ZEXPORT crc32_combine(crc1, crc2, len2) uLong crc1; uLong crc2; z_off_t len2; { return crc32_combine_(crc1, crc2, len2); } uLong ZEXPORT crc32_combine64(crc1, crc2, len2) uLong crc1; uLong crc2; z_off64_t len2; { return crc32_combine_(crc1, crc2, len2); } UEFITool-A66/common/zlib/crc32.h000077500000000000000000000735421442134156300163340ustar00rootroot00000000000000/* crc32.h -- tables for rapid CRC calculation * Generated automatically by crc32.c */ local const z_crc_t FAR crc_table[TBLS][256] = { { 0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL, 0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL, 0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL, 0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL, 0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL, 0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL, 0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL, 0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL, 0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL, 0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL, 0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL, 0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL, 0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL, 0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL, 0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL, 0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL, 0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL, 0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL, 0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL, 0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL, 0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL, 0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL, 0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL, 0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL, 0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL, 0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL, 0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL, 0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL, 0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL, 0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL, 0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL, 0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL, 0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL, 0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL, 0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL, 0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL, 0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL, 0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL, 0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL, 0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL, 0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL, 0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL, 0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL, 0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL, 0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL, 0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL, 0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL, 0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL, 0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL, 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, 0x2d02ef8dUL #ifdef BYFOUR }, { 0x00000000UL, 0x191b3141UL, 0x32366282UL, 0x2b2d53c3UL, 0x646cc504UL, 0x7d77f445UL, 0x565aa786UL, 0x4f4196c7UL, 0xc8d98a08UL, 0xd1c2bb49UL, 0xfaefe88aUL, 0xe3f4d9cbUL, 0xacb54f0cUL, 0xb5ae7e4dUL, 0x9e832d8eUL, 0x87981ccfUL, 0x4ac21251UL, 0x53d92310UL, 0x78f470d3UL, 0x61ef4192UL, 0x2eaed755UL, 0x37b5e614UL, 0x1c98b5d7UL, 0x05838496UL, 0x821b9859UL, 0x9b00a918UL, 0xb02dfadbUL, 0xa936cb9aUL, 0xe6775d5dUL, 0xff6c6c1cUL, 0xd4413fdfUL, 0xcd5a0e9eUL, 0x958424a2UL, 0x8c9f15e3UL, 0xa7b24620UL, 0xbea97761UL, 0xf1e8e1a6UL, 0xe8f3d0e7UL, 0xc3de8324UL, 0xdac5b265UL, 0x5d5daeaaUL, 0x44469febUL, 0x6f6bcc28UL, 0x7670fd69UL, 0x39316baeUL, 0x202a5aefUL, 0x0b07092cUL, 0x121c386dUL, 0xdf4636f3UL, 0xc65d07b2UL, 0xed705471UL, 0xf46b6530UL, 0xbb2af3f7UL, 0xa231c2b6UL, 0x891c9175UL, 0x9007a034UL, 0x179fbcfbUL, 0x0e848dbaUL, 0x25a9de79UL, 0x3cb2ef38UL, 0x73f379ffUL, 0x6ae848beUL, 0x41c51b7dUL, 0x58de2a3cUL, 0xf0794f05UL, 0xe9627e44UL, 0xc24f2d87UL, 0xdb541cc6UL, 0x94158a01UL, 0x8d0ebb40UL, 0xa623e883UL, 0xbf38d9c2UL, 0x38a0c50dUL, 0x21bbf44cUL, 0x0a96a78fUL, 0x138d96ceUL, 0x5ccc0009UL, 0x45d73148UL, 0x6efa628bUL, 0x77e153caUL, 0xbabb5d54UL, 0xa3a06c15UL, 0x888d3fd6UL, 0x91960e97UL, 0xded79850UL, 0xc7cca911UL, 0xece1fad2UL, 0xf5facb93UL, 0x7262d75cUL, 0x6b79e61dUL, 0x4054b5deUL, 0x594f849fUL, 0x160e1258UL, 0x0f152319UL, 0x243870daUL, 0x3d23419bUL, 0x65fd6ba7UL, 0x7ce65ae6UL, 0x57cb0925UL, 0x4ed03864UL, 0x0191aea3UL, 0x188a9fe2UL, 0x33a7cc21UL, 0x2abcfd60UL, 0xad24e1afUL, 0xb43fd0eeUL, 0x9f12832dUL, 0x8609b26cUL, 0xc94824abUL, 0xd05315eaUL, 0xfb7e4629UL, 0xe2657768UL, 0x2f3f79f6UL, 0x362448b7UL, 0x1d091b74UL, 0x04122a35UL, 0x4b53bcf2UL, 0x52488db3UL, 0x7965de70UL, 0x607eef31UL, 0xe7e6f3feUL, 0xfefdc2bfUL, 0xd5d0917cUL, 0xcccba03dUL, 0x838a36faUL, 0x9a9107bbUL, 0xb1bc5478UL, 0xa8a76539UL, 0x3b83984bUL, 0x2298a90aUL, 0x09b5fac9UL, 0x10aecb88UL, 0x5fef5d4fUL, 0x46f46c0eUL, 0x6dd93fcdUL, 0x74c20e8cUL, 0xf35a1243UL, 0xea412302UL, 0xc16c70c1UL, 0xd8774180UL, 0x9736d747UL, 0x8e2de606UL, 0xa500b5c5UL, 0xbc1b8484UL, 0x71418a1aUL, 0x685abb5bUL, 0x4377e898UL, 0x5a6cd9d9UL, 0x152d4f1eUL, 0x0c367e5fUL, 0x271b2d9cUL, 0x3e001cddUL, 0xb9980012UL, 0xa0833153UL, 0x8bae6290UL, 0x92b553d1UL, 0xddf4c516UL, 0xc4eff457UL, 0xefc2a794UL, 0xf6d996d5UL, 0xae07bce9UL, 0xb71c8da8UL, 0x9c31de6bUL, 0x852aef2aUL, 0xca6b79edUL, 0xd37048acUL, 0xf85d1b6fUL, 0xe1462a2eUL, 0x66de36e1UL, 0x7fc507a0UL, 0x54e85463UL, 0x4df36522UL, 0x02b2f3e5UL, 0x1ba9c2a4UL, 0x30849167UL, 0x299fa026UL, 0xe4c5aeb8UL, 0xfdde9ff9UL, 0xd6f3cc3aUL, 0xcfe8fd7bUL, 0x80a96bbcUL, 0x99b25afdUL, 0xb29f093eUL, 0xab84387fUL, 0x2c1c24b0UL, 0x350715f1UL, 0x1e2a4632UL, 0x07317773UL, 0x4870e1b4UL, 0x516bd0f5UL, 0x7a468336UL, 0x635db277UL, 0xcbfad74eUL, 0xd2e1e60fUL, 0xf9ccb5ccUL, 0xe0d7848dUL, 0xaf96124aUL, 0xb68d230bUL, 0x9da070c8UL, 0x84bb4189UL, 0x03235d46UL, 0x1a386c07UL, 0x31153fc4UL, 0x280e0e85UL, 0x674f9842UL, 0x7e54a903UL, 0x5579fac0UL, 0x4c62cb81UL, 0x8138c51fUL, 0x9823f45eUL, 0xb30ea79dUL, 0xaa1596dcUL, 0xe554001bUL, 0xfc4f315aUL, 0xd7626299UL, 0xce7953d8UL, 0x49e14f17UL, 0x50fa7e56UL, 0x7bd72d95UL, 0x62cc1cd4UL, 0x2d8d8a13UL, 0x3496bb52UL, 0x1fbbe891UL, 0x06a0d9d0UL, 0x5e7ef3ecUL, 0x4765c2adUL, 0x6c48916eUL, 0x7553a02fUL, 0x3a1236e8UL, 0x230907a9UL, 0x0824546aUL, 0x113f652bUL, 0x96a779e4UL, 0x8fbc48a5UL, 0xa4911b66UL, 0xbd8a2a27UL, 0xf2cbbce0UL, 0xebd08da1UL, 0xc0fdde62UL, 0xd9e6ef23UL, 0x14bce1bdUL, 0x0da7d0fcUL, 0x268a833fUL, 0x3f91b27eUL, 0x70d024b9UL, 0x69cb15f8UL, 0x42e6463bUL, 0x5bfd777aUL, 0xdc656bb5UL, 0xc57e5af4UL, 0xee530937UL, 0xf7483876UL, 0xb809aeb1UL, 0xa1129ff0UL, 0x8a3fcc33UL, 0x9324fd72UL }, { 0x00000000UL, 0x01c26a37UL, 0x0384d46eUL, 0x0246be59UL, 0x0709a8dcUL, 0x06cbc2ebUL, 0x048d7cb2UL, 0x054f1685UL, 0x0e1351b8UL, 0x0fd13b8fUL, 0x0d9785d6UL, 0x0c55efe1UL, 0x091af964UL, 0x08d89353UL, 0x0a9e2d0aUL, 0x0b5c473dUL, 0x1c26a370UL, 0x1de4c947UL, 0x1fa2771eUL, 0x1e601d29UL, 0x1b2f0bacUL, 0x1aed619bUL, 0x18abdfc2UL, 0x1969b5f5UL, 0x1235f2c8UL, 0x13f798ffUL, 0x11b126a6UL, 0x10734c91UL, 0x153c5a14UL, 0x14fe3023UL, 0x16b88e7aUL, 0x177ae44dUL, 0x384d46e0UL, 0x398f2cd7UL, 0x3bc9928eUL, 0x3a0bf8b9UL, 0x3f44ee3cUL, 0x3e86840bUL, 0x3cc03a52UL, 0x3d025065UL, 0x365e1758UL, 0x379c7d6fUL, 0x35dac336UL, 0x3418a901UL, 0x3157bf84UL, 0x3095d5b3UL, 0x32d36beaUL, 0x331101ddUL, 0x246be590UL, 0x25a98fa7UL, 0x27ef31feUL, 0x262d5bc9UL, 0x23624d4cUL, 0x22a0277bUL, 0x20e69922UL, 0x2124f315UL, 0x2a78b428UL, 0x2bbade1fUL, 0x29fc6046UL, 0x283e0a71UL, 0x2d711cf4UL, 0x2cb376c3UL, 0x2ef5c89aUL, 0x2f37a2adUL, 0x709a8dc0UL, 0x7158e7f7UL, 0x731e59aeUL, 0x72dc3399UL, 0x7793251cUL, 0x76514f2bUL, 0x7417f172UL, 0x75d59b45UL, 0x7e89dc78UL, 0x7f4bb64fUL, 0x7d0d0816UL, 0x7ccf6221UL, 0x798074a4UL, 0x78421e93UL, 0x7a04a0caUL, 0x7bc6cafdUL, 0x6cbc2eb0UL, 0x6d7e4487UL, 0x6f38fadeUL, 0x6efa90e9UL, 0x6bb5866cUL, 0x6a77ec5bUL, 0x68315202UL, 0x69f33835UL, 0x62af7f08UL, 0x636d153fUL, 0x612bab66UL, 0x60e9c151UL, 0x65a6d7d4UL, 0x6464bde3UL, 0x662203baUL, 0x67e0698dUL, 0x48d7cb20UL, 0x4915a117UL, 0x4b531f4eUL, 0x4a917579UL, 0x4fde63fcUL, 0x4e1c09cbUL, 0x4c5ab792UL, 0x4d98dda5UL, 0x46c49a98UL, 0x4706f0afUL, 0x45404ef6UL, 0x448224c1UL, 0x41cd3244UL, 0x400f5873UL, 0x4249e62aUL, 0x438b8c1dUL, 0x54f16850UL, 0x55330267UL, 0x5775bc3eUL, 0x56b7d609UL, 0x53f8c08cUL, 0x523aaabbUL, 0x507c14e2UL, 0x51be7ed5UL, 0x5ae239e8UL, 0x5b2053dfUL, 0x5966ed86UL, 0x58a487b1UL, 0x5deb9134UL, 0x5c29fb03UL, 0x5e6f455aUL, 0x5fad2f6dUL, 0xe1351b80UL, 0xe0f771b7UL, 0xe2b1cfeeUL, 0xe373a5d9UL, 0xe63cb35cUL, 0xe7fed96bUL, 0xe5b86732UL, 0xe47a0d05UL, 0xef264a38UL, 0xeee4200fUL, 0xeca29e56UL, 0xed60f461UL, 0xe82fe2e4UL, 0xe9ed88d3UL, 0xebab368aUL, 0xea695cbdUL, 0xfd13b8f0UL, 0xfcd1d2c7UL, 0xfe976c9eUL, 0xff5506a9UL, 0xfa1a102cUL, 0xfbd87a1bUL, 0xf99ec442UL, 0xf85cae75UL, 0xf300e948UL, 0xf2c2837fUL, 0xf0843d26UL, 0xf1465711UL, 0xf4094194UL, 0xf5cb2ba3UL, 0xf78d95faUL, 0xf64fffcdUL, 0xd9785d60UL, 0xd8ba3757UL, 0xdafc890eUL, 0xdb3ee339UL, 0xde71f5bcUL, 0xdfb39f8bUL, 0xddf521d2UL, 0xdc374be5UL, 0xd76b0cd8UL, 0xd6a966efUL, 0xd4efd8b6UL, 0xd52db281UL, 0xd062a404UL, 0xd1a0ce33UL, 0xd3e6706aUL, 0xd2241a5dUL, 0xc55efe10UL, 0xc49c9427UL, 0xc6da2a7eUL, 0xc7184049UL, 0xc25756ccUL, 0xc3953cfbUL, 0xc1d382a2UL, 0xc011e895UL, 0xcb4dafa8UL, 0xca8fc59fUL, 0xc8c97bc6UL, 0xc90b11f1UL, 0xcc440774UL, 0xcd866d43UL, 0xcfc0d31aUL, 0xce02b92dUL, 0x91af9640UL, 0x906dfc77UL, 0x922b422eUL, 0x93e92819UL, 0x96a63e9cUL, 0x976454abUL, 0x9522eaf2UL, 0x94e080c5UL, 0x9fbcc7f8UL, 0x9e7eadcfUL, 0x9c381396UL, 0x9dfa79a1UL, 0x98b56f24UL, 0x99770513UL, 0x9b31bb4aUL, 0x9af3d17dUL, 0x8d893530UL, 0x8c4b5f07UL, 0x8e0de15eUL, 0x8fcf8b69UL, 0x8a809decUL, 0x8b42f7dbUL, 0x89044982UL, 0x88c623b5UL, 0x839a6488UL, 0x82580ebfUL, 0x801eb0e6UL, 0x81dcdad1UL, 0x8493cc54UL, 0x8551a663UL, 0x8717183aUL, 0x86d5720dUL, 0xa9e2d0a0UL, 0xa820ba97UL, 0xaa6604ceUL, 0xaba46ef9UL, 0xaeeb787cUL, 0xaf29124bUL, 0xad6fac12UL, 0xacadc625UL, 0xa7f18118UL, 0xa633eb2fUL, 0xa4755576UL, 0xa5b73f41UL, 0xa0f829c4UL, 0xa13a43f3UL, 0xa37cfdaaUL, 0xa2be979dUL, 0xb5c473d0UL, 0xb40619e7UL, 0xb640a7beUL, 0xb782cd89UL, 0xb2cddb0cUL, 0xb30fb13bUL, 0xb1490f62UL, 0xb08b6555UL, 0xbbd72268UL, 0xba15485fUL, 0xb853f606UL, 0xb9919c31UL, 0xbcde8ab4UL, 0xbd1ce083UL, 0xbf5a5edaUL, 0xbe9834edUL }, { 0x00000000UL, 0xb8bc6765UL, 0xaa09c88bUL, 0x12b5afeeUL, 0x8f629757UL, 0x37def032UL, 0x256b5fdcUL, 0x9dd738b9UL, 0xc5b428efUL, 0x7d084f8aUL, 0x6fbde064UL, 0xd7018701UL, 0x4ad6bfb8UL, 0xf26ad8ddUL, 0xe0df7733UL, 0x58631056UL, 0x5019579fUL, 0xe8a530faUL, 0xfa109f14UL, 0x42acf871UL, 0xdf7bc0c8UL, 0x67c7a7adUL, 0x75720843UL, 0xcdce6f26UL, 0x95ad7f70UL, 0x2d111815UL, 0x3fa4b7fbUL, 0x8718d09eUL, 0x1acfe827UL, 0xa2738f42UL, 0xb0c620acUL, 0x087a47c9UL, 0xa032af3eUL, 0x188ec85bUL, 0x0a3b67b5UL, 0xb28700d0UL, 0x2f503869UL, 0x97ec5f0cUL, 0x8559f0e2UL, 0x3de59787UL, 0x658687d1UL, 0xdd3ae0b4UL, 0xcf8f4f5aUL, 0x7733283fUL, 0xeae41086UL, 0x525877e3UL, 0x40edd80dUL, 0xf851bf68UL, 0xf02bf8a1UL, 0x48979fc4UL, 0x5a22302aUL, 0xe29e574fUL, 0x7f496ff6UL, 0xc7f50893UL, 0xd540a77dUL, 0x6dfcc018UL, 0x359fd04eUL, 0x8d23b72bUL, 0x9f9618c5UL, 0x272a7fa0UL, 0xbafd4719UL, 0x0241207cUL, 0x10f48f92UL, 0xa848e8f7UL, 0x9b14583dUL, 0x23a83f58UL, 0x311d90b6UL, 0x89a1f7d3UL, 0x1476cf6aUL, 0xaccaa80fUL, 0xbe7f07e1UL, 0x06c36084UL, 0x5ea070d2UL, 0xe61c17b7UL, 0xf4a9b859UL, 0x4c15df3cUL, 0xd1c2e785UL, 0x697e80e0UL, 0x7bcb2f0eUL, 0xc377486bUL, 0xcb0d0fa2UL, 0x73b168c7UL, 0x6104c729UL, 0xd9b8a04cUL, 0x446f98f5UL, 0xfcd3ff90UL, 0xee66507eUL, 0x56da371bUL, 0x0eb9274dUL, 0xb6054028UL, 0xa4b0efc6UL, 0x1c0c88a3UL, 0x81dbb01aUL, 0x3967d77fUL, 0x2bd27891UL, 0x936e1ff4UL, 0x3b26f703UL, 0x839a9066UL, 0x912f3f88UL, 0x299358edUL, 0xb4446054UL, 0x0cf80731UL, 0x1e4da8dfUL, 0xa6f1cfbaUL, 0xfe92dfecUL, 0x462eb889UL, 0x549b1767UL, 0xec277002UL, 0x71f048bbUL, 0xc94c2fdeUL, 0xdbf98030UL, 0x6345e755UL, 0x6b3fa09cUL, 0xd383c7f9UL, 0xc1366817UL, 0x798a0f72UL, 0xe45d37cbUL, 0x5ce150aeUL, 0x4e54ff40UL, 0xf6e89825UL, 0xae8b8873UL, 0x1637ef16UL, 0x048240f8UL, 0xbc3e279dUL, 0x21e91f24UL, 0x99557841UL, 0x8be0d7afUL, 0x335cb0caUL, 0xed59b63bUL, 0x55e5d15eUL, 0x47507eb0UL, 0xffec19d5UL, 0x623b216cUL, 0xda874609UL, 0xc832e9e7UL, 0x708e8e82UL, 0x28ed9ed4UL, 0x9051f9b1UL, 0x82e4565fUL, 0x3a58313aUL, 0xa78f0983UL, 0x1f336ee6UL, 0x0d86c108UL, 0xb53aa66dUL, 0xbd40e1a4UL, 0x05fc86c1UL, 0x1749292fUL, 0xaff54e4aUL, 0x322276f3UL, 0x8a9e1196UL, 0x982bbe78UL, 0x2097d91dUL, 0x78f4c94bUL, 0xc048ae2eUL, 0xd2fd01c0UL, 0x6a4166a5UL, 0xf7965e1cUL, 0x4f2a3979UL, 0x5d9f9697UL, 0xe523f1f2UL, 0x4d6b1905UL, 0xf5d77e60UL, 0xe762d18eUL, 0x5fdeb6ebUL, 0xc2098e52UL, 0x7ab5e937UL, 0x680046d9UL, 0xd0bc21bcUL, 0x88df31eaUL, 0x3063568fUL, 0x22d6f961UL, 0x9a6a9e04UL, 0x07bda6bdUL, 0xbf01c1d8UL, 0xadb46e36UL, 0x15080953UL, 0x1d724e9aUL, 0xa5ce29ffUL, 0xb77b8611UL, 0x0fc7e174UL, 0x9210d9cdUL, 0x2aacbea8UL, 0x38191146UL, 0x80a57623UL, 0xd8c66675UL, 0x607a0110UL, 0x72cfaefeUL, 0xca73c99bUL, 0x57a4f122UL, 0xef189647UL, 0xfdad39a9UL, 0x45115eccUL, 0x764dee06UL, 0xcef18963UL, 0xdc44268dUL, 0x64f841e8UL, 0xf92f7951UL, 0x41931e34UL, 0x5326b1daUL, 0xeb9ad6bfUL, 0xb3f9c6e9UL, 0x0b45a18cUL, 0x19f00e62UL, 0xa14c6907UL, 0x3c9b51beUL, 0x842736dbUL, 0x96929935UL, 0x2e2efe50UL, 0x2654b999UL, 0x9ee8defcUL, 0x8c5d7112UL, 0x34e11677UL, 0xa9362eceUL, 0x118a49abUL, 0x033fe645UL, 0xbb838120UL, 0xe3e09176UL, 0x5b5cf613UL, 0x49e959fdUL, 0xf1553e98UL, 0x6c820621UL, 0xd43e6144UL, 0xc68bceaaUL, 0x7e37a9cfUL, 0xd67f4138UL, 0x6ec3265dUL, 0x7c7689b3UL, 0xc4caeed6UL, 0x591dd66fUL, 0xe1a1b10aUL, 0xf3141ee4UL, 0x4ba87981UL, 0x13cb69d7UL, 0xab770eb2UL, 0xb9c2a15cUL, 0x017ec639UL, 0x9ca9fe80UL, 0x241599e5UL, 0x36a0360bUL, 0x8e1c516eUL, 0x866616a7UL, 0x3eda71c2UL, 0x2c6fde2cUL, 0x94d3b949UL, 0x090481f0UL, 0xb1b8e695UL, 0xa30d497bUL, 0x1bb12e1eUL, 0x43d23e48UL, 0xfb6e592dUL, 0xe9dbf6c3UL, 0x516791a6UL, 0xccb0a91fUL, 0x740cce7aUL, 0x66b96194UL, 0xde0506f1UL }, { 0x00000000UL, 0x96300777UL, 0x2c610eeeUL, 0xba510999UL, 0x19c46d07UL, 0x8ff46a70UL, 0x35a563e9UL, 0xa395649eUL, 0x3288db0eUL, 0xa4b8dc79UL, 0x1ee9d5e0UL, 0x88d9d297UL, 0x2b4cb609UL, 0xbd7cb17eUL, 0x072db8e7UL, 0x911dbf90UL, 0x6410b71dUL, 0xf220b06aUL, 0x4871b9f3UL, 0xde41be84UL, 0x7dd4da1aUL, 0xebe4dd6dUL, 0x51b5d4f4UL, 0xc785d383UL, 0x56986c13UL, 0xc0a86b64UL, 0x7af962fdUL, 0xecc9658aUL, 0x4f5c0114UL, 0xd96c0663UL, 0x633d0ffaUL, 0xf50d088dUL, 0xc8206e3bUL, 0x5e10694cUL, 0xe44160d5UL, 0x727167a2UL, 0xd1e4033cUL, 0x47d4044bUL, 0xfd850dd2UL, 0x6bb50aa5UL, 0xfaa8b535UL, 0x6c98b242UL, 0xd6c9bbdbUL, 0x40f9bcacUL, 0xe36cd832UL, 0x755cdf45UL, 0xcf0dd6dcUL, 0x593dd1abUL, 0xac30d926UL, 0x3a00de51UL, 0x8051d7c8UL, 0x1661d0bfUL, 0xb5f4b421UL, 0x23c4b356UL, 0x9995bacfUL, 0x0fa5bdb8UL, 0x9eb80228UL, 0x0888055fUL, 0xb2d90cc6UL, 0x24e90bb1UL, 0x877c6f2fUL, 0x114c6858UL, 0xab1d61c1UL, 0x3d2d66b6UL, 0x9041dc76UL, 0x0671db01UL, 0xbc20d298UL, 0x2a10d5efUL, 0x8985b171UL, 0x1fb5b606UL, 0xa5e4bf9fUL, 0x33d4b8e8UL, 0xa2c90778UL, 0x34f9000fUL, 0x8ea80996UL, 0x18980ee1UL, 0xbb0d6a7fUL, 0x2d3d6d08UL, 0x976c6491UL, 0x015c63e6UL, 0xf4516b6bUL, 0x62616c1cUL, 0xd8306585UL, 0x4e0062f2UL, 0xed95066cUL, 0x7ba5011bUL, 0xc1f40882UL, 0x57c40ff5UL, 0xc6d9b065UL, 0x50e9b712UL, 0xeab8be8bUL, 0x7c88b9fcUL, 0xdf1ddd62UL, 0x492dda15UL, 0xf37cd38cUL, 0x654cd4fbUL, 0x5861b24dUL, 0xce51b53aUL, 0x7400bca3UL, 0xe230bbd4UL, 0x41a5df4aUL, 0xd795d83dUL, 0x6dc4d1a4UL, 0xfbf4d6d3UL, 0x6ae96943UL, 0xfcd96e34UL, 0x468867adUL, 0xd0b860daUL, 0x732d0444UL, 0xe51d0333UL, 0x5f4c0aaaUL, 0xc97c0dddUL, 0x3c710550UL, 0xaa410227UL, 0x10100bbeUL, 0x86200cc9UL, 0x25b56857UL, 0xb3856f20UL, 0x09d466b9UL, 0x9fe461ceUL, 0x0ef9de5eUL, 0x98c9d929UL, 0x2298d0b0UL, 0xb4a8d7c7UL, 0x173db359UL, 0x810db42eUL, 0x3b5cbdb7UL, 0xad6cbac0UL, 0x2083b8edUL, 0xb6b3bf9aUL, 0x0ce2b603UL, 0x9ad2b174UL, 0x3947d5eaUL, 0xaf77d29dUL, 0x1526db04UL, 0x8316dc73UL, 0x120b63e3UL, 0x843b6494UL, 0x3e6a6d0dUL, 0xa85a6a7aUL, 0x0bcf0ee4UL, 0x9dff0993UL, 0x27ae000aUL, 0xb19e077dUL, 0x44930ff0UL, 0xd2a30887UL, 0x68f2011eUL, 0xfec20669UL, 0x5d5762f7UL, 0xcb676580UL, 0x71366c19UL, 0xe7066b6eUL, 0x761bd4feUL, 0xe02bd389UL, 0x5a7ada10UL, 0xcc4add67UL, 0x6fdfb9f9UL, 0xf9efbe8eUL, 0x43beb717UL, 0xd58eb060UL, 0xe8a3d6d6UL, 0x7e93d1a1UL, 0xc4c2d838UL, 0x52f2df4fUL, 0xf167bbd1UL, 0x6757bca6UL, 0xdd06b53fUL, 0x4b36b248UL, 0xda2b0dd8UL, 0x4c1b0aafUL, 0xf64a0336UL, 0x607a0441UL, 0xc3ef60dfUL, 0x55df67a8UL, 0xef8e6e31UL, 0x79be6946UL, 0x8cb361cbUL, 0x1a8366bcUL, 0xa0d26f25UL, 0x36e26852UL, 0x95770cccUL, 0x03470bbbUL, 0xb9160222UL, 0x2f260555UL, 0xbe3bbac5UL, 0x280bbdb2UL, 0x925ab42bUL, 0x046ab35cUL, 0xa7ffd7c2UL, 0x31cfd0b5UL, 0x8b9ed92cUL, 0x1daede5bUL, 0xb0c2649bUL, 0x26f263ecUL, 0x9ca36a75UL, 0x0a936d02UL, 0xa906099cUL, 0x3f360eebUL, 0x85670772UL, 0x13570005UL, 0x824abf95UL, 0x147ab8e2UL, 0xae2bb17bUL, 0x381bb60cUL, 0x9b8ed292UL, 0x0dbed5e5UL, 0xb7efdc7cUL, 0x21dfdb0bUL, 0xd4d2d386UL, 0x42e2d4f1UL, 0xf8b3dd68UL, 0x6e83da1fUL, 0xcd16be81UL, 0x5b26b9f6UL, 0xe177b06fUL, 0x7747b718UL, 0xe65a0888UL, 0x706a0fffUL, 0xca3b0666UL, 0x5c0b0111UL, 0xff9e658fUL, 0x69ae62f8UL, 0xd3ff6b61UL, 0x45cf6c16UL, 0x78e20aa0UL, 0xeed20dd7UL, 0x5483044eUL, 0xc2b30339UL, 0x612667a7UL, 0xf71660d0UL, 0x4d476949UL, 0xdb776e3eUL, 0x4a6ad1aeUL, 0xdc5ad6d9UL, 0x660bdf40UL, 0xf03bd837UL, 0x53aebca9UL, 0xc59ebbdeUL, 0x7fcfb247UL, 0xe9ffb530UL, 0x1cf2bdbdUL, 0x8ac2bacaUL, 0x3093b353UL, 0xa6a3b424UL, 0x0536d0baUL, 0x9306d7cdUL, 0x2957de54UL, 0xbf67d923UL, 0x2e7a66b3UL, 0xb84a61c4UL, 0x021b685dUL, 0x942b6f2aUL, 0x37be0bb4UL, 0xa18e0cc3UL, 0x1bdf055aUL, 0x8def022dUL }, { 0x00000000UL, 0x41311b19UL, 0x82623632UL, 0xc3532d2bUL, 0x04c56c64UL, 0x45f4777dUL, 0x86a75a56UL, 0xc796414fUL, 0x088ad9c8UL, 0x49bbc2d1UL, 0x8ae8effaUL, 0xcbd9f4e3UL, 0x0c4fb5acUL, 0x4d7eaeb5UL, 0x8e2d839eUL, 0xcf1c9887UL, 0x5112c24aUL, 0x1023d953UL, 0xd370f478UL, 0x9241ef61UL, 0x55d7ae2eUL, 0x14e6b537UL, 0xd7b5981cUL, 0x96848305UL, 0x59981b82UL, 0x18a9009bUL, 0xdbfa2db0UL, 0x9acb36a9UL, 0x5d5d77e6UL, 0x1c6c6cffUL, 0xdf3f41d4UL, 0x9e0e5acdUL, 0xa2248495UL, 0xe3159f8cUL, 0x2046b2a7UL, 0x6177a9beUL, 0xa6e1e8f1UL, 0xe7d0f3e8UL, 0x2483dec3UL, 0x65b2c5daUL, 0xaaae5d5dUL, 0xeb9f4644UL, 0x28cc6b6fUL, 0x69fd7076UL, 0xae6b3139UL, 0xef5a2a20UL, 0x2c09070bUL, 0x6d381c12UL, 0xf33646dfUL, 0xb2075dc6UL, 0x715470edUL, 0x30656bf4UL, 0xf7f32abbUL, 0xb6c231a2UL, 0x75911c89UL, 0x34a00790UL, 0xfbbc9f17UL, 0xba8d840eUL, 0x79dea925UL, 0x38efb23cUL, 0xff79f373UL, 0xbe48e86aUL, 0x7d1bc541UL, 0x3c2ade58UL, 0x054f79f0UL, 0x447e62e9UL, 0x872d4fc2UL, 0xc61c54dbUL, 0x018a1594UL, 0x40bb0e8dUL, 0x83e823a6UL, 0xc2d938bfUL, 0x0dc5a038UL, 0x4cf4bb21UL, 0x8fa7960aUL, 0xce968d13UL, 0x0900cc5cUL, 0x4831d745UL, 0x8b62fa6eUL, 0xca53e177UL, 0x545dbbbaUL, 0x156ca0a3UL, 0xd63f8d88UL, 0x970e9691UL, 0x5098d7deUL, 0x11a9ccc7UL, 0xd2fae1ecUL, 0x93cbfaf5UL, 0x5cd76272UL, 0x1de6796bUL, 0xdeb55440UL, 0x9f844f59UL, 0x58120e16UL, 0x1923150fUL, 0xda703824UL, 0x9b41233dUL, 0xa76bfd65UL, 0xe65ae67cUL, 0x2509cb57UL, 0x6438d04eUL, 0xa3ae9101UL, 0xe29f8a18UL, 0x21cca733UL, 0x60fdbc2aUL, 0xafe124adUL, 0xeed03fb4UL, 0x2d83129fUL, 0x6cb20986UL, 0xab2448c9UL, 0xea1553d0UL, 0x29467efbUL, 0x687765e2UL, 0xf6793f2fUL, 0xb7482436UL, 0x741b091dUL, 0x352a1204UL, 0xf2bc534bUL, 0xb38d4852UL, 0x70de6579UL, 0x31ef7e60UL, 0xfef3e6e7UL, 0xbfc2fdfeUL, 0x7c91d0d5UL, 0x3da0cbccUL, 0xfa368a83UL, 0xbb07919aUL, 0x7854bcb1UL, 0x3965a7a8UL, 0x4b98833bUL, 0x0aa99822UL, 0xc9fab509UL, 0x88cbae10UL, 0x4f5def5fUL, 0x0e6cf446UL, 0xcd3fd96dUL, 0x8c0ec274UL, 0x43125af3UL, 0x022341eaUL, 0xc1706cc1UL, 0x804177d8UL, 0x47d73697UL, 0x06e62d8eUL, 0xc5b500a5UL, 0x84841bbcUL, 0x1a8a4171UL, 0x5bbb5a68UL, 0x98e87743UL, 0xd9d96c5aUL, 0x1e4f2d15UL, 0x5f7e360cUL, 0x9c2d1b27UL, 0xdd1c003eUL, 0x120098b9UL, 0x533183a0UL, 0x9062ae8bUL, 0xd153b592UL, 0x16c5f4ddUL, 0x57f4efc4UL, 0x94a7c2efUL, 0xd596d9f6UL, 0xe9bc07aeUL, 0xa88d1cb7UL, 0x6bde319cUL, 0x2aef2a85UL, 0xed796bcaUL, 0xac4870d3UL, 0x6f1b5df8UL, 0x2e2a46e1UL, 0xe136de66UL, 0xa007c57fUL, 0x6354e854UL, 0x2265f34dUL, 0xe5f3b202UL, 0xa4c2a91bUL, 0x67918430UL, 0x26a09f29UL, 0xb8aec5e4UL, 0xf99fdefdUL, 0x3accf3d6UL, 0x7bfde8cfUL, 0xbc6ba980UL, 0xfd5ab299UL, 0x3e099fb2UL, 0x7f3884abUL, 0xb0241c2cUL, 0xf1150735UL, 0x32462a1eUL, 0x73773107UL, 0xb4e17048UL, 0xf5d06b51UL, 0x3683467aUL, 0x77b25d63UL, 0x4ed7facbUL, 0x0fe6e1d2UL, 0xccb5ccf9UL, 0x8d84d7e0UL, 0x4a1296afUL, 0x0b238db6UL, 0xc870a09dUL, 0x8941bb84UL, 0x465d2303UL, 0x076c381aUL, 0xc43f1531UL, 0x850e0e28UL, 0x42984f67UL, 0x03a9547eUL, 0xc0fa7955UL, 0x81cb624cUL, 0x1fc53881UL, 0x5ef42398UL, 0x9da70eb3UL, 0xdc9615aaUL, 0x1b0054e5UL, 0x5a314ffcUL, 0x996262d7UL, 0xd85379ceUL, 0x174fe149UL, 0x567efa50UL, 0x952dd77bUL, 0xd41ccc62UL, 0x138a8d2dUL, 0x52bb9634UL, 0x91e8bb1fUL, 0xd0d9a006UL, 0xecf37e5eUL, 0xadc26547UL, 0x6e91486cUL, 0x2fa05375UL, 0xe836123aUL, 0xa9070923UL, 0x6a542408UL, 0x2b653f11UL, 0xe479a796UL, 0xa548bc8fUL, 0x661b91a4UL, 0x272a8abdUL, 0xe0bccbf2UL, 0xa18dd0ebUL, 0x62defdc0UL, 0x23efe6d9UL, 0xbde1bc14UL, 0xfcd0a70dUL, 0x3f838a26UL, 0x7eb2913fUL, 0xb924d070UL, 0xf815cb69UL, 0x3b46e642UL, 0x7a77fd5bUL, 0xb56b65dcUL, 0xf45a7ec5UL, 0x370953eeUL, 0x763848f7UL, 0xb1ae09b8UL, 0xf09f12a1UL, 0x33cc3f8aUL, 0x72fd2493UL }, { 0x00000000UL, 0x376ac201UL, 0x6ed48403UL, 0x59be4602UL, 0xdca80907UL, 0xebc2cb06UL, 0xb27c8d04UL, 0x85164f05UL, 0xb851130eUL, 0x8f3bd10fUL, 0xd685970dUL, 0xe1ef550cUL, 0x64f91a09UL, 0x5393d808UL, 0x0a2d9e0aUL, 0x3d475c0bUL, 0x70a3261cUL, 0x47c9e41dUL, 0x1e77a21fUL, 0x291d601eUL, 0xac0b2f1bUL, 0x9b61ed1aUL, 0xc2dfab18UL, 0xf5b56919UL, 0xc8f23512UL, 0xff98f713UL, 0xa626b111UL, 0x914c7310UL, 0x145a3c15UL, 0x2330fe14UL, 0x7a8eb816UL, 0x4de47a17UL, 0xe0464d38UL, 0xd72c8f39UL, 0x8e92c93bUL, 0xb9f80b3aUL, 0x3cee443fUL, 0x0b84863eUL, 0x523ac03cUL, 0x6550023dUL, 0x58175e36UL, 0x6f7d9c37UL, 0x36c3da35UL, 0x01a91834UL, 0x84bf5731UL, 0xb3d59530UL, 0xea6bd332UL, 0xdd011133UL, 0x90e56b24UL, 0xa78fa925UL, 0xfe31ef27UL, 0xc95b2d26UL, 0x4c4d6223UL, 0x7b27a022UL, 0x2299e620UL, 0x15f32421UL, 0x28b4782aUL, 0x1fdeba2bUL, 0x4660fc29UL, 0x710a3e28UL, 0xf41c712dUL, 0xc376b32cUL, 0x9ac8f52eUL, 0xada2372fUL, 0xc08d9a70UL, 0xf7e75871UL, 0xae591e73UL, 0x9933dc72UL, 0x1c259377UL, 0x2b4f5176UL, 0x72f11774UL, 0x459bd575UL, 0x78dc897eUL, 0x4fb64b7fUL, 0x16080d7dUL, 0x2162cf7cUL, 0xa4748079UL, 0x931e4278UL, 0xcaa0047aUL, 0xfdcac67bUL, 0xb02ebc6cUL, 0x87447e6dUL, 0xdefa386fUL, 0xe990fa6eUL, 0x6c86b56bUL, 0x5bec776aUL, 0x02523168UL, 0x3538f369UL, 0x087faf62UL, 0x3f156d63UL, 0x66ab2b61UL, 0x51c1e960UL, 0xd4d7a665UL, 0xe3bd6464UL, 0xba032266UL, 0x8d69e067UL, 0x20cbd748UL, 0x17a11549UL, 0x4e1f534bUL, 0x7975914aUL, 0xfc63de4fUL, 0xcb091c4eUL, 0x92b75a4cUL, 0xa5dd984dUL, 0x989ac446UL, 0xaff00647UL, 0xf64e4045UL, 0xc1248244UL, 0x4432cd41UL, 0x73580f40UL, 0x2ae64942UL, 0x1d8c8b43UL, 0x5068f154UL, 0x67023355UL, 0x3ebc7557UL, 0x09d6b756UL, 0x8cc0f853UL, 0xbbaa3a52UL, 0xe2147c50UL, 0xd57ebe51UL, 0xe839e25aUL, 0xdf53205bUL, 0x86ed6659UL, 0xb187a458UL, 0x3491eb5dUL, 0x03fb295cUL, 0x5a456f5eUL, 0x6d2fad5fUL, 0x801b35e1UL, 0xb771f7e0UL, 0xeecfb1e2UL, 0xd9a573e3UL, 0x5cb33ce6UL, 0x6bd9fee7UL, 0x3267b8e5UL, 0x050d7ae4UL, 0x384a26efUL, 0x0f20e4eeUL, 0x569ea2ecUL, 0x61f460edUL, 0xe4e22fe8UL, 0xd388ede9UL, 0x8a36abebUL, 0xbd5c69eaUL, 0xf0b813fdUL, 0xc7d2d1fcUL, 0x9e6c97feUL, 0xa90655ffUL, 0x2c101afaUL, 0x1b7ad8fbUL, 0x42c49ef9UL, 0x75ae5cf8UL, 0x48e900f3UL, 0x7f83c2f2UL, 0x263d84f0UL, 0x115746f1UL, 0x944109f4UL, 0xa32bcbf5UL, 0xfa958df7UL, 0xcdff4ff6UL, 0x605d78d9UL, 0x5737bad8UL, 0x0e89fcdaUL, 0x39e33edbUL, 0xbcf571deUL, 0x8b9fb3dfUL, 0xd221f5ddUL, 0xe54b37dcUL, 0xd80c6bd7UL, 0xef66a9d6UL, 0xb6d8efd4UL, 0x81b22dd5UL, 0x04a462d0UL, 0x33cea0d1UL, 0x6a70e6d3UL, 0x5d1a24d2UL, 0x10fe5ec5UL, 0x27949cc4UL, 0x7e2adac6UL, 0x494018c7UL, 0xcc5657c2UL, 0xfb3c95c3UL, 0xa282d3c1UL, 0x95e811c0UL, 0xa8af4dcbUL, 0x9fc58fcaUL, 0xc67bc9c8UL, 0xf1110bc9UL, 0x740744ccUL, 0x436d86cdUL, 0x1ad3c0cfUL, 0x2db902ceUL, 0x4096af91UL, 0x77fc6d90UL, 0x2e422b92UL, 0x1928e993UL, 0x9c3ea696UL, 0xab546497UL, 0xf2ea2295UL, 0xc580e094UL, 0xf8c7bc9fUL, 0xcfad7e9eUL, 0x9613389cUL, 0xa179fa9dUL, 0x246fb598UL, 0x13057799UL, 0x4abb319bUL, 0x7dd1f39aUL, 0x3035898dUL, 0x075f4b8cUL, 0x5ee10d8eUL, 0x698bcf8fUL, 0xec9d808aUL, 0xdbf7428bUL, 0x82490489UL, 0xb523c688UL, 0x88649a83UL, 0xbf0e5882UL, 0xe6b01e80UL, 0xd1dadc81UL, 0x54cc9384UL, 0x63a65185UL, 0x3a181787UL, 0x0d72d586UL, 0xa0d0e2a9UL, 0x97ba20a8UL, 0xce0466aaUL, 0xf96ea4abUL, 0x7c78ebaeUL, 0x4b1229afUL, 0x12ac6fadUL, 0x25c6adacUL, 0x1881f1a7UL, 0x2feb33a6UL, 0x765575a4UL, 0x413fb7a5UL, 0xc429f8a0UL, 0xf3433aa1UL, 0xaafd7ca3UL, 0x9d97bea2UL, 0xd073c4b5UL, 0xe71906b4UL, 0xbea740b6UL, 0x89cd82b7UL, 0x0cdbcdb2UL, 0x3bb10fb3UL, 0x620f49b1UL, 0x55658bb0UL, 0x6822d7bbUL, 0x5f4815baUL, 0x06f653b8UL, 0x319c91b9UL, 0xb48adebcUL, 0x83e01cbdUL, 0xda5e5abfUL, 0xed3498beUL }, { 0x00000000UL, 0x6567bcb8UL, 0x8bc809aaUL, 0xeeafb512UL, 0x5797628fUL, 0x32f0de37UL, 0xdc5f6b25UL, 0xb938d79dUL, 0xef28b4c5UL, 0x8a4f087dUL, 0x64e0bd6fUL, 0x018701d7UL, 0xb8bfd64aUL, 0xddd86af2UL, 0x3377dfe0UL, 0x56106358UL, 0x9f571950UL, 0xfa30a5e8UL, 0x149f10faUL, 0x71f8ac42UL, 0xc8c07bdfUL, 0xada7c767UL, 0x43087275UL, 0x266fcecdUL, 0x707fad95UL, 0x1518112dUL, 0xfbb7a43fUL, 0x9ed01887UL, 0x27e8cf1aUL, 0x428f73a2UL, 0xac20c6b0UL, 0xc9477a08UL, 0x3eaf32a0UL, 0x5bc88e18UL, 0xb5673b0aUL, 0xd00087b2UL, 0x6938502fUL, 0x0c5fec97UL, 0xe2f05985UL, 0x8797e53dUL, 0xd1878665UL, 0xb4e03addUL, 0x5a4f8fcfUL, 0x3f283377UL, 0x8610e4eaUL, 0xe3775852UL, 0x0dd8ed40UL, 0x68bf51f8UL, 0xa1f82bf0UL, 0xc49f9748UL, 0x2a30225aUL, 0x4f579ee2UL, 0xf66f497fUL, 0x9308f5c7UL, 0x7da740d5UL, 0x18c0fc6dUL, 0x4ed09f35UL, 0x2bb7238dUL, 0xc518969fUL, 0xa07f2a27UL, 0x1947fdbaUL, 0x7c204102UL, 0x928ff410UL, 0xf7e848a8UL, 0x3d58149bUL, 0x583fa823UL, 0xb6901d31UL, 0xd3f7a189UL, 0x6acf7614UL, 0x0fa8caacUL, 0xe1077fbeUL, 0x8460c306UL, 0xd270a05eUL, 0xb7171ce6UL, 0x59b8a9f4UL, 0x3cdf154cUL, 0x85e7c2d1UL, 0xe0807e69UL, 0x0e2fcb7bUL, 0x6b4877c3UL, 0xa20f0dcbUL, 0xc768b173UL, 0x29c70461UL, 0x4ca0b8d9UL, 0xf5986f44UL, 0x90ffd3fcUL, 0x7e5066eeUL, 0x1b37da56UL, 0x4d27b90eUL, 0x284005b6UL, 0xc6efb0a4UL, 0xa3880c1cUL, 0x1ab0db81UL, 0x7fd76739UL, 0x9178d22bUL, 0xf41f6e93UL, 0x03f7263bUL, 0x66909a83UL, 0x883f2f91UL, 0xed589329UL, 0x546044b4UL, 0x3107f80cUL, 0xdfa84d1eUL, 0xbacff1a6UL, 0xecdf92feUL, 0x89b82e46UL, 0x67179b54UL, 0x027027ecUL, 0xbb48f071UL, 0xde2f4cc9UL, 0x3080f9dbUL, 0x55e74563UL, 0x9ca03f6bUL, 0xf9c783d3UL, 0x176836c1UL, 0x720f8a79UL, 0xcb375de4UL, 0xae50e15cUL, 0x40ff544eUL, 0x2598e8f6UL, 0x73888baeUL, 0x16ef3716UL, 0xf8408204UL, 0x9d273ebcUL, 0x241fe921UL, 0x41785599UL, 0xafd7e08bUL, 0xcab05c33UL, 0x3bb659edUL, 0x5ed1e555UL, 0xb07e5047UL, 0xd519ecffUL, 0x6c213b62UL, 0x094687daUL, 0xe7e932c8UL, 0x828e8e70UL, 0xd49eed28UL, 0xb1f95190UL, 0x5f56e482UL, 0x3a31583aUL, 0x83098fa7UL, 0xe66e331fUL, 0x08c1860dUL, 0x6da63ab5UL, 0xa4e140bdUL, 0xc186fc05UL, 0x2f294917UL, 0x4a4ef5afUL, 0xf3762232UL, 0x96119e8aUL, 0x78be2b98UL, 0x1dd99720UL, 0x4bc9f478UL, 0x2eae48c0UL, 0xc001fdd2UL, 0xa566416aUL, 0x1c5e96f7UL, 0x79392a4fUL, 0x97969f5dUL, 0xf2f123e5UL, 0x05196b4dUL, 0x607ed7f5UL, 0x8ed162e7UL, 0xebb6de5fUL, 0x528e09c2UL, 0x37e9b57aUL, 0xd9460068UL, 0xbc21bcd0UL, 0xea31df88UL, 0x8f566330UL, 0x61f9d622UL, 0x049e6a9aUL, 0xbda6bd07UL, 0xd8c101bfUL, 0x366eb4adUL, 0x53090815UL, 0x9a4e721dUL, 0xff29cea5UL, 0x11867bb7UL, 0x74e1c70fUL, 0xcdd91092UL, 0xa8beac2aUL, 0x46111938UL, 0x2376a580UL, 0x7566c6d8UL, 0x10017a60UL, 0xfeaecf72UL, 0x9bc973caUL, 0x22f1a457UL, 0x479618efUL, 0xa939adfdUL, 0xcc5e1145UL, 0x06ee4d76UL, 0x6389f1ceUL, 0x8d2644dcUL, 0xe841f864UL, 0x51792ff9UL, 0x341e9341UL, 0xdab12653UL, 0xbfd69aebUL, 0xe9c6f9b3UL, 0x8ca1450bUL, 0x620ef019UL, 0x07694ca1UL, 0xbe519b3cUL, 0xdb362784UL, 0x35999296UL, 0x50fe2e2eUL, 0x99b95426UL, 0xfcdee89eUL, 0x12715d8cUL, 0x7716e134UL, 0xce2e36a9UL, 0xab498a11UL, 0x45e63f03UL, 0x208183bbUL, 0x7691e0e3UL, 0x13f65c5bUL, 0xfd59e949UL, 0x983e55f1UL, 0x2106826cUL, 0x44613ed4UL, 0xaace8bc6UL, 0xcfa9377eUL, 0x38417fd6UL, 0x5d26c36eUL, 0xb389767cUL, 0xd6eecac4UL, 0x6fd61d59UL, 0x0ab1a1e1UL, 0xe41e14f3UL, 0x8179a84bUL, 0xd769cb13UL, 0xb20e77abUL, 0x5ca1c2b9UL, 0x39c67e01UL, 0x80fea99cUL, 0xe5991524UL, 0x0b36a036UL, 0x6e511c8eUL, 0xa7166686UL, 0xc271da3eUL, 0x2cde6f2cUL, 0x49b9d394UL, 0xf0810409UL, 0x95e6b8b1UL, 0x7b490da3UL, 0x1e2eb11bUL, 0x483ed243UL, 0x2d596efbUL, 0xc3f6dbe9UL, 0xa6916751UL, 0x1fa9b0ccUL, 0x7ace0c74UL, 0x9461b966UL, 0xf10605deUL #endif } }; UEFITool-A66/common/zlib/deflate.c000077500000000000000000002322151442134156300170110ustar00rootroot00000000000000/* deflate.c -- compress data using the deflation algorithm * Copyright (C) 1995-2017 Jean-loup Gailly and Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ /* * ALGORITHM * * The "deflation" process depends on being able to identify portions * of the input text which are identical to earlier input (within a * sliding window trailing behind the input currently being processed). * * The most straightforward technique turns out to be the fastest for * most input files: try all possible matches and select the longest. * The key feature of this algorithm is that insertions into the string * dictionary are very simple and thus fast, and deletions are avoided * completely. Insertions are performed at each input character, whereas * string matches are performed only when the previous match ends. So it * is preferable to spend more time in matches to allow very fast string * insertions and avoid deletions. The matching algorithm for small * strings is inspired from that of Rabin & Karp. A brute force approach * is used to find longer strings when a small match has been found. * A similar algorithm is used in comic (by Jan-Mark Wams) and freeze * (by Leonid Broukhis). * A previous version of this file used a more sophisticated algorithm * (by Fiala and Greene) which is guaranteed to run in linear amortized * time, but has a larger average cost, uses more memory and is patented. * However the F&G algorithm may be faster for some highly redundant * files if the parameter max_chain_length (described below) is too large. * * ACKNOWLEDGEMENTS * * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and * I found it in 'freeze' written by Leonid Broukhis. * Thanks to many people for bug reports and testing. * * REFERENCES * * Deutsch, L.P.,"DEFLATE Compressed Data Format Specification". * Available in http://tools.ietf.org/html/rfc1951 * * A description of the Rabin and Karp algorithm is given in the book * "Algorithms" by R. Sedgewick, Addison-Wesley, p252. * * Fiala,E.R., and Greene,D.H. * Data Compression with Finite Windows, Comm.ACM, 32,4 (1989) 490-595 * */ /* @(#) $Id$ */ #include "deflate.h" const char deflate_copyright[] = " deflate 1.2.11 Copyright 1995-2017 Jean-loup Gailly and 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. */ /* =========================================================================== * Function prototypes. */ typedef enum { need_more, /* block not completed, need more input or more output */ block_done, /* block flush performed */ finish_started, /* finish started, need only more output at next deflate */ finish_done /* finish done, accept no more input or output */ } block_state; typedef block_state (*compress_func) OF((deflate_state *s, int flush)); /* Compression function. Returns the block state after the call. */ local int deflateStateCheck OF((z_streamp strm)); local void slide_hash OF((deflate_state *s)); local void fill_window OF((deflate_state *s)); local block_state deflate_stored OF((deflate_state *s, int flush)); local block_state deflate_fast OF((deflate_state *s, int flush)); #ifndef FASTEST local block_state deflate_slow OF((deflate_state *s, int flush)); #endif local block_state deflate_rle OF((deflate_state *s, int flush)); local block_state deflate_huff OF((deflate_state *s, int flush)); local void lm_init OF((deflate_state *s)); local void putShortMSB OF((deflate_state *s, uInt b)); local void flush_pending OF((z_streamp strm)); local unsigned read_buf OF((z_streamp strm, Bytef *buf, unsigned size)); #ifdef ASMV # pragma message("Assembler code may have bugs -- use at your own risk") void match_init OF((void)); /* asm code initialization */ uInt longest_match OF((deflate_state *s, IPos cur_match)); #else local uInt longest_match OF((deflate_state *s, IPos cur_match)); #endif #ifdef ZLIB_DEBUG local void check_match OF((deflate_state *s, IPos start, IPos match, int length)); #endif /* =========================================================================== * Local data */ #define NIL 0 /* Tail of hash chains */ #ifndef TOO_FAR # define TOO_FAR 4096 #endif /* Matches of length 3 are discarded if their distance exceeds TOO_FAR */ /* Values for max_lazy_match, good_match and max_chain_length, depending on * the desired pack level (0..9). The values given below have been tuned to * exclude worst case performance for pathological files. Better values may be * found for specific files. */ typedef struct config_s { ush good_length; /* reduce lazy search above this match length */ ush max_lazy; /* do not perform lazy search above this match length */ ush nice_length; /* quit search above this match length */ ush max_chain; compress_func func; } config; #ifdef FASTEST local const config configuration_table[2] = { /* good lazy nice chain */ /* 0 */ {0, 0, 0, 0, deflate_stored}, /* store only */ /* 1 */ {4, 4, 8, 4, deflate_fast}}; /* max speed, no lazy matches */ #else local const config configuration_table[10] = { /* good lazy nice chain */ /* 0 */ {0, 0, 0, 0, deflate_stored}, /* store only */ /* 1 */ {4, 4, 8, 4, deflate_fast}, /* max speed, no lazy matches */ /* 2 */ {4, 5, 16, 8, deflate_fast}, /* 3 */ {4, 6, 32, 32, deflate_fast}, /* 4 */ {4, 4, 16, 16, deflate_slow}, /* lazy matches */ /* 5 */ {8, 16, 32, 32, deflate_slow}, /* 6 */ {8, 16, 128, 128, deflate_slow}, /* 7 */ {8, 32, 128, 256, deflate_slow}, /* 8 */ {32, 128, 258, 1024, deflate_slow}, /* 9 */ {32, 258, 258, 4096, deflate_slow}}; /* max compression */ #endif /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4 * For deflate_fast() (levels <= 3) good is ignored and lazy has a different * meaning. */ /* rank Z_BLOCK between Z_NO_FLUSH and Z_PARTIAL_FLUSH */ #define RANK(f) (((f) * 2) - ((f) > 4 ? 9 : 0)) /* =========================================================================== * Update a hash value with the given input byte * IN assertion: all calls to UPDATE_HASH are made with consecutive input * characters, so that a running hash key can be computed from the previous * key instead of complete recalculation each time. */ #define UPDATE_HASH(s,h,c) (h = (((h)<hash_shift) ^ (c)) & s->hash_mask) /* =========================================================================== * Insert string str in the dictionary and set match_head to the previous head * of the hash chain (the most recent string with same hash key). Return * the previous length of the hash chain. * If this file is compiled with -DFASTEST, the compression level is forced * to 1, and no hash chains are maintained. * IN assertion: all calls to INSERT_STRING are made with consecutive input * characters and the first MIN_MATCH bytes of str are valid (except for * the last MIN_MATCH-1 bytes of the input file). */ #ifdef FASTEST #define INSERT_STRING(s, str, match_head) \ (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ match_head = s->head[s->ins_h], \ s->head[s->ins_h] = (Pos)(str)) #else #define INSERT_STRING(s, str, match_head) \ (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ match_head = s->prev[(str) & s->w_mask] = s->head[s->ins_h], \ s->head[s->ins_h] = (Pos)(str)) #endif /* =========================================================================== * Initialize the hash table (avoiding 64K overflow for 16 bit systems). * prev[] will be initialized on the fly. */ #define CLEAR_HASH(s) \ do { \ s->head[s->hash_size-1] = NIL; \ zmemzero((Bytef *)s->head, \ (unsigned)(s->hash_size-1)*sizeof(*s->head)); \ } while (0) /* =========================================================================== * Slide the hash table when sliding the window down (could be avoided with 32 * bit values at the expense of memory usage). We slide even when level == 0 to * keep the hash table consistent if we switch back to level > 0 later. */ local void slide_hash(s) deflate_state *s; { unsigned n, m; Posf *p; uInt wsize = s->w_size; n = s->hash_size; p = &s->head[n]; do { m = *--p; *p = (Pos)(m >= wsize ? m - wsize : NIL); } while (--n); n = wsize; #ifndef FASTEST p = &s->prev[n]; do { m = *--p; *p = (Pos)(m >= wsize ? m - wsize : NIL); /* If n is not on any hash chain, prev[n] is garbage but * its value will never be used. */ } while (--n); #endif } /* ========================================================================= */ int ZEXPORT deflateInit_(strm, level, version, stream_size) z_streamp strm; int level; const char *version; int stream_size; { return deflateInit2_(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY, version, stream_size); /* To do: ignore strm->next_in if we use it as window */ } /* ========================================================================= */ int ZEXPORT deflateInit2_(strm, level, method, windowBits, memLevel, strategy, version, stream_size) z_streamp strm; int level; int method; int windowBits; int memLevel; int strategy; const char *version; int stream_size; { deflate_state *s; int wrap = 1; static const char my_version[] = ZLIB_VERSION; ushf *overlay; /* We overlay pending_buf and d_buf+l_buf. This works since the average * output size for (length,distance) codes is <= 24 bits. */ if (version == Z_NULL || version[0] != my_version[0] || stream_size != sizeof(z_stream)) { return Z_VERSION_ERROR; } if (strm == Z_NULL) return Z_STREAM_ERROR; strm->msg = Z_NULL; if (strm->zalloc == (alloc_func)0) { #ifdef Z_SOLO return Z_STREAM_ERROR; #else strm->zalloc = zcalloc; strm->opaque = (voidpf)0; #endif } if (strm->zfree == (free_func)0) #ifdef Z_SOLO return Z_STREAM_ERROR; #else strm->zfree = zcfree; #endif #ifdef FASTEST if (level != 0) level = 1; #else if (level == Z_DEFAULT_COMPRESSION) level = 6; #endif if (windowBits < 0) { /* suppress zlib wrapper */ wrap = 0; windowBits = -windowBits; } #ifdef GZIP else if (windowBits > 15) { wrap = 2; /* write gzip wrapper instead */ windowBits -= 16; } #endif if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method != Z_DEFLATED || windowBits < 8 || windowBits > 15 || level < 0 || level > 9 || strategy < 0 || strategy > Z_FIXED || (windowBits == 8 && wrap != 1)) { return Z_STREAM_ERROR; } if (windowBits == 8) windowBits = 9; /* until 256-byte window bug fixed */ s = (deflate_state *) ZALLOC(strm, 1, sizeof(deflate_state)); if (s == Z_NULL) return Z_MEM_ERROR; strm->state = (struct internal_state FAR *)s; s->strm = strm; s->status = INIT_STATE; /* to pass state test in deflateReset() */ s->wrap = wrap; s->gzhead = Z_NULL; s->w_bits = (uInt)windowBits; s->w_size = 1 << s->w_bits; s->w_mask = s->w_size - 1; s->hash_bits = (uInt)memLevel + 7; s->hash_size = 1 << s->hash_bits; s->hash_mask = s->hash_size - 1; s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH); s->window = (Bytef *) ZALLOC(strm, s->w_size, 2*sizeof(Byte)); s->prev = (Posf *) ZALLOC(strm, s->w_size, sizeof(Pos)); s->head = (Posf *) ZALLOC(strm, s->hash_size, sizeof(Pos)); s->high_water = 0; /* nothing written to s->window yet */ s->lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */ overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2); s->pending_buf = (uchf *) overlay; s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L); if (s->window == Z_NULL || s->prev == Z_NULL || s->head == Z_NULL || s->pending_buf == Z_NULL) { s->status = FINISH_STATE; strm->msg = ERR_MSG(Z_MEM_ERROR); deflateEnd (strm); return Z_MEM_ERROR; } s->d_buf = overlay + s->lit_bufsize/sizeof(ush); s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize; s->level = level; s->strategy = strategy; s->method = (Byte)method; return deflateReset(strm); } /* ========================================================================= * Check for a valid deflate stream state. Return 0 if ok, 1 if not. */ local int deflateStateCheck (strm) z_streamp strm; { deflate_state *s; if (strm == Z_NULL || strm->zalloc == (alloc_func)0 || strm->zfree == (free_func)0) return 1; s = strm->state; if (s == Z_NULL || s->strm != strm || (s->status != INIT_STATE && #ifdef GZIP s->status != GZIP_STATE && #endif s->status != EXTRA_STATE && s->status != NAME_STATE && s->status != COMMENT_STATE && s->status != HCRC_STATE && s->status != BUSY_STATE && s->status != FINISH_STATE)) return 1; return 0; } /* ========================================================================= */ int ZEXPORT deflateSetDictionary (strm, dictionary, dictLength) z_streamp strm; const Bytef *dictionary; uInt dictLength; { deflate_state *s; uInt str, n; int wrap; unsigned avail; z_const unsigned char *next; if (deflateStateCheck(strm) || dictionary == Z_NULL) return Z_STREAM_ERROR; s = strm->state; wrap = s->wrap; if (wrap == 2 || (wrap == 1 && s->status != INIT_STATE) || s->lookahead) return Z_STREAM_ERROR; /* when using zlib wrappers, compute Adler-32 for provided dictionary */ if (wrap == 1) strm->adler = adler32(strm->adler, dictionary, dictLength); s->wrap = 0; /* avoid computing Adler-32 in read_buf */ /* if dictionary would fill window, just replace the history */ if (dictLength >= s->w_size) { if (wrap == 0) { /* already empty otherwise */ CLEAR_HASH(s); s->strstart = 0; s->block_start = 0L; s->insert = 0; } dictionary += dictLength - s->w_size; /* use the tail */ dictLength = s->w_size; } /* insert dictionary into window and hash */ avail = strm->avail_in; next = strm->next_in; strm->avail_in = dictLength; strm->next_in = (z_const Bytef *)dictionary; fill_window(s); while (s->lookahead >= MIN_MATCH) { str = s->strstart; n = s->lookahead - (MIN_MATCH-1); do { UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); #ifndef FASTEST s->prev[str & s->w_mask] = s->head[s->ins_h]; #endif s->head[s->ins_h] = (Pos)str; str++; } while (--n); s->strstart = str; s->lookahead = MIN_MATCH-1; fill_window(s); } s->strstart += s->lookahead; s->block_start = (long)s->strstart; s->insert = s->lookahead; s->lookahead = 0; s->match_length = s->prev_length = MIN_MATCH-1; s->match_available = 0; strm->next_in = next; strm->avail_in = avail; s->wrap = wrap; return Z_OK; } /* ========================================================================= */ int ZEXPORT deflateGetDictionary (strm, dictionary, dictLength) z_streamp strm; Bytef *dictionary; uInt *dictLength; { deflate_state *s; uInt len; if (deflateStateCheck(strm)) return Z_STREAM_ERROR; s = strm->state; len = s->strstart + s->lookahead; if (len > s->w_size) len = s->w_size; if (dictionary != Z_NULL && len) zmemcpy(dictionary, s->window + s->strstart + s->lookahead - len, len); if (dictLength != Z_NULL) *dictLength = len; return Z_OK; } /* ========================================================================= */ int ZEXPORT deflateResetKeep (strm) z_streamp strm; { deflate_state *s; if (deflateStateCheck(strm)) { return Z_STREAM_ERROR; } strm->total_in = strm->total_out = 0; strm->msg = Z_NULL; /* use zfree if we ever allocate msg dynamically */ strm->data_type = Z_UNKNOWN; s = (deflate_state *)strm->state; s->pending = 0; s->pending_out = s->pending_buf; if (s->wrap < 0) { s->wrap = -s->wrap; /* was made negative by deflate(..., Z_FINISH); */ } s->status = #ifdef GZIP s->wrap == 2 ? GZIP_STATE : #endif s->wrap ? INIT_STATE : BUSY_STATE; strm->adler = #ifdef GZIP s->wrap == 2 ? crc32(0L, Z_NULL, 0) : #endif adler32(0L, Z_NULL, 0); s->last_flush = Z_NO_FLUSH; _tr_init(s); return Z_OK; } /* ========================================================================= */ int ZEXPORT deflateReset (strm) z_streamp strm; { int ret; ret = deflateResetKeep(strm); if (ret == Z_OK) lm_init(strm->state); return ret; } /* ========================================================================= */ int ZEXPORT deflateSetHeader (strm, head) z_streamp strm; gz_headerp head; { if (deflateStateCheck(strm) || strm->state->wrap != 2) return Z_STREAM_ERROR; strm->state->gzhead = head; return Z_OK; } /* ========================================================================= */ int ZEXPORT deflatePending (strm, pending, bits) unsigned *pending; int *bits; z_streamp strm; { if (deflateStateCheck(strm)) return Z_STREAM_ERROR; if (pending != Z_NULL) *pending = strm->state->pending; if (bits != Z_NULL) *bits = strm->state->bi_valid; return Z_OK; } /* ========================================================================= */ int ZEXPORT deflatePrime (strm, bits, value) z_streamp strm; int bits; int value; { deflate_state *s; int put; if (deflateStateCheck(strm)) return Z_STREAM_ERROR; s = strm->state; if ((Bytef *)(s->d_buf) < s->pending_out + ((Buf_size + 7) >> 3)) return Z_BUF_ERROR; do { put = Buf_size - s->bi_valid; if (put > bits) put = bits; s->bi_buf |= (ush)((value & ((1 << put) - 1)) << s->bi_valid); s->bi_valid += put; _tr_flush_bits(s); value >>= put; bits -= put; } while (bits); return Z_OK; } /* ========================================================================= */ int ZEXPORT deflateParams(strm, level, strategy) z_streamp strm; int level; int strategy; { deflate_state *s; compress_func func; if (deflateStateCheck(strm)) return Z_STREAM_ERROR; s = strm->state; #ifdef FASTEST if (level != 0) level = 1; #else if (level == Z_DEFAULT_COMPRESSION) level = 6; #endif if (level < 0 || level > 9 || strategy < 0 || strategy > Z_FIXED) { return Z_STREAM_ERROR; } func = configuration_table[s->level].func; if ((strategy != s->strategy || func != configuration_table[level].func) && s->high_water) { /* Flush the last buffer: */ int err = deflate(strm, Z_BLOCK); if (err == Z_STREAM_ERROR) return err; if (strm->avail_out == 0) return Z_BUF_ERROR; } if (s->level != level) { if (s->level == 0 && s->matches != 0) { if (s->matches == 1) { slide_hash(s); } else { CLEAR_HASH(s); } s->matches = 0; } s->level = level; s->max_lazy_match = configuration_table[level].max_lazy; s->good_match = configuration_table[level].good_length; s->nice_match = configuration_table[level].nice_length; s->max_chain_length = configuration_table[level].max_chain; } s->strategy = strategy; return Z_OK; } /* ========================================================================= */ int ZEXPORT deflateTune(strm, good_length, max_lazy, nice_length, max_chain) z_streamp strm; int good_length; int max_lazy; int nice_length; int max_chain; { deflate_state *s; if (deflateStateCheck(strm)) return Z_STREAM_ERROR; s = strm->state; s->good_match = (uInt)good_length; s->max_lazy_match = (uInt)max_lazy; s->nice_match = nice_length; s->max_chain_length = (uInt)max_chain; return Z_OK; } /* ========================================================================= * For the default windowBits of 15 and memLevel of 8, this function returns * a close to exact, as well as small, upper bound on the compressed size. * They are coded as constants here for a reason--if the #define's are * changed, then this function needs to be changed as well. The return * value for 15 and 8 only works for those exact settings. * * For any setting other than those defaults for windowBits and memLevel, * the value returned is a conservative worst case for the maximum expansion * resulting from using fixed blocks instead of stored blocks, which deflate * can emit on compressed data for some combinations of the parameters. * * This function could be more sophisticated to provide closer upper bounds for * every combination of windowBits and memLevel. But even the conservative * upper bound of about 14% expansion does not seem onerous for output buffer * allocation. */ uLong ZEXPORT deflateBound(strm, sourceLen) z_streamp strm; uLong sourceLen; { deflate_state *s; uLong complen, wraplen; /* conservative upper bound for compressed data */ complen = sourceLen + ((sourceLen + 7) >> 3) + ((sourceLen + 63) >> 6) + 5; /* if can't get parameters, return conservative bound plus zlib wrapper */ if (deflateStateCheck(strm)) return complen + 6; /* compute wrapper length */ s = strm->state; switch (s->wrap) { case 0: /* raw deflate */ wraplen = 0; break; case 1: /* zlib wrapper */ wraplen = 6 + (s->strstart ? 4 : 0); break; #ifdef GZIP case 2: /* gzip wrapper */ wraplen = 18; if (s->gzhead != Z_NULL) { /* user-supplied gzip header */ Bytef *str; if (s->gzhead->extra != Z_NULL) wraplen += 2 + s->gzhead->extra_len; str = s->gzhead->name; if (str != Z_NULL) do { wraplen++; } while (*str++); str = s->gzhead->comment; if (str != Z_NULL) do { wraplen++; } while (*str++); if (s->gzhead->hcrc) wraplen += 2; } break; #endif default: /* for compiler happiness */ wraplen = 6; } /* if not default parameters, return conservative bound */ if (s->w_bits != 15 || s->hash_bits != 8 + 7) return complen + wraplen; /* default settings: return tight bound for that case */ return sourceLen + (sourceLen >> 12) + (sourceLen >> 14) + (sourceLen >> 25) + 13 - 6 + wraplen; } /* ========================================================================= * Put a short in the pending buffer. The 16-bit value is put in MSB order. * IN assertion: the stream state is correct and there is enough room in * pending_buf. */ local void putShortMSB (s, b) deflate_state *s; uInt b; { put_byte(s, (Byte)(b >> 8)); put_byte(s, (Byte)(b & 0xff)); } /* ========================================================================= * Flush as much pending output as possible. All deflate() output, except for * some deflate_stored() output, goes through this function so some * applications may wish to modify it to avoid allocating a large * strm->next_out buffer and copying into it. (See also read_buf()). */ local void flush_pending(strm) z_streamp strm; { unsigned len; deflate_state *s = strm->state; _tr_flush_bits(s); len = s->pending; if (len > strm->avail_out) len = strm->avail_out; if (len == 0) return; zmemcpy(strm->next_out, s->pending_out, len); strm->next_out += len; s->pending_out += len; strm->total_out += len; strm->avail_out -= len; s->pending -= len; if (s->pending == 0) { s->pending_out = s->pending_buf; } } /* =========================================================================== * Update the header CRC with the bytes s->pending_buf[beg..s->pending - 1]. */ #define HCRC_UPDATE(beg) \ do { \ if (s->gzhead->hcrc && s->pending > (beg)) \ strm->adler = crc32(strm->adler, s->pending_buf + (beg), \ s->pending - (beg)); \ } while (0) /* ========================================================================= */ int ZEXPORT deflate (strm, flush) z_streamp strm; int flush; { int old_flush; /* value of flush param for previous deflate call */ deflate_state *s; if (deflateStateCheck(strm) || flush > Z_BLOCK || flush < 0) { return Z_STREAM_ERROR; } s = strm->state; if (strm->next_out == Z_NULL || (strm->avail_in != 0 && strm->next_in == Z_NULL) || (s->status == FINISH_STATE && flush != Z_FINISH)) { ERR_RETURN(strm, Z_STREAM_ERROR); } if (strm->avail_out == 0) ERR_RETURN(strm, Z_BUF_ERROR); old_flush = s->last_flush; s->last_flush = flush; /* Flush as much pending output as possible */ if (s->pending != 0) { flush_pending(strm); if (strm->avail_out == 0) { /* Since avail_out is 0, deflate will be called again with * more output space, but possibly with both pending and * avail_in equal to zero. There won't be anything to do, * but this is not an error situation so make sure we * return OK instead of BUF_ERROR at next call of deflate: */ s->last_flush = -1; return Z_OK; } /* Make sure there is something to do and avoid duplicate consecutive * flushes. For repeated and useless calls with Z_FINISH, we keep * returning Z_STREAM_END instead of Z_BUF_ERROR. */ } else if (strm->avail_in == 0 && RANK(flush) <= RANK(old_flush) && flush != Z_FINISH) { ERR_RETURN(strm, Z_BUF_ERROR); } /* User must not provide more input after the first FINISH: */ if (s->status == FINISH_STATE && strm->avail_in != 0) { ERR_RETURN(strm, Z_BUF_ERROR); } /* Write the header */ if (s->status == INIT_STATE) { /* zlib header */ uInt header = (Z_DEFLATED + ((s->w_bits-8)<<4)) << 8; uInt level_flags; if (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2) level_flags = 0; else if (s->level < 6) level_flags = 1; else if (s->level == 6) level_flags = 2; else level_flags = 3; header |= (level_flags << 6); if (s->strstart != 0) header |= PRESET_DICT; header += 31 - (header % 31); putShortMSB(s, header); /* Save the adler32 of the preset dictionary: */ if (s->strstart != 0) { putShortMSB(s, (uInt)(strm->adler >> 16)); putShortMSB(s, (uInt)(strm->adler & 0xffff)); } strm->adler = adler32(0L, Z_NULL, 0); s->status = BUSY_STATE; /* Compression must start with an empty pending buffer */ flush_pending(strm); if (s->pending != 0) { s->last_flush = -1; return Z_OK; } } #ifdef GZIP if (s->status == GZIP_STATE) { /* gzip header */ strm->adler = crc32(0L, Z_NULL, 0); put_byte(s, 31); put_byte(s, 139); put_byte(s, 8); if (s->gzhead == Z_NULL) { put_byte(s, 0); put_byte(s, 0); put_byte(s, 0); put_byte(s, 0); put_byte(s, 0); put_byte(s, s->level == 9 ? 2 : (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2 ? 4 : 0)); put_byte(s, OS_CODE); s->status = BUSY_STATE; /* Compression must start with an empty pending buffer */ flush_pending(strm); if (s->pending != 0) { s->last_flush = -1; return Z_OK; } } else { put_byte(s, (s->gzhead->text ? 1 : 0) + (s->gzhead->hcrc ? 2 : 0) + (s->gzhead->extra == Z_NULL ? 0 : 4) + (s->gzhead->name == Z_NULL ? 0 : 8) + (s->gzhead->comment == Z_NULL ? 0 : 16) ); put_byte(s, (Byte)(s->gzhead->time & 0xff)); put_byte(s, (Byte)((s->gzhead->time >> 8) & 0xff)); put_byte(s, (Byte)((s->gzhead->time >> 16) & 0xff)); put_byte(s, (Byte)((s->gzhead->time >> 24) & 0xff)); put_byte(s, s->level == 9 ? 2 : (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2 ? 4 : 0)); put_byte(s, s->gzhead->os & 0xff); if (s->gzhead->extra != Z_NULL) { put_byte(s, s->gzhead->extra_len & 0xff); put_byte(s, (s->gzhead->extra_len >> 8) & 0xff); } if (s->gzhead->hcrc) strm->adler = crc32(strm->adler, s->pending_buf, s->pending); s->gzindex = 0; s->status = EXTRA_STATE; } } if (s->status == EXTRA_STATE) { if (s->gzhead->extra != Z_NULL) { ulg beg = s->pending; /* start of bytes to update crc */ uInt left = (s->gzhead->extra_len & 0xffff) - s->gzindex; while (s->pending + left > s->pending_buf_size) { uInt copy = s->pending_buf_size - s->pending; zmemcpy(s->pending_buf + s->pending, s->gzhead->extra + s->gzindex, copy); s->pending = s->pending_buf_size; HCRC_UPDATE(beg); s->gzindex += copy; flush_pending(strm); if (s->pending != 0) { s->last_flush = -1; return Z_OK; } beg = 0; left -= copy; } zmemcpy(s->pending_buf + s->pending, s->gzhead->extra + s->gzindex, left); s->pending += left; HCRC_UPDATE(beg); s->gzindex = 0; } s->status = NAME_STATE; } if (s->status == NAME_STATE) { if (s->gzhead->name != Z_NULL) { ulg beg = s->pending; /* start of bytes to update crc */ int val; do { if (s->pending == s->pending_buf_size) { HCRC_UPDATE(beg); flush_pending(strm); if (s->pending != 0) { s->last_flush = -1; return Z_OK; } beg = 0; } val = s->gzhead->name[s->gzindex++]; put_byte(s, val); } while (val != 0); HCRC_UPDATE(beg); s->gzindex = 0; } s->status = COMMENT_STATE; } if (s->status == COMMENT_STATE) { if (s->gzhead->comment != Z_NULL) { ulg beg = s->pending; /* start of bytes to update crc */ int val; do { if (s->pending == s->pending_buf_size) { HCRC_UPDATE(beg); flush_pending(strm); if (s->pending != 0) { s->last_flush = -1; return Z_OK; } beg = 0; } val = s->gzhead->comment[s->gzindex++]; put_byte(s, val); } while (val != 0); HCRC_UPDATE(beg); } s->status = HCRC_STATE; } if (s->status == HCRC_STATE) { if (s->gzhead->hcrc) { if (s->pending + 2 > s->pending_buf_size) { flush_pending(strm); if (s->pending != 0) { s->last_flush = -1; return Z_OK; } } put_byte(s, (Byte)(strm->adler & 0xff)); put_byte(s, (Byte)((strm->adler >> 8) & 0xff)); strm->adler = crc32(0L, Z_NULL, 0); } s->status = BUSY_STATE; /* Compression must start with an empty pending buffer */ flush_pending(strm); if (s->pending != 0) { s->last_flush = -1; return Z_OK; } } #endif /* Start a new block or continue the current one. */ if (strm->avail_in != 0 || s->lookahead != 0 || (flush != Z_NO_FLUSH && s->status != FINISH_STATE)) { block_state bstate; bstate = s->level == 0 ? deflate_stored(s, flush) : s->strategy == Z_HUFFMAN_ONLY ? deflate_huff(s, flush) : s->strategy == Z_RLE ? deflate_rle(s, flush) : (*(configuration_table[s->level].func))(s, flush); if (bstate == finish_started || bstate == finish_done) { s->status = FINISH_STATE; } if (bstate == need_more || bstate == finish_started) { if (strm->avail_out == 0) { s->last_flush = -1; /* avoid BUF_ERROR next call, see above */ } return Z_OK; /* If flush != Z_NO_FLUSH && avail_out == 0, the next call * of deflate should use the same flush parameter to make sure * that the flush is complete. So we don't have to output an * empty block here, this will be done at next call. This also * ensures that for a very small output buffer, we emit at most * one empty block. */ } if (bstate == block_done) { if (flush == Z_PARTIAL_FLUSH) { _tr_align(s); } else if (flush != Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */ _tr_stored_block(s, (char*)0, 0L, 0); /* For a full flush, this empty block will be recognized * as a special marker by inflate_sync(). */ if (flush == Z_FULL_FLUSH) { CLEAR_HASH(s); /* forget history */ if (s->lookahead == 0) { s->strstart = 0; s->block_start = 0L; s->insert = 0; } } } flush_pending(strm); if (strm->avail_out == 0) { s->last_flush = -1; /* avoid BUF_ERROR at next call, see above */ return Z_OK; } } } if (flush != Z_FINISH) return Z_OK; if (s->wrap <= 0) return Z_STREAM_END; /* Write the trailer */ #ifdef GZIP if (s->wrap == 2) { put_byte(s, (Byte)(strm->adler & 0xff)); put_byte(s, (Byte)((strm->adler >> 8) & 0xff)); put_byte(s, (Byte)((strm->adler >> 16) & 0xff)); put_byte(s, (Byte)((strm->adler >> 24) & 0xff)); put_byte(s, (Byte)(strm->total_in & 0xff)); put_byte(s, (Byte)((strm->total_in >> 8) & 0xff)); put_byte(s, (Byte)((strm->total_in >> 16) & 0xff)); put_byte(s, (Byte)((strm->total_in >> 24) & 0xff)); } else #endif { putShortMSB(s, (uInt)(strm->adler >> 16)); putShortMSB(s, (uInt)(strm->adler & 0xffff)); } flush_pending(strm); /* If avail_out is zero, the application will call deflate again * to flush the rest. */ if (s->wrap > 0) s->wrap = -s->wrap; /* write the trailer only once! */ return s->pending != 0 ? Z_OK : Z_STREAM_END; } /* ========================================================================= */ int ZEXPORT deflateEnd (strm) z_streamp strm; { int status; if (deflateStateCheck(strm)) return Z_STREAM_ERROR; status = strm->state->status; /* Deallocate in reverse order of allocations: */ TRY_FREE(strm, strm->state->pending_buf); TRY_FREE(strm, strm->state->head); TRY_FREE(strm, strm->state->prev); TRY_FREE(strm, strm->state->window); ZFREE(strm, strm->state); strm->state = Z_NULL; return status == BUSY_STATE ? Z_DATA_ERROR : Z_OK; } /* ========================================================================= * Copy the source state to the destination state. * To simplify the source, this is not supported for 16-bit MSDOS (which * doesn't have enough memory anyway to duplicate compression states). */ int ZEXPORT deflateCopy (dest, source) z_streamp dest; z_streamp source; { #ifdef MAXSEG_64K return Z_STREAM_ERROR; #else deflate_state *ds; deflate_state *ss; ushf *overlay; if (deflateStateCheck(source) || dest == Z_NULL) { return Z_STREAM_ERROR; } ss = source->state; zmemcpy((Bytef*)dest, (const Bytef*)source, sizeof(z_stream)); ds = (deflate_state *) ZALLOC(dest, 1, sizeof(deflate_state)); if (ds == Z_NULL) return Z_MEM_ERROR; dest->state = (struct internal_state FAR *) ds; zmemcpy((Bytef*)ds, (const Bytef*)ss, sizeof(deflate_state)); ds->strm = dest; ds->window = (Bytef *) ZALLOC(dest, ds->w_size, 2*sizeof(Byte)); ds->prev = (Posf *) ZALLOC(dest, ds->w_size, sizeof(Pos)); ds->head = (Posf *) ZALLOC(dest, ds->hash_size, sizeof(Pos)); overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)+2); ds->pending_buf = (uchf *) overlay; if (ds->window == Z_NULL || ds->prev == Z_NULL || ds->head == Z_NULL || ds->pending_buf == Z_NULL) { deflateEnd (dest); return Z_MEM_ERROR; } /* following zmemcpy do not work for 16-bit MSDOS */ zmemcpy(ds->window, ss->window, ds->w_size * 2 * sizeof(Byte)); zmemcpy((Bytef*)ds->prev, (const Bytef*)ss->prev, ds->w_size * sizeof(Pos)); zmemcpy((Bytef*)ds->head, (const Bytef*)ss->head, ds->hash_size * sizeof(Pos)); zmemcpy(ds->pending_buf, ss->pending_buf, (uInt)ds->pending_buf_size); ds->pending_out = ds->pending_buf + (ss->pending_out - ss->pending_buf); ds->d_buf = overlay + ds->lit_bufsize/sizeof(ush); ds->l_buf = ds->pending_buf + (1+sizeof(ush))*ds->lit_bufsize; ds->l_desc.dyn_tree = ds->dyn_ltree; ds->d_desc.dyn_tree = ds->dyn_dtree; ds->bl_desc.dyn_tree = ds->bl_tree; return Z_OK; #endif /* MAXSEG_64K */ } /* =========================================================================== * Read a new buffer from the current input stream, update the adler32 * and total number of bytes read. All deflate() input goes through * this function so some applications may wish to modify it to avoid * allocating a large strm->next_in buffer and copying from it. * (See also flush_pending()). */ local unsigned read_buf(strm, buf, size) z_streamp strm; Bytef *buf; unsigned size; { unsigned len = strm->avail_in; if (len > size) len = size; if (len == 0) return 0; strm->avail_in -= len; zmemcpy(buf, strm->next_in, len); if (strm->state->wrap == 1) { strm->adler = adler32(strm->adler, buf, len); } #ifdef GZIP else if (strm->state->wrap == 2) { strm->adler = crc32(strm->adler, buf, len); } #endif strm->next_in += len; strm->total_in += len; return len; } /* =========================================================================== * Initialize the "longest match" routines for a new zlib stream */ local void lm_init (s) deflate_state *s; { s->window_size = (ulg)2L*s->w_size; CLEAR_HASH(s); /* Set the default configuration parameters: */ s->max_lazy_match = configuration_table[s->level].max_lazy; s->good_match = configuration_table[s->level].good_length; s->nice_match = configuration_table[s->level].nice_length; s->max_chain_length = configuration_table[s->level].max_chain; s->strstart = 0; s->block_start = 0L; s->lookahead = 0; s->insert = 0; s->match_length = s->prev_length = MIN_MATCH-1; s->match_available = 0; s->ins_h = 0; #ifndef FASTEST #ifdef ASMV match_init(); /* initialize the asm code */ #endif #endif } #ifndef FASTEST /* =========================================================================== * Set match_start to the longest match starting at the given string and * return its length. Matches shorter or equal to prev_length are discarded, * in which case the result is equal to prev_length and match_start is * garbage. * IN assertions: cur_match is the head of the hash chain for the current * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1 * OUT assertion: the match length is not greater than s->lookahead. */ #ifndef ASMV /* For 80x86 and 680x0, an optimized version will be provided in match.asm or * match.S. The code will be functionally equivalent. */ local uInt longest_match(s, cur_match) deflate_state *s; IPos cur_match; /* current match */ { unsigned chain_length = s->max_chain_length;/* max hash chain length */ register Bytef *scan = s->window + s->strstart; /* current string */ register Bytef *match; /* matched string */ register int len; /* length of current match */ int best_len = (int)s->prev_length; /* best match length so far */ int nice_match = s->nice_match; /* stop if match long enough */ IPos limit = s->strstart > (IPos)MAX_DIST(s) ? s->strstart - (IPos)MAX_DIST(s) : NIL; /* Stop when cur_match becomes <= limit. To simplify the code, * we prevent matches with the string of window index 0. */ Posf *prev = s->prev; uInt wmask = s->w_mask; #ifdef UNALIGNED_OK /* Compare two bytes at a time. Note: this is not always beneficial. * Try with and without -DUNALIGNED_OK to check. */ register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1; register ush scan_start = *(ushf*)scan; register ush scan_end = *(ushf*)(scan+best_len-1); #else register Bytef *strend = s->window + s->strstart + MAX_MATCH; register Byte scan_end1 = scan[best_len-1]; register Byte scan_end = scan[best_len]; #endif /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. * It is easy to get rid of this optimization if necessary. */ Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); /* Do not waste too much time if we already have a good match: */ if (s->prev_length >= s->good_match) { chain_length >>= 2; } /* Do not look for matches beyond the end of the input. This is necessary * to make deflate deterministic. */ if ((uInt)nice_match > s->lookahead) nice_match = (int)s->lookahead; Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead"); do { Assert(cur_match < s->strstart, "no future"); match = s->window + cur_match; /* Skip to next match if the match length cannot increase * or if the match length is less than 2. Note that the checks below * for insufficient lookahead only occur occasionally for performance * reasons. Therefore uninitialized memory will be accessed, and * conditional jumps will be made that depend on those values. * However the length of the match is limited to the lookahead, so * the output of deflate is not affected by the uninitialized values. */ #if (defined(UNALIGNED_OK) && MAX_MATCH == 258) /* This code assumes sizeof(unsigned short) == 2. Do not use * UNALIGNED_OK if your compiler uses a different size. */ if (*(ushf*)(match+best_len-1) != scan_end || *(ushf*)match != scan_start) continue; /* It is not necessary to compare scan[2] and match[2] since they are * always equal when the other bytes match, given that the hash keys * are equal and that HASH_BITS >= 8. Compare 2 bytes at a time at * strstart+3, +5, ... up to strstart+257. We check for insufficient * lookahead only every 4th comparison; the 128th check will be made * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is * necessary to put more guard bytes at the end of the window, or * to check more often for insufficient lookahead. */ Assert(scan[2] == match[2], "scan[2]?"); scan++, match++; do { } while (*(ushf*)(scan+=2) == *(ushf*)(match+=2) && *(ushf*)(scan+=2) == *(ushf*)(match+=2) && *(ushf*)(scan+=2) == *(ushf*)(match+=2) && *(ushf*)(scan+=2) == *(ushf*)(match+=2) && scan < strend); /* The funny "do {}" generates better code on most compilers */ /* Here, scan <= window+strstart+257 */ Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); if (*scan == *match) scan++; len = (MAX_MATCH - 1) - (int)(strend-scan); scan = strend - (MAX_MATCH-1); #else /* UNALIGNED_OK */ if (match[best_len] != scan_end || match[best_len-1] != scan_end1 || *match != *scan || *++match != scan[1]) continue; /* The check at best_len-1 can be removed because it will be made * again later. (This heuristic is not always a win.) * It is not necessary to compare scan[2] and match[2] since they * are always equal when the other bytes match, given that * the hash keys are equal and that HASH_BITS >= 8. */ scan += 2; match++; Assert(*scan == *match, "match[2]?"); /* We check for insufficient lookahead only every 8th comparison; * the 256th check will be made at strstart+258. */ do { } while (*++scan == *++match && *++scan == *++match && *++scan == *++match && *++scan == *++match && *++scan == *++match && *++scan == *++match && *++scan == *++match && *++scan == *++match && scan < strend); Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); len = MAX_MATCH - (int)(strend - scan); scan = strend - MAX_MATCH; #endif /* UNALIGNED_OK */ if (len > best_len) { s->match_start = cur_match; best_len = len; if (len >= nice_match) break; #ifdef UNALIGNED_OK scan_end = *(ushf*)(scan+best_len-1); #else scan_end1 = scan[best_len-1]; scan_end = scan[best_len]; #endif } } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length != 0); if ((uInt)best_len <= s->lookahead) return (uInt)best_len; return s->lookahead; } #endif /* ASMV */ #else /* FASTEST */ /* --------------------------------------------------------------------------- * Optimized version for FASTEST only */ local uInt longest_match(s, cur_match) deflate_state *s; IPos cur_match; /* current match */ { register Bytef *scan = s->window + s->strstart; /* current string */ register Bytef *match; /* matched string */ register int len; /* length of current match */ register Bytef *strend = s->window + s->strstart + MAX_MATCH; /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. * It is easy to get rid of this optimization if necessary. */ Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead"); Assert(cur_match < s->strstart, "no future"); match = s->window + cur_match; /* Return failure if the match length is less than 2: */ if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1; /* The check at best_len-1 can be removed because it will be made * again later. (This heuristic is not always a win.) * It is not necessary to compare scan[2] and match[2] since they * are always equal when the other bytes match, given that * the hash keys are equal and that HASH_BITS >= 8. */ scan += 2, match += 2; Assert(*scan == *match, "match[2]?"); /* We check for insufficient lookahead only every 8th comparison; * the 256th check will be made at strstart+258. */ do { } while (*++scan == *++match && *++scan == *++match && *++scan == *++match && *++scan == *++match && *++scan == *++match && *++scan == *++match && *++scan == *++match && *++scan == *++match && scan < strend); Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); len = MAX_MATCH - (int)(strend - scan); if (len < MIN_MATCH) return MIN_MATCH - 1; s->match_start = cur_match; return (uInt)len <= s->lookahead ? (uInt)len : s->lookahead; } #endif /* FASTEST */ #ifdef ZLIB_DEBUG #define EQUAL 0 /* result of memcmp for equal strings */ /* =========================================================================== * Check that the match at match_start is indeed a match. */ local void check_match(s, start, match, length) deflate_state *s; IPos start, match; int length; { /* check that the match is indeed a match */ if (zmemcmp(s->window + match, s->window + start, length) != EQUAL) { fprintf(stderr, " start %u, match %u, length %d\n", start, match, length); do { fprintf(stderr, "%c%c", s->window[match++], s->window[start++]); } while (--length != 0); z_error("invalid match"); } if (z_verbose > 1) { fprintf(stderr,"\\[%d,%d]", start-match, length); do { putc(s->window[start++], stderr); } while (--length != 0); } } #else # define check_match(s, start, match, length) #endif /* ZLIB_DEBUG */ /* =========================================================================== * Fill the window when the lookahead becomes insufficient. * Updates strstart and lookahead. * * IN assertion: lookahead < MIN_LOOKAHEAD * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD * At least one byte has been read, or avail_in == 0; reads are * performed for at least two bytes (required for the zip translate_eol * option -- not supported here). */ local void fill_window(s) deflate_state *s; { unsigned n; unsigned more; /* Amount of free space at the end of the window. */ uInt wsize = s->w_size; Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead"); do { more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart); /* Deal with !@#$% 64K limit: */ if (sizeof(int) <= 2) { if (more == 0 && s->strstart == 0 && s->lookahead == 0) { more = wsize; } else if (more == (unsigned)(-1)) { /* Very unlikely, but possible on 16 bit machine if * strstart == 0 && lookahead == 1 (input done a byte at time) */ more--; } } /* If the window is almost full and there is insufficient lookahead, * move the upper half to the lower one to make room in the upper half. */ if (s->strstart >= wsize+MAX_DIST(s)) { zmemcpy(s->window, s->window+wsize, (unsigned)wsize - more); s->match_start -= wsize; s->strstart -= wsize; /* we now have strstart >= MAX_DIST */ s->block_start -= (long) wsize; slide_hash(s); more += wsize; } if (s->strm->avail_in == 0) break; /* If there was no sliding: * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 && * more == window_size - lookahead - strstart * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1) * => more >= window_size - 2*WSIZE + 2 * In the BIG_MEM or MMAP case (not yet supported), * window_size == input_size + MIN_LOOKAHEAD && * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD. * Otherwise, window_size == 2*WSIZE so more >= 2. * If there was sliding, more >= WSIZE. So in all cases, more >= 2. */ Assert(more >= 2, "more < 2"); n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more); s->lookahead += n; /* Initialize the hash value now that we have some input: */ if (s->lookahead + s->insert >= MIN_MATCH) { uInt str = s->strstart - s->insert; s->ins_h = s->window[str]; UPDATE_HASH(s, s->ins_h, s->window[str + 1]); #if MIN_MATCH != 3 Call UPDATE_HASH() MIN_MATCH-3 more times #endif while (s->insert) { UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); #ifndef FASTEST s->prev[str & s->w_mask] = s->head[s->ins_h]; #endif s->head[s->ins_h] = (Pos)str; str++; s->insert--; if (s->lookahead + s->insert < MIN_MATCH) break; } } /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage, * but this is not important since only literal bytes will be emitted. */ } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0); /* If the WIN_INIT bytes after the end of the current data have never been * written, then zero those bytes in order to avoid memory check reports of * the use of uninitialized (or uninitialised as Julian writes) bytes by * the longest match routines. Update the high water mark for the next * time through here. WIN_INIT is set to MAX_MATCH since the longest match * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead. */ if (s->high_water < s->window_size) { ulg curr = s->strstart + (ulg)(s->lookahead); ulg init; if (s->high_water < curr) { /* Previous high water mark below current data -- zero WIN_INIT * bytes or up to end of window, whichever is less. */ init = s->window_size - curr; if (init > WIN_INIT) init = WIN_INIT; zmemzero(s->window + curr, (unsigned)init); s->high_water = curr + init; } else if (s->high_water < (ulg)curr + WIN_INIT) { /* High water mark at or above current data, but below current data * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up * to end of window, whichever is less. */ init = (ulg)curr + WIN_INIT - s->high_water; if (init > s->window_size - s->high_water) init = s->window_size - s->high_water; zmemzero(s->window + s->high_water, (unsigned)init); s->high_water += init; } } Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD, "not enough room for search"); } /* =========================================================================== * Flush the current block, with given end-of-file flag. * IN assertion: strstart is set to the end of the current match. */ #define FLUSH_BLOCK_ONLY(s, last) { \ _tr_flush_block(s, (s->block_start >= 0L ? \ (charf *)&s->window[(unsigned)s->block_start] : \ (charf *)Z_NULL), \ (ulg)((long)s->strstart - s->block_start), \ (last)); \ s->block_start = s->strstart; \ flush_pending(s->strm); \ Tracev((stderr,"[FLUSH]")); \ } /* Same but force premature exit if necessary. */ #define FLUSH_BLOCK(s, last) { \ FLUSH_BLOCK_ONLY(s, last); \ if (s->strm->avail_out == 0) return (last) ? finish_started : need_more; \ } /* Maximum stored block length in deflate format (not including header). */ #define MAX_STORED 65535 /* Minimum of a and b. */ #define MIN(a, b) ((a) > (b) ? (b) : (a)) /* =========================================================================== * Copy without compression as much as possible from the input stream, return * the current block state. * * In case deflateParams() is used to later switch to a non-zero compression * level, s->matches (otherwise unused when storing) keeps track of the number * of hash table slides to perform. If s->matches is 1, then one hash table * slide will be done when switching. If s->matches is 2, the maximum value * allowed here, then the hash table will be cleared, since two or more slides * is the same as a clear. * * deflate_stored() is written to minimize the number of times an input byte is * copied. It is most efficient with large input and output buffers, which * maximizes the opportunites to have a single copy from next_in to next_out. */ local block_state deflate_stored(s, flush) deflate_state *s; int flush; { /* Smallest worthy block size when not flushing or finishing. By default * this is 32K. This can be as small as 507 bytes for memLevel == 1. For * large input and output buffers, the stored block size will be larger. */ unsigned min_block = MIN(s->pending_buf_size - 5, s->w_size); /* Copy as many min_block or larger stored blocks directly to next_out as * possible. If flushing, copy the remaining available input to next_out as * stored blocks, if there is enough space. */ unsigned len, left, have, last = 0; unsigned used = s->strm->avail_in; do { /* Set len to the maximum size block that we can copy directly with the * available input data and output space. Set left to how much of that * would be copied from what's left in the window. */ len = MAX_STORED; /* maximum deflate stored block length */ have = (s->bi_valid + 42) >> 3; /* number of header bytes */ if (s->strm->avail_out < have) /* need room for header */ break; /* maximum stored block length that will fit in avail_out: */ have = s->strm->avail_out - have; left = s->strstart - s->block_start; /* bytes left in window */ if (len > (ulg)left + s->strm->avail_in) len = left + s->strm->avail_in; /* limit len to the input */ if (len > have) len = have; /* limit len to the output */ /* If the stored block would be less than min_block in length, or if * unable to copy all of the available input when flushing, then try * copying to the window and the pending buffer instead. Also don't * write an empty block when flushing -- deflate() does that. */ if (len < min_block && ((len == 0 && flush != Z_FINISH) || flush == Z_NO_FLUSH || len != left + s->strm->avail_in)) break; /* Make a dummy stored block in pending to get the header bytes, * including any pending bits. This also updates the debugging counts. */ last = flush == Z_FINISH && len == left + s->strm->avail_in ? 1 : 0; _tr_stored_block(s, (char *)0, 0L, last); /* Replace the lengths in the dummy stored block with len. */ s->pending_buf[s->pending - 4] = len; s->pending_buf[s->pending - 3] = len >> 8; s->pending_buf[s->pending - 2] = ~len; s->pending_buf[s->pending - 1] = ~len >> 8; /* Write the stored block header bytes. */ flush_pending(s->strm); #ifdef ZLIB_DEBUG /* Update debugging counts for the data about to be copied. */ s->compressed_len += len << 3; s->bits_sent += len << 3; #endif /* Copy uncompressed bytes from the window to next_out. */ if (left) { if (left > len) left = len; zmemcpy(s->strm->next_out, s->window + s->block_start, left); s->strm->next_out += left; s->strm->avail_out -= left; s->strm->total_out += left; s->block_start += left; len -= left; } /* Copy uncompressed bytes directly from next_in to next_out, updating * the check value. */ if (len) { read_buf(s->strm, s->strm->next_out, len); s->strm->next_out += len; s->strm->avail_out -= len; s->strm->total_out += len; } } while (last == 0); /* Update the sliding window with the last s->w_size bytes of the copied * data, or append all of the copied data to the existing window if less * than s->w_size bytes were copied. Also update the number of bytes to * insert in the hash tables, in the event that deflateParams() switches to * a non-zero compression level. */ used -= s->strm->avail_in; /* number of input bytes directly copied */ if (used) { /* If any input was used, then no unused input remains in the window, * therefore s->block_start == s->strstart. */ if (used >= s->w_size) { /* supplant the previous history */ s->matches = 2; /* clear hash */ zmemcpy(s->window, s->strm->next_in - s->w_size, s->w_size); s->strstart = s->w_size; } else { if (s->window_size - s->strstart <= used) { /* Slide the window down. */ s->strstart -= s->w_size; zmemcpy(s->window, s->window + s->w_size, s->strstart); if (s->matches < 2) s->matches++; /* add a pending slide_hash() */ } zmemcpy(s->window + s->strstart, s->strm->next_in - used, used); s->strstart += used; } s->block_start = s->strstart; s->insert += MIN(used, s->w_size - s->insert); } if (s->high_water < s->strstart) s->high_water = s->strstart; /* If the last block was written to next_out, then done. */ if (last) return finish_done; /* If flushing and all input has been consumed, then done. */ if (flush != Z_NO_FLUSH && flush != Z_FINISH && s->strm->avail_in == 0 && (long)s->strstart == s->block_start) return block_done; /* Fill the window with any remaining input. */ have = s->window_size - s->strstart - 1; if (s->strm->avail_in > have && s->block_start >= (long)s->w_size) { /* Slide the window down. */ s->block_start -= s->w_size; s->strstart -= s->w_size; zmemcpy(s->window, s->window + s->w_size, s->strstart); if (s->matches < 2) s->matches++; /* add a pending slide_hash() */ have += s->w_size; /* more space now */ } if (have > s->strm->avail_in) have = s->strm->avail_in; if (have) { read_buf(s->strm, s->window + s->strstart, have); s->strstart += have; } if (s->high_water < s->strstart) s->high_water = s->strstart; /* There was not enough avail_out to write a complete worthy or flushed * stored block to next_out. Write a stored block to pending instead, if we * have enough input for a worthy block, or if flushing and there is enough * room for the remaining input as a stored block in the pending buffer. */ have = (s->bi_valid + 42) >> 3; /* number of header bytes */ /* maximum stored block length that will fit in pending: */ have = MIN(s->pending_buf_size - have, MAX_STORED); min_block = MIN(have, s->w_size); left = s->strstart - s->block_start; if (left >= min_block || ((left || flush == Z_FINISH) && flush != Z_NO_FLUSH && s->strm->avail_in == 0 && left <= have)) { len = MIN(left, have); last = flush == Z_FINISH && s->strm->avail_in == 0 && len == left ? 1 : 0; _tr_stored_block(s, (charf *)s->window + s->block_start, len, last); s->block_start += len; flush_pending(s->strm); } /* We've done all we can with the available input and output. */ return last ? finish_started : need_more; } /* =========================================================================== * Compress as much as possible from the input stream, return the current * block state. * This function does not perform lazy evaluation of matches and inserts * new strings in the dictionary only for unmatched strings or for short * matches. It is used only for the fast compression options. */ local block_state deflate_fast(s, flush) deflate_state *s; int flush; { IPos hash_head; /* head of the hash chain */ int bflush; /* set if current block must be flushed */ for (;;) { /* Make sure that we always have enough lookahead, except * at the end of the input file. We need MAX_MATCH bytes * for the next match, plus MIN_MATCH bytes to insert the * string following the next match. */ if (s->lookahead < MIN_LOOKAHEAD) { fill_window(s); if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) { return need_more; } if (s->lookahead == 0) break; /* flush the current block */ } /* Insert the string window[strstart .. strstart+2] in the * dictionary, and set hash_head to the head of the hash chain: */ hash_head = NIL; if (s->lookahead >= MIN_MATCH) { INSERT_STRING(s, s->strstart, hash_head); } /* Find the longest match, discarding those <= prev_length. * At this point we have always match_length < MIN_MATCH */ if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) { /* To simplify the code, we prevent matches with the string * of window index 0 (in particular we have to avoid a match * of the string with itself at the start of the input file). */ s->match_length = longest_match (s, hash_head); /* longest_match() sets match_start */ } if (s->match_length >= MIN_MATCH) { check_match(s, s->strstart, s->match_start, s->match_length); _tr_tally_dist(s, s->strstart - s->match_start, s->match_length - MIN_MATCH, bflush); s->lookahead -= s->match_length; /* Insert new strings in the hash table only if the match length * is not too large. This saves time but degrades compression. */ #ifndef FASTEST if (s->match_length <= s->max_insert_length && s->lookahead >= MIN_MATCH) { s->match_length--; /* string at strstart already in table */ do { s->strstart++; INSERT_STRING(s, s->strstart, hash_head); /* strstart never exceeds WSIZE-MAX_MATCH, so there are * always MIN_MATCH bytes ahead. */ } while (--s->match_length != 0); s->strstart++; } else #endif { s->strstart += s->match_length; s->match_length = 0; s->ins_h = s->window[s->strstart]; UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]); #if MIN_MATCH != 3 Call UPDATE_HASH() MIN_MATCH-3 more times #endif /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not * matter since it will be recomputed at next deflate call. */ } } else { /* No match, output a literal byte */ Tracevv((stderr,"%c", s->window[s->strstart])); _tr_tally_lit (s, s->window[s->strstart], bflush); s->lookahead--; s->strstart++; } if (bflush) FLUSH_BLOCK(s, 0); } s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1; if (flush == Z_FINISH) { FLUSH_BLOCK(s, 1); return finish_done; } if (s->last_lit) FLUSH_BLOCK(s, 0); return block_done; } #ifndef FASTEST /* =========================================================================== * Same as above, but achieves better compression. We use a lazy * evaluation for matches: a match is finally adopted only if there is * no better match at the next window position. */ local block_state deflate_slow(s, flush) deflate_state *s; int flush; { IPos hash_head; /* head of hash chain */ int bflush; /* set if current block must be flushed */ /* Process the input block. */ for (;;) { /* Make sure that we always have enough lookahead, except * at the end of the input file. We need MAX_MATCH bytes * for the next match, plus MIN_MATCH bytes to insert the * string following the next match. */ if (s->lookahead < MIN_LOOKAHEAD) { fill_window(s); if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) { return need_more; } if (s->lookahead == 0) break; /* flush the current block */ } /* Insert the string window[strstart .. strstart+2] in the * dictionary, and set hash_head to the head of the hash chain: */ hash_head = NIL; if (s->lookahead >= MIN_MATCH) { INSERT_STRING(s, s->strstart, hash_head); } /* Find the longest match, discarding those <= prev_length. */ s->prev_length = s->match_length; s->prev_match = s->match_start; s->match_length = MIN_MATCH-1; if (hash_head != NIL && s->prev_length < s->max_lazy_match && s->strstart - hash_head <= MAX_DIST(s)) { /* To simplify the code, we prevent matches with the string * of window index 0 (in particular we have to avoid a match * of the string with itself at the start of the input file). */ s->match_length = longest_match (s, hash_head); /* longest_match() sets match_start */ if (s->match_length <= 5 && (s->strategy == Z_FILTERED #if TOO_FAR <= 32767 || (s->match_length == MIN_MATCH && s->strstart - s->match_start > TOO_FAR) #endif )) { /* If prev_match is also MIN_MATCH, match_start is garbage * but we will ignore the current match anyway. */ s->match_length = MIN_MATCH-1; } } /* If there was a match at the previous step and the current * match is not better, output the previous match: */ if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) { uInt max_insert = s->strstart + s->lookahead - MIN_MATCH; /* Do not insert strings in hash table beyond this. */ check_match(s, s->strstart-1, s->prev_match, s->prev_length); _tr_tally_dist(s, s->strstart -1 - s->prev_match, s->prev_length - MIN_MATCH, bflush); /* Insert in hash table all strings up to the end of the match. * strstart-1 and strstart are already inserted. If there is not * enough lookahead, the last two strings are not inserted in * the hash table. */ s->lookahead -= s->prev_length-1; s->prev_length -= 2; do { if (++s->strstart <= max_insert) { INSERT_STRING(s, s->strstart, hash_head); } } while (--s->prev_length != 0); s->match_available = 0; s->match_length = MIN_MATCH-1; s->strstart++; if (bflush) FLUSH_BLOCK(s, 0); } else if (s->match_available) { /* If there was no match at the previous position, output a * single literal. If there was a match but the current match * is longer, truncate the previous match to a single literal. */ Tracevv((stderr,"%c", s->window[s->strstart-1])); _tr_tally_lit(s, s->window[s->strstart-1], bflush); if (bflush) { FLUSH_BLOCK_ONLY(s, 0); } s->strstart++; s->lookahead--; if (s->strm->avail_out == 0) return need_more; } else { /* There is no previous match to compare with, wait for * the next step to decide. */ s->match_available = 1; s->strstart++; s->lookahead--; } } Assert (flush != Z_NO_FLUSH, "no flush?"); if (s->match_available) { Tracevv((stderr,"%c", s->window[s->strstart-1])); _tr_tally_lit(s, s->window[s->strstart-1], bflush); s->match_available = 0; } s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1; if (flush == Z_FINISH) { FLUSH_BLOCK(s, 1); return finish_done; } if (s->last_lit) FLUSH_BLOCK(s, 0); return block_done; } #endif /* FASTEST */ /* =========================================================================== * For Z_RLE, simply look for runs of bytes, generate matches only of distance * one. Do not maintain a hash table. (It will be regenerated if this run of * deflate switches away from Z_RLE.) */ local block_state deflate_rle(s, flush) deflate_state *s; int flush; { int bflush; /* set if current block must be flushed */ uInt prev; /* byte at distance one to match */ Bytef *scan, *strend; /* scan goes up to strend for length of run */ for (;;) { /* Make sure that we always have enough lookahead, except * at the end of the input file. We need MAX_MATCH bytes * for the longest run, plus one for the unrolled loop. */ if (s->lookahead <= MAX_MATCH) { fill_window(s); if (s->lookahead <= MAX_MATCH && flush == Z_NO_FLUSH) { return need_more; } if (s->lookahead == 0) break; /* flush the current block */ } /* See how many times the previous byte repeats */ s->match_length = 0; if (s->lookahead >= MIN_MATCH && s->strstart > 0) { scan = s->window + s->strstart - 1; prev = *scan; if (prev == *++scan && prev == *++scan && prev == *++scan) { strend = s->window + s->strstart + MAX_MATCH; do { } while (prev == *++scan && prev == *++scan && prev == *++scan && prev == *++scan && prev == *++scan && prev == *++scan && prev == *++scan && prev == *++scan && scan < strend); s->match_length = MAX_MATCH - (uInt)(strend - scan); if (s->match_length > s->lookahead) s->match_length = s->lookahead; } Assert(scan <= s->window+(uInt)(s->window_size-1), "wild scan"); } /* Emit match if have run of MIN_MATCH or longer, else emit literal */ if (s->match_length >= MIN_MATCH) { check_match(s, s->strstart, s->strstart - 1, s->match_length); _tr_tally_dist(s, 1, s->match_length - MIN_MATCH, bflush); s->lookahead -= s->match_length; s->strstart += s->match_length; s->match_length = 0; } else { /* No match, output a literal byte */ Tracevv((stderr,"%c", s->window[s->strstart])); _tr_tally_lit (s, s->window[s->strstart], bflush); s->lookahead--; s->strstart++; } if (bflush) FLUSH_BLOCK(s, 0); } s->insert = 0; if (flush == Z_FINISH) { FLUSH_BLOCK(s, 1); return finish_done; } if (s->last_lit) FLUSH_BLOCK(s, 0); return block_done; } /* =========================================================================== * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table. * (It will be regenerated if this run of deflate switches away from Huffman.) */ local block_state deflate_huff(s, flush) deflate_state *s; int flush; { int bflush; /* set if current block must be flushed */ for (;;) { /* Make sure that we have a literal to write. */ if (s->lookahead == 0) { fill_window(s); if (s->lookahead == 0) { if (flush == Z_NO_FLUSH) return need_more; break; /* flush the current block */ } } /* Output a literal byte */ s->match_length = 0; Tracevv((stderr,"%c", s->window[s->strstart])); _tr_tally_lit (s, s->window[s->strstart], bflush); s->lookahead--; s->strstart++; if (bflush) FLUSH_BLOCK(s, 0); } s->insert = 0; if (flush == Z_FINISH) { FLUSH_BLOCK(s, 1); return finish_done; } if (s->last_lit) FLUSH_BLOCK(s, 0); return block_done; } UEFITool-A66/common/zlib/deflate.h000077500000000000000000000315361442134156300170210ustar00rootroot00000000000000/* deflate.h -- internal compression state * Copyright (C) 1995-2016 Jean-loup Gailly * For conditions of distribution and use, see copyright notice in zlib.h */ /* WARNING: this file should *not* be used by applications. It is part of the implementation of the compression library and is subject to change. Applications should only use zlib.h. */ /* @(#) $Id$ */ #ifndef DEFLATE_H #define DEFLATE_H #include "zutil.h" /* define NO_GZIP when compiling if you want to disable gzip header and trailer creation by deflate(). NO_GZIP would be used to avoid linking in the crc code when it is not needed. For shared libraries, gzip encoding should be left enabled. */ #ifndef NO_GZIP # define GZIP #endif /* =========================================================================== * Internal compression state. */ #define LENGTH_CODES 29 /* number of length codes, not counting the special END_BLOCK code */ #define LITERALS 256 /* number of literal bytes 0..255 */ #define L_CODES (LITERALS+1+LENGTH_CODES) /* number of Literal or Length codes, including the END_BLOCK code */ #define D_CODES 30 /* number of distance codes */ #define BL_CODES 19 /* number of codes used to transfer the bit lengths */ #define HEAP_SIZE (2*L_CODES+1) /* maximum heap size */ #define MAX_BITS 15 /* All codes must not exceed MAX_BITS bits */ #define Buf_size 16 /* size of bit buffer in bi_buf */ #define INIT_STATE 42 /* zlib header -> BUSY_STATE */ #ifdef GZIP # define GZIP_STATE 57 /* gzip header -> BUSY_STATE | EXTRA_STATE */ #endif #define EXTRA_STATE 69 /* gzip extra block -> NAME_STATE */ #define NAME_STATE 73 /* gzip file name -> COMMENT_STATE */ #define COMMENT_STATE 91 /* gzip comment -> HCRC_STATE */ #define HCRC_STATE 103 /* gzip header CRC -> BUSY_STATE */ #define BUSY_STATE 113 /* deflate -> FINISH_STATE */ #define FINISH_STATE 666 /* stream complete */ /* Stream status */ /* Data structure describing a single value and its code string. */ typedef struct ct_data_s { union { ush freq; /* frequency count */ ush code; /* bit string */ } fc; union { ush dad; /* father node in Huffman tree */ ush len; /* length of bit string */ } dl; } FAR ct_data; #define Freq fc.freq #define Code fc.code #define Dad dl.dad #define Len dl.len typedef struct static_tree_desc_s static_tree_desc; typedef struct tree_desc_s { ct_data *dyn_tree; /* the dynamic tree */ int max_code; /* largest code with non zero frequency */ const static_tree_desc *stat_desc; /* the corresponding static tree */ } FAR tree_desc; typedef ush Pos; typedef Pos FAR Posf; typedef unsigned IPos; /* A Pos is an index in the character window. We use short instead of int to * save space in the various tables. IPos is used only for parameter passing. */ typedef struct internal_state { z_streamp strm; /* pointer back to this zlib stream */ int status; /* as the name implies */ Bytef *pending_buf; /* output still pending */ ulg pending_buf_size; /* size of pending_buf */ Bytef *pending_out; /* next pending byte to output to the stream */ ulg pending; /* nb of bytes in the pending buffer */ int wrap; /* bit 0 true for zlib, bit 1 true for gzip */ gz_headerp gzhead; /* gzip header information to write */ ulg gzindex; /* where in extra, name, or comment */ Byte method; /* can only be DEFLATED */ int last_flush; /* value of flush param for previous deflate call */ /* used by deflate.c: */ uInt w_size; /* LZ77 window size (32K by default) */ uInt w_bits; /* log2(w_size) (8..16) */ uInt w_mask; /* w_size - 1 */ Bytef *window; /* Sliding window. Input bytes are read into the second half of the window, * and move to the first half later to keep a dictionary of at least wSize * bytes. With this organization, matches are limited to a distance of * wSize-MAX_MATCH bytes, but this ensures that IO is always * performed with a length multiple of the block size. Also, it limits * the window size to 64K, which is quite useful on MSDOS. * To do: use the user input buffer as sliding window. */ ulg window_size; /* Actual size of window: 2*wSize, except when the user input buffer * is directly used as sliding window. */ Posf *prev; /* Link to older string with same hash index. To limit the size of this * array to 64K, this link is maintained only for the last 32K strings. * An index in this array is thus a window index modulo 32K. */ Posf *head; /* Heads of the hash chains or NIL. */ uInt ins_h; /* hash index of string to be inserted */ uInt hash_size; /* number of elements in hash table */ uInt hash_bits; /* log2(hash_size) */ uInt hash_mask; /* hash_size-1 */ uInt hash_shift; /* Number of bits by which ins_h must be shifted at each input * step. It must be such that after MIN_MATCH steps, the oldest * byte no longer takes part in the hash key, that is: * hash_shift * MIN_MATCH >= hash_bits */ long block_start; /* Window position at the beginning of the current output block. Gets * negative when the window is moved backwards. */ uInt match_length; /* length of best match */ IPos prev_match; /* previous match */ int match_available; /* set if previous match exists */ uInt strstart; /* start of string to insert */ uInt match_start; /* start of matching string */ uInt lookahead; /* number of valid bytes ahead in window */ uInt prev_length; /* Length of the best match at previous step. Matches not greater than this * are discarded. This is used in the lazy match evaluation. */ uInt max_chain_length; /* To speed up deflation, hash chains are never searched beyond this * length. A higher limit improves compression ratio but degrades the * speed. */ uInt max_lazy_match; /* Attempt to find a better match only when the current match is strictly * smaller than this value. This mechanism is used only for compression * levels >= 4. */ # define max_insert_length max_lazy_match /* Insert new strings in the hash table only if the match length is not * greater than this length. This saves time but degrades compression. * max_insert_length is used only for compression levels <= 3. */ int level; /* compression level (1..9) */ int strategy; /* favor or force Huffman coding*/ uInt good_match; /* Use a faster search when the previous match is longer than this */ int nice_match; /* Stop searching when current match exceeds this */ /* used by trees.c: */ /* Didn't use ct_data typedef below to suppress compiler warning */ struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ struct tree_desc_s l_desc; /* desc. for literal tree */ struct tree_desc_s d_desc; /* desc. for distance tree */ struct tree_desc_s bl_desc; /* desc. for bit length tree */ ush bl_count[MAX_BITS+1]; /* number of codes at each bit length for an optimal tree */ int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ int heap_len; /* number of elements in the heap */ int heap_max; /* element of largest frequency */ /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used. * The same heap array is used to build all trees. */ uch depth[2*L_CODES+1]; /* Depth of each subtree used as tie breaker for trees of equal frequency */ uchf *l_buf; /* buffer for literals or lengths */ uInt lit_bufsize; /* Size of match buffer for literals/lengths. There are 4 reasons for * limiting lit_bufsize to 64K: * - frequencies can be kept in 16 bit counters * - if compression is not successful for the first block, all input * data is still in the window so we can still emit a stored block even * when input comes from standard input. (This can also be done for * all blocks if lit_bufsize is not greater than 32K.) * - if compression is not successful for a file smaller than 64K, we can * even emit a stored file instead of a stored block (saving 5 bytes). * This is applicable only for zip (not gzip or zlib). * - creating new Huffman trees less frequently may not provide fast * adaptation to changes in the input data statistics. (Take for * example a binary file with poorly compressible code followed by * a highly compressible string table.) Smaller buffer sizes give * fast adaptation but have of course the overhead of transmitting * trees more frequently. * - I can't count above 4 */ uInt last_lit; /* running index in l_buf */ ushf *d_buf; /* Buffer for distances. To simplify the code, d_buf and l_buf have * the same number of elements. To use different lengths, an extra flag * array would be necessary. */ ulg opt_len; /* bit length of current block with optimal trees */ ulg static_len; /* bit length of current block with static trees */ uInt matches; /* number of string matches in current block */ uInt insert; /* bytes at end of window left to insert */ #ifdef ZLIB_DEBUG ulg compressed_len; /* total bit length of compressed file mod 2^32 */ ulg bits_sent; /* bit length of compressed data sent mod 2^32 */ #endif ush bi_buf; /* Output buffer. bits are inserted starting at the bottom (least * significant bits). */ int bi_valid; /* Number of valid bits in bi_buf. All bits above the last valid bit * are always zero. */ ulg high_water; /* High water mark offset in window for initialized bytes -- bytes above * this are set to zero in order to avoid memory check warnings when * longest match routines access bytes past the input. This is then * updated to the new high water mark. */ } FAR deflate_state; /* Output a byte on the stream. * IN assertion: there is enough room in pending_buf. */ #define put_byte(s, c) {s->pending_buf[s->pending++] = (Bytef)(c);} #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) /* Minimum amount of lookahead, except at the end of the input file. * See deflate.c for comments about the MIN_MATCH+1. */ #define MAX_DIST(s) ((s)->w_size-MIN_LOOKAHEAD) /* In order to simplify the code, particularly on 16 bit machines, match * distances are limited to MAX_DIST instead of WSIZE. */ #define WIN_INIT MAX_MATCH /* Number of bytes after end of data in window to initialize in order to avoid memory checker errors from longest match routines */ /* in trees.c */ void ZLIB_INTERNAL _tr_init OF((deflate_state *s)); int ZLIB_INTERNAL _tr_tally OF((deflate_state *s, unsigned dist, unsigned lc)); void ZLIB_INTERNAL _tr_flush_block OF((deflate_state *s, charf *buf, ulg stored_len, int last)); void ZLIB_INTERNAL _tr_flush_bits OF((deflate_state *s)); void ZLIB_INTERNAL _tr_align OF((deflate_state *s)); void ZLIB_INTERNAL _tr_stored_block OF((deflate_state *s, charf *buf, ulg stored_len, int last)); #define d_code(dist) \ ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)]) /* Mapping from a distance to a distance code. dist is the distance - 1 and * must not have side effects. _dist_code[256] and _dist_code[257] are never * used. */ #ifndef ZLIB_DEBUG /* Inline versions of _tr_tally for speed: */ #if defined(GEN_TREES_H) || !defined(STDC) extern uch ZLIB_INTERNAL _length_code[]; extern uch ZLIB_INTERNAL _dist_code[]; #else extern const uch ZLIB_INTERNAL _length_code[]; extern const uch ZLIB_INTERNAL _dist_code[]; #endif # define _tr_tally_lit(s, c, flush) \ { uch cc = (c); \ s->d_buf[s->last_lit] = 0; \ s->l_buf[s->last_lit++] = cc; \ s->dyn_ltree[cc].Freq++; \ flush = (s->last_lit == s->lit_bufsize-1); \ } # define _tr_tally_dist(s, distance, length, flush) \ { uch len = (uch)(length); \ ush dist = (ush)(distance); \ s->d_buf[s->last_lit] = dist; \ s->l_buf[s->last_lit++] = len; \ dist--; \ s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \ s->dyn_dtree[d_code(dist)].Freq++; \ flush = (s->last_lit == s->lit_bufsize-1); \ } #else # define _tr_tally_lit(s, c, flush) flush = _tr_tally(s, 0, c) # define _tr_tally_dist(s, distance, length, flush) \ flush = _tr_tally(s, distance, length) #endif #endif /* DEFLATE_H */ UEFITool-A66/common/zlib/gzclose.c000077500000000000000000000012461442134156300170510ustar00rootroot00000000000000/* gzclose.c -- zlib gzclose() function * Copyright (C) 2004, 2010 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ #include "gzguts.h" /* gzclose() is in a separate file so that it is linked in only if it is used. That way the other gzclose functions can be used instead to avoid linking in unneeded compression or decompression routines. */ int ZEXPORT gzclose(file) gzFile file; { #ifndef NO_GZCOMPRESS gz_statep state; if (file == NULL) return Z_STREAM_ERROR; state = (gz_statep)file; return state->mode == GZ_READ ? gzclose_r(file) : gzclose_w(file); #else return gzclose_r(file); #endif } UEFITool-A66/common/zlib/gzguts.h000077500000000000000000000154251442134156300167370ustar00rootroot00000000000000/* gzguts.h -- zlib internal header definitions for gz* operations * Copyright (C) 2004, 2005, 2010, 2011, 2012, 2013, 2016 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ #ifdef _LARGEFILE64_SOURCE # ifndef _LARGEFILE_SOURCE # define _LARGEFILE_SOURCE 1 # endif # ifdef _FILE_OFFSET_BITS # undef _FILE_OFFSET_BITS # endif #endif #ifdef HAVE_HIDDEN # define ZLIB_INTERNAL __attribute__((visibility ("hidden"))) #else # define ZLIB_INTERNAL #endif #include #include "zlib.h" #ifdef STDC # include # include # include #endif #ifndef _POSIX_SOURCE # define _POSIX_SOURCE #endif #include #ifdef _WIN32 # include #endif #if defined(__TURBOC__) || defined(_MSC_VER) || defined(_WIN32) # include #endif #if defined(_WIN32) || defined(__CYGWIN__) # define WIDECHAR #endif #ifdef WINAPI_FAMILY # define open _open # define read _read # define write _write # define close _close #endif #ifdef NO_DEFLATE /* for compatibility with old definition */ # define NO_GZCOMPRESS #endif #if defined(STDC99) || (defined(__TURBOC__) && __TURBOC__ >= 0x550) # ifndef HAVE_VSNPRINTF # define HAVE_VSNPRINTF # endif #endif #if defined(__CYGWIN__) # ifndef HAVE_VSNPRINTF # define HAVE_VSNPRINTF # endif #endif #if defined(MSDOS) && defined(__BORLANDC__) && (BORLANDC > 0x410) # ifndef HAVE_VSNPRINTF # define HAVE_VSNPRINTF # endif #endif #ifndef HAVE_VSNPRINTF # ifdef MSDOS /* vsnprintf may exist on some MS-DOS compilers (DJGPP?), but for now we just assume it doesn't. */ # define NO_vsnprintf # endif # ifdef __TURBOC__ # define NO_vsnprintf # endif # ifdef WIN32 /* In Win32, vsnprintf is available as the "non-ANSI" _vsnprintf. */ # if !defined(vsnprintf) && !defined(NO_vsnprintf) # if !defined(_MSC_VER) || ( defined(_MSC_VER) && _MSC_VER < 1500 ) # define vsnprintf _vsnprintf # endif # endif # endif # ifdef __SASC # define NO_vsnprintf # endif # ifdef VMS # define NO_vsnprintf # endif # ifdef __OS400__ # define NO_vsnprintf # endif # ifdef __MVS__ # define NO_vsnprintf # endif #endif /* unlike snprintf (which is required in C99), _snprintf does not guarantee null termination of the result -- however this is only used in gzlib.c where the result is assured to fit in the space provided */ #if defined(_MSC_VER) && _MSC_VER < 1900 # define snprintf _snprintf #endif #ifndef local # define local static #endif /* since "static" is used to mean two completely different things in C, we define "local" for the non-static meaning of "static", for readability (compile with -Dlocal if your debugger can't find static symbols) */ /* gz* functions always use library allocation functions */ #ifndef STDC extern voidp malloc OF((uInt size)); extern void free OF((voidpf ptr)); #endif /* get errno and strerror definition */ #if defined UNDER_CE # include # define zstrerror() gz_strwinerror((DWORD)GetLastError()) #else # ifndef NO_STRERROR # include # define zstrerror() strerror(errno) # else # define zstrerror() "stdio error (consult errno)" # endif #endif /* provide prototypes for these when building zlib without LFS */ #if !defined(_LARGEFILE64_SOURCE) || _LFS64_LARGEFILE-0 == 0 ZEXTERN gzFile ZEXPORT gzopen64 OF((const char *, const char *)); ZEXTERN z_off64_t ZEXPORT gzseek64 OF((gzFile, z_off64_t, int)); ZEXTERN z_off64_t ZEXPORT gztell64 OF((gzFile)); ZEXTERN z_off64_t ZEXPORT gzoffset64 OF((gzFile)); #endif /* default memLevel */ #if MAX_MEM_LEVEL >= 8 # define DEF_MEM_LEVEL 8 #else # define DEF_MEM_LEVEL MAX_MEM_LEVEL #endif /* default i/o buffer size -- double this for output when reading (this and twice this must be able to fit in an unsigned type) */ #define GZBUFSIZE 8192 /* gzip modes, also provide a little integrity check on the passed structure */ #define GZ_NONE 0 #define GZ_READ 7247 #define GZ_WRITE 31153 #define GZ_APPEND 1 /* mode set to GZ_WRITE after the file is opened */ /* values for gz_state how */ #define LOOK 0 /* look for a gzip header */ #define COPY 1 /* copy input directly */ #define GZIP 2 /* decompress a gzip stream */ /* internal gzip file state data structure */ typedef struct { /* exposed contents for gzgetc() macro */ struct gzFile_s x; /* "x" for exposed */ /* x.have: number of bytes available at x.next */ /* x.next: next output data to deliver or write */ /* x.pos: current position in uncompressed data */ /* used for both reading and writing */ int mode; /* see gzip modes above */ int fd; /* file descriptor */ char *path; /* path or fd for error messages */ unsigned size; /* buffer size, zero if not allocated yet */ unsigned want; /* requested buffer size, default is GZBUFSIZE */ unsigned char *in; /* input buffer (double-sized when writing) */ unsigned char *out; /* output buffer (double-sized when reading) */ int direct; /* 0 if processing gzip, 1 if transparent */ /* just for reading */ int how; /* 0: get header, 1: copy, 2: decompress */ z_off64_t start; /* where the gzip data started, for rewinding */ int eof; /* true if end of input file reached */ int past; /* true if read requested past end */ /* just for writing */ int level; /* compression level */ int strategy; /* compression strategy */ /* seek request */ z_off64_t skip; /* amount to skip (already rewound if backwards) */ int seek; /* true if seek request pending */ /* error information */ int err; /* error code */ char *msg; /* error message */ /* zlib inflate or deflate stream */ z_stream strm; /* stream structure in-place (not a pointer) */ } gz_state; typedef gz_state FAR *gz_statep; /* shared functions */ void ZLIB_INTERNAL gz_error OF((gz_statep, int, const char *)); #if defined UNDER_CE char ZLIB_INTERNAL *gz_strwinerror OF((DWORD error)); #endif /* GT_OFF(x), where x is an unsigned value, is true if x > maximum z_off64_t value -- needed when comparing unsigned to z_off64_t, which is signed (possible z_off64_t types off_t, off64_t, and long are all signed) */ #ifdef INT_MAX # define GT_OFF(x) (sizeof(int) == sizeof(z_off64_t) && (x) > INT_MAX) #else unsigned ZLIB_INTERNAL gz_intmax OF((void)); # define GT_OFF(x) (sizeof(int) == sizeof(z_off64_t) && (x) > gz_intmax()) #endif /* UEFITool change, fixes undefined lseek, open, read prototypes. */ #ifndef _WIN32 # include #endif UEFITool-A66/common/zlib/gzlib.c000077500000000000000000000403271442134156300165150ustar00rootroot00000000000000/* gzlib.c -- zlib functions common to reading and writing gzip files * Copyright (C) 2004-2017 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ #include "gzguts.h" #if defined(_WIN32) && !defined(__BORLANDC__) && !defined(__MINGW32__) # define LSEEK _lseeki64 #else #if defined(_LARGEFILE64_SOURCE) && _LFS64_LARGEFILE-0 # define LSEEK lseek64 #else # define LSEEK lseek #endif #endif /* Local functions */ local void gz_reset OF((gz_statep)); local gzFile gz_open OF((const void *, int, const char *)); #if defined UNDER_CE /* Map the Windows error number in ERROR to a locale-dependent error message string and return a pointer to it. Typically, the values for ERROR come from GetLastError. The string pointed to shall not be modified by the application, but may be overwritten by a subsequent call to gz_strwinerror The gz_strwinerror function does not change the current setting of GetLastError. */ char ZLIB_INTERNAL *gz_strwinerror (error) DWORD error; { static char buf[1024]; wchar_t *msgbuf; DWORD lasterr = GetLastError(); DWORD chars = FormatMessage(FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_ALLOCATE_BUFFER, NULL, error, 0, /* Default language */ (LPVOID)&msgbuf, 0, NULL); if (chars != 0) { /* If there is an \r\n appended, zap it. */ if (chars >= 2 && msgbuf[chars - 2] == '\r' && msgbuf[chars - 1] == '\n') { chars -= 2; msgbuf[chars] = 0; } if (chars > sizeof (buf) - 1) { chars = sizeof (buf) - 1; msgbuf[chars] = 0; } wcstombs(buf, msgbuf, chars + 1); LocalFree(msgbuf); } else { sprintf(buf, "unknown win32 error (%ld)", error); } SetLastError(lasterr); return buf; } #endif /* UNDER_CE */ /* Reset gzip file state */ local void gz_reset(state) gz_statep state; { state->x.have = 0; /* no output data available */ if (state->mode == GZ_READ) { /* for reading ... */ state->eof = 0; /* not at end of file */ state->past = 0; /* have not read past end yet */ state->how = LOOK; /* look for gzip header */ } state->seek = 0; /* no seek request pending */ gz_error(state, Z_OK, NULL); /* clear error */ state->x.pos = 0; /* no uncompressed data yet */ state->strm.avail_in = 0; /* no input data yet */ } /* Open a gzip file either by name or file descriptor. */ local gzFile gz_open(path, fd, mode) const void *path; int fd; const char *mode; { gz_statep state; z_size_t len; int oflag; #ifdef O_CLOEXEC int cloexec = 0; #endif #ifdef O_EXCL int exclusive = 0; #endif /* check input */ if (path == NULL) return NULL; /* allocate gzFile structure to return */ state = (gz_statep)malloc(sizeof(gz_state)); if (state == NULL) return NULL; state->size = 0; /* no buffers allocated yet */ state->want = GZBUFSIZE; /* requested buffer size */ state->msg = NULL; /* no error message yet */ /* interpret mode */ state->mode = GZ_NONE; state->level = Z_DEFAULT_COMPRESSION; state->strategy = Z_DEFAULT_STRATEGY; state->direct = 0; while (*mode) { if (*mode >= '0' && *mode <= '9') state->level = *mode - '0'; else switch (*mode) { case 'r': state->mode = GZ_READ; break; #ifndef NO_GZCOMPRESS case 'w': state->mode = GZ_WRITE; break; case 'a': state->mode = GZ_APPEND; break; #endif case '+': /* can't read and write at the same time */ free(state); return NULL; case 'b': /* ignore -- will request binary anyway */ break; #ifdef O_CLOEXEC case 'e': cloexec = 1; break; #endif #ifdef O_EXCL case 'x': exclusive = 1; break; #endif case 'f': state->strategy = Z_FILTERED; break; case 'h': state->strategy = Z_HUFFMAN_ONLY; break; case 'R': state->strategy = Z_RLE; break; case 'F': state->strategy = Z_FIXED; break; case 'T': state->direct = 1; break; default: /* could consider as an error, but just ignore */ ; } mode++; } /* must provide an "r", "w", or "a" */ if (state->mode == GZ_NONE) { free(state); return NULL; } /* can't force transparent read */ if (state->mode == GZ_READ) { if (state->direct) { free(state); return NULL; } state->direct = 1; /* for empty file */ } /* save the path name for error messages */ #ifdef WIDECHAR if (fd == -2) { len = wcstombs(NULL, path, 0); if (len == (z_size_t)-1) len = 0; } else #endif len = strlen((const char *)path); state->path = (char *)malloc(len + 1); if (state->path == NULL) { free(state); return NULL; } #ifdef WIDECHAR if (fd == -2) if (len) wcstombs(state->path, path, len + 1); else *(state->path) = 0; else #endif #if !defined(NO_snprintf) && !defined(NO_vsnprintf) (void)snprintf(state->path, len + 1, "%s", (const char *)path); #else strcpy(state->path, path); #endif /* compute the flags for open() */ oflag = #ifdef O_LARGEFILE O_LARGEFILE | #endif #ifdef O_BINARY O_BINARY | #endif #ifdef O_CLOEXEC (cloexec ? O_CLOEXEC : 0) | #endif (state->mode == GZ_READ ? O_RDONLY : (O_WRONLY | O_CREAT | #ifdef O_EXCL (exclusive ? O_EXCL : 0) | #endif (state->mode == GZ_WRITE ? O_TRUNC : O_APPEND))); /* open the file with the appropriate flags (or just use fd) */ state->fd = fd > -1 ? fd : ( #ifdef WIDECHAR fd == -2 ? _wopen(path, oflag, 0666) : #endif open((const char *)path, oflag, 0666)); if (state->fd == -1) { free(state->path); free(state); return NULL; } if (state->mode == GZ_APPEND) { LSEEK(state->fd, 0, SEEK_END); /* so gzoffset() is correct */ state->mode = GZ_WRITE; /* simplify later checks */ } /* save the current position for rewinding (only if reading) */ if (state->mode == GZ_READ) { state->start = LSEEK(state->fd, 0, SEEK_CUR); if (state->start == -1) state->start = 0; } /* initialize stream */ gz_reset(state); /* return stream */ return (gzFile)state; } /* -- see zlib.h -- */ gzFile ZEXPORT gzopen(path, mode) const char *path; const char *mode; { return gz_open(path, -1, mode); } /* -- see zlib.h -- */ gzFile ZEXPORT gzopen64(path, mode) const char *path; const char *mode; { return gz_open(path, -1, mode); } /* -- see zlib.h -- */ gzFile ZEXPORT gzdopen(fd, mode) int fd; const char *mode; { char *path; /* identifier for error messages */ gzFile gz; if (fd == -1 || (path = (char *)malloc(7 + 3 * sizeof(int))) == NULL) return NULL; #if !defined(NO_snprintf) && !defined(NO_vsnprintf) (void)snprintf(path, 7 + 3 * sizeof(int), "", fd); #else sprintf(path, "", fd); /* for debugging */ #endif gz = gz_open(path, fd, mode); free(path); return gz; } /* -- see zlib.h -- */ #ifdef WIDECHAR gzFile ZEXPORT gzopen_w(path, mode) const wchar_t *path; const char *mode; { return gz_open(path, -2, mode); } #endif /* -- see zlib.h -- */ int ZEXPORT gzbuffer(file, size) gzFile file; unsigned size; { gz_statep state; /* get internal structure and check integrity */ if (file == NULL) return -1; state = (gz_statep)file; if (state->mode != GZ_READ && state->mode != GZ_WRITE) return -1; /* make sure we haven't already allocated memory */ if (state->size != 0) return -1; /* check and set requested size */ if ((size << 1) < size) return -1; /* need to be able to double it */ if (size < 2) size = 2; /* need two bytes to check magic header */ state->want = size; return 0; } /* -- see zlib.h -- */ int ZEXPORT gzrewind(file) gzFile file; { gz_statep state; /* get internal structure */ if (file == NULL) return -1; state = (gz_statep)file; /* check that we're reading and that there's no error */ if (state->mode != GZ_READ || (state->err != Z_OK && state->err != Z_BUF_ERROR)) return -1; /* back up and start over */ if (LSEEK(state->fd, state->start, SEEK_SET) == -1) return -1; gz_reset(state); return 0; } /* -- see zlib.h -- */ z_off64_t ZEXPORT gzseek64(file, offset, whence) gzFile file; z_off64_t offset; int whence; { unsigned n; z_off64_t ret; gz_statep state; /* get internal structure and check integrity */ if (file == NULL) return -1; state = (gz_statep)file; if (state->mode != GZ_READ && state->mode != GZ_WRITE) return -1; /* check that there's no error */ if (state->err != Z_OK && state->err != Z_BUF_ERROR) return -1; /* can only seek from start or relative to current position */ if (whence != SEEK_SET && whence != SEEK_CUR) return -1; /* normalize offset to a SEEK_CUR specification */ if (whence == SEEK_SET) offset -= state->x.pos; else if (state->seek) offset += state->skip; state->seek = 0; /* if within raw area while reading, just go there */ if (state->mode == GZ_READ && state->how == COPY && state->x.pos + offset >= 0) { ret = LSEEK(state->fd, offset - state->x.have, SEEK_CUR); if (ret == -1) return -1; state->x.have = 0; state->eof = 0; state->past = 0; state->seek = 0; gz_error(state, Z_OK, NULL); state->strm.avail_in = 0; state->x.pos += offset; return state->x.pos; } /* calculate skip amount, rewinding if needed for back seek when reading */ if (offset < 0) { if (state->mode != GZ_READ) /* writing -- can't go backwards */ return -1; offset += state->x.pos; if (offset < 0) /* before start of file! */ return -1; if (gzrewind(file) == -1) /* rewind, then skip to offset */ return -1; } /* if reading, skip what's in output buffer (one less gzgetc() check) */ if (state->mode == GZ_READ) { n = GT_OFF(state->x.have) || (z_off64_t)state->x.have > offset ? (unsigned)offset : state->x.have; state->x.have -= n; state->x.next += n; state->x.pos += n; offset -= n; } /* request skip (if not zero) */ if (offset) { state->seek = 1; state->skip = offset; } return state->x.pos + offset; } /* -- see zlib.h -- */ z_off_t ZEXPORT gzseek(file, offset, whence) gzFile file; z_off_t offset; int whence; { z_off64_t ret; ret = gzseek64(file, (z_off64_t)offset, whence); return ret == (z_off_t)ret ? (z_off_t)ret : -1; } /* -- see zlib.h -- */ z_off64_t ZEXPORT gztell64(file) gzFile file; { gz_statep state; /* get internal structure and check integrity */ if (file == NULL) return -1; state = (gz_statep)file; if (state->mode != GZ_READ && state->mode != GZ_WRITE) return -1; /* return position */ return state->x.pos + (state->seek ? state->skip : 0); } /* -- see zlib.h -- */ z_off_t ZEXPORT gztell(file) gzFile file; { z_off64_t ret; ret = gztell64(file); return ret == (z_off_t)ret ? (z_off_t)ret : -1; } /* -- see zlib.h -- */ z_off64_t ZEXPORT gzoffset64(file) gzFile file; { z_off64_t offset; gz_statep state; /* get internal structure and check integrity */ if (file == NULL) return -1; state = (gz_statep)file; if (state->mode != GZ_READ && state->mode != GZ_WRITE) return -1; /* compute and return effective offset in file */ offset = LSEEK(state->fd, 0, SEEK_CUR); if (offset == -1) return -1; if (state->mode == GZ_READ) /* reading */ offset -= state->strm.avail_in; /* don't count buffered input */ return offset; } /* -- see zlib.h -- */ z_off_t ZEXPORT gzoffset(file) gzFile file; { z_off64_t ret; ret = gzoffset64(file); return ret == (z_off_t)ret ? (z_off_t)ret : -1; } /* -- see zlib.h -- */ int ZEXPORT gzeof(file) gzFile file; { gz_statep state; /* get internal structure and check integrity */ if (file == NULL) return 0; state = (gz_statep)file; if (state->mode != GZ_READ && state->mode != GZ_WRITE) return 0; /* return end-of-file state */ return state->mode == GZ_READ ? state->past : 0; } /* -- see zlib.h -- */ const char * ZEXPORT gzerror(file, errnum) gzFile file; int *errnum; { gz_statep state; /* get internal structure and check integrity */ if (file == NULL) return NULL; state = (gz_statep)file; if (state->mode != GZ_READ && state->mode != GZ_WRITE) return NULL; /* return error information */ if (errnum != NULL) *errnum = state->err; return state->err == Z_MEM_ERROR ? "out of memory" : (state->msg == NULL ? "" : state->msg); } /* -- see zlib.h -- */ void ZEXPORT gzclearerr(file) gzFile file; { gz_statep state; /* get internal structure and check integrity */ if (file == NULL) return; state = (gz_statep)file; if (state->mode != GZ_READ && state->mode != GZ_WRITE) return; /* clear error and end-of-file */ if (state->mode == GZ_READ) { state->eof = 0; state->past = 0; } gz_error(state, Z_OK, NULL); } /* Create an error message in allocated memory and set state->err and state->msg accordingly. Free any previous error message already there. Do not try to free or allocate space if the error is Z_MEM_ERROR (out of memory). Simply save the error message as a static string. If there is an allocation failure constructing the error message, then convert the error to out of memory. */ void ZLIB_INTERNAL gz_error(state, err, msg) gz_statep state; int err; const char *msg; { /* free previously allocated message and clear */ if (state->msg != NULL) { if (state->err != Z_MEM_ERROR) free(state->msg); state->msg = NULL; } /* if fatal, set state->x.have to 0 so that the gzgetc() macro fails */ if (err != Z_OK && err != Z_BUF_ERROR) state->x.have = 0; /* set error code, and if no message, then done */ state->err = err; if (msg == NULL) return; /* for an out of memory error, return literal string when requested */ if (err == Z_MEM_ERROR) return; /* construct error message with path */ if ((state->msg = (char *)malloc(strlen(state->path) + strlen(msg) + 3)) == NULL) { state->err = Z_MEM_ERROR; return; } #if !defined(NO_snprintf) && !defined(NO_vsnprintf) (void)snprintf(state->msg, strlen(state->path) + strlen(msg) + 3, "%s%s%s", state->path, ": ", msg); #else strcpy(state->msg, state->path); strcat(state->msg, ": "); strcat(state->msg, msg); #endif } #ifndef INT_MAX /* portably return maximum value for an int (when limits.h presumed not available) -- we need to do this to cover cases where 2's complement not used, since C standard permits 1's complement and sign-bit representations, otherwise we could just use ((unsigned)-1) >> 1 */ unsigned ZLIB_INTERNAL gz_intmax() { unsigned p, q; p = 1; do { q = p; p <<= 1; p++; } while (p > q); return q >> 1; } #endif UEFITool-A66/common/zlib/gzread.c000077500000000000000000000500051442134156300166540ustar00rootroot00000000000000/* gzread.c -- zlib functions for reading gzip files * Copyright (C) 2004, 2005, 2010, 2011, 2012, 2013, 2016 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ #include "gzguts.h" /* Local functions */ local int gz_load OF((gz_statep, unsigned char *, unsigned, unsigned *)); local int gz_avail OF((gz_statep)); local int gz_look OF((gz_statep)); local int gz_decomp OF((gz_statep)); local int gz_fetch OF((gz_statep)); local int gz_skip OF((gz_statep, z_off64_t)); local z_size_t gz_read OF((gz_statep, voidp, z_size_t)); /* Use read() to load a buffer -- return -1 on error, otherwise 0. Read from state->fd, and update state->eof, state->err, and state->msg as appropriate. This function needs to loop on read(), since read() is not guaranteed to read the number of bytes requested, depending on the type of descriptor. */ local int gz_load(state, buf, len, have) gz_statep state; unsigned char *buf; unsigned len; unsigned *have; { int ret; unsigned get, max = ((unsigned)-1 >> 2) + 1; *have = 0; do { get = len - *have; if (get > max) get = max; ret = read(state->fd, buf + *have, get); if (ret <= 0) break; *have += (unsigned)ret; } while (*have < len); if (ret < 0) { gz_error(state, Z_ERRNO, zstrerror()); return -1; } if (ret == 0) state->eof = 1; return 0; } /* Load up input buffer and set eof flag if last data loaded -- return -1 on error, 0 otherwise. Note that the eof flag is set when the end of the input file is reached, even though there may be unused data in the buffer. Once that data has been used, no more attempts will be made to read the file. If strm->avail_in != 0, then the current data is moved to the beginning of the input buffer, and then the remainder of the buffer is loaded with the available data from the input file. */ local int gz_avail(state) gz_statep state; { unsigned got; z_streamp strm = &(state->strm); if (state->err != Z_OK && state->err != Z_BUF_ERROR) return -1; if (state->eof == 0) { if (strm->avail_in) { /* copy what's there to the start */ unsigned char *p = state->in; unsigned const char *q = strm->next_in; unsigned n = strm->avail_in; do { *p++ = *q++; } while (--n); } if (gz_load(state, state->in + strm->avail_in, state->size - strm->avail_in, &got) == -1) return -1; strm->avail_in += got; strm->next_in = state->in; } return 0; } /* Look for gzip header, set up for inflate or copy. state->x.have must be 0. If this is the first time in, allocate required memory. state->how will be left unchanged if there is no more input data available, will be set to COPY if there is no gzip header and direct copying will be performed, or it will be set to GZIP for decompression. If direct copying, then leftover input data from the input buffer will be copied to the output buffer. In that case, all further file reads will be directly to either the output buffer or a user buffer. If decompressing, the inflate state will be initialized. gz_look() will return 0 on success or -1 on failure. */ local int gz_look(state) gz_statep state; { z_streamp strm = &(state->strm); /* allocate read buffers and inflate memory */ if (state->size == 0) { /* allocate buffers */ state->in = (unsigned char *)malloc(state->want); state->out = (unsigned char *)malloc(state->want << 1); if (state->in == NULL || state->out == NULL) { free(state->out); free(state->in); gz_error(state, Z_MEM_ERROR, "out of memory"); return -1; } state->size = state->want; /* allocate inflate memory */ state->strm.zalloc = Z_NULL; state->strm.zfree = Z_NULL; state->strm.opaque = Z_NULL; state->strm.avail_in = 0; state->strm.next_in = Z_NULL; if (inflateInit2(&(state->strm), 15 + 16) != Z_OK) { /* gunzip */ free(state->out); free(state->in); state->size = 0; gz_error(state, Z_MEM_ERROR, "out of memory"); return -1; } } /* get at least the magic bytes in the input buffer */ if (strm->avail_in < 2) { if (gz_avail(state) == -1) return -1; if (strm->avail_in == 0) return 0; } /* look for gzip magic bytes -- if there, do gzip decoding (note: there is a logical dilemma here when considering the case of a partially written gzip file, to wit, if a single 31 byte is written, then we cannot tell whether this is a single-byte file, or just a partially written gzip file -- for here we assume that if a gzip file is being written, then the header will be written in a single operation, so that reading a single byte is sufficient indication that it is not a gzip file) */ if (strm->avail_in > 1 && strm->next_in[0] == 31 && strm->next_in[1] == 139) { inflateReset(strm); state->how = GZIP; state->direct = 0; return 0; } /* no gzip header -- if we were decoding gzip before, then this is trailing garbage. Ignore the trailing garbage and finish. */ if (state->direct == 0) { strm->avail_in = 0; state->eof = 1; state->x.have = 0; return 0; } /* doing raw i/o, copy any leftover input to output -- this assumes that the output buffer is larger than the input buffer, which also assures space for gzungetc() */ state->x.next = state->out; if (strm->avail_in) { memcpy(state->x.next, strm->next_in, strm->avail_in); state->x.have = strm->avail_in; strm->avail_in = 0; } state->how = COPY; state->direct = 1; return 0; } /* Decompress from input to the provided next_out and avail_out in the state. On return, state->x.have and state->x.next point to the just decompressed data. If the gzip stream completes, state->how is reset to LOOK to look for the next gzip stream or raw data, once state->x.have is depleted. Returns 0 on success, -1 on failure. */ local int gz_decomp(state) gz_statep state; { int ret = Z_OK; unsigned had; z_streamp strm = &(state->strm); /* fill output buffer up to end of deflate stream */ had = strm->avail_out; do { /* get more input for inflate() */ if (strm->avail_in == 0 && gz_avail(state) == -1) return -1; if (strm->avail_in == 0) { gz_error(state, Z_BUF_ERROR, "unexpected end of file"); break; } /* decompress and handle errors */ ret = inflate(strm, Z_NO_FLUSH); if (ret == Z_STREAM_ERROR || ret == Z_NEED_DICT) { gz_error(state, Z_STREAM_ERROR, "internal error: inflate stream corrupt"); return -1; } if (ret == Z_MEM_ERROR) { gz_error(state, Z_MEM_ERROR, "out of memory"); return -1; } if (ret == Z_DATA_ERROR) { /* deflate stream invalid */ gz_error(state, Z_DATA_ERROR, strm->msg == NULL ? "compressed data error" : strm->msg); return -1; } } while (strm->avail_out && ret != Z_STREAM_END); /* update available output */ state->x.have = had - strm->avail_out; state->x.next = strm->next_out - state->x.have; /* if the gzip stream completed successfully, look for another */ if (ret == Z_STREAM_END) state->how = LOOK; /* good decompression */ return 0; } /* Fetch data and put it in the output buffer. Assumes state->x.have is 0. Data is either copied from the input file or decompressed from the input file depending on state->how. If state->how is LOOK, then a gzip header is looked for to determine whether to copy or decompress. Returns -1 on error, otherwise 0. gz_fetch() will leave state->how as COPY or GZIP unless the end of the input file has been reached and all data has been processed. */ local int gz_fetch(state) gz_statep state; { z_streamp strm = &(state->strm); do { switch(state->how) { case LOOK: /* -> LOOK, COPY (only if never GZIP), or GZIP */ if (gz_look(state) == -1) return -1; if (state->how == LOOK) return 0; break; case COPY: /* -> COPY */ if (gz_load(state, state->out, state->size << 1, &(state->x.have)) == -1) return -1; state->x.next = state->out; return 0; case GZIP: /* -> GZIP or LOOK (if end of gzip stream) */ strm->avail_out = state->size << 1; strm->next_out = state->out; if (gz_decomp(state) == -1) return -1; } } while (state->x.have == 0 && (!state->eof || strm->avail_in)); return 0; } /* Skip len uncompressed bytes of output. Return -1 on error, 0 on success. */ local int gz_skip(state, len) gz_statep state; z_off64_t len; { unsigned n; /* skip over len bytes or reach end-of-file, whichever comes first */ while (len) /* skip over whatever is in output buffer */ if (state->x.have) { n = GT_OFF(state->x.have) || (z_off64_t)state->x.have > len ? (unsigned)len : state->x.have; state->x.have -= n; state->x.next += n; state->x.pos += n; len -= n; } /* output buffer empty -- return if we're at the end of the input */ else if (state->eof && state->strm.avail_in == 0) break; /* need more data to skip -- load up output buffer */ else { /* get more output, looking for header if required */ if (gz_fetch(state) == -1) return -1; } return 0; } /* Read len bytes into buf from file, or less than len up to the end of the input. Return the number of bytes read. If zero is returned, either the end of file was reached, or there was an error. state->err must be consulted in that case to determine which. */ local z_size_t gz_read(state, buf, len) gz_statep state; voidp buf; z_size_t len; { z_size_t got; unsigned n; /* if len is zero, avoid unnecessary operations */ if (len == 0) return 0; /* process a skip request */ if (state->seek) { state->seek = 0; if (gz_skip(state, state->skip) == -1) return 0; } /* get len bytes to buf, or less than len if at the end */ got = 0; do { /* set n to the maximum amount of len that fits in an unsigned int */ n = -1; if (n > len) n = len; /* first just try copying data from the output buffer */ if (state->x.have) { if (state->x.have < n) n = state->x.have; memcpy(buf, state->x.next, n); state->x.next += n; state->x.have -= n; } /* output buffer empty -- return if we're at the end of the input */ else if (state->eof && state->strm.avail_in == 0) { state->past = 1; /* tried to read past end */ break; } /* need output data -- for small len or new stream load up our output buffer */ else if (state->how == LOOK || n < (state->size << 1)) { /* get more output, looking for header if required */ if (gz_fetch(state) == -1) return 0; continue; /* no progress yet -- go back to copy above */ /* the copy above assures that we will leave with space in the output buffer, allowing at least one gzungetc() to succeed */ } /* large len -- read directly into user buffer */ else if (state->how == COPY) { /* read directly */ if (gz_load(state, (unsigned char *)buf, n, &n) == -1) return 0; } /* large len -- decompress directly into user buffer */ else { /* state->how == GZIP */ state->strm.avail_out = n; state->strm.next_out = (unsigned char *)buf; if (gz_decomp(state) == -1) return 0; n = state->x.have; state->x.have = 0; } /* update progress */ len -= n; buf = (char *)buf + n; got += n; state->x.pos += n; } while (len); /* return number of bytes read into user buffer */ return got; } /* -- see zlib.h -- */ int ZEXPORT gzread(file, buf, len) gzFile file; voidp buf; unsigned len; { gz_statep state; /* get internal structure */ if (file == NULL) return -1; state = (gz_statep)file; /* check that we're reading and that there's no (serious) error */ if (state->mode != GZ_READ || (state->err != Z_OK && state->err != Z_BUF_ERROR)) return -1; /* since an int is returned, make sure len fits in one, otherwise return with an error (this avoids a flaw in the interface) */ if ((int)len < 0) { gz_error(state, Z_STREAM_ERROR, "request does not fit in an int"); return -1; } /* read len or fewer bytes to buf */ len = gz_read(state, buf, len); /* check for an error */ if (len == 0 && state->err != Z_OK && state->err != Z_BUF_ERROR) return -1; /* return the number of bytes read (this is assured to fit in an int) */ return (int)len; } /* -- see zlib.h -- */ z_size_t ZEXPORT gzfread(buf, size, nitems, file) voidp buf; z_size_t size; z_size_t nitems; gzFile file; { z_size_t len; gz_statep state; if (nitems == 0 || size == 0) return 0; /* get internal structure */ if (file == NULL) return 0; state = (gz_statep)file; /* check that we're reading and that there's no (serious) error */ if (state->mode != GZ_READ || (state->err != Z_OK && state->err != Z_BUF_ERROR)) return 0; /* compute bytes to read -- error on overflow */ len = nitems * size; if (size && len / size != nitems) { gz_error(state, Z_STREAM_ERROR, "request does not fit in a size_t"); return 0; } /* read len or fewer bytes to buf, return the number of full items read */ return len ? gz_read(state, buf, len) / size : 0; } /* -- see zlib.h -- */ #ifdef Z_PREFIX_SET # undef z_gzgetc #else # undef gzgetc #endif int ZEXPORT gzgetc(file) gzFile file; { int ret; unsigned char buf[1]; gz_statep state; /* get internal structure */ if (file == NULL) return -1; state = (gz_statep)file; /* check that we're reading and that there's no (serious) error */ if (state->mode != GZ_READ || (state->err != Z_OK && state->err != Z_BUF_ERROR)) return -1; /* try output buffer (no need to check for skip request) */ if (state->x.have) { state->x.have--; state->x.pos++; return *(state->x.next)++; } /* nothing there -- try gz_read() */ ret = gz_read(state, buf, 1); return ret < 1 ? -1 : buf[0]; } int ZEXPORT gzgetc_(file) gzFile file; { return gzgetc(file); } /* -- see zlib.h -- */ int ZEXPORT gzungetc(c, file) int c; gzFile file; { gz_statep state; /* get internal structure */ if (file == NULL) return -1; state = (gz_statep)file; /* check that we're reading and that there's no (serious) error */ if (state->mode != GZ_READ || (state->err != Z_OK && state->err != Z_BUF_ERROR)) return -1; /* process a skip request */ if (state->seek) { state->seek = 0; if (gz_skip(state, state->skip) == -1) return -1; } /* can't push EOF */ if (c < 0) return -1; /* if output buffer empty, put byte at end (allows more pushing) */ if (state->x.have == 0) { state->x.have = 1; state->x.next = state->out + (state->size << 1) - 1; state->x.next[0] = (unsigned char)c; state->x.pos--; state->past = 0; return c; } /* if no room, give up (must have already done a gzungetc()) */ if (state->x.have == (state->size << 1)) { gz_error(state, Z_DATA_ERROR, "out of room to push characters"); return -1; } /* slide output data if needed and insert byte before existing data */ if (state->x.next == state->out) { unsigned char *src = state->out + state->x.have; unsigned char *dest = state->out + (state->size << 1); while (src > state->out) *--dest = *--src; state->x.next = dest; } state->x.have++; state->x.next--; state->x.next[0] = (unsigned char)c; state->x.pos--; state->past = 0; return c; } /* -- see zlib.h -- */ char * ZEXPORT gzgets(file, buf, len) gzFile file; char *buf; int len; { unsigned left, n; char *str; unsigned char *eol; gz_statep state; /* check parameters and get internal structure */ if (file == NULL || buf == NULL || len < 1) return NULL; state = (gz_statep)file; /* check that we're reading and that there's no (serious) error */ if (state->mode != GZ_READ || (state->err != Z_OK && state->err != Z_BUF_ERROR)) return NULL; /* process a skip request */ if (state->seek) { state->seek = 0; if (gz_skip(state, state->skip) == -1) return NULL; } /* copy output bytes up to new line or len - 1, whichever comes first -- append a terminating zero to the string (we don't check for a zero in the contents, let the user worry about that) */ str = buf; left = (unsigned)len - 1; if (left) do { /* assure that something is in the output buffer */ if (state->x.have == 0 && gz_fetch(state) == -1) return NULL; /* error */ if (state->x.have == 0) { /* end of file */ state->past = 1; /* read past end */ break; /* return what we have */ } /* look for end-of-line in current output buffer */ n = state->x.have > left ? left : state->x.have; eol = (unsigned char *)memchr(state->x.next, '\n', n); if (eol != NULL) n = (unsigned)(eol - state->x.next) + 1; /* copy through end-of-line, or remainder if not found */ memcpy(buf, state->x.next, n); state->x.have -= n; state->x.next += n; state->x.pos += n; left -= n; buf += n; } while (left && eol == NULL); /* return terminated string, or if nothing, end of file */ if (buf == str) return NULL; buf[0] = 0; return str; } /* -- see zlib.h -- */ int ZEXPORT gzdirect(file) gzFile file; { gz_statep state; /* get internal structure */ if (file == NULL) return 0; state = (gz_statep)file; /* if the state is not known, but we can find out, then do so (this is mainly for right after a gzopen() or gzdopen()) */ if (state->mode == GZ_READ && state->how == LOOK && state->x.have == 0) (void)gz_look(state); /* return 1 if transparent, 0 if processing a gzip stream */ return state->direct; } /* -- see zlib.h -- */ int ZEXPORT gzclose_r(file) gzFile file; { int ret, err; gz_statep state; /* get internal structure */ if (file == NULL) return Z_STREAM_ERROR; state = (gz_statep)file; /* check that we're reading */ if (state->mode != GZ_READ) return Z_STREAM_ERROR; /* free memory and close file */ if (state->size) { inflateEnd(&(state->strm)); free(state->out); free(state->in); } err = state->err == Z_BUF_ERROR ? Z_BUF_ERROR : Z_OK; gz_error(state, Z_OK, NULL); free(state->path); ret = close(state->fd); free(state); return ret ? Z_ERRNO : err; } UEFITool-A66/common/zlib/gzwrite.c000077500000000000000000000455561442134156300171120ustar00rootroot00000000000000/* gzwrite.c -- zlib functions for writing gzip files * Copyright (C) 2004-2017 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ #include "gzguts.h" /* Local functions */ local int gz_init OF((gz_statep)); local int gz_comp OF((gz_statep, int)); local int gz_zero OF((gz_statep, z_off64_t)); local z_size_t gz_write OF((gz_statep, voidpc, z_size_t)); /* Initialize state for writing a gzip file. Mark initialization by setting state->size to non-zero. Return -1 on a memory allocation failure, or 0 on success. */ local int gz_init(state) gz_statep state; { int ret; z_streamp strm = &(state->strm); /* allocate input buffer (double size for gzprintf) */ state->in = (unsigned char *)malloc(state->want << 1); if (state->in == NULL) { gz_error(state, Z_MEM_ERROR, "out of memory"); return -1; } /* only need output buffer and deflate state if compressing */ if (!state->direct) { /* allocate output buffer */ state->out = (unsigned char *)malloc(state->want); if (state->out == NULL) { free(state->in); gz_error(state, Z_MEM_ERROR, "out of memory"); return -1; } /* allocate deflate memory, set up for gzip compression */ strm->zalloc = Z_NULL; strm->zfree = Z_NULL; strm->opaque = Z_NULL; ret = deflateInit2(strm, state->level, Z_DEFLATED, MAX_WBITS + 16, DEF_MEM_LEVEL, state->strategy); if (ret != Z_OK) { free(state->out); free(state->in); gz_error(state, Z_MEM_ERROR, "out of memory"); return -1; } strm->next_in = NULL; } /* mark state as initialized */ state->size = state->want; /* initialize write buffer if compressing */ if (!state->direct) { strm->avail_out = state->size; strm->next_out = state->out; state->x.next = strm->next_out; } return 0; } /* Compress whatever is at avail_in and next_in and write to the output file. Return -1 if there is an error writing to the output file or if gz_init() fails to allocate memory, otherwise 0. flush is assumed to be a valid deflate() flush value. If flush is Z_FINISH, then the deflate() state is reset to start a new gzip stream. If gz->direct is true, then simply write to the output file without compressing, and ignore flush. */ local int gz_comp(state, flush) gz_statep state; int flush; { int ret, writ; unsigned have, put, max = ((unsigned)-1 >> 2) + 1; z_streamp strm = &(state->strm); /* allocate memory if this is the first time through */ if (state->size == 0 && gz_init(state) == -1) return -1; /* write directly if requested */ if (state->direct) { while (strm->avail_in) { put = strm->avail_in > max ? max : strm->avail_in; writ = write(state->fd, strm->next_in, put); if (writ < 0) { gz_error(state, Z_ERRNO, zstrerror()); return -1; } strm->avail_in -= (unsigned)writ; strm->next_in += writ; } return 0; } /* run deflate() on provided input until it produces no more output */ ret = Z_OK; do { /* write out current buffer contents if full, or if flushing, but if doing Z_FINISH then don't write until we get to Z_STREAM_END */ if (strm->avail_out == 0 || (flush != Z_NO_FLUSH && (flush != Z_FINISH || ret == Z_STREAM_END))) { while (strm->next_out > state->x.next) { put = strm->next_out - state->x.next > (int)max ? max : (unsigned)(strm->next_out - state->x.next); writ = write(state->fd, state->x.next, put); if (writ < 0) { gz_error(state, Z_ERRNO, zstrerror()); return -1; } state->x.next += writ; } if (strm->avail_out == 0) { strm->avail_out = state->size; strm->next_out = state->out; state->x.next = state->out; } } /* compress */ have = strm->avail_out; ret = deflate(strm, flush); if (ret == Z_STREAM_ERROR) { gz_error(state, Z_STREAM_ERROR, "internal error: deflate stream corrupt"); return -1; } have -= strm->avail_out; } while (have); /* if that completed a deflate stream, allow another to start */ if (flush == Z_FINISH) deflateReset(strm); /* all done, no errors */ return 0; } /* Compress len zeros to output. Return -1 on a write error or memory allocation failure by gz_comp(), or 0 on success. */ local int gz_zero(state, len) gz_statep state; z_off64_t len; { int first; unsigned n; z_streamp strm = &(state->strm); /* consume whatever's left in the input buffer */ if (strm->avail_in && gz_comp(state, Z_NO_FLUSH) == -1) return -1; /* compress len zeros (len guaranteed > 0) */ first = 1; while (len) { n = GT_OFF(state->size) || (z_off64_t)state->size > len ? (unsigned)len : state->size; if (first) { memset(state->in, 0, n); first = 0; } strm->avail_in = n; strm->next_in = state->in; state->x.pos += n; if (gz_comp(state, Z_NO_FLUSH) == -1) return -1; len -= n; } return 0; } /* Write len bytes from buf to file. Return the number of bytes written. If the returned value is less than len, then there was an error. */ local z_size_t gz_write(state, buf, len) gz_statep state; voidpc buf; z_size_t len; { z_size_t put = len; /* if len is zero, avoid unnecessary operations */ if (len == 0) return 0; /* allocate memory if this is the first time through */ if (state->size == 0 && gz_init(state) == -1) return 0; /* check for seek request */ if (state->seek) { state->seek = 0; if (gz_zero(state, state->skip) == -1) return 0; } /* for small len, copy to input buffer, otherwise compress directly */ if (len < state->size) { /* copy to input buffer, compress when full */ do { unsigned have, copy; if (state->strm.avail_in == 0) state->strm.next_in = state->in; have = (unsigned)((state->strm.next_in + state->strm.avail_in) - state->in); copy = state->size - have; if (copy > len) copy = len; memcpy(state->in + have, buf, copy); state->strm.avail_in += copy; state->x.pos += copy; buf = (const char *)buf + copy; len -= copy; if (len && gz_comp(state, Z_NO_FLUSH) == -1) return 0; } while (len); } else { /* consume whatever's left in the input buffer */ if (state->strm.avail_in && gz_comp(state, Z_NO_FLUSH) == -1) return 0; /* directly compress user buffer to file */ state->strm.next_in = (z_const Bytef *)buf; do { unsigned n = (unsigned)-1; if (n > len) n = len; state->strm.avail_in = n; state->x.pos += n; if (gz_comp(state, Z_NO_FLUSH) == -1) return 0; len -= n; } while (len); } /* input was all buffered or compressed */ return put; } /* -- see zlib.h -- */ int ZEXPORT gzwrite(file, buf, len) gzFile file; voidpc buf; unsigned len; { gz_statep state; /* get internal structure */ if (file == NULL) return 0; state = (gz_statep)file; /* check that we're writing and that there's no error */ if (state->mode != GZ_WRITE || state->err != Z_OK) return 0; /* since an int is returned, make sure len fits in one, otherwise return with an error (this avoids a flaw in the interface) */ if ((int)len < 0) { gz_error(state, Z_DATA_ERROR, "requested length does not fit in int"); return 0; } /* write len bytes from buf (the return value will fit in an int) */ return (int)gz_write(state, buf, len); } /* -- see zlib.h -- */ z_size_t ZEXPORT gzfwrite(buf, size, nitems, file) voidpc buf; z_size_t size; z_size_t nitems; gzFile file; { z_size_t len; gz_statep state; if (nitems == 0 || size == 0) return 0; /* get internal structure */ if (file == NULL) return 0; state = (gz_statep)file; /* check that we're writing and that there's no error */ if (state->mode != GZ_WRITE || state->err != Z_OK) return 0; /* compute bytes to read -- error on overflow */ len = nitems * size; if (size && len / size != nitems) { gz_error(state, Z_STREAM_ERROR, "request does not fit in a size_t"); return 0; } /* write len bytes to buf, return the number of full items written */ return len ? gz_write(state, buf, len) / size : 0; } /* -- see zlib.h -- */ int ZEXPORT gzputc(file, c) gzFile file; int c; { unsigned have; unsigned char buf[1]; gz_statep state; z_streamp strm; /* get internal structure */ if (file == NULL) return -1; state = (gz_statep)file; strm = &(state->strm); /* check that we're writing and that there's no error */ if (state->mode != GZ_WRITE || state->err != Z_OK) return -1; /* check for seek request */ if (state->seek) { state->seek = 0; if (gz_zero(state, state->skip) == -1) return -1; } /* try writing to input buffer for speed (state->size == 0 if buffer not initialized) */ if (state->size) { if (strm->avail_in == 0) strm->next_in = state->in; have = (unsigned)((strm->next_in + strm->avail_in) - state->in); if (have < state->size) { state->in[have] = (unsigned char)c; strm->avail_in++; state->x.pos++; return c & 0xff; } } /* no room in buffer or not initialized, use gz_write() */ buf[0] = (unsigned char)c; if (gz_write(state, buf, 1) != 1) return -1; return c & 0xff; } /* -- see zlib.h -- */ int ZEXPORT gzputs(file, str) gzFile file; const char *str; { int ret; z_size_t len; gz_statep state; /* get internal structure */ if (file == NULL) return -1; state = (gz_statep)file; /* check that we're writing and that there's no error */ if (state->mode != GZ_WRITE || state->err != Z_OK) return -1; /* write string */ len = strlen(str); ret = gz_write(state, str, len); return ret == 0 && len != 0 ? -1 : ret; } #if defined(STDC) || defined(Z_HAVE_STDARG_H) #include /* -- see zlib.h -- */ int ZEXPORTVA gzvprintf(gzFile file, const char *format, va_list va) { int len; unsigned left; char *next; gz_statep state; z_streamp strm; /* get internal structure */ if (file == NULL) return Z_STREAM_ERROR; state = (gz_statep)file; strm = &(state->strm); /* check that we're writing and that there's no error */ if (state->mode != GZ_WRITE || state->err != Z_OK) return Z_STREAM_ERROR; /* make sure we have some buffer space */ if (state->size == 0 && gz_init(state) == -1) return state->err; /* check for seek request */ if (state->seek) { state->seek = 0; if (gz_zero(state, state->skip) == -1) return state->err; } /* do the printf() into the input buffer, put length in len -- the input buffer is double-sized just for this function, so there is guaranteed to be state->size bytes available after the current contents */ if (strm->avail_in == 0) strm->next_in = state->in; next = (char *)(state->in + (strm->next_in - state->in) + strm->avail_in); next[state->size - 1] = 0; #ifdef NO_vsnprintf # ifdef HAS_vsprintf_void (void)vsprintf(next, format, va); for (len = 0; len < state->size; len++) if (next[len] == 0) break; # else len = vsprintf(next, format, va); # endif #else # ifdef HAS_vsnprintf_void (void)vsnprintf(next, state->size, format, va); len = strlen(next); # else len = vsnprintf(next, state->size, format, va); # endif #endif /* check that printf() results fit in buffer */ if (len == 0 || (unsigned)len >= state->size || next[state->size - 1] != 0) return 0; /* update buffer and position, compress first half if past that */ strm->avail_in += (unsigned)len; state->x.pos += len; if (strm->avail_in >= state->size) { left = strm->avail_in - state->size; strm->avail_in = state->size; if (gz_comp(state, Z_NO_FLUSH) == -1) return state->err; memcpy(state->in, state->in + state->size, left); strm->next_in = state->in; strm->avail_in = left; } return len; } int ZEXPORTVA gzprintf(gzFile file, const char *format, ...) { va_list va; int ret; va_start(va, format); ret = gzvprintf(file, format, va); va_end(va); return ret; } #else /* !STDC && !Z_HAVE_STDARG_H */ /* -- see zlib.h -- */ int ZEXPORTVA gzprintf (file, format, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20) gzFile file; const char *format; int a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20; { unsigned len, left; char *next; gz_statep state; z_streamp strm; /* get internal structure */ if (file == NULL) return Z_STREAM_ERROR; state = (gz_statep)file; strm = &(state->strm); /* check that can really pass pointer in ints */ if (sizeof(int) != sizeof(void *)) return Z_STREAM_ERROR; /* check that we're writing and that there's no error */ if (state->mode != GZ_WRITE || state->err != Z_OK) return Z_STREAM_ERROR; /* make sure we have some buffer space */ if (state->size == 0 && gz_init(state) == -1) return state->error; /* check for seek request */ if (state->seek) { state->seek = 0; if (gz_zero(state, state->skip) == -1) return state->error; } /* do the printf() into the input buffer, put length in len -- the input buffer is double-sized just for this function, so there is guaranteed to be state->size bytes available after the current contents */ if (strm->avail_in == 0) strm->next_in = state->in; next = (char *)(strm->next_in + strm->avail_in); next[state->size - 1] = 0; #ifdef NO_snprintf # ifdef HAS_sprintf_void sprintf(next, format, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20); for (len = 0; len < size; len++) if (next[len] == 0) break; # else len = sprintf(next, format, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20); # endif #else # ifdef HAS_snprintf_void snprintf(next, state->size, format, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20); len = strlen(next); # else len = snprintf(next, state->size, format, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20); # endif #endif /* check that printf() results fit in buffer */ if (len == 0 || len >= state->size || next[state->size - 1] != 0) return 0; /* update buffer and position, compress first half if past that */ strm->avail_in += len; state->x.pos += len; if (strm->avail_in >= state->size) { left = strm->avail_in - state->size; strm->avail_in = state->size; if (gz_comp(state, Z_NO_FLUSH) == -1) return state->err; memcpy(state->in, state->in + state->size, left); strm->next_in = state->in; strm->avail_in = left; } return (int)len; } #endif /* -- see zlib.h -- */ int ZEXPORT gzflush(file, flush) gzFile file; int flush; { gz_statep state; /* get internal structure */ if (file == NULL) return Z_STREAM_ERROR; state = (gz_statep)file; /* check that we're writing and that there's no error */ if (state->mode != GZ_WRITE || state->err != Z_OK) return Z_STREAM_ERROR; /* check flush parameter */ if (flush < 0 || flush > Z_FINISH) return Z_STREAM_ERROR; /* check for seek request */ if (state->seek) { state->seek = 0; if (gz_zero(state, state->skip) == -1) return state->err; } /* compress remaining data with requested flush */ (void)gz_comp(state, flush); return state->err; } /* -- see zlib.h -- */ int ZEXPORT gzsetparams(file, level, strategy) gzFile file; int level; int strategy; { gz_statep state; z_streamp strm; /* get internal structure */ if (file == NULL) return Z_STREAM_ERROR; state = (gz_statep)file; strm = &(state->strm); /* check that we're writing and that there's no error */ if (state->mode != GZ_WRITE || state->err != Z_OK) return Z_STREAM_ERROR; /* if no change is requested, then do nothing */ if (level == state->level && strategy == state->strategy) return Z_OK; /* check for seek request */ if (state->seek) { state->seek = 0; if (gz_zero(state, state->skip) == -1) return state->err; } /* change compression parameters for subsequent input */ if (state->size) { /* flush previous input with previous parameters before changing */ if (strm->avail_in && gz_comp(state, Z_BLOCK) == -1) return state->err; deflateParams(strm, level, strategy); } state->level = level; state->strategy = strategy; return Z_OK; } /* -- see zlib.h -- */ int ZEXPORT gzclose_w(file) gzFile file; { int ret = Z_OK; gz_statep state; /* get internal structure */ if (file == NULL) return Z_STREAM_ERROR; state = (gz_statep)file; /* check that we're writing */ if (state->mode != GZ_WRITE) return Z_STREAM_ERROR; /* check for seek request */ if (state->seek) { state->seek = 0; if (gz_zero(state, state->skip) == -1) ret = state->err; } /* flush, free memory, and close file */ if (gz_comp(state, Z_FINISH) == -1) ret = state->err; if (state->size) { if (!state->direct) { (void)deflateEnd(&(state->strm)); free(state->out); } free(state->in); } gz_error(state, Z_OK, NULL); free(state->path); if (close(state->fd) == -1) ret = Z_ERRNO; free(state); return ret; } UEFITool-A66/common/zlib/infback.c000077500000000000000000000543311442134156300170030ustar00rootroot00000000000000/* infback.c -- inflate using a call-back interface * Copyright (C) 1995-2016 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ /* This code is largely copied from inflate.c. Normally either infback.o or inflate.o would be linked into an application--not both. The interface with inffast.c is retained so that optimized assembler-coded versions of inflate_fast() can be used with either inflate.c or infback.c. */ #include "zutil.h" #include "inftrees.h" #include "inflate.h" #include "inffast.h" /* function prototypes */ local void fixedtables OF((struct inflate_state FAR *state)); /* strm provides memory allocation functions in zalloc and zfree, or Z_NULL to use the library memory allocation functions. windowBits is in the range 8..15, and window is a user-supplied window and output buffer that is 2**windowBits bytes. */ int ZEXPORT inflateBackInit_(strm, windowBits, window, version, stream_size) z_streamp strm; int windowBits; unsigned char FAR *window; const char *version; int stream_size; { struct inflate_state FAR *state; if (version == Z_NULL || version[0] != ZLIB_VERSION[0] || stream_size != (int)(sizeof(z_stream))) return Z_VERSION_ERROR; if (strm == Z_NULL || window == Z_NULL || windowBits < 8 || windowBits > 15) return Z_STREAM_ERROR; strm->msg = Z_NULL; /* in case we return an error */ if (strm->zalloc == (alloc_func)0) { #ifdef Z_SOLO return Z_STREAM_ERROR; #else strm->zalloc = zcalloc; strm->opaque = (voidpf)0; #endif } if (strm->zfree == (free_func)0) #ifdef Z_SOLO return Z_STREAM_ERROR; #else strm->zfree = zcfree; #endif state = (struct inflate_state FAR *)ZALLOC(strm, 1, sizeof(struct inflate_state)); if (state == Z_NULL) return Z_MEM_ERROR; Tracev((stderr, "inflate: allocated\n")); strm->state = (struct internal_state FAR *)state; state->dmax = 32768U; state->wbits = (uInt)windowBits; state->wsize = 1U << windowBits; state->window = window; state->wnext = 0; state->whave = 0; return Z_OK; } /* Return state with length and distance decoding tables and index sizes set to fixed code decoding. Normally this returns fixed tables from inffixed.h. If BUILDFIXED is defined, then instead this routine builds the tables the first time it's called, and returns those tables the first time and thereafter. This reduces the size of the code by about 2K bytes, in exchange for a little execution time. However, BUILDFIXED should not be used for threaded applications, since the rewriting of the tables and virgin may not be thread-safe. */ local void fixedtables(state) struct inflate_state FAR *state; { #ifdef BUILDFIXED static int virgin = 1; static code *lenfix, *distfix; static code fixed[544]; /* build fixed huffman tables if first call (may not be thread safe) */ if (virgin) { unsigned sym, bits; static code *next; /* literal/length table */ sym = 0; while (sym < 144) state->lens[sym++] = 8; while (sym < 256) state->lens[sym++] = 9; while (sym < 280) state->lens[sym++] = 7; while (sym < 288) state->lens[sym++] = 8; next = fixed; lenfix = next; bits = 9; inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work); /* distance table */ sym = 0; while (sym < 32) state->lens[sym++] = 5; distfix = next; bits = 5; inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work); /* do this just once */ virgin = 0; } #else /* !BUILDFIXED */ # include "inffixed.h" #endif /* BUILDFIXED */ state->lencode = lenfix; state->lenbits = 9; state->distcode = distfix; state->distbits = 5; } /* Macros for inflateBack(): */ /* Load returned state from inflate_fast() */ #define LOAD() \ do { \ put = strm->next_out; \ left = strm->avail_out; \ next = strm->next_in; \ have = strm->avail_in; \ hold = state->hold; \ bits = state->bits; \ } while (0) /* Set state from registers for inflate_fast() */ #define RESTORE() \ do { \ strm->next_out = put; \ strm->avail_out = left; \ strm->next_in = next; \ strm->avail_in = have; \ state->hold = hold; \ state->bits = bits; \ } while (0) /* Clear the input bit accumulator */ #define INITBITS() \ do { \ hold = 0; \ bits = 0; \ } while (0) /* Assure that some input is available. If input is requested, but denied, then return a Z_BUF_ERROR from inflateBack(). */ #define PULL() \ do { \ if (have == 0) { \ have = in(in_desc, &next); \ if (have == 0) { \ next = Z_NULL; \ ret = Z_BUF_ERROR; \ goto inf_leave; \ } \ } \ } while (0) /* Get a byte of input into the bit accumulator, or return from inflateBack() with an error if there is no input available. */ #define PULLBYTE() \ do { \ PULL(); \ have--; \ hold += (unsigned long)(*next++) << bits; \ bits += 8; \ } while (0) /* Assure that there are at least n bits in the bit accumulator. If there is not enough available input to do that, then return from inflateBack() with an error. */ #define NEEDBITS(n) \ do { \ while (bits < (unsigned)(n)) \ PULLBYTE(); \ } while (0) /* Return the low n bits of the bit accumulator (n < 16) */ #define BITS(n) \ ((unsigned)hold & ((1U << (n)) - 1)) /* Remove n bits from the bit accumulator */ #define DROPBITS(n) \ do { \ hold >>= (n); \ bits -= (unsigned)(n); \ } while (0) /* Remove zero to seven bits as needed to go to a byte boundary */ #define BYTEBITS() \ do { \ hold >>= bits & 7; \ bits -= bits & 7; \ } while (0) /* Assure that some output space is available, by writing out the window if it's full. If the write fails, return from inflateBack() with a Z_BUF_ERROR. */ #define ROOM() \ do { \ if (left == 0) { \ put = state->window; \ left = state->wsize; \ state->whave = left; \ if (out(out_desc, put, left)) { \ ret = Z_BUF_ERROR; \ goto inf_leave; \ } \ } \ } while (0) /* strm provides the memory allocation functions and window buffer on input, and provides information on the unused input on return. For Z_DATA_ERROR returns, strm will also provide an error message. in() and out() are the call-back input and output functions. When inflateBack() needs more input, it calls in(). When inflateBack() has filled the window with output, or when it completes with data in the window, it calls out() to write out the data. The application must not change the provided input until in() is called again or inflateBack() returns. The application must not change the window/output buffer until inflateBack() returns. in() and out() are called with a descriptor parameter provided in the inflateBack() call. This parameter can be a structure that provides the information required to do the read or write, as well as accumulated information on the input and output such as totals and check values. in() should return zero on failure. out() should return non-zero on failure. If either in() or out() fails, than inflateBack() returns a Z_BUF_ERROR. strm->next_in can be checked for Z_NULL to see whether it was in() or out() that caused in the error. Otherwise, inflateBack() returns Z_STREAM_END on success, Z_DATA_ERROR for an deflate format error, or Z_MEM_ERROR if it could not allocate memory for the state. inflateBack() can also return Z_STREAM_ERROR if the input parameters are not correct, i.e. strm is Z_NULL or the state was not initialized. */ int ZEXPORT inflateBack(strm, in, in_desc, out, out_desc) z_streamp strm; in_func in; void FAR *in_desc; out_func out; void FAR *out_desc; { struct inflate_state FAR *state; z_const unsigned char FAR *next; /* next input */ unsigned char FAR *put; /* next output */ unsigned have, left; /* available input and output */ unsigned long hold; /* bit buffer */ unsigned bits; /* bits in bit buffer */ unsigned copy; /* number of stored or match bytes to copy */ unsigned char FAR *from; /* where to copy match bytes from */ code here; /* current decoding table entry */ code last; /* parent table entry */ unsigned len; /* length to copy for repeats, bits to drop */ int ret; /* return code */ static const unsigned short order[19] = /* permutation of code lengths */ {16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15}; /* Check that the strm exists and that the state was initialized */ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR; state = (struct inflate_state FAR *)strm->state; /* Reset the state */ strm->msg = Z_NULL; state->mode = TYPE; state->last = 0; state->whave = 0; next = strm->next_in; have = next != Z_NULL ? strm->avail_in : 0; hold = 0; bits = 0; put = state->window; left = state->wsize; /* Inflate until end of block marked as last */ for (;;) switch (state->mode) { case TYPE: /* determine and dispatch block type */ if (state->last) { BYTEBITS(); state->mode = DONE; break; } NEEDBITS(3); state->last = BITS(1); DROPBITS(1); switch (BITS(2)) { case 0: /* stored block */ Tracev((stderr, "inflate: stored block%s\n", state->last ? " (last)" : "")); state->mode = STORED; break; case 1: /* fixed block */ fixedtables(state); Tracev((stderr, "inflate: fixed codes block%s\n", state->last ? " (last)" : "")); state->mode = LEN; /* decode codes */ break; case 2: /* dynamic block */ Tracev((stderr, "inflate: dynamic codes block%s\n", state->last ? " (last)" : "")); state->mode = TABLE; break; case 3: strm->msg = (char *)"invalid block type"; state->mode = BAD; } DROPBITS(2); break; case STORED: /* get and verify stored block length */ BYTEBITS(); /* go to byte boundary */ NEEDBITS(32); if ((hold & 0xffff) != ((hold >> 16) ^ 0xffff)) { strm->msg = (char *)"invalid stored block lengths"; state->mode = BAD; break; } state->length = (unsigned)hold & 0xffff; Tracev((stderr, "inflate: stored length %u\n", state->length)); INITBITS(); /* copy stored block from input to output */ while (state->length != 0) { copy = state->length; PULL(); ROOM(); if (copy > have) copy = have; if (copy > left) copy = left; zmemcpy(put, next, copy); have -= copy; next += copy; left -= copy; put += copy; state->length -= copy; } Tracev((stderr, "inflate: stored end\n")); state->mode = TYPE; break; case TABLE: /* get dynamic table entries descriptor */ NEEDBITS(14); state->nlen = BITS(5) + 257; DROPBITS(5); state->ndist = BITS(5) + 1; DROPBITS(5); state->ncode = BITS(4) + 4; DROPBITS(4); #ifndef PKZIP_BUG_WORKAROUND if (state->nlen > 286 || state->ndist > 30) { strm->msg = (char *)"too many length or distance symbols"; state->mode = BAD; break; } #endif Tracev((stderr, "inflate: table sizes ok\n")); /* get code length code lengths (not a typo) */ state->have = 0; while (state->have < state->ncode) { NEEDBITS(3); state->lens[order[state->have++]] = (unsigned short)BITS(3); DROPBITS(3); } while (state->have < 19) state->lens[order[state->have++]] = 0; state->next = state->codes; state->lencode = (code const FAR *)(state->next); state->lenbits = 7; ret = inflate_table(CODES, state->lens, 19, &(state->next), &(state->lenbits), state->work); if (ret) { strm->msg = (char *)"invalid code lengths set"; state->mode = BAD; break; } Tracev((stderr, "inflate: code lengths ok\n")); /* get length and distance code code lengths */ state->have = 0; while (state->have < state->nlen + state->ndist) { for (;;) { here = state->lencode[BITS(state->lenbits)]; if ((unsigned)(here.bits) <= bits) break; PULLBYTE(); } if (here.val < 16) { DROPBITS(here.bits); state->lens[state->have++] = here.val; } else { if (here.val == 16) { NEEDBITS(here.bits + 2); DROPBITS(here.bits); if (state->have == 0) { strm->msg = (char *)"invalid bit length repeat"; state->mode = BAD; break; } len = (unsigned)(state->lens[state->have - 1]); copy = 3 + BITS(2); DROPBITS(2); } else if (here.val == 17) { NEEDBITS(here.bits + 3); DROPBITS(here.bits); len = 0; copy = 3 + BITS(3); DROPBITS(3); } else { NEEDBITS(here.bits + 7); DROPBITS(here.bits); len = 0; copy = 11 + BITS(7); DROPBITS(7); } if (state->have + copy > state->nlen + state->ndist) { strm->msg = (char *)"invalid bit length repeat"; state->mode = BAD; break; } while (copy--) state->lens[state->have++] = (unsigned short)len; } } /* handle error breaks in while */ if (state->mode == BAD) break; /* check for end-of-block code (better have one) */ if (state->lens[256] == 0) { strm->msg = (char *)"invalid code -- missing end-of-block"; state->mode = BAD; break; } /* build code tables -- note: do not change the lenbits or distbits values here (9 and 6) without reading the comments in inftrees.h concerning the ENOUGH constants, which depend on those values */ state->next = state->codes; state->lencode = (code const FAR *)(state->next); state->lenbits = 9; ret = inflate_table(LENS, state->lens, state->nlen, &(state->next), &(state->lenbits), state->work); if (ret) { strm->msg = (char *)"invalid literal/lengths set"; state->mode = BAD; break; } state->distcode = (code const FAR *)(state->next); state->distbits = 6; ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist, &(state->next), &(state->distbits), state->work); if (ret) { strm->msg = (char *)"invalid distances set"; state->mode = BAD; break; } Tracev((stderr, "inflate: codes ok\n")); state->mode = LEN; /* FALLTHROUGH */ case LEN: /* use inflate_fast() if we have enough input and output */ if (have >= 6 && left >= 258) { RESTORE(); if (state->whave < state->wsize) state->whave = state->wsize - left; inflate_fast(strm, state->wsize); LOAD(); break; } /* get a literal, length, or end-of-block code */ for (;;) { here = state->lencode[BITS(state->lenbits)]; if ((unsigned)(here.bits) <= bits) break; PULLBYTE(); } if (here.op && (here.op & 0xf0) == 0) { last = here; for (;;) { here = state->lencode[last.val + (BITS(last.bits + last.op) >> last.bits)]; if ((unsigned)(last.bits + here.bits) <= bits) break; PULLBYTE(); } DROPBITS(last.bits); } DROPBITS(here.bits); state->length = (unsigned)here.val; /* process literal */ if (here.op == 0) { Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? "inflate: literal '%c'\n" : "inflate: literal 0x%02x\n", here.val)); ROOM(); *put++ = (unsigned char)(state->length); left--; state->mode = LEN; break; } /* process end of block */ if (here.op & 32) { Tracevv((stderr, "inflate: end of block\n")); state->mode = TYPE; break; } /* invalid code */ if (here.op & 64) { strm->msg = (char *)"invalid literal/length code"; state->mode = BAD; break; } /* length code -- get extra bits, if any */ state->extra = (unsigned)(here.op) & 15; if (state->extra != 0) { NEEDBITS(state->extra); state->length += BITS(state->extra); DROPBITS(state->extra); } Tracevv((stderr, "inflate: length %u\n", state->length)); /* get distance code */ for (;;) { here = state->distcode[BITS(state->distbits)]; if ((unsigned)(here.bits) <= bits) break; PULLBYTE(); } if ((here.op & 0xf0) == 0) { last = here; for (;;) { here = state->distcode[last.val + (BITS(last.bits + last.op) >> last.bits)]; if ((unsigned)(last.bits + here.bits) <= bits) break; PULLBYTE(); } DROPBITS(last.bits); } DROPBITS(here.bits); if (here.op & 64) { strm->msg = (char *)"invalid distance code"; state->mode = BAD; break; } state->offset = (unsigned)here.val; /* get distance extra bits, if any */ state->extra = (unsigned)(here.op) & 15; if (state->extra != 0) { NEEDBITS(state->extra); state->offset += BITS(state->extra); DROPBITS(state->extra); } if (state->offset > state->wsize - (state->whave < state->wsize ? left : 0)) { strm->msg = (char *)"invalid distance too far back"; state->mode = BAD; break; } Tracevv((stderr, "inflate: distance %u\n", state->offset)); /* copy match from window to output */ do { ROOM(); copy = state->wsize - state->offset; if (copy < left) { from = put + copy; copy = left - copy; } else { from = put - state->offset; copy = left; } if (copy > state->length) copy = state->length; state->length -= copy; left -= copy; do { *put++ = *from++; } while (--copy); } while (state->length != 0); break; case DONE: /* inflate stream terminated properly -- write leftover output */ ret = Z_STREAM_END; if (left < state->wsize) { if (out(out_desc, state->window, state->wsize - left)) ret = Z_BUF_ERROR; } goto inf_leave; case BAD: ret = Z_DATA_ERROR; goto inf_leave; default: /* can't happen, but makes compilers happy */ ret = Z_STREAM_ERROR; goto inf_leave; } /* Return unused input */ inf_leave: strm->next_in = next; strm->avail_in = have; return ret; } int ZEXPORT inflateBackEnd(strm) z_streamp strm; { if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == (free_func)0) return Z_STREAM_ERROR; ZFREE(strm, strm->state); strm->state = Z_NULL; Tracev((stderr, "inflate: end\n")); return Z_OK; } UEFITool-A66/common/zlib/inffast.c000077500000000000000000000312621442134156300170360ustar00rootroot00000000000000/* inffast.c -- fast decoding * Copyright (C) 1995-2017 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ #include "zutil.h" #include "inftrees.h" #include "inflate.h" #include "inffast.h" #ifdef ASMINF # pragma message("Assembler code may have bugs -- use at your own risk") #else /* Decode literal, length, and distance codes and write out the resulting literal and match bytes until either not enough input or output is available, an end-of-block is encountered, or a data error is encountered. When large enough input and output buffers are supplied to inflate(), for example, a 16K input buffer and a 64K output buffer, more than 95% of the inflate execution time is spent in this routine. Entry assumptions: state->mode == LEN strm->avail_in >= 6 strm->avail_out >= 258 start >= strm->avail_out state->bits < 8 On return, state->mode is one of: LEN -- ran out of enough output space or enough available input TYPE -- reached end of block code, inflate() to interpret next block BAD -- error in block data Notes: - The maximum input bits used by a length/distance pair is 15 bits for the length code, 5 bits for the length extra, 15 bits for the distance code, and 13 bits for the distance extra. This totals 48 bits, or six bytes. Therefore if strm->avail_in >= 6, then there is enough input to avoid checking for available input while decoding. - The maximum bytes that a single length/distance pair can output is 258 bytes, which is the maximum length that can be coded. inflate_fast() requires strm->avail_out >= 258 for each loop to avoid checking for output space. */ void ZLIB_INTERNAL inflate_fast(strm, start) z_streamp strm; unsigned start; /* inflate()'s starting value for strm->avail_out */ { struct inflate_state FAR *state; z_const unsigned char FAR *in; /* local strm->next_in */ z_const unsigned char FAR *last; /* have enough input while in < last */ unsigned char FAR *out; /* local strm->next_out */ unsigned char FAR *beg; /* inflate()'s initial strm->next_out */ unsigned char FAR *end; /* while out < end, enough space available */ #ifdef INFLATE_STRICT unsigned dmax; /* maximum distance from zlib header */ #endif unsigned wsize; /* window size or zero if not using window */ unsigned whave; /* valid bytes in the window */ unsigned wnext; /* window write index */ unsigned char FAR *window; /* allocated sliding window, if wsize != 0 */ unsigned long hold; /* local strm->hold */ unsigned bits; /* local strm->bits */ code const FAR *lcode; /* local strm->lencode */ code const FAR *dcode; /* local strm->distcode */ unsigned lmask; /* mask for first level of length codes */ unsigned dmask; /* mask for first level of distance codes */ code here; /* retrieved table entry */ unsigned op; /* code bits, operation, extra bits, or */ /* window position, window bytes to copy */ unsigned len; /* match length, unused bytes */ unsigned dist; /* match distance */ unsigned char FAR *from; /* where to copy match from */ /* copy state to local variables */ state = (struct inflate_state FAR *)strm->state; in = strm->next_in; last = in + (strm->avail_in - 5); out = strm->next_out; beg = out - (start - strm->avail_out); end = out + (strm->avail_out - 257); #ifdef INFLATE_STRICT dmax = state->dmax; #endif wsize = state->wsize; whave = state->whave; wnext = state->wnext; window = state->window; hold = state->hold; bits = state->bits; lcode = state->lencode; dcode = state->distcode; lmask = (1U << state->lenbits) - 1; dmask = (1U << state->distbits) - 1; /* decode literals and length/distances until end-of-block or not enough input data or output space */ do { if (bits < 15) { hold += (unsigned long)(*in++) << bits; bits += 8; hold += (unsigned long)(*in++) << bits; bits += 8; } here = lcode[hold & lmask]; dolen: op = (unsigned)(here.bits); hold >>= op; bits -= op; op = (unsigned)(here.op); if (op == 0) { /* literal */ Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? "inflate: literal '%c'\n" : "inflate: literal 0x%02x\n", here.val)); *out++ = (unsigned char)(here.val); } else if (op & 16) { /* length base */ len = (unsigned)(here.val); op &= 15; /* number of extra bits */ if (op) { if (bits < op) { hold += (unsigned long)(*in++) << bits; bits += 8; } len += (unsigned)hold & ((1U << op) - 1); hold >>= op; bits -= op; } Tracevv((stderr, "inflate: length %u\n", len)); if (bits < 15) { hold += (unsigned long)(*in++) << bits; bits += 8; hold += (unsigned long)(*in++) << bits; bits += 8; } here = dcode[hold & dmask]; dodist: op = (unsigned)(here.bits); hold >>= op; bits -= op; op = (unsigned)(here.op); if (op & 16) { /* distance base */ dist = (unsigned)(here.val); op &= 15; /* number of extra bits */ if (bits < op) { hold += (unsigned long)(*in++) << bits; bits += 8; if (bits < op) { hold += (unsigned long)(*in++) << bits; bits += 8; } } dist += (unsigned)hold & ((1U << op) - 1); #ifdef INFLATE_STRICT if (dist > dmax) { strm->msg = (char *)"invalid distance too far back"; state->mode = BAD; break; } #endif hold >>= op; bits -= op; Tracevv((stderr, "inflate: distance %u\n", dist)); op = (unsigned)(out - beg); /* max distance in output */ if (dist > op) { /* see if copy from window */ op = dist - op; /* distance back in window */ if (op > whave) { if (state->sane) { strm->msg = (char *)"invalid distance too far back"; state->mode = BAD; break; } #ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR if (len <= op - whave) { do { *out++ = 0; } while (--len); continue; } len -= op - whave; do { *out++ = 0; } while (--op > whave); if (op == 0) { from = out - dist; do { *out++ = *from++; } while (--len); continue; } #endif } from = window; if (wnext == 0) { /* very common case */ from += wsize - op; if (op < len) { /* some from window */ len -= op; do { *out++ = *from++; } while (--op); from = out - dist; /* rest from output */ } } else if (wnext < op) { /* wrap around window */ from += wsize + wnext - op; op -= wnext; if (op < len) { /* some from end of window */ len -= op; do { *out++ = *from++; } while (--op); from = window; if (wnext < len) { /* some from start of window */ op = wnext; len -= op; do { *out++ = *from++; } while (--op); from = out - dist; /* rest from output */ } } } else { /* contiguous in window */ from += wnext - op; if (op < len) { /* some from window */ len -= op; do { *out++ = *from++; } while (--op); from = out - dist; /* rest from output */ } } while (len > 2) { *out++ = *from++; *out++ = *from++; *out++ = *from++; len -= 3; } if (len) { *out++ = *from++; if (len > 1) *out++ = *from++; } } else { from = out - dist; /* copy direct from output */ do { /* minimum length is three */ *out++ = *from++; *out++ = *from++; *out++ = *from++; len -= 3; } while (len > 2); if (len) { *out++ = *from++; if (len > 1) *out++ = *from++; } } } else if ((op & 64) == 0) { /* 2nd level distance code */ here = dcode[here.val + (hold & ((1U << op) - 1))]; goto dodist; } else { strm->msg = (char *)"invalid distance code"; state->mode = BAD; break; } } else if ((op & 64) == 0) { /* 2nd level length code */ here = lcode[here.val + (hold & ((1U << op) - 1))]; goto dolen; } else if (op & 32) { /* end-of-block */ Tracevv((stderr, "inflate: end of block\n")); state->mode = TYPE; break; } else { strm->msg = (char *)"invalid literal/length code"; state->mode = BAD; break; } } while (in < last && out < end); /* return unused bytes (on entry, bits < 8, so in won't go too far back) */ len = bits >> 3; in -= len; bits -= len << 3; hold &= (1U << bits) - 1; /* update state and return */ strm->next_in = in; strm->next_out = out; strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last)); strm->avail_out = (unsigned)(out < end ? 257 + (end - out) : 257 - (out - end)); state->hold = hold; state->bits = bits; return; } /* inflate_fast() speedups that turned out slower (on a PowerPC G3 750CXe): - Using bit fields for code structure - Different op definition to avoid & for extra bits (do & for table bits) - Three separate decoding do-loops for direct, window, and wnext == 0 - Special case for distance > 1 copies to do overlapped load and store copy - Explicit branch predictions (based on measured branch probabilities) - Deferring match copy and interspersed it with decoding subsequent codes - Swapping literal/length else - Swapping window/direct else - Larger unrolled copy loops (three is about right) - Moving len -= 3 statement into middle of loop */ #endif /* !ASMINF */ UEFITool-A66/common/zlib/inffast.h000077500000000000000000000006531442134156300170430ustar00rootroot00000000000000/* inffast.h -- header to use inffast.c * Copyright (C) 1995-2003, 2010 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ /* WARNING: this file should *not* be used by applications. It is part of the implementation of the compression library and is subject to change. Applications should only use zlib.h. */ void ZLIB_INTERNAL inflate_fast OF((z_streamp strm, unsigned start)); UEFITool-A66/common/zlib/inffixed.h000077500000000000000000000142741442134156300172110ustar00rootroot00000000000000 /* inffixed.h -- table for decoding fixed codes * Generated automatically by makefixed(). */ /* WARNING: this file should *not* be used by applications. It is part of the implementation of this library and is subject to change. Applications should only use zlib.h. */ static const code lenfix[512] = { {96,7,0},{0,8,80},{0,8,16},{20,8,115},{18,7,31},{0,8,112},{0,8,48}, {0,9,192},{16,7,10},{0,8,96},{0,8,32},{0,9,160},{0,8,0},{0,8,128}, {0,8,64},{0,9,224},{16,7,6},{0,8,88},{0,8,24},{0,9,144},{19,7,59}, {0,8,120},{0,8,56},{0,9,208},{17,7,17},{0,8,104},{0,8,40},{0,9,176}, {0,8,8},{0,8,136},{0,8,72},{0,9,240},{16,7,4},{0,8,84},{0,8,20}, {21,8,227},{19,7,43},{0,8,116},{0,8,52},{0,9,200},{17,7,13},{0,8,100}, {0,8,36},{0,9,168},{0,8,4},{0,8,132},{0,8,68},{0,9,232},{16,7,8}, {0,8,92},{0,8,28},{0,9,152},{20,7,83},{0,8,124},{0,8,60},{0,9,216}, {18,7,23},{0,8,108},{0,8,44},{0,9,184},{0,8,12},{0,8,140},{0,8,76}, {0,9,248},{16,7,3},{0,8,82},{0,8,18},{21,8,163},{19,7,35},{0,8,114}, {0,8,50},{0,9,196},{17,7,11},{0,8,98},{0,8,34},{0,9,164},{0,8,2}, {0,8,130},{0,8,66},{0,9,228},{16,7,7},{0,8,90},{0,8,26},{0,9,148}, {20,7,67},{0,8,122},{0,8,58},{0,9,212},{18,7,19},{0,8,106},{0,8,42}, {0,9,180},{0,8,10},{0,8,138},{0,8,74},{0,9,244},{16,7,5},{0,8,86}, {0,8,22},{64,8,0},{19,7,51},{0,8,118},{0,8,54},{0,9,204},{17,7,15}, {0,8,102},{0,8,38},{0,9,172},{0,8,6},{0,8,134},{0,8,70},{0,9,236}, {16,7,9},{0,8,94},{0,8,30},{0,9,156},{20,7,99},{0,8,126},{0,8,62}, {0,9,220},{18,7,27},{0,8,110},{0,8,46},{0,9,188},{0,8,14},{0,8,142}, {0,8,78},{0,9,252},{96,7,0},{0,8,81},{0,8,17},{21,8,131},{18,7,31}, {0,8,113},{0,8,49},{0,9,194},{16,7,10},{0,8,97},{0,8,33},{0,9,162}, {0,8,1},{0,8,129},{0,8,65},{0,9,226},{16,7,6},{0,8,89},{0,8,25}, {0,9,146},{19,7,59},{0,8,121},{0,8,57},{0,9,210},{17,7,17},{0,8,105}, {0,8,41},{0,9,178},{0,8,9},{0,8,137},{0,8,73},{0,9,242},{16,7,4}, {0,8,85},{0,8,21},{16,8,258},{19,7,43},{0,8,117},{0,8,53},{0,9,202}, {17,7,13},{0,8,101},{0,8,37},{0,9,170},{0,8,5},{0,8,133},{0,8,69}, {0,9,234},{16,7,8},{0,8,93},{0,8,29},{0,9,154},{20,7,83},{0,8,125}, {0,8,61},{0,9,218},{18,7,23},{0,8,109},{0,8,45},{0,9,186},{0,8,13}, {0,8,141},{0,8,77},{0,9,250},{16,7,3},{0,8,83},{0,8,19},{21,8,195}, {19,7,35},{0,8,115},{0,8,51},{0,9,198},{17,7,11},{0,8,99},{0,8,35}, {0,9,166},{0,8,3},{0,8,131},{0,8,67},{0,9,230},{16,7,7},{0,8,91}, {0,8,27},{0,9,150},{20,7,67},{0,8,123},{0,8,59},{0,9,214},{18,7,19}, {0,8,107},{0,8,43},{0,9,182},{0,8,11},{0,8,139},{0,8,75},{0,9,246}, {16,7,5},{0,8,87},{0,8,23},{64,8,0},{19,7,51},{0,8,119},{0,8,55}, {0,9,206},{17,7,15},{0,8,103},{0,8,39},{0,9,174},{0,8,7},{0,8,135}, {0,8,71},{0,9,238},{16,7,9},{0,8,95},{0,8,31},{0,9,158},{20,7,99}, {0,8,127},{0,8,63},{0,9,222},{18,7,27},{0,8,111},{0,8,47},{0,9,190}, {0,8,15},{0,8,143},{0,8,79},{0,9,254},{96,7,0},{0,8,80},{0,8,16}, {20,8,115},{18,7,31},{0,8,112},{0,8,48},{0,9,193},{16,7,10},{0,8,96}, {0,8,32},{0,9,161},{0,8,0},{0,8,128},{0,8,64},{0,9,225},{16,7,6}, {0,8,88},{0,8,24},{0,9,145},{19,7,59},{0,8,120},{0,8,56},{0,9,209}, {17,7,17},{0,8,104},{0,8,40},{0,9,177},{0,8,8},{0,8,136},{0,8,72}, {0,9,241},{16,7,4},{0,8,84},{0,8,20},{21,8,227},{19,7,43},{0,8,116}, {0,8,52},{0,9,201},{17,7,13},{0,8,100},{0,8,36},{0,9,169},{0,8,4}, {0,8,132},{0,8,68},{0,9,233},{16,7,8},{0,8,92},{0,8,28},{0,9,153}, {20,7,83},{0,8,124},{0,8,60},{0,9,217},{18,7,23},{0,8,108},{0,8,44}, {0,9,185},{0,8,12},{0,8,140},{0,8,76},{0,9,249},{16,7,3},{0,8,82}, {0,8,18},{21,8,163},{19,7,35},{0,8,114},{0,8,50},{0,9,197},{17,7,11}, {0,8,98},{0,8,34},{0,9,165},{0,8,2},{0,8,130},{0,8,66},{0,9,229}, {16,7,7},{0,8,90},{0,8,26},{0,9,149},{20,7,67},{0,8,122},{0,8,58}, {0,9,213},{18,7,19},{0,8,106},{0,8,42},{0,9,181},{0,8,10},{0,8,138}, {0,8,74},{0,9,245},{16,7,5},{0,8,86},{0,8,22},{64,8,0},{19,7,51}, {0,8,118},{0,8,54},{0,9,205},{17,7,15},{0,8,102},{0,8,38},{0,9,173}, {0,8,6},{0,8,134},{0,8,70},{0,9,237},{16,7,9},{0,8,94},{0,8,30}, {0,9,157},{20,7,99},{0,8,126},{0,8,62},{0,9,221},{18,7,27},{0,8,110}, {0,8,46},{0,9,189},{0,8,14},{0,8,142},{0,8,78},{0,9,253},{96,7,0}, {0,8,81},{0,8,17},{21,8,131},{18,7,31},{0,8,113},{0,8,49},{0,9,195}, {16,7,10},{0,8,97},{0,8,33},{0,9,163},{0,8,1},{0,8,129},{0,8,65}, {0,9,227},{16,7,6},{0,8,89},{0,8,25},{0,9,147},{19,7,59},{0,8,121}, {0,8,57},{0,9,211},{17,7,17},{0,8,105},{0,8,41},{0,9,179},{0,8,9}, {0,8,137},{0,8,73},{0,9,243},{16,7,4},{0,8,85},{0,8,21},{16,8,258}, {19,7,43},{0,8,117},{0,8,53},{0,9,203},{17,7,13},{0,8,101},{0,8,37}, {0,9,171},{0,8,5},{0,8,133},{0,8,69},{0,9,235},{16,7,8},{0,8,93}, {0,8,29},{0,9,155},{20,7,83},{0,8,125},{0,8,61},{0,9,219},{18,7,23}, {0,8,109},{0,8,45},{0,9,187},{0,8,13},{0,8,141},{0,8,77},{0,9,251}, {16,7,3},{0,8,83},{0,8,19},{21,8,195},{19,7,35},{0,8,115},{0,8,51}, {0,9,199},{17,7,11},{0,8,99},{0,8,35},{0,9,167},{0,8,3},{0,8,131}, {0,8,67},{0,9,231},{16,7,7},{0,8,91},{0,8,27},{0,9,151},{20,7,67}, {0,8,123},{0,8,59},{0,9,215},{18,7,19},{0,8,107},{0,8,43},{0,9,183}, {0,8,11},{0,8,139},{0,8,75},{0,9,247},{16,7,5},{0,8,87},{0,8,23}, {64,8,0},{19,7,51},{0,8,119},{0,8,55},{0,9,207},{17,7,15},{0,8,103}, {0,8,39},{0,9,175},{0,8,7},{0,8,135},{0,8,71},{0,9,239},{16,7,9}, {0,8,95},{0,8,31},{0,9,159},{20,7,99},{0,8,127},{0,8,63},{0,9,223}, {18,7,27},{0,8,111},{0,8,47},{0,9,191},{0,8,15},{0,8,143},{0,8,79}, {0,9,255} }; static const code distfix[32] = { {16,5,1},{23,5,257},{19,5,17},{27,5,4097},{17,5,5},{25,5,1025}, {21,5,65},{29,5,16385},{16,5,3},{24,5,513},{20,5,33},{28,5,8193}, {18,5,9},{26,5,2049},{22,5,129},{64,5,0},{16,5,2},{23,5,385}, {19,5,25},{27,5,6145},{17,5,7},{25,5,1537},{21,5,97},{29,5,24577}, {16,5,4},{24,5,769},{20,5,49},{28,5,12289},{18,5,13},{26,5,3073}, {22,5,193},{64,5,0} }; UEFITool-A66/common/zlib/inflate.c000077500000000000000000001542601442134156300170320ustar00rootroot00000000000000/* inflate.c -- zlib decompression * Copyright (C) 1995-2016 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ /* * Change history: * * 1.2.beta0 24 Nov 2002 * - First version -- complete rewrite of inflate to simplify code, avoid * creation of window when not needed, minimize use of window when it is * needed, make inffast.c even faster, implement gzip decoding, and to * improve code readability and style over the previous zlib inflate code * * 1.2.beta1 25 Nov 2002 * - Use pointers for available input and output checking in inffast.c * - Remove input and output counters in inffast.c * - Change inffast.c entry and loop from avail_in >= 7 to >= 6 * - Remove unnecessary second byte pull from length extra in inffast.c * - Unroll direct copy to three copies per loop in inffast.c * * 1.2.beta2 4 Dec 2002 * - Change external routine names to reduce potential conflicts * - Correct filename to inffixed.h for fixed tables in inflate.c * - Make hbuf[] unsigned char to match parameter type in inflate.c * - Change strm->next_out[-state->offset] to *(strm->next_out - state->offset) * to avoid negation problem on Alphas (64 bit) in inflate.c * * 1.2.beta3 22 Dec 2002 * - Add comments on state->bits assertion in inffast.c * - Add comments on op field in inftrees.h * - Fix bug in reuse of allocated window after inflateReset() * - Remove bit fields--back to byte structure for speed * - Remove distance extra == 0 check in inflate_fast()--only helps for lengths * - Change post-increments to pre-increments in inflate_fast(), PPC biased? * - Add compile time option, POSTINC, to use post-increments instead (Intel?) * - Make MATCH copy in inflate() much faster for when inflate_fast() not used * - Use local copies of stream next and avail values, as well as local bit * buffer and bit count in inflate()--for speed when inflate_fast() not used * * 1.2.beta4 1 Jan 2003 * - Split ptr - 257 statements in inflate_table() to avoid compiler warnings * - Move a comment on output buffer sizes from inffast.c to inflate.c * - Add comments in inffast.c to introduce the inflate_fast() routine * - Rearrange window copies in inflate_fast() for speed and simplification * - Unroll last copy for window match in inflate_fast() * - Use local copies of window variables in inflate_fast() for speed * - Pull out common wnext == 0 case for speed in inflate_fast() * - Make op and len in inflate_fast() unsigned for consistency * - Add FAR to lcode and dcode declarations in inflate_fast() * - Simplified bad distance check in inflate_fast() * - Added inflateBackInit(), inflateBack(), and inflateBackEnd() in new * source file infback.c to provide a call-back interface to inflate for * programs like gzip and unzip -- uses window as output buffer to avoid * window copying * * 1.2.beta5 1 Jan 2003 * - Improved inflateBack() interface to allow the caller to provide initial * input in strm. * - Fixed stored blocks bug in inflateBack() * * 1.2.beta6 4 Jan 2003 * - Added comments in inffast.c on effectiveness of POSTINC * - Typecasting all around to reduce compiler warnings * - Changed loops from while (1) or do {} while (1) to for (;;), again to * make compilers happy * - Changed type of window in inflateBackInit() to unsigned char * * * 1.2.beta7 27 Jan 2003 * - Changed many types to unsigned or unsigned short to avoid warnings * - Added inflateCopy() function * * 1.2.0 9 Mar 2003 * - Changed inflateBack() interface to provide separate opaque descriptors * for the in() and out() functions * - Changed inflateBack() argument and in_func typedef to swap the length * and buffer address return values for the input function * - Check next_in and next_out for Z_NULL on entry to inflate() * * The history for versions after 1.2.0 are in ChangeLog in zlib distribution. */ #include "zutil.h" #include "inftrees.h" #include "inflate.h" #include "inffast.h" #ifdef MAKEFIXED # ifndef BUILDFIXED # define BUILDFIXED # endif #endif /* function prototypes */ local int inflateStateCheck OF((z_streamp strm)); local void fixedtables OF((struct inflate_state FAR *state)); local int updatewindow OF((z_streamp strm, const unsigned char FAR *end, unsigned copy)); #ifdef BUILDFIXED void makefixed OF((void)); #endif local unsigned syncsearch OF((unsigned FAR *have, const unsigned char FAR *buf, unsigned len)); local int inflateStateCheck(strm) z_streamp strm; { struct inflate_state FAR *state; if (strm == Z_NULL || strm->zalloc == (alloc_func)0 || strm->zfree == (free_func)0) return 1; state = (struct inflate_state FAR *)strm->state; if (state == Z_NULL || state->strm != strm || state->mode < HEAD || state->mode > SYNC) return 1; return 0; } int ZEXPORT inflateResetKeep(strm) z_streamp strm; { struct inflate_state FAR *state; if (inflateStateCheck(strm)) return Z_STREAM_ERROR; state = (struct inflate_state FAR *)strm->state; strm->total_in = strm->total_out = state->total = 0; strm->msg = Z_NULL; if (state->wrap) /* to support ill-conceived Java test suite */ strm->adler = state->wrap & 1; state->mode = HEAD; state->last = 0; state->havedict = 0; state->dmax = 32768U; state->head = Z_NULL; state->hold = 0; state->bits = 0; state->lencode = state->distcode = state->next = state->codes; state->sane = 1; state->back = -1; Tracev((stderr, "inflate: reset\n")); return Z_OK; } int ZEXPORT inflateReset(strm) z_streamp strm; { struct inflate_state FAR *state; if (inflateStateCheck(strm)) return Z_STREAM_ERROR; state = (struct inflate_state FAR *)strm->state; state->wsize = 0; state->whave = 0; state->wnext = 0; return inflateResetKeep(strm); } int ZEXPORT inflateReset2(strm, windowBits) z_streamp strm; int windowBits; { int wrap; struct inflate_state FAR *state; /* get the state */ if (inflateStateCheck(strm)) return Z_STREAM_ERROR; state = (struct inflate_state FAR *)strm->state; /* extract wrap request from windowBits parameter */ if (windowBits < 0) { wrap = 0; windowBits = -windowBits; } else { wrap = (windowBits >> 4) + 5; #ifdef GUNZIP if (windowBits < 48) windowBits &= 15; #endif } /* set number of window bits, free window if different */ if (windowBits && (windowBits < 8 || windowBits > 15)) return Z_STREAM_ERROR; if (state->window != Z_NULL && state->wbits != (unsigned)windowBits) { ZFREE(strm, state->window); state->window = Z_NULL; } /* update state and reset the rest of it */ state->wrap = wrap; state->wbits = (unsigned)windowBits; return inflateReset(strm); } int ZEXPORT inflateInit2_(strm, windowBits, version, stream_size) z_streamp strm; int windowBits; const char *version; int stream_size; { int ret; struct inflate_state FAR *state; if (version == Z_NULL || version[0] != ZLIB_VERSION[0] || stream_size != (int)(sizeof(z_stream))) return Z_VERSION_ERROR; if (strm == Z_NULL) return Z_STREAM_ERROR; strm->msg = Z_NULL; /* in case we return an error */ if (strm->zalloc == (alloc_func)0) { #ifdef Z_SOLO return Z_STREAM_ERROR; #else strm->zalloc = zcalloc; strm->opaque = (voidpf)0; #endif } if (strm->zfree == (free_func)0) #ifdef Z_SOLO return Z_STREAM_ERROR; #else strm->zfree = zcfree; #endif state = (struct inflate_state FAR *) ZALLOC(strm, 1, sizeof(struct inflate_state)); if (state == Z_NULL) return Z_MEM_ERROR; Tracev((stderr, "inflate: allocated\n")); strm->state = (struct internal_state FAR *)state; state->strm = strm; state->window = Z_NULL; state->mode = HEAD; /* to pass state test in inflateReset2() */ ret = inflateReset2(strm, windowBits); if (ret != Z_OK) { ZFREE(strm, state); strm->state = Z_NULL; } return ret; } int ZEXPORT inflateInit_(strm, version, stream_size) z_streamp strm; const char *version; int stream_size; { return inflateInit2_(strm, DEF_WBITS, version, stream_size); } int ZEXPORT inflatePrime(strm, bits, value) z_streamp strm; int bits; int value; { struct inflate_state FAR *state; if (inflateStateCheck(strm)) return Z_STREAM_ERROR; state = (struct inflate_state FAR *)strm->state; if (bits < 0) { state->hold = 0; state->bits = 0; return Z_OK; } if (bits > 16 || state->bits + (uInt)bits > 32) return Z_STREAM_ERROR; value &= (1L << bits) - 1; state->hold += (unsigned)value << state->bits; state->bits += (uInt)bits; return Z_OK; } /* Return state with length and distance decoding tables and index sizes set to fixed code decoding. Normally this returns fixed tables from inffixed.h. If BUILDFIXED is defined, then instead this routine builds the tables the first time it's called, and returns those tables the first time and thereafter. This reduces the size of the code by about 2K bytes, in exchange for a little execution time. However, BUILDFIXED should not be used for threaded applications, since the rewriting of the tables and virgin may not be thread-safe. */ local void fixedtables(state) struct inflate_state FAR *state; { #ifdef BUILDFIXED static int virgin = 1; static code *lenfix, *distfix; static code fixed[544]; /* build fixed huffman tables if first call (may not be thread safe) */ if (virgin) { unsigned sym, bits; static code *next; /* literal/length table */ sym = 0; while (sym < 144) state->lens[sym++] = 8; while (sym < 256) state->lens[sym++] = 9; while (sym < 280) state->lens[sym++] = 7; while (sym < 288) state->lens[sym++] = 8; next = fixed; lenfix = next; bits = 9; inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work); /* distance table */ sym = 0; while (sym < 32) state->lens[sym++] = 5; distfix = next; bits = 5; inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work); /* do this just once */ virgin = 0; } #else /* !BUILDFIXED */ # include "inffixed.h" #endif /* BUILDFIXED */ state->lencode = lenfix; state->lenbits = 9; state->distcode = distfix; state->distbits = 5; } #ifdef MAKEFIXED #include /* Write out the inffixed.h that is #include'd above. Defining MAKEFIXED also defines BUILDFIXED, so the tables are built on the fly. makefixed() writes those tables to stdout, which would be piped to inffixed.h. A small program can simply call makefixed to do this: void makefixed(void); int main(void) { makefixed(); return 0; } Then that can be linked with zlib built with MAKEFIXED defined and run: a.out > inffixed.h */ void makefixed() { unsigned low, size; struct inflate_state state; fixedtables(&state); puts(" /* inffixed.h -- table for decoding fixed codes"); puts(" * Generated automatically by makefixed()."); puts(" */"); puts(""); puts(" /* WARNING: this file should *not* be used by applications."); puts(" It is part of the implementation of this library and is"); puts(" subject to change. Applications should only use zlib.h."); puts(" */"); puts(""); size = 1U << 9; printf(" static const code lenfix[%u] = {", size); low = 0; for (;;) { if ((low % 7) == 0) printf("\n "); printf("{%u,%u,%d}", (low & 127) == 99 ? 64 : state.lencode[low].op, state.lencode[low].bits, state.lencode[low].val); if (++low == size) break; putchar(','); } puts("\n };"); size = 1U << 5; printf("\n static const code distfix[%u] = {", size); low = 0; for (;;) { if ((low % 6) == 0) printf("\n "); printf("{%u,%u,%d}", state.distcode[low].op, state.distcode[low].bits, state.distcode[low].val); if (++low == size) break; putchar(','); } puts("\n };"); } #endif /* MAKEFIXED */ /* Update the window with the last wsize (normally 32K) bytes written before returning. If window does not exist yet, create it. This is only called when a window is already in use, or when output has been written during this inflate call, but the end of the deflate stream has not been reached yet. It is also called to create a window for dictionary data when a dictionary is loaded. Providing output buffers larger than 32K to inflate() should provide a speed advantage, since only the last 32K of output is copied to the sliding window upon return from inflate(), and since all distances after the first 32K of output will fall in the output data, making match copies simpler and faster. The advantage may be dependent on the size of the processor's data caches. */ local int updatewindow(strm, end, copy) z_streamp strm; const Bytef *end; unsigned copy; { struct inflate_state FAR *state; unsigned dist; state = (struct inflate_state FAR *)strm->state; /* if it hasn't been done already, allocate space for the window */ if (state->window == Z_NULL) { state->window = (unsigned char FAR *) ZALLOC(strm, 1U << state->wbits, sizeof(unsigned char)); if (state->window == Z_NULL) return 1; } /* if window not in use yet, initialize */ if (state->wsize == 0) { state->wsize = 1U << state->wbits; state->wnext = 0; state->whave = 0; } /* copy state->wsize or less output bytes into the circular window */ if (copy >= state->wsize) { zmemcpy(state->window, end - state->wsize, state->wsize); state->wnext = 0; state->whave = state->wsize; } else { dist = state->wsize - state->wnext; if (dist > copy) dist = copy; zmemcpy(state->window + state->wnext, end - copy, dist); copy -= dist; if (copy) { zmemcpy(state->window, end - copy, copy); state->wnext = copy; state->whave = state->wsize; } else { state->wnext += dist; if (state->wnext == state->wsize) state->wnext = 0; if (state->whave < state->wsize) state->whave += dist; } } return 0; } /* Macros for inflate(): */ /* check function to use adler32() for zlib or crc32() for gzip */ #ifdef GUNZIP # define UPDATE(check, buf, len) \ (state->flags ? crc32(check, buf, len) : adler32(check, buf, len)) #else # define UPDATE(check, buf, len) adler32(check, buf, len) #endif /* check macros for header crc */ #ifdef GUNZIP # define CRC2(check, word) \ do { \ hbuf[0] = (unsigned char)(word); \ hbuf[1] = (unsigned char)((word) >> 8); \ check = crc32(check, hbuf, 2); \ } while (0) # define CRC4(check, word) \ do { \ hbuf[0] = (unsigned char)(word); \ hbuf[1] = (unsigned char)((word) >> 8); \ hbuf[2] = (unsigned char)((word) >> 16); \ hbuf[3] = (unsigned char)((word) >> 24); \ check = crc32(check, hbuf, 4); \ } while (0) #endif /* Load registers with state in inflate() for speed */ #define LOAD() \ do { \ put = strm->next_out; \ left = strm->avail_out; \ next = strm->next_in; \ have = strm->avail_in; \ hold = state->hold; \ bits = state->bits; \ } while (0) /* Restore state from registers in inflate() */ #define RESTORE() \ do { \ strm->next_out = put; \ strm->avail_out = left; \ strm->next_in = next; \ strm->avail_in = have; \ state->hold = hold; \ state->bits = bits; \ } while (0) /* Clear the input bit accumulator */ #define INITBITS() \ do { \ hold = 0; \ bits = 0; \ } while (0) /* Get a byte of input into the bit accumulator, or return from inflate() if there is no input available. */ #define PULLBYTE() \ do { \ if (have == 0) goto inf_leave; \ have--; \ hold += (unsigned long)(*next++) << bits; \ bits += 8; \ } while (0) /* Assure that there are at least n bits in the bit accumulator. If there is not enough available input to do that, then return from inflate(). */ #define NEEDBITS(n) \ do { \ while (bits < (unsigned)(n)) \ PULLBYTE(); \ } while (0) /* Return the low n bits of the bit accumulator (n < 16) */ #define BITS(n) \ ((unsigned)hold & ((1U << (n)) - 1)) /* Remove n bits from the bit accumulator */ #define DROPBITS(n) \ do { \ hold >>= (n); \ bits -= (unsigned)(n); \ } while (0) /* Remove zero to seven bits as needed to go to a byte boundary */ #define BYTEBITS() \ do { \ hold >>= bits & 7; \ bits -= bits & 7; \ } while (0) /* inflate() uses a state machine to process as much input data and generate as much output data as possible before returning. The state machine is structured roughly as follows: for (;;) switch (state) { ... case STATEn: if (not enough input data or output space to make progress) return; ... make progress ... state = STATEm; break; ... } so when inflate() is called again, the same case is attempted again, and if the appropriate resources are provided, the machine proceeds to the next state. The NEEDBITS() macro is usually the way the state evaluates whether it can proceed or should return. NEEDBITS() does the return if the requested bits are not available. The typical use of the BITS macros is: NEEDBITS(n); ... do something with BITS(n) ... DROPBITS(n); where NEEDBITS(n) either returns from inflate() if there isn't enough input left to load n bits into the accumulator, or it continues. BITS(n) gives the low n bits in the accumulator. When done, DROPBITS(n) drops the low n bits off the accumulator. INITBITS() clears the accumulator and sets the number of available bits to zero. BYTEBITS() discards just enough bits to put the accumulator on a byte boundary. After BYTEBITS() and a NEEDBITS(8), then BITS(8) would return the next byte in the stream. NEEDBITS(n) uses PULLBYTE() to get an available byte of input, or to return if there is no input available. The decoding of variable length codes uses PULLBYTE() directly in order to pull just enough bytes to decode the next code, and no more. Some states loop until they get enough input, making sure that enough state information is maintained to continue the loop where it left off if NEEDBITS() returns in the loop. For example, want, need, and keep would all have to actually be part of the saved state in case NEEDBITS() returns: case STATEw: while (want < need) { NEEDBITS(n); keep[want++] = BITS(n); DROPBITS(n); } state = STATEx; case STATEx: As shown above, if the next state is also the next case, then the break is omitted. A state may also return if there is not enough output space available to complete that state. Those states are copying stored data, writing a literal byte, and copying a matching string. When returning, a "goto inf_leave" is used to update the total counters, update the check value, and determine whether any progress has been made during that inflate() call in order to return the proper return code. Progress is defined as a change in either strm->avail_in or strm->avail_out. When there is a window, goto inf_leave will update the window with the last output written. If a goto inf_leave occurs in the middle of decompression and there is no window currently, goto inf_leave will create one and copy output to the window for the next call of inflate(). In this implementation, the flush parameter of inflate() only affects the return code (per zlib.h). inflate() always writes as much as possible to strm->next_out, given the space available and the provided input--the effect documented in zlib.h of Z_SYNC_FLUSH. Furthermore, inflate() always defers the allocation of and copying into a sliding window until necessary, which provides the effect documented in zlib.h for Z_FINISH when the entire input stream available. So the only thing the flush parameter actually does is: when flush is set to Z_FINISH, inflate() cannot return Z_OK. Instead it will return Z_BUF_ERROR if it has not reached the end of the stream. */ int ZEXPORT inflate(strm, flush) z_streamp strm; int flush; { struct inflate_state FAR *state; z_const unsigned char FAR *next; /* next input */ unsigned char FAR *put; /* next output */ unsigned have, left; /* available input and output */ unsigned long hold; /* bit buffer */ unsigned bits; /* bits in bit buffer */ unsigned in, out; /* save starting available input and output */ unsigned copy; /* number of stored or match bytes to copy */ unsigned char FAR *from; /* where to copy match bytes from */ code here; /* current decoding table entry */ code last; /* parent table entry */ unsigned len; /* length to copy for repeats, bits to drop */ int ret; /* return code */ #ifdef GUNZIP unsigned char hbuf[4]; /* buffer for gzip header crc calculation */ #endif static const unsigned short order[19] = /* permutation of code lengths */ {16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15}; if (inflateStateCheck(strm) || strm->next_out == Z_NULL || (strm->next_in == Z_NULL && strm->avail_in != 0)) return Z_STREAM_ERROR; state = (struct inflate_state FAR *)strm->state; if (state->mode == TYPE) state->mode = TYPEDO; /* skip check */ LOAD(); in = have; out = left; ret = Z_OK; for (;;) switch (state->mode) { case HEAD: if (state->wrap == 0) { state->mode = TYPEDO; break; } NEEDBITS(16); #ifdef GUNZIP if ((state->wrap & 2) && hold == 0x8b1f) { /* gzip header */ if (state->wbits == 0) state->wbits = 15; state->check = crc32(0L, Z_NULL, 0); CRC2(state->check, hold); INITBITS(); state->mode = FLAGS; break; } state->flags = 0; /* expect zlib header */ if (state->head != Z_NULL) state->head->done = -1; if (!(state->wrap & 1) || /* check if zlib header allowed */ #else if ( #endif ((BITS(8) << 8) + (hold >> 8)) % 31) { strm->msg = (char *)"incorrect header check"; state->mode = BAD; break; } if (BITS(4) != Z_DEFLATED) { strm->msg = (char *)"unknown compression method"; state->mode = BAD; break; } DROPBITS(4); len = BITS(4) + 8; if (state->wbits == 0) state->wbits = len; if (len > 15 || len > state->wbits) { strm->msg = (char *)"invalid window size"; state->mode = BAD; break; } state->dmax = 1U << len; Tracev((stderr, "inflate: zlib header ok\n")); strm->adler = state->check = adler32(0L, Z_NULL, 0); state->mode = hold & 0x200 ? DICTID : TYPE; INITBITS(); break; #ifdef GUNZIP case FLAGS: NEEDBITS(16); state->flags = (int)(hold); if ((state->flags & 0xff) != Z_DEFLATED) { strm->msg = (char *)"unknown compression method"; state->mode = BAD; break; } if (state->flags & 0xe000) { strm->msg = (char *)"unknown header flags set"; state->mode = BAD; break; } if (state->head != Z_NULL) state->head->text = (int)((hold >> 8) & 1); if ((state->flags & 0x0200) && (state->wrap & 4)) CRC2(state->check, hold); INITBITS(); state->mode = TIME; /* FALLTHROUGH */ case TIME: NEEDBITS(32); if (state->head != Z_NULL) state->head->time = hold; if ((state->flags & 0x0200) && (state->wrap & 4)) CRC4(state->check, hold); INITBITS(); state->mode = OS; /* FALLTHROUGH */ case OS: NEEDBITS(16); if (state->head != Z_NULL) { state->head->xflags = (int)(hold & 0xff); state->head->os = (int)(hold >> 8); } if ((state->flags & 0x0200) && (state->wrap & 4)) CRC2(state->check, hold); INITBITS(); state->mode = EXLEN; /* FALLTHROUGH */ case EXLEN: if (state->flags & 0x0400) { NEEDBITS(16); state->length = (unsigned)(hold); if (state->head != Z_NULL) state->head->extra_len = (unsigned)hold; if ((state->flags & 0x0200) && (state->wrap & 4)) CRC2(state->check, hold); INITBITS(); } else if (state->head != Z_NULL) state->head->extra = Z_NULL; state->mode = EXTRA; /* FALLTHROUGH */ case EXTRA: if (state->flags & 0x0400) { copy = state->length; if (copy > have) copy = have; if (copy) { if (state->head != Z_NULL && state->head->extra != Z_NULL) { len = state->head->extra_len - state->length; zmemcpy(state->head->extra + len, next, len + copy > state->head->extra_max ? state->head->extra_max - len : copy); } if ((state->flags & 0x0200) && (state->wrap & 4)) state->check = crc32(state->check, next, copy); have -= copy; next += copy; state->length -= copy; } if (state->length) goto inf_leave; } state->length = 0; state->mode = NAME; /* FALLTHROUGH */ case NAME: if (state->flags & 0x0800) { if (have == 0) goto inf_leave; copy = 0; do { len = (unsigned)(next[copy++]); if (state->head != Z_NULL && state->head->name != Z_NULL && state->length < state->head->name_max) state->head->name[state->length++] = (Bytef)len; } while (len && copy < have); if ((state->flags & 0x0200) && (state->wrap & 4)) state->check = crc32(state->check, next, copy); have -= copy; next += copy; if (len) goto inf_leave; } else if (state->head != Z_NULL) state->head->name = Z_NULL; state->length = 0; state->mode = COMMENT; /* FALLTHROUGH */ case COMMENT: if (state->flags & 0x1000) { if (have == 0) goto inf_leave; copy = 0; do { len = (unsigned)(next[copy++]); if (state->head != Z_NULL && state->head->comment != Z_NULL && state->length < state->head->comm_max) state->head->comment[state->length++] = (Bytef)len; } while (len && copy < have); if ((state->flags & 0x0200) && (state->wrap & 4)) state->check = crc32(state->check, next, copy); have -= copy; next += copy; if (len) goto inf_leave; } else if (state->head != Z_NULL) state->head->comment = Z_NULL; state->mode = HCRC; /* FALLTHROUGH */ case HCRC: if (state->flags & 0x0200) { NEEDBITS(16); if ((state->wrap & 4) && hold != (state->check & 0xffff)) { strm->msg = (char *)"header crc mismatch"; state->mode = BAD; break; } INITBITS(); } if (state->head != Z_NULL) { state->head->hcrc = (int)((state->flags >> 9) & 1); state->head->done = 1; } strm->adler = state->check = crc32(0L, Z_NULL, 0); state->mode = TYPE; break; #endif case DICTID: NEEDBITS(32); strm->adler = state->check = ZSWAP32(hold); INITBITS(); state->mode = DICT; /* FALLTHROUGH */ case DICT: if (state->havedict == 0) { RESTORE(); return Z_NEED_DICT; } strm->adler = state->check = adler32(0L, Z_NULL, 0); state->mode = TYPE; /* FALLTHROUGH */ case TYPE: if (flush == Z_BLOCK || flush == Z_TREES) goto inf_leave; /* FALLTHROUGH */ case TYPEDO: if (state->last) { BYTEBITS(); state->mode = CHECK; break; } NEEDBITS(3); state->last = BITS(1); DROPBITS(1); switch (BITS(2)) { case 0: /* stored block */ Tracev((stderr, "inflate: stored block%s\n", state->last ? " (last)" : "")); state->mode = STORED; break; case 1: /* fixed block */ fixedtables(state); Tracev((stderr, "inflate: fixed codes block%s\n", state->last ? " (last)" : "")); state->mode = LEN_; /* decode codes */ if (flush == Z_TREES) { DROPBITS(2); goto inf_leave; } break; case 2: /* dynamic block */ Tracev((stderr, "inflate: dynamic codes block%s\n", state->last ? " (last)" : "")); state->mode = TABLE; break; case 3: strm->msg = (char *)"invalid block type"; state->mode = BAD; } DROPBITS(2); break; case STORED: BYTEBITS(); /* go to byte boundary */ NEEDBITS(32); if ((hold & 0xffff) != ((hold >> 16) ^ 0xffff)) { strm->msg = (char *)"invalid stored block lengths"; state->mode = BAD; break; } state->length = (unsigned)hold & 0xffff; Tracev((stderr, "inflate: stored length %u\n", state->length)); INITBITS(); state->mode = COPY_; if (flush == Z_TREES) goto inf_leave; /* FALLTHROUGH */ case COPY_: state->mode = COPY; /* FALLTHROUGH */ case COPY: copy = state->length; if (copy) { if (copy > have) copy = have; if (copy > left) copy = left; if (copy == 0) goto inf_leave; zmemcpy(put, next, copy); have -= copy; next += copy; left -= copy; put += copy; state->length -= copy; break; } Tracev((stderr, "inflate: stored end\n")); state->mode = TYPE; break; case TABLE: NEEDBITS(14); state->nlen = BITS(5) + 257; DROPBITS(5); state->ndist = BITS(5) + 1; DROPBITS(5); state->ncode = BITS(4) + 4; DROPBITS(4); #ifndef PKZIP_BUG_WORKAROUND if (state->nlen > 286 || state->ndist > 30) { strm->msg = (char *)"too many length or distance symbols"; state->mode = BAD; break; } #endif Tracev((stderr, "inflate: table sizes ok\n")); state->have = 0; state->mode = LENLENS; /* FALLTHROUGH */ case LENLENS: while (state->have < state->ncode) { NEEDBITS(3); state->lens[order[state->have++]] = (unsigned short)BITS(3); DROPBITS(3); } while (state->have < 19) state->lens[order[state->have++]] = 0; state->next = state->codes; state->lencode = (const code FAR *)(state->next); state->lenbits = 7; ret = inflate_table(CODES, state->lens, 19, &(state->next), &(state->lenbits), state->work); if (ret) { strm->msg = (char *)"invalid code lengths set"; state->mode = BAD; break; } Tracev((stderr, "inflate: code lengths ok\n")); state->have = 0; state->mode = CODELENS; /* FALLTHROUGH */ case CODELENS: while (state->have < state->nlen + state->ndist) { for (;;) { here = state->lencode[BITS(state->lenbits)]; if ((unsigned)(here.bits) <= bits) break; PULLBYTE(); } if (here.val < 16) { DROPBITS(here.bits); state->lens[state->have++] = here.val; } else { if (here.val == 16) { NEEDBITS(here.bits + 2); DROPBITS(here.bits); if (state->have == 0) { strm->msg = (char *)"invalid bit length repeat"; state->mode = BAD; break; } len = state->lens[state->have - 1]; copy = 3 + BITS(2); DROPBITS(2); } else if (here.val == 17) { NEEDBITS(here.bits + 3); DROPBITS(here.bits); len = 0; copy = 3 + BITS(3); DROPBITS(3); } else { NEEDBITS(here.bits + 7); DROPBITS(here.bits); len = 0; copy = 11 + BITS(7); DROPBITS(7); } if (state->have + copy > state->nlen + state->ndist) { strm->msg = (char *)"invalid bit length repeat"; state->mode = BAD; break; } while (copy--) state->lens[state->have++] = (unsigned short)len; } } /* handle error breaks in while */ if (state->mode == BAD) break; /* check for end-of-block code (better have one) */ if (state->lens[256] == 0) { strm->msg = (char *)"invalid code -- missing end-of-block"; state->mode = BAD; break; } /* build code tables -- note: do not change the lenbits or distbits values here (9 and 6) without reading the comments in inftrees.h concerning the ENOUGH constants, which depend on those values */ state->next = state->codes; state->lencode = (const code FAR *)(state->next); state->lenbits = 9; ret = inflate_table(LENS, state->lens, state->nlen, &(state->next), &(state->lenbits), state->work); if (ret) { strm->msg = (char *)"invalid literal/lengths set"; state->mode = BAD; break; } state->distcode = (const code FAR *)(state->next); state->distbits = 6; ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist, &(state->next), &(state->distbits), state->work); if (ret) { strm->msg = (char *)"invalid distances set"; state->mode = BAD; break; } Tracev((stderr, "inflate: codes ok\n")); state->mode = LEN_; if (flush == Z_TREES) goto inf_leave; /* FALLTHROUGH */ case LEN_: state->mode = LEN; /* FALLTHROUGH */ case LEN: if (have >= 6 && left >= 258) { RESTORE(); inflate_fast(strm, out); LOAD(); if (state->mode == TYPE) state->back = -1; break; } state->back = 0; for (;;) { here = state->lencode[BITS(state->lenbits)]; if ((unsigned)(here.bits) <= bits) break; PULLBYTE(); } if (here.op && (here.op & 0xf0) == 0) { last = here; for (;;) { here = state->lencode[last.val + (BITS(last.bits + last.op) >> last.bits)]; if ((unsigned)(last.bits + here.bits) <= bits) break; PULLBYTE(); } DROPBITS(last.bits); state->back += last.bits; } DROPBITS(here.bits); state->back += here.bits; state->length = (unsigned)here.val; if ((int)(here.op) == 0) { Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? "inflate: literal '%c'\n" : "inflate: literal 0x%02x\n", here.val)); state->mode = LIT; break; } if (here.op & 32) { Tracevv((stderr, "inflate: end of block\n")); state->back = -1; state->mode = TYPE; break; } if (here.op & 64) { strm->msg = (char *)"invalid literal/length code"; state->mode = BAD; break; } state->extra = (unsigned)(here.op) & 15; state->mode = LENEXT; /* FALLTHROUGH */ case LENEXT: if (state->extra) { NEEDBITS(state->extra); state->length += BITS(state->extra); DROPBITS(state->extra); state->back += state->extra; } Tracevv((stderr, "inflate: length %u\n", state->length)); state->was = state->length; state->mode = DIST; /* FALLTHROUGH */ case DIST: for (;;) { here = state->distcode[BITS(state->distbits)]; if ((unsigned)(here.bits) <= bits) break; PULLBYTE(); } if ((here.op & 0xf0) == 0) { last = here; for (;;) { here = state->distcode[last.val + (BITS(last.bits + last.op) >> last.bits)]; if ((unsigned)(last.bits + here.bits) <= bits) break; PULLBYTE(); } DROPBITS(last.bits); state->back += last.bits; } DROPBITS(here.bits); state->back += here.bits; if (here.op & 64) { strm->msg = (char *)"invalid distance code"; state->mode = BAD; break; } state->offset = (unsigned)here.val; state->extra = (unsigned)(here.op) & 15; state->mode = DISTEXT; /* FALLTHROUGH */ case DISTEXT: if (state->extra) { NEEDBITS(state->extra); state->offset += BITS(state->extra); DROPBITS(state->extra); state->back += state->extra; } #ifdef INFLATE_STRICT if (state->offset > state->dmax) { strm->msg = (char *)"invalid distance too far back"; state->mode = BAD; break; } #endif Tracevv((stderr, "inflate: distance %u\n", state->offset)); state->mode = MATCH; /* FALLTHROUGH */ case MATCH: if (left == 0) goto inf_leave; copy = out - left; if (state->offset > copy) { /* copy from window */ copy = state->offset - copy; if (copy > state->whave) { if (state->sane) { strm->msg = (char *)"invalid distance too far back"; state->mode = BAD; break; } #ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR Trace((stderr, "inflate.c too far\n")); copy -= state->whave; if (copy > state->length) copy = state->length; if (copy > left) copy = left; left -= copy; state->length -= copy; do { *put++ = 0; } while (--copy); if (state->length == 0) state->mode = LEN; break; #endif } if (copy > state->wnext) { copy -= state->wnext; from = state->window + (state->wsize - copy); } else from = state->window + (state->wnext - copy); if (copy > state->length) copy = state->length; } else { /* copy from output */ from = put - state->offset; copy = state->length; } if (copy > left) copy = left; left -= copy; state->length -= copy; do { *put++ = *from++; } while (--copy); if (state->length == 0) state->mode = LEN; break; case LIT: if (left == 0) goto inf_leave; *put++ = (unsigned char)(state->length); left--; state->mode = LEN; break; case CHECK: if (state->wrap) { NEEDBITS(32); out -= left; strm->total_out += out; state->total += out; if ((state->wrap & 4) && out) strm->adler = state->check = UPDATE(state->check, put - out, out); out = left; if ((state->wrap & 4) && ( #ifdef GUNZIP state->flags ? hold : #endif ZSWAP32(hold)) != state->check) { strm->msg = (char *)"incorrect data check"; state->mode = BAD; break; } INITBITS(); Tracev((stderr, "inflate: check matches trailer\n")); } #ifdef GUNZIP state->mode = LENGTH; /* FALLTHROUGH */ case LENGTH: if (state->wrap && state->flags) { NEEDBITS(32); if (hold != (state->total & 0xffffffffUL)) { strm->msg = (char *)"incorrect length check"; state->mode = BAD; break; } INITBITS(); Tracev((stderr, "inflate: length matches trailer\n")); } #endif state->mode = DONE; /* FALLTHROUGH */ case DONE: ret = Z_STREAM_END; goto inf_leave; case BAD: ret = Z_DATA_ERROR; goto inf_leave; case MEM: return Z_MEM_ERROR; case SYNC: default: return Z_STREAM_ERROR; } /* Return from inflate(), updating the total counts and the check value. If there was no progress during the inflate() call, return a buffer error. Call updatewindow() to create and/or update the window state. Note: a memory error from inflate() is non-recoverable. */ inf_leave: RESTORE(); if (state->wsize || (out != strm->avail_out && state->mode < BAD && (state->mode < CHECK || flush != Z_FINISH))) if (updatewindow(strm, strm->next_out, out - strm->avail_out)) { state->mode = MEM; return Z_MEM_ERROR; } in -= strm->avail_in; out -= strm->avail_out; strm->total_in += in; strm->total_out += out; state->total += out; if ((state->wrap & 4) && out) strm->adler = state->check = UPDATE(state->check, strm->next_out - out, out); strm->data_type = (int)state->bits + (state->last ? 64 : 0) + (state->mode == TYPE ? 128 : 0) + (state->mode == LEN_ || state->mode == COPY_ ? 256 : 0); if (((in == 0 && out == 0) || flush == Z_FINISH) && ret == Z_OK) ret = Z_BUF_ERROR; return ret; } int ZEXPORT inflateEnd(strm) z_streamp strm; { struct inflate_state FAR *state; if (inflateStateCheck(strm)) return Z_STREAM_ERROR; state = (struct inflate_state FAR *)strm->state; if (state->window != Z_NULL) ZFREE(strm, state->window); ZFREE(strm, strm->state); strm->state = Z_NULL; Tracev((stderr, "inflate: end\n")); return Z_OK; } int ZEXPORT inflateGetDictionary(strm, dictionary, dictLength) z_streamp strm; Bytef *dictionary; uInt *dictLength; { struct inflate_state FAR *state; /* check state */ if (inflateStateCheck(strm)) return Z_STREAM_ERROR; state = (struct inflate_state FAR *)strm->state; /* copy dictionary */ if (state->whave && dictionary != Z_NULL) { zmemcpy(dictionary, state->window + state->wnext, state->whave - state->wnext); zmemcpy(dictionary + state->whave - state->wnext, state->window, state->wnext); } if (dictLength != Z_NULL) *dictLength = state->whave; return Z_OK; } int ZEXPORT inflateSetDictionary(strm, dictionary, dictLength) z_streamp strm; const Bytef *dictionary; uInt dictLength; { struct inflate_state FAR *state; unsigned long dictid; int ret; /* check state */ if (inflateStateCheck(strm)) return Z_STREAM_ERROR; state = (struct inflate_state FAR *)strm->state; if (state->wrap != 0 && state->mode != DICT) return Z_STREAM_ERROR; /* check for correct dictionary identifier */ if (state->mode == DICT) { dictid = adler32(0L, Z_NULL, 0); dictid = adler32(dictid, dictionary, dictLength); if (dictid != state->check) return Z_DATA_ERROR; } /* copy dictionary to window using updatewindow(), which will amend the existing dictionary if appropriate */ ret = updatewindow(strm, dictionary + dictLength, dictLength); if (ret) { state->mode = MEM; return Z_MEM_ERROR; } state->havedict = 1; Tracev((stderr, "inflate: dictionary set\n")); return Z_OK; } int ZEXPORT inflateGetHeader(strm, head) z_streamp strm; gz_headerp head; { struct inflate_state FAR *state; /* check state */ if (inflateStateCheck(strm)) return Z_STREAM_ERROR; state = (struct inflate_state FAR *)strm->state; if ((state->wrap & 2) == 0) return Z_STREAM_ERROR; /* save header structure */ state->head = head; head->done = 0; return Z_OK; } /* Search buf[0..len-1] for the pattern: 0, 0, 0xff, 0xff. Return when found or when out of input. When called, *have is the number of pattern bytes found in order so far, in 0..3. On return *have is updated to the new state. If on return *have equals four, then the pattern was found and the return value is how many bytes were read including the last byte of the pattern. If *have is less than four, then the pattern has not been found yet and the return value is len. In the latter case, syncsearch() can be called again with more data and the *have state. *have is initialized to zero for the first call. */ local unsigned syncsearch(have, buf, len) unsigned FAR *have; const unsigned char FAR *buf; unsigned len; { unsigned got; unsigned next; got = *have; next = 0; while (next < len && got < 4) { if ((int)(buf[next]) == (got < 2 ? 0 : 0xff)) got++; else if (buf[next]) got = 0; else got = 4 - got; next++; } *have = got; return next; } int ZEXPORT inflateSync(strm) z_streamp strm; { unsigned len; /* number of bytes to look at or looked at */ unsigned long in, out; /* temporary to save total_in and total_out */ unsigned char buf[4]; /* to restore bit buffer to byte string */ struct inflate_state FAR *state; /* check parameters */ if (inflateStateCheck(strm)) return Z_STREAM_ERROR; state = (struct inflate_state FAR *)strm->state; if (strm->avail_in == 0 && state->bits < 8) return Z_BUF_ERROR; /* if first time, start search in bit buffer */ if (state->mode != SYNC) { state->mode = SYNC; state->hold <<= state->bits & 7; state->bits -= state->bits & 7; len = 0; while (state->bits >= 8) { buf[len++] = (unsigned char)(state->hold); state->hold >>= 8; state->bits -= 8; } state->have = 0; syncsearch(&(state->have), buf, len); } /* search available input */ len = syncsearch(&(state->have), strm->next_in, strm->avail_in); strm->avail_in -= len; strm->next_in += len; strm->total_in += len; /* return no joy or set up to restart inflate() on a new block */ if (state->have != 4) return Z_DATA_ERROR; in = strm->total_in; out = strm->total_out; inflateReset(strm); strm->total_in = in; strm->total_out = out; state->mode = TYPE; return Z_OK; } /* Returns true if inflate is currently at the end of a block generated by Z_SYNC_FLUSH or Z_FULL_FLUSH. This function is used by one PPP implementation to provide an additional safety check. PPP uses Z_SYNC_FLUSH but removes the length bytes of the resulting empty stored block. When decompressing, PPP checks that at the end of input packet, inflate is waiting for these length bytes. */ int ZEXPORT inflateSyncPoint(strm) z_streamp strm; { struct inflate_state FAR *state; if (inflateStateCheck(strm)) return Z_STREAM_ERROR; state = (struct inflate_state FAR *)strm->state; return state->mode == STORED && state->bits == 0; } int ZEXPORT inflateCopy(dest, source) z_streamp dest; z_streamp source; { struct inflate_state FAR *state; struct inflate_state FAR *copy; unsigned char FAR *window; unsigned wsize; /* check input */ if (inflateStateCheck(source) || dest == Z_NULL) return Z_STREAM_ERROR; state = (struct inflate_state FAR *)source->state; /* allocate space */ copy = (struct inflate_state FAR *) ZALLOC(source, 1, sizeof(struct inflate_state)); if (copy == Z_NULL) return Z_MEM_ERROR; window = Z_NULL; if (state->window != Z_NULL) { window = (unsigned char FAR *) ZALLOC(source, 1U << state->wbits, sizeof(unsigned char)); if (window == Z_NULL) { ZFREE(source, copy); return Z_MEM_ERROR; } } /* copy state */ zmemcpy((Bytef*)dest, (const Bytef*)source, sizeof(z_stream)); zmemcpy((Bytef*)copy, (const Bytef*)state, sizeof(struct inflate_state)); copy->strm = dest; if (state->lencode >= state->codes && state->lencode <= state->codes + ENOUGH - 1) { copy->lencode = copy->codes + (state->lencode - state->codes); copy->distcode = copy->codes + (state->distcode - state->codes); } copy->next = copy->codes + (state->next - state->codes); if (window != Z_NULL) { wsize = 1U << state->wbits; zmemcpy(window, state->window, wsize); } copy->window = window; dest->state = (struct internal_state FAR *)copy; return Z_OK; } int ZEXPORT inflateUndermine(strm, subvert) z_streamp strm; int subvert; { struct inflate_state FAR *state; if (inflateStateCheck(strm)) return Z_STREAM_ERROR; state = (struct inflate_state FAR *)strm->state; #ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR state->sane = !subvert; return Z_OK; #else (void)subvert; state->sane = 1; return Z_DATA_ERROR; #endif } int ZEXPORT inflateValidate(strm, check) z_streamp strm; int check; { struct inflate_state FAR *state; if (inflateStateCheck(strm)) return Z_STREAM_ERROR; state = (struct inflate_state FAR *)strm->state; if (check) state->wrap |= 4; else state->wrap &= ~4; return Z_OK; } long ZEXPORT inflateMark(strm) z_streamp strm; { struct inflate_state FAR *state; if (inflateStateCheck(strm)) return -(1L << 16); state = (struct inflate_state FAR *)strm->state; return (long)(((unsigned long)((long)state->back)) << 16) + (state->mode == COPY ? state->length : (state->mode == MATCH ? state->was - state->length : 0)); } unsigned long ZEXPORT inflateCodesUsed(strm) z_streamp strm; { struct inflate_state FAR *state; if (inflateStateCheck(strm)) return (unsigned long)-1; state = (struct inflate_state FAR *)strm->state; return (unsigned long)(state->next - state->codes); } UEFITool-A66/common/zlib/inflate.h000077500000000000000000000147321442134156300170360ustar00rootroot00000000000000/* inflate.h -- internal inflate state definition * Copyright (C) 1995-2016 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ /* WARNING: this file should *not* be used by applications. It is part of the implementation of the compression library and is subject to change. Applications should only use zlib.h. */ /* define NO_GZIP when compiling if you want to disable gzip header and trailer decoding by inflate(). NO_GZIP would be used to avoid linking in the crc code when it is not needed. For shared libraries, gzip decoding should be left enabled. */ #ifndef NO_GZIP # define GUNZIP #endif /* Possible inflate modes between inflate() calls */ typedef enum { HEAD = 16180, /* i: waiting for magic header */ FLAGS, /* i: waiting for method and flags (gzip) */ TIME, /* i: waiting for modification time (gzip) */ OS, /* i: waiting for extra flags and operating system (gzip) */ EXLEN, /* i: waiting for extra length (gzip) */ EXTRA, /* i: waiting for extra bytes (gzip) */ NAME, /* i: waiting for end of file name (gzip) */ COMMENT, /* i: waiting for end of comment (gzip) */ HCRC, /* i: waiting for header crc (gzip) */ DICTID, /* i: waiting for dictionary check value */ DICT, /* waiting for inflateSetDictionary() call */ TYPE, /* i: waiting for type bits, including last-flag bit */ TYPEDO, /* i: same, but skip check to exit inflate on new block */ STORED, /* i: waiting for stored size (length and complement) */ COPY_, /* i/o: same as COPY below, but only first time in */ COPY, /* i/o: waiting for input or output to copy stored block */ TABLE, /* i: waiting for dynamic block table lengths */ LENLENS, /* i: waiting for code length code lengths */ CODELENS, /* i: waiting for length/lit and distance code lengths */ LEN_, /* i: same as LEN below, but only first time in */ LEN, /* i: waiting for length/lit/eob code */ LENEXT, /* i: waiting for length extra bits */ DIST, /* i: waiting for distance code */ DISTEXT, /* i: waiting for distance extra bits */ MATCH, /* o: waiting for output space to copy string */ LIT, /* o: waiting for output space to write literal */ CHECK, /* i: waiting for 32-bit check value */ LENGTH, /* i: waiting for 32-bit length (gzip) */ DONE, /* finished check, done -- remain here until reset */ BAD, /* got a data error -- remain here until reset */ MEM, /* got an inflate() memory error -- remain here until reset */ SYNC /* looking for synchronization bytes to restart inflate() */ } inflate_mode; /* State transitions between above modes - (most modes can go to BAD or MEM on error -- not shown for clarity) Process header: HEAD -> (gzip) or (zlib) or (raw) (gzip) -> FLAGS -> TIME -> OS -> EXLEN -> EXTRA -> NAME -> COMMENT -> HCRC -> TYPE (zlib) -> DICTID or TYPE DICTID -> DICT -> TYPE (raw) -> TYPEDO Read deflate blocks: TYPE -> TYPEDO -> STORED or TABLE or LEN_ or CHECK STORED -> COPY_ -> COPY -> TYPE TABLE -> LENLENS -> CODELENS -> LEN_ LEN_ -> LEN Read deflate codes in fixed or dynamic block: LEN -> LENEXT or LIT or TYPE LENEXT -> DIST -> DISTEXT -> MATCH -> LEN LIT -> LEN Process trailer: CHECK -> LENGTH -> DONE */ /* State maintained between inflate() calls -- approximately 7K bytes, not including the allocated sliding window, which is up to 32K bytes. */ struct inflate_state { z_streamp strm; /* pointer back to this zlib stream */ inflate_mode mode; /* current inflate mode */ int last; /* true if processing last block */ int wrap; /* bit 0 true for zlib, bit 1 true for gzip, bit 2 true to validate check value */ int havedict; /* true if dictionary provided */ int flags; /* gzip header method and flags (0 if zlib) */ unsigned dmax; /* zlib header max distance (INFLATE_STRICT) */ unsigned long check; /* protected copy of check value */ unsigned long total; /* protected copy of output count */ gz_headerp head; /* where to save gzip header information */ /* sliding window */ unsigned wbits; /* log base 2 of requested window size */ unsigned wsize; /* window size or zero if not using window */ unsigned whave; /* valid bytes in the window */ unsigned wnext; /* window write index */ unsigned char FAR *window; /* allocated sliding window, if needed */ /* bit accumulator */ unsigned long hold; /* input bit accumulator */ unsigned bits; /* number of bits in "in" */ /* for string and stored block copying */ unsigned length; /* literal or length of data to copy */ unsigned offset; /* distance back to copy string from */ /* for table and code decoding */ unsigned extra; /* extra bits needed */ /* fixed and dynamic code tables */ code const FAR *lencode; /* starting table for length/literal codes */ code const FAR *distcode; /* starting table for distance codes */ unsigned lenbits; /* index bits for lencode */ unsigned distbits; /* index bits for distcode */ /* dynamic table building */ unsigned ncode; /* number of code length code lengths */ unsigned nlen; /* number of length code lengths */ unsigned ndist; /* number of distance code lengths */ unsigned have; /* number of code lengths in lens[] */ code FAR *next; /* next available space in codes[] */ unsigned short lens[320]; /* temporary storage for code lengths */ unsigned short work[288]; /* work area for code table building */ code codes[ENOUGH]; /* space for code tables */ int sane; /* if false, allow invalid distance too far */ int back; /* bits back of last unprocessed length/lit */ unsigned was; /* initial length of match */ }; UEFITool-A66/common/zlib/inftrees.c000077500000000000000000000313071442134156300172230ustar00rootroot00000000000000/* inftrees.c -- generate Huffman trees for efficient decoding * Copyright (C) 1995-2017 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ #include "zutil.h" #include "inftrees.h" #define MAXBITS 15 const char inflate_copyright[] = " inflate 1.2.11 Copyright 1995-2017 Mark Adler "; /* If you use the zlib library in a product, an acknowledgment is welcome in the documentation of your product. If for some reason you cannot include such an acknowledgment, I would appreciate that you keep this copyright string in the executable of your product. */ /* Build a set of tables to decode the provided canonical Huffman code. The code lengths are lens[0..codes-1]. The result starts at *table, whose indices are 0..2^bits-1. work is a writable array of at least lens shorts, which is used as a work area. type is the type of code to be generated, CODES, LENS, or DISTS. On return, zero is success, -1 is an invalid code, and +1 means that ENOUGH isn't enough. table on return points to the next available entry's address. bits is the requested root table index bits, and on return it is the actual root table index bits. It will differ if the request is greater than the longest code or if it is less than the shortest code. */ int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work) codetype type; unsigned short FAR *lens; unsigned codes; code FAR * FAR *table; unsigned FAR *bits; unsigned short FAR *work; { unsigned len; /* a code's length in bits */ unsigned sym; /* index of code symbols */ unsigned min, max; /* minimum and maximum code lengths */ unsigned root; /* number of index bits for root table */ unsigned curr; /* number of index bits for current table */ unsigned drop; /* code bits to drop for sub-table */ int left; /* number of prefix codes available */ unsigned used; /* code entries in table used */ unsigned huff; /* Huffman code */ unsigned incr; /* for incrementing code, index */ unsigned fill; /* index for replicating entries */ unsigned low; /* low bits for current root entry */ unsigned mask; /* mask for low root bits */ code here; /* table entry for duplication */ code FAR *next; /* next available space in table */ const unsigned short FAR *base; /* base value table to use */ const unsigned short FAR *extra; /* extra bits table to use */ unsigned match; /* use base and extra for symbol >= match */ unsigned short count[MAXBITS+1]; /* number of codes of each length */ unsigned short offs[MAXBITS+1]; /* offsets in table for each length */ static const unsigned short lbase[31] = { /* Length codes 257..285 base */ 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0}; static const unsigned short lext[31] = { /* Length codes 257..285 extra */ 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 77, 202}; static const unsigned short dbase[32] = { /* Distance codes 0..29 base */ 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577, 0, 0}; static const unsigned short dext[32] = { /* Distance codes 0..29 extra */ 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 28, 29, 29, 64, 64}; /* Process a set of code lengths to create a canonical Huffman code. The code lengths are lens[0..codes-1]. Each length corresponds to the symbols 0..codes-1. The Huffman code is generated by first sorting the symbols by length from short to long, and retaining the symbol order for codes with equal lengths. Then the code starts with all zero bits for the first code of the shortest length, and the codes are integer increments for the same length, and zeros are appended as the length increases. For the deflate format, these bits are stored backwards from their more natural integer increment ordering, and so when the decoding tables are built in the large loop below, the integer codes are incremented backwards. This routine assumes, but does not check, that all of the entries in lens[] are in the range 0..MAXBITS. The caller must assure this. 1..MAXBITS is interpreted as that code length. zero means that that symbol does not occur in this code. The codes are sorted by computing a count of codes for each length, creating from that a table of starting indices for each length in the sorted table, and then entering the symbols in order in the sorted table. The sorted table is work[], with that space being provided by the caller. The length counts are used for other purposes as well, i.e. finding the minimum and maximum length codes, determining if there are any codes at all, checking for a valid set of lengths, and looking ahead at length counts to determine sub-table sizes when building the decoding tables. */ /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */ for (len = 0; len <= MAXBITS; len++) count[len] = 0; for (sym = 0; sym < codes; sym++) count[lens[sym]]++; /* bound code lengths, force root to be within code lengths */ root = *bits; for (max = MAXBITS; max >= 1; max--) if (count[max] != 0) break; if (root > max) root = max; if (max == 0) { /* no symbols to code at all */ here.op = (unsigned char)64; /* invalid code marker */ here.bits = (unsigned char)1; here.val = (unsigned short)0; *(*table)++ = here; /* make a table to force an error */ *(*table)++ = here; *bits = 1; return 0; /* no symbols, but wait for decoding to report error */ } for (min = 1; min < max; min++) if (count[min] != 0) break; if (root < min) root = min; /* check for an over-subscribed or incomplete set of lengths */ left = 1; for (len = 1; len <= MAXBITS; len++) { left <<= 1; left -= count[len]; if (left < 0) return -1; /* over-subscribed */ } if (left > 0 && (type == CODES || max != 1)) return -1; /* incomplete set */ /* generate offsets into symbol table for each length for sorting */ offs[1] = 0; for (len = 1; len < MAXBITS; len++) offs[len + 1] = offs[len] + count[len]; /* sort symbols by length, by symbol order within each length */ for (sym = 0; sym < codes; sym++) if (lens[sym] != 0) work[offs[lens[sym]]++] = (unsigned short)sym; /* Create and fill in decoding tables. In this loop, the table being filled is at next and has curr index bits. The code being used is huff with length len. That code is converted to an index by dropping drop bits off of the bottom. For codes where len is less than drop + curr, those top drop + curr - len bits are incremented through all values to fill the table with replicated entries. root is the number of index bits for the root table. When len exceeds root, sub-tables are created pointed to by the root entry with an index of the low root bits of huff. This is saved in low to check for when a new sub-table should be started. drop is zero when the root table is being filled, and drop is root when sub-tables are being filled. When a new sub-table is needed, it is necessary to look ahead in the code lengths to determine what size sub-table is needed. The length counts are used for this, and so count[] is decremented as codes are entered in the tables. used keeps track of how many table entries have been allocated from the provided *table space. It is checked for LENS and DIST tables against the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in the initial root table size constants. See the comments in inftrees.h for more information. sym increments through all symbols, and the loop terminates when all codes of length max, i.e. all codes, have been processed. This routine permits incomplete codes, so another loop after this one fills in the rest of the decoding tables with invalid code markers. */ /* set up for code type */ switch (type) { case CODES: base = extra = work; /* dummy value--not used */ match = 20; break; case LENS: base = lbase; extra = lext; match = 257; break; default: /* DISTS */ base = dbase; extra = dext; match = 0; } /* initialize state for loop */ huff = 0; /* starting code */ sym = 0; /* starting code symbol */ len = min; /* starting code length */ next = *table; /* current table to fill in */ curr = root; /* current table index bits */ drop = 0; /* current bits to drop from code for index */ low = (unsigned)(-1); /* trigger new sub-table when len > root */ used = 1U << root; /* use root table entries */ mask = used - 1; /* mask for comparing low */ /* check available table space */ if ((type == LENS && used > ENOUGH_LENS) || (type == DISTS && used > ENOUGH_DISTS)) return 1; /* process all codes and make table entries */ for (;;) { /* create table entry */ here.bits = (unsigned char)(len - drop); if (work[sym] + 1U < match) { here.op = (unsigned char)0; here.val = work[sym]; } else if (work[sym] >= match) { here.op = (unsigned char)(extra[work[sym] - match]); here.val = base[work[sym] - match]; } else { here.op = (unsigned char)(32 + 64); /* end of block */ here.val = 0; } /* replicate for those indices with low len bits equal to huff */ incr = 1U << (len - drop); fill = 1U << curr; min = fill; /* save offset to next table */ do { fill -= incr; next[(huff >> drop) + fill] = here; } while (fill != 0); /* backwards increment the len-bit code huff */ incr = 1U << (len - 1); while (huff & incr) incr >>= 1; if (incr != 0) { huff &= incr - 1; huff += incr; } else huff = 0; /* go to next symbol, update count, len */ sym++; if (--(count[len]) == 0) { if (len == max) break; len = lens[work[sym]]; } /* create new sub-table if needed */ if (len > root && (huff & mask) != low) { /* if first time, transition to sub-tables */ if (drop == 0) drop = root; /* increment past last table */ next += min; /* here min is 1 << curr */ /* determine length of next table */ curr = len - drop; left = (int)(1 << curr); while (curr + drop < max) { left -= count[curr + drop]; if (left <= 0) break; curr++; left <<= 1; } /* check for enough space */ used += 1U << curr; if ((type == LENS && used > ENOUGH_LENS) || (type == DISTS && used > ENOUGH_DISTS)) return 1; /* point entry in root table to sub-table */ low = huff & mask; (*table)[low].op = (unsigned char)curr; (*table)[low].bits = (unsigned char)root; (*table)[low].val = (unsigned short)(next - *table); } } /* fill in remaining table entry if code is incomplete (guaranteed to have at most one remaining entry, since if the code is incomplete, the maximum code length that was allowed to get this far is one bit) */ if (huff != 0) { here.op = (unsigned char)64; /* invalid code marker */ here.bits = (unsigned char)(len - drop); here.val = (unsigned short)0; next[huff] = here; } /* set return parameters */ *table += used; *bits = root; return 0; } UEFITool-A66/common/zlib/inftrees.h000077500000000000000000000055601442134156300172320ustar00rootroot00000000000000/* inftrees.h -- header to use inftrees.c * Copyright (C) 1995-2005, 2010 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ /* WARNING: this file should *not* be used by applications. It is part of the implementation of the compression library and is subject to change. Applications should only use zlib.h. */ /* Structure for decoding tables. Each entry provides either the information needed to do the operation requested by the code that indexed that table entry, or it provides a pointer to another table that indexes more bits of the code. op indicates whether the entry is a pointer to another table, a literal, a length or distance, an end-of-block, or an invalid code. For a table pointer, the low four bits of op is the number of index bits of that table. For a length or distance, the low four bits of op is the number of extra bits to get after the code. bits is the number of bits in this code or part of the code to drop off of the bit buffer. val is the actual byte to output in the case of a literal, the base length or distance, or the offset from the current table to the next table. Each entry is four bytes. */ typedef struct { unsigned char op; /* operation, extra bits, table bits */ unsigned char bits; /* bits in this part of the code */ unsigned short val; /* offset in table or code value */ } code; /* op values as set by inflate_table(): 00000000 - literal 0000tttt - table link, tttt != 0 is the number of table index bits 0001eeee - length or distance, eeee is the number of extra bits 01100000 - end of block 01000000 - invalid code */ /* Maximum size of the dynamic table. The maximum number of code structures is 1444, which is the sum of 852 for literal/length codes and 592 for distance codes. These values were found by exhaustive searches using the program examples/enough.c found in the zlib distribtution. The arguments to that program are the number of symbols, the initial root table size, and the maximum bit length of a code. "enough 286 9 15" for literal/length codes returns returns 852, and "enough 30 6 15" for distance codes returns 592. The initial root table size (9 or 6) is found in the fifth argument of the inflate_table() calls in inflate.c and infback.c. If the root table size is changed, then these maximum sizes would be need to be recalculated and updated. */ #define ENOUGH_LENS 852 #define ENOUGH_DISTS 592 #define ENOUGH (ENOUGH_LENS+ENOUGH_DISTS) /* Type of code to build for inflate_table() */ typedef enum { CODES, LENS, DISTS } codetype; int ZLIB_INTERNAL inflate_table OF((codetype type, unsigned short FAR *lens, unsigned codes, code FAR * FAR *table, unsigned FAR *bits, unsigned short FAR *work)); UEFITool-A66/common/zlib/trees.c000077500000000000000000001253671442134156300165400ustar00rootroot00000000000000/* trees.c -- output deflated data using Huffman coding * Copyright (C) 1995-2017 Jean-loup Gailly * detect_data_type() function provided freely by Cosmin Truta, 2006 * For conditions of distribution and use, see copyright notice in zlib.h */ /* * ALGORITHM * * The "deflation" process uses several Huffman trees. The more * common source values are represented by shorter bit sequences. * * Each code tree is stored in a compressed form which is itself * a Huffman encoding of the lengths of all the code strings (in * ascending order by source values). The actual code strings are * reconstructed from the lengths in the inflate process, as described * in the deflate specification. * * REFERENCES * * Deutsch, L.P.,"'Deflate' Compressed Data Format Specification". * Available in ftp.uu.net:/pub/archiving/zip/doc/deflate-1.1.doc * * Storer, James A. * Data Compression: Methods and Theory, pp. 49-50. * Computer Science Press, 1988. ISBN 0-7167-8156-5. * * Sedgewick, R. * Algorithms, p290. * Addison-Wesley, 1983. ISBN 0-201-06672-6. */ /* @(#) $Id$ */ /* #define GEN_TREES_H */ #include "deflate.h" #ifdef ZLIB_DEBUG # include #endif /* =========================================================================== * Constants */ #define MAX_BL_BITS 7 /* Bit length codes must not exceed MAX_BL_BITS bits */ #define END_BLOCK 256 /* end of block literal code */ #define REP_3_6 16 /* repeat previous bit length 3-6 times (2 bits of repeat count) */ #define REPZ_3_10 17 /* repeat a zero length 3-10 times (3 bits of repeat count) */ #define REPZ_11_138 18 /* repeat a zero length 11-138 times (7 bits of repeat count) */ local const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */ = {0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0}; local const int extra_dbits[D_CODES] /* extra bits for each distance code */ = {0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13}; local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */ = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7}; local const uch bl_order[BL_CODES] = {16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15}; /* The lengths of the bit length codes are sent in order of decreasing * probability, to avoid transmitting the lengths for unused bit length codes. */ /* =========================================================================== * Local data. These are initialized only once. */ #define DIST_CODE_LEN 512 /* see definition of array dist_code below */ #if defined(GEN_TREES_H) || !defined(STDC) /* non ANSI compilers may not accept trees.h */ local ct_data static_ltree[L_CODES+2]; /* The static literal tree. Since the bit lengths are imposed, there is no * need for the L_CODES extra codes used during heap construction. However * The codes 286 and 287 are needed to build a canonical tree (see _tr_init * below). */ local ct_data static_dtree[D_CODES]; /* The static distance tree. (Actually a trivial tree since all codes use * 5 bits.) */ uch _dist_code[DIST_CODE_LEN]; /* Distance codes. The first 256 values correspond to the distances * 3 .. 258, the last 256 values correspond to the top 8 bits of * the 15 bit distances. */ uch _length_code[MAX_MATCH-MIN_MATCH+1]; /* length code for each normalized match length (0 == MIN_MATCH) */ local int base_length[LENGTH_CODES]; /* First normalized length for each code (0 = MIN_MATCH) */ local int base_dist[D_CODES]; /* First normalized distance for each code (0 = distance of 1) */ #else # include "trees.h" #endif /* GEN_TREES_H */ struct static_tree_desc_s { const ct_data *static_tree; /* static tree or NULL */ const intf *extra_bits; /* extra bits for each code or NULL */ int extra_base; /* base index for extra_bits */ int elems; /* max number of elements in the tree */ int max_length; /* max bit length for the codes */ }; local const static_tree_desc static_l_desc = {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS}; local const static_tree_desc static_d_desc = {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS}; local const static_tree_desc static_bl_desc = {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS}; /* =========================================================================== * Local (static) routines in this file. */ local void tr_static_init OF((void)); local void init_block OF((deflate_state *s)); local void pqdownheap OF((deflate_state *s, ct_data *tree, int k)); local void gen_bitlen OF((deflate_state *s, tree_desc *desc)); local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count)); local void build_tree OF((deflate_state *s, tree_desc *desc)); local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code)); local void send_tree OF((deflate_state *s, ct_data *tree, int max_code)); local int build_bl_tree OF((deflate_state *s)); local void send_all_trees OF((deflate_state *s, int lcodes, int dcodes, int blcodes)); local void compress_block OF((deflate_state *s, const ct_data *ltree, const ct_data *dtree)); local int detect_data_type OF((deflate_state *s)); local unsigned bi_reverse OF((unsigned value, int length)); local void bi_windup OF((deflate_state *s)); local void bi_flush OF((deflate_state *s)); #ifdef GEN_TREES_H local void gen_trees_header OF((void)); #endif #ifndef ZLIB_DEBUG # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) /* Send a code of the given tree. c and tree must not have side effects */ #else /* !ZLIB_DEBUG */ # define send_code(s, c, tree) \ { if (z_verbose>2) fprintf(stderr,"\ncd %3d ",(c)); \ send_bits(s, tree[c].Code, tree[c].Len); } #endif /* =========================================================================== * Output a short LSB first on the stream. * IN assertion: there is enough room in pendingBuf. */ #define put_short(s, w) { \ put_byte(s, (uch)((w) & 0xff)); \ put_byte(s, (uch)((ush)(w) >> 8)); \ } /* =========================================================================== * Send a value on a given number of bits. * IN assertion: length <= 16 and value fits in length bits. */ #ifdef ZLIB_DEBUG local void send_bits OF((deflate_state *s, int value, int length)); local void send_bits(s, value, length) deflate_state *s; int value; /* value to send */ int length; /* number of bits */ { Tracevv((stderr," l %2d v %4x ", length, value)); Assert(length > 0 && length <= 15, "invalid length"); s->bits_sent += (ulg)length; /* If not enough room in bi_buf, use (valid) bits from bi_buf and * (16 - bi_valid) bits from value, leaving (width - (16-bi_valid)) * unused bits in value. */ if (s->bi_valid > (int)Buf_size - length) { s->bi_buf |= (ush)value << s->bi_valid; put_short(s, s->bi_buf); s->bi_buf = (ush)value >> (Buf_size - s->bi_valid); s->bi_valid += length - Buf_size; } else { s->bi_buf |= (ush)value << s->bi_valid; s->bi_valid += length; } } #else /* !ZLIB_DEBUG */ #define send_bits(s, value, length) \ { int len = length;\ if (s->bi_valid > (int)Buf_size - len) {\ int val = (int)value;\ s->bi_buf |= (ush)val << s->bi_valid;\ put_short(s, s->bi_buf);\ s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\ s->bi_valid += len - Buf_size;\ } else {\ s->bi_buf |= (ush)(value) << s->bi_valid;\ s->bi_valid += len;\ }\ } #endif /* ZLIB_DEBUG */ /* the arguments must not have side effects */ /* =========================================================================== * Initialize the various 'constant' tables. */ local void tr_static_init() { #if defined(GEN_TREES_H) || !defined(STDC) static int static_init_done = 0; int n; /* iterates over tree elements */ int bits; /* bit counter */ int length; /* length value */ int code; /* code value */ int dist; /* distance index */ ush bl_count[MAX_BITS+1]; /* number of codes at each bit length for an optimal tree */ if (static_init_done) return; /* For some embedded targets, global variables are not initialized: */ #ifdef NO_INIT_GLOBAL_POINTERS static_l_desc.static_tree = static_ltree; static_l_desc.extra_bits = extra_lbits; static_d_desc.static_tree = static_dtree; static_d_desc.extra_bits = extra_dbits; static_bl_desc.extra_bits = extra_blbits; #endif /* Initialize the mapping length (0..255) -> length code (0..28) */ length = 0; for (code = 0; code < LENGTH_CODES-1; code++) { base_length[code] = length; for (n = 0; n < (1< dist code (0..29) */ dist = 0; for (code = 0 ; code < 16; code++) { base_dist[code] = dist; for (n = 0; n < (1<>= 7; /* from now on, all distances are divided by 128 */ for ( ; code < D_CODES; code++) { base_dist[code] = dist << 7; for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) { _dist_code[256 + dist++] = (uch)code; } } Assert (dist == 256, "tr_static_init: 256+dist != 512"); /* Construct the codes of the static literal tree */ for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; n = 0; while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; /* Codes 286 and 287 do not exist, but we must include them in the * tree construction to get a canonical Huffman tree (longest code * all ones) */ gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); /* The static distance tree is trivial: */ for (n = 0; n < D_CODES; n++) { static_dtree[n].Len = 5; static_dtree[n].Code = bi_reverse((unsigned)n, 5); } static_init_done = 1; # ifdef GEN_TREES_H gen_trees_header(); # endif #endif /* defined(GEN_TREES_H) || !defined(STDC) */ } /* =========================================================================== * Genererate the file trees.h describing the static trees. */ #ifdef GEN_TREES_H # ifndef ZLIB_DEBUG # include # endif # define SEPARATOR(i, last, width) \ ((i) == (last)? "\n};\n\n" : \ ((i) % (width) == (width)-1 ? ",\n" : ", ")) void gen_trees_header() { FILE *header = fopen("trees.h", "w"); int i; Assert (header != NULL, "Can't open trees.h"); fprintf(header, "/* header created automatically with -DGEN_TREES_H */\n\n"); fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n"); for (i = 0; i < L_CODES+2; i++) { fprintf(header, "{{%3u},{%3u}}%s", static_ltree[i].Code, static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5)); } fprintf(header, "local const ct_data static_dtree[D_CODES] = {\n"); for (i = 0; i < D_CODES; i++) { fprintf(header, "{{%2u},{%2u}}%s", static_dtree[i].Code, static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5)); } fprintf(header, "const uch ZLIB_INTERNAL _dist_code[DIST_CODE_LEN] = {\n"); for (i = 0; i < DIST_CODE_LEN; i++) { fprintf(header, "%2u%s", _dist_code[i], SEPARATOR(i, DIST_CODE_LEN-1, 20)); } fprintf(header, "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n"); for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { fprintf(header, "%2u%s", _length_code[i], SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); } fprintf(header, "local const int base_length[LENGTH_CODES] = {\n"); for (i = 0; i < LENGTH_CODES; i++) { fprintf(header, "%1u%s", base_length[i], SEPARATOR(i, LENGTH_CODES-1, 20)); } fprintf(header, "local const int base_dist[D_CODES] = {\n"); for (i = 0; i < D_CODES; i++) { fprintf(header, "%5u%s", base_dist[i], SEPARATOR(i, D_CODES-1, 10)); } fclose(header); } #endif /* GEN_TREES_H */ /* =========================================================================== * Initialize the tree data structures for a new zlib stream. */ void ZLIB_INTERNAL _tr_init(s) deflate_state *s; { tr_static_init(); s->l_desc.dyn_tree = s->dyn_ltree; s->l_desc.stat_desc = &static_l_desc; s->d_desc.dyn_tree = s->dyn_dtree; s->d_desc.stat_desc = &static_d_desc; s->bl_desc.dyn_tree = s->bl_tree; s->bl_desc.stat_desc = &static_bl_desc; s->bi_buf = 0; s->bi_valid = 0; #ifdef ZLIB_DEBUG s->compressed_len = 0L; s->bits_sent = 0L; #endif /* Initialize the first block of the first file: */ init_block(s); } /* =========================================================================== * Initialize a new block. */ local void init_block(s) deflate_state *s; { int n; /* iterates over tree elements */ /* Initialize the trees. */ for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; s->dyn_ltree[END_BLOCK].Freq = 1; s->opt_len = s->static_len = 0L; s->last_lit = s->matches = 0; } #define SMALLEST 1 /* Index within the heap array of least frequent node in the Huffman tree */ /* =========================================================================== * Remove the smallest element from the heap and recreate the heap with * one less element. Updates heap and heap_len. */ #define pqremove(s, tree, top) \ {\ top = s->heap[SMALLEST]; \ s->heap[SMALLEST] = s->heap[s->heap_len--]; \ pqdownheap(s, tree, SMALLEST); \ } /* =========================================================================== * Compares to subtrees, using the tree depth as tie breaker when * the subtrees have equal frequency. This minimizes the worst case length. */ #define smaller(tree, n, m, depth) \ (tree[n].Freq < tree[m].Freq || \ (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m])) /* =========================================================================== * Restore the heap property by moving down the tree starting at node k, * exchanging a node with the smallest of its two sons if necessary, stopping * when the heap property is re-established (each father smaller than its * two sons). */ local void pqdownheap(s, tree, k) deflate_state *s; ct_data *tree; /* the tree to restore */ int k; /* node to move down */ { int v = s->heap[k]; int j = k << 1; /* left son of k */ while (j <= s->heap_len) { /* Set j to the smallest of the two sons: */ if (j < s->heap_len && smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { j++; } /* Exit if v is smaller than both sons */ if (smaller(tree, v, s->heap[j], s->depth)) break; /* Exchange v with the smallest son */ s->heap[k] = s->heap[j]; k = j; /* And continue down the tree, setting j to the left son of k */ j <<= 1; } s->heap[k] = v; } /* =========================================================================== * Compute the optimal bit lengths for a tree and update the total bit length * for the current block. * IN assertion: the fields freq and dad are set, heap[heap_max] and * above are the tree nodes sorted by increasing frequency. * OUT assertions: the field len is set to the optimal bit length, the * array bl_count contains the frequencies for each bit length. * The length opt_len is updated; static_len is also updated if stree is * not null. */ local void gen_bitlen(s, desc) deflate_state *s; tree_desc *desc; /* the tree descriptor */ { ct_data *tree = desc->dyn_tree; int max_code = desc->max_code; const ct_data *stree = desc->stat_desc->static_tree; const intf *extra = desc->stat_desc->extra_bits; int base = desc->stat_desc->extra_base; int max_length = desc->stat_desc->max_length; int h; /* heap index */ int n, m; /* iterate over the tree elements */ int bits; /* bit length */ int xbits; /* extra bits */ ush f; /* frequency */ int overflow = 0; /* number of elements with bit length too large */ for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0; /* In a first pass, compute the optimal bit lengths (which may * overflow in the case of the bit length tree). */ tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ for (h = s->heap_max+1; h < HEAP_SIZE; h++) { n = s->heap[h]; bits = tree[tree[n].Dad].Len + 1; if (bits > max_length) {bits = max_length; overflow++;} tree[n].Len = (ush)bits; /* We overwrite tree[n].Dad which is no longer needed */ if (n > max_code) continue; /* not a leaf node */ s->bl_count[bits]++; xbits = 0; if (n >= base) xbits = extra[n-base]; f = tree[n].Freq; s->opt_len += (ulg)f * (unsigned)(bits + xbits); if (stree) s->static_len += (ulg)f * (unsigned)(stree[n].Len + xbits); } if (overflow == 0) return; Tracev((stderr,"\nbit length overflow\n")); /* This happens for example on obj2 and pic of the Calgary corpus */ /* Find the first bit length which could increase: */ do { bits = max_length-1; while (s->bl_count[bits] == 0) bits--; s->bl_count[bits]--; /* move one leaf down the tree */ s->bl_count[bits+1] += 2; /* move one overflow item as its brother */ s->bl_count[max_length]--; /* The brother of the overflow item also moves one step up, * but this does not affect bl_count[max_length] */ overflow -= 2; } while (overflow > 0); /* Now recompute all bit lengths, scanning in increasing frequency. * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all * lengths instead of fixing only the wrong ones. This idea is taken * from 'ar' written by Haruhiko Okumura.) */ for (bits = max_length; bits != 0; bits--) { n = s->bl_count[bits]; while (n != 0) { m = s->heap[--h]; if (m > max_code) continue; if ((unsigned) tree[m].Len != (unsigned) bits) { Tracev((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits)); s->opt_len += ((ulg)bits - tree[m].Len) * tree[m].Freq; tree[m].Len = (ush)bits; } n--; } } } /* =========================================================================== * Generate the codes for a given tree and bit counts (which need not be * optimal). * IN assertion: the array bl_count contains the bit length statistics for * the given tree and the field len is set for all tree elements. * OUT assertion: the field code is set for all tree elements of non * zero code length. */ local void gen_codes (tree, max_code, bl_count) ct_data *tree; /* the tree to decorate */ int max_code; /* largest code with non zero frequency */ ushf *bl_count; /* number of codes at each bit length */ { ush next_code[MAX_BITS+1]; /* next code value for each bit length */ unsigned code = 0; /* running code value */ int bits; /* bit index */ int n; /* code index */ /* The distribution counts are first used to generate the code values * without bit reversal. */ for (bits = 1; bits <= MAX_BITS; bits++) { code = (code + bl_count[bits-1]) << 1; next_code[bits] = (ush)code; } /* Check that the bit counts in bl_count are consistent. The last code * must be all ones. */ Assert (code + bl_count[MAX_BITS]-1 == (1<dyn_tree; const ct_data *stree = desc->stat_desc->static_tree; int elems = desc->stat_desc->elems; int n, m; /* iterate over heap elements */ int max_code = -1; /* largest code with non zero frequency */ int node; /* new node being created */ /* Construct the initial heap, with least frequent element in * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1]. * heap[0] is not used. */ s->heap_len = 0; s->heap_max = HEAP_SIZE; for (n = 0; n < elems; n++) { if (tree[n].Freq != 0) { s->heap[++(s->heap_len)] = max_code = n; s->depth[n] = 0; } else { tree[n].Len = 0; } } /* The pkzip format requires that at least one distance code exists, * and that at least one bit should be sent even if there is only one * possible code. So to avoid special checks later on we force at least * two codes of non zero frequency. */ while (s->heap_len < 2) { node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); tree[node].Freq = 1; s->depth[node] = 0; s->opt_len--; if (stree) s->static_len -= stree[node].Len; /* node is 0 or 1 so it does not have extra bits */ } desc->max_code = max_code; /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree, * establish sub-heaps of increasing lengths: */ for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n); /* Construct the Huffman tree by repeatedly combining the least two * frequent nodes. */ node = elems; /* next internal node of the tree */ do { pqremove(s, tree, n); /* n = node of least frequency */ m = s->heap[SMALLEST]; /* m = node of next least frequency */ s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */ s->heap[--(s->heap_max)] = m; /* Create a new node father of n and m */ tree[node].Freq = tree[n].Freq + tree[m].Freq; s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ? s->depth[n] : s->depth[m]) + 1); tree[n].Dad = tree[m].Dad = (ush)node; #ifdef DUMP_BL_TREE if (tree == s->bl_tree) { fprintf(stderr,"\nnode %d(%d), sons %d(%d) %d(%d)", node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq); } #endif /* and insert the new node in the heap */ s->heap[SMALLEST] = node++; pqdownheap(s, tree, SMALLEST); } while (s->heap_len >= 2); s->heap[--(s->heap_max)] = s->heap[SMALLEST]; /* At this point, the fields freq and dad are set. We can now * generate the bit lengths. */ gen_bitlen(s, (tree_desc *)desc); /* The field len is now set, we can generate the bit codes */ gen_codes ((ct_data *)tree, max_code, s->bl_count); } /* =========================================================================== * Scan a literal or distance tree to determine the frequencies of the codes * in the bit length tree. */ local void scan_tree (s, tree, max_code) deflate_state *s; ct_data *tree; /* the tree to be scanned */ int max_code; /* and its largest code of non zero frequency */ { int n; /* iterates over all tree elements */ int prevlen = -1; /* last emitted length */ int curlen; /* length of current code */ int nextlen = tree[0].Len; /* length of next code */ int count = 0; /* repeat count of the current code */ int max_count = 7; /* max repeat count */ int min_count = 4; /* min repeat count */ if (nextlen == 0) {max_count = 138; min_count = 3;} tree[max_code+1].Len = (ush)0xffff; /* guard */ for (n = 0; n <= max_code; n++) { curlen = nextlen; nextlen = tree[n+1].Len; if (++count < max_count && curlen == nextlen) { continue; } else if (count < min_count) { s->bl_tree[curlen].Freq += count; } else if (curlen != 0) { if (curlen != prevlen) s->bl_tree[curlen].Freq++; s->bl_tree[REP_3_6].Freq++; } else if (count <= 10) { s->bl_tree[REPZ_3_10].Freq++; } else { s->bl_tree[REPZ_11_138].Freq++; } count = 0; prevlen = curlen; if (nextlen == 0) { max_count = 138; min_count = 3; } else if (curlen == nextlen) { max_count = 6; min_count = 3; } else { max_count = 7; min_count = 4; } } } /* =========================================================================== * Send a literal or distance tree in compressed form, using the codes in * bl_tree. */ local void send_tree (s, tree, max_code) deflate_state *s; ct_data *tree; /* the tree to be scanned */ int max_code; /* and its largest code of non zero frequency */ { int n; /* iterates over all tree elements */ int prevlen = -1; /* last emitted length */ int curlen; /* length of current code */ int nextlen = tree[0].Len; /* length of next code */ int count = 0; /* repeat count of the current code */ int max_count = 7; /* max repeat count */ int min_count = 4; /* min repeat count */ /* tree[max_code+1].Len = -1; */ /* guard already set */ if (nextlen == 0) {max_count = 138; min_count = 3;} for (n = 0; n <= max_code; n++) { curlen = nextlen; nextlen = tree[n+1].Len; if (++count < max_count && curlen == nextlen) { continue; } else if (count < min_count) { do { send_code(s, curlen, s->bl_tree); } while (--count != 0); } else if (curlen != 0) { if (curlen != prevlen) { send_code(s, curlen, s->bl_tree); count--; } Assert(count >= 3 && count <= 6, " 3_6?"); send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2); } else if (count <= 10) { send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3); } else { send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7); } count = 0; prevlen = curlen; if (nextlen == 0) { max_count = 138; min_count = 3; } else if (curlen == nextlen) { max_count = 6; min_count = 3; } else { max_count = 7; min_count = 4; } } } /* =========================================================================== * Construct the Huffman tree for the bit lengths and return the index in * bl_order of the last bit length code to send. */ local int build_bl_tree(s) deflate_state *s; { int max_blindex; /* index of last bit length code of non zero freq */ /* Determine the bit length frequencies for literal and distance trees */ scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code); scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); /* Build the bit length tree: */ build_tree(s, (tree_desc *)(&(s->bl_desc))); /* opt_len now includes the length of the tree representations, except * the lengths of the bit lengths codes and the 5+5+4 bits for the counts. */ /* Determine the number of bit length codes to send. The pkzip format * requires that at least 4 bit length codes be sent. (appnote.txt says * 3 but the actual value used is 4.) */ for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { if (s->bl_tree[bl_order[max_blindex]].Len != 0) break; } /* Update opt_len to include the bit length tree and counts */ s->opt_len += 3*((ulg)max_blindex+1) + 5+5+4; Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", s->opt_len, s->static_len)); return max_blindex; } /* =========================================================================== * Send the header for a block using dynamic Huffman trees: the counts, the * lengths of the bit length codes, the literal tree and the distance tree. * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4. */ local void send_all_trees(s, lcodes, dcodes, blcodes) deflate_state *s; int lcodes, dcodes, blcodes; /* number of codes for each tree */ { int rank; /* index in bl_order */ Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, "too many codes"); Tracev((stderr, "\nbl counts: ")); send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */ send_bits(s, dcodes-1, 5); send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */ for (rank = 0; rank < blcodes; rank++) { Tracev((stderr, "\nbl code %2d ", bl_order[rank])); send_bits(s, s->bl_tree[bl_order[rank]].Len, 3); } Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent)); send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */ Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent)); send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent)); } /* =========================================================================== * Send a stored block */ void ZLIB_INTERNAL _tr_stored_block(s, buf, stored_len, last) deflate_state *s; charf *buf; /* input block */ ulg stored_len; /* length of input block */ int last; /* one if this is the last block for a file */ { send_bits(s, (STORED_BLOCK<<1)+last, 3); /* send block type */ bi_windup(s); /* align on byte boundary */ put_short(s, (ush)stored_len); put_short(s, (ush)~stored_len); zmemcpy(s->pending_buf + s->pending, (Bytef *)buf, stored_len); s->pending += stored_len; #ifdef ZLIB_DEBUG s->compressed_len = (s->compressed_len + 3 + 7) & (ulg)~7L; s->compressed_len += (stored_len + 4) << 3; s->bits_sent += 2*16; s->bits_sent += stored_len<<3; #endif } /* =========================================================================== * Flush the bits in the bit buffer to pending output (leaves at most 7 bits) */ void ZLIB_INTERNAL _tr_flush_bits(s) deflate_state *s; { bi_flush(s); } /* =========================================================================== * Send one empty static block to give enough lookahead for inflate. * This takes 10 bits, of which 7 may remain in the bit buffer. */ void ZLIB_INTERNAL _tr_align(s) deflate_state *s; { send_bits(s, STATIC_TREES<<1, 3); send_code(s, END_BLOCK, static_ltree); #ifdef ZLIB_DEBUG s->compressed_len += 10L; /* 3 for block type, 7 for EOB */ #endif bi_flush(s); } /* =========================================================================== * Determine the best encoding for the current block: dynamic trees, static * trees or store, and write out the encoded block. */ void ZLIB_INTERNAL _tr_flush_block(s, buf, stored_len, last) deflate_state *s; charf *buf; /* input block, or NULL if too old */ ulg stored_len; /* length of input block */ int last; /* one if this is the last block for a file */ { ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */ int max_blindex = 0; /* index of last bit length code of non zero freq */ /* Build the Huffman trees unless a stored block is forced */ if (s->level > 0) { /* Check if the file is binary or text */ if (s->strm->data_type == Z_UNKNOWN) s->strm->data_type = detect_data_type(s); /* Construct the literal and distance trees */ build_tree(s, (tree_desc *)(&(s->l_desc))); Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len, s->static_len)); build_tree(s, (tree_desc *)(&(s->d_desc))); Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len, s->static_len)); /* At this point, opt_len and static_len are the total bit lengths of * the compressed block data, excluding the tree representations. */ /* Build the bit length tree for the above two trees, and get the index * in bl_order of the last bit length code to send. */ max_blindex = build_bl_tree(s); /* Determine the best encoding. Compute the block lengths in bytes. */ opt_lenb = (s->opt_len+3+7)>>3; static_lenb = (s->static_len+3+7)>>3; Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ", opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len, s->last_lit)); if (static_lenb <= opt_lenb) opt_lenb = static_lenb; } else { Assert(buf != (char*)0, "lost buf"); opt_lenb = static_lenb = stored_len + 5; /* force a stored block */ } #ifdef FORCE_STORED if (buf != (char*)0) { /* force stored block */ #else if (stored_len+4 <= opt_lenb && buf != (char*)0) { /* 4: two words for the lengths */ #endif /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE. * Otherwise we can't have processed more than WSIZE input bytes since * the last block flush, because compression would have been * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to * transform a block into a stored block. */ _tr_stored_block(s, buf, stored_len, last); #ifdef FORCE_STATIC } else if (static_lenb >= 0) { /* force static trees */ #else } else if (s->strategy == Z_FIXED || static_lenb == opt_lenb) { #endif send_bits(s, (STATIC_TREES<<1)+last, 3); compress_block(s, (const ct_data *)static_ltree, (const ct_data *)static_dtree); #ifdef ZLIB_DEBUG s->compressed_len += 3 + s->static_len; #endif } else { send_bits(s, (DYN_TREES<<1)+last, 3); send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1, max_blindex+1); compress_block(s, (const ct_data *)s->dyn_ltree, (const ct_data *)s->dyn_dtree); #ifdef ZLIB_DEBUG s->compressed_len += 3 + s->opt_len; #endif } Assert (s->compressed_len == s->bits_sent, "bad compressed size"); /* The above check is made mod 2^32, for files larger than 512 MB * and uLong implemented on 32 bits. */ init_block(s); if (last) { bi_windup(s); #ifdef ZLIB_DEBUG s->compressed_len += 7; /* align on byte boundary */ #endif } Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3, s->compressed_len-7*last)); } /* =========================================================================== * Save the match info and tally the frequency counts. Return true if * the current block must be flushed. */ int ZLIB_INTERNAL _tr_tally (s, dist, lc) deflate_state *s; unsigned dist; /* distance of matched string */ unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ { s->d_buf[s->last_lit] = (ush)dist; s->l_buf[s->last_lit++] = (uch)lc; if (dist == 0) { /* lc is the unmatched char */ s->dyn_ltree[lc].Freq++; } else { s->matches++; /* Here, lc is the match length - MIN_MATCH */ dist--; /* dist = match distance - 1 */ Assert((ush)dist < (ush)MAX_DIST(s) && (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match"); s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++; s->dyn_dtree[d_code(dist)].Freq++; } #ifdef TRUNCATE_BLOCK /* Try to guess if it is profitable to stop the current block here */ if ((s->last_lit & 0x1fff) == 0 && s->level > 2) { /* Compute an upper bound for the compressed length */ ulg out_length = (ulg)s->last_lit*8L; ulg in_length = (ulg)((long)s->strstart - s->block_start); int dcode; for (dcode = 0; dcode < D_CODES; dcode++) { out_length += (ulg)s->dyn_dtree[dcode].Freq * (5L+extra_dbits[dcode]); } out_length >>= 3; Tracev((stderr,"\nlast_lit %u, in %ld, out ~%ld(%ld%%) ", s->last_lit, in_length, out_length, 100L - out_length*100L/in_length)); if (s->matches < s->last_lit/2 && out_length < in_length/2) return 1; } #endif return (s->last_lit == s->lit_bufsize-1); /* We avoid equality with lit_bufsize because of wraparound at 64K * on 16 bit machines and because stored blocks are restricted to * 64K-1 bytes. */ } /* =========================================================================== * Send the block data compressed using the given Huffman trees */ local void compress_block(s, ltree, dtree) deflate_state *s; const ct_data *ltree; /* literal tree */ const ct_data *dtree; /* distance tree */ { unsigned dist; /* distance of matched string */ int lc; /* match length or unmatched char (if dist == 0) */ unsigned lx = 0; /* running index in l_buf */ unsigned code; /* the code to send */ int extra; /* number of extra bits to send */ if (s->last_lit != 0) do { dist = s->d_buf[lx]; lc = s->l_buf[lx++]; if (dist == 0) { send_code(s, lc, ltree); /* send a literal byte */ Tracecv(isgraph(lc), (stderr," '%c' ", lc)); } else { /* Here, lc is the match length - MIN_MATCH */ code = _length_code[lc]; send_code(s, code+LITERALS+1, ltree); /* send the length code */ extra = extra_lbits[code]; if (extra != 0) { lc -= base_length[code]; send_bits(s, lc, extra); /* send the extra length bits */ } dist--; /* dist is now the match distance - 1 */ code = d_code(dist); Assert (code < D_CODES, "bad d_code"); send_code(s, code, dtree); /* send the distance code */ extra = extra_dbits[code]; if (extra != 0) { dist -= (unsigned)base_dist[code]; send_bits(s, dist, extra); /* send the extra distance bits */ } } /* literal or match pair ? */ /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */ Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx, "pendingBuf overflow"); } while (lx < s->last_lit); send_code(s, END_BLOCK, ltree); } /* =========================================================================== * Check if the data type is TEXT or BINARY, using the following algorithm: * - TEXT if the two conditions below are satisfied: * a) There are no non-portable control characters belonging to the * "black list" (0..6, 14..25, 28..31). * b) There is at least one printable character belonging to the * "white list" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255). * - BINARY otherwise. * - The following partially-portable control characters form a * "gray list" that is ignored in this detection algorithm: * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}). * IN assertion: the fields Freq of dyn_ltree are set. */ local int detect_data_type(s) deflate_state *s; { /* black_mask is the bit mask of black-listed bytes * set bits 0..6, 14..25, and 28..31 * 0xf3ffc07f = binary 11110011111111111100000001111111 */ unsigned long black_mask = 0xf3ffc07fUL; int n; /* Check for non-textual ("black-listed") bytes. */ for (n = 0; n <= 31; n++, black_mask >>= 1) if ((black_mask & 1) && (s->dyn_ltree[n].Freq != 0)) return Z_BINARY; /* Check for textual ("white-listed") bytes. */ if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0 || s->dyn_ltree[13].Freq != 0) return Z_TEXT; for (n = 32; n < LITERALS; n++) if (s->dyn_ltree[n].Freq != 0) return Z_TEXT; /* There are no "black-listed" or "white-listed" bytes: * this stream either is empty or has tolerated ("gray-listed") bytes only. */ return Z_BINARY; } /* =========================================================================== * Reverse the first len bits of a code, using straightforward code (a faster * method would use a table) * IN assertion: 1 <= len <= 15 */ local unsigned bi_reverse(code, len) unsigned code; /* the value to invert */ int len; /* its bit length */ { register unsigned res = 0; do { res |= code & 1; code >>= 1; res <<= 1; } while (--len > 0); return res >> 1; } /* =========================================================================== * Flush the bit buffer, keeping at most 7 bits in it. */ local void bi_flush(s) deflate_state *s; { if (s->bi_valid == 16) { put_short(s, s->bi_buf); s->bi_buf = 0; s->bi_valid = 0; } else if (s->bi_valid >= 8) { put_byte(s, (Byte)s->bi_buf); s->bi_buf >>= 8; s->bi_valid -= 8; } } /* =========================================================================== * Flush the bit buffer and align the output on a byte boundary */ local void bi_windup(s) deflate_state *s; { if (s->bi_valid > 8) { put_short(s, s->bi_buf); } else if (s->bi_valid > 0) { put_byte(s, (Byte)s->bi_buf); } s->bi_buf = 0; s->bi_valid = 0; #ifdef ZLIB_DEBUG s->bits_sent = (s->bits_sent+7) & ~7; #endif } UEFITool-A66/common/zlib/trees.h000077500000000000000000000204301442134156300165260ustar00rootroot00000000000000/* header created automatically with -DGEN_TREES_H */ local const ct_data static_ltree[L_CODES+2] = { {{ 12},{ 8}}, {{140},{ 8}}, {{ 76},{ 8}}, {{204},{ 8}}, {{ 44},{ 8}}, {{172},{ 8}}, {{108},{ 8}}, {{236},{ 8}}, {{ 28},{ 8}}, {{156},{ 8}}, {{ 92},{ 8}}, {{220},{ 8}}, {{ 60},{ 8}}, {{188},{ 8}}, {{124},{ 8}}, {{252},{ 8}}, {{ 2},{ 8}}, {{130},{ 8}}, {{ 66},{ 8}}, {{194},{ 8}}, {{ 34},{ 8}}, {{162},{ 8}}, {{ 98},{ 8}}, {{226},{ 8}}, {{ 18},{ 8}}, {{146},{ 8}}, {{ 82},{ 8}}, {{210},{ 8}}, {{ 50},{ 8}}, {{178},{ 8}}, {{114},{ 8}}, {{242},{ 8}}, {{ 10},{ 8}}, {{138},{ 8}}, {{ 74},{ 8}}, {{202},{ 8}}, {{ 42},{ 8}}, {{170},{ 8}}, {{106},{ 8}}, {{234},{ 8}}, {{ 26},{ 8}}, {{154},{ 8}}, {{ 90},{ 8}}, {{218},{ 8}}, {{ 58},{ 8}}, {{186},{ 8}}, {{122},{ 8}}, {{250},{ 8}}, {{ 6},{ 8}}, {{134},{ 8}}, {{ 70},{ 8}}, {{198},{ 8}}, {{ 38},{ 8}}, {{166},{ 8}}, {{102},{ 8}}, {{230},{ 8}}, {{ 22},{ 8}}, {{150},{ 8}}, {{ 86},{ 8}}, {{214},{ 8}}, {{ 54},{ 8}}, {{182},{ 8}}, {{118},{ 8}}, {{246},{ 8}}, {{ 14},{ 8}}, {{142},{ 8}}, {{ 78},{ 8}}, {{206},{ 8}}, {{ 46},{ 8}}, {{174},{ 8}}, {{110},{ 8}}, {{238},{ 8}}, {{ 30},{ 8}}, {{158},{ 8}}, {{ 94},{ 8}}, {{222},{ 8}}, {{ 62},{ 8}}, {{190},{ 8}}, {{126},{ 8}}, {{254},{ 8}}, {{ 1},{ 8}}, {{129},{ 8}}, {{ 65},{ 8}}, {{193},{ 8}}, {{ 33},{ 8}}, {{161},{ 8}}, {{ 97},{ 8}}, {{225},{ 8}}, {{ 17},{ 8}}, {{145},{ 8}}, {{ 81},{ 8}}, {{209},{ 8}}, {{ 49},{ 8}}, {{177},{ 8}}, {{113},{ 8}}, {{241},{ 8}}, {{ 9},{ 8}}, {{137},{ 8}}, {{ 73},{ 8}}, {{201},{ 8}}, {{ 41},{ 8}}, {{169},{ 8}}, {{105},{ 8}}, {{233},{ 8}}, {{ 25},{ 8}}, {{153},{ 8}}, {{ 89},{ 8}}, {{217},{ 8}}, {{ 57},{ 8}}, {{185},{ 8}}, {{121},{ 8}}, {{249},{ 8}}, {{ 5},{ 8}}, {{133},{ 8}}, {{ 69},{ 8}}, {{197},{ 8}}, {{ 37},{ 8}}, {{165},{ 8}}, {{101},{ 8}}, {{229},{ 8}}, {{ 21},{ 8}}, {{149},{ 8}}, {{ 85},{ 8}}, {{213},{ 8}}, {{ 53},{ 8}}, {{181},{ 8}}, {{117},{ 8}}, {{245},{ 8}}, {{ 13},{ 8}}, {{141},{ 8}}, {{ 77},{ 8}}, {{205},{ 8}}, {{ 45},{ 8}}, {{173},{ 8}}, {{109},{ 8}}, {{237},{ 8}}, {{ 29},{ 8}}, {{157},{ 8}}, {{ 93},{ 8}}, {{221},{ 8}}, {{ 61},{ 8}}, {{189},{ 8}}, {{125},{ 8}}, {{253},{ 8}}, {{ 19},{ 9}}, {{275},{ 9}}, {{147},{ 9}}, {{403},{ 9}}, {{ 83},{ 9}}, {{339},{ 9}}, {{211},{ 9}}, {{467},{ 9}}, {{ 51},{ 9}}, {{307},{ 9}}, {{179},{ 9}}, {{435},{ 9}}, {{115},{ 9}}, {{371},{ 9}}, {{243},{ 9}}, {{499},{ 9}}, {{ 11},{ 9}}, {{267},{ 9}}, {{139},{ 9}}, {{395},{ 9}}, {{ 75},{ 9}}, {{331},{ 9}}, {{203},{ 9}}, {{459},{ 9}}, {{ 43},{ 9}}, {{299},{ 9}}, {{171},{ 9}}, {{427},{ 9}}, {{107},{ 9}}, {{363},{ 9}}, {{235},{ 9}}, {{491},{ 9}}, {{ 27},{ 9}}, {{283},{ 9}}, {{155},{ 9}}, {{411},{ 9}}, {{ 91},{ 9}}, {{347},{ 9}}, {{219},{ 9}}, {{475},{ 9}}, {{ 59},{ 9}}, {{315},{ 9}}, {{187},{ 9}}, {{443},{ 9}}, {{123},{ 9}}, {{379},{ 9}}, {{251},{ 9}}, {{507},{ 9}}, {{ 7},{ 9}}, {{263},{ 9}}, {{135},{ 9}}, {{391},{ 9}}, {{ 71},{ 9}}, {{327},{ 9}}, {{199},{ 9}}, {{455},{ 9}}, {{ 39},{ 9}}, {{295},{ 9}}, {{167},{ 9}}, {{423},{ 9}}, {{103},{ 9}}, {{359},{ 9}}, {{231},{ 9}}, {{487},{ 9}}, {{ 23},{ 9}}, {{279},{ 9}}, {{151},{ 9}}, {{407},{ 9}}, {{ 87},{ 9}}, {{343},{ 9}}, {{215},{ 9}}, {{471},{ 9}}, {{ 55},{ 9}}, {{311},{ 9}}, {{183},{ 9}}, {{439},{ 9}}, {{119},{ 9}}, {{375},{ 9}}, {{247},{ 9}}, {{503},{ 9}}, {{ 15},{ 9}}, {{271},{ 9}}, {{143},{ 9}}, {{399},{ 9}}, {{ 79},{ 9}}, {{335},{ 9}}, {{207},{ 9}}, {{463},{ 9}}, {{ 47},{ 9}}, {{303},{ 9}}, {{175},{ 9}}, {{431},{ 9}}, {{111},{ 9}}, {{367},{ 9}}, {{239},{ 9}}, {{495},{ 9}}, {{ 31},{ 9}}, {{287},{ 9}}, {{159},{ 9}}, {{415},{ 9}}, {{ 95},{ 9}}, {{351},{ 9}}, {{223},{ 9}}, {{479},{ 9}}, {{ 63},{ 9}}, {{319},{ 9}}, {{191},{ 9}}, {{447},{ 9}}, {{127},{ 9}}, {{383},{ 9}}, {{255},{ 9}}, {{511},{ 9}}, {{ 0},{ 7}}, {{ 64},{ 7}}, {{ 32},{ 7}}, {{ 96},{ 7}}, {{ 16},{ 7}}, {{ 80},{ 7}}, {{ 48},{ 7}}, {{112},{ 7}}, {{ 8},{ 7}}, {{ 72},{ 7}}, {{ 40},{ 7}}, {{104},{ 7}}, {{ 24},{ 7}}, {{ 88},{ 7}}, {{ 56},{ 7}}, {{120},{ 7}}, {{ 4},{ 7}}, {{ 68},{ 7}}, {{ 36},{ 7}}, {{100},{ 7}}, {{ 20},{ 7}}, {{ 84},{ 7}}, {{ 52},{ 7}}, {{116},{ 7}}, {{ 3},{ 8}}, {{131},{ 8}}, {{ 67},{ 8}}, {{195},{ 8}}, {{ 35},{ 8}}, {{163},{ 8}}, {{ 99},{ 8}}, {{227},{ 8}} }; local const ct_data static_dtree[D_CODES] = { {{ 0},{ 5}}, {{16},{ 5}}, {{ 8},{ 5}}, {{24},{ 5}}, {{ 4},{ 5}}, {{20},{ 5}}, {{12},{ 5}}, {{28},{ 5}}, {{ 2},{ 5}}, {{18},{ 5}}, {{10},{ 5}}, {{26},{ 5}}, {{ 6},{ 5}}, {{22},{ 5}}, {{14},{ 5}}, {{30},{ 5}}, {{ 1},{ 5}}, {{17},{ 5}}, {{ 9},{ 5}}, {{25},{ 5}}, {{ 5},{ 5}}, {{21},{ 5}}, {{13},{ 5}}, {{29},{ 5}}, {{ 3},{ 5}}, {{19},{ 5}}, {{11},{ 5}}, {{27},{ 5}}, {{ 7},{ 5}}, {{23},{ 5}} }; const uch ZLIB_INTERNAL _dist_code[DIST_CODE_LEN] = { 0, 1, 2, 3, 4, 4, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 0, 0, 16, 17, 18, 18, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22, 23, 23, 23, 23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29 }; const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= { 0, 1, 2, 3, 4, 5, 6, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19, 19, 19, 19, 19, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 28 }; local const int base_length[LENGTH_CODES] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 20, 24, 28, 32, 40, 48, 56, 64, 80, 96, 112, 128, 160, 192, 224, 0 }; local const int base_dist[D_CODES] = { 0, 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 128, 192, 256, 384, 512, 768, 1024, 1536, 2048, 3072, 4096, 6144, 8192, 12288, 16384, 24576 }; UEFITool-A66/common/zlib/uncompr.c000077500000000000000000000056261442134156300170740ustar00rootroot00000000000000/* uncompr.c -- decompress a memory buffer * Copyright (C) 1995-2003, 2010, 2014, 2016 Jean-loup Gailly, Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ /* @(#) $Id$ */ #define ZLIB_INTERNAL #include "zlib.h" /* =========================================================================== Decompresses the source buffer into the destination buffer. *sourceLen is the byte length of the source buffer. Upon entry, *destLen is the total size of the destination buffer, which must be large enough to hold the entire uncompressed data. (The size of the uncompressed data must have been saved previously by the compressor and transmitted to the decompressor by some mechanism outside the scope of this compression library.) Upon exit, *destLen is the size of the decompressed data and *sourceLen is the number of source bytes consumed. Upon return, source + *sourceLen points to the first unused input byte. uncompress returns Z_OK if success, Z_MEM_ERROR if there was not enough memory, Z_BUF_ERROR if there was not enough room in the output buffer, or Z_DATA_ERROR if the input data was corrupted, including if the input data is an incomplete zlib stream. */ int ZEXPORT uncompress2 (dest, destLen, source, sourceLen) Bytef *dest; uLongf *destLen; const Bytef *source; uLong *sourceLen; { z_stream stream; int err; const uInt max = (uInt)-1; uLong len, left; Byte buf[1]; /* for detection of incomplete stream when *destLen == 0 */ len = *sourceLen; if (*destLen) { left = *destLen; *destLen = 0; } else { left = 1; dest = buf; } stream.next_in = (z_const Bytef *)source; stream.avail_in = 0; stream.zalloc = (alloc_func)0; stream.zfree = (free_func)0; stream.opaque = (voidpf)0; err = inflateInit(&stream); if (err != Z_OK) return err; stream.next_out = dest; stream.avail_out = 0; do { if (stream.avail_out == 0) { stream.avail_out = left > (uLong)max ? max : (uInt)left; left -= stream.avail_out; } if (stream.avail_in == 0) { stream.avail_in = len > (uLong)max ? max : (uInt)len; len -= stream.avail_in; } err = inflate(&stream, Z_NO_FLUSH); } while (err == Z_OK); *sourceLen -= len + stream.avail_in; if (dest != buf) *destLen = stream.total_out; else if (stream.total_out && err == Z_BUF_ERROR) left = 1; inflateEnd(&stream); return err == Z_STREAM_END ? Z_OK : err == Z_NEED_DICT ? Z_DATA_ERROR : err == Z_BUF_ERROR && left + stream.avail_out ? Z_DATA_ERROR : err; } int ZEXPORT uncompress (dest, destLen, source, sourceLen) Bytef *dest; uLongf *destLen; const Bytef *source; uLong sourceLen; { return uncompress2(dest, destLen, source, &sourceLen); } UEFITool-A66/common/zlib/zconf.h000077500000000000000000000376521442134156300165410ustar00rootroot00000000000000/* zconf.h -- configuration of the zlib compression library * Copyright (C) 1995-2016 Jean-loup Gailly, Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ /* @(#) $Id$ */ #ifndef ZCONF_H #define ZCONF_H /* * If you *really* need a unique prefix for all types and library functions, * compile with -DZ_PREFIX. The "standard" zlib should be compiled without it. * Even better than compiling with -DZ_PREFIX would be to use configure to set * this permanently in zconf.h using "./configure --zprefix". */ #ifdef Z_PREFIX /* may be set to #if 1 by ./configure */ # define Z_PREFIX_SET /* all linked symbols and init macros */ # define _dist_code z__dist_code # define _length_code z__length_code # define _tr_align z__tr_align # define _tr_flush_bits z__tr_flush_bits # define _tr_flush_block z__tr_flush_block # define _tr_init z__tr_init # define _tr_stored_block z__tr_stored_block # define _tr_tally z__tr_tally # define adler32 z_adler32 # define adler32_combine z_adler32_combine # define adler32_combine64 z_adler32_combine64 # define adler32_z z_adler32_z # ifndef Z_SOLO # define compress z_compress # define compress2 z_compress2 # define compressBound z_compressBound # endif # define crc32 z_crc32 # define crc32_combine z_crc32_combine # define crc32_combine64 z_crc32_combine64 # define crc32_z z_crc32_z # define deflate z_deflate # define deflateBound z_deflateBound # define deflateCopy z_deflateCopy # define deflateEnd z_deflateEnd # define deflateGetDictionary z_deflateGetDictionary # define deflateInit z_deflateInit # define deflateInit2 z_deflateInit2 # define deflateInit2_ z_deflateInit2_ # define deflateInit_ z_deflateInit_ # define deflateParams z_deflateParams # define deflatePending z_deflatePending # define deflatePrime z_deflatePrime # define deflateReset z_deflateReset # define deflateResetKeep z_deflateResetKeep # define deflateSetDictionary z_deflateSetDictionary # define deflateSetHeader z_deflateSetHeader # define deflateTune z_deflateTune # define deflate_copyright z_deflate_copyright # define get_crc_table z_get_crc_table # ifndef Z_SOLO # define gz_error z_gz_error # define gz_intmax z_gz_intmax # define gz_strwinerror z_gz_strwinerror # define gzbuffer z_gzbuffer # define gzclearerr z_gzclearerr # define gzclose z_gzclose # define gzclose_r z_gzclose_r # define gzclose_w z_gzclose_w # define gzdirect z_gzdirect # define gzdopen z_gzdopen # define gzeof z_gzeof # define gzerror z_gzerror # define gzflush z_gzflush # define gzfread z_gzfread # define gzfwrite z_gzfwrite # define gzgetc z_gzgetc # define gzgetc_ z_gzgetc_ # define gzgets z_gzgets # define gzoffset z_gzoffset # define gzoffset64 z_gzoffset64 # define gzopen z_gzopen # define gzopen64 z_gzopen64 # ifdef _WIN32 # define gzopen_w z_gzopen_w # endif # define gzprintf z_gzprintf # define gzputc z_gzputc # define gzputs z_gzputs # define gzread z_gzread # define gzrewind z_gzrewind # define gzseek z_gzseek # define gzseek64 z_gzseek64 # define gzsetparams z_gzsetparams # define gztell z_gztell # define gztell64 z_gztell64 # define gzungetc z_gzungetc # define gzvprintf z_gzvprintf # define gzwrite z_gzwrite # endif # define inflate z_inflate # define inflateBack z_inflateBack # define inflateBackEnd z_inflateBackEnd # define inflateBackInit z_inflateBackInit # define inflateBackInit_ z_inflateBackInit_ # define inflateCodesUsed z_inflateCodesUsed # define inflateCopy z_inflateCopy # define inflateEnd z_inflateEnd # define inflateGetDictionary z_inflateGetDictionary # define inflateGetHeader z_inflateGetHeader # define inflateInit z_inflateInit # define inflateInit2 z_inflateInit2 # define inflateInit2_ z_inflateInit2_ # define inflateInit_ z_inflateInit_ # define inflateMark z_inflateMark # define inflatePrime z_inflatePrime # define inflateReset z_inflateReset # define inflateReset2 z_inflateReset2 # define inflateResetKeep z_inflateResetKeep # define inflateSetDictionary z_inflateSetDictionary # define inflateSync z_inflateSync # define inflateSyncPoint z_inflateSyncPoint # define inflateUndermine z_inflateUndermine # define inflateValidate z_inflateValidate # define inflate_copyright z_inflate_copyright # define inflate_fast z_inflate_fast # define inflate_table z_inflate_table # ifndef Z_SOLO # define uncompress z_uncompress # define uncompress2 z_uncompress2 # endif # define zError z_zError # ifndef Z_SOLO # define zcalloc z_zcalloc # define zcfree z_zcfree # endif # define zlibCompileFlags z_zlibCompileFlags # define zlibVersion z_zlibVersion /* all zlib typedefs in zlib.h and zconf.h */ # define Byte z_Byte # define Bytef z_Bytef # define alloc_func z_alloc_func # define charf z_charf # define free_func z_free_func # ifndef Z_SOLO # define gzFile z_gzFile # endif # define gz_header z_gz_header # define gz_headerp z_gz_headerp # define in_func z_in_func # define intf z_intf # define out_func z_out_func # define uInt z_uInt # define uIntf z_uIntf # define uLong z_uLong # define uLongf z_uLongf # define voidp z_voidp # define voidpc z_voidpc # define voidpf z_voidpf /* all zlib structs in zlib.h and zconf.h */ # define gz_header_s z_gz_header_s # define internal_state z_internal_state #endif #if defined(__MSDOS__) && !defined(MSDOS) # define MSDOS #endif #if (defined(OS_2) || defined(__OS2__)) && !defined(OS2) # define OS2 #endif #if defined(_WINDOWS) && !defined(WINDOWS) # define WINDOWS #endif #if defined(_WIN32) || defined(_WIN32_WCE) || defined(__WIN32__) # ifndef WIN32 # define WIN32 # endif #endif #if (defined(MSDOS) || defined(OS2) || defined(WINDOWS)) && !defined(WIN32) # if !defined(__GNUC__) && !defined(__FLAT__) && !defined(__386__) # ifndef SYS16BIT # define SYS16BIT # endif # endif #endif /* * Compile with -DMAXSEG_64K if the alloc function cannot allocate more * than 64k bytes at a time (needed on systems with 16-bit int). */ #ifdef SYS16BIT # define MAXSEG_64K #endif #ifdef MSDOS # define UNALIGNED_OK #endif #ifdef __STDC_VERSION__ # ifndef STDC # define STDC # endif # if __STDC_VERSION__ >= 199901L # ifndef STDC99 # define STDC99 # endif # endif #endif #if !defined(STDC) && (defined(__STDC__) || defined(__cplusplus)) # define STDC #endif #if !defined(STDC) && (defined(__GNUC__) || defined(__BORLANDC__)) # define STDC #endif #if !defined(STDC) && (defined(MSDOS) || defined(WINDOWS) || defined(WIN32)) # define STDC #endif #if !defined(STDC) && (defined(OS2) || defined(__HOS_AIX__)) # define STDC #endif #if defined(__OS400__) && !defined(STDC) /* iSeries (formerly AS/400). */ # define STDC #endif #ifndef STDC # ifndef const /* cannot use !defined(STDC) && !defined(const) on Mac */ # define const /* note: need a more gentle solution here */ # endif #endif #if defined(ZLIB_CONST) && !defined(z_const) # define z_const const #else # define z_const #endif #ifdef Z_SOLO typedef unsigned long z_size_t; #else # define z_longlong long long # if defined(NO_SIZE_T) typedef unsigned NO_SIZE_T z_size_t; # elif defined(STDC) # include typedef size_t z_size_t; # else typedef unsigned long z_size_t; # endif # undef z_longlong #endif /* Maximum value for memLevel in deflateInit2 */ #ifndef MAX_MEM_LEVEL # ifdef MAXSEG_64K # define MAX_MEM_LEVEL 8 # else # define MAX_MEM_LEVEL 9 # endif #endif /* Maximum value for windowBits in deflateInit2 and inflateInit2. * WARNING: reducing MAX_WBITS makes minigzip unable to extract .gz files * created by gzip. (Files created by minigzip can still be extracted by * gzip.) */ #ifndef MAX_WBITS # define MAX_WBITS 15 /* 32K LZ77 window */ #endif /* The memory requirements for deflate are (in bytes): (1 << (windowBits+2)) + (1 << (memLevel+9)) that is: 128K for windowBits=15 + 128K for memLevel = 8 (default values) plus a few kilobytes for small objects. For example, if you want to reduce the default memory requirements from 256K to 128K, compile with make CFLAGS="-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7" Of course this will generally degrade compression (there's no free lunch). The memory requirements for inflate are (in bytes) 1 << windowBits that is, 32K for windowBits=15 (default value) plus about 7 kilobytes for small objects. */ /* Type declarations */ #ifndef OF /* function prototypes */ # ifdef STDC # define OF(args) args # else # define OF(args) () # endif #endif #ifndef Z_ARG /* function prototypes for stdarg */ # if defined(STDC) || defined(Z_HAVE_STDARG_H) # define Z_ARG(args) args # else # define Z_ARG(args) () # endif #endif /* The following definitions for FAR are needed only for MSDOS mixed * model programming (small or medium model with some far allocations). * This was tested only with MSC; for other MSDOS compilers you may have * to define NO_MEMCPY in zutil.h. If you don't need the mixed model, * just define FAR to be empty. */ #ifdef SYS16BIT # if defined(M_I86SM) || defined(M_I86MM) /* MSC small or medium model */ # define SMALL_MEDIUM # ifdef _MSC_VER # define FAR _far # else # define FAR far # endif # endif # if (defined(__SMALL__) || defined(__MEDIUM__)) /* Turbo C small or medium model */ # define SMALL_MEDIUM # ifdef __BORLANDC__ # define FAR _far # else # define FAR far # endif # endif #endif #if defined(WINDOWS) || defined(WIN32) /* If building or using zlib as a DLL, define ZLIB_DLL. * This is not mandatory, but it offers a little performance increase. */ # ifdef ZLIB_DLL # if defined(WIN32) && (!defined(__BORLANDC__) || (__BORLANDC__ >= 0x500)) # ifdef ZLIB_INTERNAL # define ZEXTERN extern __declspec(dllexport) # else # define ZEXTERN extern __declspec(dllimport) # endif # endif # endif /* ZLIB_DLL */ /* If building or using zlib with the WINAPI/WINAPIV calling convention, * define ZLIB_WINAPI. * Caution: the standard ZLIB1.DLL is NOT compiled using ZLIB_WINAPI. */ # ifdef ZLIB_WINAPI # ifdef FAR # undef FAR # endif # include /* No need for _export, use ZLIB.DEF instead. */ /* For complete Windows compatibility, use WINAPI, not __stdcall. */ # define ZEXPORT WINAPI # ifdef WIN32 # define ZEXPORTVA WINAPIV # else # define ZEXPORTVA FAR CDECL # endif # endif #endif #if defined (__BEOS__) # ifdef ZLIB_DLL # ifdef ZLIB_INTERNAL # define ZEXPORT __declspec(dllexport) # define ZEXPORTVA __declspec(dllexport) # else # define ZEXPORT __declspec(dllimport) # define ZEXPORTVA __declspec(dllimport) # endif # endif #endif #ifndef ZEXTERN # define ZEXTERN extern #endif #ifndef ZEXPORT # define ZEXPORT #endif #ifndef ZEXPORTVA # define ZEXPORTVA #endif #ifndef FAR # define FAR #endif #if !defined(__MACTYPES__) typedef unsigned char Byte; /* 8 bits */ #endif typedef unsigned int uInt; /* 16 bits or more */ typedef unsigned long uLong; /* 32 bits or more */ #ifdef SMALL_MEDIUM /* Borland C/C++ and some old MSC versions ignore FAR inside typedef */ # define Bytef Byte FAR #else typedef Byte FAR Bytef; #endif typedef char FAR charf; typedef int FAR intf; typedef uInt FAR uIntf; typedef uLong FAR uLongf; #ifdef STDC typedef void const *voidpc; typedef void FAR *voidpf; typedef void *voidp; #else typedef Byte const *voidpc; typedef Byte FAR *voidpf; typedef Byte *voidp; #endif #if !defined(Z_U4) && !defined(Z_SOLO) && defined(STDC) # include # if (UINT_MAX == 0xffffffffUL) # define Z_U4 unsigned # elif (ULONG_MAX == 0xffffffffUL) # define Z_U4 unsigned long # elif (USHRT_MAX == 0xffffffffUL) # define Z_U4 unsigned short # endif #endif #ifdef Z_U4 typedef Z_U4 z_crc_t; #else typedef unsigned long z_crc_t; #endif #ifdef HAVE_UNISTD_H /* may be set to #if 1 by ./configure */ # define Z_HAVE_UNISTD_H #endif #ifdef HAVE_STDARG_H /* may be set to #if 1 by ./configure */ # define Z_HAVE_STDARG_H #endif #ifdef STDC # ifndef Z_SOLO # include /* for off_t */ # endif #endif #if defined(STDC) || defined(Z_HAVE_STDARG_H) # ifndef Z_SOLO # include /* for va_list */ # endif #endif #ifdef _WIN32 # ifndef Z_SOLO # include /* for wchar_t */ # endif #endif /* a little trick to accommodate both "#define _LARGEFILE64_SOURCE" and * "#define _LARGEFILE64_SOURCE 1" as requesting 64-bit operations, (even * though the former does not conform to the LFS document), but considering * both "#undef _LARGEFILE64_SOURCE" and "#define _LARGEFILE64_SOURCE 0" as * equivalently requesting no 64-bit operations */ #if defined(_LARGEFILE64_SOURCE) && -_LARGEFILE64_SOURCE - -1 == 1 # undef _LARGEFILE64_SOURCE #endif #if defined(__WATCOMC__) && !defined(Z_HAVE_UNISTD_H) # define Z_HAVE_UNISTD_H #endif #ifndef Z_SOLO # if defined(Z_HAVE_UNISTD_H) || defined(_LARGEFILE64_SOURCE) # include /* for SEEK_*, off_t, and _LFS64_LARGEFILE */ # ifdef VMS # include /* for off_t */ # endif # ifndef z_off_t # define z_off_t off_t # endif # endif #endif #if defined(_LFS64_LARGEFILE) && _LFS64_LARGEFILE-0 # define Z_LFS64 #endif #if defined(_LARGEFILE64_SOURCE) && defined(Z_LFS64) # define Z_LARGE64 #endif #if defined(_FILE_OFFSET_BITS) && _FILE_OFFSET_BITS-0 == 64 && defined(Z_LFS64) # define Z_WANT64 #endif #if !defined(SEEK_SET) && !defined(Z_SOLO) # define SEEK_SET 0 /* Seek from beginning of file. */ # define SEEK_CUR 1 /* Seek from current position. */ # define SEEK_END 2 /* Set file pointer to EOF plus "offset" */ #endif #ifndef z_off_t # define z_off_t long #endif #if !defined(_WIN32) && defined(Z_LARGE64) # define z_off64_t off64_t #else # if defined(_WIN32) && !defined(__GNUC__) && !defined(Z_SOLO) # define z_off64_t __int64 # else # define z_off64_t z_off_t # endif #endif /* MVS linker does not support external names larger than 8 bytes */ #if defined(__MVS__) #pragma map(deflateInit_,"DEIN") #pragma map(deflateInit2_,"DEIN2") #pragma map(deflateEnd,"DEEND") #pragma map(deflateBound,"DEBND") #pragma map(inflateInit_,"ININ") #pragma map(inflateInit2_,"ININ2") #pragma map(inflateEnd,"INEND") #pragma map(inflateSync,"INSY") #pragma map(inflateSetDictionary,"INSEDI") #pragma map(compressBound,"CMBND") #pragma map(inflate_table,"INTABL") #pragma map(inflate_fast,"INFA") #pragma map(inflate_copyright,"INCOPY") #endif #endif /* ZCONF_H */ UEFITool-A66/common/zlib/zlib.h000077500000000000000000002737571442134156300163720ustar00rootroot00000000000000/* zlib.h -- interface of the 'zlib' general purpose compression library version 1.2.11, January 15th, 2017 Copyright (C) 1995-2017 Jean-loup Gailly and Mark Adler This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions: 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software. 3. This notice may not be removed or altered from any source distribution. Jean-loup Gailly Mark Adler jloup@gzip.org madler@alumni.caltech.edu The data format used by the zlib library is described by RFCs (Request for Comments) 1950 to 1952 in the files http://tools.ietf.org/html/rfc1950 (zlib format), rfc1951 (deflate format) and rfc1952 (gzip format). */ #ifndef ZLIB_H #define ZLIB_H #include "zconf.h" #ifdef __cplusplus extern "C" { #endif #define ZLIB_VERSION "1.2.11" #define ZLIB_VERNUM 0x12b0 #define ZLIB_VER_MAJOR 1 #define ZLIB_VER_MINOR 2 #define ZLIB_VER_REVISION 11 #define ZLIB_VER_SUBREVISION 0 /* 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, or can be done by repeated calls of the compression function. In the latter case, the application must provide more input and/or consume the output (providing more output space) before each call. The compressed data format used by default by the in-memory functions is the zlib format, which is a zlib wrapper documented in RFC 1950, wrapped around a deflate stream, which is itself documented in RFC 1951. The library also supports reading and writing files in gzip (.gz) format with an interface similar to that of stdio using the functions that start with "gz". The gzip format is different from the zlib format. gzip is a gzip wrapper, documented in RFC 1952, wrapped around a deflate stream. This library can optionally read and write gzip and raw deflate streams in memory as well. The zlib format was designed to be compact and fast for use in memory and on communications channels. The gzip format was designed for single- file compression on file systems, has a larger header than zlib to maintain directory information, and uses a different, slower check method than zlib. The library does not install any signal handler. The decoder checks the consistency of the compressed data, so the library should never crash even in the case of corrupted input. */ typedef voidpf (*alloc_func) OF((voidpf opaque, uInt items, uInt size)); typedef void (*free_func) OF((voidpf opaque, voidpf address)); struct internal_state; typedef struct z_stream_s { z_const Bytef *next_in; /* next input byte */ uInt avail_in; /* number of bytes available at next_in */ uLong total_in; /* total number of input bytes read so far */ Bytef *next_out; /* next output byte will go here */ uInt avail_out; /* remaining free space at next_out */ uLong total_out; /* total number of bytes output so far */ z_const char *msg; /* last error message, NULL if no error */ struct internal_state FAR *state; /* not visible by applications */ alloc_func zalloc; /* used to allocate the internal state */ free_func zfree; /* used to free the internal state */ voidpf opaque; /* private data object passed to zalloc and zfree */ int data_type; /* best guess about the data type: binary or text for deflate, or the decoding state for inflate */ uLong adler; /* Adler-32 or CRC-32 value of the uncompressed data */ uLong reserved; /* reserved for future use */ } z_stream; typedef z_stream FAR *z_streamp; /* gzip header information passed to and from zlib routines. See RFC 1952 for more details on the meanings of these fields. */ typedef struct gz_header_s { int text; /* true if compressed data believed to be text */ uLong time; /* modification time */ int xflags; /* extra flags (not used when writing a gzip file) */ int os; /* operating system */ Bytef *extra; /* pointer to extra field or Z_NULL if none */ uInt extra_len; /* extra field length (valid if extra != Z_NULL) */ uInt extra_max; /* space at extra (only when reading header) */ Bytef *name; /* pointer to zero-terminated file name or Z_NULL */ uInt name_max; /* space at name (only when reading header) */ Bytef *comment; /* pointer to zero-terminated comment or Z_NULL */ uInt comm_max; /* space at comment (only when reading header) */ int hcrc; /* true if there was or will be a header crc */ int done; /* true when done reading gzip header (not used when writing a gzip file) */ } gz_header; typedef gz_header FAR *gz_headerp; /* The application must update next_in and avail_in when avail_in has dropped to zero. It must update next_out and avail_out when avail_out has dropped to zero. The application must initialize zalloc, zfree and opaque before calling the init function. All other fields are set by the compression library and must not be updated by the application. The opaque value provided by the application will be passed as the first parameter for calls of zalloc and zfree. This can be useful for custom memory management. The compression library attaches no meaning to the opaque value. zalloc must return Z_NULL if there is not enough memory for the object. If zlib is used in a multi-threaded application, zalloc and zfree must be thread safe. In that case, zlib is thread-safe. When zalloc and zfree are Z_NULL on entry to the initialization function, they are set to internal routines that use the standard library functions malloc() and free(). On 16-bit systems, the functions zalloc and zfree must be able to allocate exactly 65536 bytes, but will not be required to allocate more than this if the symbol MAXSEG_64K is defined (see zconf.h). WARNING: On MSDOS, pointers returned by zalloc for objects of exactly 65536 bytes *must* have their offset normalized to zero. The default allocation function provided by this library ensures this (see zutil.c). To reduce memory requirements and avoid any allocation of 64K objects, at the expense of compression ratio, compile the library with -DMAX_WBITS=14 (see zconf.h). The fields total_in and total_out can be used for statistics or progress reports. After compression, total_in holds the total size of the uncompressed data and may be saved for use by the decompressor (particularly if the decompressor wants to decompress everything in a single step). */ /* constants */ #define Z_NO_FLUSH 0 #define Z_PARTIAL_FLUSH 1 #define Z_SYNC_FLUSH 2 #define Z_FULL_FLUSH 3 #define Z_FINISH 4 #define Z_BLOCK 5 #define Z_TREES 6 /* Allowed flush values; see deflate() and inflate() below for details */ #define Z_OK 0 #define Z_STREAM_END 1 #define Z_NEED_DICT 2 #define Z_ERRNO (-1) #define Z_STREAM_ERROR (-2) #define Z_DATA_ERROR (-3) #define Z_MEM_ERROR (-4) #define Z_BUF_ERROR (-5) #define Z_VERSION_ERROR (-6) /* Return codes for the compression/decompression functions. Negative values * are errors, positive values are used for special but normal events. */ #define Z_NO_COMPRESSION 0 #define Z_BEST_SPEED 1 #define Z_BEST_COMPRESSION 9 #define Z_DEFAULT_COMPRESSION (-1) /* compression levels */ #define Z_FILTERED 1 #define Z_HUFFMAN_ONLY 2 #define Z_RLE 3 #define Z_FIXED 4 #define Z_DEFAULT_STRATEGY 0 /* compression strategy; see deflateInit2() below for details */ #define Z_BINARY 0 #define Z_TEXT 1 #define Z_ASCII Z_TEXT /* for compatibility with 1.2.2 and earlier */ #define Z_UNKNOWN 2 /* Possible values of the data_type field for deflate() */ #define Z_DEFLATED 8 /* The deflate compression method (the only one supported in this version) */ #define Z_NULL 0 /* for initializing zalloc, zfree, opaque */ #define zlib_version zlibVersion() /* for compatibility with versions < 1.0.2 */ /* basic functions */ ZEXTERN const char * ZEXPORT zlibVersion OF((void)); /* The application can compare zlibVersion and ZLIB_VERSION for consistency. If the first character differs, the library code actually used is not compatible with the zlib.h header file used by the application. This check is automatically made by deflateInit and inflateInit. */ /* ZEXTERN int ZEXPORT deflateInit OF((z_streamp strm, int level)); Initializes the internal stream state for compression. The fields zalloc, zfree and opaque must be initialized before by the caller. If zalloc and zfree are set to Z_NULL, deflateInit updates them to use default allocation functions. The compression level must be Z_DEFAULT_COMPRESSION, or between 0 and 9: 1 gives best speed, 9 gives best compression, 0 gives no compression at all (the input data is simply copied a block at a time). Z_DEFAULT_COMPRESSION requests a default compromise between speed and compression (currently equivalent to level 6). deflateInit returns Z_OK if success, Z_MEM_ERROR if there was not enough memory, Z_STREAM_ERROR if level is not a valid compression level, or Z_VERSION_ERROR if the zlib library version (zlib_version) is incompatible with the version assumed by the caller (ZLIB_VERSION). msg is set to null if there is no error message. deflateInit does not perform any compression: this will be done by deflate(). */ ZEXTERN int ZEXPORT deflate OF((z_streamp strm, int flush)); /* deflate compresses as much data as possible, and stops when the input buffer becomes empty or the output buffer becomes full. It may introduce some output latency (reading input without producing any output) except when forced to flush. The detailed semantics are as follows. deflate performs one or both of the following actions: - Compress more input starting at next_in and update next_in and avail_in accordingly. If not all input can be processed (because there is not enough room in the output buffer), next_in and avail_in are updated and processing will resume at this point for the next call of deflate(). - Generate more output starting at next_out and update next_out and avail_out accordingly. This action is forced if the parameter flush is non zero. Forcing flush frequently degrades the compression ratio, so this parameter should be set only when necessary. Some output may be provided even if flush is zero. Before the call of deflate(), the application should ensure that at least one of the actions is possible, by providing more input and/or consuming more output, and updating avail_in or avail_out accordingly; avail_out should never be zero before the call. The application can consume the compressed output when it wants, for example when the output buffer is full (avail_out == 0), or after each call of deflate(). If deflate returns Z_OK and with zero avail_out, it must be called again after making room in the output buffer because there might be more output pending. See deflatePending(), which can be used if desired to determine whether or not there is more ouput in that case. Normally the parameter flush is set to Z_NO_FLUSH, which allows deflate to decide how much data to accumulate before producing output, in order to maximize compression. If the parameter flush is set to Z_SYNC_FLUSH, all pending output is flushed to the output buffer and the output is aligned on a byte boundary, so that the decompressor can get all input data available so far. (In particular avail_in is zero after the call if enough output space has been provided before the call.) Flushing may degrade compression for some compression algorithms and so it should be used only when necessary. This completes the current deflate block and follows it with an empty stored block that is three bits plus filler bits to the next byte, followed by four bytes (00 00 ff ff). If flush is set to Z_PARTIAL_FLUSH, all pending output is flushed to the output buffer, but the output is not aligned to a byte boundary. All of the input data so far will be available to the decompressor, as for Z_SYNC_FLUSH. This completes the current deflate block and follows it with an empty fixed codes block that is 10 bits long. This assures that enough bytes are output in order for the decompressor to finish the block before the empty fixed codes block. If flush is set to Z_BLOCK, a deflate block is completed and emitted, as for Z_SYNC_FLUSH, but the output is not aligned on a byte boundary, and up to seven bits of the current block are held to be written as the next byte after the next deflate block is completed. In this case, the decompressor may not be provided enough bits at this point in order to complete decompression of the data provided so far to the compressor. It may need to wait for the next block to be emitted. This is for advanced applications that need to control the emission of deflate blocks. If flush is set to Z_FULL_FLUSH, all output is flushed as with Z_SYNC_FLUSH, and the compression state is reset so that decompression can restart from this point if previous compressed data has been damaged or if random access is desired. Using Z_FULL_FLUSH too often can seriously degrade compression. If deflate returns with avail_out == 0, this function must be called again with the same value of the flush parameter and more output space (updated avail_out), until the flush is complete (deflate returns with non-zero avail_out). In the case of a Z_FULL_FLUSH or Z_SYNC_FLUSH, make sure that avail_out is greater than six to avoid repeated flush markers due to avail_out == 0 on return. If the parameter flush is set to Z_FINISH, pending input is processed, pending output is flushed and deflate returns with Z_STREAM_END if there was enough output space. If deflate returns with Z_OK or Z_BUF_ERROR, this function must be called again with Z_FINISH and more output space (updated avail_out) but no more input data, until it returns with Z_STREAM_END or an error. After deflate has returned Z_STREAM_END, the only possible operations on the stream are deflateReset or deflateEnd. Z_FINISH can be used in the first deflate call after deflateInit if all the compression is to be done in a single step. In order to complete in one call, avail_out must be at least the value returned by deflateBound (see below). Then deflate is guaranteed to return Z_STREAM_END. If not enough output space is provided, deflate will not return Z_STREAM_END, and it must be called again as described above. deflate() sets strm->adler to the Adler-32 checksum of all input read so far (that is, total_in bytes). If a gzip stream is being generated, then strm->adler will be the CRC-32 checksum of the input read so far. (See deflateInit2 below.) deflate() may update strm->data_type if it can make a good guess about the input data type (Z_BINARY or Z_TEXT). If in doubt, the data is considered binary. This field is only for information purposes and does not affect the compression algorithm in any manner. deflate() returns Z_OK if some progress has been made (more input processed or more output produced), Z_STREAM_END if all input has been consumed and all output has been produced (only when flush is set to Z_FINISH), Z_STREAM_ERROR if the stream state was inconsistent (for example if next_in or next_out was Z_NULL or the state was inadvertently written over by the application), or Z_BUF_ERROR if no progress is possible (for example avail_in or avail_out was zero). Note that Z_BUF_ERROR is not fatal, and deflate() can be called again with more input and more output space to continue compressing. */ ZEXTERN int ZEXPORT deflateEnd OF((z_streamp strm)); /* All dynamically allocated data structures for this stream are freed. This function discards any unprocessed input and does not flush any pending output. deflateEnd returns Z_OK if success, Z_STREAM_ERROR if the stream state was inconsistent, Z_DATA_ERROR if the stream was freed prematurely (some input or output was discarded). In the error case, msg may be set but then points to a static string (which must not be deallocated). */ /* ZEXTERN int ZEXPORT inflateInit OF((z_streamp strm)); Initializes the internal stream state for decompression. The fields next_in, avail_in, zalloc, zfree and opaque must be initialized before by the caller. In the current version of inflate, the provided input is not read or consumed. The allocation of a sliding window will be deferred to the first call of inflate (if the decompression does not complete on the first call). If zalloc and zfree are set to Z_NULL, inflateInit updates them to use default allocation functions. inflateInit returns Z_OK if success, Z_MEM_ERROR if there was not enough memory, Z_VERSION_ERROR if the zlib library version is incompatible with the version assumed by the caller, or Z_STREAM_ERROR if the parameters are invalid, such as a null pointer to the structure. msg is set to null if there is no error message. inflateInit does not perform any decompression. Actual decompression will be done by inflate(). So next_in, and avail_in, next_out, and avail_out are unused and unchanged. The current implementation of inflateInit() does not process any header information -- that is deferred until inflate() is called. */ ZEXTERN int ZEXPORT inflate OF((z_streamp strm, int flush)); /* inflate decompresses as much data as possible, and stops when the input buffer becomes empty or the output buffer becomes full. It may introduce some output latency (reading input without producing any output) except when forced to flush. The detailed semantics are as follows. inflate performs one or both of the following actions: - Decompress more input starting at next_in and update next_in and avail_in accordingly. If not all input can be processed (because there is not enough room in the output buffer), then next_in and avail_in are updated accordingly, and processing will resume at this point for the next call of inflate(). - Generate 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. If the caller of inflate() does not provide both available input and available output space, it is possible that there will be no progress made. The application can consume the uncompressed output when it wants, for example when the output buffer is full (avail_out == 0), or after each call of inflate(). If inflate returns Z_OK and with zero avail_out, it must be called again after making room in the output buffer because there might be more output pending. The flush parameter of inflate() can be Z_NO_FLUSH, Z_SYNC_FLUSH, Z_FINISH, Z_BLOCK, or Z_TREES. Z_SYNC_FLUSH requests that inflate() flush as much output as possible to the output buffer. Z_BLOCK requests that inflate() stop if and when it gets to the next deflate block boundary. When decoding the zlib or gzip format, this will cause inflate() to return immediately after the header and before the first block. When doing a raw inflate, inflate() will go ahead and process the first block, and will return when it gets to the end of that block, or when it runs out of data. The Z_BLOCK option assists in appending to or combining deflate streams. To assist in this, on return inflate() always sets strm->data_type to the number of unused bits in the last byte taken from strm->next_in, plus 64 if inflate() is currently decoding the last block in the deflate stream, plus 128 if inflate() returned immediately after decoding an end-of-block code or decoding the complete header up to just before the first byte of the deflate stream. The end-of-block will not be indicated until all of the uncompressed data from that block has been written to strm->next_out. The number of unused bits may in general be greater than seven, except when bit 7 of data_type is set, in which case the number of unused bits will be less than eight. data_type is set as noted here every time inflate() returns for all flush options, and so can be used to determine the amount of currently consumed input in bits. The Z_TREES option behaves as Z_BLOCK does, but it also returns when the end of each deflate block header is reached, before any actual data in that block is decoded. This allows the caller to determine the length of the deflate block header for later use in random access within a deflate block. 256 is added to the value of strm->data_type when inflate() returns immediately after reaching the end of the deflate block header. 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 of the uncompressed data for the operation to complete. (The size of the uncompressed data may have been saved by the compressor for this purpose.) The use of Z_FINISH is not required to perform an inflation in one step. However it may be used to inform inflate that a faster approach can be used for the single inflate() call. Z_FINISH also informs inflate to not maintain a sliding window if the stream completes, which reduces inflate's memory footprint. If the stream does not complete, either because not all of the stream is provided or not enough output space is provided, then a sliding window will be allocated and inflate() can be called again to continue the operation as if Z_NO_FLUSH had been used. In this implementation, inflate() always flushes as much output as possible to the output buffer, and always uses the faster approach on the first call. So the effects of the flush parameter in this implementation are on the return value of inflate() as noted below, when inflate() returns early when Z_BLOCK or Z_TREES is used, and when inflate() avoids the allocation of memory for a sliding window when Z_FINISH is used. If a preset dictionary is needed after this call (see inflateSetDictionary below), inflate sets strm->adler to the Adler-32 checksum of the dictionary chosen by the compressor and returns Z_NEED_DICT; otherwise it sets strm->adler to the Adler-32 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 Adler-32 checksum is equal to that saved by the compressor and returns Z_STREAM_END only if the checksum is correct. inflate() can decompress and check either zlib-wrapped or gzip-wrapped deflate data. The header type is detected automatically, if requested when initializing with inflateInit2(). Any information contained in the gzip header is not retained unless inflateGetHeader() is used. When processing gzip-wrapped deflate data, strm->adler32 is set to the CRC-32 of the output produced so far. The CRC-32 is checked against the gzip trailer, as is the uncompressed length, modulo 2^32. inflate() returns Z_OK if some progress has been made (more input processed or more output produced), Z_STREAM_END if the end of the compressed data has been reached and all uncompressed output has been produced, Z_NEED_DICT if a preset dictionary is needed at this point, Z_DATA_ERROR if the input data was corrupted (input stream not conforming to the zlib format or incorrect check value, in which case strm->msg points to a string with a more specific error), Z_STREAM_ERROR if the stream structure was inconsistent (for example next_in or next_out was Z_NULL, or the state was inadvertently written over by the application), Z_MEM_ERROR if there was not enough memory, Z_BUF_ERROR if no progress was possible or if there was not enough room in the output buffer when Z_FINISH is used. Note that Z_BUF_ERROR is not fatal, and inflate() can be called again with more input and more output space to continue decompressing. If Z_DATA_ERROR is returned, the application may then call inflateSync() to look for a good compression block if a partial recovery of the data is to be attempted. */ ZEXTERN int ZEXPORT inflateEnd OF((z_streamp strm)); /* All dynamically allocated data structures for this stream are freed. This function discards any unprocessed input and does not flush any pending output. inflateEnd returns Z_OK if success, or Z_STREAM_ERROR if the stream state was inconsistent. */ /* Advanced functions */ /* The following functions are needed only in some special applications. */ /* ZEXTERN int ZEXPORT deflateInit2 OF((z_streamp strm, int level, int method, int windowBits, int memLevel, int strategy)); This is another version of deflateInit with more compression options. The fields next_in, zalloc, zfree and opaque must be initialized before by the caller. The method parameter is the compression method. It must be Z_DEFLATED in this version of the library. The windowBits parameter is the base two logarithm of the window size (the size of the history buffer). It should be in the range 8..15 for this version of the library. Larger values of this parameter result in better compression at the expense of memory usage. The default value is 15 if deflateInit is used instead. For the current implementation of deflate(), a windowBits value of 8 (a window size of 256 bytes) is not supported. As a result, a request for 8 will result in 9 (a 512-byte window). In that case, providing 8 to inflateInit2() will result in an error when the zlib header with 9 is checked against the initialization of inflate(). The remedy is to not use 8 with deflateInit2() with this initialization, or at least in that case use 9 with inflateInit2(). windowBits can also be -8..-15 for raw deflate. In this case, -windowBits determines the window size. deflate() will then generate raw deflate data with no zlib header or trailer, and will not compute a check value. windowBits can also be greater than 15 for optional gzip encoding. Add 16 to windowBits to write a simple gzip header and trailer around the compressed data instead of a zlib wrapper. The gzip header will have no file name, no extra data, no comment, no modification time (set to zero), no header crc, and the operating system will be set to the appropriate value, if the operating system was determined at compile time. If a gzip stream is being written, strm->adler is a CRC-32 instead of an Adler-32. For raw deflate or gzip encoding, a request for a 256-byte window is rejected as invalid, since only the zlib header provides a means of transmitting the window size to the decompressor. The memLevel parameter specifies how much memory should be allocated for the internal compression state. memLevel=1 uses minimum memory but is slow and reduces compression ratio; memLevel=9 uses maximum memory for optimal speed. The default value is 8. See zconf.h for total memory usage as a function of windowBits and memLevel. The strategy parameter is used to tune the compression algorithm. Use the value Z_DEFAULT_STRATEGY for normal data, Z_FILTERED for data produced by a filter (or predictor), Z_HUFFMAN_ONLY to force Huffman encoding only (no string match), or Z_RLE to limit match distances to one (run-length encoding). Filtered data consists mostly of small values with a somewhat random distribution. In this case, the compression algorithm is tuned to compress them better. The effect of Z_FILTERED is to force more Huffman coding and less string matching; it is somewhat intermediate between Z_DEFAULT_STRATEGY and Z_HUFFMAN_ONLY. Z_RLE is designed to be almost as fast as Z_HUFFMAN_ONLY, but give better compression for PNG image data. The strategy parameter only affects the compression ratio but not the correctness of the compressed output even if it is not set appropriately. Z_FIXED prevents the use of dynamic Huffman codes, allowing for a simpler decoder for special applications. deflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough memory, Z_STREAM_ERROR if any parameter is invalid (such as an invalid method), or Z_VERSION_ERROR if the zlib library version (zlib_version) is incompatible with the version assumed by the caller (ZLIB_VERSION). msg is set to null if there is no error message. deflateInit2 does not perform any compression: this will be done by deflate(). */ ZEXTERN int ZEXPORT deflateSetDictionary OF((z_streamp strm, const Bytef *dictionary, uInt dictLength)); /* Initializes the compression dictionary from the given byte sequence without producing any compressed output. When using the zlib format, this function must be called immediately after deflateInit, deflateInit2 or deflateReset, and before any call of deflate. When doing raw deflate, this function must be called either before any call of deflate, or immediately after the completion of a deflate block, i.e. after all input has been consumed and all output has been delivered when using any of the flush options Z_BLOCK, Z_PARTIAL_FLUSH, Z_SYNC_FLUSH, or Z_FULL_FLUSH. The compressor and decompressor must use exactly the same dictionary (see inflateSetDictionary). The dictionary should consist of strings (byte sequences) that are likely to be encountered later in the data to be compressed, with the most commonly used strings preferably put towards the end of the dictionary. Using a dictionary is most useful when the data to be compressed is short and can be predicted with good accuracy; the data can then be compressed better than with the default empty dictionary. Depending on the size of the compression data structures selected by deflateInit or deflateInit2, a part of the dictionary may in effect be discarded, for example if the dictionary is larger than the window size provided in deflateInit or deflateInit2. Thus the strings most likely to be useful should be put at the end of the dictionary, not at the front. In addition, the current implementation of deflate will use at most the window size minus 262 bytes of the provided dictionary. Upon return of this function, strm->adler is set to the Adler-32 value of the dictionary; the decompressor may later use this value to determine which dictionary has been used by the compressor. (The Adler-32 value applies to the whole dictionary even if only a subset of the dictionary is actually used by the compressor.) If a raw deflate was requested, then the Adler-32 value is not computed and strm->adler is not set. deflateSetDictionary returns Z_OK if success, or Z_STREAM_ERROR if a parameter is invalid (e.g. dictionary being Z_NULL) or the stream state is inconsistent (for example if deflate has already been called for this stream or if not at a block boundary for raw deflate). deflateSetDictionary does not perform any compression: this will be done by deflate(). */ ZEXTERN int ZEXPORT deflateGetDictionary OF((z_streamp strm, Bytef *dictionary, uInt *dictLength)); /* Returns the sliding dictionary being maintained by deflate. dictLength is set to the number of bytes in the dictionary, and that many bytes are copied to dictionary. dictionary must have enough space, where 32768 bytes is always enough. If deflateGetDictionary() is called with dictionary equal to Z_NULL, then only the dictionary length is returned, and nothing is copied. Similary, if dictLength is Z_NULL, then it is not set. deflateGetDictionary() may return a length less than the window size, even when more than the window size in input has been provided. It may return up to 258 bytes less in that case, due to how zlib's implementation of deflate manages the sliding window and lookahead for matches, where matches can be up to 258 bytes long. If the application needs the last window-size bytes of input, then that would need to be saved by the application outside of zlib. deflateGetDictionary returns Z_OK on success, or Z_STREAM_ERROR if the stream state is inconsistent. */ ZEXTERN int ZEXPORT deflateCopy OF((z_streamp dest, z_streamp source)); /* Sets the destination stream as a complete copy of the source stream. This function can be useful when several compression strategies will be tried, for example when there are several ways of pre-processing the input data with a filter. The streams that will be discarded should then be freed by calling deflateEnd. Note that deflateCopy duplicates the internal compression state which can be quite large, so this strategy is slow and can consume lots of memory. deflateCopy returns Z_OK if success, Z_MEM_ERROR if there was not enough memory, Z_STREAM_ERROR if the source stream state was inconsistent (such as zalloc being Z_NULL). msg is left unchanged in both source and destination. */ ZEXTERN int ZEXPORT deflateReset OF((z_streamp strm)); /* This function is equivalent to deflateEnd followed by deflateInit, but does not free and reallocate the internal compression state. The stream will leave the compression level and any other attributes that may have been set unchanged. deflateReset returns Z_OK if success, or Z_STREAM_ERROR if the source stream state was inconsistent (such as zalloc or state being Z_NULL). */ ZEXTERN int ZEXPORT deflateParams OF((z_streamp strm, int level, int strategy)); /* Dynamically update the compression level and compression strategy. The interpretation of level and strategy is as in deflateInit2(). This can be used to switch between compression and straight copy of the input data, or to switch to a different kind of input data requiring a different strategy. If the compression approach (which is a function of the level) or the strategy is changed, and if any input has been consumed in a previous deflate() call, then the input available so far is compressed with the old level and strategy using deflate(strm, Z_BLOCK). There are three approaches for the compression levels 0, 1..3, and 4..9 respectively. The new level and strategy will take effect at the next call of deflate(). If a deflate(strm, Z_BLOCK) is performed by deflateParams(), and it does not have enough output space to complete, then the parameter change will not take effect. In this case, deflateParams() can be called again with the same parameters and more output space to try again. In order to assure a change in the parameters on the first try, the deflate stream should be flushed using deflate() with Z_BLOCK or other flush request until strm.avail_out is not zero, before calling deflateParams(). Then no more input data should be provided before the deflateParams() call. If this is done, the old level and strategy will be applied to the data compressed before deflateParams(), and the new level and strategy will be applied to the the data compressed after deflateParams(). deflateParams returns Z_OK on success, Z_STREAM_ERROR if the source stream state was inconsistent or if a parameter was invalid, or Z_BUF_ERROR if there was not enough output space to complete the compression of the available input data before a change in the strategy or approach. Note that in the case of a Z_BUF_ERROR, the parameters are not changed. A return value of Z_BUF_ERROR is not fatal, in which case deflateParams() can be retried with more output space. */ ZEXTERN int ZEXPORT deflateTune OF((z_streamp strm, int good_length, int max_lazy, int nice_length, int max_chain)); /* Fine tune deflate's internal compression parameters. This should only be used by someone who understands the algorithm used by zlib's deflate for searching for the best matching string, and even then only by the most fanatic optimizer trying to squeeze out the last compressed bit for their specific input data. Read the deflate.c source code for the meaning of the max_lazy, good_length, nice_length, and max_chain parameters. deflateTune() can be called after deflateInit() or deflateInit2(), and returns Z_OK on success, or Z_STREAM_ERROR for an invalid deflate stream. */ ZEXTERN uLong ZEXPORT deflateBound OF((z_streamp strm, uLong sourceLen)); /* deflateBound() returns an upper bound on the compressed size after deflation of sourceLen bytes. It must be called after deflateInit() or deflateInit2(), and after deflateSetHeader(), if used. This would be used to allocate an output buffer for deflation in a single pass, and so would be called before deflate(). If that first deflate() call is provided the sourceLen input bytes, an output buffer allocated to the size returned by deflateBound(), and the flush value Z_FINISH, then deflate() is guaranteed to return Z_STREAM_END. Note that it is possible for the compressed size to be larger than the value returned by deflateBound() if flush options other than Z_FINISH or Z_NO_FLUSH are used. */ ZEXTERN int ZEXPORT deflatePending OF((z_streamp strm, unsigned *pending, int *bits)); /* deflatePending() returns the number of bytes and bits of output that have been generated, but not yet provided in the available output. The bytes not provided would be due to the available output space having being consumed. The number of bits of output not provided are between 0 and 7, where they await more bits to join them in order to fill out a full byte. If pending or bits are Z_NULL, then those values are not set. deflatePending returns Z_OK if success, or Z_STREAM_ERROR if the source stream state was inconsistent. */ ZEXTERN int ZEXPORT deflatePrime OF((z_streamp strm, int bits, int value)); /* deflatePrime() inserts bits in the deflate output stream. The intent is that this function is used to start off the deflate output with the bits leftover from a previous deflate stream when appending to it. As such, this function can only be used for raw deflate, and must be used before the first deflate() call after a deflateInit2() or deflateReset(). bits must be less than or equal to 16, and that many of the least significant bits of value will be inserted in the output. deflatePrime returns Z_OK if success, Z_BUF_ERROR if there was not enough room in the internal buffer to insert the bits, or Z_STREAM_ERROR if the source stream state was inconsistent. */ ZEXTERN int ZEXPORT deflateSetHeader OF((z_streamp strm, gz_headerp head)); /* deflateSetHeader() provides gzip header information for when a gzip stream is requested by deflateInit2(). deflateSetHeader() may be called after deflateInit2() or deflateReset() and before the first call of deflate(). The text, time, os, extra field, name, and comment information in the provided gz_header structure are written to the gzip header (xflag is ignored -- the extra flags are set according to the compression level). The caller must assure that, if not Z_NULL, name and comment are terminated with a zero byte, and that if extra is not Z_NULL, that extra_len bytes are available there. If hcrc is true, a gzip header crc is included. Note that the current versions of the command-line version of gzip (up through version 1.3.x) do not support header crc's, and will report that it is a "multi-part gzip file" and give up. If deflateSetHeader is not used, the default gzip header has text false, the time set to zero, and os set to 255, with no extra, name, or comment fields. The gzip header is returned to the default state by deflateReset(). deflateSetHeader returns Z_OK if success, or Z_STREAM_ERROR if the source stream state was inconsistent. */ /* ZEXTERN int ZEXPORT inflateInit2 OF((z_streamp strm, int windowBits)); This is another version of inflateInit with an extra parameter. The fields next_in, avail_in, zalloc, zfree and opaque must be initialized before by the caller. The windowBits parameter is the base two logarithm of the maximum window size (the size of the history buffer). It should be in the range 8..15 for this version of the library. The default value is 15 if inflateInit is used instead. windowBits must be greater than or equal to the windowBits value provided to deflateInit2() while compressing, or it must be equal to 15 if deflateInit2() was not used. If a compressed stream with a larger window size is given as input, inflate() will return with the error code Z_DATA_ERROR instead of trying to allocate a larger window. windowBits can also be zero to request that inflate use the window size in the zlib header of the compressed stream. windowBits can also be -8..-15 for raw inflate. In this case, -windowBits determines the window size. inflate() will then process raw deflate data, not looking for a zlib or gzip header, not generating a check value, and not looking for any check values for comparison at the end of the stream. This is for use with other formats that use the deflate compressed data format such as zip. Those formats provide their own check values. If a custom format is developed using the raw deflate format for compressed data, it is recommended that a check value such as an Adler-32 or a CRC-32 be applied to the uncompressed data as is done in the zlib, gzip, and zip formats. For most applications, the zlib format should be used as is. Note that comments above on the use in deflateInit2() applies to the magnitude of windowBits. windowBits can also be greater than 15 for optional gzip decoding. Add 32 to windowBits to enable zlib and gzip decoding with automatic header detection, or add 16 to decode only the gzip format (the zlib format will return a Z_DATA_ERROR). If a gzip stream is being decoded, strm->adler is a CRC-32 instead of an Adler-32. Unlike the gunzip utility and gzread() (see below), inflate() will not automatically decode concatenated gzip streams. inflate() will return Z_STREAM_END at the end of the gzip stream. The state would need to be reset to continue decoding a subsequent gzip stream. inflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough memory, Z_VERSION_ERROR if the zlib library version is incompatible with the version assumed by the caller, or Z_STREAM_ERROR if the parameters are invalid, such as a null pointer to the structure. msg is set to null if there is no error message. inflateInit2 does not perform any decompression apart from possibly reading the zlib header if present: actual decompression will be done by inflate(). (So next_in and avail_in may be modified, but next_out and avail_out are unused and unchanged.) The current implementation of inflateInit2() does not process any header information -- that is deferred until inflate() is called. */ ZEXTERN int ZEXPORT inflateSetDictionary OF((z_streamp strm, const Bytef *dictionary, uInt dictLength)); /* Initializes the decompression dictionary from the given uncompressed byte sequence. This function must be called immediately after a call of inflate, if that call returned Z_NEED_DICT. The dictionary chosen by the compressor can be determined from the Adler-32 value returned by that call of inflate. The compressor and decompressor must use exactly the same dictionary (see deflateSetDictionary). For raw inflate, this function can be called at any time to set the dictionary. If the provided dictionary is smaller than the window and there is already data in the window, then the provided dictionary will amend what's there. The application must insure that the dictionary that was used for compression is provided. inflateSetDictionary returns Z_OK if success, Z_STREAM_ERROR if a parameter is invalid (e.g. dictionary being Z_NULL) or the stream state is inconsistent, Z_DATA_ERROR if the given dictionary doesn't match the expected one (incorrect Adler-32 value). inflateSetDictionary does not perform any decompression: this will be done by subsequent calls of inflate(). */ ZEXTERN int ZEXPORT inflateGetDictionary OF((z_streamp strm, Bytef *dictionary, uInt *dictLength)); /* Returns the sliding dictionary being maintained by inflate. dictLength is set to the number of bytes in the dictionary, and that many bytes are copied to dictionary. dictionary must have enough space, where 32768 bytes is always enough. If inflateGetDictionary() is called with dictionary equal to Z_NULL, then only the dictionary length is returned, and nothing is copied. Similary, if dictLength is Z_NULL, then it is not set. inflateGetDictionary returns Z_OK on success, or Z_STREAM_ERROR if the stream state is inconsistent. */ ZEXTERN int ZEXPORT inflateSync OF((z_streamp strm)); /* Skips invalid compressed data until a possible full flush point (see above for the description of deflate with Z_FULL_FLUSH) can be found, or until all available input is skipped. No output is provided. inflateSync searches for a 00 00 FF FF pattern in the compressed data. All full flush points have this pattern, but not all occurrences of this pattern are full flush points. inflateSync returns Z_OK if a possible full flush point has been found, Z_BUF_ERROR if no more input was provided, Z_DATA_ERROR if no flush point has been found, or Z_STREAM_ERROR if the stream structure was inconsistent. In the success case, the application may save the current current value of total_in which indicates where valid compressed data was found. In the error case, the application may repeatedly call inflateSync, providing more input each time, until success or end of the input data. */ ZEXTERN int ZEXPORT inflateCopy OF((z_streamp dest, z_streamp source)); /* Sets the destination stream as a complete copy of the source stream. This function can be useful when randomly accessing a large stream. The first pass through the stream can periodically record the inflate state, allowing restarting inflate at those points when randomly accessing the stream. inflateCopy returns Z_OK if success, Z_MEM_ERROR if there was not enough memory, Z_STREAM_ERROR if the source stream state was inconsistent (such as zalloc being Z_NULL). msg is left unchanged in both source and destination. */ ZEXTERN int ZEXPORT inflateReset OF((z_streamp strm)); /* This function is equivalent to inflateEnd followed by inflateInit, but does not free and reallocate 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 Z_NULL). */ ZEXTERN int ZEXPORT inflateReset2 OF((z_streamp strm, int windowBits)); /* This function is the same as inflateReset, but it also permits changing the wrap and window size requests. The windowBits parameter is interpreted the same as it is for inflateInit2. If the window size is changed, then the memory allocated for the window is freed, and the window will be reallocated by inflate() if needed. inflateReset2 returns Z_OK if success, or Z_STREAM_ERROR if the source stream state was inconsistent (such as zalloc or state being Z_NULL), or if the windowBits parameter is invalid. */ ZEXTERN int ZEXPORT inflatePrime OF((z_streamp strm, int bits, int value)); /* This function inserts bits in the inflate input stream. The intent is that this function is used to start inflating at a bit position in the middle of a byte. The provided bits will be used before any bytes are used from next_in. This function should only be used with raw inflate, and should be used before the first inflate() call after inflateInit2() or inflateReset(). bits must be less than or equal to 16, and that many of the least significant bits of value will be inserted in the input. If bits is negative, then the input stream bit buffer is emptied. Then inflatePrime() can be called again to put bits in the buffer. This is used to clear out bits leftover after feeding inflate a block description prior to feeding inflate codes. inflatePrime returns Z_OK if success, or Z_STREAM_ERROR if the source stream state was inconsistent. */ ZEXTERN long ZEXPORT inflateMark OF((z_streamp strm)); /* This function returns two values, one in the lower 16 bits of the return value, and the other in the remaining upper bits, obtained by shifting the return value down 16 bits. If the upper value is -1 and the lower value is zero, then inflate() is currently decoding information outside of a block. If the upper value is -1 and the lower value is non-zero, then inflate is in the middle of a stored block, with the lower value equaling the number of bytes from the input remaining to copy. If the upper value is not -1, then it is the number of bits back from the current bit position in the input of the code (literal or length/distance pair) currently being processed. In that case the lower value is the number of bytes already emitted for that code. A code is being processed if inflate is waiting for more input to complete decoding of the code, or if it has completed decoding but is waiting for more output space to write the literal or match data. inflateMark() is used to mark locations in the input data for random access, which may be at bit positions, and to note those cases where the output of a code may span boundaries of random access blocks. The current location in the input stream can be determined from avail_in and data_type as noted in the description for the Z_BLOCK flush parameter for inflate. inflateMark returns the value noted above, or -65536 if the provided source stream state was inconsistent. */ ZEXTERN int ZEXPORT inflateGetHeader OF((z_streamp strm, gz_headerp head)); /* inflateGetHeader() requests that gzip header information be stored in the provided gz_header structure. inflateGetHeader() may be called after inflateInit2() or inflateReset(), and before the first call of inflate(). As inflate() processes the gzip stream, head->done is zero until the header is completed, at which time head->done is set to one. If a zlib stream is being decoded, then head->done is set to -1 to indicate that there will be no gzip header information forthcoming. Note that Z_BLOCK or Z_TREES can be used to force inflate() to return immediately after header processing is complete and before any actual data is decompressed. The text, time, xflags, and os fields are filled in with the gzip header contents. hcrc is set to true if there is a header CRC. (The header CRC was valid if done is set to one.) If extra is not Z_NULL, then extra_max contains the maximum number of bytes to write to extra. Once done is true, extra_len contains the actual extra field length, and extra contains the extra field, or that field truncated if extra_max is less than extra_len. If name is not Z_NULL, then up to name_max characters are written there, terminated with a zero unless the length is greater than name_max. If comment is not Z_NULL, then up to comm_max characters are written there, terminated with a zero unless the length is greater than comm_max. When any of extra, name, or comment are not Z_NULL and the respective field is not present in the header, then that field is set to Z_NULL to signal its absence. This allows the use of deflateSetHeader() with the returned structure to duplicate the header. However if those fields are set to allocated memory, then the application will need to save those pointers elsewhere so that they can be eventually freed. If inflateGetHeader is not used, then the header information is simply discarded. The header is always checked for validity, including the header CRC if present. inflateReset() will reset the process to discard the header information. The application would need to call inflateGetHeader() again to retrieve the header from the next gzip stream. inflateGetHeader returns Z_OK if success, or Z_STREAM_ERROR if the source stream state was inconsistent. */ /* ZEXTERN int ZEXPORT inflateBackInit OF((z_streamp strm, int windowBits, unsigned char FAR *window)); Initialize the internal stream state for decompression using inflateBack() calls. The fields zalloc, zfree and opaque in strm must be initialized before the call. If zalloc and zfree are Z_NULL, then the default library- derived memory allocation routines are used. windowBits is the base two logarithm of the window size, in the range 8..15. window is a caller supplied buffer of that size. Except for special applications where it is assured that deflate was used with small window sizes, windowBits must be 15 and a 32K byte window must be supplied to be able to decompress general deflate streams. See inflateBack() for the usage of these routines. inflateBackInit will return Z_OK on success, Z_STREAM_ERROR if any of the parameters are invalid, Z_MEM_ERROR if the internal state could not be allocated, or Z_VERSION_ERROR if the version of the library does not match the version of the header file. */ typedef unsigned (*in_func) OF((void FAR *, z_const unsigned char FAR * FAR *)); typedef int (*out_func) OF((void FAR *, unsigned char FAR *, unsigned)); ZEXTERN int ZEXPORT inflateBack OF((z_streamp strm, in_func in, void FAR *in_desc, out_func out, void FAR *out_desc)); /* inflateBack() does a raw inflate with a single call using a call-back interface for input and output. This is potentially more efficient than inflate() for file i/o applications, in that it avoids copying between the output and the sliding window by simply making the window itself the output buffer. inflate() can be faster on modern CPUs when used with large buffers. inflateBack() trusts the application to not change the output buffer passed by the output function, at least until inflateBack() returns. inflateBackInit() must be called first to allocate the internal state and to initialize the state with the user-provided window buffer. inflateBack() may then be used multiple times to inflate a complete, raw deflate stream with each call. inflateBackEnd() is then called to free the allocated state. A raw deflate stream is one with no zlib or gzip header or trailer. This routine would normally be used in a utility that reads zip or gzip files and writes out uncompressed files. The utility would decode the header and process the trailer on its own, hence this routine expects only the raw deflate stream to decompress. This is different from the default behavior of inflate(), which expects a zlib header and trailer around the deflate stream. inflateBack() uses two subroutines supplied by the caller that are then called by inflateBack() for input and output. inflateBack() calls those routines until it reads a complete deflate stream and writes out all of the uncompressed data, or until it encounters an error. The function's parameters and return types are defined above in the in_func and out_func typedefs. inflateBack() will call in(in_desc, &buf) which should return the number of bytes of provided input, and a pointer to that input in buf. If there is no input available, in() must return zero -- buf is ignored in that case -- and inflateBack() will return a buffer error. inflateBack() will call out(out_desc, buf, len) to write the uncompressed data buf[0..len-1]. out() should return zero on success, or non-zero on failure. If out() returns non-zero, inflateBack() will return with an error. Neither in() nor out() are permitted to change the contents of the window provided to inflateBackInit(), which is also the buffer that out() uses to write from. The length written by out() will be at most the window size. Any non-zero amount of input may be provided by in(). For convenience, inflateBack() can be provided input on the first call by setting strm->next_in and strm->avail_in. If that input is exhausted, then in() will be called. Therefore strm->next_in must be initialized before calling inflateBack(). If strm->next_in is Z_NULL, then in() will be called immediately for input. If strm->next_in is not Z_NULL, then strm->avail_in must also be initialized, and then if strm->avail_in is not zero, input will initially be taken from strm->next_in[0 .. strm->avail_in - 1]. The in_desc and out_desc parameters of inflateBack() is passed as the first parameter of in() and out() respectively when they are called. These descriptors can be optionally used to pass any information that the caller- supplied in() and out() functions need to do their job. On return, inflateBack() will set strm->next_in and strm->avail_in to pass back any unused input that was provided by the last in() call. The return values of inflateBack() can be Z_STREAM_END on success, Z_BUF_ERROR if in() or out() returned an error, Z_DATA_ERROR if there was a format error in the deflate stream (in which case strm->msg is set to indicate the nature of the error), or Z_STREAM_ERROR if the stream was not properly initialized. In the case of Z_BUF_ERROR, an input or output error can be distinguished using strm->next_in which will be Z_NULL only if in() returned an error. If strm->next_in is not Z_NULL, then the Z_BUF_ERROR was due to out() returning non-zero. (in() will always be called before out(), so strm->next_in is assured to be defined if out() returns non-zero.) Note that inflateBack() cannot return Z_OK. */ ZEXTERN int ZEXPORT inflateBackEnd OF((z_streamp strm)); /* All memory allocated by inflateBackInit() is freed. inflateBackEnd() returns Z_OK on success, or Z_STREAM_ERROR if the stream state was inconsistent. */ ZEXTERN uLong ZEXPORT zlibCompileFlags OF((void)); /* Return flags indicating compile-time options. Type sizes, two bits each, 00 = 16 bits, 01 = 32, 10 = 64, 11 = other: 1.0: size of uInt 3.2: size of uLong 5.4: size of voidpf (pointer) 7.6: size of z_off_t Compiler, assembler, and debug options: 8: ZLIB_DEBUG 9: ASMV or ASMINF -- use ASM code 10: ZLIB_WINAPI -- exported functions use the WINAPI calling convention 11: 0 (reserved) One-time table building (smaller code, but not thread-safe if true): 12: BUILDFIXED -- build static block decoding tables when needed 13: DYNAMIC_CRC_TABLE -- build CRC calculation tables when needed 14,15: 0 (reserved) Library content (indicates missing functionality): 16: NO_GZCOMPRESS -- gz* functions cannot compress (to avoid linking deflate code when not needed) 17: NO_GZIP -- deflate can't write gzip streams, and inflate can't detect and decode gzip streams (to avoid linking crc code) 18-19: 0 (reserved) Operation variations (changes in library functionality): 20: PKZIP_BUG_WORKAROUND -- slightly more permissive inflate 21: FASTEST -- deflate algorithm with only one, lowest compression level 22,23: 0 (reserved) The sprintf variant used by gzprintf (zero is best): 24: 0 = vs*, 1 = s* -- 1 means limited to 20 arguments after the format 25: 0 = *nprintf, 1 = *printf -- 1 means gzprintf() not secure! 26: 0 = returns value, 1 = void -- 1 means inferred string length returned Remainder: 27-31: 0 (reserved) */ #ifndef Z_SOLO /* utility functions */ /* The following utility functions are implemented on top of the basic stream-oriented functions. To simplify the interface, some default options are assumed (compression level and memory usage, standard memory allocation functions). The source code of these utility functions can be modified if you need special options. */ ZEXTERN int ZEXPORT compress OF((Bytef *dest, uLongf *destLen, const Bytef *source, uLong sourceLen)); /* Compresses the source buffer into the destination buffer. sourceLen is the byte length of the source buffer. Upon entry, destLen is the total size of the destination buffer, which must be at least the value returned by compressBound(sourceLen). Upon exit, destLen is the actual size of the compressed data. compress() is equivalent to compress2() with a level parameter of Z_DEFAULT_COMPRESSION. compress returns Z_OK if success, Z_MEM_ERROR if there was not enough memory, Z_BUF_ERROR if there was not enough room in the output buffer. */ ZEXTERN int ZEXPORT compress2 OF((Bytef *dest, uLongf *destLen, const Bytef *source, uLong sourceLen, int level)); /* Compresses the source buffer into the destination buffer. The level parameter has the same meaning as in deflateInit. sourceLen is the byte length of the source buffer. Upon entry, destLen is the total size of the destination buffer, which must be at least the value returned by compressBound(sourceLen). Upon exit, destLen is the actual size of the compressed data. compress2 returns Z_OK if success, Z_MEM_ERROR if there was not enough memory, Z_BUF_ERROR if there was not enough room in the output buffer, Z_STREAM_ERROR if the level parameter is invalid. */ ZEXTERN uLong ZEXPORT compressBound OF((uLong sourceLen)); /* compressBound() returns an upper bound on the compressed size after compress() or compress2() on sourceLen bytes. It would be used before a compress() or compress2() call to allocate the destination buffer. */ ZEXTERN int ZEXPORT uncompress OF((Bytef *dest, uLongf *destLen, const Bytef *source, uLong sourceLen)); /* Decompresses the source buffer into the destination buffer. sourceLen is the byte length of the source buffer. Upon entry, destLen is the total size of the destination buffer, which must be large enough to hold the entire uncompressed data. (The size of the uncompressed data must have been saved previously by the compressor and transmitted to the decompressor by some mechanism outside the scope of this compression library.) Upon exit, destLen is the actual size of the uncompressed data. uncompress returns Z_OK if success, Z_MEM_ERROR if there was not enough memory, Z_BUF_ERROR if there was not enough room in the output buffer, or Z_DATA_ERROR if the input data was corrupted or incomplete. In the case where there is not enough room, uncompress() will fill the output buffer with the uncompressed data up to that point. */ ZEXTERN int ZEXPORT uncompress2 OF((Bytef *dest, uLongf *destLen, const Bytef *source, uLong *sourceLen)); /* Same as uncompress, except that sourceLen is a pointer, where the length of the source is *sourceLen. On return, *sourceLen is the number of source bytes consumed. */ /* gzip file access functions */ /* This library supports reading and writing files in gzip (.gz) format with an interface similar to that of stdio, using the functions that start with "gz". The gzip format is different from the zlib format. gzip is a gzip wrapper, documented in RFC 1952, wrapped around a deflate stream. */ typedef struct gzFile_s *gzFile; /* semi-opaque gzip file descriptor */ /* ZEXTERN gzFile ZEXPORT gzopen OF((const char *path, const char *mode)); Opens a gzip (.gz) file for reading or writing. The mode parameter is as in fopen ("rb" or "wb") but can also include a compression level ("wb9") or a strategy: 'f' for filtered data as in "wb6f", 'h' for Huffman-only compression as in "wb1h", 'R' for run-length encoding as in "wb1R", or 'F' for fixed code compression as in "wb9F". (See the description of deflateInit2 for more information about the strategy parameter.) 'T' will request transparent writing or appending with no compression and not using the gzip format. "a" can be used instead of "w" to request that the gzip stream that will be written be appended to the file. "+" will result in an error, since reading and writing to the same gzip file is not supported. The addition of "x" when writing will create the file exclusively, which fails if the file already exists. On systems that support it, the addition of "e" when reading or writing will set the flag to close the file on an execve() call. These functions, as well as gzip, will read and decode a sequence of gzip streams in a file. The append function of gzopen() can be used to create such a file. (Also see gzflush() for another way to do this.) When appending, gzopen does not test whether the file begins with a gzip stream, nor does it look for the end of the gzip streams to begin appending. gzopen will simply append a gzip stream to the existing file. gzopen can be used to read a file which is not in gzip format; in this case gzread will directly read from the file without decompression. When reading, this will be detected automatically by looking for the magic two- byte gzip header. gzopen returns NULL if the file could not be opened, if there was insufficient memory to allocate the gzFile state, or if an invalid mode was specified (an 'r', 'w', or 'a' was not provided, or '+' was provided). errno can be checked to determine if the reason gzopen failed was that the file could not be opened. */ ZEXTERN gzFile ZEXPORT gzdopen OF((int fd, const char *mode)); /* gzdopen associates a gzFile with the file descriptor fd. File descriptors are obtained from calls like open, dup, creat, pipe or fileno (if the file has been previously opened with fopen). The mode parameter is as in gzopen. The next call of gzclose on the returned gzFile will also close the file descriptor fd, just like fclose(fdopen(fd, mode)) closes the file descriptor fd. If you want to keep fd open, use fd = dup(fd_keep); gz = gzdopen(fd, mode);. The duplicated descriptor should be saved to avoid a leak, since gzdopen does not close fd if it fails. If you are using fileno() to get the file descriptor from a FILE *, then you will have to use dup() to avoid double-close()ing the file descriptor. Both gzclose() and fclose() will close the associated file descriptor, so they need to have different file descriptors. gzdopen returns NULL if there was insufficient memory to allocate the gzFile state, if an invalid mode was specified (an 'r', 'w', or 'a' was not provided, or '+' was provided), or if fd is -1. The file descriptor is not used until the next gz* read, write, seek, or close operation, so gzdopen will not detect if fd is invalid (unless fd is -1). */ ZEXTERN int ZEXPORT gzbuffer OF((gzFile file, unsigned size)); /* Set the internal buffer size used by this library's functions. The default buffer size is 8192 bytes. This function must be called after gzopen() or gzdopen(), and before any other calls that read or write the file. The buffer memory allocation is always deferred to the first read or write. Three times that size in buffer space is allocated. A larger buffer size of, for example, 64K or 128K bytes will noticeably increase the speed of decompression (reading). The new buffer size also affects the maximum length for gzprintf(). gzbuffer() returns 0 on success, or -1 on failure, such as being called too late. */ ZEXTERN int ZEXPORT gzsetparams OF((gzFile file, int level, int strategy)); /* Dynamically update the compression level or strategy. See the description of deflateInit2 for the meaning of these parameters. Previously provided data is flushed before the parameter change. gzsetparams returns Z_OK if success, Z_STREAM_ERROR if the file was not opened for writing, Z_ERRNO if there is an error writing the flushed data, or Z_MEM_ERROR if there is a memory allocation error. */ ZEXTERN int ZEXPORT gzread OF((gzFile file, voidp buf, unsigned len)); /* Reads the given number of uncompressed bytes from the compressed file. If the input file is not in gzip format, gzread copies the given number of bytes into the buffer directly from the file. After reaching the end of a gzip stream in the input, gzread will continue to read, looking for another gzip stream. Any number of gzip streams may be concatenated in the input file, and will all be decompressed by gzread(). If something other than a gzip stream is encountered after a gzip stream, that remaining trailing garbage is ignored (and no error is returned). gzread can be used to read a gzip file that is being concurrently written. Upon reaching the end of the input, gzread will return with the available data. If the error code returned by gzerror is Z_OK or Z_BUF_ERROR, then gzclearerr can be used to clear the end of file indicator in order to permit gzread to be tried again. Z_OK indicates that a gzip stream was completed on the last gzread. Z_BUF_ERROR indicates that the input file ended in the middle of a gzip stream. Note that gzread does not return -1 in the event of an incomplete gzip stream. This error is deferred until gzclose(), which will return Z_BUF_ERROR if the last gzread ended in the middle of a gzip stream. Alternatively, gzerror can be used before gzclose to detect this case. gzread returns the number of uncompressed bytes actually read, less than len for end of file, or -1 for error. If len is too large to fit in an int, then nothing is read, -1 is returned, and the error state is set to Z_STREAM_ERROR. */ ZEXTERN z_size_t ZEXPORT gzfread OF((voidp buf, z_size_t size, z_size_t nitems, gzFile file)); /* Read up to nitems items of size size from file to buf, otherwise operating as gzread() does. This duplicates the interface of stdio's fread(), with size_t request and return types. If the library defines size_t, then z_size_t is identical to size_t. If not, then z_size_t is an unsigned integer type that can contain a pointer. gzfread() returns the number of full items read of size size, or zero if the end of the file was reached and a full item could not be read, or if there was an error. gzerror() must be consulted if zero is returned in order to determine if there was an error. If the multiplication of size and nitems overflows, i.e. the product does not fit in a z_size_t, then nothing is read, zero is returned, and the error state is set to Z_STREAM_ERROR. In the event that the end of file is reached and only a partial item is available at the end, i.e. the remaining uncompressed data length is not a multiple of size, then the final partial item is nevetheless read into buf and the end-of-file flag is set. The length of the partial item read is not provided, but could be inferred from the result of gztell(). This behavior is the same as the behavior of fread() implementations in common libraries, but it prevents the direct use of gzfread() to read a concurrently written file, reseting and retrying on end-of-file, when size is not 1. */ ZEXTERN int ZEXPORT gzwrite OF((gzFile file, voidpc buf, unsigned len)); /* Writes the given number of uncompressed bytes into the compressed file. gzwrite returns the number of uncompressed bytes written or 0 in case of error. */ ZEXTERN z_size_t ZEXPORT gzfwrite OF((voidpc buf, z_size_t size, z_size_t nitems, gzFile file)); /* gzfwrite() writes nitems items of size size from buf to file, duplicating the interface of stdio's fwrite(), with size_t request and return types. If the library defines size_t, then z_size_t is identical to size_t. If not, then z_size_t is an unsigned integer type that can contain a pointer. gzfwrite() returns the number of full items written of size size, or zero if there was an error. If the multiplication of size and nitems overflows, i.e. the product does not fit in a z_size_t, then nothing is written, zero is returned, and the error state is set to Z_STREAM_ERROR. */ ZEXTERN int ZEXPORTVA gzprintf Z_ARG((gzFile file, const char *format, ...)); /* Converts, formats, and writes the arguments to the compressed file under control of the format string, as in fprintf. gzprintf returns the number of uncompressed bytes actually written, or a negative zlib error code in case of error. The number of uncompressed bytes written is limited to 8191, or one less than the buffer size given to gzbuffer(). The caller should assure that this limit is not exceeded. If it is exceeded, then gzprintf() will return an error (0) with nothing written. In this case, there may also be a buffer overflow with unpredictable consequences, which is possible only if zlib was compiled with the insecure functions sprintf() or vsprintf() because the secure snprintf() or vsnprintf() functions were not available. This can be determined using zlibCompileFlags(). */ ZEXTERN int ZEXPORT gzputs OF((gzFile file, const char *s)); /* Writes the given null-terminated string to the compressed file, excluding the terminating null character. gzputs returns the number of characters written, or -1 in case of error. */ ZEXTERN char * ZEXPORT gzgets OF((gzFile file, char *buf, int len)); /* Reads bytes from the compressed file until len-1 characters are read, or a newline character is read and transferred to buf, or an end-of-file condition is encountered. If any characters are read or if len == 1, the string is terminated with a null character. If no characters are read due to an end-of-file or len < 1, then the buffer is left untouched. gzgets returns buf which is a null-terminated string, or it returns NULL for end-of-file or in case of error. If there was an error, the contents at buf are indeterminate. */ ZEXTERN int ZEXPORT gzputc OF((gzFile file, int c)); /* Writes c, converted to an unsigned char, into the compressed file. gzputc returns the value that was written, or -1 in case of error. */ ZEXTERN int ZEXPORT gzgetc OF((gzFile file)); /* Reads one byte from the compressed file. gzgetc returns this byte or -1 in case of end of file or error. This is implemented as a macro for speed. As such, it does not do all of the checking the other functions do. I.e. it does not check to see if file is NULL, nor whether the structure file points to has been clobbered or not. */ ZEXTERN int ZEXPORT gzungetc OF((int c, gzFile file)); /* Push one character back onto the stream to be read as the first character on the next read. At least one character of push-back is allowed. gzungetc() returns the character pushed, or -1 on failure. gzungetc() will fail if c is -1, and may fail if a character has been pushed but not read yet. If gzungetc is used immediately after gzopen or gzdopen, at least the output buffer size of pushed characters is allowed. (See gzbuffer above.) The pushed character will be discarded if the stream is repositioned with gzseek() or gzrewind(). */ ZEXTERN int ZEXPORT gzflush OF((gzFile file, int flush)); /* Flushes all pending output into the compressed file. The parameter flush is as in the deflate() function. The return value is the zlib error number (see function gzerror below). gzflush is only permitted when writing. If the flush parameter is Z_FINISH, the remaining data is written and the gzip stream is completed in the output. If gzwrite() is called again, a new gzip stream will be started in the output. gzread() is able to read such concatenated gzip streams. gzflush should be called only when strictly necessary because it will degrade compression if called too often. */ /* ZEXTERN z_off_t ZEXPORT gzseek OF((gzFile file, z_off_t offset, int whence)); Sets the starting position for the next gzread or gzwrite on the given compressed file. The offset represents a number of bytes in the uncompressed data stream. The whence parameter is defined as in lseek(2); the value SEEK_END is not supported. If the file is opened for reading, this function is emulated but can be extremely slow. If the file is opened for writing, only forward seeks are supported; gzseek then compresses a sequence of zeroes up to the new starting position. gzseek returns the resulting offset location as measured in bytes from the beginning of the uncompressed stream, or -1 in case of error, in particular if the file is opened for writing and the new starting position would be before the current position. */ ZEXTERN int ZEXPORT gzrewind OF((gzFile file)); /* Rewinds the given file. This function is supported only for reading. gzrewind(file) is equivalent to (int)gzseek(file, 0L, SEEK_SET) */ /* ZEXTERN z_off_t ZEXPORT gztell OF((gzFile file)); Returns the starting position for the next gzread or gzwrite on the given compressed file. This position represents a number of bytes in the uncompressed data stream, and is zero when starting, even if appending or reading a gzip stream from the middle of a file using gzdopen(). gztell(file) is equivalent to gzseek(file, 0L, SEEK_CUR) */ /* ZEXTERN z_off_t ZEXPORT gzoffset OF((gzFile file)); Returns the current offset in the file being read or written. This offset includes the count of bytes that precede the gzip stream, for example when appending or when using gzdopen() for reading. When reading, the offset does not include as yet unused buffered input. This information can be used for a progress indicator. On error, gzoffset() returns -1. */ ZEXTERN int ZEXPORT gzeof OF((gzFile file)); /* Returns true (1) if the end-of-file indicator has been set while reading, false (0) otherwise. Note that the end-of-file indicator is set only if the read tried to go past the end of the input, but came up short. Therefore, just like feof(), gzeof() may return false even if there is no more data to read, in the event that the last read request was for the exact number of bytes remaining in the input file. This will happen if the input file size is an exact multiple of the buffer size. If gzeof() returns true, then the read functions will return no more data, unless the end-of-file indicator is reset by gzclearerr() and the input file has grown since the previous end of file was detected. */ ZEXTERN int ZEXPORT gzdirect OF((gzFile file)); /* Returns true (1) if file is being copied directly while reading, or false (0) if file is a gzip stream being decompressed. If the input file is empty, gzdirect() will return true, since the input does not contain a gzip stream. If gzdirect() is used immediately after gzopen() or gzdopen() it will cause buffers to be allocated to allow reading the file to determine if it is a gzip file. Therefore if gzbuffer() is used, it should be called before gzdirect(). When writing, gzdirect() returns true (1) if transparent writing was requested ("wT" for the gzopen() mode), or false (0) otherwise. (Note: gzdirect() is not needed when writing. Transparent writing must be explicitly requested, so the application already knows the answer. When linking statically, using gzdirect() will include all of the zlib code for gzip file reading and decompression, which may not be desired.) */ ZEXTERN int ZEXPORT gzclose OF((gzFile file)); /* Flushes all pending output if necessary, closes the compressed file and deallocates the (de)compression state. Note that once file is closed, you cannot call gzerror with file, since its structures have been deallocated. gzclose must not be called more than once on the same file, just as free must not be called more than once on the same allocation. gzclose will return Z_STREAM_ERROR if file is not valid, Z_ERRNO on a file operation error, Z_MEM_ERROR if out of memory, Z_BUF_ERROR if the last read ended in the middle of a gzip stream, or Z_OK on success. */ ZEXTERN int ZEXPORT gzclose_r OF((gzFile file)); ZEXTERN int ZEXPORT gzclose_w OF((gzFile file)); /* Same as gzclose(), but gzclose_r() is only for use when reading, and gzclose_w() is only for use when writing or appending. The advantage to using these instead of gzclose() is that they avoid linking in zlib compression or decompression code that is not used when only reading or only writing respectively. If gzclose() is used, then both compression and decompression code will be included the application when linking to a static zlib library. */ ZEXTERN const char * ZEXPORT gzerror OF((gzFile file, int *errnum)); /* Returns the error message for the last error which occurred on the given compressed file. errnum is set to zlib error number. If an error occurred in the file system and not in the compression library, errnum is set to Z_ERRNO and the application may consult errno to get the exact error code. The application must not modify the returned string. Future calls to this function may invalidate the previously returned string. If file is closed, then the string previously returned by gzerror will no longer be available. gzerror() should be used to distinguish errors from end-of-file for those functions above that do not distinguish those cases in their return values. */ ZEXTERN void ZEXPORT gzclearerr OF((gzFile file)); /* Clears the error and end-of-file flags for file. This is analogous to the clearerr() function in stdio. This is useful for continuing to read a gzip file that is being written concurrently. */ #endif /* !Z_SOLO */ /* checksum functions */ /* These functions are not related to compression but are exported anyway because they might be useful in applications using the compression library. */ ZEXTERN uLong ZEXPORT adler32 OF((uLong adler, const Bytef *buf, uInt len)); /* Update a running Adler-32 checksum with the bytes buf[0..len-1] and return the updated checksum. If buf is Z_NULL, this function returns the required initial value for the checksum. An Adler-32 checksum is almost as reliable as a CRC-32 but can be computed much faster. Usage example: uLong adler = adler32(0L, Z_NULL, 0); while (read_buffer(buffer, length) != EOF) { adler = adler32(adler, buffer, length); } if (adler != original_adler) error(); */ ZEXTERN uLong ZEXPORT adler32_z OF((uLong adler, const Bytef *buf, z_size_t len)); /* Same as adler32(), but with a size_t length. */ /* ZEXTERN uLong ZEXPORT adler32_combine OF((uLong adler1, uLong adler2, z_off_t len2)); Combine two Adler-32 checksums into one. For two sequences of bytes, seq1 and seq2 with lengths len1 and len2, Adler-32 checksums were calculated for each, adler1 and adler2. adler32_combine() returns the Adler-32 checksum of seq1 and seq2 concatenated, requiring only adler1, adler2, and len2. Note that the z_off_t type (like off_t) is a signed integer. If len2 is negative, the result has no meaning or utility. */ ZEXTERN uLong ZEXPORT crc32 OF((uLong crc, const Bytef *buf, uInt len)); /* Update a running CRC-32 with the bytes buf[0..len-1] and return the updated CRC-32. If buf is Z_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(); */ ZEXTERN uLong ZEXPORT crc32_z OF((uLong adler, const Bytef *buf, z_size_t len)); /* Same as crc32(), but with a size_t length. */ /* ZEXTERN uLong ZEXPORT crc32_combine OF((uLong crc1, uLong crc2, z_off_t len2)); Combine two CRC-32 check values into one. For two sequences of bytes, seq1 and seq2 with lengths len1 and len2, CRC-32 check values were calculated for each, crc1 and crc2. crc32_combine() returns the CRC-32 check value of seq1 and seq2 concatenated, requiring only crc1, crc2, and len2. */ /* various hacks, don't look :) */ /* deflateInit and inflateInit are macros to allow checking the zlib version * and the compiler's view of z_stream: */ ZEXTERN int ZEXPORT deflateInit_ OF((z_streamp strm, int level, const char *version, int stream_size)); ZEXTERN int ZEXPORT inflateInit_ OF((z_streamp strm, const char *version, int stream_size)); ZEXTERN int ZEXPORT deflateInit2_ OF((z_streamp strm, int level, int method, int windowBits, int memLevel, int strategy, const char *version, int stream_size)); ZEXTERN int ZEXPORT inflateInit2_ OF((z_streamp strm, int windowBits, const char *version, int stream_size)); ZEXTERN int ZEXPORT inflateBackInit_ OF((z_streamp strm, int windowBits, unsigned char FAR *window, const char *version, int stream_size)); #ifdef Z_PREFIX_SET # define z_deflateInit(strm, level) \ deflateInit_((strm), (level), ZLIB_VERSION, (int)sizeof(z_stream)) # define z_inflateInit(strm) \ inflateInit_((strm), ZLIB_VERSION, (int)sizeof(z_stream)) # define z_deflateInit2(strm, level, method, windowBits, memLevel, strategy) \ deflateInit2_((strm),(level),(method),(windowBits),(memLevel),\ (strategy), ZLIB_VERSION, (int)sizeof(z_stream)) # define z_inflateInit2(strm, windowBits) \ inflateInit2_((strm), (windowBits), ZLIB_VERSION, \ (int)sizeof(z_stream)) # define z_inflateBackInit(strm, windowBits, window) \ inflateBackInit_((strm), (windowBits), (window), \ ZLIB_VERSION, (int)sizeof(z_stream)) #else # define deflateInit(strm, level) \ deflateInit_((strm), (level), ZLIB_VERSION, (int)sizeof(z_stream)) # define inflateInit(strm) \ inflateInit_((strm), ZLIB_VERSION, (int)sizeof(z_stream)) # define deflateInit2(strm, level, method, windowBits, memLevel, strategy) \ deflateInit2_((strm),(level),(method),(windowBits),(memLevel),\ (strategy), ZLIB_VERSION, (int)sizeof(z_stream)) # define inflateInit2(strm, windowBits) \ inflateInit2_((strm), (windowBits), ZLIB_VERSION, \ (int)sizeof(z_stream)) # define inflateBackInit(strm, windowBits, window) \ inflateBackInit_((strm), (windowBits), (window), \ ZLIB_VERSION, (int)sizeof(z_stream)) #endif #ifndef Z_SOLO /* gzgetc() macro and its supporting function and exposed data structure. Note * that the real internal state is much larger than the exposed structure. * This abbreviated structure exposes just enough for the gzgetc() macro. The * user should not mess with these exposed elements, since their names or * behavior could change in the future, perhaps even capriciously. They can * only be used by the gzgetc() macro. You have been warned. */ struct gzFile_s { unsigned have; unsigned char *next; z_off64_t pos; }; ZEXTERN int ZEXPORT gzgetc_ OF((gzFile file)); /* backward compatibility */ #ifdef Z_PREFIX_SET # undef z_gzgetc # define z_gzgetc(g) \ ((g)->have ? ((g)->have--, (g)->pos++, *((g)->next)++) : (gzgetc)(g)) #else # define gzgetc(g) \ ((g)->have ? ((g)->have--, (g)->pos++, *((g)->next)++) : (gzgetc)(g)) #endif /* provide 64-bit offset functions if _LARGEFILE64_SOURCE defined, and/or * change the regular functions to 64 bits if _FILE_OFFSET_BITS is 64 (if * both are true, the application gets the *64 functions, and the regular * functions are changed to 64 bits) -- in case these are set on systems * without large file support, _LFS64_LARGEFILE must also be true */ #ifdef Z_LARGE64 ZEXTERN gzFile ZEXPORT gzopen64 OF((const char *, const char *)); ZEXTERN z_off64_t ZEXPORT gzseek64 OF((gzFile, z_off64_t, int)); ZEXTERN z_off64_t ZEXPORT gztell64 OF((gzFile)); ZEXTERN z_off64_t ZEXPORT gzoffset64 OF((gzFile)); ZEXTERN uLong ZEXPORT adler32_combine64 OF((uLong, uLong, z_off64_t)); ZEXTERN uLong ZEXPORT crc32_combine64 OF((uLong, uLong, z_off64_t)); #endif #if !defined(ZLIB_INTERNAL) && defined(Z_WANT64) # ifdef Z_PREFIX_SET # define z_gzopen z_gzopen64 # define z_gzseek z_gzseek64 # define z_gztell z_gztell64 # define z_gzoffset z_gzoffset64 # define z_adler32_combine z_adler32_combine64 # define z_crc32_combine z_crc32_combine64 # else # define gzopen gzopen64 # define gzseek gzseek64 # define gztell gztell64 # define gzoffset gzoffset64 # define adler32_combine adler32_combine64 # define crc32_combine crc32_combine64 # endif # ifndef Z_LARGE64 ZEXTERN gzFile ZEXPORT gzopen64 OF((const char *, const char *)); ZEXTERN z_off_t ZEXPORT gzseek64 OF((gzFile, z_off_t, int)); ZEXTERN z_off_t ZEXPORT gztell64 OF((gzFile)); ZEXTERN z_off_t ZEXPORT gzoffset64 OF((gzFile)); ZEXTERN uLong ZEXPORT adler32_combine64 OF((uLong, uLong, z_off_t)); ZEXTERN uLong ZEXPORT crc32_combine64 OF((uLong, uLong, z_off_t)); # endif #else ZEXTERN gzFile ZEXPORT gzopen OF((const char *, const char *)); ZEXTERN z_off_t ZEXPORT gzseek OF((gzFile, z_off_t, int)); ZEXTERN z_off_t ZEXPORT gztell OF((gzFile)); ZEXTERN z_off_t ZEXPORT gzoffset OF((gzFile)); ZEXTERN uLong ZEXPORT adler32_combine OF((uLong, uLong, z_off_t)); ZEXTERN uLong ZEXPORT crc32_combine OF((uLong, uLong, z_off_t)); #endif #else /* Z_SOLO */ ZEXTERN uLong ZEXPORT adler32_combine OF((uLong, uLong, z_off_t)); ZEXTERN uLong ZEXPORT crc32_combine OF((uLong, uLong, z_off_t)); #endif /* !Z_SOLO */ /* undocumented functions */ ZEXTERN const char * ZEXPORT zError OF((int)); ZEXTERN int ZEXPORT inflateSyncPoint OF((z_streamp)); ZEXTERN const z_crc_t FAR * ZEXPORT get_crc_table OF((void)); ZEXTERN int ZEXPORT inflateUndermine OF((z_streamp, int)); ZEXTERN int ZEXPORT inflateValidate OF((z_streamp, int)); ZEXTERN unsigned long ZEXPORT inflateCodesUsed OF ((z_streamp)); ZEXTERN int ZEXPORT inflateResetKeep OF((z_streamp)); ZEXTERN int ZEXPORT deflateResetKeep OF((z_streamp)); #if (defined(_WIN32) || defined(__CYGWIN__)) && !defined(Z_SOLO) ZEXTERN gzFile ZEXPORT gzopen_w OF((const wchar_t *path, const char *mode)); #endif #if defined(STDC) || defined(Z_HAVE_STDARG_H) # ifndef Z_SOLO ZEXTERN int ZEXPORTVA gzvprintf Z_ARG((gzFile file, const char *format, va_list va)); # endif #endif #ifdef __cplusplus } #endif #endif /* ZLIB_H */ UEFITool-A66/common/zlib/zutil.c000077500000000000000000000162101442134156300165470ustar00rootroot00000000000000/* zutil.c -- target dependent utility functions for the compression library * Copyright (C) 1995-2017 Jean-loup Gailly * For conditions of distribution and use, see copyright notice in zlib.h */ /* @(#) $Id$ */ #include "zutil.h" #ifndef Z_SOLO # include "gzguts.h" #endif z_const char * const z_errmsg[10] = { (z_const char *)"need dictionary", /* Z_NEED_DICT 2 */ (z_const char *)"stream end", /* Z_STREAM_END 1 */ (z_const char *)"", /* Z_OK 0 */ (z_const char *)"file error", /* Z_ERRNO (-1) */ (z_const char *)"stream error", /* Z_STREAM_ERROR (-2) */ (z_const char *)"data error", /* Z_DATA_ERROR (-3) */ (z_const char *)"insufficient memory", /* Z_MEM_ERROR (-4) */ (z_const char *)"buffer error", /* Z_BUF_ERROR (-5) */ (z_const char *)"incompatible version",/* Z_VERSION_ERROR (-6) */ (z_const char *)"" }; const char * ZEXPORT zlibVersion() { return ZLIB_VERSION; } uLong ZEXPORT zlibCompileFlags() { uLong flags; flags = 0; switch ((int)(sizeof(uInt))) { case 2: break; case 4: flags += 1; break; case 8: flags += 2; break; default: flags += 3; } switch ((int)(sizeof(uLong))) { case 2: break; case 4: flags += 1 << 2; break; case 8: flags += 2 << 2; break; default: flags += 3 << 2; } switch ((int)(sizeof(voidpf))) { case 2: break; case 4: flags += 1 << 4; break; case 8: flags += 2 << 4; break; default: flags += 3 << 4; } switch ((int)(sizeof(z_off_t))) { case 2: break; case 4: flags += 1 << 6; break; case 8: flags += 2 << 6; break; default: flags += 3 << 6; } #ifdef ZLIB_DEBUG flags += 1 << 8; #endif #if defined(ASMV) || defined(ASMINF) flags += 1 << 9; #endif #ifdef ZLIB_WINAPI flags += 1 << 10; #endif #ifdef BUILDFIXED flags += 1 << 12; #endif #ifdef DYNAMIC_CRC_TABLE flags += 1 << 13; #endif #ifdef NO_GZCOMPRESS flags += 1L << 16; #endif #ifdef NO_GZIP flags += 1L << 17; #endif #ifdef PKZIP_BUG_WORKAROUND flags += 1L << 20; #endif #ifdef FASTEST flags += 1L << 21; #endif #if defined(STDC) || defined(Z_HAVE_STDARG_H) # ifdef NO_vsnprintf flags += 1L << 25; # ifdef HAS_vsprintf_void flags += 1L << 26; # endif # else # ifdef HAS_vsnprintf_void flags += 1L << 26; # endif # endif #else flags += 1L << 24; # ifdef NO_snprintf flags += 1L << 25; # ifdef HAS_sprintf_void flags += 1L << 26; # endif # else # ifdef HAS_snprintf_void flags += 1L << 26; # endif # endif #endif return flags; } #ifdef ZLIB_DEBUG #include # ifndef verbose # define verbose 0 # endif int ZLIB_INTERNAL z_verbose = verbose; void ZLIB_INTERNAL z_error (m) char *m; { fprintf(stderr, "%s\n", m); exit(1); } #endif /* exported to allow conversion of error code to string for compress() and * uncompress() */ const char * ZEXPORT zError(err) int err; { return ERR_MSG(err); } #if defined(_WIN32_WCE) /* The Microsoft C Run-Time Library for Windows CE doesn't have * errno. We define it as a global variable to simplify porting. * Its value is always 0 and should not be used. */ int errno = 0; #endif #ifndef HAVE_MEMCPY void ZLIB_INTERNAL zmemcpy(dest, source, len) Bytef* dest; const Bytef* source; uInt len; { if (len == 0) return; do { *dest++ = *source++; /* ??? to be unrolled */ } while (--len != 0); } int ZLIB_INTERNAL zmemcmp(s1, s2, len) const Bytef* s1; const Bytef* s2; uInt len; { uInt j; for (j = 0; j < len; j++) { if (s1[j] != s2[j]) return 2*(s1[j] > s2[j])-1; } return 0; } void ZLIB_INTERNAL zmemzero(dest, len) Bytef* dest; uInt len; { if (len == 0) return; do { *dest++ = 0; /* ??? to be unrolled */ } while (--len != 0); } #endif #ifndef Z_SOLO #ifdef SYS16BIT #ifdef __TURBOC__ /* Turbo C in 16-bit mode */ # define MY_ZCALLOC /* Turbo C malloc() does not allow dynamic allocation of 64K bytes * and farmalloc(64K) returns a pointer with an offset of 8, so we * must fix the pointer. Warning: the pointer must be put back to its * original form in order to free it, use zcfree(). */ #define MAX_PTR 10 /* 10*64K = 640K */ local int next_ptr = 0; typedef struct ptr_table_s { voidpf org_ptr; voidpf new_ptr; } ptr_table; local ptr_table table[MAX_PTR]; /* This table is used to remember the original form of pointers * to large buffers (64K). Such pointers are normalized with a zero offset. * Since MSDOS is not a preemptive multitasking OS, this table is not * protected from concurrent access. This hack doesn't work anyway on * a protected system like OS/2. Use Microsoft C instead. */ voidpf ZLIB_INTERNAL zcalloc (voidpf opaque, unsigned items, unsigned size) { voidpf buf; ulg bsize = (ulg)items*size; (void)opaque; /* If we allocate less than 65520 bytes, we assume that farmalloc * will return a usable pointer which doesn't have to be normalized. */ if (bsize < 65520L) { buf = farmalloc(bsize); if (*(ush*)&buf != 0) return buf; } else { buf = farmalloc(bsize + 16L); } if (buf == NULL || next_ptr >= MAX_PTR) return NULL; table[next_ptr].org_ptr = buf; /* Normalize the pointer to seg:0 */ *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4; *(ush*)&buf = 0; table[next_ptr++].new_ptr = buf; return buf; } void ZLIB_INTERNAL zcfree (voidpf opaque, voidpf ptr) { int n; (void)opaque; if (*(ush*)&ptr != 0) { /* object < 64K */ farfree(ptr); return; } /* Find the original pointer */ for (n = 0; n < next_ptr; n++) { if (ptr != table[n].new_ptr) continue; farfree(table[n].org_ptr); while (++n < next_ptr) { table[n-1] = table[n]; } next_ptr--; return; } Assert(0, "zcfree: ptr not found"); } #endif /* __TURBOC__ */ #ifdef M_I86 /* Microsoft C in 16-bit mode */ # define MY_ZCALLOC #if (!defined(_MSC_VER) || (_MSC_VER <= 600)) # define _halloc halloc # define _hfree hfree #endif voidpf ZLIB_INTERNAL zcalloc (voidpf opaque, uInt items, uInt size) { (void)opaque; return _halloc((long)items, size); } void ZLIB_INTERNAL zcfree (voidpf opaque, voidpf ptr) { (void)opaque; _hfree(ptr); } #endif /* M_I86 */ #endif /* SYS16BIT */ #ifndef MY_ZCALLOC /* Any system without a special alloc function */ #ifndef STDC extern voidp malloc OF((uInt size)); extern voidp calloc OF((uInt items, uInt size)); extern void free OF((voidpf ptr)); #endif voidpf ZLIB_INTERNAL zcalloc (opaque, items, size) voidpf opaque; unsigned items; unsigned size; { (void)opaque; return sizeof(uInt) > 2 ? (voidpf)malloc(items * size) : (voidpf)calloc(items, size); } void ZLIB_INTERNAL zcfree (opaque, ptr) voidpf opaque; voidpf ptr; { (void)opaque; free(ptr); } #endif /* MY_ZCALLOC */ #endif /* !Z_SOLO */ UEFITool-A66/common/zlib/zutil.h000077500000000000000000000157271442134156300165700ustar00rootroot00000000000000/* zutil.h -- internal interface and configuration of the compression library * Copyright (C) 1995-2016 Jean-loup Gailly, Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ /* WARNING: this file should *not* be used by applications. It is part of the implementation of the compression library and is subject to change. Applications should only use zlib.h. */ /* @(#) $Id$ */ #ifndef ZUTIL_H #define ZUTIL_H #ifdef HAVE_HIDDEN # define ZLIB_INTERNAL __attribute__((visibility ("hidden"))) #else # define ZLIB_INTERNAL #endif #include "zlib.h" #if defined(STDC) && !defined(Z_SOLO) # if !(defined(_WIN32_WCE) && defined(_MSC_VER)) # include # endif # include # include #endif #ifdef Z_SOLO typedef long ptrdiff_t; /* guess -- will be caught if guess is wrong */ #endif #ifndef local # define local static #endif /* since "static" is used to mean two completely different things in C, we define "local" for the non-static meaning of "static", for readability (compile with -Dlocal if your debugger can't find static symbols) */ typedef unsigned char uch; typedef uch FAR uchf; typedef unsigned short ush; typedef ush FAR ushf; typedef unsigned long ulg; extern z_const char * const z_errmsg[10]; /* indexed by 2-zlib_error */ /* (size given to avoid silly warnings with Visual C++) */ #define ERR_MSG(err) z_errmsg[Z_NEED_DICT-(err)] #define ERR_RETURN(strm,err) \ return (strm->msg = ERR_MSG(err), (err)) /* To be used only when the state is known to be valid */ /* common constants */ #ifndef DEF_WBITS # define DEF_WBITS MAX_WBITS #endif /* default windowBits for decompression. MAX_WBITS is for compression only */ #if MAX_MEM_LEVEL >= 8 # define DEF_MEM_LEVEL 8 #else # define DEF_MEM_LEVEL MAX_MEM_LEVEL #endif /* default memLevel */ #define STORED_BLOCK 0 #define STATIC_TREES 1 #define DYN_TREES 2 /* The three kinds of block type */ #define MIN_MATCH 3 #define MAX_MATCH 258 /* The minimum and maximum match lengths */ #define PRESET_DICT 0x20 /* preset dictionary flag in zlib header */ /* target dependencies */ #if defined(MSDOS) || (defined(WINDOWS) && !defined(WIN32)) # define OS_CODE 0x00 # ifndef Z_SOLO # if defined(__TURBOC__) || defined(__BORLANDC__) # if (__STDC__ == 1) && (defined(__LARGE__) || defined(__COMPACT__)) /* Allow compilation with ANSI keywords only enabled */ void _Cdecl farfree( void *block ); void *_Cdecl farmalloc( unsigned long nbytes ); # else # include # endif # else /* MSC or DJGPP */ # include # endif # endif #endif #ifdef AMIGA # define OS_CODE 1 #endif #if defined(VAXC) || defined(VMS) # define OS_CODE 2 # define F_OPEN(name, mode) \ fopen((name), (mode), "mbc=60", "ctx=stm", "rfm=fix", "mrs=512") #endif #ifdef __370__ # if __TARGET_LIB__ < 0x20000000 # define OS_CODE 4 # elif __TARGET_LIB__ < 0x40000000 # define OS_CODE 11 # else # define OS_CODE 8 # endif #endif #if defined(ATARI) || defined(atarist) # define OS_CODE 5 #endif #ifdef OS2 # define OS_CODE 6 # if defined(M_I86) && !defined(Z_SOLO) # include # endif #endif #if defined(MACOS) || defined(TARGET_OS_MAC) # define OS_CODE 7 # ifndef Z_SOLO # if defined(__MWERKS__) && __dest_os != __be_os && __dest_os != __win32_os # include /* for fdopen */ # else # ifndef fdopen # define fdopen(fd,mode) NULL /* No fdopen() */ # endif # endif # endif #endif #ifdef __acorn # define OS_CODE 13 #endif #if defined(WIN32) && !defined(__CYGWIN__) # define OS_CODE 10 #endif #ifdef _BEOS_ # define OS_CODE 16 #endif #ifdef __TOS_OS400__ # define OS_CODE 18 #endif #ifdef __APPLE__ # define OS_CODE 19 #endif #if defined(_BEOS_) || defined(RISCOS) # define fdopen(fd,mode) NULL /* No fdopen() */ #endif #if (defined(_MSC_VER) && (_MSC_VER > 600)) && !defined __INTERIX # if defined(_WIN32_WCE) # define fdopen(fd,mode) NULL /* No fdopen() */ # ifndef _PTRDIFF_T_DEFINED typedef int ptrdiff_t; # define _PTRDIFF_T_DEFINED # endif # else # define fdopen(fd,type) _fdopen(fd,type) # endif #endif #if defined(__BORLANDC__) && !defined(MSDOS) #pragma warn -8004 #pragma warn -8008 #pragma warn -8066 #endif /* provide prototypes for these when building zlib without LFS */ #if !defined(_WIN32) && \ (!defined(_LARGEFILE64_SOURCE) || _LFS64_LARGEFILE-0 == 0) ZEXTERN uLong ZEXPORT adler32_combine64 OF((uLong, uLong, z_off_t)); ZEXTERN uLong ZEXPORT crc32_combine64 OF((uLong, uLong, z_off_t)); #endif /* common defaults */ #ifndef OS_CODE # define OS_CODE 3 /* assume Unix */ #endif #ifndef F_OPEN # define F_OPEN(name, mode) fopen((name), (mode)) #endif /* functions */ #if defined(pyr) || defined(Z_SOLO) # define NO_MEMCPY #endif #if defined(SMALL_MEDIUM) && !defined(_MSC_VER) && !defined(__SC__) /* Use our own functions for small and medium model with MSC <= 5.0. * You may have to use the same strategy for Borland C (untested). * The __SC__ check is for Symantec. */ # define NO_MEMCPY #endif #if defined(STDC) && !defined(HAVE_MEMCPY) && !defined(NO_MEMCPY) # define HAVE_MEMCPY #endif #ifdef HAVE_MEMCPY # ifdef SMALL_MEDIUM /* MSDOS small or medium model */ # define zmemcpy _fmemcpy # define zmemcmp _fmemcmp # define zmemzero(dest, len) _fmemset(dest, 0, len) # else # define zmemcpy memcpy # define zmemcmp memcmp # define zmemzero(dest, len) memset(dest, 0, len) # endif #else void ZLIB_INTERNAL zmemcpy OF((Bytef* dest, const Bytef* source, uInt len)); int ZLIB_INTERNAL zmemcmp OF((const Bytef* s1, const Bytef* s2, uInt len)); void ZLIB_INTERNAL zmemzero OF((Bytef* dest, uInt len)); #endif /* Diagnostic functions */ #ifdef ZLIB_DEBUG # include extern int ZLIB_INTERNAL z_verbose; extern void ZLIB_INTERNAL z_error OF((char *m)); # define Assert(cond,msg) {if(!(cond)) z_error(msg);} # define Trace(x) {if (z_verbose>=0) fprintf x ;} # define Tracev(x) {if (z_verbose>0) fprintf x ;} # define Tracevv(x) {if (z_verbose>1) fprintf x ;} # define Tracec(c,x) {if (z_verbose>0 && (c)) fprintf x ;} # define Tracecv(c,x) {if (z_verbose>1 && (c)) fprintf x ;} #else # define Assert(cond,msg) # define Trace(x) # define Tracev(x) # define Tracevv(x) # define Tracec(c,x) # define Tracecv(c,x) #endif #ifndef Z_SOLO voidpf ZLIB_INTERNAL zcalloc OF((voidpf opaque, unsigned items, unsigned size)); void ZLIB_INTERNAL zcfree OF((voidpf opaque, voidpf ptr)); #endif #define ZALLOC(strm, items, size) \ (*((strm)->zalloc))((strm)->opaque, (items), (size)) #define ZFREE(strm, addr) (*((strm)->zfree))((strm)->opaque, (voidpf)(addr)) #define TRY_FREE(s, p) {if (p) ZFREE(s, p);} /* Reverse the bytes in a 32-bit value */ #define ZSWAP32(q) ((((q) >> 24) & 0xff) + (((q) >> 8) & 0xff00) + \ (((q) & 0xff00) << 8) + (((q) & 0xff) << 24)) #endif /* ZUTIL_H */ UEFITool-A66/fuzzing/000077500000000000000000000000001442134156300144755ustar00rootroot00000000000000UEFITool-A66/fuzzing/CMakeLists.txt000066400000000000000000000056011442134156300172370ustar00rootroot00000000000000CMAKE_MINIMUM_REQUIRED(VERSION 3.1.0 FATAL_ERROR) PROJECT(ffsparser_fuzzer LANGUAGES C CXX) OPTION(USE_QT "Link against Qt" OFF) OPTION(USE_AFL "Build in AFL-compatible mode" OFF) SET(CMAKE_CXX_STANDARD 11) SET(CMAKE_CXX_STANDARD_REQUIRED ON) SET(CMAKE_CXX_EXTENSIONS OFF) SET(PROJECT_SOURCES ffsparser_fuzzer.cpp ../common/types.cpp ../common/descriptor.cpp ../common/guiddatabase.cpp ../common/ffs.cpp ../common/nvram.cpp ../common/nvramparser.cpp ../common/meparser.cpp ../common/ffsparser.cpp ../common/fitparser.cpp ../common/peimage.cpp ../common/treeitem.cpp ../common/treemodel.cpp ../common/utility.cpp ../common/LZMA/LzmaDecompress.c ../common/LZMA/SDK/C/Bra.c ../common/LZMA/SDK/C/Bra86.c ../common/LZMA/SDK/C/CpuArch.c ../common/LZMA/SDK/C/LzmaDec.c ../common/Tiano/EfiTianoDecompress.c ../common/ustring.cpp ../common/generated/ami_nvar.cpp ../common/generated/intel_acbp_v1.cpp ../common/generated/intel_acbp_v2.cpp ../common/generated/intel_keym_v1.cpp ../common/generated/intel_keym_v2.cpp ../common/generated/intel_acm.cpp ../common/kaitai/kaitaistream.cpp ../common/digest/sha1.c ../common/digest/sha256.c ../common/digest/sha512.c ../common/digest/sm3.c ../common/zlib/adler32.c ../common/zlib/compress.c ../common/zlib/crc32.c ../common/zlib/deflate.c ../common/zlib/gzclose.c ../common/zlib/gzlib.c ../common/zlib/gzread.c ../common/zlib/gzwrite.c ../common/zlib/inflate.c ../common/zlib/infback.c ../common/zlib/inftrees.c ../common/zlib/inffast.c ../common/zlib/trees.c ../common/zlib/uncompr.c ../common/zlib/zutil.c ) IF(USE_AFL) SET(PROJECT_SOURCES ${PROJECT_SOURCES} afl_driver.cpp) MESSAGE("-- Building in AFL-compatible mode") ELSE() MESSAGE("-- Building in libFuzzer mode") ENDIF() IF(NOT USE_QT) SET(PROJECT_SOURCES ${PROJECT_SOURCES} ../common/bstrlib/bstrlib.c ../common/bstrlib/bstrwrap.cpp ) MESSAGE("-- Using non-Qt implementations") ELSE() FIND_PACKAGE(Qt6 REQUIRED COMPONENTS Core) MESSAGE("-- Using Qt version: ${Qt6_VERSION}") ENDIF() ADD_DEFINITIONS( -DU_ENABLE_NVRAM_PARSING_SUPPORT -DU_ENABLE_ME_PARSING_SUPPORT -DU_ENABLE_FIT_PARSING_SUPPORT -DU_ENABLE_GUID_DATABASE_SUPPORT ) ADD_EXECUTABLE(ffsparser_fuzzer ${PROJECT_SOURCES}) IF(NOT USE_AFL_DRIVER) TARGET_COMPILE_OPTIONS(ffsparser_fuzzer PRIVATE -O1 -fno-omit-frame-pointer -g -ggdb3 -fsanitize=fuzzer,address,undefined -fsanitize-address-use-after-scope -fno-sanitize-recover=undefined) TARGET_LINK_LIBRARIES(ffsparser_fuzzer PRIVATE -fsanitize=fuzzer,address,undefined) ELSE() TARGET_COMPILE_OPTIONS(ffsparser_fuzzer PRIVATE -O1 -fno-omit-frame-pointer -g -ggdb3 -fsanitize=address,undefined -fsanitize-coverage=trace-pc-guard -fsanitize-address-use-after-scope -fno-sanitize-recover=undefined) TARGET_LINK_LIBRARIES(ffsparser_fuzzer PRIVATE -fsanitize=address,undefined) ENDIF() IF(USE_QT) TARGET_LINK_LIBRARIES(ffsparser_fuzzer PRIVATE Qt6::Core) ENDIF() UEFITool-A66/fuzzing/afl_driver.cpp000066400000000000000000000217051442134156300173230ustar00rootroot00000000000000//===- afl_driver.cpp - a glue between AFL and libFuzzer --------*- C++ -* ===// // // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. // See https://llvm.org/LICENSE.txt for license information. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception //===----------------------------------------------------------------------===// /* This file allows to fuzz libFuzzer-style target functions (LLVMFuzzerTestOneInput) with AFL using AFL's persistent (in-process) mode. Usage: ################################################################################ cat << EOF > test_fuzzer.cc #include #include extern "C" int LLVMFuzzerTestOneInput(const uint8_t *data, size_t size) { if (size > 0 && data[0] == 'H') if (size > 1 && data[1] == 'I') if (size > 2 && data[2] == '!') __builtin_trap(); return 0; } EOF # Build your target with -fsanitize-coverage=trace-pc-guard using fresh clang. clang -g -fsanitize-coverage=trace-pc-guard test_fuzzer.cc -c # Build afl-llvm-rt.o.c from the AFL distribution. clang -c -w $AFL_HOME/llvm_mode/afl-llvm-rt.o.c # Build this file, link it with afl-llvm-rt.o.o and the target code. clang++ afl_driver.cpp test_fuzzer.o afl-llvm-rt.o.o # Run AFL: rm -rf IN OUT; mkdir IN OUT; echo z > IN/z; $AFL_HOME/afl-fuzz -i IN -o OUT ./a.out ################################################################################ AFL_DRIVER_STDERR_DUPLICATE_FILENAME: Setting this *appends* stderr to the file specified. If the file does not exist, it is created. This is useful for getting stack traces (when using ASAN for example) or original error messages on hard to reproduce bugs. Note that any content written to stderr will be written to this file instead of stderr's usual location. AFL_DRIVER_CLOSE_FD_MASK: Similar to libFuzzer's -close_fd_mask behavior option. If 1, close stdout at startup. If 2 close stderr; if 3 close both. */ #include #include #include #include #include #include #include #include #include #include // Platform detection. Copied from FuzzerInternal.h #ifdef __linux__ #define LIBFUZZER_LINUX 1 #define LIBFUZZER_APPLE 0 #define LIBFUZZER_NETBSD 0 #define LIBFUZZER_FREEBSD 0 #define LIBFUZZER_OPENBSD 0 #elif __APPLE__ #define LIBFUZZER_LINUX 0 #define LIBFUZZER_APPLE 1 #define LIBFUZZER_NETBSD 0 #define LIBFUZZER_FREEBSD 0 #define LIBFUZZER_OPENBSD 0 #elif __NetBSD__ #define LIBFUZZER_LINUX 0 #define LIBFUZZER_APPLE 0 #define LIBFUZZER_NETBSD 1 #define LIBFUZZER_FREEBSD 0 #define LIBFUZZER_OPENBSD 0 #elif __FreeBSD__ #define LIBFUZZER_LINUX 0 #define LIBFUZZER_APPLE 0 #define LIBFUZZER_NETBSD 0 #define LIBFUZZER_FREEBSD 1 #define LIBFUZZER_OPENBSD 0 #elif __OpenBSD__ #define LIBFUZZER_LINUX 0 #define LIBFUZZER_APPLE 0 #define LIBFUZZER_NETBSD 0 #define LIBFUZZER_FREEBSD 0 #define LIBFUZZER_OPENBSD 1 #else #error "Support for your platform has not been implemented" #endif // libFuzzer interface is thin, so we don't include any libFuzzer headers. extern "C" { int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size); __attribute__((weak)) int LLVMFuzzerInitialize(int *argc, char ***argv); } // Notify AFL about persistent mode. static volatile char AFL_PERSISTENT[] = "##SIG_AFL_PERSISTENT##"; extern "C" int __afl_persistent_loop(unsigned int); static volatile char suppress_warning2 = AFL_PERSISTENT[0]; // Notify AFL about deferred forkserver. static volatile char AFL_DEFER_FORKSVR[] = "##SIG_AFL_DEFER_FORKSRV##"; extern "C" void __afl_manual_init(); static volatile char suppress_warning1 = AFL_DEFER_FORKSVR[0]; // Input buffer. static const size_t kMaxAflInputSize = 1 << 20; static uint8_t AflInputBuf[kMaxAflInputSize]; // Use this optionally defined function to output sanitizer messages even if // user asks to close stderr. __attribute__((weak)) extern "C" void __sanitizer_set_report_fd(void *); // Keep track of where stderr content is being written to, so that // dup_and_close_stderr can use the correct one. static FILE *output_file = stderr; // Experimental feature to use afl_driver without AFL's deferred mode. // Needs to run before __afl_auto_init. __attribute__((constructor(0))) static void __decide_deferred_forkserver(void) { if (getenv("AFL_DRIVER_DONT_DEFER")) { if (unsetenv("__AFL_DEFER_FORKSRV")) { perror("Failed to unset __AFL_DEFER_FORKSRV"); abort(); } } } // If the user asks us to duplicate stderr, then do it. static void maybe_duplicate_stderr() { char *stderr_duplicate_filename = getenv("AFL_DRIVER_STDERR_DUPLICATE_FILENAME"); if (!stderr_duplicate_filename) return; FILE *stderr_duplicate_stream = freopen(stderr_duplicate_filename, "a+", stderr); if (!stderr_duplicate_stream) { fprintf( stderr, "Failed to duplicate stderr to AFL_DRIVER_STDERR_DUPLICATE_FILENAME"); abort(); } output_file = stderr_duplicate_stream; } // Most of these I/O functions were inspired by/copied from libFuzzer's code. static void discard_output(int fd) { FILE *temp = fopen("/dev/null", "w"); if (!temp) abort(); dup2(fileno(temp), fd); fclose(temp); } static void close_stdout() { discard_output(STDOUT_FILENO); } // Prevent the targeted code from writing to "stderr" but allow sanitizers and // this driver to do so. static void dup_and_close_stderr() { int output_fileno = fileno(output_file); int output_fd = dup(output_fileno); if (output_fd <= 0) abort(); FILE *new_output_file = fdopen(output_fd, "w"); if (!new_output_file) abort(); if (!__sanitizer_set_report_fd) return; __sanitizer_set_report_fd(reinterpret_cast(output_fd)); discard_output(output_fileno); } static void Printf(const char *Fmt, ...) { va_list ap; va_start(ap, Fmt); vfprintf(output_file, Fmt, ap); va_end(ap); fflush(output_file); } // Close stdout and/or stderr if user asks for it. static void maybe_close_fd_mask() { char *fd_mask_str = getenv("AFL_DRIVER_CLOSE_FD_MASK"); if (!fd_mask_str) return; int fd_mask = atoi(fd_mask_str); if (fd_mask & 2) dup_and_close_stderr(); if (fd_mask & 1) close_stdout(); } // Define LLVMFuzzerMutate to avoid link failures for targets that use it // with libFuzzer's LLVMFuzzerCustomMutator. extern "C" size_t LLVMFuzzerMutate(uint8_t *Data, size_t Size, size_t MaxSize) { assert(false && "LLVMFuzzerMutate should not be called from afl_driver"); return 0; } // Execute any files provided as parameters. static int ExecuteFilesOnyByOne(int argc, char **argv) { for (int i = 1; i < argc; i++) { std::ifstream in(argv[i], std::ios::binary); in.seekg(0, in.end); size_t length = in.tellg(); in.seekg (0, in.beg); std::cout << "Reading " << length << " bytes from " << argv[i] << std::endl; // Allocate exactly length bytes so that we reliably catch buffer overflows. std::vector bytes(length); in.read(bytes.data(), bytes.size()); assert(in); LLVMFuzzerTestOneInput(reinterpret_cast(bytes.data()), bytes.size()); std::cout << "Execution successful" << std::endl; } return 0; } int main(int argc, char **argv) { Printf( "======================= INFO =========================\n" "This binary is built for AFL-fuzz.\n" "To run the target function on individual input(s) execute this:\n" " %s < INPUT_FILE\n" "or\n" " %s INPUT_FILE1 [INPUT_FILE2 ... ]\n" "To fuzz with afl-fuzz execute this:\n" " afl-fuzz [afl-flags] %s [-N]\n" "afl-fuzz will run N iterations before " "re-spawning the process (default: 1000)\n" "======================================================\n", argv[0], argv[0], argv[0]); maybe_duplicate_stderr(); maybe_close_fd_mask(); if (LLVMFuzzerInitialize) LLVMFuzzerInitialize(&argc, &argv); // Do any other expensive one-time initialization here. if (!getenv("AFL_DRIVER_DONT_DEFER")) __afl_manual_init(); int N = 1000; if (argc == 2 && argv[1][0] == '-') N = atoi(argv[1] + 1); else if(argc == 2 && (N = atoi(argv[1])) > 0) Printf("WARNING: using the deprecated call style `%s %d`\n", argv[0], N); else if (argc > 1) return ExecuteFilesOnyByOne(argc, argv); assert(N > 0); // Call LLVMFuzzerTestOneInput here so that coverage caused by initialization // on the first execution of LLVMFuzzerTestOneInput is ignored. uint8_t dummy_input[1] = {0}; LLVMFuzzerTestOneInput(dummy_input, 1); int num_runs = 0; while (__afl_persistent_loop(N)) { ssize_t n_read = read(0, AflInputBuf, kMaxAflInputSize); if (n_read > 0) { // Copy AflInputBuf into a separate buffer to let asan find buffer // overflows. Don't use unique_ptr/etc to avoid extra dependencies. uint8_t *copy = new uint8_t[n_read]; memcpy(copy, AflInputBuf, n_read); num_runs++; LLVMFuzzerTestOneInput(copy, n_read); delete[] copy; } } Printf("%s: successfully executed %d input(s)\n", argv[0], num_runs); } UEFITool-A66/fuzzing/ffsparser_fuzzer.cpp000066400000000000000000000021431442134156300206010ustar00rootroot00000000000000/* ffsparser_fuzzer.cpp Copyright (c) 2023, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #include "../common/ffsparser.h" #define FUZZING_MIN_INPUT_SIZE 16 #define FUZZING_MAX_INPUT_SIZE (128 * 1024 * 1024) extern "C" int LLVMFuzzerTestOneInput(const char *Data, long long Size) { // Do not overblow the inout file size, won't change much in practical sense if (Size > FUZZING_MAX_INPUT_SIZE || Size < FUZZING_MIN_INPUT_SIZE) return 0; // Create the FFS parser TreeModel* model = new TreeModel(); FfsParser* ffsParser = new FfsParser(model); // Parse the image (void)ffsParser->parse(UByteArray(Data, (uint32_t)Size)); delete model; delete ffsParser; return 0; } UEFITool-A66/kaitai_regenerate.sh000077500000000000000000000033351442134156300170070ustar00rootroot00000000000000#!/bin/bash UTARGET=$(uname) # Determine platform if [ "$UTARGET" = "Darwin" ]; then export UPLATFORM="mac" export UFIND="find -E" export UFINDOPT="" export USEDOPT="''" elif [ "$UTARGET" = "Linux" ]; then export UPLATFORM="linux_$(uname -m)" export UFIND="find" export UFINDOPT="-regextype posix-extended" export USEDOPT="" else export UPLATFORM="$UTARGET" echo "Please run this script on Linux or macOS" fi # Generate echo "Attempting to to generate parsers from Kaitai KSY files on ${UPLATFORM}..." kaitai-struct-compiler --target cpp_stl --cpp-standard 11 --outdir common/generated common/ksy/* || exit 1 # Show generated files ${UFIND} common/generated ${UFINDOPT} \ -regex '.*\.(cpp|h)' \ -print || exit 1 # Replace global includes for kaitai with local ones (<> -> "") ${UFIND} common/generated ${UFINDOPT} \ -regex '.*\.(cpp|h)' \ -exec sed -i ${USEDOPT} '/^#include ]/\"/g' {} + || exit 1 # Add .. to the include path for kaitai includes ${UFIND} common/generated ${UFINDOPT} \ -regex '.*\.(cpp|h)' \ -exec sed -i ${USEDOPT} '/^#include \"kaitai\//s/kaitai\//..\/kaitai\//g' {} + || exit 1 # Suppress "p__root - unused parameter" warning ${UFIND} common/generated ${UFINDOPT} \ -regex '.*\.(cpp)' \ -exec sed -i ${USEDOPT} '/^ m__root = this;/s/;/; (void)p__root;/g' {} + || exit 1 # Add uint64_t to enum structure_ids_t ${UFIND} common/generated ${UFINDOPT} \ -regex '.*\.(h)' \ -exec sed -i ${USEDOPT} '/^ enum structure_ids_t {/s/{/: uint64_t {/g' {} + || exit 1 # Suppress type downcast warning in ami_nvar.cpp ${UFIND} common/generated ${UFINDOPT} \ -name 'ami_nvar.cpp' \ -exec sed -i ${USEDOPT} 's/_offset = _io()->pos();/_offset = (int32_t)_io()->pos();/g' {} + || exit 1 exit 0 UEFITool-A66/meson.build000066400000000000000000000003701442134156300151430ustar00rootroot00000000000000project('UEFITool', ['c', 'cpp'], version: 'A66', license: 'BSD-2-Clause', meson_version: '>=0.45.0', default_options : ['c_std=c11', 'cpp_std=c++11'], ) zlib = dependency('zlib') subdir('common') subdir('UEFIExtract') subdir('UEFIFind') UEFITool-A66/sonar-project.properties000066400000000000000000000000761442134156300177100ustar00rootroot00000000000000sonar.projectKey=LongSoft_UEFITool sonar.organization=longsoftUEFITool-A66/version.h000066400000000000000000000011231442134156300146340ustar00rootroot00000000000000/* version.h Copyright (c) 2019, Nikolaj Schlej. All rights reserved. This program and the accompanying materials are licensed and made available under the terms and conditions of the BSD License which accompanies this distribution. The full text of the license may be found at http://opensource.org/licenses/bsd-license.php THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED. */ #ifndef VERSION_H #define VERSION_H #define PROGRAM_VERSION "NE alpha 66" " (" __DATE__ ")" #endif // VERSION_H