1da2e3ebdSchin /***********************************************************************
2da2e3ebdSchin *                                                                      *
3da2e3ebdSchin *               This software is part of the ast package               *
4*b30d1939SAndy Fiddaman *          Copyright (c) 1985-2011 AT&T Intellectual Property          *
5da2e3ebdSchin *                      and is licensed under the                       *
6*b30d1939SAndy Fiddaman *                 Eclipse Public License, Version 1.0                  *
77c2fbfb3SApril Chin *                    by AT&T Intellectual Property                     *
8da2e3ebdSchin *                                                                      *
9da2e3ebdSchin *                A copy of the License is available at                 *
10*b30d1939SAndy Fiddaman *          http://www.eclipse.org/org/documents/epl-v10.html           *
11*b30d1939SAndy Fiddaman *         (with md5 checksum b35adb5213ca9657e911e9befb180842)         *
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 Bell Laboratories
26da2e3ebdSchin  *
27da2e3ebdSchin  * return formatted <magicid.h> version string
28da2e3ebdSchin  */
29da2e3ebdSchin 
30da2e3ebdSchin #include <ast.h>
31da2e3ebdSchin 
32da2e3ebdSchin char*
fmtversion(register unsigned long v)33da2e3ebdSchin fmtversion(register unsigned long v)
34da2e3ebdSchin {
35da2e3ebdSchin 	register char*	cur;
36da2e3ebdSchin 	register char*	end;
37da2e3ebdSchin 	char*		buf;
38da2e3ebdSchin 	int		n;
39da2e3ebdSchin 
40da2e3ebdSchin 	buf = cur = fmtbuf(n = 18);
41da2e3ebdSchin 	end = cur + n;
42*b30d1939SAndy Fiddaman 	if (v >= 19700101L && v <= 29991231L)
43da2e3ebdSchin 		sfsprintf(cur, end - cur, "%04lu-%02lu-%02lu", (v / 10000) % 10000, (v / 100) % 100, v % 100);
44da2e3ebdSchin 	else
45da2e3ebdSchin 	{
46da2e3ebdSchin 		if (n = (v >> 24) & 0xff)
47da2e3ebdSchin 			cur += sfsprintf(cur, end - cur, "%d.", n);
48da2e3ebdSchin 		if (n = (v >> 16) & 0xff)
49da2e3ebdSchin 			cur += sfsprintf(cur, end - cur, "%d.", n);
50da2e3ebdSchin 		sfsprintf(cur, end - cur, "%ld.%ld", (v >> 8) & 0xff, v & 0xff);
51da2e3ebdSchin 	}
52da2e3ebdSchin 	return buf;
53da2e3ebdSchin }
54