1da2e3ebdSchin /*********************************************************************** 2da2e3ebdSchin * * 3da2e3ebdSchin * This software is part of the ast package * 4*3e14f97fSRoger A. Faulkner * Copyright (c) 1985-2010 AT&T Intellectual Property * 5da2e3ebdSchin * and is licensed under the * 6da2e3ebdSchin * Common Public License, Version 1.0 * 77c2fbfb3SApril Chin * by AT&T Intellectual Property * 8da2e3ebdSchin * * 9da2e3ebdSchin * A copy of the License is available at * 10da2e3ebdSchin * http://www.opensource.org/licenses/cpl1.0.txt * 11da2e3ebdSchin * (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) * 12da2e3ebdSchin * * 13da2e3ebdSchin * Information and Software Systems Research * 14da2e3ebdSchin * AT&T Research * 15da2e3ebdSchin * Florham Park NJ * 16da2e3ebdSchin * * 17da2e3ebdSchin * Glenn Fowler <gsf@research.att.com> * 18da2e3ebdSchin * David Korn <dgk@research.att.com> * 19da2e3ebdSchin * Phong Vo <kpv@research.att.com> * 20da2e3ebdSchin * * 21da2e3ebdSchin ***********************************************************************/ 22da2e3ebdSchin #pragma prototyped 23da2e3ebdSchin /* 24da2e3ebdSchin * strlcat implementation 25da2e3ebdSchin */ 26da2e3ebdSchin 27da2e3ebdSchin #define strlcat ______strlcat 28da2e3ebdSchin 29da2e3ebdSchin #include <ast.h> 30da2e3ebdSchin 31da2e3ebdSchin #undef strlcat 32da2e3ebdSchin 33da2e3ebdSchin #undef _def_map_ast 34da2e3ebdSchin #include <ast_map.h> 35da2e3ebdSchin 36da2e3ebdSchin #if _lib_strlcat 37da2e3ebdSchin 38da2e3ebdSchin NoN(strlcat) 39da2e3ebdSchin 40da2e3ebdSchin #else 41da2e3ebdSchin 42da2e3ebdSchin /* 4334f9b3eeSRoland Mainz * append t onto s limiting total size of s to n 44da2e3ebdSchin * s 0 terminated if n>0 45da2e3ebdSchin * min(n,strlen(s))+strlen(t) returned 46da2e3ebdSchin */ 47da2e3ebdSchin 48da2e3ebdSchin #if defined(__EXPORT__) 49da2e3ebdSchin #define extern __EXPORT__ 50da2e3ebdSchin #endif 51da2e3ebdSchin 52da2e3ebdSchin extern size_t 53da2e3ebdSchin strlcat(register char* s, register const char* t, register size_t n) 54da2e3ebdSchin { 5534f9b3eeSRoland Mainz register size_t m; 56da2e3ebdSchin const char* o = t; 57da2e3ebdSchin 5834f9b3eeSRoland Mainz if (m = n) 59da2e3ebdSchin { 6034f9b3eeSRoland Mainz while (n && *s) 6134f9b3eeSRoland Mainz { 6234f9b3eeSRoland Mainz n--; 63da2e3ebdSchin s++; 6434f9b3eeSRoland Mainz } 6534f9b3eeSRoland Mainz m -= n; 66da2e3ebdSchin if (n) 67da2e3ebdSchin do 68da2e3ebdSchin { 69da2e3ebdSchin if (!--n) 70da2e3ebdSchin { 71da2e3ebdSchin *s = 0; 72da2e3ebdSchin break; 73da2e3ebdSchin } 74da2e3ebdSchin } while (*s++ = *t++); 75da2e3ebdSchin else 76da2e3ebdSchin *s = 0; 77da2e3ebdSchin } 78da2e3ebdSchin if (!n) 79da2e3ebdSchin while (*t++); 8034f9b3eeSRoland Mainz return (t - o) + m - 1; 81da2e3ebdSchin } 82da2e3ebdSchin 83da2e3ebdSchin #endif 84