- Copy Brotli algorithm 3rd party source code for tool Cc: Liming Gao <liming.gao@intel.com> Contributed-under: TianoCore Contribution Agreement 1.0 Signed-off-by: Bell Song <binx.song@intel.com> Reviewed-by: Liming Gao <liming.gao@intel.com>
		
			
				
	
	
		
			31 lines
		
	
	
		
			912 B
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			31 lines
		
	
	
		
			912 B
		
	
	
	
		
			C
		
	
	
	
	
	
| /* Copyright 2013 Google Inc. All Rights Reserved.
 | |
| 
 | |
|    Distributed under MIT license.
 | |
|    See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
 | |
| */
 | |
| 
 | |
| /* Literal cost model to allow backward reference replacement to be efficient.
 | |
| */
 | |
| 
 | |
| #ifndef BROTLI_ENC_LITERAL_COST_H_
 | |
| #define BROTLI_ENC_LITERAL_COST_H_
 | |
| 
 | |
| #include "../common/types.h"
 | |
| #include "./port.h"
 | |
| 
 | |
| #if defined(__cplusplus) || defined(c_plusplus)
 | |
| extern "C" {
 | |
| #endif
 | |
| 
 | |
| /* Estimates how many bits the literals in the interval [pos, pos + len) in the
 | |
|    ringbuffer (data, mask) will take entropy coded and writes these estimates
 | |
|    to the cost[0..len) array. */
 | |
| BROTLI_INTERNAL void BrotliEstimateBitCostsForLiterals(
 | |
|     size_t pos, size_t len, size_t mask, const uint8_t *data, float *cost);
 | |
| 
 | |
| #if defined(__cplusplus) || defined(c_plusplus)
 | |
| }  /* extern "C" */
 | |
| #endif
 | |
| 
 | |
| #endif  /* BROTLI_ENC_LITERAL_COST_H_ */
 |