| 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 16 matching lines...) Expand all Loading... |
| 27 | 27 |
| 28 // dual buffer pointers, 0: in use, 1: best in store | 28 // dual buffer pointers, 0: in use, 1: best in store |
| 29 tran_low_t *coeff_pbuf[MAX_MB_PLANE][3]; | 29 tran_low_t *coeff_pbuf[MAX_MB_PLANE][3]; |
| 30 tran_low_t *qcoeff_pbuf[MAX_MB_PLANE][3]; | 30 tran_low_t *qcoeff_pbuf[MAX_MB_PLANE][3]; |
| 31 tran_low_t *dqcoeff_pbuf[MAX_MB_PLANE][3]; | 31 tran_low_t *dqcoeff_pbuf[MAX_MB_PLANE][3]; |
| 32 uint16_t *eobs_pbuf[MAX_MB_PLANE][3]; | 32 uint16_t *eobs_pbuf[MAX_MB_PLANE][3]; |
| 33 | 33 |
| 34 int is_coded; | 34 int is_coded; |
| 35 int num_4x4_blk; | 35 int num_4x4_blk; |
| 36 int skip; | 36 int skip; |
| 37 int pred_pixel_ready; |
| 37 // For current partition, only if all Y, U, and V transform blocks' | 38 // For current partition, only if all Y, U, and V transform blocks' |
| 38 // coefficients are quantized to 0, skippable is set to 0. | 39 // coefficients are quantized to 0, skippable is set to 0. |
| 39 int skippable; | 40 int skippable; |
| 40 uint8_t skip_txfm[MAX_MB_PLANE << 2]; | 41 uint8_t skip_txfm[MAX_MB_PLANE << 2]; |
| 41 int best_mode_index; | 42 int best_mode_index; |
| 42 int hybrid_pred_diff; | 43 int hybrid_pred_diff; |
| 43 int comp_pred_diff; | 44 int comp_pred_diff; |
| 44 int single_pred_diff; | 45 int single_pred_diff; |
| 45 int64_t tx_rd_diff[TX_MODES]; | 46 int64_t tx_rd_diff[TX_MODES]; |
| 46 int64_t best_filter_diff[SWITCHABLE_FILTER_CONTEXTS]; | 47 int64_t best_filter_diff[SWITCHABLE_FILTER_CONTEXTS]; |
| 47 | 48 |
| 49 // TODO(jingning) Use RD_COST struct here instead. This involves a boarder |
| 50 // scope of refactoring. |
| 51 int rate; |
| 52 int64_t dist; |
| 53 |
| 48 #if CONFIG_VP9_TEMPORAL_DENOISING | 54 #if CONFIG_VP9_TEMPORAL_DENOISING |
| 49 unsigned int newmv_sse; | 55 unsigned int newmv_sse; |
| 50 unsigned int zeromv_sse; | 56 unsigned int zeromv_sse; |
| 51 PREDICTION_MODE best_sse_inter_mode; | 57 PREDICTION_MODE best_sse_inter_mode; |
| 52 int_mv best_sse_mv; | 58 int_mv best_sse_mv; |
| 53 MV_REFERENCE_FRAME best_reference_frame; | 59 MV_REFERENCE_FRAME best_reference_frame; |
| 54 MV_REFERENCE_FRAME best_zeromv_reference_frame; | 60 MV_REFERENCE_FRAME best_zeromv_reference_frame; |
| 55 #endif | 61 #endif |
| 56 | 62 |
| 57 // motion vector cache for adaptive motion search control in partition | 63 // motion vector cache for adaptive motion search control in partition |
| (...skipping 12 matching lines...) Expand all Loading... |
| 70 union { | 76 union { |
| 71 struct PC_TREE *split[4]; | 77 struct PC_TREE *split[4]; |
| 72 PICK_MODE_CONTEXT *leaf_split[4]; | 78 PICK_MODE_CONTEXT *leaf_split[4]; |
| 73 }; | 79 }; |
| 74 } PC_TREE; | 80 } PC_TREE; |
| 75 | 81 |
| 76 void vp9_setup_pc_tree(struct VP9Common *cm, struct VP9_COMP *cpi); | 82 void vp9_setup_pc_tree(struct VP9Common *cm, struct VP9_COMP *cpi); |
| 77 void vp9_free_pc_tree(struct VP9_COMP *cpi); | 83 void vp9_free_pc_tree(struct VP9_COMP *cpi); |
| 78 | 84 |
| 79 #endif /* VP9_ENCODER_VP9_CONTEXT_TREE_H_ */ | 85 #endif /* VP9_ENCODER_VP9_CONTEXT_TREE_H_ */ |
| OLD | NEW |