bcd.c revision 1.5 
1/*	$NetBSD: bcd.c,v 1.5 1995/03/21 15:08:15 cgd Exp $	*/
2
3/*
4 * Copyright (c) 1989, 1993
5 *	The Regents of the University of California.  All rights reserved.
6 *
7 * This code is derived from software contributed to Berkeley by
8 * Steve Hayman of the Indiana University Computer Science Dept.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 *    notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 *    notice, this list of conditions and the following disclaimer in the
17 *    documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 *    must display the following acknowledgement:
20 *	This product includes software developed by the University of
21 *	California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 *    may be used to endorse or promote products derived from this software
24 *    without specific prior written permission.
25 *
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * SUCH DAMAGE.
37 */
38
39#ifndef lint
40static char copyright[] =
41"@(#) Copyright (c) 1989, 1993\n\
42	The Regents of the University of California.  All rights reserved.\n";
43#endif /* not lint */
44
45#ifndef lint
46static char sccsid[] = "@(#)bcd.c	8.2 (Berkeley) 3/20/94";
47#endif /* not lint */
48
49/*
50 * bcd --
51 *
52 * Read one line of standard input and produce something that looks like a
53 * punch card.  An attempt to reimplement /usr/games/bcd.  All I looked at
54 * was the man page.
55 *
56 * I couldn't find a BCD table handy so I wrote a shell script to deduce what
57 * the patterns were that the old bcd was using for each possible 8-bit
58 * character.  These are the results -- the low order 12 bits represent the
59 * holes.  (A 1 bit is a hole.)  These may be wrong, but they match the old
60 * program!
61 *
62 * Steve Hayman
63 * sahayman@iuvax.cs.indiana.edu
64 * 1989 11 30
65 *
66 *
67 * I found an error in the table. The same error is found in the SunOS 4.1.1
68 * version of bcd. It has apparently been around a long time. The error caused
69 * 'Q' and 'R' to have the same punch code. I only noticed the error due to
70 * someone pointing it out to me when the program was used to print a cover
71 * for an APA!  The table was wrong in 4 places. The other error was masked
72 * by the fact that the input is converted to upper case before lookup.
73 *
74 * Dyane Bruce
75 * db@diana.ocunix.on.ca
76 * Nov 5, 1993
77 */
78
79#include <sys/types.h>
80
81#include <stdio.h>
82#include <ctype.h>
83
84u_short holes[256] = {
85    0x0,	 0x0,	  0x0,	   0x0,	    0x0,     0x0,     0x0,     0x0,
86    0x0,	 0x0,	  0x0,	   0x0,	    0x0,     0x0,     0x0,     0x0,
87    0x0,	 0x0,	  0x0,	   0x0,	    0x0,     0x0,     0x0,     0x0,
88    0x0,	 0x0,	  0x0,	   0x0,	    0x0,     0x0,     0x0,     0x0,
89    0x0,	 0x206,	  0x20a,   0x042,   0x442,   0x222,   0x800,   0x406,
90    0x812,	 0x412,	  0x422,   0xa00,   0x242,   0x400,   0x842,   0x300,
91    0x200,	 0x100,	  0x080,   0x040,   0x020,   0x010,   0x008,   0x004,
92    0x002,	 0x001,	  0x012,   0x40a,   0x80a,   0x212,   0x00a,   0x006,
93    0x022,	 0x900,	  0x880,   0x840,   0x820,   0x810,   0x808,   0x804,
94    0x802,	 0x801,	  0x500,   0x480,   0x440,   0x420,   0x410,   0x408,
95    0x404,	 0x402,	  0x401,   0x280,   0x240,   0x220,   0x210,   0x208,
96    0x204,	 0x202,	  0x201,   0x082,   0x822,   0x600,   0x282,   0x30f,
97    0x900,	 0x880,	  0x840,   0x820,   0x810,   0x808,   0x804,   0x802,
98    0x801,	 0x500,	  0x480,   0x440,   0x420,   0x410,   0x408,   0x404,
99    0x402,	 0x401,	  0x280,   0x240,   0x220,   0x210,   0x208,   0x204,
100    0x202,	 0x201,	  0x082,   0x806,   0x822,   0x600,   0x282,   0x0,
101    0x0,	 0x0,	  0x0,	   0x0,	    0x0,     0x0,     0x0,     0x0,
102    0x0,	 0x0,	  0x0,	   0x0,	    0x0,     0x0,     0x0,     0x0,
103    0x0,	 0x0,	  0x0,	   0x0,	    0x0,     0x0,     0x0,     0x0,
104    0x0,	 0x0,	  0x0,	   0x0,	    0x0,     0x0,     0x0,     0x0,
105    0x206,	 0x20a,	  0x042,   0x442,   0x222,   0x800,   0x406,   0x812,
106    0x412,	 0x422,	  0xa00,   0x242,   0x400,   0x842,   0x300,   0x200,
107    0x100,	 0x080,	  0x040,   0x020,   0x010,   0x008,   0x004,   0x002,
108    0x001,	 0x012,	  0x40a,   0x80a,   0x212,   0x00a,   0x006,   0x022,
109    0x900,	 0x880,	  0x840,   0x820,   0x810,   0x808,   0x804,   0x802,
110    0x801,	 0x500,	  0x480,   0x440,   0x420,   0x410,   0x408,   0x404,
111    0x402,	 0x401,	  0x280,   0x240,   0x220,   0x210,   0x208,   0x204,
112    0x202,	 0x201,	  0x082,   0x806,   0x822,   0x600,   0x282,   0x30f,
113    0x900,	 0x880,	  0x840,   0x820,   0x810,   0x808,   0x804,   0x802,
114    0x801,	 0x500,	  0x480,   0x440,   0x420,   0x410,   0x408,   0x404,
115    0x402,	 0x401,	  0x280,   0x240,   0x220,   0x210,   0x208,   0x204,
116    0x202,	 0x201,	  0x082,   0x806,   0x822,   0x600,   0x282,   0x0
117};
118
119/*
120 * i'th bit of w.
121 */
122#define	bit(w,i)	((w)&(1<<(i)))
123
124int
125main(argc, argv)
126	int argc;
127	char **argv;
128{
129	char cardline[80];
130
131	/*
132	 * The original bcd prompts with a "%" when reading from stdin,
133	 * but this seems kind of silly.  So this one doesn't.
134	 */
135
136	if (argc > 1) {
137		while (--argc)
138			printcard(*++argv);
139	} else
140		while (fgets(cardline, sizeof(cardline), stdin))
141			printcard(cardline);
142	exit(0);
143}
144
145#define	COLUMNS	48
146
147printcard(str)
148	register char *str;
149{
150	static char rowchars[] = "   123456789";
151	register int i, row;
152	register char *p;
153	char *index();
154
155	/* ruthlessly remove newlines and truncate at 48 characters. */
156	if ((p = index(str, '\n')))
157		*p = '\0';
158
159	if (strlen(str) > COLUMNS)
160		str[COLUMNS] = '\0';
161
162	/* make string upper case. */
163	for (p = str; *p; ++p)
164		if (isascii(*p) && islower(*p))
165			*p = toupper(*p);
166
167	 /* top of card */
168	putchar(' ');
169	for (i = 1; i <= COLUMNS; ++i)
170		putchar('_');
171	putchar('\n');
172
173	/*
174	 * line of text.  Leave a blank if the character doesn't have
175	 * a hole pattern.
176	 */
177	p = str;
178	putchar('/');
179	for (i = 1; *p; i++, p++)
180		if (holes[*p])
181			putchar(*p);
182		else
183			putchar(' ');
184	while (i++ <= COLUMNS)
185		putchar(' ');
186	putchar('|');
187	putchar('\n');
188
189	/*
190	 * 12 rows of potential holes; output a ']', which looks kind of
191	 * like a hole, if the appropriate bit is set in the holes[] table.
192	 * The original bcd output a '[', a backspace, five control A's,
193	 * and then a ']'.  This seems a little excessive.
194	 */
195	for (row = 0; row <= 11; ++row) {
196		putchar('|');
197		for (i = 0, p = str; *p; i++, p++) {
198			if (bit(holes[*p], 11 - row))
199				putchar(']');
200			else
201				putchar(rowchars[row]);
202		}
203		while (i++ < COLUMNS)
204			putchar(rowchars[row]);
205		putchar('|');
206		putchar('\n');
207	}
208
209	/* bottom of card */
210	putchar('|');
211	for (i = 1; i <= COLUMNS; i++)
212		putchar('_');
213	putchar('|');
214	putchar('\n');
215}
216