Return to memmove.s CVS log

Up to [CSRG BSD Unix] / 43BSDReno / lib / libc / tahoe / string

Annotation of 43BSDReno/lib/libc/tahoe/string/memmove.s, revision 1.1.1.1

1.1       root        1: /*
                      2:  * Copyright (c) 1988 Regents of the University of California.
                      3:  * All rights reserved.
                      4:  *
                      5:  * Redistribution and use in source and binary forms are permitted provided
                      6:  * that: (1) source distributions retain this entire copyright notice and
                      7:  * comment, and (2) distributions including binaries display the following
                      8:  * acknowledgement:  ``This product includes software developed by the
                      9:  * University of California, Berkeley and its contributors'' in the
                     10:  * documentation or other materials provided with the distribution and in
                     11:  * all advertising materials mentioning features or use of this software.
                     12:  * Neither the name of the University nor the names of its contributors may
                     13:  * be used to endorse or promote products derived from this software without
                     14:  * specific prior written permission.
                     15:  * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
                     16:  * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
                     17:  * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
                     18:  *
                     19:  * This code is derived from software contributed to Berkeley by
                     20:  * Computer Consoles Inc.
                     21:  */
                     22: 
                     23: #if defined(LIBC_SCCS) && !defined(lint)
                     24:        .asciz "@(#)memmove.s   5.2 (Berkeley) 6/1/90"
                     25: #endif /* LIBC_SCCS and not lint */
                     26: 
                     27: /* void *memmove(to, from, size) */
                     28: #include "DEFS.h"
                     29: 
                     30: ENTRY(memmove, 0)
                     31:        movl    4(fp),r1
                     32:        movl    8(fp),r0
                     33:        movl    12(fp),r2
                     34:        cmpl    r0,r1
                     35:        bgtru   1f              /* normal forward case */
                     36:        beql    2f              /* equal, nothing to do */
                     37:        addl2   r2,r0           /* may be overlapping */
                     38:        cmpl    r0,r1
                     39:        bgtru   3f
                     40:        subl2   r2,r0           /* normal forward case */
                     41: 1:
                     42:        movblk
                     43: 2:
                     44:        movl    4(fp),r0        /* this can probably be optimised */
                     45:        ret
                     46: 3:
                     47:        addl2   r2,r1           /* overlapping, must do backwards */
                     48:        subl3   r0,r1,r3
                     49:        movl    r2,r4
                     50:        jbr     5f
                     51: 4:
                     52:        subl2   r3,r0
                     53:        subl2   r3,r1
                     54:        movl    r3,r2
                     55:        movblk
                     56:        subl2   r3,r0
                     57:        subl2   r3,r1
                     58:        subl2   r3,r4
                     59: 5:
                     60:        cmpl    r4,r3
                     61:        jgtr    4b
                     62:        movl    r4,r2
                     63:        subl2   r2,r0
                     64:        subl2   r2,r1
                     65:        movblk
                     66:        movl    4(fp),r0
                     67:        ret

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.