|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1988 Regents of the University of California. ! 3: * All rights reserved. ! 4: * ! 5: * Redistribution and use in source and binary forms are permitted ! 6: * provided that the above copyright notice and this paragraph are ! 7: * duplicated in all such forms and that any documentation, ! 8: * advertising materials, and other materials related to such ! 9: * distribution and use acknowledge that the software was developed ! 10: * by the University of California, Berkeley. The name of the ! 11: * University may not be used to endorse or promote products derived ! 12: * from this software without specific prior written permission. ! 13: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR ! 14: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED ! 15: * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 16: */ ! 17: ! 18: #ifndef lint ! 19: char copyright[] = ! 20: "@(#) Copyright (c) 1988 Regents of the University of California.\n\ ! 21: All rights reserved.\n"; ! 22: #endif /* not lint */ ! 23: ! 24: #ifndef lint ! 25: static char sccsid[] = "@(#)mkastods.c 4.1 (Berkeley) 12/4/88"; ! 26: #endif /* not lint */ ! 27: ! 28: #include <stdio.h> ! 29: #if defined(unix) ! 30: #include <strings.h> ! 31: #else /* defined(unix) */ ! 32: #include <string.h> ! 33: #endif /* defined(unix) */ ! 34: #include <ctype.h> ! 35: #include "../api/asc_ebc.h" ! 36: #include "../api/ebc_disp.h" ! 37: ! 38: int ! 39: main() ! 40: { ! 41: int i; ! 42: ! 43: /* For each ascii code, find the display code that matches */ ! 44: ! 45: printf("unsigned char asc_disp[256] = {"); ! 46: for (i = 0; i < NASCII; i++) { ! 47: if ((i%8) == 0) { ! 48: printf("\n"); ! 49: } ! 50: printf("\t0x%02x,", ebc_disp[asc_ebc[i]]); ! 51: } ! 52: for (i = sizeof disp_ebc; i < 256; i++) { ! 53: if ((i%8) == 0) { ! 54: printf("\n"); ! 55: } ! 56: printf("\t0x%02x,", 0); ! 57: } ! 58: printf("\n};\n"); ! 59: ! 60: return 0; ! 61: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.