Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 1 | /* |
Dan Handley | e83b0ca | 2014-01-14 18:17:09 +0000 | [diff] [blame] | 2 | * Copyright (c) 2013-2014, ARM Limited and Contributors. All rights reserved. |
Achin Gupta | 4f6ad66 | 2013-10-25 09:08:21 +0100 | [diff] [blame] | 3 | * |
| 4 | * Redistribution and use in source and binary forms, with or without |
| 5 | * modification, are permitted provided that the following conditions are met: |
| 6 | * |
| 7 | * Redistributions of source code must retain the above copyright notice, this |
| 8 | * list of conditions and the following disclaimer. |
| 9 | * |
| 10 | * Redistributions in binary form must reproduce the above copyright notice, |
| 11 | * this list of conditions and the following disclaimer in the documentation |
| 12 | * and/or other materials provided with the distribution. |
| 13 | * |
| 14 | * Neither the name of ARM nor the names of its contributors may be used |
| 15 | * to endorse or promote products derived from this software without specific |
| 16 | * prior written permission. |
| 17 | * |
| 18 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| 19 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 20 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 21 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
| 22 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 23 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 24 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| 25 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 26 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| 27 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| 28 | * POSSIBILITY OF SUCH DAMAGE. |
| 29 | */ |
| 30 | |
| 31 | #include <stddef.h> /* size_t */ |
| 32 | |
| 33 | /* |
| 34 | * Fill @count bytes of memory pointed to by @dst with @val |
| 35 | */ |
| 36 | void *memset(void *dst, int val, size_t count) |
| 37 | { |
| 38 | char *ptr = dst; |
| 39 | |
| 40 | while (count--) |
| 41 | *ptr++ = val; |
| 42 | |
| 43 | return dst; |
| 44 | } |
| 45 | |
| 46 | /* |
| 47 | * Compare @len bytes of @s1 and @s2 |
| 48 | */ |
| 49 | int memcmp(const void *s1, const void *s2, size_t len) |
| 50 | { |
| 51 | const char *s = s1; |
| 52 | const char *d = s2; |
| 53 | char dc; |
| 54 | char sc; |
| 55 | |
| 56 | while (len--) { |
| 57 | sc = *s++; |
| 58 | dc = *d++; |
| 59 | if (sc - dc) |
| 60 | return (sc - dc); |
| 61 | } |
| 62 | |
| 63 | return 0; |
| 64 | } |
| 65 | |
| 66 | |
| 67 | /* |
| 68 | * Move @len bytes from @src to @dst |
| 69 | */ |
| 70 | void *memmove(void *dst, const void *src, size_t len) |
| 71 | { |
| 72 | const char *s = src; |
| 73 | char *d = dst; |
| 74 | |
| 75 | while (len--) |
| 76 | *d++ = *s++; |
| 77 | return d; |
| 78 | } |
| 79 | |
| 80 | /* |
| 81 | * Copy @len bytes from @src to @dst |
| 82 | */ |
| 83 | void *memcpy(void *dst, const void *src, size_t len) |
| 84 | { |
| 85 | return memmove(dst, src, len); |
| 86 | } |
| 87 | |
| 88 | |
| 89 | /* |
| 90 | * Scan @len bytes of @src for value @c |
| 91 | */ |
| 92 | void *memchr(const void *src, int c, size_t len) |
| 93 | { |
| 94 | const char *s = src; |
| 95 | |
| 96 | while (len--) { |
| 97 | if (*s == c) |
| 98 | return (void *) s; |
| 99 | s++; |
| 100 | } |
| 101 | |
| 102 | return NULL; |
| 103 | } |