1 /* 2 * Copyright (c) 2013 The WebM project authors. All Rights Reserved. 3 * 4 * Use of this source code is governed by a BSD-style license 5 * that can be found in the LICENSE file in the root of the source 6 * tree. An additional intellectual property rights grant can be found 7 * in the file PATENTS. All contributing project authors may 8 * be found in the AUTHORS file in the root of the source tree. 9 */ 10 11 #include "vp9/common/vp9_prob.h" 12 13 const uint8_t vp9_norm[256] = { 14 0, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 15 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 16 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 17 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 18 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 19 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 20 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 21 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 22 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 23 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 24 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 25 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 26 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 27 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 28 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 29 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 30 }; 31 32 33 static unsigned int tree_merge_probs_impl(unsigned int i, 34 const vp9_tree_index *tree, 35 const vp9_prob *pre_probs, 36 const unsigned int *counts, 37 unsigned int count_sat, 38 unsigned int max_update, 39 vp9_prob *probs) { 40 const int l = tree[i]; 41 const unsigned int left_count = (l <= 0) 42 ? counts[-l] 43 : tree_merge_probs_impl(l, tree, pre_probs, counts, 44 count_sat, max_update, probs); 45 const int r = tree[i + 1]; 46 const unsigned int right_count = (r <= 0) 47 ? counts[-r] 48 : tree_merge_probs_impl(r, tree, pre_probs, counts, 49 count_sat, max_update, probs); 50 const unsigned int ct[2] = { left_count, right_count }; 51 probs[i >> 1] = merge_probs(pre_probs[i >> 1], ct, 52 count_sat, max_update); 53 return left_count + right_count; 54 } 55 56 void vp9_tree_merge_probs(const vp9_tree_index *tree, const vp9_prob *pre_probs, 57 const unsigned int *counts, unsigned int count_sat, 58 unsigned int max_update_factor, vp9_prob *probs) { 59 tree_merge_probs_impl(0, tree, pre_probs, counts, count_sat, 60 max_update_factor, probs); 61 } 62
