1233d2500723e5594f3e7c70896ffeeef32b9c950ywan/*
2233d2500723e5594f3e7c70896ffeeef32b9c950ywan *  Copyright (c) 2010 The WebM project authors. All Rights Reserved.
3233d2500723e5594f3e7c70896ffeeef32b9c950ywan *
4233d2500723e5594f3e7c70896ffeeef32b9c950ywan *  Use of this source code is governed by a BSD-style license
5233d2500723e5594f3e7c70896ffeeef32b9c950ywan *  that can be found in the LICENSE file in the root of the source
6233d2500723e5594f3e7c70896ffeeef32b9c950ywan *  tree. An additional intellectual property rights grant can be found
7233d2500723e5594f3e7c70896ffeeef32b9c950ywan *  in the file PATENTS.  All contributing project authors may
8233d2500723e5594f3e7c70896ffeeef32b9c950ywan *  be found in the AUTHORS file in the root of the source tree.
9233d2500723e5594f3e7c70896ffeeef32b9c950ywan */
10233d2500723e5594f3e7c70896ffeeef32b9c950ywan
11233d2500723e5594f3e7c70896ffeeef32b9c950ywan
12233d2500723e5594f3e7c70896ffeeef32b9c950ywan#include "treewriter.h"
13233d2500723e5594f3e7c70896ffeeef32b9c950ywan
14233d2500723e5594f3e7c70896ffeeef32b9c950ywanstatic void cost(
15233d2500723e5594f3e7c70896ffeeef32b9c950ywan    int *const C,
16233d2500723e5594f3e7c70896ffeeef32b9c950ywan    vp8_tree T,
17233d2500723e5594f3e7c70896ffeeef32b9c950ywan    const vp8_prob *const P,
18233d2500723e5594f3e7c70896ffeeef32b9c950ywan    int i,
19233d2500723e5594f3e7c70896ffeeef32b9c950ywan    int c
20233d2500723e5594f3e7c70896ffeeef32b9c950ywan)
21233d2500723e5594f3e7c70896ffeeef32b9c950ywan{
22233d2500723e5594f3e7c70896ffeeef32b9c950ywan    const vp8_prob p = P [i>>1];
23233d2500723e5594f3e7c70896ffeeef32b9c950ywan
24233d2500723e5594f3e7c70896ffeeef32b9c950ywan    do
25233d2500723e5594f3e7c70896ffeeef32b9c950ywan    {
26233d2500723e5594f3e7c70896ffeeef32b9c950ywan        const vp8_tree_index j = T[i];
27233d2500723e5594f3e7c70896ffeeef32b9c950ywan        const int d = c + vp8_cost_bit(p, i & 1);
28233d2500723e5594f3e7c70896ffeeef32b9c950ywan
29233d2500723e5594f3e7c70896ffeeef32b9c950ywan        if (j <= 0)
30233d2500723e5594f3e7c70896ffeeef32b9c950ywan            C[-j] = d;
31233d2500723e5594f3e7c70896ffeeef32b9c950ywan        else
32233d2500723e5594f3e7c70896ffeeef32b9c950ywan            cost(C, T, P, j, d);
33233d2500723e5594f3e7c70896ffeeef32b9c950ywan    }
34233d2500723e5594f3e7c70896ffeeef32b9c950ywan    while (++i & 1);
35233d2500723e5594f3e7c70896ffeeef32b9c950ywan}
36233d2500723e5594f3e7c70896ffeeef32b9c950ywanvoid vp8_cost_tokens(int *c, const vp8_prob *p, vp8_tree t)
37233d2500723e5594f3e7c70896ffeeef32b9c950ywan{
38233d2500723e5594f3e7c70896ffeeef32b9c950ywan    cost(c, t, p, 0, 0);
39233d2500723e5594f3e7c70896ffeeef32b9c950ywan}
40233d2500723e5594f3e7c70896ffeeef32b9c950ywanvoid vp8_cost_tokens2(int *c, const vp8_prob *p, vp8_tree t,int start)
41233d2500723e5594f3e7c70896ffeeef32b9c950ywan{
42233d2500723e5594f3e7c70896ffeeef32b9c950ywan    cost(c, t, p, start, 0);
43233d2500723e5594f3e7c70896ffeeef32b9c950ywan}
44