14887Schin /*********************************************************************** 24887Schin * * 34887Schin * This software is part of the ast package * 4*8462SApril.Chin@Sun.COM * Copyright (c) 1985-2008 AT&T Intellectual Property * 54887Schin * and is licensed under the * 64887Schin * Common Public License, Version 1.0 * 7*8462SApril.Chin@Sun.COM * by AT&T Intellectual Property * 84887Schin * * 94887Schin * A copy of the License is available at * 104887Schin * http://www.opensource.org/licenses/cpl1.0.txt * 114887Schin * (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) * 124887Schin * * 134887Schin * Information and Software Systems Research * 144887Schin * AT&T Research * 154887Schin * Florham Park NJ * 164887Schin * * 174887Schin * Glenn Fowler <gsf@research.att.com> * 184887Schin * David Korn <dgk@research.att.com> * 194887Schin * Phong Vo <kpv@research.att.com> * 204887Schin * * 214887Schin ***********************************************************************/ 224887Schin #pragma prototyped 234887Schin /* 244887Schin * Glenn Fowler 254887Schin * AT&T Research 264887Schin * 274887Schin * return scaled number n 284887Schin * string width is 5 chars or less 294887Schin * if m>1 then n divided by m before scaling 304887Schin */ 314887Schin 324887Schin #include <ast.h> 334887Schin 344887Schin char* 354887Schin fmtnum(register unsigned long n, int m) 364887Schin { 374887Schin register int i; 384887Schin register unsigned long r; 394887Schin char* buf; 404887Schin int z; 414887Schin 424887Schin char suf[2]; 434887Schin 444887Schin if (m > 1) 454887Schin { 464887Schin r = n; 474887Schin n /= m; 484887Schin r -= n; 494887Schin } 504887Schin else 514887Schin r = 0; 524887Schin suf[1] = 0; 534887Schin if (n < 1024) 544887Schin suf[0] = 0; 554887Schin else if (n < 1024 * 1024) 564887Schin { 574887Schin suf[0] = 'k'; 584887Schin r = ((n % 1024) * 100) / 1024; 594887Schin n /= 1024; 604887Schin } 614887Schin else if (n < 1024 * 1024 * 1024) 624887Schin { 634887Schin suf[0] = 'm'; 644887Schin r = ((n % (1024 * 1024)) * 100) / (1024 * 1024); 654887Schin n /= 1024 * 1024; 664887Schin } 674887Schin else 684887Schin { 694887Schin suf[0] = 'g'; 704887Schin r = ((n % (1024 * 1024 * 1024)) * 100) / (1024 * 1024 * 1024); 714887Schin n /= 1024 * 1024 * 1024; 724887Schin } 734887Schin if (r) 744887Schin { 754887Schin if (n >= 100) 764887Schin r = 0; 774887Schin else if (n >= 10) 784887Schin { 794887Schin i = 1; 804887Schin if (r >= 10) 814887Schin r /= 10; 824887Schin } 834887Schin else 844887Schin i = 2; 854887Schin } 864887Schin buf = fmtbuf(z = 8); 874887Schin if (r) 884887Schin sfsprintf(buf, z, "%lu.%0*lu%s", n, i, r, suf); 894887Schin else 904887Schin sfsprintf(buf, z, "%lu%s", n, suf); 914887Schin return buf; 924887Schin } 93