_modsi3.S 2.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899
  1. .macro ARM_MOD_BODY dividend, divisor, order, spare
  2. #if __LINUX_ARM_ARCH__ >= 5
  3. clz \order, \divisor
  4. clz \spare, \dividend
  5. sub \order, \order, \spare
  6. mov \divisor, \divisor, lsl \order
  7. #else
  8. mov \order, #0
  9. @ Unless the divisor is very big, shift it up in multiples of
  10. @ four bits, since this is the amount of unwinding in the main
  11. @ division loop. Continue shifting until the divisor is
  12. @ larger than the dividend.
  13. 1: cmp \divisor, #0x10000000
  14. cmplo \divisor, \dividend
  15. movlo \divisor, \divisor, lsl #4
  16. addlo \order, \order, #4
  17. blo 1b
  18. @ For very big divisors, we must shift it a bit at a time, or
  19. @ we will be in danger of overflowing.
  20. 1: cmp \divisor, #0x80000000
  21. cmplo \divisor, \dividend
  22. movlo \divisor, \divisor, lsl #1
  23. addlo \order, \order, #1
  24. blo 1b
  25. #endif
  26. @ Perform all needed substractions to keep only the reminder.
  27. @ Do comparisons in batch of 4 first.
  28. subs \order, \order, #3 @ yes, 3 is intended here
  29. blt 2f
  30. 1: cmp \dividend, \divisor
  31. subhs \dividend, \dividend, \divisor
  32. cmp \dividend, \divisor, lsr #1
  33. subhs \dividend, \dividend, \divisor, lsr #1
  34. cmp \dividend, \divisor, lsr #2
  35. subhs \dividend, \dividend, \divisor, lsr #2
  36. cmp \dividend, \divisor, lsr #3
  37. subhs \dividend, \dividend, \divisor, lsr #3
  38. cmp \dividend, #1
  39. mov \divisor, \divisor, lsr #4
  40. subges \order, \order, #4
  41. bge 1b
  42. tst \order, #3
  43. teqne \dividend, #0
  44. beq 5f
  45. @ Either 1, 2 or 3 comparison/substractions are left.
  46. 2: cmn \order, #2
  47. blt 4f
  48. beq 3f
  49. cmp \dividend, \divisor
  50. subhs \dividend, \dividend, \divisor
  51. mov \divisor, \divisor, lsr #1
  52. 3: cmp \dividend, \divisor
  53. subhs \dividend, \dividend, \divisor
  54. mov \divisor, \divisor, lsr #1
  55. 4: cmp \dividend, \divisor
  56. subhs \dividend, \dividend, \divisor
  57. 5:
  58. .endm
  59. .align 5
  60. .globl __modsi3
  61. __modsi3:
  62. cmp r1, #0
  63. beq Ldiv0
  64. rsbmi r1, r1, #0 @ loops below use unsigned.
  65. movs ip, r0 @ preserve sign of dividend
  66. rsbmi r0, r0, #0 @ if negative make positive
  67. subs r2, r1, #1 @ compare divisor with 1
  68. cmpne r0, r1 @ compare dividend with divisor
  69. moveq r0, #0
  70. tsthi r1, r2 @ see if divisor is power of 2
  71. andeq r0, r0, r2
  72. bls 10f
  73. ARM_MOD_BODY r0, r1, r2, r3
  74. 10: cmp ip, #0
  75. rsbmi r0, r0, #0
  76. mov pc, lr
  77. Ldiv0:
  78. str lr, [sp, #-4]!
  79. bl __div0
  80. mov r0, #0 @ About as wrong as it could be.
  81. ldr pc, [sp], #4