2 * Copyright (c) 1988, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 #include "telnet_locl.h"
36 RCSID("$Id: network.c,v 1.11 2000/10/08 13:28:21 assar Exp $");
38 Ring netoring, netiring;
39 unsigned char netobuf[2*BUFSIZ], netibuf[BUFSIZ];
42 * Initialize internal network data structures.
48 if (ring_init(&netoring, netobuf, sizeof netobuf) != 1) {
51 if (ring_init(&netiring, netibuf, sizeof netibuf) != 1) {
59 * Check to see if any out-of-band data exists on a socket (for
60 * Telnet "synch" processing).
66 static struct timeval timeout = { 0 };
72 if (net >= FD_SETSIZE)
73 errx (1, "fd too large");
74 FD_SET(net, &excepts);
75 value = select(net+1, 0, 0, &excepts, &timeout);
76 } while ((value == -1) && (errno == EINTR));
83 if (FD_ISSET(net, &excepts)) {
94 * Sets "neturg" to the current location.
100 ring_mark(&netoring);
106 * Send as much data as possible to the network,
107 * handling requests for urgent data.
109 * The return value indicates whether we did any
119 #if defined(ENCRYPTION)
121 ring_encrypt(&netoring, encrypt_output);
123 if ((n1 = n = ring_full_consecutive(&netoring)) > 0) {
124 if (!ring_at_mark(&netoring)) {
125 n = send(net, (char *)netoring.consume, n, 0); /* normal write */
128 * In 4.2 (and 4.3) systems, there is some question about
129 * what byte in a sendOOB operation is the "OOB" data.
130 * To make ourselves compatible, we only send ONE byte
131 * out of band, the one WE THINK should be OOB (though
132 * we really have more the TCP philosophy of urgent data
133 * rather than the Unix philosophy of OOB data).
135 n = send(net, (char *)netoring.consume, 1, MSG_OOB);/* URGENT data */
139 if (errno != ENOBUFS && errno != EWOULDBLOCK) {
143 ring_clear_mark(&netoring);
144 longjmp(peerdied, -1);
150 Dump('>', netoring.consume, n);
153 ring_consumed(&netoring, n);
155 * If we sent all, and more to send, then recurse to pick
158 if ((n1 == n) && ring_full_consecutive(&netoring)) {