2010-05-18 17:58:33 +02:00
|
|
|
/*
|
2010-09-09 14:16:39 +02:00
|
|
|
* Copyright (c) 2010 The WebM project authors. All Rights Reserved.
|
2010-05-18 17:58:33 +02:00
|
|
|
*
|
2010-06-18 18:39:21 +02:00
|
|
|
* Use of this source code is governed by a BSD-style license
|
2010-06-04 22:19:40 +02:00
|
|
|
* that can be found in the LICENSE file in the root of the source
|
|
|
|
* tree. An additional intellectual property rights grant can be found
|
2010-06-18 18:39:21 +02:00
|
|
|
* in the file PATENTS. All contributing project authors may
|
2010-06-04 22:19:40 +02:00
|
|
|
* be found in the AUTHORS file in the root of the source tree.
|
2010-05-18 17:58:33 +02:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include "treewriter.h"
|
|
|
|
|
2016-07-14 07:26:28 +02:00
|
|
|
static void cost(int *const C, vp8_tree T, const vp8_prob *const P, int i,
|
|
|
|
int c) {
|
|
|
|
const vp8_prob p = P[i >> 1];
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2016-07-14 07:26:28 +02:00
|
|
|
do {
|
|
|
|
const vp8_tree_index j = T[i];
|
|
|
|
const int d = c + vp8_cost_bit(p, i & 1);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2016-07-19 08:15:57 +02:00
|
|
|
if (j <= 0) {
|
2016-07-14 07:26:28 +02:00
|
|
|
C[-j] = d;
|
2016-07-19 08:15:57 +02:00
|
|
|
} else {
|
2016-07-14 07:26:28 +02:00
|
|
|
cost(C, T, P, j, d);
|
2016-07-19 08:15:57 +02:00
|
|
|
}
|
2016-07-14 07:26:28 +02:00
|
|
|
} while (++i & 1);
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
2016-07-14 07:26:28 +02:00
|
|
|
void vp8_cost_tokens(int *c, const vp8_prob *p, vp8_tree t) {
|
|
|
|
cost(c, t, p, 0, 0);
|
2010-05-18 17:58:33 +02:00
|
|
|
}
|
2016-07-14 07:26:28 +02:00
|
|
|
void vp8_cost_tokens2(int *c, const vp8_prob *p, vp8_tree t, int start) {
|
|
|
|
cost(c, t, p, start, 0);
|
2012-03-05 17:20:42 +01:00
|
|
|
}
|