+++ /dev/null
-/** @file\r
- UEFI Decompress Library.\r
-\r
- Copyright (c) 2006, Intel Corporation\r
- All rights reserved. This program and the accompanying materials\r
- are licensed and made available under the terms and conditions of the BSD License\r
- which accompanies this distribution. The full text of the license may be found at\r
- http://opensource.org/licenses/bsd-license.php\r
-\r
- THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,\r
- WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.\r
-\r
- Module Name: UefiDecompressLib.c\r
-\r
-**/\r
-\r
-#include "BaseUefiDecompressLibInternals.h"\r
-\r
-/**\r
- Read NumOfBit of bits from source into mBitBuf\r
-\r
- Shift mBitBuf NumOfBits left. Read in NumOfBits of bits from source.\r
-\r
- @param Sd The global scratch data\r
- @param NumOfBits The number of bits to shift and read.\r
-\r
-**/\r
-VOID\r
-FillBuf (\r
- IN SCRATCH_DATA *Sd,\r
- IN UINT16 NumOfBits\r
- )\r
-{\r
- //\r
- // Left shift NumOfBits of bits in advance\r
- //\r
- Sd->mBitBuf = (UINT32) (Sd->mBitBuf << NumOfBits);\r
-\r
- //\r
- // Copy data needed in bytes into mSbuBitBuf\r
- //\r
- while (NumOfBits > Sd->mBitCount) {\r
-\r
- Sd->mBitBuf |= (UINT32) (Sd->mSubBitBuf << (NumOfBits = (UINT16) (NumOfBits - Sd->mBitCount)));\r
-\r
- if (Sd->mCompSize > 0) {\r
- //\r
- // Get 1 byte into SubBitBuf\r
- //\r
- Sd->mCompSize--;\r
- Sd->mSubBitBuf = Sd->mSrcBase[Sd->mInBuf++];\r
- Sd->mBitCount = 8;\r
-\r
- } else {\r
- //\r
- // No more bits from the source, just pad zero bit.\r
- //\r
- Sd->mSubBitBuf = 0;\r
- Sd->mBitCount = 8;\r
-\r
- }\r
- }\r
-\r
- //\r
- // Caculate additional bit count read to update mBitCount\r
- //\r
- Sd->mBitCount = (UINT16) (Sd->mBitCount - NumOfBits);\r
- \r
- //\r
- // Copy NumOfBits of bits from mSubBitBuf into mBitBuf\r
- //\r
- Sd->mBitBuf |= Sd->mSubBitBuf >> Sd->mBitCount;\r
-}\r
-\r
-/**\r
- Get NumOfBits of bits out from mBitBuf\r
-\r
- Get NumOfBits of bits out from mBitBuf. Fill mBitBuf with subsequent \r
- NumOfBits of bits from source. Returns NumOfBits of bits that are \r
- popped out.\r
-\r
- @param Sd The global scratch data.\r
- @param NumOfBits The number of bits to pop and read.\r
-\r
- @return The bits that are popped out.\r
-\r
-**/\r
-UINT32\r
-GetBits (\r
- IN SCRATCH_DATA *Sd,\r
- IN UINT16 NumOfBits\r
- )\r
-{\r
- UINT32 OutBits;\r
-\r
- //\r
- // Pop NumOfBits of Bits from Left\r
- // \r
- OutBits = (UINT32) (Sd->mBitBuf >> (BITBUFSIZ - NumOfBits));\r
-\r
- //\r
- // Fill up mBitBuf from source\r
- //\r
- FillBuf (Sd, NumOfBits);\r
-\r
- return OutBits;\r
-}\r
-\r
-/**\r
- Creates Huffman Code mapping table according to code length array.\r
-\r
- Creates Huffman Code mapping table for Extra Set, Char&Len Set \r
- and Position Set according to code length array.\r
-\r
- @param Sd The global scratch data\r
- @param NumOfChar Number of symbols in the symbol set\r
- @param BitLen Code length array\r
- @param TableBits The width of the mapping table\r
- @param Table The table\r
-\r
- @retval 0 OK.\r
- @retval BAD_TABLE The table is corrupted.\r
-\r
-**/\r
-UINT16\r
-MakeTable (\r
- IN SCRATCH_DATA *Sd,\r
- IN UINT16 NumOfChar,\r
- IN UINT8 *BitLen,\r
- IN UINT16 TableBits,\r
- OUT UINT16 *Table\r
- )\r
-{\r
- UINT16 Count[17];\r
- UINT16 Weight[17];\r
- UINT16 Start[18];\r
- UINT16 *Pointer;\r
- UINT16 Index3;\r
- volatile UINT16 Index;\r
- UINT16 Len;\r
- UINT16 Char;\r
- UINT16 JuBits;\r
- UINT16 Avail;\r
- UINT16 NextCode;\r
- UINT16 Mask;\r
- UINT16 WordOfStart;\r
- UINT16 WordOfCount;\r
-\r
-\r
- for (Index = 1; Index <= 16; Index++) {\r
- Count[Index] = 0;\r
- }\r
-\r
- for (Index = 0; Index < NumOfChar; Index++) {\r
- Count[BitLen[Index]]++;\r
- }\r
-\r
- Start[1] = 0;\r
-\r
- for (Index = 1; Index <= 16; Index++) {\r
- WordOfStart = Start[Index];\r
- WordOfCount = Count[Index];\r
- Start[Index + 1] = (UINT16) (WordOfStart + (WordOfCount << (16 - Index)));\r
- }\r
-\r
- if (Start[17] != 0) {\r
- /*(1U << 16)*/\r
- return (UINT16) BAD_TABLE;\r
- }\r
-\r
- JuBits = (UINT16) (16 - TableBits);\r
-\r
- for (Index = 1; Index <= TableBits; Index++) {\r
- Start[Index] >>= JuBits;\r
- Weight[Index] = (UINT16) (1U << (TableBits - Index));\r
- }\r
-\r
- while (Index <= 16) {\r
- Weight[Index] = (UINT16) (1U << (16 - Index));\r
- Index++; \r
- }\r
-\r
- Index = (UINT16) (Start[TableBits + 1] >> JuBits);\r
-\r
- if (Index != 0) {\r
- Index3 = (UINT16) (1U << TableBits);\r
- while (Index != Index3) {\r
- Table[Index++] = 0;\r
- }\r
- }\r
-\r
- Avail = NumOfChar;\r
- Mask = (UINT16) (1U << (15 - TableBits));\r
-\r
- for (Char = 0; Char < NumOfChar; Char++) {\r
-\r
- Len = BitLen[Char];\r
- if (Len == 0) {\r
- continue;\r
- }\r
-\r
- NextCode = (UINT16) (Start[Len] + Weight[Len]);\r
-\r
- if (Len <= TableBits) {\r
-\r
- for (Index = Start[Len]; Index < NextCode; Index++) {\r
- Table[Index] = Char;\r
- }\r
-\r
- } else {\r
-\r
- Index3 = Start[Len];\r
- Pointer = &Table[Index3 >> JuBits];\r
- Index = (UINT16) (Len - TableBits);\r
-\r
- while (Index != 0) {\r
- if (*Pointer == 0) {\r
- Sd->mRight[Avail] = Sd->mLeft[Avail] = 0;\r
- *Pointer = Avail++;\r
- }\r
-\r
- if (Index3 & Mask) {\r
- Pointer = &Sd->mRight[*Pointer];\r
- } else {\r
- Pointer = &Sd->mLeft[*Pointer];\r
- }\r
-\r
- Index3 <<= 1;\r
- Index--;\r
- }\r
-\r
- *Pointer = Char;\r
-\r
- }\r
-\r
- Start[Len] = NextCode;\r
- }\r
- //\r
- // Succeeds\r
- //\r
- return 0;\r
-}\r
-\r
-/**\r
- Decodes a position value.\r
-\r
- Get a position value according to Position Huffman Table.\r
- \r
- @param Sd the global scratch data\r
-\r
- @return The position value decoded.\r
-\r
-**/\r
-UINT32\r
-DecodeP (\r
- IN SCRATCH_DATA *Sd\r
- )\r
-{\r
- UINT16 Val;\r
- UINT32 Mask;\r
- UINT32 Pos;\r
-\r
- Val = Sd->mPTTable[Sd->mBitBuf >> (BITBUFSIZ - 8)];\r
-\r
- if (Val >= MAXNP) {\r
- Mask = 1U << (BITBUFSIZ - 1 - 8);\r
-\r
- do {\r
-\r
- if (Sd->mBitBuf & Mask) {\r
- Val = Sd->mRight[Val];\r
- } else {\r
- Val = Sd->mLeft[Val];\r
- }\r
-\r
- Mask >>= 1;\r
- } while (Val >= MAXNP);\r
- }\r
- //\r
- // Advance what we have read\r
- //\r
- FillBuf (Sd, Sd->mPTLen[Val]);\r
-\r
- Pos = Val;\r
- if (Val > 1) {\r
- Pos = (UINT32) ((1U << (Val - 1)) + GetBits (Sd, (UINT16) (Val - 1)));\r
- }\r
-\r
- return Pos;\r
-}\r
-\r
-/**\r
- Reads code lengths for the Extra Set or the Position Set.\r
-\r
- Read in the Extra Set or Pointion Set Length Arrary, then\r
- generate the Huffman code mapping for them.\r
-\r
- @param Sd The global scratch data.\r
- @param nn Number of symbols.\r
- @param nbit Number of bits needed to represent nn.\r
- @param Special The special symbol that needs to be taken care of.\r
-\r
- @retval 0 OK.\r
- @retval BAD_TABLE Table is corrupted.\r
-\r
-**/\r
-UINT16\r
-ReadPTLen (\r
- IN SCRATCH_DATA *Sd,\r
- IN UINT16 nn,\r
- IN UINT16 nbit,\r
- IN UINT16 Special\r
- )\r
-{\r
- UINT16 Number;\r
- UINT16 CharC;\r
- volatile UINT16 Index;\r
- UINT32 Mask;\r
-\r
- //\r
- // Read Extra Set Code Length Array size \r
- //\r
- Number = (UINT16) GetBits (Sd, nbit);\r
-\r
- if (Number == 0) {\r
- //\r
- // This represents only Huffman code used\r
- //\r
- CharC = (UINT16) GetBits (Sd, nbit);\r
-\r
- for (Index = 0; Index < 256; Index++) {\r
- Sd->mPTTable[Index] = CharC;\r
- }\r
-\r
- for (Index = 0; Index < nn; Index++) {\r
- Sd->mPTLen[Index] = 0;\r
- }\r
-\r
- return 0;\r
- }\r
-\r
- Index = 0;\r
-\r
- while (Index < Number) {\r
-\r
- CharC = (UINT16) (Sd->mBitBuf >> (BITBUFSIZ - 3));\r
-\r
- //\r
- // If a code length is less than 7, then it is encoded as a 3-bit\r
- // value. Or it is encoded as a series of "1"s followed by a \r
- // terminating "0". The number of "1"s = Code length - 4.\r
- //\r
- if (CharC == 7) {\r
- Mask = 1U << (BITBUFSIZ - 1 - 3);\r
- while (Mask & Sd->mBitBuf) {\r
- Mask >>= 1;\r
- CharC += 1;\r
- }\r
- }\r
- \r
- FillBuf (Sd, (UINT16) ((CharC < 7) ? 3 : CharC - 3));\r
-\r
- Sd->mPTLen[Index++] = (UINT8) CharC;\r
- \r
- //\r
- // For Code&Len Set, \r
- // After the third length of the code length concatenation,\r
- // a 2-bit value is used to indicated the number of consecutive \r
- // zero lengths after the third length.\r
- //\r
- if (Index == Special) {\r
- CharC = (UINT16) GetBits (Sd, 2);\r
- while ((INT16) (--CharC) >= 0) {\r
- Sd->mPTLen[Index++] = 0;\r
- }\r
- }\r
- }\r
-\r
- while (Index < nn) {\r
- Sd->mPTLen[Index++] = 0;\r
- }\r
- \r
- return MakeTable (Sd, nn, Sd->mPTLen, 8, Sd->mPTTable);\r
-}\r
-\r
-/**\r
- Reads code lengths for Char&Len Set.\r
- \r
- Read in and decode the Char&Len Set Code Length Array, then\r
- generate the Huffman Code mapping table for the Char&Len Set.\r
-\r
- @param Sd the global scratch data\r
-\r
-**/\r
-VOID\r
-ReadCLen (\r
- SCRATCH_DATA *Sd\r
- )\r
-{\r
- UINT16 Number;\r
- UINT16 CharC;\r
- volatile UINT16 Index;\r
- UINT32 Mask;\r
-\r
- Number = (UINT16) GetBits (Sd, CBIT);\r
-\r
- if (Number == 0) {\r
- //\r
- // This represents only Huffman code used\r
- //\r
- CharC = (UINT16) GetBits (Sd, CBIT);\r
-\r
- for (Index = 0; Index < NC; Index++) {\r
- Sd->mCLen[Index] = 0;\r
- }\r
-\r
- for (Index = 0; Index < 4096; Index++) {\r
- Sd->mCTable[Index] = CharC;\r
- }\r
-\r
- return ;\r
- }\r
-\r
- Index = 0;\r
- while (Index < Number) {\r
- CharC = Sd->mPTTable[Sd->mBitBuf >> (BITBUFSIZ - 8)];\r
- if (CharC >= NT) {\r
- Mask = 1U << (BITBUFSIZ - 1 - 8);\r
-\r
- do {\r
-\r
- if (Mask & Sd->mBitBuf) {\r
- CharC = Sd->mRight[CharC];\r
- } else {\r
- CharC = Sd->mLeft[CharC];\r
- }\r
-\r
- Mask >>= 1;\r
-\r
- } while (CharC >= NT);\r
- }\r
- //\r
- // Advance what we have read\r
- //\r
- FillBuf (Sd, Sd->mPTLen[CharC]);\r
-\r
- if (CharC <= 2) {\r
-\r
- if (CharC == 0) {\r
- CharC = 1;\r
- } else if (CharC == 1) {\r
- CharC = (UINT16) (GetBits (Sd, 4) + 3);\r
- } else if (CharC == 2) {\r
- CharC = (UINT16) (GetBits (Sd, CBIT) + 20);\r
- }\r
-\r
- while ((INT16) (--CharC) >= 0) {\r
- Sd->mCLen[Index++] = 0;\r
- }\r
-\r
- } else {\r
-\r
- Sd->mCLen[Index++] = (UINT8) (CharC - 2);\r
-\r
- }\r
- }\r
-\r
- while (Index < NC) {\r
- Sd->mCLen[Index++] = 0;\r
- }\r
-\r
- MakeTable (Sd, NC, Sd->mCLen, 12, Sd->mCTable);\r
-\r
- return ;\r
-}\r
-\r
-/**\r
- Decode a character/length value.\r
- \r
- Read one value from mBitBuf, Get one code from mBitBuf. If it is at block boundary, generates\r
- Huffman code mapping table for Extra Set, Code&Len Set and\r
- Position Set.\r
-\r
- @param Sd The global scratch data.\r
-\r
- @return The value decoded.\r
-\r
-**/\r
-UINT16\r
-DecodeC (\r
- SCRATCH_DATA *Sd\r
- )\r
-{\r
- UINT16 Index2;\r
- UINT32 Mask;\r
-\r
- if (Sd->mBlockSize == 0) {\r
- //\r
- // Starting a new block\r
- // Read BlockSize from block header\r
- // \r
- Sd->mBlockSize = (UINT16) GetBits (Sd, 16);\r
-\r
- //\r
- // Read in the Extra Set Code Length Arrary,\r
- // Generate the Huffman code mapping table for Extra Set.\r
- //\r
- Sd->mBadTableFlag = ReadPTLen (Sd, NT, TBIT, 3);\r
- if (Sd->mBadTableFlag != 0) {\r
- return 0;\r
- }\r
-\r
- //\r
- // Read in and decode the Char&Len Set Code Length Arrary,\r
- // Generate the Huffman code mapping table for Char&Len Set.\r
- //\r
- ReadCLen (Sd);\r
-\r
- //\r
- // Read in the Position Set Code Length Arrary, \r
- // Generate the Huffman code mapping table for the Position Set.\r
- //\r
- Sd->mBadTableFlag = ReadPTLen (Sd, MAXNP, Sd->mPBit, (UINT16) (-1));\r
- if (Sd->mBadTableFlag != 0) {\r
- return 0;\r
- }\r
- }\r
-\r
- //\r
- // Get one code according to Code&Set Huffman Table\r
- //\r
- Sd->mBlockSize--;\r
- Index2 = Sd->mCTable[Sd->mBitBuf >> (BITBUFSIZ - 12)];\r
-\r
- if (Index2 >= NC) {\r
- Mask = 1U << (BITBUFSIZ - 1 - 12);\r
-\r
- do {\r
- if (Sd->mBitBuf & Mask) {\r
- Index2 = Sd->mRight[Index2];\r
- } else {\r
- Index2 = Sd->mLeft[Index2];\r
- }\r
-\r
- Mask >>= 1;\r
- } while (Index2 >= NC);\r
- }\r
- //\r
- // Advance what we have read\r
- //\r
- FillBuf (Sd, Sd->mCLen[Index2]);\r
-\r
- return Index2;\r
-}\r
-\r
-/**\r
- Decode the source data and put the resulting data into the destination buffer.\r
-\r
- Decode the source data and put the resulting data into the destination buffer.\r
- \r
- @param Sd The global scratch data\r
-\r
-**/\r
-VOID\r
-Decode (\r
- SCRATCH_DATA *Sd\r
- )\r
-{\r
- UINT16 BytesRemain;\r
- UINT32 DataIdx;\r
- UINT16 CharC;\r
-\r
- BytesRemain = (UINT16) (-1);\r
-\r
- DataIdx = 0;\r
-\r
- for (;;) {\r
- //\r
- // Get one code from mBitBuf\r
- // \r
- CharC = DecodeC (Sd);\r
- if (Sd->mBadTableFlag != 0) {\r
- goto Done;\r
- }\r
-\r
- if (CharC < 256) {\r
- //\r
- // Process an Original character\r
- //\r
- if (Sd->mOutBuf >= Sd->mOrigSize) {\r
- goto Done;\r
- } else {\r
- //\r
- // Write orignal character into mDstBase\r
- //\r
- Sd->mDstBase[Sd->mOutBuf++] = (UINT8) CharC;\r
- }\r
-\r
- } else {\r
- //\r
- // Process a Pointer\r
- //\r
- CharC = (UINT16) (CharC - (UINT8_MAX + 1 - THRESHOLD));\r
- \r
- //\r
- // Get string length\r
- //\r
- BytesRemain = CharC;\r
-\r
- //\r
- // Locate string position\r
- //\r
- DataIdx = Sd->mOutBuf - DecodeP (Sd) - 1;\r
-\r
- //\r
- // Write BytesRemain of bytes into mDstBase\r
- //\r
- BytesRemain--;\r
- while ((INT16) (BytesRemain) >= 0) {\r
- Sd->mDstBase[Sd->mOutBuf++] = Sd->mDstBase[DataIdx++];\r
- if (Sd->mOutBuf >= Sd->mOrigSize) {\r
- goto Done;\r
- }\r
-\r
- BytesRemain--;\r
- }\r
- }\r
- }\r
-\r
-Done:\r
- return ;\r
-}\r
-\r
-/**\r
- Retrieves the size of the uncompressed buffer and the size of the scratch buffer.\r
-\r
- Retrieves the size of the uncompressed buffer and the temporary scratch buffer \r
- required to decompress the buffer specified by Source and SourceSize.\r
- If the size of the uncompressed buffer or the size of the scratch buffer cannot\r
- be determined from the compressed data specified by Source and SourceData, \r
- then RETURN_INVALID_PARAMETER is returned. Otherwise, the size of the uncompressed\r
- buffer is returned in DestinationSize, the size of the scratch buffer is returned\r
- in ScratchSize, and RETURN_SUCCESS is returned.\r
- This function does not have scratch buffer available to perform a thorough \r
- checking of the validity of the source data. It just retrieves the "Original Size"\r
- field from the beginning bytes of the source data and output it as DestinationSize.\r
- And ScratchSize is specific to the decompression implementation.\r
-\r
- If Source is NULL, then ASSERT().\r
- If DestinationSize is NULL, then ASSERT().\r
- If ScratchSize is NULL, then ASSERT().\r
-\r
- @param Source The source buffer containing the compressed data.\r
- @param SourceSize The size, in bytes, of the source buffer.\r
- @param DestinationSize A pointer to the size, in bytes, of the uncompressed buffer\r
- that will be generated when the compressed buffer specified\r
- by Source and SourceSize is decompressed..\r
- @param ScratchSize A pointer to the size, in bytes, of the scratch buffer that\r
- is required to decompress the compressed buffer specified \r
- by Source and SourceSize.\r
-\r
- @retval RETURN_SUCCESS The size of destination buffer and the size of scratch \r
- buffer are successull retrieved.\r
- @retval RETURN_INVALID_PARAMETER The source data is corrupted\r
-\r
-**/\r
-RETURN_STATUS\r
-EFIAPI\r
-UefiDecompressGetInfo (\r
- IN CONST VOID *Source,\r
- IN UINT32 SourceSize,\r
- OUT UINT32 *DestinationSize,\r
- OUT UINT32 *ScratchSize\r
- )\r
-{\r
- UINT32 CompressedSize;\r
-\r
- ASSERT (Source != NULL);\r
- ASSERT (DestinationSize != NULL);\r
- ASSERT (ScratchSize != NULL);\r
-\r
- *ScratchSize = sizeof (SCRATCH_DATA);\r
-\r
- if (SourceSize < 8) {\r
- return RETURN_INVALID_PARAMETER;\r
- }\r
-\r
- CopyMem (&CompressedSize, Source, sizeof (UINT32));\r
- CopyMem (DestinationSize, (VOID *)((UINT8 *)Source + 4), sizeof (UINT32));\r
-\r
- if (SourceSize < (CompressedSize + 8)) {\r
- return RETURN_INVALID_PARAMETER;\r
- }\r
-\r
- return RETURN_SUCCESS;\r
-}\r
-\r
-/**\r
- Decompresses a compressed source buffer.\r
-\r
- This function is designed so that the decompression algorithm can be implemented\r
- without using any memory services. As a result, this function is not allowed to\r
- call any memory allocation services in its implementation. It is the caller's r\r
- esponsibility to allocate and free the Destination and Scratch buffers.\r
- If the compressed source data specified by Source is sucessfully decompressed \r
- into Destination, then RETURN_SUCCESS is returned. If the compressed source data \r
- specified by Source is not in a valid compressed data format,\r
- then RETURN_INVALID_PARAMETER is returned.\r
-\r
- If Source is NULL, then ASSERT().\r
- If Destination is NULL, then ASSERT().\r
- If the required scratch buffer size > 0 and Scratch is NULL, then ASSERT().\r
-\r
- @param Source The source buffer containing the compressed data.\r
- @param Destination The destination buffer to store the decompressed data\r
- @param Scratch A temporary scratch buffer that is used to perform the decompression.\r
- This is an optional parameter that may be NULL if the \r
- required scratch buffer size is 0.\r
- \r
- @retval RETURN_SUCCESS Decompression is successfull\r
- @retval RETURN_INVALID_PARAMETER The source data is corrupted\r
-\r
-**/\r
-RETURN_STATUS\r
-EFIAPI\r
-UefiDecompress (\r
- IN CONST VOID *Source,\r
- IN OUT VOID *Destination,\r
- IN OUT VOID *Scratch\r
- )\r
-{\r
- volatile UINT32 Index;\r
- UINT32 CompSize;\r
- UINT32 OrigSize;\r
- SCRATCH_DATA *Sd;\r
- CONST UINT8 *Src;\r
- UINT8 *Dst;\r
-\r
- ASSERT (Source != NULL);\r
- ASSERT (Destination != NULL);\r
- ASSERT (Scratch != NULL);\r
-\r
- Src = Source;\r
- Dst = Destination;\r
-\r
- Sd = (SCRATCH_DATA *) Scratch;\r
-\r
- CompSize = Src[0] + (Src[1] << 8) + (Src[2] << 16) + (Src[3] << 24);\r
- OrigSize = Src[4] + (Src[5] << 8) + (Src[6] << 16) + (Src[7] << 24);\r
-\r
- //\r
- // If compressed file size is 0, return\r
- //\r
- if (OrigSize == 0) {\r
- return RETURN_SUCCESS;\r
- }\r
-\r
- Src = Src + 8;\r
-\r
- for (Index = 0; Index < sizeof (SCRATCH_DATA); Index++) {\r
- ((UINT8 *) Sd)[Index] = 0;\r
- }\r
- //\r
- // The length of the field 'Position Set Code Length Array Size' in Block Header.\r
- // For EFI 1.1 de/compression algorithm(Version 1), mPBit = 4\r
- // For Tiano de/compression algorithm(Version 2), mPBit = 5\r
- //\r
- Sd->mPBit = 4;\r
- Sd->mSrcBase = (UINT8 *)Src;\r
- Sd->mDstBase = Dst;\r
- //\r
- // CompSize and OrigSize are caculated in bytes\r
- //\r
- Sd->mCompSize = CompSize;\r
- Sd->mOrigSize = OrigSize;\r
-\r
- //\r
- // Fill the first BITBUFSIZ bits\r
- //\r
- FillBuf (Sd, BITBUFSIZ);\r
-\r
- //\r
- // Decompress it\r
- //\r
- Decode (Sd);\r
-\r
- if (Sd->mBadTableFlag != 0) {\r
- //\r
- // Something wrong with the source\r
- //\r
- return RETURN_INVALID_PARAMETER;\r
- }\r
-\r
- return RETURN_SUCCESS;\r
-}\r