mirror of
				https://github.com/facebook/zstd.git
				synced 2025-10-31 08:37:43 +02:00 
			
		
		
		
	fix : inlining difficulties with gcc 4.6 (travis)
This commit is contained in:
		| @@ -1370,8 +1370,7 @@ size_t ZSTD_insertBtAndFindBestMatch ( | ||||
|             if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop the search */ | ||||
|             largerPtr = nextPtr; | ||||
|             matchIndex = nextPtr[0]; | ||||
|         } | ||||
|     } | ||||
|     }   } | ||||
|  | ||||
|     *smallerPtr = *largerPtr = 0; | ||||
|  | ||||
| @@ -1394,7 +1393,7 @@ size_t ZSTD_BtFindBestMatch ( | ||||
| } | ||||
|  | ||||
|  | ||||
| FORCE_INLINE size_t ZSTD_BtFindBestMatch_selectMLS ( | ||||
| static size_t ZSTD_BtFindBestMatch_selectMLS ( | ||||
|                         ZSTD_CCtx* zc,   /* Index table will be updated */ | ||||
|                         const BYTE* ip, const BYTE* const iLimit, | ||||
|                         size_t* offsetPtr, | ||||
| @@ -1661,7 +1660,7 @@ void ZSTD_compressBlock_lazy_generic(ZSTD_CCtx* ctx, | ||||
|             break;  /* nothing found : store previous solution */ | ||||
|         } | ||||
|  | ||||
|         /* catch up */ | ||||
|        /* catch up */ | ||||
|         if (offset) { | ||||
|             while ((start>anchor) && (start>base+offset) && (start[-1] == start[-1-offset]))   /* only search for offset within prefix */ | ||||
|                 { start--; matchLength++; } | ||||
|   | ||||
| @@ -94,7 +94,7 @@ FORCE_INLINE U32 ZSTD_getPrice(seqStore_t* seqStorePtr, U32 litLength, const BYT | ||||
| { | ||||
|     if (seqStorePtr->litSum > ZSTD_FREQ_THRESHOLD) | ||||
|         return ZSTD_getLiteralPriceReal(seqStorePtr, litLength, literals) + ZSTD_getMatchPriceReal(seqStorePtr, offset, matchLength); | ||||
|  | ||||
|     /* backup eval */ | ||||
|     return (litLength<<3) + ZSTD_highbit((U32)matchLength+1) + Offbits + ZSTD_highbit((U32)offset+1); | ||||
| } | ||||
|  | ||||
|   | ||||
		Reference in New Issue
	
	Block a user