|
|
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
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: * 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 "@(#)bcopy.s 1.4 (Berkeley) 6/1/90"
25: #endif /* LIBC_SCCS and not lint */
26:
27: /* bcopy(from, to, size) */
28: #include "DEFS.h"
29:
30: ENTRY(bcopy, 0)
31: movl 4(fp),r0
32: movl 8(fp),r1
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: ret
45: 3:
46: addl2 r2,r1 # overlapping, must do backwards
47: subl3 r0,r1,r3
48: movl r2,r4
49: jbr 5f
50: 4:
51: subl2 r3,r0
52: subl2 r3,r1
53: movl r3,r2
54: movblk
55: subl2 r3,r0
56: subl2 r3,r1
57: subl2 r3,r4
58: 5:
59: cmpl r4,r3
60: jgtr 4b
61: movl r4,r2
62: subl2 r2,r0
63: subl2 r2,r1
64: movblk
65: ret
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.