1 | /*
|
---|
2 | * Copyright (c) 2011 Martin Decky
|
---|
3 | * All rights reserved.
|
---|
4 | *
|
---|
5 | * Redistribution and use in source and binary forms, with or without
|
---|
6 | * modification, are permitted provided that the following conditions
|
---|
7 | * are met:
|
---|
8 | *
|
---|
9 | * - Redistributions of source code must retain the above copyright
|
---|
10 | * notice, this list of conditions and the following disclaimer.
|
---|
11 | * - Redistributions in binary form must reproduce the above copyright
|
---|
12 | * notice, this list of conditions and the following disclaimer in the
|
---|
13 | * documentation and/or other materials provided with the distribution.
|
---|
14 | * - The name of the author may not be used to endorse or promote products
|
---|
15 | * derived from this software without specific prior written permission.
|
---|
16 | *
|
---|
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
---|
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
---|
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
---|
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
---|
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
---|
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
---|
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
---|
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
---|
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
---|
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
27 | */
|
---|
28 |
|
---|
29 | /** @addtogroup generic
|
---|
30 | * @{
|
---|
31 | */
|
---|
32 |
|
---|
33 | /**
|
---|
34 | * @file
|
---|
35 | * @brief Memory string functions.
|
---|
36 | *
|
---|
37 | * This file provides architecture independent functions to manipulate blocks
|
---|
38 | * of memory. These functions are optimized as much as generic functions of
|
---|
39 | * this type can be.
|
---|
40 | */
|
---|
41 |
|
---|
42 | #include <lib/memfnc.h>
|
---|
43 | #include <typedefs.h>
|
---|
44 |
|
---|
45 | /** Fill block of memory.
|
---|
46 | *
|
---|
47 | * Fill cnt bytes at dst address with the value val.
|
---|
48 | *
|
---|
49 | * @param dst Destination address to fill.
|
---|
50 | * @param val Value to fill.
|
---|
51 | * @param cnt Number of bytes to fill.
|
---|
52 | *
|
---|
53 | * @return Destination address.
|
---|
54 | *
|
---|
55 | */
|
---|
56 | void *memset(void *dst, int val, size_t cnt)
|
---|
57 | {
|
---|
58 | size_t i;
|
---|
59 | uint8_t *ptr = (uint8_t *) dst;
|
---|
60 |
|
---|
61 | for (i = 0; i < cnt; i++)
|
---|
62 | ptr[i] = val;
|
---|
63 |
|
---|
64 | return dst;
|
---|
65 | }
|
---|
66 |
|
---|
67 | /** Move memory block without overlapping.
|
---|
68 | *
|
---|
69 | * Copy cnt bytes from src address to dst address. The source
|
---|
70 | * and destination memory areas cannot overlap.
|
---|
71 | *
|
---|
72 | * @param dst Destination address to copy to.
|
---|
73 | * @param src Source address to copy from.
|
---|
74 | * @param cnt Number of bytes to copy.
|
---|
75 | *
|
---|
76 | * @return Destination address.
|
---|
77 | *
|
---|
78 | */
|
---|
79 | void *memcpy(void *dst, const void *src, size_t cnt)
|
---|
80 | {
|
---|
81 | uint8_t *dp = (uint8_t *) dst;
|
---|
82 | const uint8_t *sp = (uint8_t *) src;
|
---|
83 |
|
---|
84 | while (cnt-- != 0)
|
---|
85 | *dp++ = *sp++;
|
---|
86 |
|
---|
87 | return dst;
|
---|
88 | }
|
---|
89 |
|
---|
90 | /** @}
|
---|
91 | */
|
---|