tcp_subr.c revision 1.25 1 1.25 mycroft /* $NetBSD: tcp_subr.c,v 1.25 1996/12/10 18:20:23 mycroft Exp $ */
2 1.11 cgd
3 1.1 cgd /*
4 1.10 mycroft * Copyright (c) 1982, 1986, 1988, 1990, 1993
5 1.10 mycroft * 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.11 cgd * @(#)tcp_subr.c 8.1 (Berkeley) 6/10/93
36 1.1 cgd */
37 1.1 cgd
38 1.5 mycroft #include <sys/param.h>
39 1.10 mycroft #include <sys/proc.h>
40 1.5 mycroft #include <sys/systm.h>
41 1.5 mycroft #include <sys/malloc.h>
42 1.5 mycroft #include <sys/mbuf.h>
43 1.5 mycroft #include <sys/socket.h>
44 1.5 mycroft #include <sys/socketvar.h>
45 1.5 mycroft #include <sys/protosw.h>
46 1.5 mycroft #include <sys/errno.h>
47 1.1 cgd
48 1.5 mycroft #include <net/route.h>
49 1.5 mycroft #include <net/if.h>
50 1.1 cgd
51 1.5 mycroft #include <netinet/in.h>
52 1.5 mycroft #include <netinet/in_systm.h>
53 1.5 mycroft #include <netinet/ip.h>
54 1.5 mycroft #include <netinet/in_pcb.h>
55 1.5 mycroft #include <netinet/ip_var.h>
56 1.5 mycroft #include <netinet/ip_icmp.h>
57 1.5 mycroft #include <netinet/tcp.h>
58 1.5 mycroft #include <netinet/tcp_fsm.h>
59 1.5 mycroft #include <netinet/tcp_seq.h>
60 1.5 mycroft #include <netinet/tcp_timer.h>
61 1.5 mycroft #include <netinet/tcp_var.h>
62 1.5 mycroft #include <netinet/tcpip.h>
63 1.1 cgd
64 1.1 cgd /* patchable/settable parameters for tcp */
65 1.1 cgd int tcp_mssdflt = TCP_MSS;
66 1.1 cgd int tcp_rttdflt = TCPTV_SRTTDFLT / PR_SLOWHZ;
67 1.10 mycroft int tcp_do_rfc1323 = 1;
68 1.1 cgd
69 1.21 mycroft #ifndef TCBHASHSIZE
70 1.21 mycroft #define TCBHASHSIZE 128
71 1.21 mycroft #endif
72 1.21 mycroft int tcbhashsize = TCBHASHSIZE;
73 1.1 cgd
74 1.1 cgd /*
75 1.1 cgd * Tcp initialization
76 1.1 cgd */
77 1.7 mycroft void
78 1.1 cgd tcp_init()
79 1.1 cgd {
80 1.1 cgd
81 1.23 mycroft tcp_iss = 1; /* XXX wrong */
82 1.24 mycroft in_pcbinit(&tcbtable, tcbhashsize, tcbhashsize);
83 1.1 cgd if (max_protohdr < sizeof(struct tcpiphdr))
84 1.1 cgd max_protohdr = sizeof(struct tcpiphdr);
85 1.1 cgd if (max_linkhdr + sizeof(struct tcpiphdr) > MHLEN)
86 1.1 cgd panic("tcp_init");
87 1.1 cgd }
88 1.1 cgd
89 1.1 cgd /*
90 1.1 cgd * Create template to be used to send tcp packets on a connection.
91 1.1 cgd * Call after host entry created, allocates an mbuf and fills
92 1.1 cgd * in a skeletal tcp/ip header, minimizing the amount of work
93 1.1 cgd * necessary when the connection is used.
94 1.1 cgd */
95 1.1 cgd struct tcpiphdr *
96 1.1 cgd tcp_template(tp)
97 1.1 cgd struct tcpcb *tp;
98 1.1 cgd {
99 1.1 cgd register struct inpcb *inp = tp->t_inpcb;
100 1.1 cgd register struct mbuf *m;
101 1.1 cgd register struct tcpiphdr *n;
102 1.1 cgd
103 1.1 cgd if ((n = tp->t_template) == 0) {
104 1.1 cgd m = m_get(M_DONTWAIT, MT_HEADER);
105 1.1 cgd if (m == NULL)
106 1.1 cgd return (0);
107 1.1 cgd m->m_len = sizeof (struct tcpiphdr);
108 1.1 cgd n = mtod(m, struct tcpiphdr *);
109 1.1 cgd }
110 1.20 cgd bzero(n->ti_x1, sizeof n->ti_x1);
111 1.1 cgd n->ti_pr = IPPROTO_TCP;
112 1.1 cgd n->ti_len = htons(sizeof (struct tcpiphdr) - sizeof (struct ip));
113 1.1 cgd n->ti_src = inp->inp_laddr;
114 1.1 cgd n->ti_dst = inp->inp_faddr;
115 1.1 cgd n->ti_sport = inp->inp_lport;
116 1.1 cgd n->ti_dport = inp->inp_fport;
117 1.1 cgd n->ti_seq = 0;
118 1.1 cgd n->ti_ack = 0;
119 1.1 cgd n->ti_x2 = 0;
120 1.1 cgd n->ti_off = 5;
121 1.1 cgd n->ti_flags = 0;
122 1.1 cgd n->ti_win = 0;
123 1.1 cgd n->ti_sum = 0;
124 1.1 cgd n->ti_urp = 0;
125 1.1 cgd return (n);
126 1.1 cgd }
127 1.1 cgd
128 1.1 cgd /*
129 1.1 cgd * Send a single message to the TCP at address specified by
130 1.1 cgd * the given TCP/IP header. If m == 0, then we make a copy
131 1.1 cgd * of the tcpiphdr at ti and send directly to the addressed host.
132 1.1 cgd * This is used to force keep alive messages out using the TCP
133 1.1 cgd * template for a connection tp->t_template. If flags are given
134 1.1 cgd * then we send a message back to the TCP which originated the
135 1.1 cgd * segment ti, and discard the mbuf containing it and any other
136 1.1 cgd * attached mbufs.
137 1.1 cgd *
138 1.1 cgd * In any case the ack and sequence number of the transmitted
139 1.1 cgd * segment are as specified by the parameters.
140 1.1 cgd */
141 1.7 mycroft void
142 1.1 cgd tcp_respond(tp, ti, m, ack, seq, flags)
143 1.1 cgd struct tcpcb *tp;
144 1.1 cgd register struct tcpiphdr *ti;
145 1.1 cgd register struct mbuf *m;
146 1.1 cgd tcp_seq ack, seq;
147 1.1 cgd int flags;
148 1.1 cgd {
149 1.1 cgd register int tlen;
150 1.1 cgd int win = 0;
151 1.1 cgd struct route *ro = 0;
152 1.1 cgd
153 1.1 cgd if (tp) {
154 1.1 cgd win = sbspace(&tp->t_inpcb->inp_socket->so_rcv);
155 1.1 cgd ro = &tp->t_inpcb->inp_route;
156 1.1 cgd }
157 1.1 cgd if (m == 0) {
158 1.1 cgd m = m_gethdr(M_DONTWAIT, MT_HEADER);
159 1.1 cgd if (m == NULL)
160 1.1 cgd return;
161 1.1 cgd #ifdef TCP_COMPAT_42
162 1.1 cgd tlen = 1;
163 1.1 cgd #else
164 1.1 cgd tlen = 0;
165 1.1 cgd #endif
166 1.1 cgd m->m_data += max_linkhdr;
167 1.1 cgd *mtod(m, struct tcpiphdr *) = *ti;
168 1.1 cgd ti = mtod(m, struct tcpiphdr *);
169 1.1 cgd flags = TH_ACK;
170 1.1 cgd } else {
171 1.1 cgd m_freem(m->m_next);
172 1.1 cgd m->m_next = 0;
173 1.1 cgd m->m_data = (caddr_t)ti;
174 1.1 cgd m->m_len = sizeof (struct tcpiphdr);
175 1.1 cgd tlen = 0;
176 1.10 mycroft #define xchg(a,b,type) { type t; t=a; a=b; b=t; }
177 1.13 cgd xchg(ti->ti_dst.s_addr, ti->ti_src.s_addr, u_int32_t);
178 1.13 cgd xchg(ti->ti_dport, ti->ti_sport, u_int16_t);
179 1.1 cgd #undef xchg
180 1.1 cgd }
181 1.20 cgd ti->ti_len = htons((u_int16_t)(sizeof (struct tcphdr) + tlen));
182 1.1 cgd tlen += sizeof (struct tcpiphdr);
183 1.1 cgd m->m_len = tlen;
184 1.1 cgd m->m_pkthdr.len = tlen;
185 1.1 cgd m->m_pkthdr.rcvif = (struct ifnet *) 0;
186 1.20 cgd bzero(ti->ti_x1, sizeof ti->ti_x1);
187 1.1 cgd ti->ti_seq = htonl(seq);
188 1.1 cgd ti->ti_ack = htonl(ack);
189 1.1 cgd ti->ti_x2 = 0;
190 1.1 cgd ti->ti_off = sizeof (struct tcphdr) >> 2;
191 1.1 cgd ti->ti_flags = flags;
192 1.10 mycroft if (tp)
193 1.13 cgd ti->ti_win = htons((u_int16_t) (win >> tp->rcv_scale));
194 1.10 mycroft else
195 1.13 cgd ti->ti_win = htons((u_int16_t)win);
196 1.1 cgd ti->ti_urp = 0;
197 1.10 mycroft ti->ti_sum = 0;
198 1.1 cgd ti->ti_sum = in_cksum(m, tlen);
199 1.1 cgd ((struct ip *)ti)->ip_len = tlen;
200 1.10 mycroft ((struct ip *)ti)->ip_ttl = ip_defttl;
201 1.8 mycroft (void) ip_output(m, NULL, ro, 0, NULL);
202 1.1 cgd }
203 1.1 cgd
204 1.1 cgd /*
205 1.1 cgd * Create a new TCP control block, making an
206 1.1 cgd * empty reassembly queue and hooking it to the argument
207 1.1 cgd * protocol control block.
208 1.1 cgd */
209 1.1 cgd struct tcpcb *
210 1.1 cgd tcp_newtcpcb(inp)
211 1.1 cgd struct inpcb *inp;
212 1.1 cgd {
213 1.1 cgd register struct tcpcb *tp;
214 1.1 cgd
215 1.10 mycroft tp = malloc(sizeof(*tp), M_PCB, M_NOWAIT);
216 1.10 mycroft if (tp == NULL)
217 1.1 cgd return ((struct tcpcb *)0);
218 1.23 mycroft bzero((caddr_t)tp, sizeof(struct tcpcb));
219 1.20 cgd LIST_INIT(&tp->segq);
220 1.1 cgd tp->t_maxseg = tcp_mssdflt;
221 1.1 cgd
222 1.10 mycroft tp->t_flags = tcp_do_rfc1323 ? (TF_REQ_SCALE|TF_REQ_TSTMP) : 0;
223 1.1 cgd tp->t_inpcb = inp;
224 1.1 cgd /*
225 1.1 cgd * Init srtt to TCPTV_SRTTBASE (0), so we can tell that we have no
226 1.1 cgd * rtt estimate. Set rttvar so that srtt + 2 * rttvar gives
227 1.1 cgd * reasonable initial retransmit time.
228 1.1 cgd */
229 1.1 cgd tp->t_srtt = TCPTV_SRTTBASE;
230 1.15 mycroft tp->t_rttvar = tcp_rttdflt * PR_SLOWHZ << (TCP_RTTVAR_SHIFT + 2 - 1);
231 1.1 cgd tp->t_rttmin = TCPTV_MIN;
232 1.15 mycroft TCPT_RANGESET(tp->t_rxtcur, TCP_REXMTVAL(tp),
233 1.1 cgd TCPTV_MIN, TCPTV_REXMTMAX);
234 1.10 mycroft tp->snd_cwnd = TCP_MAXWIN << TCP_MAX_WINSHIFT;
235 1.10 mycroft tp->snd_ssthresh = TCP_MAXWIN << TCP_MAX_WINSHIFT;
236 1.10 mycroft inp->inp_ip.ip_ttl = ip_defttl;
237 1.1 cgd inp->inp_ppcb = (caddr_t)tp;
238 1.1 cgd return (tp);
239 1.1 cgd }
240 1.1 cgd
241 1.1 cgd /*
242 1.1 cgd * Drop a TCP connection, reporting
243 1.1 cgd * the specified error. If connection is synchronized,
244 1.1 cgd * then send a RST to peer.
245 1.1 cgd */
246 1.1 cgd struct tcpcb *
247 1.1 cgd tcp_drop(tp, errno)
248 1.1 cgd register struct tcpcb *tp;
249 1.1 cgd int errno;
250 1.1 cgd {
251 1.1 cgd struct socket *so = tp->t_inpcb->inp_socket;
252 1.1 cgd
253 1.1 cgd if (TCPS_HAVERCVDSYN(tp->t_state)) {
254 1.1 cgd tp->t_state = TCPS_CLOSED;
255 1.1 cgd (void) tcp_output(tp);
256 1.1 cgd tcpstat.tcps_drops++;
257 1.1 cgd } else
258 1.1 cgd tcpstat.tcps_conndrops++;
259 1.1 cgd if (errno == ETIMEDOUT && tp->t_softerror)
260 1.1 cgd errno = tp->t_softerror;
261 1.1 cgd so->so_error = errno;
262 1.1 cgd return (tcp_close(tp));
263 1.1 cgd }
264 1.1 cgd
265 1.1 cgd /*
266 1.1 cgd * Close a TCP control block:
267 1.1 cgd * discard all space held by the tcp
268 1.1 cgd * discard internet protocol block
269 1.1 cgd * wake up any sleepers
270 1.1 cgd */
271 1.1 cgd struct tcpcb *
272 1.1 cgd tcp_close(tp)
273 1.1 cgd register struct tcpcb *tp;
274 1.1 cgd {
275 1.20 cgd register struct ipqent *qe;
276 1.1 cgd struct inpcb *inp = tp->t_inpcb;
277 1.1 cgd struct socket *so = inp->inp_socket;
278 1.1 cgd #ifdef RTV_RTT
279 1.1 cgd register struct rtentry *rt;
280 1.1 cgd
281 1.1 cgd /*
282 1.1 cgd * If we sent enough data to get some meaningful characteristics,
283 1.10 mycroft * save them in the routing entry. 'Enough' is arbitrarily
284 1.1 cgd * defined as the sendpipesize (default 4K) * 16. This would
285 1.1 cgd * give us 16 rtt samples assuming we only get one sample per
286 1.1 cgd * window (the usual case on a long haul net). 16 samples is
287 1.1 cgd * enough for the srtt filter to converge to within 5% of the correct
288 1.1 cgd * value; fewer samples and we could save a very bogus rtt.
289 1.1 cgd *
290 1.1 cgd * Don't update the default route's characteristics and don't
291 1.1 cgd * update anything that the user "locked".
292 1.1 cgd */
293 1.1 cgd if (SEQ_LT(tp->iss + so->so_snd.sb_hiwat * 16, tp->snd_max) &&
294 1.1 cgd (rt = inp->inp_route.ro_rt) &&
295 1.23 mycroft !in_nullhost(satosin(rt_key(rt))->sin_addr)) {
296 1.22 christos register u_long i = 0;
297 1.1 cgd
298 1.1 cgd if ((rt->rt_rmx.rmx_locks & RTV_RTT) == 0) {
299 1.1 cgd i = tp->t_srtt *
300 1.25 mycroft ((RTM_RTTUNIT / PR_SLOWHZ) >> (TCP_RTT_SHIFT + 2));
301 1.1 cgd if (rt->rt_rmx.rmx_rtt && i)
302 1.1 cgd /*
303 1.1 cgd * filter this update to half the old & half
304 1.1 cgd * the new values, converting scale.
305 1.1 cgd * See route.h and tcp_var.h for a
306 1.1 cgd * description of the scaling constants.
307 1.1 cgd */
308 1.1 cgd rt->rt_rmx.rmx_rtt =
309 1.1 cgd (rt->rt_rmx.rmx_rtt + i) / 2;
310 1.1 cgd else
311 1.1 cgd rt->rt_rmx.rmx_rtt = i;
312 1.1 cgd }
313 1.1 cgd if ((rt->rt_rmx.rmx_locks & RTV_RTTVAR) == 0) {
314 1.1 cgd i = tp->t_rttvar *
315 1.25 mycroft ((RTM_RTTUNIT / PR_SLOWHZ) >> (TCP_RTTVAR_SHIFT + 2));
316 1.1 cgd if (rt->rt_rmx.rmx_rttvar && i)
317 1.1 cgd rt->rt_rmx.rmx_rttvar =
318 1.1 cgd (rt->rt_rmx.rmx_rttvar + i) / 2;
319 1.1 cgd else
320 1.1 cgd rt->rt_rmx.rmx_rttvar = i;
321 1.1 cgd }
322 1.1 cgd /*
323 1.1 cgd * update the pipelimit (ssthresh) if it has been updated
324 1.1 cgd * already or if a pipesize was specified & the threshhold
325 1.1 cgd * got below half the pipesize. I.e., wait for bad news
326 1.1 cgd * before we start updating, then update on both good
327 1.1 cgd * and bad news.
328 1.1 cgd */
329 1.22 christos if (((rt->rt_rmx.rmx_locks & RTV_SSTHRESH) == 0 &&
330 1.22 christos (i = tp->snd_ssthresh) && rt->rt_rmx.rmx_ssthresh) ||
331 1.1 cgd i < (rt->rt_rmx.rmx_sendpipe / 2)) {
332 1.1 cgd /*
333 1.1 cgd * convert the limit from user data bytes to
334 1.1 cgd * packets then to packet data bytes.
335 1.1 cgd */
336 1.1 cgd i = (i + tp->t_maxseg / 2) / tp->t_maxseg;
337 1.1 cgd if (i < 2)
338 1.1 cgd i = 2;
339 1.1 cgd i *= (u_long)(tp->t_maxseg + sizeof (struct tcpiphdr));
340 1.1 cgd if (rt->rt_rmx.rmx_ssthresh)
341 1.1 cgd rt->rt_rmx.rmx_ssthresh =
342 1.1 cgd (rt->rt_rmx.rmx_ssthresh + i) / 2;
343 1.1 cgd else
344 1.1 cgd rt->rt_rmx.rmx_ssthresh = i;
345 1.1 cgd }
346 1.1 cgd }
347 1.9 mycroft #endif /* RTV_RTT */
348 1.1 cgd /* free the reassembly queue, if any */
349 1.20 cgd while ((qe = tp->segq.lh_first) != NULL) {
350 1.20 cgd LIST_REMOVE(qe, ipqe_q);
351 1.20 cgd m_freem(qe->ipqe_m);
352 1.20 cgd FREE(qe, M_IPQ);
353 1.1 cgd }
354 1.1 cgd if (tp->t_template)
355 1.1 cgd (void) m_free(dtom(tp->t_template));
356 1.10 mycroft free(tp, M_PCB);
357 1.1 cgd inp->inp_ppcb = 0;
358 1.1 cgd soisdisconnected(so);
359 1.1 cgd in_pcbdetach(inp);
360 1.1 cgd tcpstat.tcps_closed++;
361 1.1 cgd return ((struct tcpcb *)0);
362 1.1 cgd }
363 1.1 cgd
364 1.7 mycroft void
365 1.1 cgd tcp_drain()
366 1.1 cgd {
367 1.1 cgd
368 1.1 cgd }
369 1.1 cgd
370 1.1 cgd /*
371 1.1 cgd * Notify a tcp user of an asynchronous error;
372 1.1 cgd * store error as soft error, but wake up user
373 1.1 cgd * (for now, won't do anything until can select for soft error).
374 1.1 cgd */
375 1.7 mycroft void
376 1.1 cgd tcp_notify(inp, error)
377 1.10 mycroft struct inpcb *inp;
378 1.1 cgd int error;
379 1.1 cgd {
380 1.10 mycroft register struct tcpcb *tp = (struct tcpcb *)inp->inp_ppcb;
381 1.10 mycroft register struct socket *so = inp->inp_socket;
382 1.1 cgd
383 1.10 mycroft /*
384 1.10 mycroft * Ignore some errors if we are hooked up.
385 1.10 mycroft * If connection hasn't completed, has retransmitted several times,
386 1.10 mycroft * and receives a second error, give up now. This is better
387 1.10 mycroft * than waiting a long time to establish a connection that
388 1.10 mycroft * can never complete.
389 1.10 mycroft */
390 1.10 mycroft if (tp->t_state == TCPS_ESTABLISHED &&
391 1.10 mycroft (error == EHOSTUNREACH || error == ENETUNREACH ||
392 1.10 mycroft error == EHOSTDOWN)) {
393 1.10 mycroft return;
394 1.12 mycroft } else if (TCPS_HAVEESTABLISHED(tp->t_state) == 0 &&
395 1.12 mycroft tp->t_rxtshift > 3 && tp->t_softerror)
396 1.10 mycroft so->so_error = error;
397 1.10 mycroft else
398 1.10 mycroft tp->t_softerror = error;
399 1.10 mycroft wakeup((caddr_t) &so->so_timeo);
400 1.10 mycroft sorwakeup(so);
401 1.10 mycroft sowwakeup(so);
402 1.1 cgd }
403 1.1 cgd
404 1.22 christos void *
405 1.22 christos tcp_ctlinput(cmd, sa, v)
406 1.1 cgd int cmd;
407 1.1 cgd struct sockaddr *sa;
408 1.22 christos register void *v;
409 1.1 cgd {
410 1.22 christos register struct ip *ip = v;
411 1.1 cgd register struct tcphdr *th;
412 1.19 mycroft extern int inetctlerrmap[];
413 1.7 mycroft void (*notify) __P((struct inpcb *, int)) = tcp_notify;
414 1.19 mycroft int errno;
415 1.1 cgd
416 1.18 mycroft if ((unsigned)cmd >= PRC_NCMDS)
417 1.22 christos return NULL;
418 1.18 mycroft errno = inetctlerrmap[cmd];
419 1.17 mycroft if (cmd == PRC_QUENCH)
420 1.17 mycroft notify = tcp_quench;
421 1.17 mycroft else if (PRC_IS_REDIRECT(cmd))
422 1.17 mycroft notify = in_rtchange, ip = 0;
423 1.16 mycroft else if (cmd == PRC_HOSTDEAD)
424 1.17 mycroft ip = 0;
425 1.18 mycroft else if (errno == 0)
426 1.22 christos return NULL;
427 1.17 mycroft if (ip) {
428 1.1 cgd th = (struct tcphdr *)((caddr_t)ip + (ip->ip_hl << 2));
429 1.23 mycroft in_pcbnotify(&tcbtable, satosin(sa)->sin_addr, th->th_dport,
430 1.23 mycroft ip->ip_src, th->th_sport, errno, notify);
431 1.17 mycroft } else
432 1.23 mycroft in_pcbnotifyall(&tcbtable, satosin(sa)->sin_addr, errno,
433 1.23 mycroft notify);
434 1.22 christos return NULL;
435 1.1 cgd }
436 1.1 cgd
437 1.1 cgd /*
438 1.1 cgd * When a source quench is received, close congestion window
439 1.1 cgd * to one segment. We will gradually open it again as we proceed.
440 1.1 cgd */
441 1.7 mycroft void
442 1.7 mycroft tcp_quench(inp, errno)
443 1.1 cgd struct inpcb *inp;
444 1.7 mycroft int errno;
445 1.1 cgd {
446 1.1 cgd struct tcpcb *tp = intotcpcb(inp);
447 1.1 cgd
448 1.1 cgd if (tp)
449 1.1 cgd tp->snd_cwnd = tp->t_maxseg;
450 1.1 cgd }
451