bzero.S revision 1.1
1 1.1 cgd /* 2 1.1 cgd * Copyright (c) 1993 Winning Strategies, Inc. 3 1.1 cgd * All rights reserved. 4 1.1 cgd * 5 1.1 cgd * Redistribution and use in source and binary forms, with or without 6 1.1 cgd * modification, are permitted provided that the following conditions 7 1.1 cgd * are met: 8 1.1 cgd * 1. Redistributions of source code must retain the above copyright 9 1.1 cgd * notice, this list of conditions and the following disclaimer. 10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright 11 1.1 cgd * notice, this list of conditions and the following disclaimer in the 12 1.1 cgd * documentation and/or other materials provided with the distribution. 13 1.1 cgd * 3. All advertising materials mentioning features or use of this software 14 1.1 cgd * must display the following acknowledgement: 15 1.1 cgd * This product includes software developed by Winning Strategies, Inc. 16 1.1 cgd * 4. The name of the author may not be used to endorse or promote products 17 1.1 cgd * derived from this software withough specific prior written permission 18 1.1 cgd * 19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 20 1.1 cgd * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 21 1.1 cgd * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 22 1.1 cgd * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 23 1.1 cgd * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 24 1.1 cgd * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 25 1.1 cgd * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 26 1.1 cgd * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 27 1.1 cgd * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 28 1.1 cgd * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 29 1.1 cgd * 30 1.1 cgd * $Id: bzero.S,v 1.1 1993/10/07 00:19:22 cgd Exp $ 31 1.1 cgd */ 32 1.1 cgd 33 1.1 cgd #if defined(LIBC_RCS) && !defined(lint) 34 1.1 cgd .text 35 1.1 cgd .asciz "$Id: bzero.S,v 1.1 1993/10/07 00:19:22 cgd Exp $" 36 1.1 cgd #endif /* LIBC_RCS and not lint */ 37 1.1 cgd 38 1.1 cgd #include "DEFS.h" 39 1.1 cgd 40 1.1 cgd /* 41 1.1 cgd * bzero (void *b, size_t len) 42 1.1 cgd * write len zero bytes to the string b. 43 1.1 cgd * 44 1.1 cgd * Written by: 45 1.1 cgd * J.T. Conklin (jtc (at) wimsey.com), Winning Strategies, Inc. 46 1.1 cgd */ 47 1.1 cgd 48 1.1 cgd ENTRY(bzero) 49 1.1 cgd pushl %edi 50 1.1 cgd pushl %ebx 51 1.1 cgd movl 12(%esp),%edi 52 1.1 cgd movl 16(%esp),%ecx 53 1.1 cgd 54 1.1 cgd cld /* set fill direction forward */ 55 1.1 cgd xorl %eax,%eax /* set fill data to 0 */ 56 1.1 cgd 57 1.1 cgd /* 58 1.1 cgd * if the string is too short, it's really not worth the overhead 59 1.1 cgd * of aligning to word boundries, etc. So we jump to a plain 60 1.1 cgd * unaligned set. 61 1.1 cgd */ 62 1.1 cgd cmpl $0x0f,%ecx 63 1.1 cgd jle L1 64 1.1 cgd 65 1.1 cgd movl %edi,%edx /* compute misalignment */ 66 1.1 cgd negl %edx 67 1.1 cgd andl $3,%edx 68 1.1 cgd movl %ecx,%ebx 69 1.1 cgd subl %edx,%ebx 70 1.1 cgd 71 1.1 cgd movl %edx,%ecx /* zero until word aligned */ 72 1.1 cgd rep 73 1.1 cgd stosb 74 1.1 cgd 75 1.1 cgd movl %ebx,%ecx /* zero by words */ 76 1.1 cgd shrl $2,%ecx 77 1.1 cgd rep 78 1.1 cgd stosl 79 1.1 cgd 80 1.1 cgd movl %ebx,%ecx 81 1.1 cgd andl $3,%ecx /* zero remainder by bytes */ 82 1.1 cgd L1: rep 83 1.1 cgd stosb 84 1.1 cgd 85 1.1 cgd popl %ebx 86 1.1 cgd popl %edi 87 1.1 cgd ret 88
Indexes created Tue Sep 23 14:10:03 GMT 2025