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