| 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 |
| 11 #include <assert.h> | 11 #include <assert.h> |
| 12 #include <limits.h> | 12 #include <limits.h> |
| 13 | 13 |
| 14 #include "./vpx_scale_rtcd.h" | 14 #include "./vpx_scale_rtcd.h" |
| 15 | 15 |
| 16 #include "vpx_mem/vpx_mem.h" | 16 #include "vpx_mem/vpx_mem.h" |
| 17 | 17 |
| 18 #include "vp9/common/vp9_loopfilter.h" | 18 #include "vp9/common/vp9_loopfilter.h" |
| 19 #include "vp9/common/vp9_onyxc_int.h" | 19 #include "vp9/common/vp9_onyxc_int.h" |
| 20 #include "vp9/common/vp9_quant_common.h" | 20 #include "vp9/common/vp9_quant_common.h" |
| 21 | 21 |
| 22 #include "vp9/encoder/vp9_encoder.h" | 22 #include "vp9/encoder/vp9_encoder.h" |
| 23 #include "vp9/encoder/vp9_picklpf.h" | 23 #include "vp9/encoder/vp9_picklpf.h" |
| 24 #include "vp9/encoder/vp9_quantize.h" | 24 #include "vp9/encoder/vp9_quantize.h" |
| 25 | 25 |
| 26 static int get_max_filter_level(const VP9_COMP *cpi) { | 26 static int get_max_filter_level(const VP9_COMP *cpi) { |
| 27 if (cpi->pass == 2) { | 27 if (cpi->oxcf.pass == 2) { |
| 28 return cpi->twopass.section_intra_rating > 8 ? MAX_LOOP_FILTER * 3 / 4 | 28 return cpi->twopass.section_intra_rating > 8 ? MAX_LOOP_FILTER * 3 / 4 |
| 29 : MAX_LOOP_FILTER; | 29 : MAX_LOOP_FILTER; |
| 30 } else { | 30 } else { |
| 31 return MAX_LOOP_FILTER; | 31 return MAX_LOOP_FILTER; |
| 32 } | 32 } |
| 33 } | 33 } |
| 34 | 34 |
| 35 | 35 |
| 36 static int try_filter_frame(const YV12_BUFFER_CONFIG *sd, VP9_COMP *const cpi, | 36 static int try_filter_frame(const YV12_BUFFER_CONFIG *sd, VP9_COMP *const cpi, |
| 37 int filt_level, int partial_frame) { | 37 int filt_level, int partial_frame) { |
| (...skipping 37 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 75 ss_err[filt_mid] = best_err; | 75 ss_err[filt_mid] = best_err; |
| 76 | 76 |
| 77 while (filter_step > 0) { | 77 while (filter_step > 0) { |
| 78 const int filt_high = MIN(filt_mid + filter_step, max_filter_level); | 78 const int filt_high = MIN(filt_mid + filter_step, max_filter_level); |
| 79 const int filt_low = MAX(filt_mid - filter_step, min_filter_level); | 79 const int filt_low = MAX(filt_mid - filter_step, min_filter_level); |
| 80 int filt_err; | 80 int filt_err; |
| 81 | 81 |
| 82 // Bias against raising loop filter in favor of lowering it. | 82 // Bias against raising loop filter in favor of lowering it. |
| 83 int bias = (best_err >> (15 - (filt_mid / 8))) * filter_step; | 83 int bias = (best_err >> (15 - (filt_mid / 8))) * filter_step; |
| 84 | 84 |
| 85 if ((cpi->pass == 2) && (cpi->twopass.section_intra_rating < 20)) | 85 if ((cpi->oxcf.pass == 2) && (cpi->twopass.section_intra_rating < 20)) |
| 86 bias = (bias * cpi->twopass.section_intra_rating) / 20; | 86 bias = (bias * cpi->twopass.section_intra_rating) / 20; |
| 87 | 87 |
| 88 // yx, bias less for large block size | 88 // yx, bias less for large block size |
| 89 if (cm->tx_mode != ONLY_4X4) | 89 if (cm->tx_mode != ONLY_4X4) |
| 90 bias >>= 1; | 90 bias >>= 1; |
| 91 | 91 |
| 92 if (filt_direction <= 0 && filt_low != filt_mid) { | 92 if (filt_direction <= 0 && filt_low != filt_mid) { |
| 93 // Get Low filter error score | 93 // Get Low filter error score |
| 94 if (ss_err[filt_low] < 0) { | 94 if (ss_err[filt_low] < 0) { |
| 95 filt_err = try_filter_frame(sd, cpi, filt_low, partial_frame); | 95 filt_err = try_filter_frame(sd, cpi, filt_low, partial_frame); |
| (...skipping 58 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 154 // searched level, filt_guess = q * 0.316206 + 3.87252 | 154 // searched level, filt_guess = q * 0.316206 + 3.87252 |
| 155 int filt_guess = ROUND_POWER_OF_TWO(q * 20723 + 1015158, 18); | 155 int filt_guess = ROUND_POWER_OF_TWO(q * 20723 + 1015158, 18); |
| 156 if (cm->frame_type == KEY_FRAME) | 156 if (cm->frame_type == KEY_FRAME) |
| 157 filt_guess -= 4; | 157 filt_guess -= 4; |
| 158 lf->filter_level = clamp(filt_guess, min_filter_level, max_filter_level); | 158 lf->filter_level = clamp(filt_guess, min_filter_level, max_filter_level); |
| 159 } else { | 159 } else { |
| 160 lf->filter_level = search_filter_level(sd, cpi, | 160 lf->filter_level = search_filter_level(sd, cpi, |
| 161 method == LPF_PICK_FROM_SUBIMAGE); | 161 method == LPF_PICK_FROM_SUBIMAGE); |
| 162 } | 162 } |
| 163 } | 163 } |
| OLD | NEW |