2010-05-18 17:58:33 +02:00
|
|
|
/*
|
2010-09-09 14:16:39 +02:00
|
|
|
* Copyright (c) 2010 The WebM project authors. All Rights Reserved.
|
2010-05-18 17:58:33 +02:00
|
|
|
*
|
2010-06-18 18:39:21 +02:00
|
|
|
* Use of this source code is governed by a BSD-style license
|
2010-06-04 22:19:40 +02:00
|
|
|
* that can be found in the LICENSE file in the root of the source
|
|
|
|
* tree. An additional intellectual property rights grant can be found
|
2010-06-18 18:39:21 +02:00
|
|
|
* in the file PATENTS. All contributing project authors may
|
2010-06-04 22:19:40 +02:00
|
|
|
* be found in the AUTHORS file in the root of the source tree.
|
2010-05-18 17:58:33 +02:00
|
|
|
*/
|
|
|
|
|
2012-11-30 01:36:10 +01:00
|
|
|
#ifndef VP9_COMMON_VP9_COMMON_H_
|
|
|
|
#define VP9_COMMON_VP9_COMMON_H_
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
/* Interface header for common constant data structures and lookup tables */
|
|
|
|
|
2013-03-05 23:12:16 +01:00
|
|
|
#include <assert.h>
|
|
|
|
|
|
|
|
#include "./vpx_config.h"
|
2010-05-18 17:58:33 +02:00
|
|
|
#include "vpx_mem/vpx_mem.h"
|
Consistently use get_prob(), clip_prob() and newly added clip_pixel().
Add a function clip_pixel() to clip a pixel value to the [0,255] range
of allowed values, and use this where-ever appropriate (e.g. prediction,
reconstruction). Likewise, consistently use the recently added function
clip_prob(), which calculates a binary probability in the [1,255] range.
If possible, try to use get_prob() or its sister get_binary_prob() to
calculate binary probabilities, for consistency.
Since in some places, this means that binary probability calculations
are changed (we use {255,256}*count0/(total) in a range of places,
and all of these are now changed to use 256*count0+(total>>1)/total),
this changes the encoding result, so this patch warrants some extensive
testing.
Change-Id: Ibeeff8d886496839b8e0c0ace9ccc552351f7628
2012-12-10 21:09:07 +01:00
|
|
|
#include "vpx/vpx_integer.h"
|
2014-02-03 21:12:01 +01:00
|
|
|
#include "vp9/common/vp9_systemdependent.h"
|
2012-12-19 00:31:19 +01:00
|
|
|
|
2014-01-18 21:16:11 +01:00
|
|
|
#ifdef __cplusplus
|
|
|
|
extern "C" {
|
|
|
|
#endif
|
|
|
|
|
2013-01-06 03:20:25 +01:00
|
|
|
#define MIN(x, y) (((x) < (y)) ? (x) : (y))
|
|
|
|
#define MAX(x, y) (((x) > (y)) ? (x) : (y))
|
|
|
|
|
2013-07-08 23:54:04 +02:00
|
|
|
#define ROUND_POWER_OF_TWO(value, n) \
|
|
|
|
(((value) + (1 << ((n) - 1))) >> (n))
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2013-07-08 23:54:04 +02:00
|
|
|
#define ALIGN_POWER_OF_TWO(value, n) \
|
|
|
|
(((value) + ((1 << (n)) - 1)) & ~((1 << (n)) - 1))
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2013-03-07 21:24:35 +01:00
|
|
|
// Only need this for fixed-size arrays, for structs just assign.
|
|
|
|
#define vp9_copy(dest, src) { \
|
|
|
|
assert(sizeof(dest) == sizeof(src)); \
|
|
|
|
vpx_memcpy(dest, src, sizeof(src)); \
|
2012-07-14 00:21:29 +02:00
|
|
|
}
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2013-03-07 21:24:35 +01:00
|
|
|
// Use this for variably-sized arrays.
|
|
|
|
#define vp9_copy_array(dest, src, n) { \
|
|
|
|
assert(sizeof(*dest) == sizeof(*src)); \
|
|
|
|
vpx_memcpy(dest, src, n * sizeof(*src)); \
|
|
|
|
}
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2013-10-16 01:09:28 +02:00
|
|
|
#define vp9_zero(dest) vpx_memset(&dest, 0, sizeof(dest))
|
|
|
|
#define vp9_zero_array(dest, n) vpx_memset(dest, 0, n * sizeof(*dest))
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2013-02-06 21:45:28 +01:00
|
|
|
static INLINE uint8_t clip_pixel(int val) {
|
Consistently use get_prob(), clip_prob() and newly added clip_pixel().
Add a function clip_pixel() to clip a pixel value to the [0,255] range
of allowed values, and use this where-ever appropriate (e.g. prediction,
reconstruction). Likewise, consistently use the recently added function
clip_prob(), which calculates a binary probability in the [1,255] range.
If possible, try to use get_prob() or its sister get_binary_prob() to
calculate binary probabilities, for consistency.
Since in some places, this means that binary probability calculations
are changed (we use {255,256}*count0/(total) in a range of places,
and all of these are now changed to use 256*count0+(total>>1)/total),
this changes the encoding result, so this patch warrants some extensive
testing.
Change-Id: Ibeeff8d886496839b8e0c0ace9ccc552351f7628
2012-12-10 21:09:07 +01:00
|
|
|
return (val > 255) ? 255u : (val < 0) ? 0u : val;
|
|
|
|
}
|
|
|
|
|
2013-03-12 01:02:27 +01:00
|
|
|
static INLINE int clamp(int value, int low, int high) {
|
|
|
|
return value < low ? low : (value > high ? high : value);
|
|
|
|
}
|
|
|
|
|
2013-05-09 03:13:46 +02:00
|
|
|
static INLINE double fclamp(double value, double low, double high) {
|
|
|
|
return value < low ? low : (value > high ? high : value);
|
|
|
|
}
|
|
|
|
|
2014-02-03 21:12:01 +01:00
|
|
|
static INLINE int get_unsigned_bits(unsigned int num_values) {
|
|
|
|
return num_values > 0 ? get_msb(num_values) + 1 : 0;
|
2013-06-25 20:52:44 +02:00
|
|
|
}
|
|
|
|
|
2013-06-28 19:36:20 +02:00
|
|
|
#if CONFIG_DEBUG
|
|
|
|
#define CHECK_MEM_ERROR(cm, lval, expr) do { \
|
|
|
|
lval = (expr); \
|
|
|
|
if (!lval) \
|
|
|
|
vpx_internal_error(&cm->error, VPX_CODEC_MEM_ERROR, \
|
|
|
|
"Failed to allocate "#lval" at %s:%d", \
|
|
|
|
__FILE__, __LINE__); \
|
|
|
|
} while (0)
|
|
|
|
#else
|
|
|
|
#define CHECK_MEM_ERROR(cm, lval, expr) do { \
|
|
|
|
lval = (expr); \
|
|
|
|
if (!lval) \
|
|
|
|
vpx_internal_error(&cm->error, VPX_CODEC_MEM_ERROR, \
|
|
|
|
"Failed to allocate "#lval); \
|
|
|
|
} while (0)
|
|
|
|
#endif
|
|
|
|
|
2013-10-24 02:24:17 +02:00
|
|
|
#define VP9_SYNC_CODE_0 0x49
|
|
|
|
#define VP9_SYNC_CODE_1 0x83
|
|
|
|
#define VP9_SYNC_CODE_2 0x42
|
|
|
|
|
|
|
|
#define VP9_FRAME_MARKER 0x2
|
2013-05-29 03:07:54 +02:00
|
|
|
|
|
|
|
|
2014-01-18 21:16:11 +01:00
|
|
|
#ifdef __cplusplus
|
|
|
|
} // extern "C"
|
|
|
|
#endif
|
|
|
|
|
2012-12-19 00:31:19 +01:00
|
|
|
#endif // VP9_COMMON_VP9_COMMON_H_
|