1da2e3ebdSchin /***********************************************************************
2da2e3ebdSchin * *
3da2e3ebdSchin * This software is part of the ast package *
4*3e14f97fSRoger A. Faulkner * Copyright (c) 1985-2010 AT&T Intellectual Property *
5da2e3ebdSchin * and is licensed under the *
6da2e3ebdSchin * Common Public License, Version 1.0 *
77c2fbfb3SApril Chin * by AT&T Intellectual Property *
8da2e3ebdSchin * *
9da2e3ebdSchin * A copy of the License is available at *
10da2e3ebdSchin * http://www.opensource.org/licenses/cpl1.0.txt *
11da2e3ebdSchin * (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) *
12da2e3ebdSchin * *
13da2e3ebdSchin * Information and Software Systems Research *
14da2e3ebdSchin * AT&T Research *
15da2e3ebdSchin * Florham Park NJ *
16da2e3ebdSchin * *
17da2e3ebdSchin * Glenn Fowler <gsf@research.att.com> *
18da2e3ebdSchin * David Korn <dgk@research.att.com> *
19da2e3ebdSchin * Phong Vo <kpv@research.att.com> *
20da2e3ebdSchin * *
21da2e3ebdSchin ***********************************************************************/
22da2e3ebdSchin #pragma prototyped
23da2e3ebdSchin /*
24da2e3ebdSchin * Glenn Fowler
25da2e3ebdSchin * AT&T Research
26da2e3ebdSchin *
27da2e3ebdSchin * return number n scaled to metric multiples of k { 1000 1024 }
28da2e3ebdSchin * return string length is at most 5 chars + terminating nul
29da2e3ebdSchin */
30da2e3ebdSchin
31da2e3ebdSchin #include <ast.h>
32da2e3ebdSchin #include <lclib.h>
33da2e3ebdSchin
34da2e3ebdSchin char*
fmtscale(register Sfulong_t n,int k)35da2e3ebdSchin fmtscale(register Sfulong_t n, int k)
36da2e3ebdSchin {
37da2e3ebdSchin register Sfulong_t m;
38da2e3ebdSchin int r;
39da2e3ebdSchin int z;
40da2e3ebdSchin const char* u;
41da2e3ebdSchin char suf[3];
42da2e3ebdSchin char* s;
43da2e3ebdSchin char* buf;
44da2e3ebdSchin Lc_numeric_t* p = (Lc_numeric_t*)LCINFO(AST_LC_NUMERIC)->data;
45da2e3ebdSchin
46da2e3ebdSchin static const char scale[] = "bkMGTPE";
47da2e3ebdSchin
48da2e3ebdSchin u = scale;
49da2e3ebdSchin if (n < 1000)
50da2e3ebdSchin r = 0;
51da2e3ebdSchin else
52da2e3ebdSchin {
53da2e3ebdSchin m = 0;
54da2e3ebdSchin while (n >= k && *(u + 1))
55da2e3ebdSchin {
56da2e3ebdSchin m = n;
57da2e3ebdSchin n /= k;
58da2e3ebdSchin u++;
59da2e3ebdSchin }
60da2e3ebdSchin if ((r = (10 * (m % k) + (k / 2)) / k) > 9)
61da2e3ebdSchin {
62da2e3ebdSchin r = 0;
63da2e3ebdSchin n++;
64da2e3ebdSchin }
65da2e3ebdSchin if (k == 1024 && n >= 1000)
66da2e3ebdSchin {
67da2e3ebdSchin n = 1;
68da2e3ebdSchin r = 0;
69da2e3ebdSchin u++;
70da2e3ebdSchin }
71da2e3ebdSchin }
72da2e3ebdSchin buf = fmtbuf(z = 8);
73da2e3ebdSchin s = suf;
74da2e3ebdSchin if (u > scale)
75da2e3ebdSchin {
76da2e3ebdSchin if (k == 1024)
77da2e3ebdSchin {
78da2e3ebdSchin *s++ = *u == 'k' ? 'K' : *u;
79da2e3ebdSchin *s++ = 'i';
80da2e3ebdSchin }
81da2e3ebdSchin else
82da2e3ebdSchin *s++ = *u;
83da2e3ebdSchin }
84da2e3ebdSchin *s = 0;
85da2e3ebdSchin if (n > 0 && n < 10)
86da2e3ebdSchin sfsprintf(buf, z, "%I*u%c%d%s", sizeof(n), n, p->decimal >= 0 ? p->decimal : '.', r, suf);
87da2e3ebdSchin else
88da2e3ebdSchin {
89da2e3ebdSchin if (r >= 5)
90da2e3ebdSchin n++;
91da2e3ebdSchin sfsprintf(buf, z, "%I*u%s", sizeof(n), n, suf);
92da2e3ebdSchin }
93da2e3ebdSchin return buf;
94da2e3ebdSchin }
95