| OLD | NEW |
| 1 | 1 |
| 2 /* | 2 /* |
| 3 * Copyright (c) 2012 The WebM project authors. All Rights Reserved. | 3 * Copyright (c) 2012 The WebM project authors. All Rights Reserved. |
| 4 * | 4 * |
| 5 * Use of this source code is governed by a BSD-style license | 5 * Use of this source code is governed by a BSD-style license |
| 6 * that can be found in the LICENSE file in the root of the source | 6 * that can be found in the LICENSE file in the root of the source |
| 7 * tree. An additional intellectual property rights grant can be found | 7 * tree. An additional intellectual property rights grant can be found |
| 8 * in the file PATENTS. All contributing project authors may | 8 * in the file PATENTS. All contributing project authors may |
| 9 * be found in the AUTHORS file in the root of the source tree. | 9 * be found in the AUTHORS file in the root of the source tree. |
| 10 */ | 10 */ |
| (...skipping 205 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 216 | 216 |
| 217 nearest_mv->as_int = bmi[2].as_mv[ref].as_int; | 217 nearest_mv->as_int = bmi[2].as_mv[ref].as_int; |
| 218 for (n = 0; n < 2 + MAX_MV_REF_CANDIDATES; ++n) | 218 for (n = 0; n < 2 + MAX_MV_REF_CANDIDATES; ++n) |
| 219 if (nearest_mv->as_int != candidates[n].as_int) { | 219 if (nearest_mv->as_int != candidates[n].as_int) { |
| 220 near_mv->as_int = candidates[n].as_int; | 220 near_mv->as_int = candidates[n].as_int; |
| 221 break; | 221 break; |
| 222 } | 222 } |
| 223 break; | 223 break; |
| 224 } | 224 } |
| 225 default: | 225 default: |
| 226 assert("Invalid block index."); | 226 assert(0 && "Invalid block index."); |
| 227 } | 227 } |
| 228 } | 228 } |
| OLD | NEW |