defs.h revision 1.13 1 1.13 itojun /* $NetBSD: defs.h,v 1.13 2003/07/14 15:55:53 itojun Exp $ */
2 1.6 thorpej
3 1.1 cgd /*
4 1.4 cgd * Copyright (c) 1989, 1993
5 1.4 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd *
35 1.4 cgd * from: @(#)defs.h 8.1 (Berkeley) 6/4/93
36 1.1 cgd */
37 1.1 cgd
38 1.1 cgd /*
39 1.1 cgd * Telnet server defines
40 1.1 cgd */
41 1.1 cgd #include <sys/types.h>
42 1.1 cgd #include <sys/param.h>
43 1.3 mycroft
44 1.1 cgd #if defined(PRINTOPTIONS) && defined(DIAGNOSTICS)
45 1.1 cgd #define TELOPTS
46 1.1 cgd #define TELCMDS
47 1.1 cgd #define SLC_NAMES
48 1.1 cgd #endif
49 1.1 cgd
50 1.1 cgd #include <sys/socket.h>
51 1.1 cgd #include <sys/wait.h>
52 1.1 cgd #include <fcntl.h>
53 1.1 cgd #include <sys/file.h>
54 1.1 cgd #include <sys/stat.h>
55 1.1 cgd #include <sys/time.h>
56 1.12 mycroft #include <sys/poll.h>
57 1.1 cgd #include <sys/ioctl.h>
58 1.1 cgd
59 1.1 cgd #include <netinet/in.h>
60 1.1 cgd
61 1.1 cgd #include <arpa/telnet.h>
62 1.1 cgd
63 1.1 cgd #include <stdio.h>
64 1.1 cgd #include <stdlib.h>
65 1.1 cgd #include <signal.h>
66 1.1 cgd #include <errno.h>
67 1.1 cgd #include <netdb.h>
68 1.1 cgd #include <syslog.h>
69 1.1 cgd #include <ctype.h>
70 1.1 cgd #include <string.h>
71 1.13 itojun #include <termios.h>
72 1.7 kleink #include <time.h>
73 1.1 cgd #include <unistd.h>
74 1.1 cgd
75 1.1 cgd /*
76 1.1 cgd * I/O data buffers defines
77 1.1 cgd */
78 1.1 cgd #define NETSLOP 64
79 1.1 cgd
80 1.13 itojun #define NIACCUM(c) do { \
81 1.13 itojun *netip++ = c; \
82 1.1 cgd ncc++; \
83 1.13 itojun } while (0)
84 1.1 cgd
85 1.1 cgd /* clock manipulations */
86 1.1 cgd #define settimer(x) (clocks.x = ++clocks.system)
87 1.1 cgd #define sequenceIs(x,y) (clocks.x < clocks.y)
88 1.1 cgd
89 1.1 cgd /*
90 1.1 cgd * Linemode support states, in decreasing order of importance
91 1.1 cgd */
92 1.4 cgd #define REAL_LINEMODE 0x04
93 1.4 cgd #define KLUDGE_OK 0x03
94 1.4 cgd #define NO_AUTOKLUDGE 0x02
95 1.1 cgd #define KLUDGE_LINEMODE 0x01
96 1.1 cgd #define NO_LINEMODE 0x00
97 1.1 cgd
98 1.1 cgd /*
99 1.1 cgd * Structures of information for each special character function.
100 1.1 cgd */
101 1.1 cgd typedef struct {
102 1.1 cgd unsigned char flag; /* the flags for this function */
103 1.1 cgd cc_t val; /* the value of the special character */
104 1.1 cgd } slcent, *Slcent;
105 1.1 cgd
106 1.1 cgd typedef struct {
107 1.1 cgd slcent defset; /* the default settings */
108 1.1 cgd slcent current; /* the current settings */
109 1.1 cgd cc_t *sptr; /* a pointer to the char in */
110 1.1 cgd /* system data structures */
111 1.1 cgd } slcfun, *Slcfun;
112 1.1 cgd
113 1.1 cgd #ifdef DIAGNOSTICS
114 1.1 cgd /*
115 1.1 cgd * Diagnostics capabilities
116 1.1 cgd */
117 1.1 cgd #define TD_REPORT 0x01 /* Report operations to client */
118 1.1 cgd #define TD_EXERCISE 0x02 /* Exercise client's implementation */
119 1.1 cgd #define TD_NETDATA 0x04 /* Display received data stream */
120 1.1 cgd #define TD_PTYDATA 0x08 /* Display data passed to pty */
121 1.1 cgd #define TD_OPTIONS 0x10 /* Report just telnet options */
122 1.1 cgd #endif /* DIAGNOSTICS */
123 1.1 cgd
124 1.1 cgd /*
125 1.1 cgd * We keep track of each side of the option negotiation.
126 1.1 cgd */
127 1.1 cgd
128 1.1 cgd #define MY_STATE_WILL 0x01
129 1.1 cgd #define MY_WANT_STATE_WILL 0x02
130 1.1 cgd #define MY_STATE_DO 0x04
131 1.1 cgd #define MY_WANT_STATE_DO 0x08
132 1.1 cgd
133 1.1 cgd /*
134 1.1 cgd * Macros to check the current state of things
135 1.1 cgd */
136 1.1 cgd
137 1.1 cgd #define my_state_is_do(opt) (options[opt]&MY_STATE_DO)
138 1.1 cgd #define my_state_is_will(opt) (options[opt]&MY_STATE_WILL)
139 1.1 cgd #define my_want_state_is_do(opt) (options[opt]&MY_WANT_STATE_DO)
140 1.1 cgd #define my_want_state_is_will(opt) (options[opt]&MY_WANT_STATE_WILL)
141 1.1 cgd
142 1.1 cgd #define my_state_is_dont(opt) (!my_state_is_do(opt))
143 1.1 cgd #define my_state_is_wont(opt) (!my_state_is_will(opt))
144 1.1 cgd #define my_want_state_is_dont(opt) (!my_want_state_is_do(opt))
145 1.1 cgd #define my_want_state_is_wont(opt) (!my_want_state_is_will(opt))
146 1.1 cgd
147 1.1 cgd #define set_my_state_do(opt) (options[opt] |= MY_STATE_DO)
148 1.1 cgd #define set_my_state_will(opt) (options[opt] |= MY_STATE_WILL)
149 1.1 cgd #define set_my_want_state_do(opt) (options[opt] |= MY_WANT_STATE_DO)
150 1.1 cgd #define set_my_want_state_will(opt) (options[opt] |= MY_WANT_STATE_WILL)
151 1.1 cgd
152 1.1 cgd #define set_my_state_dont(opt) (options[opt] &= ~MY_STATE_DO)
153 1.1 cgd #define set_my_state_wont(opt) (options[opt] &= ~MY_STATE_WILL)
154 1.1 cgd #define set_my_want_state_dont(opt) (options[opt] &= ~MY_WANT_STATE_DO)
155 1.1 cgd #define set_my_want_state_wont(opt) (options[opt] &= ~MY_WANT_STATE_WILL)
156 1.1 cgd
157 1.1 cgd /*
158 1.1 cgd * Tricky code here. What we want to know is if the MY_STATE_WILL
159 1.1 cgd * and MY_WANT_STATE_WILL bits have the same value. Since the two
160 1.1 cgd * bits are adjacent, a little arithmatic will show that by adding
161 1.1 cgd * in the lower bit, the upper bit will be set if the two bits were
162 1.1 cgd * different, and clear if they were the same.
163 1.1 cgd */
164 1.1 cgd #define my_will_wont_is_changing(opt) \
165 1.1 cgd ((options[opt]+MY_STATE_WILL) & MY_WANT_STATE_WILL)
166 1.1 cgd
167 1.1 cgd #define my_do_dont_is_changing(opt) \
168 1.1 cgd ((options[opt]+MY_STATE_DO) & MY_WANT_STATE_DO)
169 1.1 cgd
170 1.1 cgd /*
171 1.9 wiz * Make everything symmetrical
172 1.1 cgd */
173 1.1 cgd
174 1.1 cgd #define HIS_STATE_WILL MY_STATE_DO
175 1.1 cgd #define HIS_WANT_STATE_WILL MY_WANT_STATE_DO
176 1.1 cgd #define HIS_STATE_DO MY_STATE_WILL
177 1.1 cgd #define HIS_WANT_STATE_DO MY_WANT_STATE_WILL
178 1.1 cgd
179 1.1 cgd #define his_state_is_do my_state_is_will
180 1.1 cgd #define his_state_is_will my_state_is_do
181 1.1 cgd #define his_want_state_is_do my_want_state_is_will
182 1.1 cgd #define his_want_state_is_will my_want_state_is_do
183 1.1 cgd
184 1.1 cgd #define his_state_is_dont my_state_is_wont
185 1.1 cgd #define his_state_is_wont my_state_is_dont
186 1.1 cgd #define his_want_state_is_dont my_want_state_is_wont
187 1.1 cgd #define his_want_state_is_wont my_want_state_is_dont
188 1.1 cgd
189 1.1 cgd #define set_his_state_do set_my_state_will
190 1.1 cgd #define set_his_state_will set_my_state_do
191 1.1 cgd #define set_his_want_state_do set_my_want_state_will
192 1.1 cgd #define set_his_want_state_will set_my_want_state_do
193 1.1 cgd
194 1.1 cgd #define set_his_state_dont set_my_state_wont
195 1.1 cgd #define set_his_state_wont set_my_state_dont
196 1.1 cgd #define set_his_want_state_dont set_my_want_state_wont
197 1.1 cgd #define set_his_want_state_wont set_my_want_state_dont
198 1.1 cgd
199 1.1 cgd #define his_will_wont_is_changing my_do_dont_is_changing
200 1.1 cgd #define his_do_dont_is_changing my_will_wont_is_changing
201 1.8 christos
202 1.8 christos /*
203 1.8 christos * Initialization buffer for tty device [16 characters long]
204 1.8 christos */
205 1.8 christos #define NULL16STR "\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0"
206