memcpy.c 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179
  1. /*
  2. * Copyright (C) 2004 by egnite Software GmbH. All rights reserved.
  3. *
  4. * Redistribution and use in source and binary forms, with or without
  5. * modification, are permitted provided that the following conditions
  6. * are met:
  7. *
  8. * 1. Redistributions of source code must retain the above copyright
  9. * notice, this list of conditions and the following disclaimer.
  10. * 2. Redistributions in binary form must reproduce the above copyright
  11. * notice, this list of conditions and the following disclaimer in the
  12. * documentation and/or other materials provided with the distribution.
  13. * 3. Neither the name of the copyright holders nor the names of
  14. * contributors may be used to endorse or promote products derived
  15. * from this software without specific prior written permission.
  16. *
  17. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  18. * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  19. * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
  20. * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
  21. * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
  22. * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
  23. * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
  24. * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
  25. * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  26. * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
  27. * THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  28. * SUCH DAMAGE.
  29. *
  30. * For additional information see http://www.ethernut.de/
  31. *
  32. *-
  33. * Copyright (c) 1990 The Regents of the University of California.
  34. * All rights reserved.
  35. *
  36. * This code is derived from software contributed to Berkeley by
  37. * Chris Torek.
  38. *
  39. * Redistribution and use in source and binary forms, with or without
  40. * modification, are permitted provided that the following conditions
  41. * are met:
  42. * 1. Redistributions of source code must retain the above copyright
  43. * notice, this list of conditions and the following disclaimer.
  44. * 2. Redistributions in binary form must reproduce the above copyright
  45. * notice, this list of conditions and the following disclaimer in the
  46. * documentation and/or other materials provided with the distribution.
  47. * 3. Neither the name of the University nor the names of its contributors
  48. * may be used to endorse or promote products derived from this software
  49. * without specific prior written permission.
  50. *
  51. * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  52. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  53. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  54. * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  55. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  56. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  57. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  58. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  59. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  60. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  61. * SUCH DAMAGE.
  62. */
  63. /*
  64. * $Log$
  65. * Revision 1.3 2008/02/15 17:13:01 haraldkipp
  66. * Use configurable constant attribute.
  67. *
  68. * Revision 1.2 2005/08/02 17:46:47 haraldkipp
  69. * Major API documentation update.
  70. *
  71. * Revision 1.1 2004/09/08 10:23:43 haraldkipp
  72. * Generic C string library added
  73. *
  74. */
  75. #include <compiler.h>
  76. #include <string.h>
  77. /*!
  78. * \addtogroup xgCrtString
  79. */
  80. /*@{*/
  81. /*!
  82. * \brief Copy a string.
  83. *
  84. * Copies a source string including the terminating zero character to
  85. * a destination string.
  86. *
  87. * \note The function does not perform any overflow checking.
  88. *
  89. * \param dst Pointer to the destination string.
  90. * \param src Pointer to the source string.
  91. *
  92. * \return The original destination pointer.
  93. */
  94. /*
  95. * sizeof(word) MUST BE A POWER OF TWO
  96. * SO THAT wmask BELOW IS ALL ONES
  97. */
  98. typedef long word; /* "word" used for optimal copy speed */
  99. #define wsize sizeof(word)
  100. #define wmask (wsize - 1)
  101. /*
  102. * Copy a block of memory, handling overlap.
  103. * This is the routine that actually implements
  104. * (the portable versions of) bcopy, memcpy, and memmove.
  105. */
  106. void *memcpy(void *dst0, const void *src0, size_t length)
  107. {
  108. register char *dst = dst0;
  109. register const char *src = src0;
  110. register size_t t;
  111. if (length == 0 || dst == src) /* nothing to do */
  112. goto done;
  113. /*
  114. * Macros: loop-t-times; and loop-t-times, t>0
  115. */
  116. #define TLOOP(s) if (t) TLOOP1(s)
  117. #define TLOOP1(s) do { s; } while (--t)
  118. if ((unsigned long)dst < (unsigned long)src) {
  119. /*
  120. * Copy forward.
  121. */
  122. t = (long)src; /* only need low bits */
  123. if ((t | (long)dst) & wmask) {
  124. /*
  125. * Try to align operands. This cannot be done
  126. * unless the low bits match.
  127. */
  128. if ((t ^ (long)dst) & wmask || length < wsize)
  129. t = length;
  130. else
  131. t = wsize - (t & wmask);
  132. length -= t;
  133. TLOOP1(*dst++ = *src++);
  134. }
  135. /*
  136. * Copy whole words, then mop up any trailing bytes.
  137. */
  138. t = length / wsize;
  139. TLOOP(*(word *)dst = *(word *)src; src += wsize; dst += wsize);
  140. t = length & wmask;
  141. TLOOP(*dst++ = *src++);
  142. } else {
  143. /*
  144. * Copy backwards. Otherwise essentially the same.
  145. * Alignment works as before, except that it takes
  146. * (t&wmask) bytes to align, not wsize-(t&wmask).
  147. */
  148. src += length;
  149. dst += length;
  150. t = (long)src;
  151. if ((t | (long)dst) & wmask) {
  152. if ((t ^ (long)dst) & wmask || length <= wsize)
  153. t = length;
  154. else
  155. t &= wmask;
  156. length -= t;
  157. TLOOP1(*--dst = *--src);
  158. }
  159. t = length / wsize;
  160. TLOOP(src -= wsize; dst -= wsize; *(word *)dst = *(word *)src);
  161. t = length & wmask;
  162. TLOOP(*--dst = *--src);
  163. }
  164. done:
  165. return dst0;
  166. }
  167. /*@}*/