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 35 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
46 | 46 |
47 vpx_memset(cm->mip, 0, cm->mi_stride * (cm->mi_rows + 1) * sizeof(*cm->mip)); | 47 vpx_memset(cm->mip, 0, cm->mi_stride * (cm->mi_rows + 1) * sizeof(*cm->mip)); |
48 | 48 |
49 vpx_memset(cm->mi_grid_base, 0, cm->mi_stride * (cm->mi_rows + 1) * | 49 vpx_memset(cm->mi_grid_base, 0, cm->mi_stride * (cm->mi_rows + 1) * |
50 sizeof(*cm->mi_grid_base)); | 50 sizeof(*cm->mi_grid_base)); |
51 | 51 |
52 clear_mi_border(cm, cm->prev_mip); | 52 clear_mi_border(cm, cm->prev_mip); |
53 } | 53 } |
54 | 54 |
55 static int alloc_mi(VP9_COMMON *cm, int mi_size) { | 55 static int alloc_mi(VP9_COMMON *cm, int mi_size) { |
56 cm->mip = (MODE_INFO *)vpx_calloc(mi_size, sizeof(*cm->mip)); | 56 int i; |
57 if (cm->mip == NULL) | |
58 return 1; | |
59 | 57 |
60 cm->prev_mip = (MODE_INFO *)vpx_calloc(mi_size, sizeof(*cm->prev_mip)); | 58 for (i = 0; i < 2; ++i) { |
61 if (cm->prev_mip == NULL) | 59 cm->mip_array[i] = |
62 return 1; | 60 (MODE_INFO *)vpx_calloc(mi_size, sizeof(*cm->mip)); |
| 61 if (cm->mip_array[i] == NULL) |
| 62 return 1; |
63 | 63 |
64 cm->mi_grid_base = | 64 cm->mi_grid_base_array[i] = |
65 (MODE_INFO **)vpx_calloc(mi_size, sizeof(*cm->mi_grid_base)); | 65 (MODE_INFO **)vpx_calloc(mi_size, sizeof(*cm->mi_grid_base)); |
66 if (cm->mi_grid_base == NULL) | 66 if (cm->mi_grid_base_array[i] == NULL) |
67 return 1; | 67 return 1; |
| 68 } |
68 | 69 |
69 cm->prev_mi_grid_base = | 70 // Init the index. |
70 (MODE_INFO **)vpx_calloc(mi_size, sizeof(*cm->prev_mi_grid_base)); | 71 cm->mi_idx = 0; |
71 if (cm->prev_mi_grid_base == NULL) | 72 cm->prev_mi_idx = 1; |
72 return 1; | 73 |
| 74 cm->mip = cm->mip_array[cm->mi_idx]; |
| 75 cm->prev_mip = cm->mip_array[cm->prev_mi_idx]; |
| 76 cm->mi_grid_base = cm->mi_grid_base_array[cm->mi_idx]; |
| 77 cm->prev_mi_grid_base = cm->mi_grid_base_array[cm->prev_mi_idx]; |
73 | 78 |
74 return 0; | 79 return 0; |
75 } | 80 } |
76 | 81 |
77 static void free_mi(VP9_COMMON *cm) { | 82 static void free_mi(VP9_COMMON *cm) { |
78 vpx_free(cm->mip); | 83 int i; |
79 vpx_free(cm->prev_mip); | 84 |
80 vpx_free(cm->mi_grid_base); | 85 for (i = 0; i < 2; ++i) { |
81 vpx_free(cm->prev_mi_grid_base); | 86 vpx_free(cm->mip_array[i]); |
| 87 cm->mip_array[i] = NULL; |
| 88 vpx_free(cm->mi_grid_base_array[i]); |
| 89 cm->mi_grid_base_array[i] = NULL; |
| 90 } |
82 | 91 |
83 cm->mip = NULL; | 92 cm->mip = NULL; |
84 cm->prev_mip = NULL; | 93 cm->prev_mip = NULL; |
85 cm->mi_grid_base = NULL; | 94 cm->mi_grid_base = NULL; |
86 cm->prev_mi_grid_base = NULL; | 95 cm->prev_mi_grid_base = NULL; |
87 } | 96 } |
88 | 97 |
89 void vp9_free_frame_buffers(VP9_COMMON *cm) { | 98 void vp9_free_frame_buffers(VP9_COMMON *cm) { |
90 int i; | 99 int i; |
91 | 100 |
(...skipping 138 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
230 | 239 |
231 set_mb_mi(cm, aligned_width, aligned_height); | 240 set_mb_mi(cm, aligned_width, aligned_height); |
232 setup_mi(cm); | 241 setup_mi(cm); |
233 | 242 |
234 // Initialize the previous frame segment map to 0. | 243 // Initialize the previous frame segment map to 0. |
235 if (cm->last_frame_seg_map) | 244 if (cm->last_frame_seg_map) |
236 vpx_memset(cm->last_frame_seg_map, 0, cm->mi_rows * cm->mi_cols); | 245 vpx_memset(cm->last_frame_seg_map, 0, cm->mi_rows * cm->mi_cols); |
237 } | 246 } |
238 | 247 |
239 void vp9_swap_mi_and_prev_mi(VP9_COMMON *cm) { | 248 void vp9_swap_mi_and_prev_mi(VP9_COMMON *cm) { |
| 249 // Swap indices. |
| 250 const int tmp = cm->mi_idx; |
| 251 cm->mi_idx = cm->prev_mi_idx; |
| 252 cm->prev_mi_idx = tmp; |
| 253 |
240 // Current mip will be the prev_mip for the next frame. | 254 // Current mip will be the prev_mip for the next frame. |
241 MODE_INFO *temp = cm->prev_mip; | 255 cm->mip = cm->mip_array[cm->mi_idx]; |
242 MODE_INFO **temp2 = cm->prev_mi_grid_base; | 256 cm->prev_mip = cm->mip_array[cm->prev_mi_idx]; |
243 cm->prev_mip = cm->mip; | 257 cm->mi_grid_base = cm->mi_grid_base_array[cm->mi_idx]; |
244 cm->mip = temp; | 258 cm->prev_mi_grid_base = cm->mi_grid_base_array[cm->prev_mi_idx]; |
245 cm->prev_mi_grid_base = cm->mi_grid_base; | |
246 cm->mi_grid_base = temp2; | |
247 | 259 |
248 // Update the upper left visible macroblock ptrs. | 260 // Update the upper left visible macroblock ptrs. |
249 cm->mi = cm->mip + cm->mi_stride + 1; | 261 cm->mi = cm->mip + cm->mi_stride + 1; |
250 cm->prev_mi = cm->prev_mip + cm->mi_stride + 1; | 262 cm->prev_mi = cm->prev_mip + cm->mi_stride + 1; |
251 cm->mi_grid_visible = cm->mi_grid_base + cm->mi_stride + 1; | 263 cm->mi_grid_visible = cm->mi_grid_base + cm->mi_stride + 1; |
252 cm->prev_mi_grid_visible = cm->prev_mi_grid_base + cm->mi_stride + 1; | 264 cm->prev_mi_grid_visible = cm->prev_mi_grid_base + cm->mi_stride + 1; |
253 } | 265 } |
OLD | NEW |