| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (c) 2010 The VP8 project authors. All Rights Reserved. | 2 * Copyright (c) 2010 The WebM project authors. All Rights Reserved. |
| 3 * | 3 * |
| 4 * Use of this source code is governed by a BSD-style license | 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 | 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 | 6 * tree. An additional intellectual property rights grant can be found |
| 7 * in the file PATENTS. All contributing project authors may | 7 * in the file PATENTS. All contributing project authors may |
| 8 * be found in the AUTHORS file in the root of the source tree. | 8 * be found in the AUTHORS file in the root of the source tree. |
| 9 */ | 9 */ |
| 10 | 10 |
| 11 | 11 |
| 12 #if CONFIG_DEBUG | 12 #if CONFIG_DEBUG |
| (...skipping 121 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 134 if (tot) | 134 if (tot) |
| 135 { | 135 { |
| 136 const unsigned int p = ((c[0] * Pfac) + (rd ? tot >> 1 : 0)) / tot; | 136 const unsigned int p = ((c[0] * Pfac) + (rd ? tot >> 1 : 0)) / tot; |
| 137 probs[t] = p < 256 ? (p ? p : 1) : 255; /* agree w/old version for n
ow */ | 137 probs[t] = p < 256 ? (p ? p : 1) : 255; /* agree w/old version for n
ow */ |
| 138 } | 138 } |
| 139 else | 139 else |
| 140 probs[t] = vp8_prob_half; | 140 probs[t] = vp8_prob_half; |
| 141 } | 141 } |
| 142 while (++t < tree_len); | 142 while (++t < tree_len); |
| 143 } | 143 } |
| OLD | NEW |