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 69 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
80 for (b_row = 0; b_row < 4 * rows; b_row++) { | 80 for (b_row = 0; b_row < 4 * rows; b_row++) { |
81 int b_col; | 81 int b_col; |
82 int bindex; | 82 int bindex; |
83 | 83 |
84 for (b_col = 0; b_col < 4 * cols; b_col++) { | 84 for (b_col = 0; b_col < 4 * cols; b_col++) { |
85 mb_index = (b_row >> 2) * (cols + 1) + (b_col >> 2); | 85 mb_index = (b_row >> 2) * (cols + 1) + (b_col >> 2); |
86 bindex = (b_row & 3) * 4 + (b_col & 3); | 86 bindex = (b_row & 3) * 4 + (b_col & 3); |
87 | 87 |
88 if (mi[mb_index].mbmi.mode == B_PRED) { | 88 if (mi[mb_index].mbmi.mode == B_PRED) { |
89 fprintf(mvs, "%2d ", mi[mb_index].bmi[bindex].as_mode.first); | 89 fprintf(mvs, "%2d ", mi[mb_index].bmi[bindex].as_mode.first); |
90 #if CONFIG_COMP_INTRA_PRED | |
91 fprintf(mvs, "%2d ", mi[mb_index].bmi[bindex].as_mode.second); | |
92 #endif | |
93 } else | 90 } else |
94 fprintf(mvs, "xx "); | 91 fprintf(mvs, "xx "); |
95 | 92 |
96 } | 93 } |
97 | 94 |
98 fprintf(mvs, "\n"); | 95 fprintf(mvs, "\n"); |
99 } | 96 } |
100 } | 97 } |
101 fprintf(mvs, "\n"); | 98 fprintf(mvs, "\n"); |
102 | 99 |
(...skipping 34 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
137 | 134 |
138 } | 135 } |
139 | 136 |
140 fprintf(mvs, "\n"); | 137 fprintf(mvs, "\n"); |
141 } | 138 } |
142 } | 139 } |
143 fprintf(mvs, "\n"); | 140 fprintf(mvs, "\n"); |
144 | 141 |
145 fclose(mvs); | 142 fclose(mvs); |
146 } | 143 } |
OLD | NEW |