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 26 matching lines...) Expand all Loading... |
37 unsigned int vp9_sad##m##x##n##_c(const uint8_t *src_ptr, int src_stride, \ | 37 unsigned int vp9_sad##m##x##n##_c(const uint8_t *src_ptr, int src_stride, \ |
38 const uint8_t *ref_ptr, int ref_stride, \ | 38 const uint8_t *ref_ptr, int ref_stride, \ |
39 unsigned int max_sad) { \ | 39 unsigned int max_sad) { \ |
40 return sad(src_ptr, src_stride, ref_ptr, ref_stride, m, n); \ | 40 return sad(src_ptr, src_stride, ref_ptr, ref_stride, m, n); \ |
41 } \ | 41 } \ |
42 unsigned int vp9_sad##m##x##n##_avg_c(const uint8_t *src_ptr, int src_stride, \ | 42 unsigned int vp9_sad##m##x##n##_avg_c(const uint8_t *src_ptr, int src_stride, \ |
43 const uint8_t *ref_ptr, int ref_stride, \ | 43 const uint8_t *ref_ptr, int ref_stride, \ |
44 const uint8_t *second_pred, \ | 44 const uint8_t *second_pred, \ |
45 unsigned int max_sad) { \ | 45 unsigned int max_sad) { \ |
46 uint8_t comp_pred[m * n]; \ | 46 uint8_t comp_pred[m * n]; \ |
47 comp_avg_pred(comp_pred, second_pred, m, n, ref_ptr, ref_stride); \ | 47 vp9_comp_avg_pred(comp_pred, second_pred, m, n, ref_ptr, ref_stride); \ |
48 return sad(src_ptr, src_stride, comp_pred, m, m, n); \ | 48 return sad(src_ptr, src_stride, comp_pred, m, m, n); \ |
49 } | 49 } |
50 | 50 |
51 sad_mxn_func(64, 64) | 51 sad_mxn_func(64, 64) |
52 sad_mxn_func(64, 32) | 52 sad_mxn_func(64, 32) |
53 sad_mxn_func(32, 64) | 53 sad_mxn_func(32, 64) |
54 sad_mxn_func(32, 32) | 54 sad_mxn_func(32, 32) |
55 sad_mxn_func(32, 16) | 55 sad_mxn_func(32, 16) |
56 sad_mxn_func(16, 32) | 56 sad_mxn_func(16, 32) |
57 sad_mxn_func(16, 16) | 57 sad_mxn_func(16, 16) |
(...skipping 257 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
315 } | 315 } |
316 | 316 |
317 void vp9_sad4x4x4d_c(const uint8_t *src_ptr, int src_stride, | 317 void vp9_sad4x4x4d_c(const uint8_t *src_ptr, int src_stride, |
318 const uint8_t* const ref_ptr[], int ref_stride, | 318 const uint8_t* const ref_ptr[], int ref_stride, |
319 unsigned int *sad_array) { | 319 unsigned int *sad_array) { |
320 int i; | 320 int i; |
321 for (i = 0; i < 4; ++i) | 321 for (i = 0; i < 4; ++i) |
322 sad_array[i] = vp9_sad4x4(src_ptr, src_stride, ref_ptr[i], ref_stride, | 322 sad_array[i] = vp9_sad4x4(src_ptr, src_stride, ref_ptr[i], ref_stride, |
323 0x7fffffff); | 323 0x7fffffff); |
324 } | 324 } |
OLD | NEW |