memcpy.S 4.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204
  1. /* Cloned and hacked for uClibc by Paul Mundt, December 2003 */
  2. /* Modified by SuperH, Inc. September 2003 */
  3. !
  4. ! Fast SH memcpy
  5. !
  6. ! by Toshiyasu Morita (tm@netcom.com)
  7. ! hacked by J"orn Rernnecke (joern.rennecke@superh.com) ("o for o-umlaut)
  8. ! SH5 code Copyright 2002 SuperH Ltd.
  9. !
  10. ! Entry: ARG0: destination pointer
  11. ! ARG1: source pointer
  12. ! ARG2: byte count
  13. !
  14. ! Exit: RESULT: destination pointer
  15. ! any other registers in the range r0-r7: trashed
  16. !
  17. ! Notes: Usually one wants to do small reads and write a longword, but
  18. ! unfortunately it is difficult in some cases to concatanate bytes
  19. ! into a longword on the SH, so this does a longword read and small
  20. ! writes.
  21. !
  22. ! This implementation makes two assumptions about how it is called:
  23. !
  24. ! 1.: If the byte count is nonzero, the address of the last byte to be
  25. ! copied is unsigned greater than the address of the first byte to
  26. ! be copied. This could be easily swapped for a signed comparison,
  27. ! but the algorithm used needs some comparison.
  28. !
  29. ! 2.: When there are two or three bytes in the last word of an 11-or-more
  30. ! bytes memory chunk to b copied, the rest of the word can be read
  31. ! without side effects.
  32. ! This could be easily changed by increasing the minumum size of
  33. ! a fast memcpy and the amount subtracted from r7 before L_2l_loop be 2,
  34. ! however, this would cost a few extra cyles on average.
  35. ! For SHmedia, the assumption is that any quadword can be read in its
  36. ! enirety if at least one byte is included in the copy.
  37. !
  38. .section .text..SHmedia32,"ax"
  39. .globl memcpy
  40. .set memcpy,__memcpy
  41. .globl __memcpy
  42. .hidden __memcpy
  43. .type __memcpy, @function
  44. .align 5
  45. __memcpy:
  46. #define LDUAQ(P,O,D0,D1) ldlo.q P,O,D0; ldhi.q P,O+7,D1
  47. #define STUAQ(P,O,D0,D1) stlo.q P,O,D0; sthi.q P,O+7,D1
  48. #define LDUAL(P,O,D0,D1) ldlo.l P,O,D0; ldhi.l P,O+3,D1
  49. #define STUAL(P,O,D0,D1) stlo.l P,O,D0; sthi.l P,O+3,D1
  50. ld.b r3,0,r63
  51. pta/l Large,tr0
  52. movi 25,r0
  53. bgeu/u r4,r0,tr0
  54. nsb r4,r0
  55. shlli r0,5,r0
  56. movi (L1-L0+63*32 + 1) & 0xffff,r1
  57. sub r1, r0, r0
  58. L0: ptrel r0,tr0
  59. add r2,r4,r5
  60. ptabs r18,tr1
  61. add r3,r4,r6
  62. blink tr0,r63
  63. /* Rearranged to make cut2 safe */
  64. .balign 8
  65. L4_7: /* 4..7 byte memcpy cntd. */
  66. stlo.l r2, 0, r0
  67. or r6, r7, r6
  68. sthi.l r5, -1, r6
  69. stlo.l r5, -4, r6
  70. blink tr1,r63
  71. .balign 8
  72. L1: /* 0 byte memcpy */
  73. nop
  74. blink tr1,r63
  75. nop
  76. nop
  77. nop
  78. nop
  79. L2_3: /* 2 or 3 byte memcpy cntd. */
  80. st.b r5,-1,r6
  81. blink tr1,r63
  82. /* 1 byte memcpy */
  83. ld.b r3,0,r0
  84. st.b r2,0,r0
  85. blink tr1,r63
  86. L8_15: /* 8..15 byte memcpy cntd. */
  87. stlo.q r2, 0, r0
  88. or r6, r7, r6
  89. sthi.q r5, -1, r6
  90. stlo.q r5, -8, r6
  91. blink tr1,r63
  92. /* 2 or 3 byte memcpy */
  93. ld.b r3,0,r0
  94. ld.b r2,0,r63
  95. ld.b r3,1,r1
  96. st.b r2,0,r0
  97. pta/l L2_3,tr0
  98. ld.b r6,-1,r6
  99. st.b r2,1,r1
  100. blink tr0, r63
  101. /* 4 .. 7 byte memcpy */
  102. LDUAL (r3, 0, r0, r1)
  103. pta L4_7, tr0
  104. ldlo.l r6, -4, r7
  105. or r0, r1, r0
  106. sthi.l r2, 3, r0
  107. ldhi.l r6, -1, r6
  108. blink tr0, r63
  109. /* 8 .. 15 byte memcpy */
  110. LDUAQ (r3, 0, r0, r1)
  111. pta L8_15, tr0
  112. ldlo.q r6, -8, r7
  113. or r0, r1, r0
  114. sthi.q r2, 7, r0
  115. ldhi.q r6, -1, r6
  116. blink tr0, r63
  117. /* 16 .. 24 byte memcpy */
  118. LDUAQ (r3, 0, r0, r1)
  119. LDUAQ (r3, 8, r8, r9)
  120. or r0, r1, r0
  121. sthi.q r2, 7, r0
  122. or r8, r9, r8
  123. sthi.q r2, 15, r8
  124. ldlo.q r6, -8, r7
  125. ldhi.q r6, -1, r6
  126. stlo.q r2, 8, r8
  127. stlo.q r2, 0, r0
  128. or r6, r7, r6
  129. sthi.q r5, -1, r6
  130. stlo.q r5, -8, r6
  131. blink tr1,r63
  132. Large:
  133. ld.b r2, 0, r63
  134. pta/l Loop_ua, tr1
  135. ori r3, -8, r7
  136. sub r2, r7, r22
  137. sub r3, r2, r6
  138. add r2, r4, r5
  139. ldlo.q r3, 0, r0
  140. addi r5, -16, r5
  141. movi 64+8, r27 // could subtract r7 from that.
  142. stlo.q r2, 0, r0
  143. sthi.q r2, 7, r0
  144. ldx.q r22, r6, r0
  145. bgtu/l r27, r4, tr1
  146. addi r5, -48, r27
  147. pta/l Loop_line, tr0
  148. addi r6, 64, r36
  149. addi r6, -24, r19
  150. addi r6, -16, r20
  151. addi r6, -8, r21
  152. Loop_line:
  153. ldx.q r22, r36, r63
  154. alloco r22, 32
  155. addi r22, 32, r22
  156. ldx.q r22, r19, r23
  157. sthi.q r22, -25, r0
  158. ldx.q r22, r20, r24
  159. ldx.q r22, r21, r25
  160. stlo.q r22, -32, r0
  161. ldx.q r22, r6, r0
  162. sthi.q r22, -17, r23
  163. sthi.q r22, -9, r24
  164. sthi.q r22, -1, r25
  165. stlo.q r22, -24, r23
  166. stlo.q r22, -16, r24
  167. stlo.q r22, -8, r25
  168. bgeu r27, r22, tr0
  169. Loop_ua:
  170. addi r22, 8, r22
  171. sthi.q r22, -1, r0
  172. stlo.q r22, -8, r0
  173. ldx.q r22, r6, r0
  174. bgtu/l r5, r22, tr1
  175. add r3, r4, r7
  176. ldlo.q r7, -8, r1
  177. sthi.q r22, 7, r0
  178. ldhi.q r7, -1, r7
  179. ptabs r18,tr1
  180. stlo.q r22, 0, r0
  181. or r1, r7, r1
  182. sthi.q r5, 15, r1
  183. stlo.q r5, 8, r1
  184. blink tr1, r63
  185. .size __memcpy,.-__memcpy