|
|
1.1 root 1: /*
2: * Copyright (c) 1980 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: (1) source distributions retain this entire copyright
7: * notice and comment, and (2) distributions including binaries display
8: * the following acknowledgement: ``This product includes software
9: * developed by the University of California, Berkeley and its contributors''
10: * in the documentation or other materials provided with the distribution
11: * and in all advertising materials mentioning features or use of this
12: * software. Neither the name of the University nor the names of its
13: * contributors may be used to endorse or promote products derived
14: * from this software without specific prior written permission.
15: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
16: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
17: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
18: *
19: * @(#)tset.delays.h 5.4 (Berkeley) 6/1/90
20: */
21:
22: /*
23: ** SYSTEM DEPENDENT TERMINAL DELAY TABLES
24: **
25: ** Evans Hall VAX
26: **
27: ** This file maintains the correspondence between the delays
28: ** defined in /etc/termcap and the delay algorithms on a
29: ** particular system. For each type of delay, the bits used
30: ** for that delay must be specified (in XXbits) and a table
31: ** must be defined giving correspondences between delays and
32: ** algorithms. Algorithms which are not fixed delays (such
33: ** as dependent on current column or line number) must be
34: ** cludged in some way at this time.
35: */
36:
37:
38:
39: /*
40: ** Carriage Return delays
41: */
42:
43: int CRbits = CRDELAY;
44: struct delay CRdelay[] =
45: {
46: 0, CR0,
47: 9, CR3,
48: 80, CR1,
49: 160, CR2,
50: -1
51: };
52:
53: /*
54: ** New Line delays
55: */
56:
57: int NLbits = NLDELAY;
58: struct delay NLdelay[] =
59: {
60: 0, NL0,
61: 66, NL1, /* special M37 delay */
62: 100, NL2,
63: -1
64: };
65:
66:
67: /*
68: ** Back Space delays
69: */
70:
71: int BSbits = BSDELAY;
72: struct delay BSdelay[] =
73: {
74: 0, BS0,
75: -1
76: };
77:
78:
79: /*
80: ** TaB delays
81: */
82:
83: int TBbits = TBDELAY;
84: struct delay TBdelay[] =
85: {
86: 0, TAB0,
87: 11, TAB1, /* special M37 delay */
88: -1
89: };
90:
91:
92: /*
93: ** Form Feed delays
94: */
95:
96: int FFbits = VTDELAY;
97: struct delay FFdelay[] =
98: {
99: 0, FF0,
100: 2000, FF1,
101: -1
102: };
103:
104: #ifdef CBVIRTTERM
105: /*
106: * Map from the universal tables in termcap to the particular numbers
107: * this system uses. The lack of standardization of terminal numbers
108: * is a botch but such is life.
109: */
110: struct vt_map {
111: char stdnum;
112: char localnum;
113: } vt_map[] = {
114: #ifdef TERM_TEC
115: 1, TERM_TEC,
116: #endif
117: #ifdef TERM_V61
118: 2, TERM_V61,
119: #endif
120: #ifdef TERM_V10
121: 3, TERM_V10,
122: #endif
123: #ifdef TERM_TEX
124: 4, TERM_TEX,
125: #endif
126: #ifdef TERM_D40
127: 5, TERM_D40,
128: #endif
129: #ifdef TERM_H45
130: 6, TERM_H45,
131: #endif
132: #ifdef TERM_D42
133: 7, TERM_D42,
134: #endif
135: #ifdef TERM_C100
136: 8, TERM_C100,
137: #endif
138: #ifdef TERM_MIME
139: 9, TERM_MIME,
140: #endif
141: 0,0
142: };
143: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.