s_remquof.S 2.2 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768
  1. /*-
  2. * Copyright (c) 2005 David Schultz <[email protected]>
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions
  7. * are met:
  8. * 1. Redistributions of source code must retain the above copyright
  9. * notice, this list of conditions and the following disclaimer.
  10. * 2. Redistributions in binary form must reproduce the above copyright
  11. * notice, this list of conditions and the following disclaimer in the
  12. * documentation and/or other materials provided with the distribution.
  13. *
  14. * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
  15. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  16. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  17. * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  18. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  19. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  20. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  21. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  22. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  23. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  24. * SUCH DAMAGE.
  25. */
  26. /*
  27. * Based on public-domain remainder routine by J.T. Conklin <[email protected]>.
  28. */
  29. #include <amd64/bsd_asm.h>
  30. //__FBSDID("$FreeBSD: src/lib/msun/amd64/s_remquof.S,v 1.3 2011/01/07 16:13:12 kib Exp $");
  31. ENTRY(remquof)
  32. movss %xmm0,-4(%rsp)
  33. movss %xmm1,-8(%rsp)
  34. flds -8(%rsp)
  35. flds -4(%rsp)
  36. 1: fprem1
  37. fstsw %ax
  38. btw $10,%ax
  39. jc 1b
  40. fstp %st(1)
  41. /* Extract the three low-order bits of the quotient from C0,C3,C1. */
  42. shrl $6,%eax
  43. movl %eax,%ecx
  44. andl $0x108,%eax
  45. rorl $7,%eax
  46. orl %eax,%ecx
  47. roll $4,%eax
  48. orl %ecx,%eax
  49. andl $7,%eax
  50. /* Negate the quotient bits if x*y<0. Avoid using an unpredictable branch. */
  51. movl -8(%rsp),%ecx
  52. xorl -4(%rsp),%ecx
  53. sarl $16,%ecx
  54. sarl $16,%ecx
  55. xorl %ecx,%eax
  56. andl $1,%ecx
  57. addl %ecx,%eax
  58. /* Store the quotient and return. */
  59. movl %eax,(%rdi)
  60. fstps -4(%rsp)
  61. movss -4(%rsp),%xmm0
  62. ret
  63. END(remquof)