2 * Copyright (c) 1990, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * Mike Hibler and Chris Torek.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 #if defined(LIBC_SCCS) && !defined(lint)
34 static char sccsid
[] = "@(#)memset.c 8.1 (Berkeley) 6/4/93";
35 #endif /* LIBC_SCCS and not lint */
36 #include <sys/cdefs.h>
37 __FBSDID("$FreeBSD$");
39 #include <sys/types.h>
43 #define wsize sizeof(u_int)
44 #define wmask (wsize - 1)
54 bzero(void *dst0
, size_t length
)
58 #define RETURN return (dst0)
63 memset(void *dst0
, int c0
, size_t length
)
74 * If not enough words, just fill bytes. A length >= 2 words
75 * guarantees that at least one of them is `complete' after
76 * any necessary alignment. For instance:
78 * |-----------|-----------|-----------|
79 * |00|01|02|03|04|05|06|07|08|09|0A|00|
80 * ^---------------------^
83 * but we use a minimum of 3 here since the overhead of the code
84 * to do word writes is substantial.
86 if (length
< 3 * wsize
) {
95 if ((c
= (u_char
)c0
) != 0) { /* Fill the word. */
96 c
= (c
<< 8) | c
; /* u_int is 16 bits. */
98 c
= (c
<< 16) | c
; /* u_int is 32 bits. */
100 #if UINT_MAX > 0xffffffff
101 c
= (c
<< 32) | c
; /* u_int is 64 bits. */
105 /* Align destination by filling in bytes. */
106 if ((t
= (long)dst
& wmask
) != 0) {
114 /* Fill words. Length was >= 2*words so we know t >= 1 here. */
117 *(u_int
*)dst
= WIDEVAL
;
121 /* Mop up trailing bytes, if any. */