]>
git.cameronkatri.com Git - bsdgames-darwin.git/blob - bcd/bcd.c
1 /* $NetBSD: bcd.c,v 1.7 1997/10/10 09:54:18 lukem Exp $ */
4 * Copyright (c) 1989, 1993
5 * The Regents of the University of California. All rights reserved.
7 * This code is derived from software contributed to Berkeley by
8 * Steve Hayman of the Indiana University Computer Science Dept.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
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.
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
39 #include <sys/cdefs.h>
41 __COPYRIGHT("@(#) Copyright (c) 1989, 1993\n\
42 The Regents of the University of California. All rights reserved.\n");
47 static char sccsid
[] = "@(#)bcd.c 8.2 (Berkeley) 3/20/94";
49 __RCSID("$NetBSD: bcd.c,v 1.7 1997/10/10 09:54:18 lukem Exp $");
56 * Read one line of standard input and produce something that looks like a
57 * punch card. An attempt to reimplement /usr/games/bcd. All I looked at
60 * I couldn't find a BCD table handy so I wrote a shell script to deduce what
61 * the patterns were that the old bcd was using for each possible 8-bit
62 * character. These are the results -- the low order 12 bits represent the
63 * holes. (A 1 bit is a hole.) These may be wrong, but they match the old
67 * sahayman@iuvax.cs.indiana.edu
71 * I found an error in the table. The same error is found in the SunOS 4.1.1
72 * version of bcd. It has apparently been around a long time. The error caused
73 * 'Q' and 'R' to have the same punch code. I only noticed the error due to
74 * someone pointing it out to me when the program was used to print a cover
75 * for an APA! The table was wrong in 4 places. The other error was masked
76 * by the fact that the input is converted to upper case before lookup.
79 * db@diana.ocunix.on.ca
83 #include <sys/types.h>
89 u_short holes
[256] = {
90 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
91 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
92 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
93 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
94 0x0, 0x206, 0x20a, 0x042, 0x442, 0x222, 0x800, 0x406,
95 0x812, 0x412, 0x422, 0xa00, 0x242, 0x400, 0x842, 0x300,
96 0x200, 0x100, 0x080, 0x040, 0x020, 0x010, 0x008, 0x004,
97 0x002, 0x001, 0x012, 0x40a, 0x80a, 0x212, 0x00a, 0x006,
98 0x022, 0x900, 0x880, 0x840, 0x820, 0x810, 0x808, 0x804,
99 0x802, 0x801, 0x500, 0x480, 0x440, 0x420, 0x410, 0x408,
100 0x404, 0x402, 0x401, 0x280, 0x240, 0x220, 0x210, 0x208,
101 0x204, 0x202, 0x201, 0x082, 0x822, 0x600, 0x282, 0x30f,
102 0x900, 0x880, 0x840, 0x820, 0x810, 0x808, 0x804, 0x802,
103 0x801, 0x500, 0x480, 0x440, 0x420, 0x410, 0x408, 0x404,
104 0x402, 0x401, 0x280, 0x240, 0x220, 0x210, 0x208, 0x204,
105 0x202, 0x201, 0x082, 0x806, 0x822, 0x600, 0x282, 0x0,
106 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
107 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
108 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
109 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
110 0x206, 0x20a, 0x042, 0x442, 0x222, 0x800, 0x406, 0x812,
111 0x412, 0x422, 0xa00, 0x242, 0x400, 0x842, 0x300, 0x200,
112 0x100, 0x080, 0x040, 0x020, 0x010, 0x008, 0x004, 0x002,
113 0x001, 0x012, 0x40a, 0x80a, 0x212, 0x00a, 0x006, 0x022,
114 0x900, 0x880, 0x840, 0x820, 0x810, 0x808, 0x804, 0x802,
115 0x801, 0x500, 0x480, 0x440, 0x420, 0x410, 0x408, 0x404,
116 0x402, 0x401, 0x280, 0x240, 0x220, 0x210, 0x208, 0x204,
117 0x202, 0x201, 0x082, 0x806, 0x822, 0x600, 0x282, 0x30f,
118 0x900, 0x880, 0x840, 0x820, 0x810, 0x808, 0x804, 0x802,
119 0x801, 0x500, 0x480, 0x440, 0x420, 0x410, 0x408, 0x404,
120 0x402, 0x401, 0x280, 0x240, 0x220, 0x210, 0x208, 0x204,
121 0x202, 0x201, 0x082, 0x806, 0x822, 0x600, 0x282, 0x0
127 #define bit(w,i) ((w)&(1<<(i)))
129 int main
__P((int, char *[]));
130 void printcard
__P((char *));
140 * The original bcd prompts with a "%" when reading from stdin,
141 * but this seems kind of silly. So this one doesn't.
148 while (fgets(cardline
, sizeof(cardline
), stdin
))
159 static char rowchars
[] = " 123456789";
163 /* ruthlessly remove newlines and truncate at 48 characters. */
164 if ((p
= strchr(str
, '\n')))
167 if (strlen(str
) > COLUMNS
)
170 /* make string upper case. */
171 for (p
= str
; *p
; ++p
)
172 if (isascii(*p
) && islower(*p
))
177 for (i
= 1; i
<= COLUMNS
; ++i
)
182 * line of text. Leave a blank if the character doesn't have
187 for (i
= 1; *p
; i
++, p
++)
192 while (i
++ <= COLUMNS
)
198 * 12 rows of potential holes; output a ']', which looks kind of
199 * like a hole, if the appropriate bit is set in the holes[] table.
200 * The original bcd output a '[', a backspace, five control A's,
201 * and then a ']'. This seems a little excessive.
203 for (row
= 0; row
<= 11; ++row
) {
205 for (i
= 0, p
= str
; *p
; i
++, p
++) {
206 if (bit(holes
[(int)*p
], 11 - row
))
209 putchar(rowchars
[row
]);
211 while (i
++ < COLUMNS
)
212 putchar(rowchars
[row
]);
219 for (i
= 1; i
<= COLUMNS
; i
++)