//\r
// Macro Definitions\r
//\r
-typedef INT16 NODE;\r
-#define UINT8_MAX 0xff\r
-#define UINT8_BIT 8\r
-#define THRESHOLD 3\r
-#define INIT_CRC 0\r
-#define WNDBIT 13\r
-#define WNDSIZ (1U << WNDBIT)\r
-#define MAXMATCH 256\r
-#define BLKSIZ (1U << 14) // 16 * 1024U\r
-#define PERC_FLAG 0x8000U\r
-#define CODE_BIT 16\r
-#define NIL 0\r
-#define MAX_HASH_VAL (3 * WNDSIZ + (WNDSIZ / 512 + 1) * UINT8_MAX)\r
-#define HASH(LoopVar7, LoopVar5) ((LoopVar7) + ((LoopVar5) << (WNDBIT - 9)) + WNDSIZ * 2)\r
-#define CRCPOLY 0xA001\r
-#define UPDATE_CRC(LoopVar5) mCrc = mCrcTable[(mCrc ^ (LoopVar5)) & 0xFF] ^ (mCrc >> UINT8_BIT)\r
+typedef INT16 NODE;\r
+#define UINT8_MAX 0xff\r
+#define UINT8_BIT 8\r
+#define THRESHOLD 3\r
+#define INIT_CRC 0\r
+#define WNDBIT 13\r
+#define WNDSIZ (1U << WNDBIT)\r
+#define MAXMATCH 256\r
+#define BLKSIZ (1U << 14) // 16 * 1024U\r
+#define PERC_FLAG 0x8000U\r
+#define CODE_BIT 16\r
+#define NIL 0\r
+#define MAX_HASH_VAL (3 * WNDSIZ + (WNDSIZ / 512 + 1) * UINT8_MAX)\r
+#define HASH(LoopVar7, LoopVar5) ((LoopVar7) + ((LoopVar5) << (WNDBIT - 9)) + WNDSIZ * 2)\r
+#define CRCPOLY 0xA001\r
+#define UPDATE_CRC(LoopVar5) mCrc = mCrcTable[(mCrc ^ (LoopVar5)) & 0xFF] ^ (mCrc >> UINT8_BIT)\r
\r
//\r
// C: the Char&Len Set; P: the Position Set; T: the exTra Set\r
//\r
-#define NC (UINT8_MAX + MAXMATCH + 2 - THRESHOLD)\r
-#define CBIT 9\r
-#define NP (WNDBIT + 1)\r
-#define PBIT 4\r
-#define NT (CODE_BIT + 3)\r
-#define TBIT 5\r
+#define NC (UINT8_MAX + MAXMATCH + 2 - THRESHOLD)\r
+#define CBIT 9\r
+#define NP (WNDBIT + 1)\r
+#define PBIT 4\r
+#define NT (CODE_BIT + 3)\r
+#define TBIT 5\r
#if NT > NP\r
- #define NPT NT\r
+#define NPT NT\r
#else\r
- #define NPT NP\r
+#define NPT NP\r
#endif\r
//\r
// Function Prototypes\r
@param[in] Data The dword to put.\r
**/\r
VOID\r
-PutDword(\r
- IN UINT32 Data\r
+PutDword (\r
+ IN UINT32 Data\r
);\r
\r
//\r
STATIC UINT8 *mSrcUpperLimit;\r
STATIC UINT8 *mDstUpperLimit;\r
\r
-STATIC UINT8 *mLevel;\r
-STATIC UINT8 *mText;\r
-STATIC UINT8 *mChildCount;\r
-STATIC UINT8 *mBuf;\r
-STATIC UINT8 mCLen[NC];\r
-STATIC UINT8 mPTLen[NPT];\r
-STATIC UINT8 *mLen;\r
-STATIC INT16 mHeap[NC + 1];\r
-STATIC INT32 mRemainder;\r
-STATIC INT32 mMatchLen;\r
-STATIC INT32 mBitCount;\r
-STATIC INT32 mHeapSize;\r
-STATIC INT32 mTempInt32;\r
-STATIC UINT32 mBufSiz = 0;\r
-STATIC UINT32 mOutputPos;\r
-STATIC UINT32 mOutputMask;\r
-STATIC UINT32 mSubBitBuf;\r
-STATIC UINT32 mCrc;\r
-STATIC UINT32 mCompSize;\r
-STATIC UINT32 mOrigSize;\r
-\r
-STATIC UINT16 *mFreq;\r
-STATIC UINT16 *mSortPtr;\r
-STATIC UINT16 mLenCnt[17];\r
-STATIC UINT16 mLeft[2 * NC - 1];\r
-STATIC UINT16 mRight[2 * NC - 1];\r
-STATIC UINT16 mCrcTable[UINT8_MAX + 1];\r
-STATIC UINT16 mCFreq[2 * NC - 1];\r
-STATIC UINT16 mCCode[NC];\r
-STATIC UINT16 mPFreq[2 * NP - 1];\r
-STATIC UINT16 mPTCode[NPT];\r
-STATIC UINT16 mTFreq[2 * NT - 1];\r
-\r
-STATIC NODE mPos;\r
-STATIC NODE mMatchPos;\r
-STATIC NODE mAvail;\r
-STATIC NODE *mPosition;\r
-STATIC NODE *mParent;\r
-STATIC NODE *mPrev;\r
-STATIC NODE *mNext = NULL;\r
-INT32 mHuffmanDepth = 0;\r
+STATIC UINT8 *mLevel;\r
+STATIC UINT8 *mText;\r
+STATIC UINT8 *mChildCount;\r
+STATIC UINT8 *mBuf;\r
+STATIC UINT8 mCLen[NC];\r
+STATIC UINT8 mPTLen[NPT];\r
+STATIC UINT8 *mLen;\r
+STATIC INT16 mHeap[NC + 1];\r
+STATIC INT32 mRemainder;\r
+STATIC INT32 mMatchLen;\r
+STATIC INT32 mBitCount;\r
+STATIC INT32 mHeapSize;\r
+STATIC INT32 mTempInt32;\r
+STATIC UINT32 mBufSiz = 0;\r
+STATIC UINT32 mOutputPos;\r
+STATIC UINT32 mOutputMask;\r
+STATIC UINT32 mSubBitBuf;\r
+STATIC UINT32 mCrc;\r
+STATIC UINT32 mCompSize;\r
+STATIC UINT32 mOrigSize;\r
+\r
+STATIC UINT16 *mFreq;\r
+STATIC UINT16 *mSortPtr;\r
+STATIC UINT16 mLenCnt[17];\r
+STATIC UINT16 mLeft[2 * NC - 1];\r
+STATIC UINT16 mRight[2 * NC - 1];\r
+STATIC UINT16 mCrcTable[UINT8_MAX + 1];\r
+STATIC UINT16 mCFreq[2 * NC - 1];\r
+STATIC UINT16 mCCode[NC];\r
+STATIC UINT16 mPFreq[2 * NP - 1];\r
+STATIC UINT16 mPTCode[NPT];\r
+STATIC UINT16 mTFreq[2 * NT - 1];\r
+\r
+STATIC NODE mPos;\r
+STATIC NODE mMatchPos;\r
+STATIC NODE mAvail;\r
+STATIC NODE *mPosition;\r
+STATIC NODE *mParent;\r
+STATIC NODE *mPrev;\r
+STATIC NODE *mNext = NULL;\r
+INT32 mHuffmanDepth = 0;\r
\r
/**\r
Make a CRC table.\r
}\r
}\r
\r
- mCrcTable[LoopVar1] = (UINT16) LoopVar4;\r
+ mCrcTable[LoopVar1] = (UINT16)LoopVar4;\r
}\r
}\r
\r
**/\r
VOID\r
PutDword (\r
- IN UINT32 Data\r
+ IN UINT32 Data\r
)\r
{\r
if (mDst < mDstUpperLimit) {\r
- *mDst++ = (UINT8) (((UINT8) (Data)) & 0xff);\r
+ *mDst++ = (UINT8)(((UINT8)(Data)) & 0xff);\r
}\r
\r
if (mDst < mDstUpperLimit) {\r
- *mDst++ = (UINT8) (((UINT8) (Data >> 0x08)) & 0xff);\r
+ *mDst++ = (UINT8)(((UINT8)(Data >> 0x08)) & 0xff);\r
}\r
\r
if (mDst < mDstUpperLimit) {\r
- *mDst++ = (UINT8) (((UINT8) (Data >> 0x10)) & 0xff);\r
+ *mDst++ = (UINT8)(((UINT8)(Data >> 0x10)) & 0xff);\r
}\r
\r
if (mDst < mDstUpperLimit) {\r
- *mDst++ = (UINT8) (((UINT8) (Data >> 0x18)) & 0xff);\r
+ *mDst++ = (UINT8)(((UINT8)(Data >> 0x18)) & 0xff);\r
}\r
}\r
\r
mPrev = AllocateZeroPool (WNDSIZ * 2 * sizeof (*mPrev));\r
mNext = AllocateZeroPool ((MAX_HASH_VAL + 1) * sizeof (*mNext));\r
\r
- mBufSiz = BLKSIZ;\r
- mBuf = AllocateZeroPool (mBufSiz);\r
+ mBufSiz = BLKSIZ;\r
+ mBuf = AllocateZeroPool (mBufSiz);\r
while (mBuf == NULL) {\r
mBufSiz = (mBufSiz / 10U) * 9U;\r
if (mBufSiz < 4 * 1024U) {\r
\r
mAvail = 1;\r
for (LoopVar1 = 1; LoopVar1 < WNDSIZ - 1; LoopVar1++) {\r
- mNext[LoopVar1] = (NODE) (LoopVar1 + 1);\r
+ mNext[LoopVar1] = (NODE)(LoopVar1 + 1);\r
}\r
\r
mNext[WNDSIZ - 1] = NIL;\r
{\r
NODE LoopVar4;\r
\r
- LoopVar4 = mNext[HASH (LoopVar6, LoopVar5)];\r
- mParent[NIL] = LoopVar6; /* sentinel */\r
+ LoopVar4 = mNext[HASH (LoopVar6, LoopVar5)];\r
+ mParent[NIL] = LoopVar6; /* sentinel */\r
while (mParent[LoopVar4] != LoopVar6) {\r
LoopVar4 = mNext[LoopVar4];\r
}\r
\r
NODE LoopVar10;\r
\r
- LoopVar12 = (NODE) HASH (LoopVar6, LoopVar5);\r
- LoopVar10 = mNext[LoopVar12];\r
- mNext[LoopVar12] = LoopVar4;\r
- mNext[LoopVar4] = LoopVar10;\r
- mPrev[LoopVar10] = LoopVar4;\r
- mPrev[LoopVar4] = LoopVar12;\r
- mParent[LoopVar4] = LoopVar6;\r
+ LoopVar12 = (NODE)HASH (LoopVar6, LoopVar5);\r
+ LoopVar10 = mNext[LoopVar12];\r
+ mNext[LoopVar12] = LoopVar4;\r
+ mNext[LoopVar4] = LoopVar10;\r
+ mPrev[LoopVar10] = LoopVar4;\r
+ mPrev[LoopVar4] = LoopVar12;\r
+ mParent[LoopVar4] = LoopVar6;\r
mChildCount[LoopVar6]++;\r
}\r
\r
**/\r
VOID\r
Split (\r
- IN NODE Old\r
+ IN NODE Old\r
)\r
{\r
NODE New;\r
\r
NODE LoopVar10;\r
\r
- New = mAvail;\r
- mAvail = mNext[New];\r
- mChildCount[New] = 0;\r
- LoopVar10 = mPrev[Old];\r
- mPrev[New] = LoopVar10;\r
- mNext[LoopVar10] = New;\r
- LoopVar10 = mNext[Old];\r
- mNext[New] = LoopVar10;\r
- mPrev[LoopVar10] = New;\r
- mParent[New] = mParent[Old];\r
- mLevel[New] = (UINT8) mMatchLen;\r
- mPosition[New] = mPos;\r
+ New = mAvail;\r
+ mAvail = mNext[New];\r
+ mChildCount[New] = 0;\r
+ LoopVar10 = mPrev[Old];\r
+ mPrev[New] = LoopVar10;\r
+ mNext[LoopVar10] = New;\r
+ LoopVar10 = mNext[Old];\r
+ mNext[New] = LoopVar10;\r
+ mPrev[LoopVar10] = New;\r
+ mParent[New] = mParent[Old];\r
+ mLevel[New] = (UINT8)mMatchLen;\r
+ mPosition[New] = mPos;\r
MakeChild (New, mText[mMatchPos + mMatchLen], Old);\r
MakeChild (New, mText[mPos + mMatchLen], mPos);\r
}\r
\r
NODE LoopVar2;\r
\r
- NODE LoopVar10;\r
- UINT8 LoopVar5;\r
- UINT8 *TempString3;\r
- UINT8 *TempString2;\r
+ NODE LoopVar10;\r
+ UINT8 LoopVar5;\r
+ UINT8 *TempString3;\r
+ UINT8 *TempString2;\r
\r
if (mMatchLen >= 4) {\r
//\r
// in DeleteNode() later.\r
//\r
mMatchLen--;\r
- LoopVar4 = (NODE) ((mMatchPos + 1) | WNDSIZ);\r
+ LoopVar4 = (NODE)((mMatchPos + 1) | WNDSIZ);\r
LoopVar6 = mParent[LoopVar4];\r
while (LoopVar6 == NIL) {\r
LoopVar4 = mNext[LoopVar4];\r
\r
LoopVar10 = LoopVar6;\r
while (mPosition[LoopVar10] < 0) {\r
- mPosition[LoopVar10] = mPos;\r
- LoopVar10 = mParent[LoopVar10];\r
+ mPosition[LoopVar10] = mPos;\r
+ LoopVar10 = mParent[LoopVar10];\r
}\r
\r
if (LoopVar10 < WNDSIZ) {\r
- mPosition[LoopVar10] = (NODE) (mPos | PERC_FLAG);\r
+ mPosition[LoopVar10] = (NODE)(mPos | PERC_FLAG);\r
}\r
} else {\r
//\r
// Locate the target tree\r
//\r
- LoopVar6 = (NODE) (mText[mPos] + WNDSIZ);\r
+ LoopVar6 = (NODE)(mText[mPos] + WNDSIZ);\r
LoopVar5 = mText[mPos + 1];\r
LoopVar4 = Child (LoopVar6, LoopVar5);\r
if (LoopVar4 == NIL) {\r
MakeChild (LoopVar6, LoopVar5, mPos);\r
mMatchLen = 1;\r
- return ;\r
+ return;\r
}\r
\r
mMatchLen = 2;\r
}\r
+\r
//\r
// Traverse down the tree to find a match.\r
// Update Position value along the route.\r
// Node split or creation is involved.\r
//\r
- for (;;) {\r
+ for ( ; ;) {\r
if (LoopVar4 >= WNDSIZ) {\r
- LoopVar2 = MAXMATCH;\r
+ LoopVar2 = MAXMATCH;\r
mMatchPos = LoopVar4;\r
} else {\r
- LoopVar2 = mLevel[LoopVar4];\r
- mMatchPos = (NODE) (mPosition[LoopVar4] & ~PERC_FLAG);\r
+ LoopVar2 = mLevel[LoopVar4];\r
+ mMatchPos = (NODE)(mPosition[LoopVar4] & ~PERC_FLAG);\r
}\r
\r
if (mMatchPos >= mPos) {\r
mMatchPos -= WNDSIZ;\r
}\r
\r
- TempString3 = &mText[mPos + mMatchLen];\r
- TempString2 = &mText[mMatchPos + mMatchLen];\r
+ TempString3 = &mText[mPos + mMatchLen];\r
+ TempString2 = &mText[mMatchPos + mMatchLen];\r
while (mMatchLen < LoopVar2) {\r
if (*TempString3 != *TempString2) {\r
Split (LoopVar4);\r
- return ;\r
+ return;\r
}\r
\r
mMatchLen++;\r
break;\r
}\r
\r
- mPosition[LoopVar4] = mPos;\r
- LoopVar6 = LoopVar4;\r
- LoopVar4 = Child (LoopVar6, *TempString3);\r
+ mPosition[LoopVar4] = mPos;\r
+ LoopVar6 = LoopVar4;\r
+ LoopVar4 = Child (LoopVar6, *TempString3);\r
if (LoopVar4 == NIL) {\r
MakeChild (LoopVar6, *TempString3, mPos);\r
- return ;\r
+ return;\r
}\r
\r
mMatchLen++;\r
}\r
\r
- LoopVar10 = mPrev[LoopVar4];\r
- mPrev[mPos] = LoopVar10;\r
- mNext[LoopVar10] = mPos;\r
- LoopVar10 = mNext[LoopVar4];\r
- mNext[mPos] = LoopVar10;\r
- mPrev[LoopVar10] = mPos;\r
- mParent[mPos] = LoopVar6;\r
- mParent[LoopVar4] = NIL;\r
+ LoopVar10 = mPrev[LoopVar4];\r
+ mPrev[mPos] = LoopVar10;\r
+ mNext[LoopVar10] = mPos;\r
+ LoopVar10 = mNext[LoopVar4];\r
+ mNext[mPos] = LoopVar10;\r
+ mPrev[LoopVar10] = mPos;\r
+ mParent[mPos] = LoopVar6;\r
+ mParent[LoopVar4] = NIL;\r
\r
//\r
// Special usage of 'next'\r
//\r
mNext[LoopVar4] = mPos;\r
-\r
}\r
\r
/**\r
NODE LoopVar9;\r
\r
if (mParent[mPos] == NIL) {\r
- return ;\r
+ return;\r
}\r
\r
- LoopVar4 = mPrev[mPos];\r
- LoopVar11 = mNext[mPos];\r
- mNext[LoopVar4] = LoopVar11;\r
- mPrev[LoopVar11] = LoopVar4;\r
- LoopVar4 = mParent[mPos];\r
- mParent[mPos] = NIL;\r
+ LoopVar4 = mPrev[mPos];\r
+ LoopVar11 = mNext[mPos];\r
+ mNext[LoopVar4] = LoopVar11;\r
+ mPrev[LoopVar11] = LoopVar4;\r
+ LoopVar4 = mParent[mPos];\r
+ mParent[mPos] = NIL;\r
if (LoopVar4 >= WNDSIZ) {\r
- return ;\r
+ return;\r
}\r
\r
mChildCount[LoopVar4]--;\r
if (mChildCount[LoopVar4] > 1) {\r
- return ;\r
+ return;\r
}\r
\r
- LoopVar10 = (NODE) (mPosition[LoopVar4] & ~PERC_FLAG);\r
+ LoopVar10 = (NODE)(mPosition[LoopVar4] & ~PERC_FLAG);\r
if (LoopVar10 >= mPos) {\r
LoopVar10 -= WNDSIZ;\r
}\r
\r
LoopVar11 = LoopVar10;\r
- LoopVar6 = mParent[LoopVar4];\r
- LoopVar9 = mPosition[LoopVar6];\r
- while ((LoopVar9 & PERC_FLAG) != 0){\r
+ LoopVar6 = mParent[LoopVar4];\r
+ LoopVar9 = mPosition[LoopVar6];\r
+ while ((LoopVar9 & PERC_FLAG) != 0) {\r
LoopVar9 &= ~PERC_FLAG;\r
if (LoopVar9 >= mPos) {\r
LoopVar9 -= WNDSIZ;\r
LoopVar11 = LoopVar9;\r
}\r
\r
- mPosition[LoopVar6] = (NODE) (LoopVar11 | WNDSIZ);\r
- LoopVar6 = mParent[LoopVar6];\r
- LoopVar9 = mPosition[LoopVar6];\r
+ mPosition[LoopVar6] = (NODE)(LoopVar11 | WNDSIZ);\r
+ LoopVar6 = mParent[LoopVar6];\r
+ LoopVar9 = mPosition[LoopVar6];\r
}\r
\r
if (LoopVar6 < WNDSIZ) {\r
LoopVar11 = LoopVar9;\r
}\r
\r
- mPosition[LoopVar6] = (NODE) (LoopVar11 | WNDSIZ | PERC_FLAG);\r
+ mPosition[LoopVar6] = (NODE)(LoopVar11 | WNDSIZ | PERC_FLAG);\r
}\r
\r
- LoopVar11 = Child (LoopVar4, mText[LoopVar10 + mLevel[LoopVar4]]);\r
- LoopVar10 = mPrev[LoopVar11];\r
+ LoopVar11 = Child (LoopVar4, mText[LoopVar10 + mLevel[LoopVar4]]);\r
+ LoopVar10 = mPrev[LoopVar11];\r
LoopVar9 = mNext[LoopVar11];\r
- mNext[LoopVar10] = LoopVar9;\r
+ mNext[LoopVar10] = LoopVar9;\r
mPrev[LoopVar9] = LoopVar10;\r
- LoopVar10 = mPrev[LoopVar4];\r
- mNext[LoopVar10] = LoopVar11;\r
- mPrev[LoopVar11] = LoopVar10;\r
- LoopVar10 = mNext[LoopVar4];\r
- mPrev[LoopVar10] = LoopVar11;\r
- mNext[LoopVar11] = LoopVar10;\r
- mParent[LoopVar11] = mParent[LoopVar4];\r
+ LoopVar10 = mPrev[LoopVar4];\r
+ mNext[LoopVar10] = LoopVar11;\r
+ mPrev[LoopVar11] = LoopVar10;\r
+ LoopVar10 = mNext[LoopVar4];\r
+ mPrev[LoopVar10] = LoopVar11;\r
+ mNext[LoopVar11] = LoopVar10;\r
+ mParent[LoopVar11] = mParent[LoopVar4];\r
mParent[LoopVar4] = NIL;\r
mNext[LoopVar4] = mAvail;\r
- mAvail = LoopVar4;\r
+ mAvail = LoopVar4;\r
}\r
\r
/**\r
**/\r
INT32\r
FreadCrc (\r
- OUT UINT8 *LoopVar7,\r
- IN INT32 LoopVar8\r
+ OUT UINT8 *LoopVar7,\r
+ IN INT32 LoopVar8\r
)\r
{\r
- INT32 LoopVar1;\r
+ INT32 LoopVar1;\r
\r
for (LoopVar1 = 0; mSrc < mSrcUpperLimit && LoopVar1 < LoopVar8; LoopVar1++) {\r
*LoopVar7++ = *mSrc++;\r
\r
LoopVar8 = LoopVar1;\r
\r
- LoopVar7 -= LoopVar8;\r
+ LoopVar7 -= LoopVar8;\r
mOrigSize += LoopVar8;\r
LoopVar1--;\r
while (LoopVar1 >= 0) {\r
VOID\r
)\r
{\r
- INT32 LoopVar8;\r
- VOID *Temp;\r
+ INT32 LoopVar8;\r
+ VOID *Temp;\r
\r
mRemainder--;\r
mPos++;\r
if (Temp == NULL) {\r
return (FALSE);\r
}\r
+\r
CopyMem (Temp, &mText[WNDSIZ], WNDSIZ + MAXMATCH);\r
CopyMem (&mText[0], Temp, WNDSIZ + MAXMATCH);\r
FreePool (Temp);\r
- LoopVar8 = FreadCrc (&mText[WNDSIZ + MAXMATCH], WNDSIZ);\r
+ LoopVar8 = FreadCrc (&mText[WNDSIZ + MAXMATCH], WNDSIZ);\r
mRemainder += LoopVar8;\r
- mPos = WNDSIZ;\r
+ mPos = WNDSIZ;\r
}\r
\r
DeleteNode ();\r
**/\r
VOID\r
DownHeap (\r
- IN INT32 i\r
+ IN INT32 i\r
)\r
{\r
- INT32 LoopVar1;\r
+ INT32 LoopVar1;\r
\r
- INT32 LoopVar2;\r
+ INT32 LoopVar2;\r
\r
//\r
// priority queue: send i-th entry down heap\r
LoopVar2 = mHeap[i];\r
LoopVar1 = 2 * i;\r
while (LoopVar1 <= mHeapSize) {\r
- if (LoopVar1 < mHeapSize && mFreq[mHeap[LoopVar1]] > mFreq[mHeap[LoopVar1 + 1]]) {\r
+ if ((LoopVar1 < mHeapSize) && (mFreq[mHeap[LoopVar1]] > mFreq[mHeap[LoopVar1 + 1]])) {\r
LoopVar1++;\r
}\r
\r
break;\r
}\r
\r
- mHeap[i] = mHeap[LoopVar1];\r
- i = LoopVar1;\r
- LoopVar1 = 2 * i;\r
+ mHeap[i] = mHeap[LoopVar1];\r
+ i = LoopVar1;\r
+ LoopVar1 = 2 * i;\r
}\r
\r
- mHeap[i] = (INT16) LoopVar2;\r
+ mHeap[i] = (INT16)LoopVar2;\r
}\r
\r
/**\r
**/\r
VOID\r
CountLen (\r
- IN INT32 LoopVar1\r
+ IN INT32 LoopVar1\r
)\r
{\r
if (LoopVar1 < mTempInt32) {\r
**/\r
VOID\r
MakeLen (\r
- IN INT32 Root\r
+ IN INT32 Root\r
)\r
{\r
- INT32 LoopVar1;\r
+ INT32 LoopVar1;\r
\r
INT32 LoopVar2;\r
UINT32 Cum;\r
LoopVar2 = mLenCnt[LoopVar1];\r
LoopVar2--;\r
while (LoopVar2 >= 0) {\r
- mLen[*mSortPtr++] = (UINT8) LoopVar1;\r
+ mLen[*mSortPtr++] = (UINT8)LoopVar1;\r
LoopVar2--;\r
}\r
}\r
**/\r
VOID\r
MakeCode (\r
- IN INT32 LoopVar8,\r
- IN UINT8 Len[ ],\r
- OUT UINT16 Code[ ]\r
+ IN INT32 LoopVar8,\r
+ IN UINT8 Len[],\r
+ OUT UINT16 Code[]\r
)\r
{\r
INT32 LoopVar1;\r
\r
Start[1] = 0;\r
for (LoopVar1 = 1; LoopVar1 <= 16; LoopVar1++) {\r
- Start[LoopVar1 + 1] = (UINT16) ((Start[LoopVar1] + mLenCnt[LoopVar1]) << 1);\r
+ Start[LoopVar1 + 1] = (UINT16)((Start[LoopVar1] + mLenCnt[LoopVar1]) << 1);\r
}\r
\r
for (LoopVar1 = 0; LoopVar1 < LoopVar8; LoopVar1++) {\r
**/\r
INT32\r
MakeTree (\r
- IN INT32 NParm,\r
- IN UINT16 FreqParm[ ],\r
- OUT UINT8 LenParm[ ],\r
- OUT UINT16 CodeParm[ ]\r
+ IN INT32 NParm,\r
+ IN UINT16 FreqParm[],\r
+ OUT UINT8 LenParm[],\r
+ OUT UINT16 CodeParm[]\r
)\r
{\r
- INT32 LoopVar1;\r
+ INT32 LoopVar1;\r
\r
- INT32 LoopVar2;\r
+ INT32 LoopVar2;\r
\r
- INT32 LoopVar3;\r
+ INT32 LoopVar3;\r
\r
- INT32 Avail;\r
+ INT32 Avail;\r
\r
//\r
// make tree, calculate len[], return root\r
//\r
- mTempInt32 = NParm;\r
- mFreq = FreqParm;\r
- mLen = LenParm;\r
- Avail = mTempInt32;\r
- mHeapSize = 0;\r
- mHeap[1] = 0;\r
+ mTempInt32 = NParm;\r
+ mFreq = FreqParm;\r
+ mLen = LenParm;\r
+ Avail = mTempInt32;\r
+ mHeapSize = 0;\r
+ mHeap[1] = 0;\r
for (LoopVar1 = 0; LoopVar1 < mTempInt32; LoopVar1++) {\r
mLen[LoopVar1] = 0;\r
if ((mFreq[LoopVar1]) != 0) {\r
mHeapSize++;\r
- mHeap[mHeapSize] = (INT16) LoopVar1;\r
+ mHeap[mHeapSize] = (INT16)LoopVar1;\r
}\r
}\r
\r
do {\r
LoopVar1 = mHeap[1];\r
if (LoopVar1 < mTempInt32) {\r
- *mSortPtr++ = (UINT16) LoopVar1;\r
+ *mSortPtr++ = (UINT16)LoopVar1;\r
}\r
\r
mHeap[1] = mHeap[mHeapSize--];\r
DownHeap (1);\r
LoopVar2 = mHeap[1];\r
if (LoopVar2 < mTempInt32) {\r
- *mSortPtr++ = (UINT16) LoopVar2;\r
+ *mSortPtr++ = (UINT16)LoopVar2;\r
}\r
\r
- LoopVar3 = Avail++;\r
- mFreq[LoopVar3] = (UINT16) (mFreq[LoopVar1] + mFreq[LoopVar2]);\r
- mHeap[1] = (INT16) LoopVar3;\r
+ LoopVar3 = Avail++;\r
+ mFreq[LoopVar3] = (UINT16)(mFreq[LoopVar1] + mFreq[LoopVar2]);\r
+ mHeap[1] = (INT16)LoopVar3;\r
DownHeap (1);\r
- mLeft[LoopVar3] = (UINT16) LoopVar1;\r
- mRight[LoopVar3] = (UINT16) LoopVar2;\r
+ mLeft[LoopVar3] = (UINT16)LoopVar1;\r
+ mRight[LoopVar3] = (UINT16)LoopVar2;\r
} while (mHeapSize > 1);\r
\r
mSortPtr = CodeParm;\r
**/\r
VOID\r
PutBits (\r
- IN INT32 LoopVar8,\r
- IN UINT32 x\r
+ IN INT32 LoopVar8,\r
+ IN UINT32 x\r
)\r
{\r
- UINT8 Temp;\r
+ UINT8 Temp;\r
\r
if (LoopVar8 < mBitCount) {\r
mSubBitBuf |= x << (mBitCount -= LoopVar8);\r
} else {\r
-\r
Temp = (UINT8)(mSubBitBuf | (x >> (LoopVar8 -= mBitCount)));\r
if (mDst < mDstUpperLimit) {\r
*mDst++ = Temp;\r
}\r
+\r
mCompSize++;\r
\r
if (LoopVar8 < UINT8_BIT) {\r
mSubBitBuf = x << (mBitCount = UINT8_BIT - LoopVar8);\r
} else {\r
-\r
Temp = (UINT8)(x >> (LoopVar8 - UINT8_BIT));\r
if (mDst < mDstUpperLimit) {\r
*mDst++ = Temp;\r
}\r
+\r
mCompSize++;\r
\r
mSubBitBuf = x << (mBitCount = 2 * UINT8_BIT - LoopVar8);\r
**/\r
VOID\r
EncodeC (\r
- IN INT32 LoopVar5\r
+ IN INT32 LoopVar5\r
)\r
{\r
PutBits (mCLen[LoopVar5], mCCode[LoopVar5]);\r
**/\r
VOID\r
EncodeP (\r
- IN UINT32 LoopVar7\r
+ IN UINT32 LoopVar7\r
)\r
{\r
UINT32 LoopVar5;\r
\r
PutBits (mPTLen[LoopVar5], mPTCode[LoopVar5]);\r
if (LoopVar5 > 1) {\r
- PutBits(LoopVar5 - 1, LoopVar7 & (0xFFFFU >> (17 - LoopVar5)));\r
+ PutBits (LoopVar5 - 1, LoopVar7 & (0xFFFFU >> (17 - LoopVar5)));\r
}\r
}\r
\r
VOID\r
)\r
{\r
- INT32 LoopVar1;\r
+ INT32 LoopVar1;\r
\r
- INT32 LoopVar3;\r
+ INT32 LoopVar3;\r
\r
- INT32 LoopVar8;\r
+ INT32 LoopVar8;\r
\r
- INT32 Count;\r
+ INT32 Count;\r
\r
for (LoopVar1 = 0; LoopVar1 < NT; LoopVar1++) {\r
mTFreq[LoopVar1] = 0;\r
}\r
\r
if (Count <= 2) {\r
- mTFreq[0] = (UINT16) (mTFreq[0] + Count);\r
+ mTFreq[0] = (UINT16)(mTFreq[0] + Count);\r
} else if (Count <= 18) {\r
mTFreq[1]++;\r
} else if (Count == 19) {\r
mTFreq[2]++;\r
}\r
} else {\r
- ASSERT((LoopVar3+2)<(2 * NT - 1));\r
+ ASSERT ((LoopVar3+2) < (2 * NT - 1));\r
mTFreq[LoopVar3 + 2]++;\r
}\r
}\r
**/\r
VOID\r
WritePTLen (\r
- IN INT32 LoopVar8,\r
- IN INT32 nbit,\r
- IN INT32 Special\r
+ IN INT32 LoopVar8,\r
+ IN INT32 nbit,\r
+ IN INT32 Special\r
)\r
{\r
- INT32 LoopVar1;\r
+ INT32 LoopVar1;\r
\r
- INT32 LoopVar3;\r
+ INT32 LoopVar3;\r
\r
while (LoopVar8 > 0 && mPTLen[LoopVar8 - 1] == 0) {\r
LoopVar8--;\r
VOID\r
)\r
{\r
- INT32 LoopVar1;\r
+ INT32 LoopVar1;\r
\r
- INT32 LoopVar3;\r
+ INT32 LoopVar3;\r
\r
- INT32 LoopVar8;\r
+ INT32 LoopVar8;\r
\r
- INT32 Count;\r
+ INT32 Count;\r
\r
LoopVar8 = NC;\r
while (LoopVar8 > 0 && mCLen[LoopVar8 - 1] == 0) {\r
PutBits (CBIT, Count - 20);\r
}\r
} else {\r
- ASSERT((LoopVar3+2)<NPT);\r
+ ASSERT ((LoopVar3+2) < NPT);\r
PutBits (mPTLen[LoopVar3 + 2], mPTCode[LoopVar3 + 2]);\r
}\r
}\r
UINT32 Pos;\r
\r
UINT32 Size;\r
+\r
Flags = 0;\r
\r
- Root = MakeTree (NC, mCFreq, mCLen, mCCode);\r
- Size = mCFreq[Root];\r
+ Root = MakeTree (NC, mCFreq, mCLen, mCCode);\r
+ Size = mCFreq[Root];\r
PutBits (16, Size);\r
if (Root >= NC) {\r
CountTFreq ();\r
} else {\r
Flags <<= 1;\r
}\r
- if ((Flags & (1U << (UINT8_BIT - 1))) != 0){\r
- EncodeC(mBuf[Pos++] + (1U << UINT8_BIT));\r
- LoopVar3 = mBuf[Pos++] << UINT8_BIT;\r
+\r
+ if ((Flags & (1U << (UINT8_BIT - 1))) != 0) {\r
+ EncodeC (mBuf[Pos++] + (1U << UINT8_BIT));\r
+ LoopVar3 = mBuf[Pos++] << UINT8_BIT;\r
LoopVar3 += mBuf[Pos++];\r
\r
EncodeP (LoopVar3);\r
\r
mOutputPos = mOutputMask = 0;\r
\r
- mBitCount = UINT8_BIT;\r
- mSubBitBuf = 0;\r
+ mBitCount = UINT8_BIT;\r
+ mSubBitBuf = 0;\r
}\r
\r
/**\r
**/\r
VOID\r
CompressOutput (\r
- IN UINT32 LoopVar5,\r
- IN UINT32 LoopVar7\r
+ IN UINT32 LoopVar5,\r
+ IN UINT32 LoopVar7\r
)\r
{\r
- STATIC UINT32 CPos;\r
+ STATIC UINT32 CPos;\r
\r
if ((mOutputMask >>= 1) == 0) {\r
mOutputMask = 1U << (UINT8_BIT - 1);\r
mOutputPos = 0;\r
}\r
\r
- CPos = mOutputPos++;\r
- mBuf[CPos] = 0;\r
+ CPos = mOutputPos++;\r
+ mBuf[CPos] = 0;\r
}\r
- mBuf[mOutputPos++] = (UINT8) LoopVar5;\r
+\r
+ mBuf[mOutputPos++] = (UINT8)LoopVar5;\r
mCFreq[LoopVar5]++;\r
if (LoopVar5 >= (1U << UINT8_BIT)) {\r
- mBuf[CPos] = (UINT8)(mBuf[CPos]|mOutputMask);\r
+ mBuf[CPos] = (UINT8)(mBuf[CPos]|mOutputMask);\r
mBuf[mOutputPos++] = (UINT8)(LoopVar7 >> UINT8_BIT);\r
- mBuf[mOutputPos++] = (UINT8) LoopVar7;\r
- LoopVar5 = 0;\r
- while (LoopVar7!=0) {\r
+ mBuf[mOutputPos++] = (UINT8)LoopVar7;\r
+ LoopVar5 = 0;\r
+ while (LoopVar7 != 0) {\r
LoopVar7 >>= 1;\r
LoopVar5++;\r
}\r
+\r
mPFreq[LoopVar5]++;\r
}\r
}\r
\r
HufEncodeStart ();\r
\r
- mRemainder = FreadCrc (&mText[WNDSIZ], WNDSIZ + MAXMATCH);\r
+ mRemainder = FreadCrc (&mText[WNDSIZ], WNDSIZ + MAXMATCH);\r
\r
- mMatchLen = 0;\r
- mPos = WNDSIZ;\r
+ mMatchLen = 0;\r
+ mPos = WNDSIZ;\r
InsertNode ();\r
if (mMatchLen > mRemainder) {\r
mMatchLen = mRemainder;\r
}\r
\r
while (mRemainder > 0) {\r
- LastMatchLen = mMatchLen;\r
- LastMatchPos = mMatchPos;\r
+ LastMatchLen = mMatchLen;\r
+ LastMatchPos = mMatchPos;\r
if (!GetNextMatch ()) {\r
Status = EFI_OUT_OF_RESOURCES;\r
}\r
+\r
if (mMatchLen > mRemainder) {\r
mMatchLen = mRemainder;\r
}\r
\r
- if (mMatchLen > LastMatchLen || LastMatchLen < THRESHOLD) {\r
+ if ((mMatchLen > LastMatchLen) || (LastMatchLen < THRESHOLD)) {\r
//\r
// Not enough benefits are gained by outputting a pointer,\r
// so just output the original character\r
//\r
- CompressOutput(mText[mPos - 1], 0);\r
+ CompressOutput (mText[mPos - 1], 0);\r
} else {\r
//\r
// Outputting a pointer is beneficial enough, do it.\r
//\r
\r
- CompressOutput(LastMatchLen + (UINT8_MAX + 1 - THRESHOLD),\r
- (mPos - LastMatchPos - 2) & (WNDSIZ - 1));\r
+ CompressOutput (\r
+ LastMatchLen + (UINT8_MAX + 1 - THRESHOLD),\r
+ (mPos - LastMatchPos - 2) & (WNDSIZ - 1)\r
+ );\r
LastMatchLen--;\r
while (LastMatchLen > 0) {\r
if (!GetNextMatch ()) {\r
Status = EFI_OUT_OF_RESOURCES;\r
}\r
+\r
LastMatchLen--;\r
}\r
\r
//\r
// Initializations\r
//\r
- mBufSiz = 0;\r
- mBuf = NULL;\r
- mText = NULL;\r
- mLevel = NULL;\r
- mChildCount = NULL;\r
- mPosition = NULL;\r
- mParent = NULL;\r
- mPrev = NULL;\r
- mNext = NULL;\r
-\r
- mSrc = SrcBuffer;\r
- mSrcUpperLimit = mSrc + SrcSize;\r
- mDst = DstBuffer;\r
- mDstUpperLimit = mDst +*DstSize;\r
+ mBufSiz = 0;\r
+ mBuf = NULL;\r
+ mText = NULL;\r
+ mLevel = NULL;\r
+ mChildCount = NULL;\r
+ mPosition = NULL;\r
+ mParent = NULL;\r
+ mPrev = NULL;\r
+ mNext = NULL;\r
+\r
+ mSrc = SrcBuffer;\r
+ mSrcUpperLimit = mSrc + SrcSize;\r
+ mDst = DstBuffer;\r
+ mDstUpperLimit = mDst +*DstSize;\r
\r
PutDword (0L);\r
PutDword (0L);\r
\r
MakeCrcTable ();\r
\r
- mOrigSize = mCompSize = 0;\r
- mCrc = INIT_CRC;\r
+ mOrigSize = mCompSize = 0;\r
+ mCrc = INIT_CRC;\r
\r
//\r
// Compress it\r
if (EFI_ERROR (Status)) {\r
return EFI_OUT_OF_RESOURCES;\r
}\r
+\r
//\r
// Null terminate the compressed data\r
//\r
if (mDst < mDstUpperLimit) {\r
*mDst++ = 0;\r
}\r
+\r
//\r
// Fill in compressed size and original size\r
//\r
*DstSize = mCompSize + 1 + 8;\r
return EFI_SUCCESS;\r
}\r
-\r
}\r
-\r
projects / mirror_edk2.git / blobdiff