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 158 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
169 // (except for the initial transmission of the segmentation). The feature is | 169 // (except for the initial transmission of the segmentation). The feature is |
170 // disabled because the addition of very large block sizes make the | 170 // disabled because the addition of very large block sizes make the |
171 // backgrounds very to cheap to encode, and the segmentation we have | 171 // backgrounds very to cheap to encode, and the segmentation we have |
172 // adds overhead. | 172 // adds overhead. |
173 int static_segmentation; | 173 int static_segmentation; |
174 | 174 |
175 // If 1 we iterate finding a best reference for 2 ref frames together - via | 175 // If 1 we iterate finding a best reference for 2 ref frames together - via |
176 // a log search that iterates 4 times (check around mv for last for best | 176 // a log search that iterates 4 times (check around mv for last for best |
177 // error of combined predictor then check around mv for alt). If 0 we | 177 // error of combined predictor then check around mv for alt). If 0 we |
178 // we just use the best motion vector found for each frame by itself. | 178 // we just use the best motion vector found for each frame by itself. |
179 int comp_inter_joint_search_thresh; | 179 BLOCK_SIZE comp_inter_joint_search_thresh; |
180 | 180 |
181 // This variable is used to cap the maximum number of times we skip testing a | 181 // This variable is used to cap the maximum number of times we skip testing a |
182 // mode to be evaluated. A high value means we will be faster. | 182 // mode to be evaluated. A high value means we will be faster. |
183 int adaptive_rd_thresh; | 183 int adaptive_rd_thresh; |
184 | 184 |
185 // Enables skipping the reconstruction step (idct, recon) in the | 185 // Enables skipping the reconstruction step (idct, recon) in the |
186 // intermediate steps assuming the last frame didn't have too many intra | 186 // intermediate steps assuming the last frame didn't have too many intra |
187 // blocks and the q is less than a threshold. | 187 // blocks and the q is less than a threshold. |
188 int skip_encode_sb; | 188 int skip_encode_sb; |
189 int skip_encode_frame; | 189 int skip_encode_frame; |
(...skipping 163 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
353 struct VP9_COMP; | 353 struct VP9_COMP; |
354 | 354 |
355 void vp9_set_speed_features(struct VP9_COMP *cpi); | 355 void vp9_set_speed_features(struct VP9_COMP *cpi); |
356 | 356 |
357 #ifdef __cplusplus | 357 #ifdef __cplusplus |
358 } // extern "C" | 358 } // extern "C" |
359 #endif | 359 #endif |
360 | 360 |
361 #endif // VP9_ENCODER_VP9_SPEED_FEATURES_H_ | 361 #endif // VP9_ENCODER_VP9_SPEED_FEATURES_H_ |
362 | 362 |
OLD | NEW |