HomeSort by relevance Sort by last modified time
    Searched refs:mMatchLen (Results 1 - 9 of 9) sorted by null

  /external/archive-patcher/generator/src/main/java/com/google/archivepatcher/generator/bsdiff/
BsDiffMatcher.java 46 * The next match will be searched starting at |mNewPos| + |mMatchLen|.
65 private int mMatchLen;
95 mNewPos += mMatchLen;
98 // oldData[mNewPos + previousOldOffset ... mNewPos + previousOldOffset + mMatchLen - 1]
99 // and newData[mNewPos ... mNewPos + mMatchLen - 1].
115 mMatchLen = match.length;
116 totalMatchLen += mMatchLen;
119 for (; matchesCacheSize < mMatchLen; ++matchesCacheSize) {
133 if (mMatchLen > numMatches + mMinimumMatchLength || totalMatchLen >= mTotalMatchLenBudget) {
137 if (mMatchLen == 0)
    [all...]
  /device/linaro/bootloader/edk2/BaseTools/Source/C/Common/
EfiCompress.c 244 STATIC INT32 mRemainder, mMatchLen, mBitCount, mHeapSize, mN;
627 mLevel[New] = (UINT8)mMatchLen;
629 MakeChild(New, mText[mMatchPos + mMatchLen], Old);
630 MakeChild(New, mText[mPos + mMatchLen], mPos);
651 if (mMatchLen >= 4) {
661 mMatchLen--;
666 while (mLevel[q] >= mMatchLen) {
687 mMatchLen = 1;
690 mMatchLen = 2;
710 t1 = &mText[mPos + mMatchLen];
    [all...]
TianoCompress.c 253 STATIC INT32 mRemainder, mMatchLen, mBitCount, mHeapSize, mN;
649 mLevel[New] = (UINT8) mMatchLen;
651 MakeChild (New, mText[mMatchPos + mMatchLen], Old);
652 MakeChild (New, mText[mPos + mMatchLen], mPos);
680 if (mMatchLen >= 4) {
688 mMatchLen--;
696 while (mLevel[NodeQ] >= mMatchLen) {
719 mMatchLen = 1;
723 mMatchLen = 2;
743 t1 = &mText[mPos + mMatchLen];
    [all...]
  /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Sample/Tools/Source/Common/
EfiCompress.c 254 STATIC INT32 mRemainder, mMatchLen, mBitCount, mHeapSize, mN;
630 mLevel[New] = (UINT8)mMatchLen;
632 MakeChild(New, mText[mMatchPos + mMatchLen], Old);
633 MakeChild(New, mText[mPos + mMatchLen], mPos);
654 if (mMatchLen >= 4) {
664 mMatchLen--;
669 while (mLevel[q] >= mMatchLen) {
690 mMatchLen = 1;
693 mMatchLen = 2;
713 t1 = &mText[mPos + mMatchLen];
    [all...]
TianoCompress.c 272 STATIC INT32 mRemainder, mMatchLen, mBitCount, mHeapSize, mN;
662 mLevel[New] = (UINT8) mMatchLen;
664 MakeChild (New, mText[mMatchPos + mMatchLen], Old);
665 MakeChild (New, mText[mPos + mMatchLen], mPos);
693 if (mMatchLen >= 4) {
701 mMatchLen--;
709 while (mLevel[NodeQ] >= mMatchLen) {
732 mMatchLen = 1;
736 mMatchLen = 2;
756 t1 = &mText[mPos + mMatchLen];
    [all...]
  /device/linaro/bootloader/edk2/ShellPkg/Library/UefiShellDebug1CommandsLib/
Compress.c 91 STATIC INT32 mMatchLen;
337 mLevel[New] = (UINT8) mMatchLen;
339 MakeChild (New, mText[mMatchPos + mMatchLen], Old);
340 MakeChild (New, mText[mPos + mMatchLen], mPos);
363 if (mMatchLen >= 4) {
371 mMatchLen--;
379 while (mLevel[LoopVar6] >= mMatchLen) {
402 mMatchLen = 1;
406 mMatchLen = 2;
426 TempString3 = &mText[mPos + mMatchLen];
    [all...]
  /external/vboot_reference/utility/
eficompress.c 264 STATIC INT32 mRemainder, mMatchLen, mBitCount, mHeapSize, mN;
640 mLevel[New] = (UINT8)mMatchLen;
642 MakeChild(New, mText[mMatchPos + mMatchLen], Old);
643 MakeChild(New, mText[mPos + mMatchLen], mPos);
664 if (mMatchLen >= 4) {
674 mMatchLen--;
679 while (mLevel[q] >= mMatchLen) {
700 mMatchLen = 1;
703 mMatchLen = 2;
723 t1 = &mText[mPos + mMatchLen];
    [all...]
  /device/linaro/bootloader/edk2/BaseTools/Source/C/TianoCompress/
TianoCompress.c 71 STATIC INT32 mRemainder, mMatchLen, mBitCount, mHeapSize, mN;
474 mLevel[New] = (UINT8) mMatchLen;
476 MakeChild (New, mText[mMatchPos + mMatchLen], Old);
477 MakeChild (New, mText[mPos + mMatchLen], mPos);
505 if (mMatchLen >= 4) {
513 mMatchLen--;
521 while (mLevel[NodeQ] >= mMatchLen) {
544 mMatchLen = 1;
548 mMatchLen = 2;
568 t1 = &mText[mPos + mMatchLen];
    [all...]
  /external/archive-patcher/generator/src/test/java/com/google/archivepatcher/generator/bsdiff/
BsDiffTest.java 418 private int mMatchLen;
424 mMatchLen = 0;
429 mNewPos += mMatchLen;
433 mMatchLen = longestMatch.length;
434 if (mMatchLen >= 3) {

Completed in 230 milliseconds