Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(596)

Side by Side Diff: source/libvpx/vp9/common/vp9_alloccommon.c

Issue 478033002: libvpx: Pull from upstream (Closed) Base URL: svn://svn.chromium.org/chrome/trunk/deps/third_party/libvpx/
Patch Set: Created 6 years, 4 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
« no previous file with comments | « source/libvpx/vp8/vp8_dx_iface.c ('k') | source/libvpx/vp9/common/vp9_blockd.h » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
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 16 matching lines...) Expand all
27 for (i = 1; i < cm->mi_rows + 1; ++i) 27 for (i = 1; i < cm->mi_rows + 1; ++i)
28 vpx_memset(&mi[i * cm->mi_stride], 0, sizeof(*mi)); 28 vpx_memset(&mi[i * cm->mi_stride], 0, sizeof(*mi));
29 } 29 }
30 30
31 void vp9_set_mb_mi(VP9_COMMON *cm, int width, int height) { 31 void vp9_set_mb_mi(VP9_COMMON *cm, int width, int height) {
32 const int aligned_width = ALIGN_POWER_OF_TWO(width, MI_SIZE_LOG2); 32 const int aligned_width = ALIGN_POWER_OF_TWO(width, MI_SIZE_LOG2);
33 const int aligned_height = ALIGN_POWER_OF_TWO(height, MI_SIZE_LOG2); 33 const int aligned_height = ALIGN_POWER_OF_TWO(height, MI_SIZE_LOG2);
34 34
35 cm->mi_cols = aligned_width >> MI_SIZE_LOG2; 35 cm->mi_cols = aligned_width >> MI_SIZE_LOG2;
36 cm->mi_rows = aligned_height >> MI_SIZE_LOG2; 36 cm->mi_rows = aligned_height >> MI_SIZE_LOG2;
37 cm->mi_stride = cm->mi_cols + MI_BLOCK_SIZE; 37 cm->mi_stride = calc_mi_size(cm->mi_cols);
38 38
39 cm->mb_cols = (cm->mi_cols + 1) >> 1; 39 cm->mb_cols = (cm->mi_cols + 1) >> 1;
40 cm->mb_rows = (cm->mi_rows + 1) >> 1; 40 cm->mb_rows = (cm->mi_rows + 1) >> 1;
41 cm->MBs = cm->mb_rows * cm->mb_cols; 41 cm->MBs = cm->mb_rows * cm->mb_cols;
42 } 42 }
43 43
44 static void setup_mi(VP9_COMMON *cm) { 44 static void setup_mi(VP9_COMMON *cm) {
45 cm->mi = cm->mip + cm->mi_stride + 1; 45 cm->mi = cm->mip + cm->mi_stride + 1;
46 cm->prev_mi = cm->prev_mip + cm->mi_stride + 1; 46 cm->prev_mi = cm->prev_mip + cm->mi_stride + 1;
47 cm->mi_grid_visible = cm->mi_grid_base + cm->mi_stride + 1; 47 cm->mi_grid_visible = cm->mi_grid_base + cm->mi_stride + 1;
48 cm->prev_mi_grid_visible = cm->prev_mi_grid_base + cm->mi_stride + 1; 48 cm->prev_mi_grid_visible = cm->prev_mi_grid_base + cm->mi_stride + 1;
49 49
50 vpx_memset(cm->mip, 0, cm->mi_stride * (cm->mi_rows + 1) * sizeof(*cm->mip)); 50 vpx_memset(cm->mip, 0, cm->mi_stride * (cm->mi_rows + 1) * sizeof(*cm->mip));
51 51
52 vpx_memset(cm->mi_grid_base, 0, cm->mi_stride * (cm->mi_rows + 1) * 52 vpx_memset(cm->mi_grid_base, 0, cm->mi_stride * (cm->mi_rows + 1) *
53 sizeof(*cm->mi_grid_base)); 53 sizeof(*cm->mi_grid_base));
54 54
55 clear_mi_border(cm, cm->prev_mip); 55 clear_mi_border(cm, cm->prev_mip);
56 } 56 }
57 57
58 static int alloc_mi(VP9_COMMON *cm, int mi_size) { 58 static int alloc_mi(VP9_COMMON *cm, int mi_size) {
59 int i; 59 int i;
60 60
61 for (i = 0; i < 2; ++i) { 61 for (i = 0; i < 2; ++i) {
62 cm->mip_array[i] = 62 cm->mip_array[i] =
63 (MODE_INFO *)vpx_calloc(mi_size, sizeof(*cm->mip)); 63 (MODE_INFO *)vpx_calloc(mi_size, sizeof(MODE_INFO));
64 if (cm->mip_array[i] == NULL) 64 if (cm->mip_array[i] == NULL)
65 return 1; 65 return 1;
66 66
67 cm->mi_grid_base_array[i] = 67 cm->mi_grid_base_array[i] =
68 (MODE_INFO **)vpx_calloc(mi_size, sizeof(*cm->mi_grid_base)); 68 (MODE_INFO **)vpx_calloc(mi_size, sizeof(MODE_INFO*));
69 if (cm->mi_grid_base_array[i] == NULL) 69 if (cm->mi_grid_base_array[i] == NULL)
70 return 1; 70 return 1;
71 } 71 }
72 72
73 cm->mi_alloc_size = mi_size;
74
73 // Init the index. 75 // Init the index.
74 cm->mi_idx = 0; 76 cm->mi_idx = 0;
75 cm->prev_mi_idx = 1; 77 cm->prev_mi_idx = 1;
76 78
77 cm->mip = cm->mip_array[cm->mi_idx]; 79 cm->mip = cm->mip_array[cm->mi_idx];
78 cm->prev_mip = cm->mip_array[cm->prev_mi_idx]; 80 cm->prev_mip = cm->mip_array[cm->prev_mi_idx];
79 cm->mi_grid_base = cm->mi_grid_base_array[cm->mi_idx]; 81 cm->mi_grid_base = cm->mi_grid_base_array[cm->mi_idx];
80 cm->prev_mi_grid_base = cm->mi_grid_base_array[cm->prev_mi_idx]; 82 cm->prev_mi_grid_base = cm->mi_grid_base_array[cm->prev_mi_idx];
81 83
82 return 0; 84 return 0;
(...skipping 41 matching lines...) Expand 10 before | Expand all | Expand 10 after
124 cm->above_context = NULL; 126 cm->above_context = NULL;
125 127
126 vpx_free(cm->above_seg_context); 128 vpx_free(cm->above_seg_context);
127 cm->above_seg_context = NULL; 129 cm->above_seg_context = NULL;
128 } 130 }
129 131
130 int vp9_alloc_context_buffers(VP9_COMMON *cm, int width, int height) { 132 int vp9_alloc_context_buffers(VP9_COMMON *cm, int width, int height) {
131 vp9_free_context_buffers(cm); 133 vp9_free_context_buffers(cm);
132 134
133 vp9_set_mb_mi(cm, width, height); 135 vp9_set_mb_mi(cm, width, height);
134 if (alloc_mi(cm, cm->mi_stride * (cm->mi_rows + MI_BLOCK_SIZE))) goto fail; 136 if (alloc_mi(cm, cm->mi_stride * calc_mi_size(cm->mi_rows)))
137 goto fail;
135 138
136 cm->last_frame_seg_map = (uint8_t *)vpx_calloc(cm->mi_rows * cm->mi_cols, 1); 139 cm->last_frame_seg_map = (uint8_t *)vpx_calloc(cm->mi_rows * cm->mi_cols, 1);
137 if (!cm->last_frame_seg_map) goto fail; 140 if (!cm->last_frame_seg_map) goto fail;
138 141
139 cm->above_context = (ENTROPY_CONTEXT *)vpx_calloc( 142 cm->above_context = (ENTROPY_CONTEXT *)vpx_calloc(
140 2 * mi_cols_aligned_to_sb(cm->mi_cols) * MAX_MB_PLANE, 143 2 * mi_cols_aligned_to_sb(cm->mi_cols) * MAX_MB_PLANE,
141 sizeof(*cm->above_context)); 144 sizeof(*cm->above_context));
142 if (!cm->above_context) goto fail; 145 if (!cm->above_context) goto fail;
143 146
144 cm->above_seg_context = (PARTITION_CONTEXT *)vpx_calloc( 147 cm->above_seg_context = (PARTITION_CONTEXT *)vpx_calloc(
(...skipping 71 matching lines...) Expand 10 before | Expand all | Expand 10 after
216 cm->prev_mip = cm->mip_array[cm->prev_mi_idx]; 219 cm->prev_mip = cm->mip_array[cm->prev_mi_idx];
217 cm->mi_grid_base = cm->mi_grid_base_array[cm->mi_idx]; 220 cm->mi_grid_base = cm->mi_grid_base_array[cm->mi_idx];
218 cm->prev_mi_grid_base = cm->mi_grid_base_array[cm->prev_mi_idx]; 221 cm->prev_mi_grid_base = cm->mi_grid_base_array[cm->prev_mi_idx];
219 222
220 // Update the upper left visible macroblock ptrs. 223 // Update the upper left visible macroblock ptrs.
221 cm->mi = cm->mip + cm->mi_stride + 1; 224 cm->mi = cm->mip + cm->mi_stride + 1;
222 cm->prev_mi = cm->prev_mip + cm->mi_stride + 1; 225 cm->prev_mi = cm->prev_mip + cm->mi_stride + 1;
223 cm->mi_grid_visible = cm->mi_grid_base + cm->mi_stride + 1; 226 cm->mi_grid_visible = cm->mi_grid_base + cm->mi_stride + 1;
224 cm->prev_mi_grid_visible = cm->prev_mi_grid_base + cm->mi_stride + 1; 227 cm->prev_mi_grid_visible = cm->prev_mi_grid_base + cm->mi_stride + 1;
225 } 228 }
OLDNEW
« no previous file with comments | « source/libvpx/vp8/vp8_dx_iface.c ('k') | source/libvpx/vp9/common/vp9_blockd.h » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698