From 9699b3a2d7ebc62ae58c4e70997190f5f7b45d27 Mon Sep 17 00:00:00 2001 From: Alberto Delmás Date: Mon, 3 Sep 2012 17:32:01 +0200 Subject: mss12: avoid unnecessary division in arith*_get_bit() That division can be replaced with a comparison: ((c->value - c->low) << 1) + 1 >= range By expanding 'range' definition and simplifying this inequation we obtain the final expression. Suggested by Michael Niedermayer Signed-off-by: Kostya Shishkov --- libavcodec/mss12.h | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'libavcodec/mss12.h') diff --git a/libavcodec/mss12.h b/libavcodec/mss12.h index 678a0c0dfb..f5d03662b8 100644 --- a/libavcodec/mss12.h +++ b/libavcodec/mss12.h @@ -103,7 +103,7 @@ av_cold int ff_mss12_decode_end(MSS12Context *ctx); static int arith ## VERSION ## _get_bit(ArithCoder *c) \ { \ int range = c->high - c->low + 1; \ - int bit = (((c->value - c->low) << 1) + 1) / range; \ + int bit = 2 * c->value - c->low >= c->high; \ \ if (bit) \ c->low += range >> 1; \ -- cgit v1.2.3