Libav
hevcpred_template.c
Go to the documentation of this file.
1 /*
2  * HEVC video decoder
3  *
4  * Copyright (C) 2012 - 2013 Guillaume Martres
5  *
6  * This file is part of Libav.
7  *
8  * Libav is free software; you can redistribute it and/or
9  * modify it under the terms of the GNU Lesser General Public
10  * License as published by the Free Software Foundation; either
11  * version 2.1 of the License, or (at your option) any later version.
12  *
13  * Libav is distributed in the hope that it will be useful,
14  * but WITHOUT ANY WARRANTY; without even the implied warranty of
15  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16  * Lesser General Public License for more details.
17  *
18  * You should have received a copy of the GNU Lesser General Public
19  * License along with Libav; if not, write to the Free Software
20  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21  */
22 
23 #include "libavutil/pixdesc.h"
24 
25 #include "hevc.h"
26 
27 #include "bit_depth_template.c"
28 
29 #define POS(x, y) src[(x) + stride * (y)]
30 
31 static void FUNC(intra_pred)(HEVCContext *s, int x0, int y0, int log2_size, int c_idx)
32 {
33 #define PU(x) \
34  ((x) >> s->sps->log2_min_pu_size)
35 #define MVF(x, y) \
36  (s->ref->tab_mvf[(x) + (y) * min_pu_width])
37 #define MVF_PU(x, y) \
38  MVF(PU(x0 + ((x) << hshift)), PU(y0 + ((y) << vshift)))
39 #define IS_INTRA(x, y) \
40  MVF_PU(x, y).is_intra
41 #define MIN_TB_ADDR_ZS(x, y) \
42  s->pps->min_tb_addr_zs[(y) * s->sps->min_tb_width + (x)]
43 #define EXTEND_LEFT(ptr, start, length) \
44  for (i = (start); i > (start) - (length); i--) \
45  ptr[i - 1] = ptr[i]
46 #define EXTEND_RIGHT(ptr, start, length) \
47  for (i = (start); i < (start) + (length); i++) \
48  ptr[i] = ptr[i - 1]
49 #define EXTEND_UP(ptr, start, length) EXTEND_LEFT(ptr, start, length)
50 #define EXTEND_DOWN(ptr, start, length) EXTEND_RIGHT(ptr, start, length)
51 #define EXTEND_LEFT_CIP(ptr, start, length) \
52  for (i = (start); i > (start) - (length); i--) \
53  if (!IS_INTRA(i - 1, -1)) \
54  ptr[i - 1] = ptr[i]
55 #define EXTEND_RIGHT_CIP(ptr, start, length) \
56  for (i = (start); i < (start) + (length); i++) \
57  if (!IS_INTRA(i, -1)) \
58  ptr[i] = ptr[i - 1]
59 #define EXTEND_UP_CIP(ptr, start, length) \
60  for (i = (start); i > (start) - (length); i--) \
61  if (!IS_INTRA(-1, i - 1)) \
62  ptr[i - 1] = ptr[i]
63 #define EXTEND_UP_CIP_0(ptr, start, length) \
64  for (i = (start); i > (start) - (length); i--) \
65  ptr[i - 1] = ptr[i]
66 #define EXTEND_DOWN_CIP(ptr, start, length) \
67  for (i = (start); i < (start) + (length); i++) \
68  if (!IS_INTRA(-1, i)) \
69  ptr[i] = ptr[i - 1]
70  HEVCLocalContext *lc = &s->HEVClc;
71  int i;
72  int hshift = s->sps->hshift[c_idx];
73  int vshift = s->sps->vshift[c_idx];
74  int size = (1 << log2_size);
75  int size_in_luma = size << hshift;
76  int size_in_tbs = size_in_luma >> s->sps->log2_min_tb_size;
77  int x = x0 >> hshift;
78  int y = y0 >> vshift;
79  int x_tb = x0 >> s->sps->log2_min_tb_size;
80  int y_tb = y0 >> s->sps->log2_min_tb_size;
81  int cur_tb_addr = MIN_TB_ADDR_ZS(x_tb, y_tb);
82 
83  ptrdiff_t stride = s->frame->linesize[c_idx] / sizeof(pixel);
84  pixel *src = (pixel*)s->frame->data[c_idx] + x + y * stride;
85 
86  int min_pu_width = s->sps->min_pu_width;
87 
88  enum IntraPredMode mode = c_idx ? lc->pu.intra_pred_mode_c :
90 
91  pixel left_array[2 * MAX_TB_SIZE + 1];
92  pixel filtered_left_array[2 * MAX_TB_SIZE + 1];
93  pixel top_array[2 * MAX_TB_SIZE + 1];
94  pixel filtered_top_array[2 * MAX_TB_SIZE + 1];
95 
96  pixel *left = left_array + 1;
97  pixel *top = top_array + 1;
98  pixel *filtered_left = filtered_left_array + 1;
99  pixel *filtered_top = filtered_top_array + 1;
100 
101  int cand_bottom_left = lc->na.cand_bottom_left && cur_tb_addr > MIN_TB_ADDR_ZS(x_tb - 1, y_tb + size_in_tbs);
102  int cand_left = lc->na.cand_left;
103  int cand_up_left = lc->na.cand_up_left;
104  int cand_up = lc->na.cand_up;
105  int cand_up_right = lc->na.cand_up_right && cur_tb_addr > MIN_TB_ADDR_ZS(x_tb + size_in_tbs, y_tb - 1);
106 
107  int bottom_left_size = (FFMIN(y0 + 2 * size_in_luma, s->sps->height) -
108  (y0 + size_in_luma)) >> vshift;
109  int top_right_size = (FFMIN(x0 + 2 * size_in_luma, s->sps->width) -
110  (x0 + size_in_luma)) >> hshift;
111 
112  if (s->pps->constrained_intra_pred_flag == 1) {
113  int size_in_luma_pu = PU(size_in_luma);
114  int on_pu_edge_x = !(x0 & ((1 << s->sps->log2_min_pu_size) - 1));
115  int on_pu_edge_y = !(y0 & ((1 << s->sps->log2_min_pu_size) - 1));
116  if (!size_in_luma_pu)
117  size_in_luma_pu++;
118  if (cand_bottom_left == 1 && on_pu_edge_x) {
119  int x_left_pu = PU(x0 - 1);
120  int y_bottom_pu = PU(y0 + size_in_luma);
121  int max = FFMIN(size_in_luma_pu, s->sps->min_pu_height - y_bottom_pu);
122  cand_bottom_left = 0;
123  for (i = 0; i < max; i++)
124  cand_bottom_left |= MVF(x_left_pu, y_bottom_pu + i).is_intra;
125  }
126  if (cand_left == 1 && on_pu_edge_x) {
127  int x_left_pu = PU(x0 - 1);
128  int y_left_pu = PU(y0);
129  int max = FFMIN(size_in_luma_pu, s->sps->min_pu_height - y_left_pu);
130  cand_left = 0;
131  for (i = 0; i < max; i++)
132  cand_left |= MVF(x_left_pu, y_left_pu + i).is_intra;
133  }
134  if (cand_up_left == 1) {
135  int x_left_pu = PU(x0 - 1);
136  int y_top_pu = PU(y0 - 1);
137  cand_up_left = MVF(x_left_pu, y_top_pu).is_intra;
138  }
139  if (cand_up == 1 && on_pu_edge_y) {
140  int x_top_pu = PU(x0);
141  int y_top_pu = PU(y0 - 1);
142  int max = FFMIN(size_in_luma_pu, s->sps->min_pu_width - x_top_pu);
143  cand_up = 0;
144  for (i = 0; i < max; i++)
145  cand_up |= MVF(x_top_pu + i, y_top_pu).is_intra;
146  }
147  if (cand_up_right == 1 && on_pu_edge_y) {
148  int y_top_pu = PU(y0 - 1);
149  int x_right_pu = PU(x0 + size_in_luma);
150  int max = FFMIN(size_in_luma_pu, s->sps->min_pu_width - x_right_pu);
151  cand_up_right = 0;
152  for (i = 0; i < max; i++)
153  cand_up_right |= MVF(x_right_pu + i, y_top_pu).is_intra;
154  }
155  for (i = 0; i < 2 * MAX_TB_SIZE; i++) {
156  left[i] = 128;
157  top[i] = 128;
158  }
159  }
160  if (cand_bottom_left) {
161  for (i = size + bottom_left_size; i < (size << 1); i++)
162  if (IS_INTRA(-1, size + bottom_left_size - 1) ||
163  !s->pps->constrained_intra_pred_flag)
164  left[i] = POS(-1, size + bottom_left_size - 1);
165  for (i = size + bottom_left_size - 1; i >= size; i--)
166  if (IS_INTRA(-1, i) || !s->pps->constrained_intra_pred_flag)
167  left[i] = POS(-1, i);
168  }
169  if (cand_left)
170  for (i = size - 1; i >= 0; i--)
171  if (IS_INTRA(-1, i) || !s->pps->constrained_intra_pred_flag)
172  left[i] = POS(-1, i);
173  if (cand_up_left)
174  if (IS_INTRA(-1, -1) || !s->pps->constrained_intra_pred_flag) {
175  left[-1] = POS(-1, -1);
176  top[-1] = left[-1];
177  }
178  if (cand_up)
179  for (i = size - 1; i >= 0; i--)
180  if (IS_INTRA(i, -1) || !s->pps->constrained_intra_pred_flag)
181  top[i] = POS(i, -1);
182  if (cand_up_right) {
183  for (i = size + top_right_size; i < (size << 1); i++)
184  if (IS_INTRA(size + top_right_size - 1, -1) ||
185  !s->pps->constrained_intra_pred_flag)
186  top[i] = POS(size + top_right_size - 1, -1);
187  for (i = size + top_right_size - 1; i >= size; i--)
188  if (IS_INTRA(i, -1) || !s->pps->constrained_intra_pred_flag)
189  top[i] = POS(i, -1);
190  }
191 
192  if (s->pps->constrained_intra_pred_flag == 1) {
193  if (cand_bottom_left || cand_left || cand_up_left || cand_up || cand_up_right) {
194  int size_max_x = x0 + ((2 * size) << hshift) < s->sps->width ?
195  2 * size : (s->sps->width - x0) >> hshift;
196  int size_max_y = y0 + ((2 * size) << vshift) < s->sps->height ?
197  2 * size : (s->sps->height - y0) >> vshift;
198  int j = size + (cand_bottom_left? bottom_left_size: 0) -1;
199  if (!cand_up_right) {
200  size_max_x = x0 + ((size) << hshift) < s->sps->width ?
201  size : (s->sps->width - x0) >> hshift;
202  }
203  if (!cand_bottom_left) {
204  size_max_y = y0 + (( size) << vshift) < s->sps->height ?
205  size : (s->sps->height - y0) >> vshift;
206  }
207  if (cand_bottom_left || cand_left || cand_up_left) {
208  while (j > -1 && !IS_INTRA(-1, j))
209  j--;
210  if (!IS_INTRA(-1, j)) {
211  j = 0;
212  while (j < size_max_x && !IS_INTRA(j, -1))
213  j++;
214  EXTEND_LEFT_CIP(top, j, j + 1);
215  left[-1] = top[-1];
216  j = 0;
217  }
218  } else {
219  j = 0;
220  while (j < size_max_x && !IS_INTRA(j, -1))
221  j++;
222  if (j > 0)
223  if (x0 > 0) {
224  EXTEND_LEFT_CIP(top, j, j + 1);
225  } else {
226  EXTEND_LEFT_CIP(top, j, j);
227  top[-1] = top[0];
228  }
229  left[-1] = top[-1];
230  j = 0;
231  }
232  if (cand_bottom_left || cand_left) {
233  EXTEND_DOWN_CIP(left, j, size_max_y - j);
234  }
235  if (!cand_left) {
236  EXTEND_DOWN(left, 0, size);
237  }
238  if (!cand_bottom_left) {
239  EXTEND_DOWN(left, size, size);
240  }
241  if (x0 != 0 && y0 != 0) {
242  EXTEND_UP_CIP(left, size_max_y - 1, size_max_y);
243  } else if (x0 == 0) {
244  EXTEND_UP_CIP_0(left, size_max_y - 1, size_max_y);
245  } else {
246  EXTEND_UP_CIP(left, size_max_y - 1, size_max_y - 1);
247  }
248  top[-1] = left[-1];
249  if (y0 != 0) {
250  EXTEND_RIGHT_CIP(top, 0, size_max_x);
251  }
252  }
253  }
254  // Infer the unavailable samples
255  if (!cand_bottom_left) {
256  if (cand_left) {
257  EXTEND_DOWN(left, size, size);
258  } else if (cand_up_left) {
259  EXTEND_DOWN(left, 0, 2 * size);
260  cand_left = 1;
261  } else if (cand_up) {
262  left[-1] = top[0];
263  EXTEND_DOWN(left, 0, 2 * size);
264  cand_up_left = 1;
265  cand_left = 1;
266  } else if (cand_up_right) {
267  EXTEND_LEFT(top, size, size);
268  left[-1] = top[0];
269  EXTEND_DOWN(left, 0, 2 * size);
270  cand_up = 1;
271  cand_up_left = 1;
272  cand_left = 1;
273  } else { // No samples available
274  top[0] = left[-1] = (1 << (BIT_DEPTH - 1));
275  EXTEND_RIGHT(top, 1, 2 * size - 1);
276  EXTEND_DOWN(left, 0, 2 * size);
277  }
278  }
279 
280  if (!cand_left) {
281  EXTEND_UP(left, size, size);
282  }
283  if (!cand_up_left) {
284  left[-1] = left[0];
285  }
286  if (!cand_up) {
287  top[0] = left[-1];
288  EXTEND_RIGHT(top, 1, size - 1);
289  }
290  if (!cand_up_right) {
291  EXTEND_RIGHT(top, size, size);
292  }
293 
294  top[-1] = left[-1];
295 
296  // Filtering process
297  if (c_idx == 0 && mode != INTRA_DC && size != 4) {
298  int intra_hor_ver_dist_thresh[] = { 7, 1, 0 };
299  int min_dist_vert_hor = FFMIN(FFABS((int)mode - 26),
300  FFABS((int)mode - 10));
301  if (min_dist_vert_hor > intra_hor_ver_dist_thresh[log2_size - 3]) {
302  int threshold = 1 << (BIT_DEPTH - 5);
303  if (s->sps->sps_strong_intra_smoothing_enable_flag &&
304  log2_size == 5 &&
305  FFABS(top[-1] + top[63] - 2 * top[31]) < threshold &&
306  FFABS(left[-1] + left[63] - 2 * left[31]) < threshold) {
307  // We can't just overwrite values in top because it could be
308  // a pointer into src
309  filtered_top[-1] = top[-1];
310  filtered_top[63] = top[63];
311  for (i = 0; i < 63; i++)
312  filtered_top[i] = ((64 - (i + 1)) * top[-1] +
313  (i + 1) * top[63] + 32) >> 6;
314  for (i = 0; i < 63; i++)
315  left[i] = ((64 - (i + 1)) * left[-1] +
316  (i + 1) * left[63] + 32) >> 6;
317  top = filtered_top;
318  } else {
319  filtered_left[2 * size - 1] = left[2 * size - 1];
320  filtered_top[2 * size - 1] = top[2 * size - 1];
321  for (i = 2 * size - 2; i >= 0; i--)
322  filtered_left[i] = (left[i + 1] + 2 * left[i] +
323  left[i - 1] + 2) >> 2;
324  filtered_top[-1] =
325  filtered_left[-1] = (left[0] + 2 * left[-1] + top[0] + 2) >> 2;
326  for (i = 2 * size - 2; i >= 0; i--)
327  filtered_top[i] = (top[i + 1] + 2 * top[i] +
328  top[i - 1] + 2) >> 2;
329  left = filtered_left;
330  top = filtered_top;
331  }
332  }
333  }
334 
335  switch (mode) {
336  case INTRA_PLANAR:
337  s->hpc.pred_planar[log2_size - 2]((uint8_t *)src, (uint8_t *)top,
338  (uint8_t *)left, stride);
339  break;
340  case INTRA_DC:
341  s->hpc.pred_dc((uint8_t *)src, (uint8_t *)top,
342  (uint8_t *)left, stride, log2_size, c_idx);
343  break;
344  default:
345  s->hpc.pred_angular[log2_size - 2]((uint8_t *)src, (uint8_t *)top,
346  (uint8_t *)left, stride, c_idx,
347  mode);
348  break;
349  }
350 }
351 
352 static void FUNC(pred_planar_0)(uint8_t *_src, const uint8_t *_top,
353  const uint8_t *_left,
354  ptrdiff_t stride)
355 {
356  int x, y;
357  pixel *src = (pixel *)_src;
358  const pixel *top = (const pixel *)_top;
359  const pixel *left = (const pixel *)_left;
360  for (y = 0; y < 4; y++)
361  for (x = 0; x < 4; x++)
362  POS(x, y) = ((3 - x) * left[y] + (x + 1) * top[4] +
363  (3 - y) * top[x] + (y + 1) * left[4] + 4) >> 3;
364 }
365 
366 static void FUNC(pred_planar_1)(uint8_t *_src, const uint8_t *_top,
367  const uint8_t *_left, ptrdiff_t stride)
368 {
369  int x, y;
370  pixel *src = (pixel *)_src;
371  const pixel *top = (const pixel *)_top;
372  const pixel *left = (const pixel *)_left;
373  for (y = 0; y < 8; y++)
374  for (x = 0; x < 8; x++)
375  POS(x, y) = ((7 - x) * left[y] + (x + 1) * top[8] +
376  (7 - y) * top[x] + (y + 1) * left[8] + 8) >> 4;
377 }
378 
379 static void FUNC(pred_planar_2)(uint8_t *_src, const uint8_t *_top,
380  const uint8_t *_left, ptrdiff_t stride)
381 {
382  int x, y;
383  pixel *src = (pixel *)_src;
384  const pixel *top = (const pixel *)_top;
385  const pixel *left = (const pixel *)_left;
386  for (y = 0; y < 16; y++)
387  for (x = 0; x < 16; x++)
388  POS(x, y) = ((15 - x) * left[y] + (x + 1) * top[16] +
389  (15 - y) * top[x] + (y + 1) * left[16] + 16) >> 5;
390 }
391 
392 static void FUNC(pred_planar_3)(uint8_t *_src, const uint8_t *_top,
393  const uint8_t *_left, ptrdiff_t stride)
394 {
395  int x, y;
396  pixel *src = (pixel *)_src;
397  const pixel *top = (const pixel *)_top;
398  const pixel *left = (const pixel *)_left;
399  for (y = 0; y < 32; y++)
400  for (x = 0; x < 32; x++)
401  POS(x, y) = ((31 - x) * left[y] + (x + 1) * top[32] +
402  (31 - y) * top[x] + (y + 1) * left[32] + 32) >> 6;
403 }
404 
405 static void FUNC(pred_dc)(uint8_t *_src, const uint8_t *_top,
406  const uint8_t *_left,
407  ptrdiff_t stride, int log2_size, int c_idx)
408 {
409  int i, j, x, y;
410  int size = (1 << log2_size);
411  pixel *src = (pixel *)_src;
412  const pixel *top = (const pixel *)_top;
413  const pixel *left = (const pixel *)_left;
414  int dc = size;
415  pixel4 a;
416  for (i = 0; i < size; i++)
417  dc += left[i] + top[i];
418 
419  dc >>= log2_size + 1;
420 
421  a = PIXEL_SPLAT_X4(dc);
422 
423  for (i = 0; i < size; i++)
424  for (j = 0; j < size / 4; j++)
425  AV_WN4PA(&POS(j * 4, i), a);
426 
427  if (c_idx == 0 && size < 32) {
428  POS(0, 0) = (left[0] + 2 * dc + top[0] + 2) >> 2;
429  for (x = 1; x < size; x++)
430  POS(x, 0) = (top[x] + 3 * dc + 2) >> 2;
431  for (y = 1; y < size; y++)
432  POS(0, y) = (left[y] + 3 * dc + 2) >> 2;
433  }
434 }
435 
437  const uint8_t *_top,
438  const uint8_t *_left,
439  ptrdiff_t stride, int c_idx,
440  int mode, int size)
441 {
442  int x, y;
443  pixel *src = (pixel *)_src;
444  const pixel *top = (const pixel *)_top;
445  const pixel *left = (const pixel *)_left;
446 
447  static const int intra_pred_angle[] = {
448  32, 26, 21, 17, 13, 9, 5, 2, 0, -2, -5, -9, -13, -17, -21, -26, -32,
449  -26, -21, -17, -13, -9, -5, -2, 0, 2, 5, 9, 13, 17, 21, 26, 32
450  };
451  static const int inv_angle[] = {
452  -4096, -1638, -910, -630, -482, -390, -315, -256, -315, -390, -482,
453  -630, -910, -1638, -4096
454  };
455 
456  int angle = intra_pred_angle[mode - 2];
457  pixel ref_array[3 * MAX_TB_SIZE + 1];
458  pixel *ref_tmp = ref_array + size;
459  const pixel *ref;
460  int last = (size * angle) >> 5;
461 
462  if (mode >= 18) {
463  ref = top - 1;
464  if (angle < 0 && last < -1) {
465  for (x = 0; x <= size; x++)
466  ref_tmp[x] = top[x - 1];
467  for (x = last; x <= -1; x++)
468  ref_tmp[x] = left[-1 + ((x * inv_angle[mode - 11] + 128) >> 8)];
469  ref = ref_tmp;
470  }
471 
472  for (y = 0; y < size; y++) {
473  int idx = ((y + 1) * angle) >> 5;
474  int fact = ((y + 1) * angle) & 31;
475  if (fact) {
476  for (x = 0; x < size; x++) {
477  POS(x, y) = ((32 - fact) * ref[x + idx + 1] +
478  fact * ref[x + idx + 2] + 16) >> 5;
479  }
480  } else {
481  for (x = 0; x < size; x++)
482  POS(x, y) = ref[x + idx + 1];
483  }
484  }
485  if (mode == 26 && c_idx == 0 && size < 32) {
486  for (y = 0; y < size; y++)
487  POS(0, y) = av_clip_pixel(top[0] + ((left[y] - left[-1]) >> 1));
488  }
489  } else {
490  ref = left - 1;
491  if (angle < 0 && last < -1) {
492  for (x = 0; x <= size; x++)
493  ref_tmp[x] = left[x - 1];
494  for (x = last; x <= -1; x++)
495  ref_tmp[x] = top[-1 + ((x * inv_angle[mode - 11] + 128) >> 8)];
496  ref = ref_tmp;
497  }
498 
499  for (x = 0; x < size; x++) {
500  int idx = ((x + 1) * angle) >> 5;
501  int fact = ((x + 1) * angle) & 31;
502  if (fact) {
503  for (y = 0; y < size; y++) {
504  POS(x, y) = ((32 - fact) * ref[y + idx + 1] +
505  fact * ref[y + idx + 2] + 16) >> 5;
506  }
507  } else {
508  for (y = 0; y < size; y++)
509  POS(x, y) = ref[y + idx + 1];
510  }
511  }
512  if (mode == 10 && c_idx == 0 && size < 32) {
513  for (x = 0; x < size; x++)
514  POS(x, 0) = av_clip_pixel(left[0] + ((top[x] - top[-1]) >> 1));
515  }
516  }
517 }
518 
519 static void FUNC(pred_angular_0)(uint8_t *src, const uint8_t *top,
520  const uint8_t *left,
521  ptrdiff_t stride, int c_idx, int mode)
522 {
523  FUNC(pred_angular)(src, top, left, stride, c_idx, mode, 1 << 2);
524 }
525 
526 static void FUNC(pred_angular_1)(uint8_t *src, const uint8_t *top,
527  const uint8_t *left,
528  ptrdiff_t stride, int c_idx, int mode)
529 {
530  FUNC(pred_angular)(src, top, left, stride, c_idx, mode, 1 << 3);
531 }
532 
533 static void FUNC(pred_angular_2)(uint8_t *src, const uint8_t *top,
534  const uint8_t *left,
535  ptrdiff_t stride, int c_idx, int mode)
536 {
537  FUNC(pred_angular)(src, top, left, stride, c_idx, mode, 1 << 4);
538 }
539 
540 static void FUNC(pred_angular_3)(uint8_t *src, const uint8_t *top,
541  const uint8_t *left,
542  ptrdiff_t stride, int c_idx, int mode)
543 {
544  FUNC(pred_angular)(src, top, left, stride, c_idx, mode, 1 << 5);
545 }
546 
547 #undef EXTEND_LEFT_CIP
548 #undef EXTEND_RIGHT_CIP
549 #undef EXTEND_UP_CIP
550 #undef EXTEND_DOWN_CIP
551 #undef IS_INTRA
552 #undef MVF_PU
553 #undef MVF
554 #undef PU
555 #undef EXTEND_LEFT
556 #undef EXTEND_RIGHT
557 #undef EXTEND_UP
558 #undef EXTEND_DOWN
559 #undef MIN_TB_ADDR_ZS
560 #undef POS