|
|
1.1 ! root 1: /*- ! 2: * Copyright (c) 1990 The Regents of the University of California. ! 3: * All rights reserved. ! 4: * ! 5: * This code is derived from software contributed to Berkeley by ! 6: * Chris Torek. ! 7: * ! 8: * Redistribution and use in source and binary forms are permitted provided ! 9: * that: (1) source distributions retain this entire copyright notice and ! 10: * comment, and (2) distributions including binaries display the following ! 11: * acknowledgement: ``This product includes software developed by the ! 12: * University of California, Berkeley and its contributors'' in the ! 13: * documentation or other materials provided with the distribution and in ! 14: * all advertising materials mentioning features or use of this software. ! 15: * Neither the name of the University nor the names of its contributors may ! 16: * be used to endorse or promote products derived from this software without ! 17: * specific prior written permission. ! 18: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED ! 19: * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF ! 20: * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 21: */ ! 22: ! 23: #if defined(LIBC_SCCS) && !defined(lint) ! 24: static char sccsid[] = "@(#)strncat.c 5.5 (Berkeley) 5/17/90"; ! 25: #endif /* LIBC_SCCS and not lint */ ! 26: ! 27: #include <sys/stdc.h> ! 28: #include <string.h> ! 29: ! 30: /* ! 31: * Concatenate src on the end of dst. At most strlen(dst)+n+1 bytes ! 32: * are written at dst (at most n+1 bytes being appended). Return dst. ! 33: */ ! 34: char * ! 35: strncat(dst, src, n) ! 36: char *dst; ! 37: const char *src; ! 38: register size_t n; ! 39: { ! 40: if (n != 0) { ! 41: register char *d = dst; ! 42: register const char *s = src; ! 43: ! 44: while (*d != 0) ! 45: d++; ! 46: do { ! 47: if ((*d = *s++) == 0) ! 48: break; ! 49: d++; ! 50: } while (--n != 0); ! 51: *d = 0; ! 52: } ! 53: return (dst); ! 54: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.