udivdi3.S 2.2 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970
  1. //===----------------------Hexagon builtin routine ------------------------===//
  2. //
  3. // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
  4. // See https://llvm.org/LICENSE.txt for license information.
  5. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  6. //
  7. //===----------------------------------------------------------------------===//
  8. .macro FUNCTION_BEGIN name
  9. .text
  10. .p2align 5
  11. .globl \name
  12. .type \name, @function
  13. \name:
  14. .endm
  15. .macro FUNCTION_END name
  16. .size \name, . - \name
  17. .endm
  18. FUNCTION_BEGIN __hexagon_udivdi3
  19. {
  20. r6 = cl0(r1:0) // count leading 0's of dividend (numerator)
  21. r7 = cl0(r3:2) // count leading 0's of divisor (denominator)
  22. r5:4 = r3:2 // divisor moved into working registers
  23. r3:2 = r1:0 // dividend is the initial remainder, r3:2 contains remainder
  24. }
  25. {
  26. r10 = sub(r7,r6) // left shift count for bit & divisor
  27. r1:0 = #0 // initialize quotient to 0
  28. r15:14 = #1 // initialize bit to 1
  29. }
  30. {
  31. r11 = add(r10,#1) // loop count is 1 more than shift count
  32. r13:12 = lsl(r5:4,r10) // shift divisor msb into same bit position as dividend msb
  33. r15:14 = lsl(r15:14,r10) // shift the bit left by same amount as divisor
  34. }
  35. {
  36. p0 = cmp.gtu(r5:4,r3:2) // check if divisor > dividend
  37. loop0(1f,r11) // register loop
  38. }
  39. {
  40. if (p0) jumpr r31 // if divisor > dividend, we're done, so return
  41. }
  42. .falign
  43. 1:
  44. {
  45. p0 = cmp.gtu(r13:12,r3:2) // set predicate reg if shifted divisor > current remainder
  46. }
  47. {
  48. r7:6 = sub(r3:2, r13:12) // subtract shifted divisor from current remainder
  49. r9:8 = add(r1:0, r15:14) // save current quotient to temp (r9:8)
  50. }
  51. {
  52. r1:0 = vmux(p0, r1:0, r9:8) // choose either current quotient or new quotient (r9:8)
  53. r3:2 = vmux(p0, r3:2, r7:6) // choose either current remainder or new remainder (r7:6)
  54. }
  55. {
  56. r15:14 = lsr(r15:14, #1) // shift bit right by 1 for next iteration
  57. r13:12 = lsr(r13:12, #1) // shift "shifted divisor" right by 1 for next iteration
  58. }:endloop0
  59. {
  60. jumpr r31 // return
  61. }
  62. FUNCTION_END __hexagon_udivdi3
  63. .globl __qdsp_udivdi3
  64. .set __qdsp_udivdi3, __hexagon_udivdi3