1 /* 2 * Copyright (c) 2010 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 "treewriter.h" 12 13 static void cost(int *const C, vp8_tree T, const vp8_prob *const P, int i, 14 int c) { 15 const vp8_prob p = P[i >> 1]; 16 17 do { 18 const vp8_tree_index j = T[i]; 19 const int d = c + vp8_cost_bit(p, i & 1); 20 21 if (j <= 0) { 22 C[-j] = d; 23 } else { 24 cost(C, T, P, j, d); 25 } 26 } while (++i & 1); 27 } 28 void vp8_cost_tokens(int *c, const vp8_prob *p, vp8_tree t) { 29 cost(c, t, p, 0, 0); 30 } 31 void vp8_cost_tokens2(int *c, const vp8_prob *p, vp8_tree t, int start) { 32 cost(c, t, p, start, 0); 33 } 34
