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.

122 lines
2.8KB

  1. /*
  2. * simple math operations
  3. * Copyright (c) 2006 Michael Niedermayer <michaelni@gmx.at> et al
  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. #ifndef AVCODEC_X86_MATHOPS_H
  22. #define AVCODEC_X86_MATHOPS_H
  23. #include "config.h"
  24. #include "libavutil/common.h"
  25. #if ARCH_X86_32
  26. #define MULL MULL
  27. static av_always_inline av_const int MULL(int a, int b, unsigned shift)
  28. {
  29. int rt, dummy;
  30. __asm__ (
  31. "imull %3 \n\t"
  32. "shrdl %4, %%edx, %%eax \n\t"
  33. :"=a"(rt), "=d"(dummy)
  34. :"a"(a), "rm"(b), "ci"((uint8_t)shift)
  35. );
  36. return rt;
  37. }
  38. #define MULH MULH
  39. static av_always_inline av_const int MULH(int a, int b)
  40. {
  41. int rt, dummy;
  42. __asm__ (
  43. "imull %3"
  44. :"=d"(rt), "=a"(dummy)
  45. :"a"(a), "rm"(b)
  46. );
  47. return rt;
  48. }
  49. #define MUL64 MUL64
  50. static av_always_inline av_const int64_t MUL64(int a, int b)
  51. {
  52. int64_t rt;
  53. __asm__ (
  54. "imull %2"
  55. :"=A"(rt)
  56. :"a"(a), "rm"(b)
  57. );
  58. return rt;
  59. }
  60. #endif /* ARCH_X86_32 */
  61. #if HAVE_CMOV
  62. /* median of 3 */
  63. #define mid_pred mid_pred
  64. static inline av_const int mid_pred(int a, int b, int c)
  65. {
  66. int i=b;
  67. __asm__ volatile(
  68. "cmp %2, %1 \n\t"
  69. "cmovg %1, %0 \n\t"
  70. "cmovg %2, %1 \n\t"
  71. "cmp %3, %1 \n\t"
  72. "cmovl %3, %1 \n\t"
  73. "cmp %1, %0 \n\t"
  74. "cmovg %1, %0 \n\t"
  75. :"+&r"(i), "+&r"(a)
  76. :"r"(b), "r"(c)
  77. );
  78. return i;
  79. }
  80. #endif
  81. #if HAVE_CMOV
  82. #define COPY3_IF_LT(x, y, a, b, c, d)\
  83. __asm__ volatile(\
  84. "cmpl %0, %3 \n\t"\
  85. "cmovl %3, %0 \n\t"\
  86. "cmovl %4, %1 \n\t"\
  87. "cmovl %5, %2 \n\t"\
  88. : "+&r" (x), "+&r" (a), "+r" (c)\
  89. : "r" (y), "r" (b), "r" (d)\
  90. );
  91. #endif
  92. // avoid +32 for shift optimization (gcc should do that ...)
  93. #define NEG_SSR32 NEG_SSR32
  94. static inline int32_t NEG_SSR32( int32_t a, int8_t s){
  95. __asm__ ("sarl %1, %0\n\t"
  96. : "+r" (a)
  97. : "ic" ((uint8_t)(-s))
  98. );
  99. return a;
  100. }
  101. #define NEG_USR32 NEG_USR32
  102. static inline uint32_t NEG_USR32(uint32_t a, int8_t s){
  103. __asm__ ("shrl %1, %0\n\t"
  104. : "+r" (a)
  105. : "ic" ((uint8_t)(-s))
  106. );
  107. return a;
  108. }
  109. #endif /* AVCODEC_X86_MATHOPS_H */