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 * Glenn Fowler 25*4887Schin * AT&T Bell Laboratories 26*4887Schin * 27*4887Schin * return base b representation for n 28*4887Schin * if p!=0 then base prefix is included 29*4887Schin * otherwise if n==0 or b==0 then output is signed base 10 30*4887Schin */ 31*4887Schin 32*4887Schin #include <ast.h> 33*4887Schin 34*4887Schin #undef fmtbasell 35*4887Schin 36*4887Schin char* 37*4887Schin fmtbasell(register intmax_t n, register int b, int p) 38*4887Schin { 39*4887Schin char* buf; 40*4887Schin int z; 41*4887Schin 42*4887Schin buf = fmtbuf(z = 72); 43*4887Schin if (!p && (n == 0 || b == 0)) 44*4887Schin sfsprintf(buf, z, "%I*d", sizeof(n), n); 45*4887Schin else 46*4887Schin sfsprintf(buf, z, p ? "%#..*I*u" : "%..*I*u", b, sizeof(n), n); 47*4887Schin return buf; 48*4887Schin } 49*4887Schin 50*4887Schin #undef fmtbase 51*4887Schin 52*4887Schin char* 53*4887Schin fmtbase(long n, int b, int p) 54*4887Schin { 55*4887Schin return fmtbasell((intmax_t)n, b, p); 56*4887Schin } 57