|
|
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 the above copyright notice and this paragraph are ! 7: * duplicated in all such forms and that any documentation, ! 8: * advertising materials, and other materials related to such ! 9: * distribution and use acknowledge that the software was developed ! 10: * by the University of California, Berkeley. The name of the ! 11: * University may not be used to endorse or promote products derived ! 12: * from this software without specific prior written permission. ! 13: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR ! 14: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED ! 15: * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 16: * ! 17: * This code is derived from software contributed to Berkeley by ! 18: * Computer Consoles Inc. ! 19: */ ! 20: ! 21: #if defined(LIBC_SCCS) && !defined(lint) ! 22: .asciz "@(#)strncat.s 1.4 (Berkeley) 6/27/88" ! 23: #endif /* LIBC_SCCS and not lint */ ! 24: ! 25: /* ! 26: * Concatenate s2 on the end of s1. S1's space must be large enough. ! 27: * At most n characters are moved. ! 28: * Return s1. ! 29: * ! 30: * char *strncat(s1, s2, n) ! 31: * register char *s1, *s2; ! 32: * register n; ! 33: */ ! 34: #include "DEFS.h" ! 35: ! 36: ENTRY(strncat, 0) ! 37: tstl 12(fp) ! 38: jgtr n_ok ! 39: movl 4(fp),r0 ! 40: ret ! 41: n_ok: ! 42: movl 8(fp),r0 ! 43: movl r0,r1 ! 44: cmps2 # r0 points at null at end of s2 ! 45: subl3 8(fp),r0,r2 # r2 = numberof non-null chars in s2 ! 46: cmpl 12(fp),r2 ! 47: jgeq r2_ok ! 48: movl 12(fp),r2 # r2 = min (n, length(s2)) ! 49: r2_ok: ! 50: movl 4(fp),r0 ! 51: movl r0,r1 ! 52: cmps2 # r1 points at null at end of s1 ! 53: movl 8(fp),r0 # source for copy ! 54: movs3 # actual copy ! 55: clrb (r1) # null terminated string ! ! 56: movl 4(fp),r0 ! 57: ret
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.