muldi3.S 2.3 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374
  1. /*
  2. * Copyright 2008 Analog Devices Inc.
  3. *
  4. * Licensed under the Clear BSD license or the GPL-2 (or later)
  5. */
  6. .align 2
  7. .global ___muldi3;
  8. .type ___muldi3, STT_FUNC;
  9. #ifdef CONFIG_ARITHMETIC_OPS_L1
  10. .section .l1.text
  11. #else
  12. .text
  13. #endif
  14. /*
  15. R1:R0 * R3:R2
  16. = R1.h:R1.l:R0.h:R0.l * R3.h:R3.l:R2.h:R2.l
  17. [X] = (R1.h * R3.h) * 2^96
  18. [X] + (R1.h * R3.l + R1.l * R3.h) * 2^80
  19. [X] + (R1.h * R2.h + R1.l * R3.l + R3.h * R0.h) * 2^64
  20. [T1] + (R1.h * R2.l + R3.h * R0.l + R1.l * R2.h + R3.l * R0.h) * 2^48
  21. [T2] + (R1.l * R2.l + R3.l * R0.l + R0.h * R2.h) * 2^32
  22. [T3] + (R0.l * R2.h + R2.l * R0.h) * 2^16
  23. [T4] + (R0.l * R2.l)
  24. We can discard the first three lines marked "X" since we produce
  25. only a 64 bit result. So, we need ten 16-bit multiplies.
  26. Individual mul-acc results:
  27. [E1] = R1.h * R2.l + R3.h * R0.l + R1.l * R2.h + R3.l * R0.h
  28. [E2] = R1.l * R2.l + R3.l * R0.l + R0.h * R2.h
  29. [E3] = R0.l * R2.h + R2.l * R0.h
  30. [E4] = R0.l * R2.l
  31. We also need to add high parts from lower-level results to higher ones:
  32. E[n]c = E[n] + (E[n+1]c >> 16), where E4c := E4
  33. One interesting property is that all parts of the result that depend
  34. on the sign of the multiplication are discarded. Those would be the
  35. multiplications involving R1.h and R3.h, but only the top 16 bit of
  36. the 32 bit result depend on the sign, and since R1.h and R3.h only
  37. occur in E1, the top half of these results is cut off.
  38. So, we can just use FU mode for all of the 16-bit multiplies, and
  39. ignore questions of when to use mixed mode. */
  40. ___muldi3:
  41. /* [SP] technically is part of the caller's frame, but we can
  42. use it as scratch space. */
  43. A0 = R2.H * R1.L, A1 = R2.L * R1.H (FU) || R3 = [SP + 12]; /* E1 */
  44. A0 += R3.H * R0.L, A1 += R3.L * R0.H (FU) || [SP] = R4; /* E1 */
  45. A0 += A1; /* E1 */
  46. R4 = A0.w;
  47. A0 = R0.l * R3.l (FU); /* E2 */
  48. A0 += R2.l * R1.l (FU); /* E2 */
  49. A1 = R2.L * R0.L (FU); /* E4 */
  50. R3 = A1.w;
  51. A1 = A1 >> 16; /* E3c */
  52. A0 += R2.H * R0.H, A1 += R2.L * R0.H (FU); /* E2, E3c */
  53. A1 += R0.L * R2.H (FU); /* E3c */
  54. R0 = A1.w;
  55. A1 = A1 >> 16; /* E2c */
  56. A0 += A1; /* E2c */
  57. R1 = A0.w;
  58. /* low(result) = low(E3c):low(E4) */
  59. R0 = PACK (R0.l, R3.l);
  60. /* high(result) = E2c + (E1 << 16) */
  61. R1.h = R1.h + R4.l (NS) || R4 = [SP];
  62. RTS;
  63. .size ___muldi3, .-___muldi3