2 * This file is part of the libpayload project.
4 * It has originally been taken from the HelenOS project
5 * (http://www.helenos.eu), and slightly modified for our purposes.
7 * Copyright (c) 2005 Martin Decky
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
14 * - Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * - Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * - The name of the author may not be used to endorse or promote products
20 * derived from this software without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
23 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
24 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
25 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
26 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
27 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
29 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
30 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
31 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
34 #include <libpayload.h>
36 void *memset(void *s, int c, size_t n)
48 } __attribute__ ((packed));
50 static void *unaligned_memcpy(void *dst, const void *src, size_t n)
53 struct along *adst = dst;
54 const struct along *asrc = src;
56 for (i = 0; i < n / sizeof(unsigned long); i++)
57 adst[i].n = asrc[i].n;
59 for (j = 0; j < n % sizeof(unsigned long); j++)
60 ((unsigned char *)(((unsigned long *)dst) + i))[j] =
61 ((unsigned char *)(((unsigned long *)src) + i))[j];
66 void *memcpy(void *dst, const void *src, size_t n)
70 if (((long)dst & (sizeof(long) - 1))
71 || ((long)src & (sizeof(long) - 1)))
72 return unaligned_memcpy(dst, src, n);
74 for (i = 0; i < n / sizeof(unsigned long); i++)
75 ((unsigned long *)dst)[i] = ((unsigned long *)src)[i];
77 for (j = 0; j < n % sizeof(unsigned long); j++)
78 ((unsigned char *)(((unsigned long *)dst) + i))[j] =
79 ((unsigned char *)(((unsigned long *)src) + i))[j];
84 void *memmove(void *dst, const void *src, size_t n)
89 return memcpy(dst, src, n);
91 for (j = (n % sizeof(unsigned long)) - 1; j >= 0; j--)
92 ((unsigned char *)((unsigned long *)dst))[j] =
93 ((unsigned char *)((unsigned long *)src))[j];
95 for (i = n / sizeof(unsigned long) - 1; i >= 0; i--)
96 ((unsigned long *)dst)[i] = ((unsigned long *)src)[i];
102 * Compare two memory areas.
104 * @param s1 Pointer to the first area to compare.
105 * @param s2 Pointer to the second area to compare.
106 * @param len Size of the first area in bytes. Both areas must have the same
108 * @return If len is 0, return zero. If the areas match, return zero.
109 * Otherwise return non-zero.
111 int memcmp(const char *s1, const char *s2, size_t len)
113 for (; len && *s1++ == *s2++; len--) ;