summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorJerome Jiang <jianj@google.com>2019-06-03 10:11:34 -0700
committerJerome Jiang <jianj@google.com>2019-06-03 10:11:34 -0700
commit42a83da94cf6144d067fd047d1a02bf135401b9f (patch)
tree219c167dc3578289c249da94a808f5d9c06dc134
parentda24d35132e80422dc2c33e7c92462f4db7cd83d (diff)
downloadlibvpx-42a83da94cf6144d067fd047d1a02bf135401b9f.tar
libvpx-42a83da94cf6144d067fd047d1a02bf135401b9f.tar.gz
libvpx-42a83da94cf6144d067fd047d1a02bf135401b9f.tar.bz2
libvpx-42a83da94cf6144d067fd047d1a02bf135401b9f.zip
Remove unused func for CONFIG_REALTIME_ONLY
Change-Id: I503e147e20e5b69b910c425d169e59821874f627
-rw-r--r--vp9/encoder/vp9_rdopt.c4
1 files changed, 1 insertions, 3 deletions
diff --git a/vp9/encoder/vp9_rdopt.c b/vp9/encoder/vp9_rdopt.c
index abe6caa59..9a9cf6996 100644
--- a/vp9/encoder/vp9_rdopt.c
+++ b/vp9/encoder/vp9_rdopt.c
@@ -1764,6 +1764,7 @@ typedef struct {
int mvthresh;
} BEST_SEG_INFO;
+#if !CONFIG_REALTIME_ONLY
static INLINE int mv_check_bounds(const MvLimits *mv_limits, const MV *mv) {
return (mv->row >> 3) < mv_limits->row_min ||
(mv->row >> 3) > mv_limits->row_max ||
@@ -1799,7 +1800,6 @@ static INLINE int mv_has_subpel(const MV *mv) {
return (mv->row & 0x0F) || (mv->col & 0x0F);
}
-#if !CONFIG_REALTIME_ONLY
// Check if NEARESTMV/NEARMV/ZEROMV is the cheapest way encode zero motion.
// TODO(aconverse): Find out if this is still productive then clean up or remove
static int check_best_zero_mv(const VP9_COMP *cpi,
@@ -2661,7 +2661,6 @@ static void single_motion_search(VP9_COMP *cpi, MACROBLOCK *x, BLOCK_SIZE bsize,
for (i = 0; i < MAX_MB_PLANE; i++) xd->plane[i].pre[0] = backup_yv12[i];
}
}
-#endif // !CONFIG_REALTIME_ONLY
static INLINE void restore_dst_buf(MACROBLOCKD *xd,
uint8_t *orig_dst[MAX_MB_PLANE],
@@ -2673,7 +2672,6 @@ static INLINE void restore_dst_buf(MACROBLOCKD *xd,
}
}
-#if !CONFIG_REALTIME_ONLY
// In some situations we want to discount tha pparent cost of a new motion
// vector. Where there is a subtle motion field and especially where there is
// low spatial complexity then it can be hard to cover the cost of a new motion