You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
31 lines
892 B
31 lines
892 B
/* 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/platform.h"
|
|
#include <brotli/types.h>
|
|
|
|
#if defined(__cplusplus) || defined(c_plusplus)
|
|
extern "C" {
|
|
#endif
|
|
|
|
/* Estimates how many bits the literals in the interval [pos, pos + len) in the
|
|
ring-buffer (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_ */
|