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