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