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 49 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
60 int skip_optimize; | 60 int skip_optimize; |
61 int q_index; | 61 int q_index; |
62 | 62 |
63 int errorperbit; | 63 int errorperbit; |
64 int sadperbit16; | 64 int sadperbit16; |
65 int sadperbit4; | 65 int sadperbit4; |
66 int rddiv; | 66 int rddiv; |
67 int rdmult; | 67 int rdmult; |
68 int mb_energy; | 68 int mb_energy; |
69 | 69 |
| 70 // These are set to their default values at the beginning, and then adjusted |
| 71 // further in the encoding process. |
| 72 BLOCK_SIZE min_partition_size; |
| 73 BLOCK_SIZE max_partition_size; |
| 74 |
70 int mv_best_ref_index[MAX_REF_FRAMES]; | 75 int mv_best_ref_index[MAX_REF_FRAMES]; |
71 unsigned int max_mv_context[MAX_REF_FRAMES]; | 76 unsigned int max_mv_context[MAX_REF_FRAMES]; |
72 unsigned int source_variance; | 77 unsigned int source_variance; |
73 unsigned int pred_sse[MAX_REF_FRAMES]; | 78 unsigned int pred_sse[MAX_REF_FRAMES]; |
74 int pred_mv_sad[MAX_REF_FRAMES]; | 79 int pred_mv_sad[MAX_REF_FRAMES]; |
75 | 80 |
76 int nmvjointcost[MV_JOINTS]; | 81 int nmvjointcost[MV_JOINTS]; |
77 int *nmvcost[2]; | 82 int *nmvcost[2]; |
78 int *nmvcost_hp[2]; | 83 int *nmvcost_hp[2]; |
79 int **mvcost; | 84 int **mvcost; |
(...skipping 11 matching lines...) Expand all Loading... |
91 int mv_row_max; | 96 int mv_row_max; |
92 | 97 |
93 uint8_t zcoeff_blk[TX_SIZES][256]; | 98 uint8_t zcoeff_blk[TX_SIZES][256]; |
94 int skip; | 99 int skip; |
95 | 100 |
96 int encode_breakout; | 101 int encode_breakout; |
97 | 102 |
98 // note that token_costs is the cost when eob node is skipped | 103 // note that token_costs is the cost when eob node is skipped |
99 vp9_coeff_cost token_costs[TX_SIZES]; | 104 vp9_coeff_cost token_costs[TX_SIZES]; |
100 | 105 |
101 int in_static_area; | |
102 | |
103 int optimize; | 106 int optimize; |
104 | 107 |
105 // indicate if it is in the rd search loop or encoding process | 108 // indicate if it is in the rd search loop or encoding process |
106 int use_lp32x32fdct; | 109 int use_lp32x32fdct; |
107 int skip_encode; | 110 int skip_encode; |
108 | 111 |
109 // use fast quantization process | 112 // use fast quantization process |
110 int quant_fp; | 113 int quant_fp; |
111 | 114 |
112 // skip forward transform and quantization | 115 // skip forward transform and quantization |
(...skipping 10 matching lines...) Expand all Loading... |
123 void (*highbd_itxm_add)(const tran_low_t *input, uint8_t *dest, int stride, | 126 void (*highbd_itxm_add)(const tran_low_t *input, uint8_t *dest, int stride, |
124 int eob, int bd); | 127 int eob, int bd); |
125 #endif | 128 #endif |
126 }; | 129 }; |
127 | 130 |
128 #ifdef __cplusplus | 131 #ifdef __cplusplus |
129 } // extern "C" | 132 } // extern "C" |
130 #endif | 133 #endif |
131 | 134 |
132 #endif // VP9_ENCODER_VP9_BLOCK_H_ | 135 #endif // VP9_ENCODER_VP9_BLOCK_H_ |
OLD | NEW |