fmtscale.c revision 7c2fbfb345896881c631598ee3852ce9ce33fb07
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin/***********************************************************************
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* This software is part of the ast package *
7c2fbfb345896881c631598ee3852ce9ce33fb07April Chin* Copyright (c) 1985-2008 AT&T Intellectual Property *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* and is licensed under the *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* Common Public License, Version 1.0 *
7c2fbfb345896881c631598ee3852ce9ce33fb07April Chin* by AT&T Intellectual Property *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* A copy of the License is available at *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* Information and Software Systems Research *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* AT&T Research *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* Florham Park NJ *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* Glenn Fowler <gsf@research.att.com> *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* David Korn <dgk@research.att.com> *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* Phong Vo <kpv@research.att.com> *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin***********************************************************************/
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin * Glenn Fowler
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin * AT&T Research
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin * return number n scaled to metric multiples of k { 1000 1024 }
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin * return string length is at most 5 chars + terminating nul
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin const char* u;
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin Lc_numeric_t* p = (Lc_numeric_t*)LCINFO(AST_LC_NUMERIC)->data;
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin if (n < 1000)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin while (n >= k && *(u + 1))
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin if (k == 1024)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin *s++ = 'i';
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin *s++ = *u;
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin if (n > 0 && n < 10)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin sfsprintf(buf, z, "%I*u%c%d%s", sizeof(n), n, p->decimal >= 0 ? p->decimal : '.', r, suf);
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin if (r >= 5)