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 Research 26*4887Schin * 27*4887Schin * return number n scaled to metric multiples of k { 1000 1024 } 28*4887Schin * return string length is at most 5 chars + terminating nul 29*4887Schin */ 30*4887Schin 31*4887Schin #include <ast.h> 32*4887Schin #include <lclib.h> 33*4887Schin 34*4887Schin char* 35*4887Schin fmtscale(register Sfulong_t n, int k) 36*4887Schin { 37*4887Schin register Sfulong_t m; 38*4887Schin int r; 39*4887Schin int z; 40*4887Schin const char* u; 41*4887Schin char suf[3]; 42*4887Schin char* s; 43*4887Schin char* buf; 44*4887Schin Lc_numeric_t* p = (Lc_numeric_t*)LCINFO(AST_LC_NUMERIC)->data; 45*4887Schin 46*4887Schin static const char scale[] = "bkMGTPE"; 47*4887Schin 48*4887Schin u = scale; 49*4887Schin if (n < 1000) 50*4887Schin r = 0; 51*4887Schin else 52*4887Schin { 53*4887Schin m = 0; 54*4887Schin while (n >= k && *(u + 1)) 55*4887Schin { 56*4887Schin m = n; 57*4887Schin n /= k; 58*4887Schin u++; 59*4887Schin } 60*4887Schin if ((r = (10 * (m % k) + (k / 2)) / k) > 9) 61*4887Schin { 62*4887Schin r = 0; 63*4887Schin n++; 64*4887Schin } 65*4887Schin if (k == 1024 && n >= 1000) 66*4887Schin { 67*4887Schin n = 1; 68*4887Schin r = 0; 69*4887Schin u++; 70*4887Schin } 71*4887Schin } 72*4887Schin buf = fmtbuf(z = 8); 73*4887Schin s = suf; 74*4887Schin if (u > scale) 75*4887Schin { 76*4887Schin if (k == 1024) 77*4887Schin { 78*4887Schin *s++ = *u == 'k' ? 'K' : *u; 79*4887Schin *s++ = 'i'; 80*4887Schin } 81*4887Schin else 82*4887Schin *s++ = *u; 83*4887Schin } 84*4887Schin *s = 0; 85*4887Schin if (n > 0 && n < 10) 86*4887Schin sfsprintf(buf, z, "%I*u%c%d%s", sizeof(n), n, p->decimal >= 0 ? p->decimal : '.', r, suf); 87*4887Schin else 88*4887Schin { 89*4887Schin if (r >= 5) 90*4887Schin n++; 91*4887Schin sfsprintf(buf, z, "%I*u%s", sizeof(n), n, suf); 92*4887Schin } 93*4887Schin return buf; 94*4887Schin } 95