| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (c) 2010 The WebM 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 |
| (...skipping 16 matching lines...) Expand all Loading... |
| 27 static int treed_read(vp9_reader *const r, /* !!! must return a 0 or 1 !!! */ | 27 static int treed_read(vp9_reader *const r, /* !!! must return a 0 or 1 !!! */ |
| 28 vp9_tree t, | 28 vp9_tree t, |
| 29 const vp9_prob *const p) { | 29 const vp9_prob *const p) { |
| 30 register vp9_tree_index i = 0; | 30 register vp9_tree_index i = 0; |
| 31 | 31 |
| 32 while ((i = t[ i + vp9_read(r, p[i >> 1])]) > 0); | 32 while ((i = t[ i + vp9_read(r, p[i >> 1])]) > 0); |
| 33 | 33 |
| 34 return -i; | 34 return -i; |
| 35 } | 35 } |
| 36 | 36 |
| 37 #endif /* tree_reader_h */ | 37 #endif // VP9_DECODER_VP9_TREEREADER_H_ |
| OLD | NEW |