xref: /csrg-svn/old/od/od.c (revision 4500)

static char *sccsid = "@(#)od.c	5.2 (Berkeley) 10/14/81";
/*
 * od -- octal, hex, decimal, character dump of data in a file.
 *
 * usage:	od [-abcdDefFhHiIlLopPvxX] [file] [[+]offset[.][b]]
 *
 * where the option flags have the following meaning:
 *   character	object	radix	signed?
 *	a	byte	(10)	(n.a.)	ASCII named byte stream
 *	b	byte	  8	 no	byte octal
 *	c	byte	 (8)	(no)	character with octal non-graphic bytes
 *	d	short	 10	 no
 *	D	long	 10	 no
 *	e,F	double	(10)		double precision floating pt.
 *	f	float	(10)		single precision floating pt.
 *	h,x	short	 16	 no
 *	H,X	long	 16	 no
 *	i	short	 10	yes
 *	I,l,L	long	 10	yes
 *	o	short	  8	 no	(default conversion)
 *	O	long	  8	 no
 *
 *	p				indicate EVEN parity on 'a' conversion
 *	P				indicate ODD parity on 'a' conversion
 *	v				show all data - don't skip like lines.
 *
 * More than one format character may be given.
 * If {file} is not specified, standard input is read.
 * If {file} is not specified, then {offset} must start with '+'.
 * {Offset} may be HEX (0xnnn), OCTAL (0nn), or decimal (nnn.); the default
 * is the same as the address radix, which will be the same as the first
 * object radix.
 */

#include <stdio.h>

#define NO	0
#define YES	1
#define EVEN	-1
#define ODD	1
#define UNSIGNED 0
#define SIGNED	1

int	a_put();
int	b_put();
int	c_put();
int	s_put();
int	us_put();
int	l_put();
int	f_put();
int	d_put();

struct dfmt {
	int	df_field;	/* external field required for object */
	int	df_size;	/* size (bytes) of object */
	int	df_radix;	/* conversion radix */
	int	df_signed;	/* signed? flag */
	int	(*df_put)();	/* function to output object */
	char	*df_fmt;
} *conv_vec[32];		/* vector of conversions to be done */

struct dfmt	ascii	= { 3, sizeof (char),   10,        0,  a_put, 0};
struct dfmt	byte	= { 3, sizeof (char),    8, UNSIGNED,  b_put, 0};
struct dfmt	cchar	= { 3, sizeof (char),    8, UNSIGNED,  c_put, 0};
struct dfmt	u_s_oct	= { 6, sizeof (short),   8, UNSIGNED, us_put, 0};
struct dfmt	u_s_dec	= { 5, sizeof (short),  10, UNSIGNED, us_put, 0};
struct dfmt	u_s_hex	= { 4, sizeof (short),  16, UNSIGNED, us_put, 0};
struct dfmt	u_l_oct	= {11, sizeof (long),    8, UNSIGNED,  l_put, 0};
struct dfmt	u_l_dec	= {10, sizeof (long),   10, UNSIGNED,  l_put, 0};
struct dfmt	u_l_hex	= { 8, sizeof (long),   16, UNSIGNED,  l_put, 0};
struct dfmt	s_s_dec	= { 6, sizeof (short),  10,   SIGNED,  s_put, 0};
struct dfmt	s_l_dec	= {11, sizeof (long),   10,   SIGNED,  l_put, 0};
struct dfmt	flt	= {14, sizeof (float),  10,   SIGNED,  f_put, 0};
struct dfmt	dble	= {21, sizeof (double), 10,   SIGNED,  d_put, 0};

char	dbuf[16];
char	lastdbuf[16];
int	addr_base;
long	addr;
int	_parity = NO;
char	fmt[]	= "            %s";	/* 12 blanks */
char	*icvt();
char	*underline();

main(argc, argv)
char **argv;
{
	register char *p;
	register char *l;
	register n, same;
	struct dfmt	*d;
	struct dfmt	**cv = conv_vec;
	int	showall = NO;
	int	field, llen, nelm;
	int	max_llen = 0;

	argv++;
	max_llen = max_nelm = 0;

	if(argc > 1) {
		p = *argv;
		if(*p == '-') {
			while(*++p != '\0') {
				switch(*p) {
				case 'a':
					d = &ascii;
					break;
				case 'b':
					d = &byte;
					break;
				case 'c':
					d = &cchar;
					break;
				case 'd':
					d = &u_s_dec;
					break;
				case 'D':
					d = &u_l_dec;
					break;
				case 'e':
				case 'F':
					d = &dble;
					break;
				case 'f':
					d = &flt;
					break;
				case 'h':
				case 'x':
					d = &u_s_hex;
					break;
				case 'H':
				case 'X':
					d = &u_l_hex;
					break;
				case 'i':
					d = &s_s_dec;
					break;
				case 'I':
				case 'l':
				case 'L':
					d = &s_l_dec;
					break;
				case 'o':
					d = &u_s_oct;
					break;
				case 'O':
					d = &u_l_oct;
					break;
				case 'p':
					_parity = EVEN;
					continue;
				case 'P':
					_parity = ODD;
					continue;
				case 'v':
					showall = YES;
					continue;
				}
				nelm = 16 / d->df_size;
				llen = (d->df_field + 1) * nelm;
				if (llen > max_llen)
					max_llen = llen;
				if (nelm > max_nelm)
					max_nelm = nelm;
				/*
				 * nelm will always be a power of 2.
				 * line length must always be multiple
				 * of max_nelm.
				 */
				nelm = max_nelm - 1;
				max_llen = (max_llen + nelm) & (~nelm);
				if (addr_base == 0)
					addr_base = d->df_radix;
				*(cv++) = d;
			}
			argc--;
			argv++;
		}
	}

	if(cv == conv_vec) {
		addr_base = 8;
		*(cv++) = &u_s_oct;
		max_llen = (16 / u_s_oct.df_size) * (u_s_oct.df_field + 1);
	}
	*cv = (struct dfmt *)0;

	cv = conv_vec;
	while (d = *cv++) {
		nelm = 16 / d->df_size;
		field = max_llen / nelm;
		d->df_fmt = fmt + 12 - (field - d->df_field);
	}

	if(argc > 1 && **argv != '+') {
		if (freopen(*argv, "r", stdin) == NULL) {
			printf("od: cannot open %s\n", *argv);
			exit(1);
		}
		argv++;
		argc--;
	}

	if (argc > 1)
		offset(*argv);

	same = -1;
	while ((n = fread(dbuf, 1, sizeof(dbuf), stdin)) > 0) {
		if (same>=0 && strncmp(dbuf, lastdbuf, 16) == 0 && !showall) {
			if (same==0) {
				printf("*\n");
				same = 1;
			}
		}
		else {
			line(n);
			same = 0;
			p = dbuf;
			l = lastdbuf;
			for (nelm=0; nelm<16; nelm++) {
				*l++ = *p;
				*p++ = '\0';
			}
		}
		addr += n;
	}
	puts(icvt(addr, addr_base, UNSIGNED, 7));
}

line(n)
int	n;
{
	register i, first;
	register struct dfmt *c;
	register struct dfmt **cv = conv_vec;

	first = YES;
	while (c = *cv++) {
		if (first) {
			printf("%s ", icvt(addr, addr_base, UNSIGNED, 7));
			first = NO;
		} else
			putchar('\t');
		i = 0;
		while (i < n)
			i += (*(c->df_put))(dbuf+i, c);
		putchar('\n');
	}
}

s_put(n, d)
short	*n;
struct dfmt	*d;
{
	printf(d->df_fmt, icvt((long)*n, d->df_radix, d->df_signed, d->df_field));
	return(d->df_size);
}

us_put(n, d)
unsigned short	*n;
struct dfmt	*d;
{
	printf(d->df_fmt, icvt((long)*n, d->df_radix, d->df_signed, d->df_field));
	return(d->df_size);
}

l_put(n, d)
long	*n;
struct dfmt	*d;
{
	printf(d->df_fmt, icvt(*n, d->df_radix, d->df_signed, d->df_field));
	return(d->df_size);
}

d_put(f, d)
double	*f;
struct dfmt *d;
{
	char fbuf[24];
	struct l { long n[2]; };

#if	vax
	if ((((struct l *)f)->n[0] & 0xff00) == 0x8000)	/* Vax illegal f.p. */
		sprintf(fbuf, "    %08x %08x",
			((struct l *)f)->n[0], ((struct l *)f)->n[1]);
	else
#endif

		sprintf(fbuf, "%21.14e", *f);
	printf(d->df_fmt, fbuf);
	return(d->df_size);
}

f_put(f, d)
float	*f;
struct dfmt *d;
{
	char fbuf[16];

#if	vax
	if ((*(long *)f & 0xff00) == 0x8000)	/* Vax illegal f.p. form */
		sprintf(fbuf, "      %08x", *(long *)f);
	else
#endif
		sprintf(fbuf, "%14.7e", *f);
	printf(d->df_fmt, fbuf);
	return(d->df_size);
}


char	asc_name[34][4] = {
	"nul",
	"soh",
	"stx",
	"etx",
	"eot",
	"enq",
	"ack",
	"bel",
	" bs",
	" ht",
	" nl",
	" vt",
	" ff",
	" cr",
	" so",
	" si",
	"dle",
	"dc1",
	"dc2",
	"dc3",
	"dc4",
	"nak",
	"syn",
	"etb",
	"can",
	" em",
	"sub",
	"esc",
	" fs",
	" gs",
	" rs",
	" us",
	" sp",
	"del"
};

a_put(cc, d)
char	*cc;
struct dfmt *d;
{
	int c = *cc;
	register char *s = "   ";
	register pbit = parity((int)c & 0377);

	c &= 0177;
	if (c > ' ' && c < 0177)
	{
		s[2] = *cc;
		if (pbit == _parity)
			printf(d->df_fmt, underline(s, 1));
		else
			printf(d->df_fmt, s);
	}
	else
	{
		if (c == 0177)
			c = ' ' + 1;
		if (pbit == _parity)
			printf(d->df_fmt, underline(asc_name[c], 3));
		else
			printf(d->df_fmt, asc_name[c]);
	}
	return(1);
}

parity(word)
int	word;
{
	register int p = 0;
	register int w = word;

	if (w)
		do {
			p ^= 1;
		} while(w &= (~(-w)));
	return (p? ODD:EVEN);
}

char *
underline(s, n)
char	*s;
int	n;
{
	static char ulbuf[16];
	register char *u = ulbuf;

	while (n--) {
		if (*s && *s != ' ') {
			*u++ = '_';
			*u++ = '\b';
		}
		*u++ = *s++;
	}
	*u = '\0';
	return(ulbuf);
}

b_put(b, d)
char	*b;
struct dfmt *d;
{
	printf(d->df_fmt, icvt((long)*b & 0377, d->df_radix, d->df_signed, d->df_field));
	return(1);
}

c_put(cc, d)
char	*cc;
struct dfmt *d;
{
	int c = *cc & 0377;
	register char *s = "   ";

	if(c>037 && c<0177) {
		s[2] = *cc;
		printf(d->df_fmt, s);
		return(1);
	}

	switch(c) {
	case '\0':
		s = " \\0";
		break;
	case '\b':
		s = " \\b";
		break;
	case '\f':
		s = " \\f";
		break;
	case '\n':
		s = " \\n";
		break;
	case '\r':
		s = " \\r";
		break;
	case '\t':
		s = " \\t";
		break;
	default:
		s = icvt((long)c, d->df_radix, d->df_signed, d->df_field);
	}
	printf(d->df_fmt, s);
	return(1);
}

/*
 * integer to ascii conversion
 *
 * This code has been rearranged to produce optimized runtime code.
 */

#define MAXINTLENGTH	32
static char	_digit[] = "0123456789abcdef";
static char	_icv_buf[MAXINTLENGTH+1];
static long	_mask = 0x7fffffff;

char *
icvt (value, radix, signed, ndigits)
long	value;
int	radix;
int	signed;
int	ndigits;
{
	register long	val = value;
	register long	rad = radix;
	register char	*b = &_icv_buf[MAXINTLENGTH];
	register char	*d = _digit;
	register long	tmp1;
	register long	tmp2;
	long	rem;
	long	kludge;
	int	sign;

	if (val == 0)
	{
		*--b = '0';
		sign = 0;
		goto done; /*return(b);*/
	}

	if (signed && (sign = (val < 0)))	/* signed conversion */
	{
		/*
		 * It is necessary to do the first divide
		 * before the absolute value, for the case -2^31
		 *
		 * This is actually what is being done...
		 * tmp1 = (int)(val % rad);
		 * val /= rad;
		 * val = -val
		 * *--b = d[-tmp1];
		 */
		tmp1 = val / rad;
		*--b = d[(tmp1 * rad) - val];
		val = -tmp1;
	}
	else				/* unsigned conversion */
	{
		sign = 0;
		if (val < 0)
		{	/* ALL THIS IS TO SIMULATE UNSIGNED LONG MOD & DIV */
			kludge = _mask - (rad - 1);
			val &= _mask;
			/*
			 * This is really what's being done...
			 * rem = (kludge % rad) + (val % rad);
			 * val = (kludge / rad) + (val / rad) + (rem / rad) + 1;
			 * *--b = d[rem % rad];
			 */
			tmp1 = kludge / rad;
			tmp2 = val / rad;
			rem = (kludge - (tmp1 * rad)) + (val - (tmp2 * rad));
			val = ++tmp1 + tmp2;
			tmp1 = rem / rad;
			val += tmp1;
			*--b = d[rem - (tmp1 * rad)];
		}
	}

	while (val)
	{
		/*
		 * This is really what's being done ...
		 * *--b = d[val % rad];
		 * val /= rad;
		 */
		tmp1 = val / rad;
		*--b = d[val - (tmp1 * rad)];
		val = tmp1;
	}

done:
	if (sign)
		*--b = '-';

	tmp1 = ndigits - (&_icv_buf[MAXINTLENGTH] - b);
	tmp2 = signed? ' ':'0';
	while (tmp1 > 0)
	{
		*--b = tmp2;
		tmp1--;
	}

	return(b);
}

offset(s)
register char *s;
{
	register char *p;
	long a;
	register int d;

	if (*s=='+')
		s++;
	if (*s=='x') {
		s++;
		addr_base = 16;
	} else if (*s=='0' && s[1]=='x') {
		s += 2;
		addr_base = 16;
	} else if (*s == '0')
		addr_base = 8;
	p = s;
	while(*p) {
		if (*p++=='.')
			addr_base = 10;
	}
	for (a=0; *s; s++) {
		d = *s;
		if(d>='0' && d<='9')
			a = a*addr_base + d - '0';
		else if (d>='a' && d<='f' && addr_base==16)
			a = a*addr_base + d + 10 - 'a';
		else
			break;
	}
	if (*s == '.')
		s++;
	if(*s=='b' || *s=='B')
		a *= 512;
	if (canseek(stdin))
		fseek(stdin, a, 0);
	else
		dumbseek(stdin, a);
	addr = a;
}

dumbseek(s, offset)
FILE	*s;
long	offset;
{
	char	buf[BUFSIZ];
	int	n;
	int	nr;

	while (offset > 0)
	{
		nr = (offset > BUFSIZ) ? BUFSIZ : (int)offset;
		if ((n = fread(buf, 1, nr, s)) != nr)
		{
			fprintf(stderr, "EOF\n");
			exit(1);
		}
		offset -= n;
	}
}

#include <sys/types.h>
#include <sys/stat.h>

canseek(f)
FILE	*f;
{
	struct stat statb;

	return( (fstat(fileno(f),&statb)==0) &&
		(statb.st_nlink > 0) &&		/*!pipe*/
		(!isatty(fileno(f))) );
}