dany/libwebp
1
0
Fork 0
mirror of https://github.com/webmproject/libwebp.git synced 2025-10-31 02:15:42 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity

Rename MAX_COST to MAX_BIT_COST in histogram_enc.c

Browse Source 
To differentiate it with the one in vp8i_enc.h

Change-Id: If4ecc40246cb1c6e42a2ae77328966c4069d441c
This commit is contained in:
Yannis Guyon
2022-02-03 09:57:30 +01:00
parent 13b8281609
commit 26139c7398
1 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
src/enc/histogram_enc.c
View File

@@ -21,7 +21,7 @@
#include "src/dsp/lossless_common.h" #include "src/dsp/lossless_common.h"
#include "src/utils/utils.h" #include "src/utils/utils.h"
#define MAX_COST 1.e38 #define MAX_BIT_COST 1.e38
// Number of partitions for the three dominant (literal, red and blue) symbol // Number of partitions for the three dominant (literal, red and blue) symbol
// costs. // costs.
@@ -486,11 +486,11 @@ typedef struct {
static void DominantCostRangeInit(DominantCostRange* const c) { static void DominantCostRangeInit(DominantCostRange* const c) {
c->literal_max_ = 0.; c->literal_max_ = 0.;
c->literal_min_ = MAX_COST; c->literal_min_ = MAX_BIT_COST;
c->red_max_ = 0.; c->red_max_ = 0.;
c->red_min_ = MAX_COST; c->red_min_ = MAX_BIT_COST;
c->blue_max_ = 0.; c->blue_max_ = 0.;
c->blue_min_ = MAX_COST; c->blue_min_ = MAX_BIT_COST;
} }
static void UpdateDominantCostRange( static void UpdateDominantCostRange(
@@ -1057,7 +1057,7 @@ static void HistogramRemap(const VP8LHistogramSet* const in,
if (out_size > 1) { if (out_size > 1) {
for (i = 0; i < in_size; ++i) { for (i = 0; i < in_size; ++i) {
int best_out = 0; int best_out = 0;
double best_bits = MAX_COST; double best_bits = MAX_BIT_COST;
int k; int k;
if (in_histo[i] == NULL) { if (in_histo[i] == NULL) {
// Arbitrarily set to the previous value if unused to help future LZ77. // Arbitrarily set to the previous value if unused to help future LZ77.