intel_init.c 1.8 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152
  1. /* intel_init.c - SSE2 optimized filter functions
  2. *
  3. * Copyright (c) 2018 Cosmin Truta
  4. * Copyright (c) 2016-2017 Glenn Randers-Pehrson
  5. * Written by Mike Klein and Matt Sarett, Google, Inc.
  6. * Derived from arm/arm_init.c
  7. *
  8. * This code is released under the libpng license.
  9. * For conditions of distribution and use, see the disclaimer
  10. * and license in png.h
  11. */
  12. #include "../pngpriv.h"
  13. #ifdef PNG_READ_SUPPORTED
  14. #if PNG_INTEL_SSE_IMPLEMENTATION > 0
  15. void
  16. png_init_filter_functions_sse2(png_structp pp, unsigned int bpp)
  17. {
  18. /* The techniques used to implement each of these filters in SSE operate on
  19. * one pixel at a time.
  20. * So they generally speed up 3bpp images about 3x, 4bpp images about 4x.
  21. * They can scale up to 6 and 8 bpp images and down to 2 bpp images,
  22. * but they'd not likely have any benefit for 1bpp images.
  23. * Most of these can be implemented using only MMX and 64-bit registers,
  24. * but they end up a bit slower than using the equally-ubiquitous SSE2.
  25. */
  26. png_debug(1, "in png_init_filter_functions_sse2");
  27. if (bpp == 3)
  28. {
  29. pp->read_filter[PNG_FILTER_VALUE_SUB-1] = png_read_filter_row_sub3_sse2;
  30. pp->read_filter[PNG_FILTER_VALUE_AVG-1] = png_read_filter_row_avg3_sse2;
  31. pp->read_filter[PNG_FILTER_VALUE_PAETH-1] =
  32. png_read_filter_row_paeth3_sse2;
  33. }
  34. else if (bpp == 4)
  35. {
  36. pp->read_filter[PNG_FILTER_VALUE_SUB-1] = png_read_filter_row_sub4_sse2;
  37. pp->read_filter[PNG_FILTER_VALUE_AVG-1] = png_read_filter_row_avg4_sse2;
  38. pp->read_filter[PNG_FILTER_VALUE_PAETH-1] =
  39. png_read_filter_row_paeth4_sse2;
  40. }
  41. /* No need optimize PNG_FILTER_VALUE_UP. The compiler should
  42. * autovectorize.
  43. */
  44. }
  45. #endif /* PNG_INTEL_SSE_IMPLEMENTATION > 0 */
  46. #endif /* PNG_READ_SUPPORTED */