Return to prf.c CVS log

Up to [Power 6/32 Unix Tahoe 4.2BSD] / cci / sys / stand

Power 6/32 Unix version 1.21

/*	prf.c	4.3	81/05/05	*/

#include "../h/param.h"
#include "../machine/mtpr.h"
#include "../h/cp.h"
#ifdef NOIO
#define CINADR	0xf0000		/* Dummy keyboard (memory mapped) */
#define COUTADR	0xf1000		/* Dummy screen 	-,,-	  */
#endif

int	wait_for_char = 1;

/*
 * Scaled down version of C Library printf.
 * Used to print diagnostic information directly on console tty.
 * Since it is not interrupt driven, all system activities are
 * suspended.  Printf should not be used for chit-chat.
 *
 * One additional format: %b is supported to decode error registers.
 * Usage is:
 *	printf("reg=%b\n", regval, "<base><arg>*");
 * Where <base> is the output base expressed as a control character,
 * e.g. \10 gives octal; \20 gives hex.  Each arg is a sequence of
 * characters, the first of which gives the bit number to be inspected
 * (origin 1), and the next characters (up to a control character, i.e.
 * a character <= 32), give the name of the register.  Thus
 *	printf("reg=%b\n", 3, "\10\2BITTWO\1BITONE\n");
 * would produce output:
 *	reg=2<BITTWO,BITONE>
 */
/*VARARGS1*/
printf(fmt, x1)
	char *fmt;
	unsigned x1;
{

	prf(fmt, &x1);
}

prf(fmt, adx)
	register char *fmt;
	register u_int *adx;
{
	register int b, c, i;
	char *s;
	int any;

loop:
	while ((c = *fmt++) != '%') {
		if(c == '\0')
			return;
		putchar(c);
	}
again:
	c = *fmt++;
	/* THIS CODE IS VAX DEPENDENT IN HANDLING %l? AND %c */
	switch (c) {

	case 'l':
		goto again;
	case 'x': case 'X':
		b = 16;
		goto number;
	case 'd': case 'D':
	case 'u':		/* what a joke */
		b = 10;
		goto number;
	case 'o': case 'O':
		b = 8;
number:
		printn((u_long)*adx, b);
		break;
	case 'c':
		b = *adx;
		for (i = 24; i >= 0; i -= 8)
			if (c = (b >> i) & 0x7f)
				putchar(c);
		break;
	case 'b':
		b = *adx++;
		s = (char *)*adx;
		printn((u_long)b, *s++);
		any = 0;
		if (b) {
			putchar('<');
			while (i = *s++) {
				if (b & (1 << (i-1))) {
					if (any)
						putchar(',');
					any = 1;
					for (; (c = *s) > 32; s++)
						putchar(c);
				} else
					for (; *s > 32; s++)
						;
			}
			putchar('>');
		}
		break;

	case 's':
		s = (char *)*adx;
		while (c = *s++)
			putchar(c);
		break;
	}
	adx++;
	goto loop;
}

/*
 * Printn prints a number n in base b.
 * We don't use recursion to avoid deep kernel stacks.
 */
printn(n, b)
	u_long n;
{
	char prbuf[11];
	register char *cp;

	if (b == 10 && (int)n < 0) {
		putchar('-');
		n = (unsigned)(-(int)n);
	}
	cp = prbuf;
	do {
		*cp++ = "0123456789abcdef"[n%b];
		n /= b;
	} while (n);
	do
		putchar(*--cp);
	while (cp > prbuf);
}

/*
 * Print a character on console.
 * Attempts to save and restore device
 * status.
 *
 * Whether or not printing is inhibited,
 * the last MSGBUFS characters
 * are saved in msgbuf for inspection later.
 */
#ifdef NOIO
char	*coutadr=(char *)COUTADR;
putchar(c)
	register c;
{
	*coutadr++ = c;
}

char	*cinadr=(char *)CINADR;
getchar()
{
	return( *cinadr++ );
}

#else
struct	cpdcb_o cpout;
struct	cpdcb_i cpin;

/* console requires even parity */
#define EVENP
putchar(c)
char c;
{
	int time;
#ifdef EVENP
	register mask, par;

	for(par=0, mask=1; mask!=0200; mask<<=1, par<<=1)
		par ^= c&mask;
	c |= par;
#endif EVENP
	cpout.cp_hdr.cp_unit = CPCONS;	/* Resets done bit */
	cpout.cp_hdr.cp_comm = CPWRITE;
	cpout.cp_hdr.cp_count = 1;
	cpout.cp_buf[0] = c;
	mtpr(&cpout, CPMDCB);
#ifdef SIMIO
	simout(&cpout);
#endif
	time = 100000;				/* Delay loop */
	while (time--) {
		uncache (&cpout.cp_hdr.cp_unit) ;
		if (cpout.cp_hdr.cp_unit & CPDONE) break;
	}
	if (c == '\n') putchar ('\r');
}

#ifdef SIMIO
simout(addr)
{
	asm(".byte 0x4");
}
simin(addr)
{
	asm(".byte 0x3");
}
#endif

getchar()
{
	static	char_read = 0;
	char	c;

	if(!char_read) {
		char_read = 1;
		cpin.cp_hdr.cp_unit = CPCONS;	/* Resets done bit */
		cpin.cp_hdr.cp_comm = CPREAD;
		cpin.cp_hdr.cp_count = 1;
		mtpr(&cpin, CPMDCB);
#ifdef SIMIO
		simin(&cpin);
#endif
	}
	uncache (&cpin.cp_hdr.cp_unit);
	if(wait_for_char) {
		while ((cpin.cp_hdr.cp_unit & CPDONE) == 0) 
			uncache (&cpin.cp_hdr.cp_unit);
	}
	else {
		if((cpin.cp_hdr.cp_unit & CPDONE) == 0)
			return 0;
	}
	uncache (&cpin.cpi_buf[0]);
	c = cpin.cpi_buf[0] & 0x7f;
	char_read = 0;
	if (c == '\r')  c = '\n';
	if(c != '\b')
		putchar(c);
	return(c);
}
#endif


gets(buf)
	char *buf;
{
	static char	line[256];
	static char	*lp = line;
	register	c;

	*buf = '\0';
	for (;;) {
	store:
		c = getchar() & 0177;
		switch(c) {
		case '\0' :
			if(!wait_for_char)
				return;
			break;
		case '\n':
		case '\r':
			c = '\n';
			*lp = '\0';
			strcpy(buf, line);
			lp = line;
			return;
		case '\b':
			if (lp > line)
				putchar('\b');
		case '#':
			lp--;
			if (lp < line)
				lp = line;
			continue;
		case '@':
		case 'u'&037:
			lp = line;
			putchar('\n');
			continue;
		default:
			if((lp - line) < 256)
				*lp++ = c;
		}
	}
}

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.