bcd.c revision 1.10
1/* $NetBSD: bcd.c,v 1.10 2000/05/08 07:56:02 mycroft 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#include <sys/cdefs.h> 40#ifndef lint 41__COPYRIGHT("@(#) 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 46#if 0 47static char sccsid[] = "@(#)bcd.c 8.2 (Berkeley) 3/20/94"; 48#else 49__RCSID("$NetBSD: bcd.c,v 1.10 2000/05/08 07:56:02 mycroft Exp $"); 50#endif 51#endif /* not lint */ 52 53/* 54 * bcd -- 55 * 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 58 * was the man page. 59 * 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 64 * program! 65 * 66 * Steve Hayman 67 * sahayman@iuvax.cs.indiana.edu 68 * 1989 11 30 69 * 70 * 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. 77 * 78 * Dyane Bruce 79 * db@diana.ocunix.on.ca 80 * Nov 5, 1993 81 */ 82 83#include <sys/types.h> 84 85#include <stdio.h> 86#include <string.h> 87#include <ctype.h> 88#include <unistd.h> 89 90const u_short holes[256] = { 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, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 95 0x0, 0x206, 0x20a, 0x042, 0x442, 0x222, 0x800, 0x406, 96 0x812, 0x412, 0x422, 0xa00, 0x242, 0x400, 0x842, 0x300, 97 0x200, 0x100, 0x080, 0x040, 0x020, 0x010, 0x008, 0x004, 98 0x002, 0x001, 0x012, 0x40a, 0x80a, 0x212, 0x00a, 0x006, 99 0x022, 0x900, 0x880, 0x840, 0x820, 0x810, 0x808, 0x804, 100 0x802, 0x801, 0x500, 0x480, 0x440, 0x420, 0x410, 0x408, 101 0x404, 0x402, 0x401, 0x280, 0x240, 0x220, 0x210, 0x208, 102 0x204, 0x202, 0x201, 0x082, 0x822, 0x600, 0x282, 0x30f, 103 0x900, 0x880, 0x840, 0x820, 0x810, 0x808, 0x804, 0x802, 104 0x801, 0x500, 0x480, 0x440, 0x420, 0x410, 0x408, 0x404, 105 0x402, 0x401, 0x280, 0x240, 0x220, 0x210, 0x208, 0x204, 106 0x202, 0x201, 0x082, 0x806, 0x822, 0x600, 0x282, 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 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 111 0x206, 0x20a, 0x042, 0x442, 0x222, 0x800, 0x406, 0x812, 112 0x412, 0x422, 0xa00, 0x242, 0x400, 0x842, 0x300, 0x200, 113 0x100, 0x080, 0x040, 0x020, 0x010, 0x008, 0x004, 0x002, 114 0x001, 0x012, 0x40a, 0x80a, 0x212, 0x00a, 0x006, 0x022, 115 0x900, 0x880, 0x840, 0x820, 0x810, 0x808, 0x804, 0x802, 116 0x801, 0x500, 0x480, 0x440, 0x420, 0x410, 0x408, 0x404, 117 0x402, 0x401, 0x280, 0x240, 0x220, 0x210, 0x208, 0x204, 118 0x202, 0x201, 0x082, 0x806, 0x822, 0x600, 0x282, 0x30f, 119 0x900, 0x880, 0x840, 0x820, 0x810, 0x808, 0x804, 0x802, 120 0x801, 0x500, 0x480, 0x440, 0x420, 0x410, 0x408, 0x404, 121 0x402, 0x401, 0x280, 0x240, 0x220, 0x210, 0x208, 0x204, 122 0x202, 0x201, 0x082, 0x806, 0x822, 0x600, 0x282, 0x0 123}; 124 125/* 126 * i'th bit of w. 127 */ 128#define bit(w,i) ((w)&(1<<(i))) 129 130int main __P((int, char *[])); 131void printcard __P((char *)); 132 133int 134main(argc, argv) 135 int argc; 136 char **argv; 137{ 138 char cardline[80]; 139 140 /* revoke setgid privileges */ 141 setgid(getgid()); 142 143 /* 144 * The original bcd prompts with a "%" when reading from stdin, 145 * but this seems kind of silly. So this one doesn't. 146 */ 147 148 if (argc > 1) { 149 while (--argc) 150 printcard(*++argv); 151 } else 152 while (fgets(cardline, sizeof(cardline), stdin)) 153 printcard(cardline); 154 exit(0); 155} 156 157#define COLUMNS 48 158 159void 160printcard(str) 161 char *str; 162{ 163 static const char rowchars[] = " 123456789"; 164 int i, row; 165 unsigned char *p; 166 167 /* ruthlessly remove newlines and truncate at 48 characters. */ 168 if ((p = strchr(str, '\n'))) 169 *p = '\0'; 170 171 if (strlen(str) > COLUMNS) 172 str[COLUMNS] = '\0'; 173 174 /* make string upper case. */ 175 for (p = str; *p; ++p) 176 if (isascii(*p) && islower(*p)) 177 *p = toupper(*p); 178 179 /* top of card */ 180 putchar(' '); 181 for (i = 1; i <= COLUMNS; ++i) 182 putchar('_'); 183 putchar('\n'); 184 185 /* 186 * line of text. Leave a blank if the character doesn't have 187 * a hole pattern. 188 */ 189 p = str; 190 putchar('/'); 191 for (i = 1; *p; i++, p++) 192 if (holes[(int)*p]) 193 putchar(*p); 194 else 195 putchar(' '); 196 while (i++ <= COLUMNS) 197 putchar(' '); 198 putchar('|'); 199 putchar('\n'); 200 201 /* 202 * 12 rows of potential holes; output a ']', which looks kind of 203 * like a hole, if the appropriate bit is set in the holes[] table. 204 * The original bcd output a '[', a backspace, five control A's, 205 * and then a ']'. This seems a little excessive. 206 */ 207 for (row = 0; row <= 11; ++row) { 208 putchar('|'); 209 for (i = 0, p = str; *p; i++, p++) { 210 if (bit(holes[(int)*p], 11 - row)) 211 putchar(']'); 212 else 213 putchar(rowchars[row]); 214 } 215 while (i++ < COLUMNS) 216 putchar(rowchars[row]); 217 putchar('|'); 218 putchar('\n'); 219 } 220 221 /* bottom of card */ 222 putchar('|'); 223 for (i = 1; i <= COLUMNS; i++) 224 putchar('_'); 225 putchar('|'); 226 putchar('\n'); 227} 228