You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

97 lines
2.8KB

  1. /*
  2. * Copyright (c) 2002-2004 Michael Niedermayer
  3. * Copyright (C) 2012 Ronald S. Bultje
  4. *
  5. * This file is part of Libav.
  6. *
  7. * Libav is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU Lesser General Public
  9. * License as published by the Free Software Foundation; either
  10. * version 2.1 of the License, or (at your option) any later version.
  11. *
  12. * Libav is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. * Lesser General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU Lesser General Public
  18. * License along with Libav; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. */
  21. #include <assert.h>
  22. #include "bit_depth_template.c"
  23. static void FUNC(ff_emulated_edge_mc)(uint8_t *buf, const uint8_t *src,
  24. ptrdiff_t buf_linesize,
  25. ptrdiff_t src_linesize,
  26. int block_w, int block_h,
  27. int src_x, int src_y, int w, int h)
  28. {
  29. int x, y;
  30. int start_y, start_x, end_y, end_x;
  31. if (src_y >= h) {
  32. src += (h - 1 - src_y) * src_linesize;
  33. src_y = h - 1;
  34. } else if (src_y <= -block_h) {
  35. src += (1 - block_h - src_y) * src_linesize;
  36. src_y = 1 - block_h;
  37. }
  38. if (src_x >= w) {
  39. src += (w - 1 - src_x) * sizeof(pixel);
  40. src_x = w - 1;
  41. } else if (src_x <= -block_w) {
  42. src += (1 - block_w - src_x) * sizeof(pixel);
  43. src_x = 1 - block_w;
  44. }
  45. start_y = FFMAX(0, -src_y);
  46. start_x = FFMAX(0, -src_x);
  47. end_y = FFMIN(block_h, h-src_y);
  48. end_x = FFMIN(block_w, w-src_x);
  49. assert(start_y < end_y && block_h);
  50. assert(start_x < end_x && block_w);
  51. w = end_x - start_x;
  52. src += start_y * src_linesize + start_x * sizeof(pixel);
  53. buf += start_x * sizeof(pixel);
  54. // top
  55. for (y = 0; y < start_y; y++) {
  56. memcpy(buf, src, w * sizeof(pixel));
  57. buf += buf_linesize;
  58. }
  59. // copy existing part
  60. for (; y < end_y; y++) {
  61. memcpy(buf, src, w * sizeof(pixel));
  62. src += src_linesize;
  63. buf += buf_linesize;
  64. }
  65. // bottom
  66. src -= src_linesize;
  67. for (; y < block_h; y++) {
  68. memcpy(buf, src, w * sizeof(pixel));
  69. buf += buf_linesize;
  70. }
  71. buf -= block_h * buf_linesize + start_x * sizeof(pixel);
  72. while (block_h--) {
  73. pixel *bufp = (pixel *) buf;
  74. // left
  75. for(x = 0; x < start_x; x++) {
  76. bufp[x] = bufp[start_x];
  77. }
  78. // right
  79. for (x = end_x; x < block_w; x++) {
  80. bufp[x] = bufp[end_x - 1];
  81. }
  82. buf += buf_linesize;
  83. }
  84. }