memmove.c 7.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284
  1. /* Copy memory to memory until the specified number of bytes
  2. has been copied. Overlap is handled correctly.
  3. Copyright (C) 1991, 1995, 1996, 1997, 2003 Free Software Foundation, Inc.
  4. This file is part of the GNU C Library.
  5. Contributed by Torbjorn Granlund (tege@sics.se).
  6. The GNU C Library is free software; you can redistribute it and/or
  7. modify it under the terms of the GNU Lesser General Public
  8. License as published by the Free Software Foundation; either
  9. version 2.1 of the License, or (at your option) any later version.
  10. The GNU C Library is distributed in the hope that it will be useful,
  11. but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  13. Lesser General Public License for more details.
  14. You should have received a copy of the GNU Lesser General Public
  15. License along with the GNU C Library; if not, write to the Free
  16. Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
  17. 02111-1307 USA. */
  18. #define memcpy __memcpy
  19. #include <string.h>
  20. #include "memcopy.h"
  21. #include "pagecopy.h"
  22. static void _wordcopy_bwd_aligned (long int dstp, long int srcp, size_t len)
  23. {
  24. op_t a0, a1;
  25. switch (len % 8)
  26. {
  27. case 2:
  28. srcp -= 2 * OPSIZ;
  29. dstp -= 1 * OPSIZ;
  30. a0 = ((op_t *) srcp)[1];
  31. len += 6;
  32. goto do1;
  33. case 3:
  34. srcp -= 3 * OPSIZ;
  35. dstp -= 2 * OPSIZ;
  36. a1 = ((op_t *) srcp)[2];
  37. len += 5;
  38. goto do2;
  39. case 4:
  40. srcp -= 4 * OPSIZ;
  41. dstp -= 3 * OPSIZ;
  42. a0 = ((op_t *) srcp)[3];
  43. len += 4;
  44. goto do3;
  45. case 5:
  46. srcp -= 5 * OPSIZ;
  47. dstp -= 4 * OPSIZ;
  48. a1 = ((op_t *) srcp)[4];
  49. len += 3;
  50. goto do4;
  51. case 6:
  52. srcp -= 6 * OPSIZ;
  53. dstp -= 5 * OPSIZ;
  54. a0 = ((op_t *) srcp)[5];
  55. len += 2;
  56. goto do5;
  57. case 7:
  58. srcp -= 7 * OPSIZ;
  59. dstp -= 6 * OPSIZ;
  60. a1 = ((op_t *) srcp)[6];
  61. len += 1;
  62. goto do6;
  63. case 0:
  64. if (OP_T_THRES <= 3 * OPSIZ && len == 0)
  65. return;
  66. srcp -= 8 * OPSIZ;
  67. dstp -= 7 * OPSIZ;
  68. a0 = ((op_t *) srcp)[7];
  69. goto do7;
  70. case 1:
  71. srcp -= 9 * OPSIZ;
  72. dstp -= 8 * OPSIZ;
  73. a1 = ((op_t *) srcp)[8];
  74. len -= 1;
  75. if (OP_T_THRES <= 3 * OPSIZ && len == 0)
  76. goto do0;
  77. goto do8; /* No-op. */
  78. }
  79. do
  80. {
  81. do8:
  82. a0 = ((op_t *) srcp)[7];
  83. ((op_t *) dstp)[7] = a1;
  84. do7:
  85. a1 = ((op_t *) srcp)[6];
  86. ((op_t *) dstp)[6] = a0;
  87. do6:
  88. a0 = ((op_t *) srcp)[5];
  89. ((op_t *) dstp)[5] = a1;
  90. do5:
  91. a1 = ((op_t *) srcp)[4];
  92. ((op_t *) dstp)[4] = a0;
  93. do4:
  94. a0 = ((op_t *) srcp)[3];
  95. ((op_t *) dstp)[3] = a1;
  96. do3:
  97. a1 = ((op_t *) srcp)[2];
  98. ((op_t *) dstp)[2] = a0;
  99. do2:
  100. a0 = ((op_t *) srcp)[1];
  101. ((op_t *) dstp)[1] = a1;
  102. do1:
  103. a1 = ((op_t *) srcp)[0];
  104. ((op_t *) dstp)[0] = a0;
  105. srcp -= 8 * OPSIZ;
  106. dstp -= 8 * OPSIZ;
  107. len -= 8;
  108. }
  109. while (len != 0);
  110. /* This is the right position for do0. Please don't move
  111. it into the loop. */
  112. do0:
  113. ((op_t *) dstp)[7] = a1;
  114. }
  115. /* _wordcopy_bwd_dest_aligned -- Copy block finishing right
  116. before SRCP to block finishing right before DSTP with LEN `op_t'
  117. words (not LEN bytes!). DSTP should be aligned for memory
  118. operations on `op_t', but SRCP must *not* be aligned. */
  119. static void _wordcopy_bwd_dest_aligned (long int dstp, long int srcp, size_t len)
  120. {
  121. op_t a0, a1, a2, a3;
  122. int sh_1, sh_2;
  123. /* Calculate how to shift a word read at the memory operation
  124. aligned srcp to make it aligned for copy. */
  125. sh_1 = 8 * (srcp % OPSIZ);
  126. sh_2 = 8 * OPSIZ - sh_1;
  127. /* Make srcp aligned by rounding it down to the beginning of the op_t
  128. it points in the middle of. */
  129. srcp &= -OPSIZ;
  130. srcp += OPSIZ;
  131. switch (len % 4)
  132. {
  133. case 2:
  134. srcp -= 3 * OPSIZ;
  135. dstp -= 1 * OPSIZ;
  136. a2 = ((op_t *) srcp)[2];
  137. a1 = ((op_t *) srcp)[1];
  138. len += 2;
  139. goto do1;
  140. case 3:
  141. srcp -= 4 * OPSIZ;
  142. dstp -= 2 * OPSIZ;
  143. a3 = ((op_t *) srcp)[3];
  144. a2 = ((op_t *) srcp)[2];
  145. len += 1;
  146. goto do2;
  147. case 0:
  148. if (OP_T_THRES <= 3 * OPSIZ && len == 0)
  149. return;
  150. srcp -= 5 * OPSIZ;
  151. dstp -= 3 * OPSIZ;
  152. a0 = ((op_t *) srcp)[4];
  153. a3 = ((op_t *) srcp)[3];
  154. goto do3;
  155. case 1:
  156. srcp -= 6 * OPSIZ;
  157. dstp -= 4 * OPSIZ;
  158. a1 = ((op_t *) srcp)[5];
  159. a0 = ((op_t *) srcp)[4];
  160. len -= 1;
  161. if (OP_T_THRES <= 3 * OPSIZ && len == 0)
  162. goto do0;
  163. goto do4; /* No-op. */
  164. }
  165. do
  166. {
  167. do4:
  168. a3 = ((op_t *) srcp)[3];
  169. ((op_t *) dstp)[3] = MERGE (a0, sh_1, a1, sh_2);
  170. do3:
  171. a2 = ((op_t *) srcp)[2];
  172. ((op_t *) dstp)[2] = MERGE (a3, sh_1, a0, sh_2);
  173. do2:
  174. a1 = ((op_t *) srcp)[1];
  175. ((op_t *) dstp)[1] = MERGE (a2, sh_1, a3, sh_2);
  176. do1:
  177. a0 = ((op_t *) srcp)[0];
  178. ((op_t *) dstp)[0] = MERGE (a1, sh_1, a2, sh_2);
  179. srcp -= 4 * OPSIZ;
  180. dstp -= 4 * OPSIZ;
  181. len -= 4;
  182. }
  183. while (len != 0);
  184. /* This is the right position for do0. Please don't move
  185. it into the loop. */
  186. do0:
  187. ((op_t *) dstp)[3] = MERGE (a0, sh_1, a1, sh_2);
  188. }
  189. #undef memmove
  190. void attribute_hidden *__memmove (void *dest, const void *src, size_t len)
  191. {
  192. unsigned long int dstp = (long int) dest;
  193. unsigned long int srcp = (long int) src;
  194. /* This test makes the forward copying code be used whenever possible.
  195. Reduces the working set. */
  196. if (dstp - srcp >= len) /* *Unsigned* compare! */
  197. {
  198. #if 1
  199. #warning REMINDER: generic-opt memmove assumes memcpy does forward copying!
  200. memcpy(dest, src, len);
  201. #else
  202. /* Copy from the beginning to the end. */
  203. /* If there not too few bytes to copy, use word copy. */
  204. if (len >= OP_T_THRES)
  205. {
  206. /* Copy just a few bytes to make DSTP aligned. */
  207. len -= (-dstp) % OPSIZ;
  208. BYTE_COPY_FWD (dstp, srcp, (-dstp) % OPSIZ);
  209. /* Copy whole pages from SRCP to DSTP by virtual address
  210. manipulation, as much as possible. */
  211. PAGE_COPY_FWD_MAYBE (dstp, srcp, len, len);
  212. /* Copy from SRCP to DSTP taking advantage of the known
  213. alignment of DSTP. Number of bytes remaining is put
  214. in the third argument, i.e. in LEN. This number may
  215. vary from machine to machine. */
  216. WORD_COPY_FWD (dstp, srcp, len, len);
  217. /* Fall out and copy the tail. */
  218. }
  219. /* There are just a few bytes to copy. Use byte memory operations. */
  220. BYTE_COPY_FWD (dstp, srcp, len);
  221. #endif
  222. }
  223. else
  224. {
  225. /* Copy from the end to the beginning. */
  226. srcp += len;
  227. dstp += len;
  228. /* If there not too few bytes to copy, use word copy. */
  229. if (len >= OP_T_THRES)
  230. {
  231. /* Copy just a few bytes to make DSTP aligned. */
  232. len -= dstp % OPSIZ;
  233. BYTE_COPY_BWD (dstp, srcp, dstp % OPSIZ);
  234. /* Copy from SRCP to DSTP taking advantage of the known
  235. alignment of DSTP. Number of bytes remaining is put
  236. in the third argument, i.e. in LEN. This number may
  237. vary from machine to machine. */
  238. WORD_COPY_BWD (dstp, srcp, len, len);
  239. /* Fall out and copy the tail. */
  240. }
  241. /* There are just a few bytes to copy. Use byte memory operations. */
  242. BYTE_COPY_BWD (dstp, srcp, len);
  243. }
  244. return (dest);
  245. }
  246. strong_alias(__memmove, memmove)