udivsi3.S 1.9 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485
  1. /* SPDX-License-Identifier: GPL-2.0 */
  2. #include <linux/linkage.h>
  3. /*
  4. * Unsigned divide operation.
  5. * Input : Divisor in Reg r5
  6. * Dividend in Reg r6
  7. * Output: Result in Reg r3
  8. */
  9. .text
  10. .globl __udivsi3
  11. .type __udivsi3, @function
  12. .ent __udivsi3
  13. __udivsi3:
  14. .frame r1, 0, r15
  15. addik r1, r1, -12
  16. swi r29, r1, 0
  17. swi r30, r1, 4
  18. swi r31, r1, 8
  19. beqi r6, div_by_zero /* div_by_zero /* division error */
  20. beqid r5, result_is_zero /* result is zero */
  21. addik r30, r0, 0 /* clear mod */
  22. addik r29, r0, 32 /* initialize the loop count */
  23. /* check if r6 and r5 are equal - if yes, return 1 */
  24. rsub r18, r5, r6
  25. beqid r18, return_here
  26. addik r3, r0, 1
  27. /* check if (uns)r6 is greater than (uns)r5. in that case, just return 0 */
  28. xor r18, r5, r6
  29. bgeid r18, 16
  30. add r3, r0, r0 /* we would anyways clear r3 */
  31. blti r6, return_here /* r6[bit 31 = 1] hence is greater */
  32. bri checkr6
  33. rsub r18, r6, r5 /* microblazecmp */
  34. blti r18, return_here
  35. /* if r6 [bit 31] is set, then return result as 1 */
  36. checkr6:
  37. bgti r6, div0
  38. brid return_here
  39. addik r3, r0, 1
  40. /* first part try to find the first '1' in the r5 */
  41. div0:
  42. blti r5, div2
  43. div1:
  44. add r5, r5, r5 /* left shift logical r5 */
  45. bgtid r5, div1
  46. addik r29, r29, -1
  47. div2:
  48. /* left shift logical r5 get the '1' into the carry */
  49. add r5, r5, r5
  50. addc r30, r30, r30 /* move that bit into the mod register */
  51. rsub r31, r6, r30 /* try to subtract (r30 a r6) */
  52. blti r31, mod_too_small
  53. /* move the r31 to mod since the result was positive */
  54. or r30, r0, r31
  55. addik r3, r3, 1
  56. mod_too_small:
  57. addik r29, r29, -1
  58. beqi r29, loop_end
  59. add r3, r3, r3 /* shift in the '1' into div */
  60. bri div2 /* div2 */
  61. loop_end:
  62. bri return_here
  63. div_by_zero:
  64. result_is_zero:
  65. or r3, r0, r0 /* set result to 0 */
  66. return_here:
  67. /* restore values of csrs and that of r3 and the divisor and the dividend */
  68. lwi r29, r1, 0
  69. lwi r30, r1, 4
  70. lwi r31, r1, 8
  71. rtsd r15, 8
  72. addik r1, r1, 12
  73. .size __udivsi3, . - __udivsi3
  74. .end __udivsi3