Revert "[1] Add unrar source code (v5.6.1.4) to third_party."

This reverts commit 0941a32d.

Reason for revert: Causing build failures https://bugs.chromium.org/p/chromium/issues/detail?id=807391

Original change's description:
> [1] Add unrar source code (v5.6.1.4) to third_party.
>
> Safe Browsing Download Protection for .RAR files:
> This library will be used to unpack any .rar files
> downloaded by the user to ensure that they are safe.
> This code would execute inside a sandboxed process.
>
> This code is being fuzzed via OSS-Fuzz here:
> https://github.com/google/oss-fuzz/tree/master/projects/unrar
>
> Here's the author's permission to use this library
> for fuzzing and inclusion in Chrome: http://go/wknlc
>
> Followed the process listed at:
> https://chromium.googlesource.com/chromium/src.git/+/master/docs/adding_to_third_party.md
>
> Bug: 750327
> Change-Id: Ia6978fcf43f1ba570d6e8dad5daf2903cbdb3834
> Reviewed-on: https://chromium-review.googlesource.com/855044
> Commit-Queue: Varun Khaneja <vakh@chromium.org>
> Reviewed-by: Justin Schuh <jschuh@chromium.org>
> Reviewed-by: Varun Khaneja <vakh@chromium.org>
> Reviewed-by: Jialiu Lin <jialiul@chromium.org>
> Reviewed-by: Nathan Parker <nparker@chromium.org>
> Cr-Commit-Position: refs/heads/master@{#531767}

TBR=thakis@chromium.org,jschuh@chromium.org,xam@google.com,nparker@chromium.org,vakh@chromium.org,jialiul@chromium.org,rend@google.com,jschuh@google.com,morbo@google.com

# Not skipping CQ checks because original CL landed > 1 day ago.

Bug: 750327, 807391
Change-Id: Id2494b74b1eceebd67cef769219e0b2149dad8d9
Reviewed-on: https://chromium-review.googlesource.com/895399Reviewed-by: Nathan Parker <nparker@chromium.org>
Reviewed-by: Jialiu Lin <jialiul@chromium.org>
Reviewed-by: Varun Khaneja <vakh@chromium.org>
Commit-Queue: Varun Khaneja <vakh@chromium.org>
Cr-Commit-Position: refs/heads/master@{#533682}

third_party/unrar/BUILD.gn

-# Copyright 2018 The Chromium Authors. All rights reserved.
-# Use of this source code is governed by a BSD-style license that can be
-# found in the LICENSE file.
-
-static_library("unrar") {
-  deps = []
-
-  sources = [
-    "src/archive.cpp",
-    "src/arcread.cpp",
-    "src/blake2s.cpp",
-    "src/cmddata.cpp",
-    "src/consio.cpp",
-    "src/crc.cpp",
-    "src/crypt.cpp",
-    "src/dll.cpp",
-    "src/encname.cpp",
-    "src/errhnd.cpp",
-    "src/extinfo.cpp",
-    "src/extract.cpp",
-    "src/filcreat.cpp",
-    "src/file.cpp",
-    "src/filefn.cpp",
-    "src/filestr.cpp",
-    "src/find.cpp",
-    "src/getbits.cpp",
-    "src/global.cpp",
-    "src/hash.cpp",
-    "src/headers.cpp",
-    "src/isnt.cpp",
-    "src/list.cpp",
-    "src/match.cpp",
-    "src/options.cpp",
-    "src/pathfn.cpp",
-    "src/qopen.cpp",
-    "src/rar.cpp",
-    "src/rarvm.cpp",
-    "src/rawread.cpp",
-    "src/rdwrfn.cpp",
-    "src/resource.cpp",
-    "src/rijndael.cpp",
-    "src/rs16.cpp",
-    "src/scantree.cpp",
-    "src/secpassword.cpp",
-    "src/sha1.cpp",
-    "src/sha256.cpp",
-    "src/smallfn.cpp",
-    "src/strfn.cpp",
-    "src/strlist.cpp",
-    "src/system.cpp",
-    "src/threadpool.cpp",
-    "src/timefn.cpp",
-    "src/ui.cpp",
-    "src/unicode.cpp",
-    "src/unpack.cpp",
-    "src/volume.cpp",
-  ]
-
-  defines = [ "_FILE_OFFSET_BITS=64", "LARGEFILE_SOURCE", "RAR_SMP" ]
-}

third_party/unrar/LICENSE

-(Copied from src/license.txt)
------------------------------
-
- ******    *****   ******   UnRAR - free utility for RAR archives
- **   **  **   **  **   **  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
- ******   *******  ******    License for use and distribution of
- **   **  **   **  **   **   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
- **   **  **   **  **   **         FREE portable version
-                                   ~~~~~~~~~~~~~~~~~~~~~
-
-      The source code of UnRAR utility is freeware. This means:
-
-   1. All copyrights to RAR and the utility UnRAR are exclusively
-      owned by the author - Alexander Roshal.
-
-   2. UnRAR source code may be used in any software to handle
-      RAR archives without limitations free of charge, but cannot be
-      used to develop RAR (WinRAR) compatible archiver and to
-      re-create RAR compression algorithm, which is proprietary.
-      Distribution of modified UnRAR source code in separate form
-      or as a part of other software is permitted, provided that
-      full text of this paragraph, starting from "UnRAR source code"
-      words, is included in license, or in documentation if license
-      is not available, and in source code comments of resulting package.
-
-   3. The UnRAR utility may be freely distributed. It is allowed
-      to distribute UnRAR inside of other software packages.
-
-   4. THE RAR ARCHIVER AND THE UnRAR UTILITY ARE DISTRIBUTED "AS IS".
-      NO WARRANTY OF ANY KIND IS EXPRESSED OR IMPLIED.  YOU USE AT 
-      YOUR OWN RISK. THE AUTHOR WILL NOT BE LIABLE FOR DATA LOSS, 
-      DAMAGES, LOSS OF PROFITS OR ANY OTHER KIND OF LOSS WHILE USING
-      OR MISUSING THIS SOFTWARE.
-
-   5. Installing and using the UnRAR utility signifies acceptance of
-      these terms and conditions of the license.
-
-   6. If you don't agree with terms of the license you must remove
-      UnRAR files from your storage devices and cease to use the
-      utility.
-
-      Thank you for your interest in RAR and UnRAR.
-
-
-                                            Alexander L. Roshal

third_party/unrar/OWNERS

-nparker@chromium.org
-vakh@chromium.org

third_party/unrar/README.chromium

-Name: UnRAR source for decompressing .RAR and other files.
-Short Name: unrar
-URL: https://github.com/aawc/unrar.git
-Revision: 0ff832d31470471803b175cfff4e40c1b08ee779
-Version: 5.6.1.4
-License: Non-standard
-License File: src/license.txt
-Security Critical: yes
-
-Description:
-This library is used to decompress and analyze .RAR and other related files that
-have been downloaded by the user to check their Safe Browsing reputation. It is
-only for Chromium on desktop.

third_party/unrar/src/acknow.txt

-                           ACKNOWLEDGMENTS
-
-* We used "Screaming Fast Galois Field Arithmetic Using Intel
-  SIMD Instructions" paper by James S. Plank, Kevin M. Greenan
-  and Ethan L. Miller to improve Reed-Solomon coding performance.
-  Also we are grateful to Artem Drobanov and Bulat Ziganshin
-  for samples and ideas allowed to make Reed-Solomon coding
-  more efficient.
-
-* RAR text compression algorithm is based on Dmitry Shkarin PPMII
-  and Dmitry Subbotin carryless rangecoder public domain source code.
-  You may find it in ftp.elf.stuba.sk/pub/pc/pack.
-
-* RAR encryption includes parts of code from Szymon Stefanek
-  and Brian Gladman AES implementations also as Steve Reid SHA-1 source.
-
-  ---------------------------------------------------------------------------
-  Copyright (c) 2002, Dr Brian Gladman <                 >, Worcester, UK.
-  All rights reserved.
-
-  LICENSE TERMS
-
-  The free distribution and use of this software in both source and binary
-  form is allowed (with or without changes) provided that:
-
-    1. distributions of this source code include the above copyright
-       notice, this list of conditions and the following disclaimer;
-
-    2. distributions in binary form include the above copyright
-       notice, this list of conditions and the following disclaimer
-       in the documentation and/or other associated materials;
-
-    3. the copyright holder's name is not used to endorse products
-       built using this software without specific written permission.
-
-  ALTERNATIVELY, provided that this notice is retained in full, this product
-  may be distributed under the terms of the GNU General Public License (GPL),
-  in which case the provisions of the GPL apply INSTEAD OF those given above.
-
-  DISCLAIMER
-
-  This software is provided 'as is' with no explicit or implied warranties
-  in respect of its properties, including, but not limited to, correctness
-  and/or fitness for purpose.
-  ---------------------------------------------------------------------------
-
-  Source code of this package also as other cryptographic technology
-  and computing project related links are available on Brian Gladman's
-  web site: http://www.gladman.me.uk
-
-* RAR uses CRC32 function based on Intel Slicing-by-8 algorithm.
-  Original Intel Slicing-by-8 code is available here:
-
-    http://sourceforge.net/projects/slicing-by-8/
-
-  Original Intel Slicing-by-8 code is licensed under BSD License
-  available at http://www.opensource.org/licenses/bsd-license.html
-
-    Copyright (c) 2004-2006 Intel Corporation. 
-    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.
-
-* RAR archives may optionally include BLAKE2sp hash ( https://blake2.net ),
-  designed by Jean-Philippe Aumasson, Samuel Neves, Zooko Wilcox-O'Hearn
-  and Christian Winnerlein.
-
-* Useful hints provided by Alexander Khoroshev and Bulat Ziganshin allowed
-  to significantly improve RAR compression and speed.

third_party/unrar/src/arccmt.cpp

-static bool IsAnsiEscComment(const wchar *Data,size_t Size);
-
-bool Archive::GetComment(Array<wchar> *CmtData)
-{
-  if (!MainComment)
-    return false;
-  SaveFilePos SavePos(*this);
-
-#ifndef SFX_MODULE
-  uint CmtLength;
-  if (Format==RARFMT14)
-  {
-    Seek(SFXSize+SIZEOF_MAINHEAD14,SEEK_SET);
-    CmtLength=GetByte();
-    CmtLength+=(GetByte()<<8);
-  }
-  else
-#endif
-  {
-    if (MainHead.CommentInHeader)
-    {
-      // Old style (RAR 2.9) archive comment embedded into the main 
-      // archive header.
-      Seek(SFXSize+SIZEOF_MARKHEAD3+SIZEOF_MAINHEAD3,SEEK_SET);
-      if (!ReadHeader())
-        return false;
-    }
-    else
-    {
-      // Current (RAR 3.0+) version of archive comment.
-      Seek(GetStartPos(),SEEK_SET);
-      return SearchSubBlock(SUBHEAD_TYPE_CMT)!=0 && ReadCommentData(CmtData);
-    }
-#ifndef SFX_MODULE
-    // Old style (RAR 2.9) comment header embedded into the main 
-    // archive header.
-    if (BrokenHeader)
-    {
-      uiMsg(UIERROR_CMTBROKEN,FileName);
-      return false;
-    }
-    CmtLength=CommHead.HeadSize-SIZEOF_COMMHEAD;
-#endif
-  }
-#ifndef SFX_MODULE
-  if (Format==RARFMT14 && MainHead.PackComment || Format!=RARFMT14 && CommHead.Method!=0x30)
-  {
-    if (Format!=RARFMT14 && (CommHead.UnpVer < 15 || CommHead.UnpVer > VER_UNPACK || CommHead.Method > 0x35))
-      return false;
-    ComprDataIO DataIO;
-    DataIO.SetTestMode(true);
-    uint UnpCmtLength;
-    if (Format==RARFMT14)
-    {
-#ifdef RAR_NOCRYPT
-      return false;
-#else
-      UnpCmtLength=GetByte();
-      UnpCmtLength+=(GetByte()<<8);
-      CmtLength-=2;
-      DataIO.SetCmt13Encryption();
-      CommHead.UnpVer=15;
-#endif
-    }
-    else
-      UnpCmtLength=CommHead.UnpSize;
-    DataIO.SetFiles(this,NULL);
-    DataIO.EnableShowProgress(false);
-    DataIO.SetPackedSizeToRead(CmtLength);
-    DataIO.UnpHash.Init(HASH_CRC32,1);
-    DataIO.SetNoFileHeader(true); // this->FileHead is not filled yet.
-
-    Unpack CmtUnpack(&DataIO);
-    CmtUnpack.Init(0x10000,false);
-    CmtUnpack.SetDestSize(UnpCmtLength);
-    CmtUnpack.DoUnpack(CommHead.UnpVer,false);
-
-    if (Format!=RARFMT14 && (DataIO.UnpHash.GetCRC32()&0xffff)!=CommHead.CommCRC)
-    {
-      uiMsg(UIERROR_CMTBROKEN,FileName);
-      return false;
-    }
-    else
-    {
-      byte *UnpData;
-      size_t UnpDataSize;
-      DataIO.GetUnpackedData(&UnpData,&UnpDataSize);
-#ifdef _WIN_ALL
-      // If we ever decide to extend it to Android, we'll need to alloc
-      // 4x memory for OEM to UTF-8 output here.
-      OemToCharBuffA((char *)UnpData,(char *)UnpData,(DWORD)UnpDataSize);
-#endif
-      CmtData->Alloc(UnpDataSize+1);
-      memset(CmtData->Addr(0),0,CmtData->Size()*sizeof(wchar));
-      CharToWide((char *)UnpData,CmtData->Addr(0),CmtData->Size());
-      CmtData->Alloc(wcslen(CmtData->Addr(0)));
-    }
-  }
-  else
-  {
-    if (CmtLength==0)
-      return false;
-    Array<byte> CmtRaw(CmtLength);
-    int ReadSize=Read(&CmtRaw[0],CmtLength);
-    if (ReadSize>=0 && (uint)ReadSize<CmtLength) // Comment is shorter than declared.
-    {
-      CmtLength=ReadSize;
-      CmtRaw.Alloc(CmtLength);
-    }
-
-    if (Format!=RARFMT14 && CommHead.CommCRC!=(~CRC32(0xffffffff,&CmtRaw[0],CmtLength)&0xffff))
-    {
-      uiMsg(UIERROR_CMTBROKEN,FileName);
-      return false;
-    }
-    CmtData->Alloc(CmtLength+1);
-    CmtRaw.Push(0);
-#ifdef _WIN_ALL
-    // If we ever decide to extend it to Android, we'll need to alloc
-    // 4x memory for OEM to UTF-8 output here.
-    OemToCharA((char *)&CmtRaw[0],(char *)&CmtRaw[0]);
-#endif
-    CharToWide((char *)&CmtRaw[0],CmtData->Addr(0),CmtData->Size());
-    CmtData->Alloc(wcslen(CmtData->Addr(0)));
-  }
-#endif
-  return CmtData->Size() > 0;
-}
-
-
-bool Archive::ReadCommentData(Array<wchar> *CmtData)
-{
-  Array<byte> CmtRaw;
-  if (!ReadSubData(&CmtRaw,NULL))
-    return false;
-  size_t CmtSize=CmtRaw.Size();
-  CmtRaw.Push(0);
-  CmtData->Alloc(CmtSize+1);
-  if (Format==RARFMT50)
-    UtfToWide((char *)&CmtRaw[0],CmtData->Addr(0),CmtData->Size());
-  else
-    if ((SubHead.SubFlags & SUBHEAD_FLAGS_CMT_UNICODE)!=0)
-    {
-      RawToWide(&CmtRaw[0],CmtData->Addr(0),CmtSize/2);
-      (*CmtData)[CmtSize/2]=0;
-
-    }
-    else
-    {
-      CharToWide((char *)&CmtRaw[0],CmtData->Addr(0),CmtData->Size());
-    }
-  CmtData->Alloc(wcslen(CmtData->Addr(0))); // Set buffer size to actual comment length.
-  return true;
-}
-
-
-void Archive::ViewComment()
-{
-  if (Cmd->DisableComment)
-    return;
-  Array<wchar> CmtBuf;
-  if (GetComment(&CmtBuf)) // In GUI too, so "Test" command detects broken comments.
-  {
-    size_t CmtSize=CmtBuf.Size();
-    wchar *ChPtr=wcschr(&CmtBuf[0],0x1A);
-    if (ChPtr!=NULL)
-      CmtSize=ChPtr-&CmtBuf[0];
-    mprintf(L"\n");
-    OutComment(&CmtBuf[0],CmtSize);
-  }
-}
-
-

third_party/unrar/src/archive.cpp

-#include "rar.hpp"
-
-#include "arccmt.cpp"
-
-
-#ifdef USE_ARCMEM
-#include "arcmem.cpp"
-#endif
-
-Archive::Archive(RAROptions *InitCmd)
-{
-  Cmd=NULL; // Just in case we'll have an exception in 'new' below.
-
-  DummyCmd=(InitCmd==NULL);
-  Cmd=DummyCmd ? (new RAROptions):InitCmd;
-
-  OpenShared=Cmd->OpenShared;
-  Format=RARFMT15;
-  Solid=false;
-  Volume=false;
-  MainComment=false;
-  Locked=false;
-  Signed=false;
-  FirstVolume=false;
-  NewNumbering=false;
-  SFXSize=0;
-  LatestTime.Reset();
-  Protected=false;
-  Encrypted=false;
-  FailedHeaderDecryption=false;
-  BrokenHeader=false;
-  LastReadBlock=0;
-
-  CurBlockPos=0;
-  NextBlockPos=0;
-
-  RecoverySize=-1;
-  RecoveryPercent=-1;
-
-  memset(&MainHead,0,sizeof(MainHead));
-  memset(&CryptHead,0,sizeof(CryptHead));
-  memset(&EndArcHead,0,sizeof(EndArcHead));
-
-  VolNumber=0;
-  VolWrite=0;
-  AddingFilesSize=0;
-  AddingHeadersSize=0;
-  *FirstVolumeName=0;
-
-  Splitting=false;
-  NewArchive=false;
-
-  SilentOpen=false;
-
-#ifdef USE_QOPEN
-  ProhibitQOpen=false;
-#endif
-
-}
-
-
-Archive::~Archive()
-{
-  if (DummyCmd)
-    delete Cmd;
-}
-
-
-void Archive::CheckArc(bool EnableBroken)
-{
-  if (!IsArchive(EnableBroken))
-  {
-    // If FailedHeaderDecryption is set, we already reported that archive
-    // password is incorrect.
-    if (!FailedHeaderDecryption)
-      uiMsg(UIERROR_BADARCHIVE,FileName);
-    ErrHandler.Exit(RARX_FATAL);
-  }
-}
-
-
-#if !defined(SFX_MODULE)
-void Archive::CheckOpen(const wchar *Name)
-{
-  TOpen(Name);
-  CheckArc(false);
-}
-#endif
-
-
-bool Archive::WCheckOpen(const wchar *Name)
-{
-  if (!WOpen(Name))
-    return false;
-  if (!IsArchive(false))
-  {
-    uiMsg(UIERROR_BADARCHIVE,FileName);
-    Close();
-    return false;
-  }
-  return true;
-}
-
-
-RARFORMAT Archive::IsSignature(const byte *D,size_t Size)
-{
-  RARFORMAT Type=RARFMT_NONE;
-  if (Size>=1 && D[0]==0x52)
-#ifndef SFX_MODULE
-    if (Size>=4 && D[1]==0x45 && D[2]==0x7e && D[3]==0x5e)
-      Type=RARFMT14;
-    else
-#endif
-      if (Size>=7 && D[1]==0x61 && D[2]==0x72 && D[3]==0x21 && D[4]==0x1a && D[5]==0x07)
-      {
-        // We check the last signature byte, so we can return a sensible
-        // warning in case we'll want to change the archive format
-        // sometimes in the future.
-        if (D[6]==0)
-          Type=RARFMT15;
-        else
-          if (D[6]==1)
-            Type=RARFMT50;
-          else
-            if (D[6]>1 && D[6]<5)
-              Type=RARFMT_FUTURE;
-      }
-  return Type;
-}
-
-
-bool Archive::IsArchive(bool EnableBroken)
-{
-  Encrypted=false;
-  BrokenHeader=false; // Might be left from previous volume.
-  
-#ifndef SFX_MODULE
-  if (IsDevice())
-  {
-    uiMsg(UIERROR_INVALIDNAME,FileName,FileName);
-    return false;
-  }
-#endif
-  if (Read(MarkHead.Mark,SIZEOF_MARKHEAD3)!=SIZEOF_MARKHEAD3)
-    return false;
-  SFXSize=0;
-  
-  RARFORMAT Type;
-  if ((Type=IsSignature(MarkHead.Mark,SIZEOF_MARKHEAD3))!=RARFMT_NONE)
-  {
-    Format=Type;
-    if (Format==RARFMT14)
-      Seek(Tell()-SIZEOF_MARKHEAD3,SEEK_SET);
-  }
-  else
-  {
-    Array<char> Buffer(MAXSFXSIZE);
-    long CurPos=(long)Tell();
-    int ReadSize=Read(&Buffer[0],Buffer.Size()-16);
-    for (int I=0;I<ReadSize;I++)
-      if (Buffer[I]==0x52 && (Type=IsSignature((byte *)&Buffer[I],ReadSize-I))!=RARFMT_NONE)
-      {
-        Format=Type;
-        if (Format==RARFMT14 && I>0 && CurPos<28 && ReadSize>31)
-        {
-          char *D=&Buffer[28-CurPos];
-          if (D[0]!=0x52 || D[1]!=0x53 || D[2]!=0x46 || D[3]!=0x58)
-            continue;
-        }
-        SFXSize=CurPos+I;
-        Seek(SFXSize,SEEK_SET);
-        if (Format==RARFMT15 || Format==RARFMT50)
-          Read(MarkHead.Mark,SIZEOF_MARKHEAD3);
-        break;
-      }
-    if (SFXSize==0)
-      return false;
-  }
-  if (Format==RARFMT_FUTURE)
-  {
-    uiMsg(UIERROR_NEWRARFORMAT,FileName);
-    return false;
-  }
-  if (Format==RARFMT50) // RAR 5.0 signature is by one byte longer.
-  {
-    if (Read(MarkHead.Mark+SIZEOF_MARKHEAD3,1)!=1 || MarkHead.Mark[SIZEOF_MARKHEAD3]!=0)
-      return false;
-    MarkHead.HeadSize=SIZEOF_MARKHEAD5;
-  }
-  else
-    MarkHead.HeadSize=SIZEOF_MARKHEAD3;
-
-#ifdef RARDLL
-  // If callback function is not set, we cannot get the password,
-  // so we skip the initial header processing for encrypted header archive.
-  // It leads to skipped archive comment, but the rest of archive data
-  // is processed correctly.
-  if (Cmd->Callback==NULL)
-    SilentOpen=true;
-#endif
-
-  bool HeadersLeft; // Any headers left to read.
-  // Skip the archive encryption header if any and read the main header.
-  while ((HeadersLeft=(ReadHeader()!=0))==true) // Additional parentheses to silence Clang.
-  {
-    SeekToNext();
-
-    HEADER_TYPE Type=GetHeaderType();
-    // In RAR 5.0 we need to quit after reading HEAD_CRYPT if we wish to
-    // avoid the password prompt.
-    if (Type==HEAD_MAIN || SilentOpen && Type==HEAD_CRYPT)
-      break;
-  }
-
-  // This check allows to make RS based recovery even if password is incorrect.
-  // But we should not do it for EnableBroken or we'll get 'not RAR archive'
-  // messages when extracting encrypted archives with wrong password.
-  if (FailedHeaderDecryption && !EnableBroken)
-    return false;
-
-  if (BrokenHeader) // Main archive header is corrupt.
-  {
-    uiMsg(UIERROR_MHEADERBROKEN,FileName);
-    if (!EnableBroken)
-      return false;
-  }
-
-  MainComment=MainHead.CommentInHeader;
-
-  // If we process non-encrypted archive or can request a password,
-  // we set 'first volume' flag based on file attributes below.
-  // It is necessary for RAR 2.x archives, which did not have 'first volume'
-  // flag in main header. Also for all RAR formats we need to scan until
-  // first file header to set "comment" flag when reading service header.
-  // Unless we are in silent mode, we need to know about presence of comment
-  // immediately after IsArchive call.
-  if (HeadersLeft && (!SilentOpen || !Encrypted))
-  {
-    SaveFilePos SavePos(*this);
-    int64 SaveCurBlockPos=CurBlockPos,SaveNextBlockPos=NextBlockPos;
-    HEADER_TYPE SaveCurHeaderType=CurHeaderType;
-
-    while (ReadHeader()!=0)
-    {
-      HEADER_TYPE HeaderType=GetHeaderType();
-      if (HeaderType==HEAD_SERVICE)
-      {
-        // If we have a split service headers, it surely indicates non-first
-        // volume. But not split service header does not guarantee the first
-        // volume, because we can have split file after non-split archive
-        // comment. So we do not quit from loop here.
-        FirstVolume=Volume && !SubHead.SplitBefore;
-      }
-      else
-        if (HeaderType==HEAD_FILE)
-        {
-          FirstVolume=Volume && !FileHead.SplitBefore;
-          break;
-        }
-        else
-          if (HeaderType==HEAD_ENDARC) // Might happen if archive contains only a split service header.
-            break;
-      SeekToNext();
-    }
-    CurBlockPos=SaveCurBlockPos;
-    NextBlockPos=SaveNextBlockPos;
-    CurHeaderType=SaveCurHeaderType;
-  }
-  if (!Volume || FirstVolume)
-    wcsncpyz(FirstVolumeName,FileName,ASIZE(FirstVolumeName));
-
-  return true;
-}
-
-
-
-
-void Archive::SeekToNext()
-{
-  Seek(NextBlockPos,SEEK_SET);
-}
-
-
-
-
-
-
-// Calculate the block size including encryption fields and padding if any.
-uint Archive::FullHeaderSize(size_t Size)
-{
-  if (Encrypted)
-  {
-    Size = ALIGN_VALUE(Size, CRYPT_BLOCK_SIZE); // Align to encryption block size.
-    if (Format == RARFMT50)
-      Size += SIZE_INITV;
-    else
-      Size += SIZE_SALT30;
-  }
-  return uint(Size);
-}
-
-
-
-
-bool Archive::Open(const wchar *Name,uint Mode)
-{
-#ifdef USE_QOPEN
-  // Important if we reuse Archive object and it has virtual QOpen
-  // file position not matching real. For example, for 'l -v volname'.
-  QOpen.Unload();
-#endif
-
-#ifdef USE_ARCMEM
-  if (Cmd->ArcInMem)
-  {
-    wcsncpyz(FileName,Name,ASIZE(FileName));
-    ArcMem.Load(Cmd->ArcMemData,Cmd->ArcMemSize);
-    Cmd->SetArcInMem(NULL,0); // Return in memory data for first volume only, not for next volumes.
-    return true;
-  }
-#endif
-
-  return File::Open(Name,Mode);
-}
-
-
-
-bool Archive::Close()
-{
-#ifdef USE_ARCMEM
-  if (ArcMem.Unload())
-    return true;
-#endif
-  return File::Close();
-}
-
-
-
-int Archive::Read(void *Data,size_t Size)
-{
-#ifdef USE_QOPEN
-  size_t QResult;
-  if (QOpen.Read(Data,Size,QResult))
-    return (int)QResult;
-#endif
-#ifdef USE_ARCMEM
-  size_t AResult;
-  if (ArcMem.Read(Data,Size,AResult))
-    return (int)AResult;
-#endif
-  return File::Read(Data,Size);
-}
-
-
-void Archive::Seek(int64 Offset,int Method)
-{
-#ifdef USE_QOPEN
-  if (QOpen.Seek(Offset,Method))
-    return;
-#endif
-#ifdef USE_ARCMEM
-  if (ArcMem.Seek(Offset,Method))
-    return;
-#endif
-  File::Seek(Offset,Method);
-}
-
-
-int64 Archive::Tell()
-{
-#ifdef USE_QOPEN
-  int64 QPos;
-  if (QOpen.Tell(&QPos))
-    return QPos;
-#endif
-#ifdef USE_ARCMEM
-  int64 APos;
-  if (ArcMem.Tell(&APos))
-    return APos;
-#endif
-  return File::Tell();
-}
-
-
-
-bool Archive::IsOpened()
-{
-#ifdef USE_ARCMEM
-  if (ArcMem.IsLoaded())
-    return true;
-#endif
-  return File::IsOpened();
-};

third_party/unrar/src/archive.hpp

-#ifndef _RAR_ARCHIVE_
-#define _RAR_ARCHIVE_
-
-class PPack;
-class RawRead;
-class RawWrite;
-
-enum NOMODIFY_FLAGS 
-{
-  NMDF_ALLOWLOCK=1,NMDF_ALLOWANYVOLUME=2,NMDF_ALLOWFIRSTVOLUME=4
-};
-
-enum RARFORMAT {RARFMT_NONE,RARFMT14,RARFMT15,RARFMT50,RARFMT_FUTURE};
-
-enum ADDSUBDATA_FLAGS
-{
-  ASDF_SPLIT          = 1, // Allow to split archive just before header if necessary.
-  ASDF_COMPRESS       = 2, // Allow to compress data following subheader.
-  ASDF_CRYPT          = 4, // Encrypt data after subheader if password is set.
-  ASDF_CRYPTIFHEADERS = 8  // Encrypt data after subheader only in -hp mode.
-};
-
-class Archive:public File
-{
-  private:
-    void UpdateLatestTime(FileHeader *CurBlock);
-    void ConvertNameCase(wchar *Name);
-    void ConvertFileHeader(FileHeader *hd);
-    void WriteBlock50(HEADER_TYPE HeaderType,BaseBlock *wb,bool OnlySetSize,bool NonFinalWrite);
-    size_t ReadHeader14();
-    size_t ReadHeader15();
-    size_t ReadHeader50();
-    void ProcessExtra50(RawRead *Raw,size_t ExtraSize,BaseBlock *bb);
-    void RequestArcPassword();
-    void UnexpEndArcMsg();
-    void BrokenHeaderMsg();
-    void UnkEncVerMsg(const wchar *Name);
-    void UnkEncVerMsg();
-    bool ReadCommentData(Array<wchar> *CmtData);
-
-#if !defined(RAR_NOCRYPT)
-    CryptData HeadersCrypt;
-#endif
-    ComprDataIO SubDataIO;
-    bool DummyCmd;
-    RAROptions *Cmd;
-
-    int64 RecoverySize;
-    int RecoveryPercent;
-
-    RarTime LatestTime;
-    int LastReadBlock;
-    HEADER_TYPE CurHeaderType;
-
-    bool SilentOpen;
-#ifdef USE_QOPEN
-    QuickOpen QOpen;
-    bool ProhibitQOpen;
-#endif
-#ifdef USE_ARCMEM
-    ArcMemory ArcMem;
-#endif
-  public:
-    Archive(RAROptions *InitCmd=NULL);
-    ~Archive();
-    static RARFORMAT IsSignature(const byte *D,size_t Size);
-    bool IsArchive(bool EnableBroken);
-    size_t SearchBlock(HEADER_TYPE HeaderType);
-    size_t SearchSubBlock(const wchar *Type);
-    size_t SearchRR();
-    void WriteBlock(HEADER_TYPE HeaderType,BaseBlock *wb=NULL,bool OnlySetSize=false,bool NonFinalWrite=false);
-    void SetBlockSize(HEADER_TYPE HeaderType,BaseBlock *wb=NULL) {WriteBlock(HeaderType,wb,true);}
-    size_t ReadHeader();
-    void CheckArc(bool EnableBroken);
-    void CheckOpen(const wchar *Name);
-    bool WCheckOpen(const wchar *Name);
-    bool GetComment(Array<wchar> *CmtData);
-    void ViewComment();
-    void SetLatestTime(RarTime *NewTime);
-    void SeekToNext();
-    bool CheckAccess();
-    bool IsArcDir();
-    void ConvertAttributes();
-    void VolSubtractHeaderSize(size_t SubSize);
-    uint FullHeaderSize(size_t Size);
-    int64 GetStartPos();
-    void AddSubData(byte *SrcData,uint64 DataSize,File *SrcFile,
-         const wchar *Name,uint Flags);
-    bool ReadSubData(Array<byte> *UnpData,File *DestFile);
-    HEADER_TYPE GetHeaderType() {return CurHeaderType;};
-    RAROptions* GetRAROptions() {return Cmd;}
-    void SetSilentOpen(bool Mode) {SilentOpen=Mode;}
-#if 0
-    void GetRecoveryInfo(bool Required,int64 *Size,int *Percent);
-#endif
-    bool Open(const wchar *Name,uint Mode=FMF_READ);
-    bool Close();
-    int Read(void *Data,size_t Size);
-    void Seek(int64 Offset,int Method);
-    int64 Tell();
-    bool IsOpened();
-#ifdef USE_QOPEN
-    void QOpenUnload() {QOpen.Unload();}
-    void SetProhibitQOpen(bool Mode) {ProhibitQOpen=Mode;}
-#endif
-
-    BaseBlock ShortBlock;
-    MarkHeader MarkHead;
-    MainHeader MainHead;
-    CryptHeader CryptHead;
-    FileHeader FileHead;
-    EndArcHeader EndArcHead;
-    SubBlockHeader SubBlockHead;
-    FileHeader SubHead;
-    CommentHeader CommHead;
-    ProtectHeader ProtectHead;
-    AVHeader AVHead;
-    SignHeader SignHead;
-    UnixOwnersHeader UOHead;
-    MacFInfoHeader MACHead;
-    EAHeader EAHead;
-    StreamHeader StreamHead;
-
-    int64 CurBlockPos;
-    int64 NextBlockPos;
-
-    RARFORMAT Format;
-    bool Solid;
-    bool Volume;
-    bool MainComment;
-    bool Locked;
-    bool Signed;
-    bool FirstVolume;
-    bool NewNumbering;
-    bool Protected;
-    bool Encrypted;
-    size_t SFXSize;
-    bool BrokenHeader;
-    bool FailedHeaderDecryption;
-
-#if !defined(RAR_NOCRYPT)
-    byte ArcSalt[SIZE_SALT50];
-#endif
-
-    bool Splitting;
-
-    uint VolNumber;
-    int64 VolWrite;
-    uint64 AddingFilesSize;
-    uint64 AddingHeadersSize;
-
-    bool NewArchive;
-
-    wchar FirstVolumeName[NM];
-};
-
-
-#endif

third_party/unrar/src/arcmem.cpp

-ArcMemory::ArcMemory()
-{
-  Loaded=false;
-  SeekPos=0;
-}
-
-
-void ArcMemory::Load(const byte *Data,size_t Size)
-{
-  ArcData.Alloc(Size);
-  memcpy(&ArcData[0],Data,Size);
-  Loaded=true;
-  SeekPos=0;
-}
-
-
-bool ArcMemory::Unload()
-{
-  if (!Loaded)
-    return false;
-  Loaded=false;
-  return true;
-}
-
-
-bool ArcMemory::Read(void *Data,size_t Size,size_t &Result)
-{
-  if (!Loaded)
-    return false;
-  Result=(size_t)Min(Size,ArcData.Size()-SeekPos);
-  memcpy(Data,&ArcData[(size_t)SeekPos],Result);
-  SeekPos+=Result;
-  return true;
-}
-
-
-bool ArcMemory::Seek(int64 Offset,int Method)
-{
-  if (!Loaded)
-    return false;
-  if (Method==SEEK_SET)
-    SeekPos=Min(Offset,ArcData.Size());
-  else
-    if (Method==SEEK_CUR || Method==SEEK_END)
-    {
-      if (Method==SEEK_END)
-        SeekPos=ArcData.Size();
-      SeekPos+=(uint64)Offset;
-      if (SeekPos>ArcData.Size())
-        SeekPos=Offset<0 ? 0 : ArcData.Size();
-    }
-  return true;
-}
-
-
-bool ArcMemory::Tell(int64 *Pos)
-{
-  if (!Loaded)
-    return false;
-  *Pos=SeekPos;
-  return true;
-}

third_party/unrar/src/arcmem.hpp

-#ifndef _RAR_ARCMEM_
-#define _RAR_ARCMEM_
-
-// Memory interface for software fuzzers.
-
-class ArcMemory
-{
-  private:
-    bool Loaded;
-    Array<byte> ArcData;
-    uint64 SeekPos;
-  public:
-    ArcMemory();
-    void Load(const byte *Data,size_t Size);
-    bool Unload();
-    bool IsLoaded() {return Loaded;}
-    bool Read(void *Data,size_t Size,size_t &Result);
-    bool Seek(int64 Offset,int Method);
-    bool Tell(int64 *Pos);
-};
-
-#endif

third_party/unrar/src/array.hpp

-#ifndef _RAR_ARRAY_
-#define _RAR_ARRAY_
-
-extern ErrorHandler ErrHandler;
-
-template <class T> class Array
-{
-  private:
-    T *Buffer;
-    size_t BufSize;
-    size_t AllocSize;
-    size_t MaxSize;
-    bool Secure; // Clean memory if true.
-  public:
-    Array();
-    Array(size_t Size);
-    Array(const Array &Src); // Copy constructor.
-    ~Array();
-    inline void CleanData();
-    inline T& operator [](size_t Item) const;
-    inline T* operator + (size_t Pos);
-    inline size_t Size(); // Returns the size in items, not in bytes.
-    void Add(size_t Items);
-    void Alloc(size_t Items);
-    void Reset();
-    void SoftReset();
-    void operator = (Array<T> &Src);
-    void Push(T Item);
-    void Append(T *Item,size_t Count);
-    T* Addr(size_t Item) {return Buffer+Item;}
-    void SetMaxSize(size_t Size) {MaxSize=Size;}
-    T* Begin() {return Buffer;}
-    T* End() {return Buffer==NULL ? NULL:Buffer+BufSize;}
-    void SetSecure() {Secure=true;}
-};
-
-
-template <class T> void Array<T>::CleanData()
-{
-  Buffer=NULL;
-  BufSize=0;
-  AllocSize=0;
-  MaxSize=0;
-  Secure=false;
-}
-
-
-template <class T> Array<T>::Array()
-{
-  CleanData();
-}
-
-
-template <class T> Array<T>::Array(size_t Size)
-{
-  CleanData();
-  Add(Size);
-}
-
-
-// Copy constructor in case we need to pass an object as value.
-template <class T> Array<T>::Array(const Array &Src)
-{
-  CleanData();
-  Alloc(Src.BufSize);
-  if (Src.BufSize!=0)
-    memcpy((void *)Buffer,(void *)Src.Buffer,Src.BufSize*sizeof(T));
-}
-
-
-template <class T> Array<T>::~Array()
-{
-  if (Buffer!=NULL)
-  {
-    if (Secure)
-      cleandata(Buffer,AllocSize*sizeof(T));
-    free(Buffer);
-  }
-}
-
-
-template <class T> inline T& Array<T>::operator [](size_t Item) const
-{
-  return Buffer[Item];
-}
-
-
-template <class T> inline T* Array<T>::operator +(size_t Pos)
-{
-  return Buffer+Pos;
-}
-
-
-template <class T> inline size_t Array<T>::Size()
-{
-  return BufSize;
-}
-
-
-template <class T> void Array<T>::Add(size_t Items)
-{
-  BufSize+=Items;
-  if (BufSize>AllocSize)
-  {
-    if (MaxSize!=0 && BufSize>MaxSize)
-    {
-      ErrHandler.GeneralErrMsg(L"Maximum allowed array size (%u) is exceeded",MaxSize);
-      ErrHandler.MemoryError();
-    }
-
-    size_t Suggested=AllocSize+AllocSize/4+32;
-    size_t NewSize=Max(BufSize,Suggested);
-
-    T *NewBuffer;
-    if (Secure)
-    {
-      NewBuffer=(T *)malloc(NewSize*sizeof(T));
-      if (NewBuffer==NULL)
-        ErrHandler.MemoryError();
-      if (Buffer!=NULL)
-      {
-        memcpy(NewBuffer,Buffer,AllocSize*sizeof(T));
-        cleandata(Buffer,AllocSize*sizeof(T));
-        free(Buffer);
-      }
-    }
-    else
-    {
-      NewBuffer=(T *)realloc(Buffer,NewSize*sizeof(T));
-      if (NewBuffer==NULL)
-        ErrHandler.MemoryError();
-    }
-    Buffer=NewBuffer;
-    AllocSize=NewSize;
-  }
-}
-
-
-template <class T> void Array<T>::Alloc(size_t Items)
-{
-  if (Items>AllocSize)
-    Add(Items-BufSize);
-  else
-    BufSize=Items;
-}
-
-
-template <class T> void Array<T>::Reset()
-{
-  if (Buffer!=NULL)
-  {
-    free(Buffer);
-    Buffer=NULL;
-  }
-  BufSize=0;
-  AllocSize=0;
-}
-
-
-// Reset buffer size, but preserve already allocated memory if any,
-// so we can reuse it without wasting time to allocation.
-template <class T> void Array<T>::SoftReset()
-{
-  BufSize=0;
-}
-
-
-template <class T> void Array<T>::operator =(Array<T> &Src)
-{
-  Reset();
-  Alloc(Src.BufSize);
-  if (Src.BufSize!=0)
-    memcpy((void *)Buffer,(void *)Src.Buffer,Src.BufSize*sizeof(T));
-}
-
-
-template <class T> void Array<T>::Push(T Item)
-{
-  Add(1);
-  (*this)[Size()-1]=Item;
-}
-
-
-template <class T> void Array<T>::Append(T *Items,size_t Count)
-{
-  size_t CurSize=Size();
-  Add(Count);
-  memcpy(Buffer+CurSize,Items,Count*sizeof(T));
-}
-
-#endif

third_party/unrar/src/blake2s.cpp

-// Based on public domain code written in 2012 by Samuel Neves
-
-#include "rar.hpp"
-
-#ifdef USE_SSE
-#include "blake2s_sse.cpp"
-#endif
-
-static void blake2s_init_param( blake2s_state *S, uint32 node_offset, uint32 node_depth);
-static void blake2s_update( blake2s_state *S, const byte *in, size_t inlen );
-static void blake2s_final( blake2s_state *S, byte *digest );
-
-#include "blake2sp.cpp"
-
-static const uint32 blake2s_IV[8] =
-{
-  0x6A09E667UL, 0xBB67AE85UL, 0x3C6EF372UL, 0xA54FF53AUL,
-  0x510E527FUL, 0x9B05688CUL, 0x1F83D9ABUL, 0x5BE0CD19UL
-};
-
-static const byte blake2s_sigma[10][16] =
-{
-  {  0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15 } ,
-  { 14, 10,  4,  8,  9, 15, 13,  6,  1, 12,  0,  2, 11,  7,  5,  3 } ,
-  { 11,  8, 12,  0,  5,  2, 15, 13, 10, 14,  3,  6,  7,  1,  9,  4 } ,
-  {  7,  9,  3,  1, 13, 12, 11, 14,  2,  6,  5, 10,  4,  0, 15,  8 } ,
-  {  9,  0,  5,  7,  2,  4, 10, 15, 14,  1, 11, 12,  6,  8,  3, 13 } ,
-  {  2, 12,  6, 10,  0, 11,  8,  3,  4, 13,  7,  5, 15, 14,  1,  9 } ,
-  { 12,  5,  1, 15, 14, 13,  4, 10,  0,  7,  6,  3,  9,  2,  8, 11 } ,
-  { 13, 11,  7, 14, 12,  1,  3,  9,  5,  0, 15,  4,  8,  6,  2, 10 } ,
-  {  6, 15, 14,  9, 11,  3,  0,  8, 12,  2, 13,  7,  1,  4, 10,  5 } ,
-  { 10,  2,  8,  4,  7,  6,  1,  5, 15, 11,  9, 14,  3, 12, 13 , 0 } ,
-};
-
-static inline void blake2s_set_lastnode( blake2s_state *S )
-{
-  S->f[1] = ~0U;
-}
-
-
-/* Some helper functions, not necessarily useful */
-static inline void blake2s_set_lastblock( blake2s_state *S )
-{
-  if( S->last_node ) blake2s_set_lastnode( S );
-
-  S->f[0] = ~0U;
-}
-
-
-static inline void blake2s_increment_counter( blake2s_state *S, const uint32 inc )
-{
-  S->t[0] += inc;
-  S->t[1] += ( S->t[0] < inc );
-}
-
-
-/* init2 xors IV with input parameter block */
-void blake2s_init_param( blake2s_state *S, uint32 node_offset, uint32 node_depth)
-{
-#ifdef USE_SSE
-  if (_SSE_Version>=SSE_SSE2)
-    blake2s_init_sse();
-#endif
-
-  S->init(); // Clean data.
-  for( int i = 0; i < 8; ++i )
-    S->h[i] = blake2s_IV[i];
-
-  S->h[0] ^= 0x02080020; // We use BLAKE2sp parameters block.
-  S->h[2] ^= node_offset;
-  S->h[3] ^= (node_depth<<16)|0x20000000;
-}
-
-
-#define G(r,i,m,a,b,c,d) \
-  a = a + b + m[blake2s_sigma[r][2*i+0]]; \
-  d = rotr32(d ^ a, 16); \
-  c = c + d; \
-  b = rotr32(b ^ c, 12); \
-  a = a + b + m[blake2s_sigma[r][2*i+1]]; \
-  d = rotr32(d ^ a, 8); \
-  c = c + d; \
-  b = rotr32(b ^ c, 7);
-
-
-static void blake2s_compress( blake2s_state *S, const byte block[BLAKE2S_BLOCKBYTES] )
-{
-  uint32 m[16];
-  uint32 v[16];
-
-  for( size_t i = 0; i < 16; ++i )
-    m[i] = RawGet4( block + i * 4 );
-
-  for( size_t i = 0; i < 8; ++i )
-    v[i] = S->h[i];
-
-  v[ 8] = blake2s_IV[0];
-  v[ 9] = blake2s_IV[1];
-  v[10] = blake2s_IV[2];
-  v[11] = blake2s_IV[3];
-  v[12] = S->t[0] ^ blake2s_IV[4];
-  v[13] = S->t[1] ^ blake2s_IV[5];
-  v[14] = S->f[0] ^ blake2s_IV[6];
-  v[15] = S->f[1] ^ blake2s_IV[7];
-
-  for ( uint r = 0; r <= 9; ++r ) // No gain on i7 if unrolled, but exe size grows.
-  {
-    G(r,0,m,v[ 0],v[ 4],v[ 8],v[12]);
-    G(r,1,m,v[ 1],v[ 5],v[ 9],v[13]);
-    G(r,2,m,v[ 2],v[ 6],v[10],v[14]);
-    G(r,3,m,v[ 3],v[ 7],v[11],v[15]);
-    G(r,4,m,v[ 0],v[ 5],v[10],v[15]);
-    G(r,5,m,v[ 1],v[ 6],v[11],v[12]);
-    G(r,6,m,v[ 2],v[ 7],v[ 8],v[13]);
-    G(r,7,m,v[ 3],v[ 4],v[ 9],v[14]);
-  }
-
-  for( size_t i = 0; i < 8; ++i )
-    S->h[i] = S->h[i] ^ v[i] ^ v[i + 8];
-}
-
-
-void blake2s_update( blake2s_state *S, const byte *in, size_t inlen )
-{
-  while( inlen > 0 )
-  {
-    size_t left = S->buflen;
-    size_t fill = 2 * BLAKE2S_BLOCKBYTES - left;
-
-    if( inlen > fill )
-    {
-      memcpy( S->buf + left, in, fill ); // Fill buffer
-      S->buflen += fill;
-      blake2s_increment_counter( S, BLAKE2S_BLOCKBYTES );
-
-#ifdef USE_SSE
-#ifdef _WIN_32 // We use SSSE3 _mm_shuffle_epi8 only in x64 mode.
-      if (_SSE_Version>=SSE_SSE2)
-#else
-      if (_SSE_Version>=SSE_SSSE3)
-#endif
-        blake2s_compress_sse( S, S->buf );
-      else
-        blake2s_compress( S, S->buf ); // Compress
-#else
-      blake2s_compress( S, S->buf ); // Compress
-#endif
-      
-      memcpy( S->buf, S->buf + BLAKE2S_BLOCKBYTES, BLAKE2S_BLOCKBYTES ); // Shift buffer left
-      S->buflen -= BLAKE2S_BLOCKBYTES;
-      in += fill;
-      inlen -= fill;
-    }
-    else // inlen <= fill
-    {
-      memcpy( S->buf + left, in, (size_t)inlen );
-      S->buflen += (size_t)inlen; // Be lazy, do not compress
-      in += inlen;
-      inlen = 0;
-    }
-  }
-}
-
-
-void blake2s_final( blake2s_state *S, byte *digest )
-{
-  if( S->buflen > BLAKE2S_BLOCKBYTES )
-  {
-    blake2s_increment_counter( S, BLAKE2S_BLOCKBYTES );
-    blake2s_compress( S, S->buf );
-    S->buflen -= BLAKE2S_BLOCKBYTES;
-    memcpy( S->buf, S->buf + BLAKE2S_BLOCKBYTES, S->buflen );
-  }
-
-  blake2s_increment_counter( S, ( uint32 )S->buflen );
-  blake2s_set_lastblock( S );
-  memset( S->buf + S->buflen, 0, 2 * BLAKE2S_BLOCKBYTES - S->buflen ); /* Padding */
-  blake2s_compress( S, S->buf );
-
-  for( int i = 0; i < 8; ++i ) /* Output full hash  */
-    RawPut4( S->h[i], digest + 4 * i );
-}
-

third_party/unrar/src/blake2s.hpp

-// Based on public domain code written in 2012 by Samuel Neves
-#ifndef _RAR_BLAKE2_
-#define _RAR_BLAKE2_
-
-#define BLAKE2_DIGEST_SIZE 32
-
-enum blake2s_constant
-{
-  BLAKE2S_BLOCKBYTES = 64,
-  BLAKE2S_OUTBYTES   = 32
-};
-
-
-// Alignment to 64 improves performance of both SSE and non-SSE versions.
-// Alignment to n*16 is required for SSE version, so we selected 64.
-// We use the custom alignment scheme instead of __declspec(align(x)),
-// because it is less compiler dependent. Also the compiler directive
-// does not help if structure is a member of class allocated through
-// 'new' operator.
-struct blake2s_state
-{
-  enum { BLAKE_ALIGNMENT = 64 };
-
-  // buffer and uint32 h[8], t[2], f[2];
-  enum { BLAKE_DATA_SIZE = 48 + 2 * BLAKE2S_BLOCKBYTES };
-
-  byte ubuf[BLAKE_DATA_SIZE + BLAKE_ALIGNMENT];
-
-  byte   *buf;       // byte   buf[2 * BLAKE2S_BLOCKBYTES].
-  uint32 *h, *t, *f; // uint32 h[8], t[2], f[2].
-
-  size_t   buflen;
-  byte  last_node;
-
-  blake2s_state()
-  {
-    set_pointers();
-  }
-
-  // Required when we declare and assign in the same command.
-  blake2s_state(blake2s_state &st)
-  {
-    set_pointers();
-    *this=st;
-  }
-
-  void set_pointers()
-  {
-    // Set aligned pointers. Must be done in constructor, not in Init(),
-    // so assignments like 'blake2sp_state res=blake2ctx' work correctly
-    // even if blake2sp_init is not called for 'res'.
-    buf = (byte *) ALIGN_VALUE(ubuf, BLAKE_ALIGNMENT);
-    h   = (uint32 *) (buf + 2 * BLAKE2S_BLOCKBYTES);
-    t   = h + 8;
-    f   = t + 2;
-  }
-
-  void init()
-  {
-    memset( ubuf, 0, sizeof( ubuf ) );
-    buflen = 0;
-    last_node = 0;
-  }
-
-  // Since we use pointers, the default = would work incorrectly.
-  blake2s_state& operator = (blake2s_state &st)
-  {
-    if (this != &st)
-    {
-      memcpy(buf, st.buf, BLAKE_DATA_SIZE);
-      buflen = st.buflen;
-      last_node = st.last_node;
-    }
-    return *this;
-  }
-};
-
-
-#ifdef RAR_SMP
-class ThreadPool;
-#endif
-
-struct blake2sp_state
-{
-  blake2s_state S[8];
-  blake2s_state R;
-  byte buf[8 * BLAKE2S_BLOCKBYTES];
-  size_t buflen;
-
-#ifdef RAR_SMP
-  ThreadPool *ThPool;
-  uint MaxThreads;
-#endif
-};
-
-void blake2sp_init( blake2sp_state *S );
-void blake2sp_update( blake2sp_state *S, const byte *in, size_t inlen );
-void blake2sp_final( blake2sp_state *S, byte *digest );
-
-#endif
-

third_party/unrar/src/blake2s_sse.cpp

-// Based on public domain code written in 2012 by Samuel Neves
-
-extern const byte blake2s_sigma[10][16];
-
-// Initialization vector.
-static __m128i blake2s_IV_0_3, blake2s_IV_4_7;
-
-#ifdef _WIN_64
-// Constants for cyclic rotation. Used in 64-bit mode in mm_rotr_epi32 macro.
-static __m128i crotr8, crotr16;
-#endif
-
-static void blake2s_init_sse()
-{
-  // We cannot initialize these 128 bit variables in place when declaring
-  // them globally, because global scope initialization is performed before
-  // our SSE check and it would make code incompatible with older non-SSE2
-  // CPUs. Also we cannot initialize them as static inside of function
-  // using these variables, because SSE static initialization is not thread
-  // safe: first thread starts initialization and sets "init done" flag even
-  // if it is not done yet, second thread can attempt to access half-init
-  // SSE data. So we moved init code here.
-
-  blake2s_IV_0_3 = _mm_setr_epi32( 0x6A09E667, 0xBB67AE85, 0x3C6EF372, 0xA54FF53A );
-  blake2s_IV_4_7 = _mm_setr_epi32( 0x510E527F, 0x9B05688C, 0x1F83D9AB, 0x5BE0CD19 );
-
-#ifdef _WIN_64
-  crotr8 = _mm_set_epi8( 12, 15, 14, 13, 8, 11, 10, 9, 4, 7, 6, 5, 0, 3, 2, 1 );
-  crotr16 = _mm_set_epi8( 13, 12, 15, 14, 9, 8, 11, 10, 5, 4, 7, 6, 1, 0, 3, 2 );
-#endif
-}
-
-
-#define LOAD(p)  _mm_load_si128( (__m128i *)(p) )
-#define STORE(p,r) _mm_store_si128((__m128i *)(p), r)
-
-#ifdef _WIN_32
-// 32-bit mode has less SSE2 registers and in MSVC2008 it is more efficient
-// to not use _mm_shuffle_epi8 here.
-#define mm_rotr_epi32(r, c) ( \
-              _mm_xor_si128(_mm_srli_epi32( (r), c ),_mm_slli_epi32( (r), 32-c )) )
-#else
-#define mm_rotr_epi32(r, c) ( \
-                c==8 ? _mm_shuffle_epi8(r,crotr8) \
-              : c==16 ? _mm_shuffle_epi8(r,crotr16) \
-              : _mm_xor_si128(_mm_srli_epi32( (r), c ),_mm_slli_epi32( (r), 32-c )) )
-#endif
-
-
-#define G1(row1,row2,row3,row4,buf) \
-  row1 = _mm_add_epi32( _mm_add_epi32( row1, buf), row2 ); \
-  row4 = _mm_xor_si128( row4, row1 ); \
-  row4 =  mm_rotr_epi32(row4, 16); \
-  row3 = _mm_add_epi32( row3, row4 );   \
-  row2 = _mm_xor_si128( row2, row3 ); \
-  row2 =  mm_rotr_epi32(row2, 12);
-
-#define G2(row1,row2,row3,row4,buf) \
-  row1 = _mm_add_epi32( _mm_add_epi32( row1, buf), row2 ); \
-  row4 = _mm_xor_si128( row4, row1 ); \
-  row4 =  mm_rotr_epi32(row4, 8); \
-  row3 = _mm_add_epi32( row3, row4 );   \
-  row2 = _mm_xor_si128( row2, row3 ); \
-  row2 =  mm_rotr_epi32(row2, 7);
-
-#define DIAGONALIZE(row1,row2,row3,row4) \
-  row4 = _mm_shuffle_epi32( row4, _MM_SHUFFLE(2,1,0,3) ); \
-  row3 = _mm_shuffle_epi32( row3, _MM_SHUFFLE(1,0,3,2) ); \
-  row2 = _mm_shuffle_epi32( row2, _MM_SHUFFLE(0,3,2,1) );
-
-#define UNDIAGONALIZE(row1,row2,row3,row4) \
-  row4 = _mm_shuffle_epi32( row4, _MM_SHUFFLE(0,3,2,1) ); \
-  row3 = _mm_shuffle_epi32( row3, _MM_SHUFFLE(1,0,3,2) ); \
-  row2 = _mm_shuffle_epi32( row2, _MM_SHUFFLE(2,1,0,3) );
-
-#ifdef _WIN_64
-  // MSVC 2008 in x64 mode expands _mm_set_epi32 to store to stack and load
-  // from stack operations, which are slower than this code.
-  #define _mm_set_epi32(i3,i2,i1,i0) \
-    _mm_unpacklo_epi32(_mm_unpacklo_epi32(_mm_cvtsi32_si128(i0),_mm_cvtsi32_si128(i2)), \
-                       _mm_unpacklo_epi32(_mm_cvtsi32_si128(i1),_mm_cvtsi32_si128(i3)))
-#endif
-
-// Original BLAKE2 SSE4.1 message loading code was a little slower in x86 mode
-// and about the same in x64 mode in our test. Perhaps depends on compiler.
-// We also tried _mm_i32gather_epi32 and _mm256_i32gather_epi32 AVX2 gather
-// instructions here, but they did not show any speed gain on i7-6700K.
-#define SSE_ROUND(m,row,r) \
-{ \
-  __m128i buf; \
-  buf=_mm_set_epi32(m[blake2s_sigma[r][6]],m[blake2s_sigma[r][4]],m[blake2s_sigma[r][2]],m[blake2s_sigma[r][0]]); \
-  G1(row[0],row[1],row[2],row[3],buf); \
-  buf=_mm_set_epi32(m[blake2s_sigma[r][7]],m[blake2s_sigma[r][5]],m[blake2s_sigma[r][3]],m[blake2s_sigma[r][1]]); \
-  G2(row[0],row[1],row[2],row[3],buf); \
-  DIAGONALIZE(row[0],row[1],row[2],row[3]); \
-  buf=_mm_set_epi32(m[blake2s_sigma[r][14]],m[blake2s_sigma[r][12]],m[blake2s_sigma[r][10]],m[blake2s_sigma[r][8]]); \
-  G1(row[0],row[1],row[2],row[3],buf); \
-  buf=_mm_set_epi32(m[blake2s_sigma[r][15]],m[blake2s_sigma[r][13]],m[blake2s_sigma[r][11]],m[blake2s_sigma[r][9]]); \
-  G2(row[0],row[1],row[2],row[3],buf); \
-  UNDIAGONALIZE(row[0],row[1],row[2],row[3]); \
-}
-
-
-static int blake2s_compress_sse( blake2s_state *S, const byte block[BLAKE2S_BLOCKBYTES] )
-{
-  __m128i row[4];
-  __m128i ff0, ff1;
-  
-  const uint32  *m = ( uint32 * )block;
-
-  row[0] = ff0 = LOAD( &S->h[0] );
-  row[1] = ff1 = LOAD( &S->h[4] );
-
-  row[2] = blake2s_IV_0_3;
-  row[3] = _mm_xor_si128( blake2s_IV_4_7, LOAD( &S->t[0] ) );
-  SSE_ROUND( m, row, 0 );
-  SSE_ROUND( m, row, 1 );
-  SSE_ROUND( m, row, 2 );
-  SSE_ROUND( m, row, 3 );
-  SSE_ROUND( m, row, 4 );
-  SSE_ROUND( m, row, 5 );
-  SSE_ROUND( m, row, 6 );
-  SSE_ROUND( m, row, 7 );
-  SSE_ROUND( m, row, 8 );
-  SSE_ROUND( m, row, 9 );
-  STORE( &S->h[0], _mm_xor_si128( ff0, _mm_xor_si128( row[0], row[2] ) ) );
-  STORE( &S->h[4], _mm_xor_si128( ff1, _mm_xor_si128( row[1], row[3] ) ) );
-  return 0;
-}

third_party/unrar/src/blake2sp.cpp

-/*
-   BLAKE2 reference source code package - reference C implementations
-
-   Written in 2012 by Samuel Neves <sneves@dei.uc.pt>
-
-   To the extent possible under law, the author(s) have dedicated all copyright
-   and related and neighboring rights to this software to the public domain
-   worldwide. This software is distributed without any warranty.
-
-   You should have received a copy of the CC0 Public Domain Dedication along with
-   this software. If not, see <http://creativecommons.org/publicdomain/zero/1.0/>.
-*/
-
-#define PARALLELISM_DEGREE 8
-
-void blake2sp_init( blake2sp_state *S )
-{
-  memset( S->buf, 0, sizeof( S->buf ) );
-  S->buflen = 0;
-
-  blake2s_init_param( &S->R, 0, 1 ); // Init root.
-
-  for( uint i = 0; i < PARALLELISM_DEGREE; ++i )
-    blake2s_init_param( &S->S[i], i, 0 ); // Init leaf.
-
-  S->R.last_node = 1;
-  S->S[PARALLELISM_DEGREE - 1].last_node = 1;
-}
-
-
-struct Blake2ThreadData
-{
-  void Update();
-  blake2s_state *S;
-  const byte *in;
-  size_t inlen;
-};
-
-
-void Blake2ThreadData::Update()
-{
-  size_t inlen__ = inlen;
-  const byte *in__ = ( const byte * )in;
-
-  while( inlen__ >= PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES )
-  {
-#ifdef USE_SSE
-    // We gain 5% in i7 SSE mode by prefetching next data block.
-    if (_SSE_Version>=SSE_SSE && inlen__ >= 2 * PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES)
-      _mm_prefetch((char*)(in__ +  PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES), _MM_HINT_T0);
-#endif
-    blake2s_update( S, in__, BLAKE2S_BLOCKBYTES );
-    in__ += PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES;
-    inlen__ -= PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES;
-  }
-}
-
-#ifdef RAR_SMP
-THREAD_PROC(Blake2Thread)
-{
-  Blake2ThreadData *td=(Blake2ThreadData *)Data;
-  td->Update();
-}
-#endif
-
-
-void blake2sp_update( blake2sp_state *S, const byte *in, size_t inlen )
-{
-  size_t left = S->buflen;
-  size_t fill = sizeof( S->buf ) - left;
-
-  if( left && inlen >= fill )
-  {
-    memcpy( S->buf + left, in, fill );
-
-    for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
-      blake2s_update( &S->S[i], S->buf + i * BLAKE2S_BLOCKBYTES, BLAKE2S_BLOCKBYTES );
-
-    in += fill;
-    inlen -= fill;
-    left = 0;
-  }
-
-  Blake2ThreadData btd_array[PARALLELISM_DEGREE];
-
-#ifdef RAR_SMP
-  uint ThreadNumber = inlen < 0x1000 ? 1 : S->MaxThreads;
-  
-  if (ThreadNumber==6 || ThreadNumber==7) // 6 and 7 threads work slower than 4 here.
-    ThreadNumber=4;
-#else
-  uint ThreadNumber=1;
-#endif
-
-  for (size_t id__=0;id__<PARALLELISM_DEGREE;)
-  {
-    for (uint Thread=0;Thread<ThreadNumber && id__<PARALLELISM_DEGREE;Thread++)
-    {
-      Blake2ThreadData *btd=btd_array+Thread;
-
-      btd->inlen = inlen;
-      btd->in = in + id__ * BLAKE2S_BLOCKBYTES;
-      btd->S = &S->S[id__];
-  
-#ifdef RAR_SMP
-      if (ThreadNumber>1)
-        S->ThPool->AddTask(Blake2Thread,(void*)btd);
-      else
-        btd->Update();
-#else
-      btd->Update();
-#endif
-      id__++;
-    }
-#ifdef RAR_SMP
-    if (S->ThPool!=NULL) // Can be NULL in -mt1 mode.
-      S->ThPool->WaitDone();
-#endif // RAR_SMP
-  }
-
-  in += inlen - inlen % ( PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES );
-  inlen %= PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES;
-
-  if( inlen > 0 )
-    memcpy( S->buf + left, in, (size_t)inlen );
-
-  S->buflen = left + (size_t)inlen;
-}
-
-
-void blake2sp_final( blake2sp_state *S, byte *digest )
-{
-  byte hash[PARALLELISM_DEGREE][BLAKE2S_OUTBYTES];
-
-  for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
-  {
-    if( S->buflen > i * BLAKE2S_BLOCKBYTES )
-    {
-      size_t left = S->buflen - i * BLAKE2S_BLOCKBYTES;
-
-      if( left > BLAKE2S_BLOCKBYTES ) left = BLAKE2S_BLOCKBYTES;
-
-      blake2s_update( &S->S[i], S->buf + i * BLAKE2S_BLOCKBYTES, left );
-    }
-
-    blake2s_final( &S->S[i], hash[i] );
-  }
-
-  for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
-    blake2s_update( &S->R, hash[i], BLAKE2S_OUTBYTES );
-
-  blake2s_final( &S->R, digest );
-}

third_party/unrar/src/cmddata.hpp

-#ifndef _RAR_CMDDATA_
-#define _RAR_CMDDATA_
-
-
-#define DefaultStoreList L"7z;ace;arj;bz2;cab;gz;jpeg;jpg;lha;lz;lzh;mp3;rar;taz;tgz;xz;z;zip;zipx"
-
-enum RAR_CMD_LIST_MODE {RCLM_AUTO,RCLM_REJECT_LISTS,RCLM_ACCEPT_LISTS};
-
-class CommandData:public RAROptions
-{
-  private:
-    void ProcessSwitchesString(const wchar *Str);
-    void ProcessSwitch(const wchar *Switch);
-    void BadSwitch(const wchar *Switch);
-    uint GetExclAttr(const wchar *Str);
-
-    bool FileLists;
-    bool NoMoreSwitches;
-    RAR_CMD_LIST_MODE ListMode;
-    bool BareOutput;
-  public:
-    CommandData();
-    void Init();
-
-    void ParseCommandLine(bool Preprocess,int argc, char *argv[]);
-    void ParseArg(wchar *ArgW);
-    void ParseDone();
-    void ParseEnvVar();
-    void ReadConfig();
-    void PreprocessArg(const wchar *Arg);
-    void OutTitle();
-    void OutHelp(RAR_EXIT ExitCode);
-    bool IsSwitch(int Ch);
-    bool ExclCheck(const wchar *CheckName,bool Dir,bool CheckFullPath,bool CheckInclList);
-    static bool CheckArgs(StringList *Args,bool Dir,const wchar *CheckName,bool CheckFullPath,int MatchMode);
-    bool ExclDirByAttr(uint FileAttr);
-    bool TimeCheck(RarTime &ft);
-    bool SizeCheck(int64 Size);
-    bool AnyFiltersActive();
-    int IsProcessFile(FileHeader &FileHead,bool *ExactMatch=NULL,int MatchType=MATCH_WILDSUBPATH,
-                      wchar *MatchedArg=NULL,uint MatchedArgSize=0);
-    void ProcessCommand();
-    void AddArcName(const wchar *Name);
-    bool GetArcName(wchar *Name,int MaxSize);
-    bool CheckWinSize();
-
-    int GetRecoverySize(const wchar *Str,int DefSize);
-
-#ifndef SFX_MODULE
-    void ReportWrongSwitches(RARFORMAT Format);
-#endif
-
-    wchar Command[NM+16];
-
-    wchar ArcName[NM];
-
-    StringList FileArgs;
-    StringList ExclArgs;
-    StringList InclArgs;
-    StringList ArcNames;
-    StringList StoreArgs;
-};
-
-#endif

third_party/unrar/src/coder.cpp

-
-
-inline unsigned int RangeCoder::GetChar()
-{
-  return(UnpackRead->GetChar());
-}
-
-
-void RangeCoder::InitDecoder(Unpack *UnpackRead)
-{
-  RangeCoder::UnpackRead=UnpackRead;
-
-  low=code=0;
-  range=uint(-1);
-  for (int i=0;i < 4;i++)
-    code=(code << 8) | GetChar();
-}
-
-
-// (int) cast before "low" added only to suppress compiler warnings.
-#define ARI_DEC_NORMALIZE(code,low,range,read)                           \
-{                                                                        \
-  while ((low^(low+range))<TOP || range<BOT && ((range=-(int)low&(BOT-1)),1)) \
-  {                                                                      \
-    code=(code << 8) | read->GetChar();                                  \
-    range <<= 8;                                                         \
-    low <<= 8;                                                           \
-  }                                                                      \
-}
-
-
-inline int RangeCoder::GetCurrentCount() 
-{
-  return (code-low)/(range /= SubRange.scale);
-}
-
-
-inline uint RangeCoder::GetCurrentShiftCount(uint SHIFT) 
-{
-  return (code-low)/(range >>= SHIFT);
-}
-
-
-inline void RangeCoder::Decode()
-{
-  low += range*SubRange.LowCount;
-  range *= SubRange.HighCount-SubRange.LowCount;
-}

third_party/unrar/src/coder.hpp

-/****************************************************************************
- *  Contents: 'Carryless rangecoder' by Dmitry Subbotin                     *
- ****************************************************************************/
-
-
-class RangeCoder
-{
-  public:
-    void InitDecoder(Unpack *UnpackRead);
-    inline int GetCurrentCount();
-    inline uint GetCurrentShiftCount(uint SHIFT);
-    inline void Decode();
-    inline void PutChar(unsigned int c);
-    inline unsigned int GetChar();
-
-    uint low, code, range;
-    struct SUBRANGE 
-    {
-      uint LowCount, HighCount, scale;
-    } SubRange;
-
-    Unpack *UnpackRead;
-};

third_party/unrar/src/compress.hpp

-#ifndef _RAR_COMPRESS_
-#define _RAR_COMPRESS_
-
-// Combine pack and unpack constants to class to avoid polluting global
-// namespace with numerous short names.
-class PackDef
-{
-  public:
-    // Maximum LZ match length we can encode even for short distances.
-    static const uint MAX_LZ_MATCH = 0x1001;
-
-    // We increment LZ match length for longer distances, because shortest
-    // matches are not allowed for them. Maximum length increment is 3
-    // for distances larger than 256KB (0x40000). Here we define the maximum
-    // incremented LZ match. Normally packer does not use it, but we must be
-    // ready to process it in corrupt archives.
-    static const uint MAX_INC_LZ_MATCH = MAX_LZ_MATCH + 3;
-
-    static const uint MAX3_LZ_MATCH = 0x101; // Maximum match length for RAR v3.
-    static const uint LOW_DIST_REP_COUNT = 16;
-
-    static const uint NC    = 306; /* alphabet = {0, 1, 2, ..., NC - 1} */
-    static const uint DC    = 64;
-    static const uint LDC   = 16;
-    static const uint RC    = 44;
-    static const uint HUFF_TABLE_SIZE = NC + DC + RC + LDC;
-    static const uint BC    = 20;
-
-    static const uint NC30  = 299; /* alphabet = {0, 1, 2, ..., NC - 1} */
-    static const uint DC30  = 60;
-    static const uint LDC30 = 17;
-    static const uint RC30  = 28;
-    static const uint BC30  = 20;
-    static const uint HUFF_TABLE_SIZE30 = NC30 + DC30 + RC30 + LDC30;
-
-    static const uint NC20  = 298; /* alphabet = {0, 1, 2, ..., NC - 1} */
-    static const uint DC20  = 48;
-    static const uint RC20  = 28;
-    static const uint BC20  = 19;
-    static const uint MC20  = 257;
-
-    // Largest alphabet size among all values listed above.
-    static const uint LARGEST_TABLE_SIZE = 306;
-
-    enum {
-      CODE_HUFFMAN, CODE_LZ, CODE_REPEATLZ, CODE_CACHELZ, CODE_STARTFILE,
-      CODE_ENDFILE, CODE_FILTER, CODE_FILTERDATA
-    };
-};
-
-
-enum FilterType {
-  // These values must not be changed, because we use them directly
-  // in RAR5 compression and decompression code.
-  FILTER_DELTA=0, FILTER_E8, FILTER_E8E9, FILTER_ARM, 
-  FILTER_AUDIO, FILTER_RGB, FILTER_ITANIUM, FILTER_PPM, FILTER_NONE
-};
-
-#endif

third_party/unrar/src/consio.hpp

-#ifndef _RAR_CONSIO_
-#define _RAR_CONSIO_
-
-void InitConsole();
-void SetConsoleMsgStream(MESSAGE_TYPE MsgStream);
-void SetConsoleRedirectCharset(RAR_CHARSET RedirectCharset);
-void OutComment(const wchar *Comment,size_t Size);
-
-#ifndef SILENT
-bool GetConsolePassword(UIPASSWORD_TYPE Type,const wchar *FileName,SecPassword *Password);
-#endif
-
-#ifdef SILENT
-  inline void mprintf(const wchar *fmt,...) {}
-  inline void eprintf(const wchar *fmt,...) {}
-  inline void Alarm() {}
-  inline int Ask(const wchar *AskStr) {return 0;}
-  inline bool getwstr(wchar *str,size_t n) {return false;}
-#else
-  void mprintf(const wchar *fmt,...);
-  void eprintf(const wchar *fmt,...);
-  void Alarm();
-  int Ask(const wchar *AskStr);
-  bool getwstr(wchar *str,size_t n);
-#endif
-
-#endif

third_party/unrar/src/crc.cpp

-// This CRC function is based on Intel Slicing-by-8 algorithm.
-//
-// Original Intel Slicing-by-8 code is available here:
-//
-//    http://sourceforge.net/projects/slicing-by-8/
-//
-// Original Intel Slicing-by-8 code is licensed as:
-//    
-//    Copyright (c) 2004-2006 Intel Corporation - All Rights Reserved
-//    
-//    This software program is licensed subject to the BSD License, 
-//    available at http://www.opensource.org/licenses/bsd-license.html
-
-
-#include "rar.hpp"
-
-static uint crc_tables[8][256]; // Tables for Slicing-by-8.
-
-
-// Build the classic CRC32 lookup table.
-// We also provide this function to legacy RAR and ZIP decryption code.
-void InitCRC32(uint *CRCTab)
-{
-  if (CRCTab[1]!=0)
-    return;
-  for (uint I=0;I<256;I++)
-  {
-    uint C=I;
-    for (uint J=0;J<8;J++)
-      C=(C & 1) ? (C>>1)^0xEDB88320 : (C>>1);
-    CRCTab[I]=C;
-  }
-}
-
-
-static void InitTables()
-{
-  InitCRC32(crc_tables[0]);
-
-  for (uint I=0;I<256;I++) // Build additional lookup tables.
-  {
-    uint C=crc_tables[0][I];
-    for (uint J=1;J<8;J++)
-    {
-      C=crc_tables[0][(byte)C]^(C>>8);
-      crc_tables[J][I]=C;
-    }
-  }
-}
-
-
-struct CallInitCRC {CallInitCRC() {InitTables();}} static CallInit32;
-
-uint CRC32(uint StartCRC,const void *Addr,size_t Size)
-{
-  byte *Data=(byte *)Addr;
-
-  // Align Data to 8 for better performance.
-  for (;Size>0 && ((size_t)Data & 7);Size--,Data++)
-    StartCRC=crc_tables[0][(byte)(StartCRC^Data[0])]^(StartCRC>>8);
-
-  for (;Size>=8;Size-=8,Data+=8)
-  {
-#ifdef BIG_ENDIAN
-    StartCRC ^= Data[0]|(Data[1] << 8)|(Data[2] << 16)|(Data[3] << 24);
-    uint NextData = Data[4]|(Data[5] << 8)|(Data[6] << 16)|(Data[7] << 24);
-#else
-    StartCRC ^= *(uint32 *) Data;
-    uint NextData = *(uint32 *) (Data+4);
-#endif
-    StartCRC = crc_tables[7][(byte) StartCRC       ] ^
-               crc_tables[6][(byte)(StartCRC >> 8) ] ^
-               crc_tables[5][(byte)(StartCRC >> 16)] ^
-               crc_tables[4][(byte)(StartCRC >> 24)] ^
-               crc_tables[3][(byte) NextData       ] ^
-               crc_tables[2][(byte)(NextData >>8 ) ] ^
-               crc_tables[1][(byte)(NextData >> 16)] ^
-               crc_tables[0][(byte)(NextData >> 24)];
-  }
-
-  for (;Size>0;Size--,Data++) // Process left data.
-    StartCRC=crc_tables[0][(byte)(StartCRC^Data[0])]^(StartCRC>>8);
-
-  return StartCRC;
-}
-
-
-#ifndef SFX_MODULE
-// For RAR 1.4 archives in case somebody still has them.
-ushort Checksum14(ushort StartCRC,const void *Addr,size_t Size)
-{
-  byte *Data=(byte *)Addr;
-  for (size_t I=0;I<Size;I++)
-  {
-    StartCRC=(StartCRC+Data[I])&0xffff;
-    StartCRC=((StartCRC<<1)|(StartCRC>>15))&0xffff;
-  }
-  return StartCRC;
-}
-#endif
-
-

third_party/unrar/src/crc.hpp

-#ifndef _RAR_CRC_
-#define _RAR_CRC_
-
-// This function is only to intialize external CRC tables. We do not need to
-// call it before calculating CRC32.
-void InitCRC32(uint *CRCTab);
-
-uint CRC32(uint StartCRC,const void *Addr,size_t Size);
-
-#ifndef SFX_MODULE
-ushort Checksum14(ushort StartCRC,const void *Addr,size_t Size);
-#endif
-
-
-#endif

third_party/unrar/src/dll.def

-EXPORTS
-  RAROpenArchive
-  RAROpenArchiveEx
-  RARCloseArchive
-  RARReadHeader
-  RARReadHeaderEx
-  RARProcessFile
-  RARSetCallback
-  RARSetChangeVolProc
-  RARSetProcessDataProc
-  RARSetPassword
-  RARGetDllVersion

third_party/unrar/src/rarpch.cpp

-// We use rarpch.cpp to create precompiled headers for MS Visual C++.
-#include "rar.hpp"