blob: bf1f99b212cf5a15c919d8ae8f457ab9e129c028 [file] [log] [blame]
Uwe Hermannc52761b2008-03-20 00:02:07 +00001/*
2 * This file is part of the libpayload project.
3 *
4 * It has originally been taken from the HelenOS project
5 * (http://www.helenos.eu), and slightly modified for our purposes.
6 *
7 * Copyright (c) 2005 Martin Decky
8 * All rights reserved.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 *
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.
21 *
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.
32 */
33
34#include <libpayload.h>
35
36void *memset(void *s, int c, size_t n)
37{
38 char *os = s;
39
40 while (n--)
41 *(os++) = c;
42
43 return s;
44}
45
Uwe Hermannc52761b2008-03-20 00:02:07 +000046void *memcpy(void *dst, const void *src, size_t n)
47{
Jordan Crouse96f57ae2008-08-19 16:55:05 +000048 int i;
Uwe Hermannc52761b2008-03-20 00:02:07 +000049
Jordan Crouse96f57ae2008-08-19 16:55:05 +000050 for(i = 0; i < n % sizeof(unsigned long); i++)
51 ((unsigned char *) dst)[i] = ((unsigned char *) src)[i];
Uwe Hermannc52761b2008-03-20 00:02:07 +000052
Jordan Crouse96f57ae2008-08-19 16:55:05 +000053 n -= i;
54 src += i;
55 dst += i;
Uwe Hermannc52761b2008-03-20 00:02:07 +000056
Jordan Crouse96f57ae2008-08-19 16:55:05 +000057 for(i = 0; i < n / sizeof(unsigned long); i++)
58 ((unsigned long *) dst)[i] = ((unsigned long *) src)[i];
Uwe Hermannc52761b2008-03-20 00:02:07 +000059
Jordan Crouse96f57ae2008-08-19 16:55:05 +000060 return dst;
Uwe Hermannc52761b2008-03-20 00:02:07 +000061}
62
63void *memmove(void *dst, const void *src, size_t n)
64{
Jordan Crouse96f57ae2008-08-19 16:55:05 +000065 int i;
66 unsigned long offs;
Uwe Hermannc52761b2008-03-20 00:02:07 +000067
68 if (src > dst)
69 return memcpy(dst, src, n);
70
Jordan Crouse96f57ae2008-08-19 16:55:05 +000071 offs = n - (n % sizeof(unsigned long));
72
73 for (i = (n % sizeof(unsigned long)) - 1; i >= 0; i--)
74 ((unsigned char *)dst)[i + offs] =
75 ((unsigned char *)src)[i + offs];
Uwe Hermannc52761b2008-03-20 00:02:07 +000076
77 for (i = n / sizeof(unsigned long) - 1; i >= 0; i--)
78 ((unsigned long *)dst)[i] = ((unsigned long *)src)[i];
79
Jordan Crouse96f57ae2008-08-19 16:55:05 +000080 return dst;
Uwe Hermannc52761b2008-03-20 00:02:07 +000081}
82
83/**
84 * Compare two memory areas.
85 *
Uwe Hermann6a441bf2008-03-20 19:54:59 +000086 * @param s1 Pointer to the first area to compare.
87 * @param s2 Pointer to the second area to compare.
88 * @param len Size of the first area in bytes (both must have the same length).
89 * @return If len is 0, return zero. If the areas match, return zero.
90 * Otherwise return non-zero.
Uwe Hermannc52761b2008-03-20 00:02:07 +000091 */
Ulf Jordan68285692008-08-09 19:34:56 +000092int memcmp(const void *s1, const void *s2, size_t len)
Uwe Hermannc52761b2008-03-20 00:02:07 +000093{
Ulf Jordan68285692008-08-09 19:34:56 +000094 for (; len && *(char *)s1++ == *(char *)s2++; len--) ;
Uwe Hermannc52761b2008-03-20 00:02:07 +000095 return len;
96}