memset.c revision 92889
11573Srgrimes/*- 21573Srgrimes * Copyright (c) 1990, 1993 31573Srgrimes * The Regents of the University of California. All rights reserved. 41573Srgrimes * 51573Srgrimes * This code is derived from software contributed to Berkeley by 61573Srgrimes * Mike Hibler and Chris Torek. 71573Srgrimes * 81573Srgrimes * Redistribution and use in source and binary forms, with or without 91573Srgrimes * modification, are permitted provided that the following conditions 101573Srgrimes * are met: 111573Srgrimes * 1. Redistributions of source code must retain the above copyright 121573Srgrimes * notice, this list of conditions and the following disclaimer. 131573Srgrimes * 2. Redistributions in binary form must reproduce the above copyright 141573Srgrimes * notice, this list of conditions and the following disclaimer in the 151573Srgrimes * documentation and/or other materials provided with the distribution. 161573Srgrimes * 3. All advertising materials mentioning features or use of this software 171573Srgrimes * must display the following acknowledgement: 181573Srgrimes * This product includes software developed by the University of 191573Srgrimes * California, Berkeley and its contributors. 201573Srgrimes * 4. Neither the name of the University nor the names of its contributors 211573Srgrimes * may be used to endorse or promote products derived from this software 221573Srgrimes * without specific prior written permission. 231573Srgrimes * 241573Srgrimes * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 251573Srgrimes * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 261573Srgrimes * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 271573Srgrimes * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 281573Srgrimes * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 291573Srgrimes * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 301573Srgrimes * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 311573Srgrimes * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 321573Srgrimes * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 331573Srgrimes * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 341573Srgrimes * SUCH DAMAGE. 351573Srgrimes */ 361573Srgrimes 371573Srgrimes#if defined(LIBC_SCCS) && !defined(lint) 381573Srgrimesstatic char sccsid[] = "@(#)memset.c 8.1 (Berkeley) 6/4/93"; 391573Srgrimes#endif /* LIBC_SCCS and not lint */ 4086170Sobrien#include <sys/cdefs.h> 4186170Sobrien__FBSDID("$FreeBSD: head/lib/libc/string/memset.c 92889 2002-03-21 18:49:23Z obrien $"); 421573Srgrimes 431573Srgrimes#include <sys/types.h> 441573Srgrimes 451573Srgrimes#include <limits.h> 461573Srgrimes#include <string.h> 471573Srgrimes 481573Srgrimes#define wsize sizeof(u_int) 491573Srgrimes#define wmask (wsize - 1) 501573Srgrimes 511573Srgrimes#ifdef BZERO 521573Srgrimes#define RETURN return 531573Srgrimes#define VAL 0 541573Srgrimes#define WIDEVAL 0 551573Srgrimes 561573Srgrimesvoid 571573Srgrimesbzero(dst0, length) 581573Srgrimes void *dst0; 5992889Sobrien size_t length; 601573Srgrimes#else 611573Srgrimes#define RETURN return (dst0) 621573Srgrimes#define VAL c0 631573Srgrimes#define WIDEVAL c 641573Srgrimes 651573Srgrimesvoid * 661573Srgrimesmemset(dst0, c0, length) 671573Srgrimes void *dst0; 6892889Sobrien int c0; 6992889Sobrien size_t length; 701573Srgrimes#endif 711573Srgrimes{ 7292889Sobrien size_t t; 7346079Simp#ifndef BZERO 7492889Sobrien u_int c; 7546079Simp#endif 7692889Sobrien u_char *dst; 771573Srgrimes 781573Srgrimes dst = dst0; 791573Srgrimes /* 801573Srgrimes * If not enough words, just fill bytes. A length >= 2 words 811573Srgrimes * guarantees that at least one of them is `complete' after 821573Srgrimes * any necessary alignment. For instance: 831573Srgrimes * 841573Srgrimes * |-----------|-----------|-----------| 851573Srgrimes * |00|01|02|03|04|05|06|07|08|09|0A|00| 861573Srgrimes * ^---------------------^ 871573Srgrimes * dst dst+length-1 881573Srgrimes * 891573Srgrimes * but we use a minimum of 3 here since the overhead of the code 901573Srgrimes * to do word writes is substantial. 918870Srgrimes */ 921573Srgrimes if (length < 3 * wsize) { 931573Srgrimes while (length != 0) { 941573Srgrimes *dst++ = VAL; 951573Srgrimes --length; 961573Srgrimes } 971573Srgrimes RETURN; 981573Srgrimes } 991573Srgrimes 1001573Srgrimes#ifndef BZERO 1011573Srgrimes if ((c = (u_char)c0) != 0) { /* Fill the word. */ 1021573Srgrimes c = (c << 8) | c; /* u_int is 16 bits. */ 1031573Srgrimes#if UINT_MAX > 0xffff 1041573Srgrimes c = (c << 16) | c; /* u_int is 32 bits. */ 1051573Srgrimes#endif 1061573Srgrimes#if UINT_MAX > 0xffffffff 1071573Srgrimes c = (c << 32) | c; /* u_int is 64 bits. */ 1081573Srgrimes#endif 1091573Srgrimes } 1101573Srgrimes#endif 1111573Srgrimes /* Align destination by filling in bytes. */ 11235923Sjb if ((t = (long)dst & wmask) != 0) { 1131573Srgrimes t = wsize - t; 1141573Srgrimes length -= t; 1151573Srgrimes do { 1161573Srgrimes *dst++ = VAL; 1171573Srgrimes } while (--t != 0); 1181573Srgrimes } 1191573Srgrimes 1201573Srgrimes /* Fill words. Length was >= 2*words so we know t >= 1 here. */ 1211573Srgrimes t = length / wsize; 1221573Srgrimes do { 1231573Srgrimes *(u_int *)dst = WIDEVAL; 1241573Srgrimes dst += wsize; 1251573Srgrimes } while (--t != 0); 1261573Srgrimes 1271573Srgrimes /* Mop up trailing bytes, if any. */ 1281573Srgrimes t = length & wmask; 1291573Srgrimes if (t != 0) 1301573Srgrimes do { 1311573Srgrimes *dst++ = VAL; 1321573Srgrimes } while (--t != 0); 1331573Srgrimes RETURN; 1341573Srgrimes} 135