# HG changeset patch # User conrad # Date 1279921577 0 # Node ID 112b3a0db187e50caaf7613f43d3f78967c1377b # Parent b8211cda076d85c525b2fd72160ff9d05c90a449 Decode DCT tokens by branching to a different code path for each branch on the huffman tree, instead of traversing the tree in a while loop. Based on the similar optimization in libvpx's detokenize.c 10% faster at normal bitrates, and 30% faster for high-bitrate intra-only diff -r b8211cda076d -r 112b3a0db187 vp56.h --- a/vp56.h Fri Jul 23 21:46:14 2010 +0000 +++ b/vp56.h Fri Jul 23 21:46:17 2010 +0000 @@ -226,6 +226,24 @@ return bit; } +// branchy variant, to be used where there's a branch based on the bit decoded +static av_always_inline int vp56_rac_get_prob_branchy(VP56RangeCoder *c, int prob) +{ + unsigned long code_word = vp56_rac_renorm(c); + unsigned low = 1 + (((c->high - 1) * prob) >> 8); + unsigned low_shift = low << 8; + + if (code_word >= low_shift) { + c->high -= low; + c->code_word = code_word - low_shift; + return 1; + } + + c->high = low; + c->code_word = code_word; + return 0; +} + static inline int vp56_rac_get(VP56RangeCoder *c) { unsigned int code_word = vp56_rac_renorm(c); diff -r b8211cda076d -r 112b3a0db187 vp8.c --- a/vp8.c Fri Jul 23 21:46:14 2010 +0000 +++ b/vp8.c Fri Jul 23 21:46:17 2010 +0000 @@ -800,36 +800,61 @@ uint8_t probs[8][3][NUM_DCT_TOKENS-1], int i, int zero_nhood, int16_t qmul[2]) { - int token, nonzero = 0; - int offset = 0; + uint8_t *token_prob; + int nonzero = 0; + int coeff; - for (; i < 16; i++) { - token = vp8_rac_get_tree_with_offset(c, vp8_coeff_tree, probs[vp8_coeff_band[i]][zero_nhood], offset); + do { + token_prob = probs[vp8_coeff_band[i]][zero_nhood]; - if (token == DCT_EOB) - break; - else if (token >= DCT_CAT1) { - int cat = token-DCT_CAT1; - token = vp8_rac_get_coeff(c, vp8_dct_cat_prob[cat]); - token += 3 + (2<