mirror of
https://github.com/webmproject/libwebp.git
synced 2024-12-28 14:38:21 +01:00
Merge "make alpha unfilter work in-place" into 0.3.0
This commit is contained in:
commit
7bfc9056ad
@ -44,7 +44,6 @@ static int DecodeAlpha(const uint8_t* data, size_t data_size,
|
|||||||
int width, int height, int stride, uint8_t* output) {
|
int width, int height, int stride, uint8_t* output) {
|
||||||
uint8_t* decoded_data = NULL;
|
uint8_t* decoded_data = NULL;
|
||||||
const size_t decoded_size = height * width;
|
const size_t decoded_size = height * width;
|
||||||
uint8_t* unfiltered_data = NULL;
|
|
||||||
WEBP_FILTER_TYPE filter;
|
WEBP_FILTER_TYPE filter;
|
||||||
int pre_processing;
|
int pre_processing;
|
||||||
int rsrv;
|
int rsrv;
|
||||||
@ -83,29 +82,19 @@ static int DecodeAlpha(const uint8_t* data, size_t data_size,
|
|||||||
}
|
}
|
||||||
|
|
||||||
if (ok) {
|
if (ok) {
|
||||||
WebPFilterFunc unfilter_func = WebPUnfilters[filter];
|
WebPUnfilterFunc unfilter_func = WebPUnfilters[filter];
|
||||||
if (unfilter_func != NULL) {
|
if (unfilter_func != NULL) {
|
||||||
unfiltered_data = (uint8_t*)malloc(decoded_size);
|
|
||||||
if (unfiltered_data == NULL) {
|
|
||||||
ok = 0;
|
|
||||||
goto Error;
|
|
||||||
}
|
|
||||||
// TODO(vikas): Implement on-the-fly decoding & filter mechanism to decode
|
// TODO(vikas): Implement on-the-fly decoding & filter mechanism to decode
|
||||||
// and apply filter per image-row.
|
// and apply filter per image-row.
|
||||||
unfilter_func(decoded_data, width, height, 1, width, unfiltered_data);
|
unfilter_func(width, height, width, decoded_data);
|
||||||
// Construct raw_data (height x stride) from alpha data (height x width).
|
}
|
||||||
CopyPlane(unfiltered_data, width, output, stride, width, height);
|
|
||||||
free(unfiltered_data);
|
|
||||||
} else {
|
|
||||||
// Construct raw_data (height x stride) from alpha data (height x width).
|
// Construct raw_data (height x stride) from alpha data (height x width).
|
||||||
CopyPlane(decoded_data, width, output, stride, width, height);
|
CopyPlane(decoded_data, width, output, stride, width, height);
|
||||||
}
|
|
||||||
if (pre_processing == ALPHA_PREPROCESSED_LEVELS) {
|
if (pre_processing == ALPHA_PREPROCESSED_LEVELS) {
|
||||||
ok = DequantizeLevels(decoded_data, width, height);
|
ok = DequantizeLevels(decoded_data, width, height);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
Error:
|
|
||||||
if (method != ALPHA_NO_COMPRESSION) {
|
if (method != ALPHA_NO_COMPRESSION) {
|
||||||
free(decoded_data);
|
free(decoded_data);
|
||||||
}
|
}
|
||||||
|
@ -127,8 +127,8 @@ static int EncodeAlphaInternal(const uint8_t* const data, int width, int height,
|
|||||||
VP8BitWriterAppend(bw, &header, ALPHA_HEADER_LEN);
|
VP8BitWriterAppend(bw, &header, ALPHA_HEADER_LEN);
|
||||||
|
|
||||||
filter_func = WebPFilters[filter];
|
filter_func = WebPFilters[filter];
|
||||||
if (filter_func) {
|
if (filter_func != NULL) {
|
||||||
filter_func(data, width, height, 1, width, tmp_alpha);
|
filter_func(data, width, height, width, tmp_alpha);
|
||||||
alpha_src = tmp_alpha;
|
alpha_src = tmp_alpha;
|
||||||
} else {
|
} else {
|
||||||
alpha_src = data;
|
alpha_src = data;
|
||||||
|
@ -26,8 +26,7 @@ extern "C" {
|
|||||||
assert(out != NULL); \
|
assert(out != NULL); \
|
||||||
assert(width > 0); \
|
assert(width > 0); \
|
||||||
assert(height > 0); \
|
assert(height > 0); \
|
||||||
assert(bpp > 0); \
|
assert(stride >= width);
|
||||||
assert(stride >= width * bpp);
|
|
||||||
|
|
||||||
static WEBP_INLINE void PredictLine(const uint8_t* src, const uint8_t* pred,
|
static WEBP_INLINE void PredictLine(const uint8_t* src, const uint8_t* pred,
|
||||||
uint8_t* dst, int length, int inverse) {
|
uint8_t* dst, int length, int inverse) {
|
||||||
@ -43,7 +42,8 @@ static WEBP_INLINE void PredictLine(const uint8_t* src, const uint8_t* pred,
|
|||||||
// Horizontal filter.
|
// Horizontal filter.
|
||||||
|
|
||||||
static WEBP_INLINE void DoHorizontalFilter(const uint8_t* in,
|
static WEBP_INLINE void DoHorizontalFilter(const uint8_t* in,
|
||||||
int width, int height, int bpp, int stride, int inverse, uint8_t* out) {
|
int width, int height, int stride,
|
||||||
|
int inverse, uint8_t* out) {
|
||||||
int h;
|
int h;
|
||||||
const uint8_t* preds = (inverse ? out : in);
|
const uint8_t* preds = (inverse ? out : in);
|
||||||
SANITY_CHECK(in, out);
|
SANITY_CHECK(in, out);
|
||||||
@ -52,11 +52,11 @@ static WEBP_INLINE void DoHorizontalFilter(const uint8_t* in,
|
|||||||
for (h = 0; h < height; ++h) {
|
for (h = 0; h < height; ++h) {
|
||||||
// Leftmost pixel is predicted from above (except for topmost scanline).
|
// Leftmost pixel is predicted from above (except for topmost scanline).
|
||||||
if (h == 0) {
|
if (h == 0) {
|
||||||
memcpy((void*)out, (const void*)in, bpp);
|
out[0] = in[0];
|
||||||
} else {
|
} else {
|
||||||
PredictLine(in, preds - stride, out, bpp, inverse);
|
PredictLine(in, preds - stride, out, 1, inverse);
|
||||||
}
|
}
|
||||||
PredictLine(in + bpp, preds, out + bpp, bpp * (width - 1), inverse);
|
PredictLine(in + 1, preds, out + 1, width - 1, inverse);
|
||||||
preds += stride;
|
preds += stride;
|
||||||
in += stride;
|
in += stride;
|
||||||
out += stride;
|
out += stride;
|
||||||
@ -64,46 +64,46 @@ static WEBP_INLINE void DoHorizontalFilter(const uint8_t* in,
|
|||||||
}
|
}
|
||||||
|
|
||||||
static void HorizontalFilter(const uint8_t* data, int width, int height,
|
static void HorizontalFilter(const uint8_t* data, int width, int height,
|
||||||
int bpp, int stride, uint8_t* filtered_data) {
|
int stride, uint8_t* filtered_data) {
|
||||||
DoHorizontalFilter(data, width, height, bpp, stride, 0, filtered_data);
|
DoHorizontalFilter(data, width, height, stride, 0, filtered_data);
|
||||||
}
|
}
|
||||||
|
|
||||||
static void HorizontalUnfilter(const uint8_t* data, int width, int height,
|
static void HorizontalUnfilter(int width, int height, int stride,
|
||||||
int bpp, int stride, uint8_t* recon_data) {
|
uint8_t* data) {
|
||||||
DoHorizontalFilter(data, width, height, bpp, stride, 1, recon_data);
|
DoHorizontalFilter(data, width, height, stride, 1, data);
|
||||||
}
|
}
|
||||||
|
|
||||||
//------------------------------------------------------------------------------
|
//------------------------------------------------------------------------------
|
||||||
// Vertical filter.
|
// Vertical filter.
|
||||||
|
|
||||||
static WEBP_INLINE void DoVerticalFilter(const uint8_t* in,
|
static WEBP_INLINE void DoVerticalFilter(const uint8_t* in,
|
||||||
int width, int height, int bpp, int stride, int inverse, uint8_t* out) {
|
int width, int height, int stride,
|
||||||
|
int inverse, uint8_t* out) {
|
||||||
int h;
|
int h;
|
||||||
const uint8_t* preds = (inverse ? out : in);
|
const uint8_t* preds = (inverse ? out : in);
|
||||||
SANITY_CHECK(in, out);
|
SANITY_CHECK(in, out);
|
||||||
|
|
||||||
// Very first top-left pixel is copied.
|
// Very first top-left pixel is copied.
|
||||||
memcpy((void*)out, (const void*)in, bpp);
|
out[0] = in[0];
|
||||||
// Rest of top scan-line is left-predicted.
|
// Rest of top scan-line is left-predicted.
|
||||||
PredictLine(in + bpp, preds, out + bpp, bpp * (width - 1), inverse);
|
PredictLine(in + 1, preds, out + 1, width - 1, inverse);
|
||||||
|
|
||||||
// Filter line-by-line.
|
// Filter line-by-line.
|
||||||
for (h = 1; h < height; ++h) {
|
for (h = 1; h < height; ++h) {
|
||||||
in += stride;
|
in += stride;
|
||||||
out += stride;
|
out += stride;
|
||||||
PredictLine(in, preds, out, bpp * width, inverse);
|
PredictLine(in, preds, out, width, inverse);
|
||||||
preds += stride;
|
preds += stride;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
static void VerticalFilter(const uint8_t* data, int width, int height,
|
static void VerticalFilter(const uint8_t* data, int width, int height,
|
||||||
int bpp, int stride, uint8_t* filtered_data) {
|
int stride, uint8_t* filtered_data) {
|
||||||
DoVerticalFilter(data, width, height, bpp, stride, 0, filtered_data);
|
DoVerticalFilter(data, width, height, stride, 0, filtered_data);
|
||||||
}
|
}
|
||||||
|
|
||||||
static void VerticalUnfilter(const uint8_t* data, int width, int height,
|
static void VerticalUnfilter(int width, int height, int stride, uint8_t* data) {
|
||||||
int bpp, int stride, uint8_t* recon_data) {
|
DoVerticalFilter(data, width, height, stride, 1, data);
|
||||||
DoVerticalFilter(data, width, height, bpp, stride, 1, recon_data);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
//------------------------------------------------------------------------------
|
//------------------------------------------------------------------------------
|
||||||
@ -111,19 +111,19 @@ static void VerticalUnfilter(const uint8_t* data, int width, int height,
|
|||||||
|
|
||||||
static WEBP_INLINE int GradientPredictor(uint8_t a, uint8_t b, uint8_t c) {
|
static WEBP_INLINE int GradientPredictor(uint8_t a, uint8_t b, uint8_t c) {
|
||||||
const int g = a + b - c;
|
const int g = a + b - c;
|
||||||
return (g < 0) ? 0 : (g > 255) ? 255 : g;
|
return ((g & ~0xff) == 0) ? g : (g < 0) ? 0 : 255; // clip to 8bit
|
||||||
}
|
}
|
||||||
|
|
||||||
static WEBP_INLINE
|
static WEBP_INLINE
|
||||||
void DoGradientFilter(const uint8_t* in, int width, int height,
|
void DoGradientFilter(const uint8_t* in, int width, int height,
|
||||||
int bpp, int stride, int inverse, uint8_t* out) {
|
int stride, int inverse, uint8_t* out) {
|
||||||
const uint8_t* preds = (inverse ? out : in);
|
const uint8_t* preds = (inverse ? out : in);
|
||||||
int h;
|
int h;
|
||||||
SANITY_CHECK(in, out);
|
SANITY_CHECK(in, out);
|
||||||
|
|
||||||
// left prediction for top scan-line
|
// left prediction for top scan-line
|
||||||
memcpy((void*)out, (const void*)in, bpp);
|
out[0] = in[0];
|
||||||
PredictLine(in + bpp, preds, out + bpp, bpp * (width - 1), inverse);
|
PredictLine(in + 1, preds, out + 1, width - 1, inverse);
|
||||||
|
|
||||||
// Filter line-by-line.
|
// Filter line-by-line.
|
||||||
for (h = 1; h < height; ++h) {
|
for (h = 1; h < height; ++h) {
|
||||||
@ -132,24 +132,23 @@ void DoGradientFilter(const uint8_t* in, int width, int height,
|
|||||||
in += stride;
|
in += stride;
|
||||||
out += stride;
|
out += stride;
|
||||||
// leftmost pixel: predict from above.
|
// leftmost pixel: predict from above.
|
||||||
PredictLine(in, preds - stride, out, bpp, inverse);
|
PredictLine(in, preds - stride, out, 1, inverse);
|
||||||
for (w = bpp; w < width * bpp; ++w) {
|
for (w = 1; w < width; ++w) {
|
||||||
const int pred = GradientPredictor(preds[w - bpp],
|
const int pred = GradientPredictor(preds[w - 1],
|
||||||
preds[w - stride],
|
preds[w - stride],
|
||||||
preds[w - stride - bpp]);
|
preds[w - stride - 1]);
|
||||||
out[w] = in[w] + (inverse ? pred : -pred);
|
out[w] = in[w] + (inverse ? pred : -pred);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
static void GradientFilter(const uint8_t* data, int width, int height,
|
static void GradientFilter(const uint8_t* data, int width, int height,
|
||||||
int bpp, int stride, uint8_t* filtered_data) {
|
int stride, uint8_t* filtered_data) {
|
||||||
DoGradientFilter(data, width, height, bpp, stride, 0, filtered_data);
|
DoGradientFilter(data, width, height, stride, 0, filtered_data);
|
||||||
}
|
}
|
||||||
|
|
||||||
static void GradientUnfilter(const uint8_t* data, int width, int height,
|
static void GradientUnfilter(int width, int height, int stride, uint8_t* data) {
|
||||||
int bpp, int stride, uint8_t* recon_data) {
|
DoGradientFilter(data, width, height, stride, 1, data);
|
||||||
DoGradientFilter(data, width, height, bpp, stride, 1, recon_data);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
#undef SANITY_CHECK
|
#undef SANITY_CHECK
|
||||||
@ -215,7 +214,7 @@ const WebPFilterFunc WebPFilters[WEBP_FILTER_LAST] = {
|
|||||||
GradientFilter // WEBP_FILTER_GRADIENT
|
GradientFilter // WEBP_FILTER_GRADIENT
|
||||||
};
|
};
|
||||||
|
|
||||||
const WebPFilterFunc WebPUnfilters[WEBP_FILTER_LAST] = {
|
const WebPUnfilterFunc WebPUnfilters[WEBP_FILTER_LAST] = {
|
||||||
NULL, // WEBP_FILTER_NONE
|
NULL, // WEBP_FILTER_NONE
|
||||||
HorizontalUnfilter, // WEBP_FILTER_HORIZONTAL
|
HorizontalUnfilter, // WEBP_FILTER_HORIZONTAL
|
||||||
VerticalUnfilter, // WEBP_FILTER_VERTICAL
|
VerticalUnfilter, // WEBP_FILTER_VERTICAL
|
||||||
|
@ -30,18 +30,19 @@ typedef enum {
|
|||||||
} WEBP_FILTER_TYPE;
|
} WEBP_FILTER_TYPE;
|
||||||
|
|
||||||
typedef void (*WebPFilterFunc)(const uint8_t* in, int width, int height,
|
typedef void (*WebPFilterFunc)(const uint8_t* in, int width, int height,
|
||||||
int bpp, int stride, uint8_t* out);
|
int stride, uint8_t* out);
|
||||||
|
typedef void (*WebPUnfilterFunc)(int width, int height, int stride,
|
||||||
|
uint8_t* data);
|
||||||
|
|
||||||
// Filter the given data using the given predictor.
|
// Filter the given data using the given predictor.
|
||||||
// 'in' corresponds to a 2-dimensional pixel array of size (stride * height)
|
// 'in' corresponds to a 2-dimensional pixel array of size (stride * height)
|
||||||
// in raster order.
|
// in raster order.
|
||||||
// 'bpp' is number of bytes per pixel, and
|
|
||||||
// 'stride' is number of bytes per scan line (with possible padding).
|
// 'stride' is number of bytes per scan line (with possible padding).
|
||||||
// 'out' should be pre-allocated.
|
// 'out' should be pre-allocated.
|
||||||
extern const WebPFilterFunc WebPFilters[WEBP_FILTER_LAST];
|
extern const WebPFilterFunc WebPFilters[WEBP_FILTER_LAST];
|
||||||
|
|
||||||
// Reconstruct the original data from the given filtered data.
|
// In-place reconstruct the original data from the given filtered data.
|
||||||
extern const WebPFilterFunc WebPUnfilters[WEBP_FILTER_LAST];
|
extern const WebPUnfilterFunc WebPUnfilters[WEBP_FILTER_LAST];
|
||||||
|
|
||||||
// Fast estimate of a potentially good filter.
|
// Fast estimate of a potentially good filter.
|
||||||
extern WEBP_FILTER_TYPE EstimateBestFilter(const uint8_t* data,
|
extern WEBP_FILTER_TYPE EstimateBestFilter(const uint8_t* data,
|
||||||
|
Loading…
Reference in New Issue
Block a user