| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (c) 2014 The WebM project authors. All Rights Reserved. | 2 * Copyright (c) 2014 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 364 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 375 for (j = 0; j < TX_SIZES; j++) | 375 for (j = 0; j < TX_SIZES; j++) |
| 376 cm->counts.tx.p32x32[i][j] += counts->tx.p32x32[i][j]; | 376 cm->counts.tx.p32x32[i][j] += counts->tx.p32x32[i][j]; |
| 377 | 377 |
| 378 for (j = 0; j < TX_SIZES - 1; j++) | 378 for (j = 0; j < TX_SIZES - 1; j++) |
| 379 cm->counts.tx.p16x16[i][j] += counts->tx.p16x16[i][j]; | 379 cm->counts.tx.p16x16[i][j] += counts->tx.p16x16[i][j]; |
| 380 | 380 |
| 381 for (j = 0; j < TX_SIZES - 2; j++) | 381 for (j = 0; j < TX_SIZES - 2; j++) |
| 382 cm->counts.tx.p8x8[i][j] += counts->tx.p8x8[i][j]; | 382 cm->counts.tx.p8x8[i][j] += counts->tx.p8x8[i][j]; |
| 383 } | 383 } |
| 384 | 384 |
| 385 for (i = 0; i < TX_SIZES; i++) |
| 386 cm->counts.tx.tx_totals[i] += counts->tx.tx_totals[i]; |
| 387 |
| 385 for (i = 0; i < SKIP_CONTEXTS; i++) | 388 for (i = 0; i < SKIP_CONTEXTS; i++) |
| 386 for (j = 0; j < 2; j++) | 389 for (j = 0; j < 2; j++) |
| 387 cm->counts.skip[i][j] += counts->skip[i][j]; | 390 cm->counts.skip[i][j] += counts->skip[i][j]; |
| 388 | 391 |
| 389 for (i = 0; i < MV_JOINTS; i++) | 392 for (i = 0; i < MV_JOINTS; i++) |
| 390 cm->counts.mv.joints[i] += counts->mv.joints[i]; | 393 cm->counts.mv.joints[i] += counts->mv.joints[i]; |
| 391 | 394 |
| 392 for (k = 0; k < 2; k++) { | 395 for (k = 0; k < 2; k++) { |
| 393 nmv_component_counts *comps = &cm->counts.mv.comps[k]; | 396 nmv_component_counts *comps = &cm->counts.mv.comps[k]; |
| 394 nmv_component_counts *comps_t = &counts->mv.comps[k]; | 397 nmv_component_counts *comps_t = &counts->mv.comps[k]; |
| (...skipping 14 matching lines...) Expand all Loading... |
| 409 } | 412 } |
| 410 | 413 |
| 411 for (i = 0; i < MV_OFFSET_BITS; i++) | 414 for (i = 0; i < MV_OFFSET_BITS; i++) |
| 412 for (j = 0; j < 2; j++) | 415 for (j = 0; j < 2; j++) |
| 413 comps->bits[i][j] += comps_t->bits[i][j]; | 416 comps->bits[i][j] += comps_t->bits[i][j]; |
| 414 | 417 |
| 415 for (i = 0; i < MV_FP_SIZE; i++) | 418 for (i = 0; i < MV_FP_SIZE; i++) |
| 416 comps->fp[i] += comps_t->fp[i]; | 419 comps->fp[i] += comps_t->fp[i]; |
| 417 } | 420 } |
| 418 } | 421 } |
| OLD | NEW |