|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1981 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 COHERENT ! 19: #ifndef lint ! 20: static uchar sccsid[] = "@(#)unctrl.c 5.3 (Berkeley) 6/30/88"; ! 21: #endif /* not lint */ ! 22: #endif /* not COHERENT */ ! 23: ! 24: /* ! 25: * define unctrl codes for each character ! 26: * ! 27: */ ! 28: ! 29: /* LINTLIBRARY */ ! 30: unsigned char *_unctrl[] = { /* unctrl codes for ttys */ ! 31: "^@", "^A", "^B", "^C", "^D", "^E", "^F", "^G", "^H", "^I", "^J", "^K", ! 32: "^L", "^M", "^N", "^O", "^P", "^Q", "^R", "^S", "^T", "^U", "^V", "^W", ! 33: "^X", "^Y", "^Z", "^[", "^\\", "^]", "^~", "^_", ! 34: " ", "!", "\"", "#", "$", "%", "&", "'", "(", ")", "*", "+", ",", "-", ! 35: ".", "/", "0", "1", "2", "3", "4", "5", "6", "7", "8", "9", ":", ";", ! 36: "<", "=", ">", "?", "@", "A", "B", "C", "D", "E", "F", "G", "H", "I", ! 37: "J", "K", "L", "M", "N", "O", "P", "Q", "R", "S", "T", "U", "V", "W", ! 38: "X", "Y", "Z", "[", "\\", "]", "^", "_", "`", "a", "b", "c", "d", "e", ! 39: "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", ! 40: "t", "u", "v", "w", "x", "y", "z", "{", "|", "}", "~", "^?" ! 41: };
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.