1 /*********************************************************************** 2 * * 3 * This software is part of the ast package * 4 * Copyright (c) 1985-2007 AT&T Knowledge Ventures * 5 * and is licensed under the * 6 * Common Public License, Version 1.0 * 7 * by AT&T Knowledge Ventures * 8 * * 9 * A copy of the License is available at * 10 * http://www.opensource.org/licenses/cpl1.0.txt * 11 * (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) * 12 * * 13 * Information and Software Systems Research * 14 * AT&T Research * 15 * Florham Park NJ * 16 * * 17 * Glenn Fowler <gsf@research.att.com> * 18 * David Korn <dgk@research.att.com> * 19 * Phong Vo <kpv@research.att.com> * 20 * * 21 ***********************************************************************/ 22 #pragma prototyped 23 /* 24 * Glenn Fowler 25 * AT&T Bell Laboratories 26 * 27 * return base b representation for n 28 * if p!=0 then base prefix is included 29 * otherwise if n==0 or b==0 then output is signed base 10 30 */ 31 32 #include <ast.h> 33 34 #undef fmtbasell 35 36 char* 37 fmtbasell(register intmax_t n, register int b, int p) 38 { 39 char* buf; 40 int z; 41 42 buf = fmtbuf(z = 72); 43 if (!p && (n == 0 || b == 0)) 44 sfsprintf(buf, z, "%I*d", sizeof(n), n); 45 else 46 sfsprintf(buf, z, p ? "%#..*I*u" : "%..*I*u", b, sizeof(n), n); 47 return buf; 48 } 49 50 #undef fmtbase 51 52 char* 53 fmtbase(long n, int b, int p) 54 { 55 return fmtbasell((intmax_t)n, b, p); 56 } 57