/*********************************************************************** * * * This software is part of the ast package * * Copyright (c) 1985-2007 AT&T Knowledge Ventures * * and is licensed under the * * Common Public License, Version 1.0 * * by AT&T Knowledge Ventures * * * * A copy of the License is available at * * http://www.opensource.org/licenses/cpl1.0.txt * * (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) * * * * Information and Software Systems Research * * AT&T Research * * Florham Park NJ * * * * Glenn Fowler <gsf@research.att.com> * * David Korn <dgk@research.att.com> * * Phong Vo <kpv@research.att.com> * * * ***********************************************************************/ #pragma prototyped /* * Glenn Fowler * AT&T Bell Laboratories * * return base b representation for n * if p!=0 then base prefix is included * otherwise if n==0 or b==0 then output is signed base 10 */ #include <ast.h> #undef fmtbasell char* fmtbasell(register intmax_t n, register int b, int p) { char* buf; int z; buf = fmtbuf(z = 72); if (!p && (n == 0 || b == 0)) sfsprintf(buf, z, "%I*d", sizeof(n), n); else sfsprintf(buf, z, p ? "%#..*I*u" : "%..*I*u", b, sizeof(n), n); return buf; } #undef fmtbase char* fmtbase(long n, int b, int p) { return fmtbasell((intmax_t)n, b, p); }