![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to spp_usrreq.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [Net/2] / Net2 / netns|
Return to spp_usrreq.c CVS log | Up to [Net/2] / Net2 / netns |
1.1 root 1: /*
2: * Copyright (c) 1984, 1985, 1986, 1987 Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms, with or without
6: * modification, are permitted provided that the following conditions
7: * are met:
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.
20: *
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
31: * SUCH DAMAGE.
32: *
1.1.1.2 ! root 33: * from: @(#)spp_usrreq.c 7.15 (Berkeley) 6/27/91
! 34: * spp_usrreq.c,v 1.2 1993/05/20 04:36:09 cgd Exp
1.1 root 35: */
36:
37: #include "param.h"
38: #include "systm.h"
39: #include "malloc.h"
40: #include "mbuf.h"
41: #include "protosw.h"
42: #include "socket.h"
43: #include "socketvar.h"
44: #include "errno.h"
45:
46: #include "../net/if.h"
47: #include "../net/route.h"
48: #include "../netinet/tcp_fsm.h"
49:
50: #include "ns.h"
51: #include "ns_pcb.h"
52: #include "idp.h"
53: #include "idp_var.h"
54: #include "ns_error.h"
55: #include "sp.h"
56: #include "spidp.h"
57: #include "spp_timer.h"
58: #include "spp_var.h"
59: #include "spp_debug.h"
60:
61: /*
62: * SP protocol implementation.
63: */
64: spp_init()
65: {
66:
67: spp_iss = 1; /* WRONG !! should fish it out of TODR */
68: }
69: struct spidp spp_savesi;
70: int traceallspps = 0;
71: extern int sppconsdebug;
72: int spp_hardnosed;
73: int spp_use_delack = 0;
74: u_short spp_newchecks[50];
75:
76: /*ARGSUSED*/
77: spp_input(m, nsp)
78: register struct mbuf *m;
79: register struct nspcb *nsp;
80: {
81: register struct sppcb *cb;
82: register struct spidp *si = mtod(m, struct spidp *);
83: register struct socket *so;
84: short ostate;
85: int dropsocket = 0;
86:
87:
88: sppstat.spps_rcvtotal++;
89: if (nsp == 0) {
90: panic("No nspcb in spp_input\n");
91: return;
92: }
93:
94: cb = nstosppcb(nsp);
95: if (cb == 0) goto bad;
96:
97: if (m->m_len < sizeof(*si)) {
98: if ((m = m_pullup(m, sizeof(*si))) == 0) {
99: sppstat.spps_rcvshort++;
100: return;
101: }
102: si = mtod(m, struct spidp *);
103: }
104: si->si_seq = ntohs(si->si_seq);
105: si->si_ack = ntohs(si->si_ack);
106: si->si_alo = ntohs(si->si_alo);
107:
108: so = nsp->nsp_socket;
109: if (so->so_options & SO_DEBUG || traceallspps) {
110: ostate = cb->s_state;
111: spp_savesi = *si;
112: }
113: if (so->so_options & SO_ACCEPTCONN) {
114: struct sppcb *ocb = cb;
115:
116: so = sonewconn(so, 0);
117: if (so == 0) {
118: goto drop;
119: }
120: /*
121: * This is ugly, but ....
122: *
123: * Mark socket as temporary until we're
124: * committed to keeping it. The code at
125: * ``drop'' and ``dropwithreset'' check the
126: * flag dropsocket to see if the temporary
127: * socket created here should be discarded.
128: * We mark the socket as discardable until
129: * we're committed to it below in TCPS_LISTEN.
130: */
131: dropsocket++;
132: nsp = (struct nspcb *)so->so_pcb;
133: nsp->nsp_laddr = si->si_dna;
134: cb = nstosppcb(nsp);
135: cb->s_mtu = ocb->s_mtu; /* preserve sockopts */
136: cb->s_flags = ocb->s_flags; /* preserve sockopts */
137: cb->s_flags2 = ocb->s_flags2; /* preserve sockopts */
138: cb->s_state = TCPS_LISTEN;
139: }
140:
141: /*
142: * Packet received on connection.
143: * reset idle time and keep-alive timer;
144: */
145: cb->s_idle = 0;
146: cb->s_timer[SPPT_KEEP] = SPPTV_KEEP;
147:
148: switch (cb->s_state) {
149:
150: case TCPS_LISTEN:{
151: struct mbuf *am;
152: register struct sockaddr_ns *sns;
153: struct ns_addr laddr;
154:
155: /*
156: * If somebody here was carying on a conversation
157: * and went away, and his pen pal thinks he can
158: * still talk, we get the misdirected packet.
159: */
160: if (spp_hardnosed && (si->si_did != 0 || si->si_seq != 0)) {
161: spp_istat.gonawy++;
162: goto dropwithreset;
163: }
164: am = m_get(M_DONTWAIT, MT_SONAME);
165: if (am == NULL)
166: goto drop;
167: am->m_len = sizeof (struct sockaddr_ns);
168: sns = mtod(am, struct sockaddr_ns *);
169: sns->sns_len = sizeof(*sns);
170: sns->sns_family = AF_NS;
171: sns->sns_addr = si->si_sna;
172: laddr = nsp->nsp_laddr;
173: if (ns_nullhost(laddr))
174: nsp->nsp_laddr = si->si_dna;
175: if (ns_pcbconnect(nsp, am)) {
176: nsp->nsp_laddr = laddr;
177: (void) m_free(am);
178: spp_istat.noconn++;
179: goto drop;
180: }
181: (void) m_free(am);
182: spp_template(cb);
183: dropsocket = 0; /* committed to socket */
184: cb->s_did = si->si_sid;
185: cb->s_rack = si->si_ack;
186: cb->s_ralo = si->si_alo;
187: #define THREEWAYSHAKE
188: #ifdef THREEWAYSHAKE
189: cb->s_state = TCPS_SYN_RECEIVED;
190: cb->s_force = 1 + SPPT_KEEP;
191: sppstat.spps_accepts++;
192: cb->s_timer[SPPT_KEEP] = SPPTV_KEEP;
193: }
194: break;
195: /*
196: * This state means that we have heard a response
197: * to our acceptance of their connection
198: * It is probably logically unnecessary in this
199: * implementation.
200: */
201: case TCPS_SYN_RECEIVED: {
202: if (si->si_did!=cb->s_sid) {
203: spp_istat.wrncon++;
204: goto drop;
205: }
206: #endif
207: nsp->nsp_fport = si->si_sport;
208: cb->s_timer[SPPT_REXMT] = 0;
209: cb->s_timer[SPPT_KEEP] = SPPTV_KEEP;
210: soisconnected(so);
211: cb->s_state = TCPS_ESTABLISHED;
212: sppstat.spps_accepts++;
213: }
214: break;
215:
216: /*
217: * This state means that we have gotten a response
218: * to our attempt to establish a connection.
219: * We fill in the data from the other side,
220: * telling us which port to respond to, instead of the well-
221: * known one we might have sent to in the first place.
222: * We also require that this is a response to our
223: * connection id.
224: */
225: case TCPS_SYN_SENT:
226: if (si->si_did!=cb->s_sid) {
227: spp_istat.notme++;
228: goto drop;
229: }
230: sppstat.spps_connects++;
231: cb->s_did = si->si_sid;
232: cb->s_rack = si->si_ack;
233: cb->s_ralo = si->si_alo;
234: cb->s_dport = nsp->nsp_fport = si->si_sport;
235: cb->s_timer[SPPT_REXMT] = 0;
236: cb->s_flags |= SF_ACKNOW;
237: soisconnected(so);
238: cb->s_state = TCPS_ESTABLISHED;
239: /* Use roundtrip time of connection request for initial rtt */
240: if (cb->s_rtt) {
241: cb->s_srtt = cb->s_rtt << 3;
242: cb->s_rttvar = cb->s_rtt << 1;
243: SPPT_RANGESET(cb->s_rxtcur,
244: ((cb->s_srtt >> 2) + cb->s_rttvar) >> 1,
245: SPPTV_MIN, SPPTV_REXMTMAX);
246: cb->s_rtt = 0;
247: }
248: }
249: if (so->so_options & SO_DEBUG || traceallspps)
250: spp_trace(SA_INPUT, (u_char)ostate, cb, &spp_savesi, 0);
251:
252: m->m_len -= sizeof (struct idp);
253: m->m_pkthdr.len -= sizeof (struct idp);
254: m->m_data += sizeof (struct idp);
255:
256: if (spp_reass(cb, si)) {
257: (void) m_freem(m);
258: }
259: if (cb->s_force || (cb->s_flags & (SF_ACKNOW|SF_WIN|SF_RXT)))
260: (void) spp_output(cb, (struct mbuf *)0);
261: cb->s_flags &= ~(SF_WIN|SF_RXT);
262: return;
263:
264: dropwithreset:
265: if (dropsocket)
266: (void) soabort(so);
267: si->si_seq = ntohs(si->si_seq);
268: si->si_ack = ntohs(si->si_ack);
269: si->si_alo = ntohs(si->si_alo);
270: ns_error(dtom(si), NS_ERR_NOSOCK, 0);
271: if (cb->s_nspcb->nsp_socket->so_options & SO_DEBUG || traceallspps)
272: spp_trace(SA_DROP, (u_char)ostate, cb, &spp_savesi, 0);
273: return;
274:
275: drop:
276: bad:
277: if (cb == 0 || cb->s_nspcb->nsp_socket->so_options & SO_DEBUG ||
278: traceallspps)
279: spp_trace(SA_DROP, (u_char)ostate, cb, &spp_savesi, 0);
280: m_freem(m);
281: }
282:
283: int spprexmtthresh = 3;
284:
285: /*
286: * This is structurally similar to the tcp reassembly routine
287: * but its function is somewhat different: It merely queues
288: * packets up, and suppresses duplicates.
289: */
290: spp_reass(cb, si)
291: register struct sppcb *cb;
292: register struct spidp *si;
293: {
294: register struct spidp_q *q;
295: register struct mbuf *m;
296: register struct socket *so = cb->s_nspcb->nsp_socket;
297: char packetp = cb->s_flags & SF_HI;
298: int incr;
299: char wakeup = 0;
300:
301: if (si == SI(0))
302: goto present;
303: /*
304: * Update our news from them.
305: */
306: if (si->si_cc & SP_SA)
307: cb->s_flags |= (spp_use_delack ? SF_DELACK : SF_ACKNOW);
308: if (SSEQ_GT(si->si_alo, cb->s_ralo))
309: cb->s_flags |= SF_WIN;
310: if (SSEQ_LEQ(si->si_ack, cb->s_rack)) {
311: if ((si->si_cc & SP_SP) && cb->s_rack != (cb->s_smax + 1)) {
312: sppstat.spps_rcvdupack++;
313: /*
314: * If this is a completely duplicate ack
315: * and other conditions hold, we assume
316: * a packet has been dropped and retransmit
317: * it exactly as in tcp_input().
318: */
319: if (si->si_ack != cb->s_rack ||
320: si->si_alo != cb->s_ralo)
321: cb->s_dupacks = 0;
322: else if (++cb->s_dupacks == spprexmtthresh) {
323: u_short onxt = cb->s_snxt;
324: int cwnd = cb->s_cwnd;
325:
326: cb->s_snxt = si->si_ack;
327: cb->s_cwnd = CUNIT;
328: cb->s_force = 1 + SPPT_REXMT;
329: (void) spp_output(cb, (struct mbuf *)0);
330: cb->s_timer[SPPT_REXMT] = cb->s_rxtcur;
331: cb->s_rtt = 0;
332: if (cwnd >= 4 * CUNIT)
333: cb->s_cwnd = cwnd / 2;
334: if (SSEQ_GT(onxt, cb->s_snxt))
335: cb->s_snxt = onxt;
336: return (1);
337: }
338: } else
339: cb->s_dupacks = 0;
340: goto update_window;
341: }
342: cb->s_dupacks = 0;
343: /*
344: * If our correspondent acknowledges data we haven't sent
345: * TCP would drop the packet after acking. We'll be a little
346: * more permissive
347: */
348: if (SSEQ_GT(si->si_ack, (cb->s_smax + 1))) {
349: sppstat.spps_rcvacktoomuch++;
350: si->si_ack = cb->s_smax + 1;
351: }
352: sppstat.spps_rcvackpack++;
353: /*
354: * If transmit timer is running and timed sequence
355: * number was acked, update smoothed round trip time.
356: * See discussion of algorithm in tcp_input.c
357: */
358: if (cb->s_rtt && SSEQ_GT(si->si_ack, cb->s_rtseq)) {
359: sppstat.spps_rttupdated++;
360: if (cb->s_srtt != 0) {
361: register short delta;
362: delta = cb->s_rtt - (cb->s_srtt >> 3);
363: if ((cb->s_srtt += delta) <= 0)
364: cb->s_srtt = 1;
365: if (delta < 0)
366: delta = -delta;
367: delta -= (cb->s_rttvar >> 2);
368: if ((cb->s_rttvar += delta) <= 0)
369: cb->s_rttvar = 1;
370: } else {
371: /*
372: * No rtt measurement yet
373: */
374: cb->s_srtt = cb->s_rtt << 3;
375: cb->s_rttvar = cb->s_rtt << 1;
376: }
377: cb->s_rtt = 0;
378: cb->s_rxtshift = 0;
379: SPPT_RANGESET(cb->s_rxtcur,
380: ((cb->s_srtt >> 2) + cb->s_rttvar) >> 1,
381: SPPTV_MIN, SPPTV_REXMTMAX);
382: }
383: /*
384: * If all outstanding data is acked, stop retransmit
385: * timer and remember to restart (more output or persist).
386: * If there is more data to be acked, restart retransmit
387: * timer, using current (possibly backed-off) value;
388: */
389: if (si->si_ack == cb->s_smax + 1) {
390: cb->s_timer[SPPT_REXMT] = 0;
391: cb->s_flags |= SF_RXT;
392: } else if (cb->s_timer[SPPT_PERSIST] == 0)
393: cb->s_timer[SPPT_REXMT] = cb->s_rxtcur;
394: /*
395: * When new data is acked, open the congestion window.
396: * If the window gives us less than ssthresh packets
397: * in flight, open exponentially (maxseg at a time).
398: * Otherwise open linearly (maxseg^2 / cwnd at a time).
399: */
400: incr = CUNIT;
401: if (cb->s_cwnd > cb->s_ssthresh)
402: incr = max(incr * incr / cb->s_cwnd, 1);
403: cb->s_cwnd = min(cb->s_cwnd + incr, cb->s_cwmx);
404: /*
405: * Trim Acked data from output queue.
406: */
407: while ((m = so->so_snd.sb_mb) != NULL) {
408: if (SSEQ_LT((mtod(m, struct spidp *))->si_seq, si->si_ack))
409: sbdroprecord(&so->so_snd);
410: else
411: break;
412: }
413: sowwakeup(so);
414: cb->s_rack = si->si_ack;
415: update_window:
416: if (SSEQ_LT(cb->s_snxt, cb->s_rack))
417: cb->s_snxt = cb->s_rack;
418: if (SSEQ_LT(cb->s_swl1, si->si_seq) || cb->s_swl1 == si->si_seq &&
419: (SSEQ_LT(cb->s_swl2, si->si_ack) ||
420: cb->s_swl2 == si->si_ack && SSEQ_LT(cb->s_ralo, si->si_alo))) {
421: /* keep track of pure window updates */
422: if ((si->si_cc & SP_SP) && cb->s_swl2 == si->si_ack
423: && SSEQ_LT(cb->s_ralo, si->si_alo)) {
424: sppstat.spps_rcvwinupd++;
425: sppstat.spps_rcvdupack--;
426: }
427: cb->s_ralo = si->si_alo;
428: cb->s_swl1 = si->si_seq;
429: cb->s_swl2 = si->si_ack;
430: cb->s_swnd = (1 + si->si_alo - si->si_ack);
431: if (cb->s_swnd > cb->s_smxw)
432: cb->s_smxw = cb->s_swnd;
433: cb->s_flags |= SF_WIN;
434: }
435: /*
436: * If this packet number is higher than that which
437: * we have allocated refuse it, unless urgent
438: */
439: if (SSEQ_GT(si->si_seq, cb->s_alo)) {
440: if (si->si_cc & SP_SP) {
441: sppstat.spps_rcvwinprobe++;
442: return (1);
443: } else
444: sppstat.spps_rcvpackafterwin++;
445: if (si->si_cc & SP_OB) {
446: if (SSEQ_GT(si->si_seq, cb->s_alo + 60)) {
447: ns_error(dtom(si), NS_ERR_FULLUP, 0);
448: return (0);
449: } /* else queue this packet; */
450: } else {
451: /*register struct socket *so = cb->s_nspcb->nsp_socket;
452: if (so->so_state && SS_NOFDREF) {
453: ns_error(dtom(si), NS_ERR_NOSOCK, 0);
454: (void)spp_close(cb);
455: } else
456: would crash system*/
457: spp_istat.notyet++;
458: ns_error(dtom(si), NS_ERR_FULLUP, 0);
459: return (0);
460: }
461: }
462: /*
463: * If this is a system packet, we don't need to
464: * queue it up, and won't update acknowledge #
465: */
466: if (si->si_cc & SP_SP) {
467: return (1);
468: }
469: /*
470: * We have already seen this packet, so drop.
471: */
472: if (SSEQ_LT(si->si_seq, cb->s_ack)) {
473: spp_istat.bdreas++;
474: sppstat.spps_rcvduppack++;
475: if (si->si_seq == cb->s_ack - 1)
476: spp_istat.lstdup++;
477: return (1);
478: }
479: /*
480: * Loop through all packets queued up to insert in
481: * appropriate sequence.
482: */
483: for (q = cb->s_q.si_next; q!=&cb->s_q; q = q->si_next) {
484: if (si->si_seq == SI(q)->si_seq) {
485: sppstat.spps_rcvduppack++;
486: return (1);
487: }
488: if (SSEQ_LT(si->si_seq, SI(q)->si_seq)) {
489: sppstat.spps_rcvoopack++;
490: break;
491: }
492: }
493: insque(si, q->si_prev);
494: /*
495: * If this packet is urgent, inform process
496: */
497: if (si->si_cc & SP_OB) {
498: cb->s_iobc = ((char *)si)[1 + sizeof(*si)];
499: sohasoutofband(so);
500: cb->s_oobflags |= SF_IOOB;
501: }
502: present:
503: #define SPINC sizeof(struct sphdr)
504: /*
505: * Loop through all packets queued up to update acknowledge
506: * number, and present all acknowledged data to user;
507: * If in packet interface mode, show packet headers.
508: */
509: for (q = cb->s_q.si_next; q!=&cb->s_q; q = q->si_next) {
510: if (SI(q)->si_seq == cb->s_ack) {
511: cb->s_ack++;
512: m = dtom(q);
513: if (SI(q)->si_cc & SP_OB) {
514: cb->s_oobflags &= ~SF_IOOB;
515: if (so->so_rcv.sb_cc)
516: so->so_oobmark = so->so_rcv.sb_cc;
517: else
518: so->so_state |= SS_RCVATMARK;
519: }
520: q = q->si_prev;
521: remque(q->si_next);
522: wakeup = 1;
523: sppstat.spps_rcvpack++;
524: #ifdef SF_NEWCALL
525: if (cb->s_flags2 & SF_NEWCALL) {
526: struct sphdr *sp = mtod(m, struct sphdr *);
527: u_char dt = sp->sp_dt;
528: spp_newchecks[4]++;
529: if (dt != cb->s_rhdr.sp_dt) {
530: struct mbuf *mm =
531: m_getclr(M_DONTWAIT, MT_CONTROL);
532: spp_newchecks[0]++;
533: if (mm != NULL) {
534: u_short *s =
535: mtod(mm, u_short *);
536: cb->s_rhdr.sp_dt = dt;
537: mm->m_len = 5; /*XXX*/
538: s[0] = 5;
539: s[1] = 1;
540: *(u_char *)(&s[2]) = dt;
541: sbappend(&so->so_rcv, mm);
542: }
543: }
544: if (sp->sp_cc & SP_OB) {
545: MCHTYPE(m, MT_OOBDATA);
546: spp_newchecks[1]++;
547: so->so_oobmark = 0;
548: so->so_state &= ~SS_RCVATMARK;
549: }
550: if (packetp == 0) {
551: m->m_data += SPINC;
552: m->m_len -= SPINC;
553: m->m_pkthdr.len -= SPINC;
554: }
555: if ((sp->sp_cc & SP_EM) || packetp) {
556: sbappendrecord(&so->so_rcv, m);
557: spp_newchecks[9]++;
558: } else
559: sbappend(&so->so_rcv, m);
560: } else
561: #endif
562: if (packetp) {
563: sbappendrecord(&so->so_rcv, m);
564: } else {
565: cb->s_rhdr = *mtod(m, struct sphdr *);
566: m->m_data += SPINC;
567: m->m_len -= SPINC;
568: m->m_pkthdr.len -= SPINC;
569: sbappend(&so->so_rcv, m);
570: }
571: } else
572: break;
573: }
574: if (wakeup) sorwakeup(so);
575: return (0);
576: }
577:
578: spp_ctlinput(cmd, arg)
579: int cmd;
580: caddr_t arg;
581: {
582: struct ns_addr *na;
583: extern u_char nsctlerrmap[];
584: extern spp_abort(), spp_quench();
585: extern struct nspcb *idp_drop();
586: struct ns_errp *errp;
587: struct nspcb *nsp;
588: struct sockaddr_ns *sns;
589: int type;
590:
591: if (cmd < 0 || cmd > PRC_NCMDS)
592: return;
593: type = NS_ERR_UNREACH_HOST;
594:
595: switch (cmd) {
596:
597: case PRC_ROUTEDEAD:
598: return;
599:
600: case PRC_IFDOWN:
601: case PRC_HOSTDEAD:
602: case PRC_HOSTUNREACH:
603: sns = (struct sockaddr_ns *)arg;
604: if (sns->sns_family != AF_NS)
605: return;
606: na = &sns->sns_addr;
607: break;
608:
609: default:
610: errp = (struct ns_errp *)arg;
611: na = &errp->ns_err_idp.idp_dna;
612: type = errp->ns_err_num;
613: type = ntohs((u_short)type);
614: }
615: switch (type) {
616:
617: case NS_ERR_UNREACH_HOST:
618: ns_pcbnotify(na, (int)nsctlerrmap[cmd], spp_abort, (long) 0);
619: break;
620:
621: case NS_ERR_TOO_BIG:
622: case NS_ERR_NOSOCK:
623: nsp = ns_pcblookup(na, errp->ns_err_idp.idp_sna.x_port,
624: NS_WILDCARD);
625: if (nsp) {
626: if(nsp->nsp_pcb)
627: (void) spp_drop((struct sppcb *)nsp->nsp_pcb,
628: (int)nsctlerrmap[cmd]);
629: else
630: (void) idp_drop(nsp, (int)nsctlerrmap[cmd]);
631: }
632: break;
633:
634: case NS_ERR_FULLUP:
635: ns_pcbnotify(na, 0, spp_quench, (long) 0);
636: }
637: }
638: /*
639: * When a source quench is received, close congestion window
640: * to one packet. We will gradually open it again as we proceed.
641: */
642: spp_quench(nsp)
643: struct nspcb *nsp;
644: {
645: struct sppcb *cb = nstosppcb(nsp);
646:
647: if (cb)
648: cb->s_cwnd = CUNIT;
649: }
650:
651: #ifdef notdef
652: int
653: spp_fixmtu(nsp)
654: register struct nspcb *nsp;
655: {
656: register struct sppcb *cb = (struct sppcb *)(nsp->nsp_pcb);
657: register struct mbuf *m;
658: register struct spidp *si;
659: struct ns_errp *ep;
660: struct sockbuf *sb;
661: int badseq, len;
662: struct mbuf *firstbad, *m0;
663:
664: if (cb) {
665: /*
666: * The notification that we have sent
667: * too much is bad news -- we will
668: * have to go through queued up so far
669: * splitting ones which are too big and
670: * reassigning sequence numbers and checksums.
671: * we should then retransmit all packets from
672: * one above the offending packet to the last one
673: * we had sent (or our allocation)
674: * then the offending one so that the any queued
675: * data at our destination will be discarded.
676: */
677: ep = (struct ns_errp *)nsp->nsp_notify_param;
678: sb = &nsp->nsp_socket->so_snd;
679: cb->s_mtu = ep->ns_err_param;
680: badseq = SI(&ep->ns_err_idp)->si_seq;
681: for (m = sb->sb_mb; m; m = m->m_act) {
682: si = mtod(m, struct spidp *);
683: if (si->si_seq == badseq)
684: break;
685: }
686: if (m == 0) return;
687: firstbad = m;
688: /*for (;;) {*/
689: /* calculate length */
690: for (m0 = m, len = 0; m ; m = m->m_next)
691: len += m->m_len;
692: if (len > cb->s_mtu) {
693: }
694: /* FINISH THIS
695: } */
696: }
697: }
698: #endif
699:
700: spp_output(cb, m0)
701: register struct sppcb *cb;
702: struct mbuf *m0;
703: {
704: struct socket *so = cb->s_nspcb->nsp_socket;
705: register struct mbuf *m;
706: register struct spidp *si = (struct spidp *) 0;
707: register struct sockbuf *sb = &so->so_snd;
708: int len = 0, win, rcv_win;
709: short span, off, recordp = 0;
710: u_short alo;
711: int error = 0, sendalot;
712: #ifdef notdef
713: int idle;
714: #endif
715: struct mbuf *mprev;
716: extern int idpcksum;
717:
718: if (m0) {
719: int mtu = cb->s_mtu;
720: int datalen;
721: /*
722: * Make sure that packet isn't too big.
723: */
724: for (m = m0; m ; m = m->m_next) {
725: mprev = m;
726: len += m->m_len;
727: if (m->m_flags & M_EOR)
728: recordp = 1;
729: }
730: datalen = (cb->s_flags & SF_HO) ?
731: len - sizeof (struct sphdr) : len;
732: if (datalen > mtu) {
733: if (cb->s_flags & SF_PI) {
734: m_freem(m0);
735: return (EMSGSIZE);
736: } else {
737: int oldEM = cb->s_cc & SP_EM;
738:
739: cb->s_cc &= ~SP_EM;
740: while (len > mtu) {
741: /*
742: * Here we are only being called
743: * from usrreq(), so it is OK to
744: * block.
745: */
746: m = m_copym(m0, 0, mtu, M_WAIT);
747: if (cb->s_flags & SF_NEWCALL) {
748: struct mbuf *mm = m;
749: spp_newchecks[7]++;
750: while (mm) {
751: mm->m_flags &= ~M_EOR;
752: mm = mm->m_next;
753: }
754: }
755: error = spp_output(cb, m);
756: if (error) {
757: cb->s_cc |= oldEM;
758: m_freem(m0);
759: return(error);
760: }
761: m_adj(m0, mtu);
762: len -= mtu;
763: }
764: cb->s_cc |= oldEM;
765: }
766: }
767: /*
768: * Force length even, by adding a "garbage byte" if
769: * necessary.
770: */
771: if (len & 1) {
772: m = mprev;
773: if (M_TRAILINGSPACE(m) >= 1)
774: m->m_len++;
775: else {
776: struct mbuf *m1 = m_get(M_DONTWAIT, MT_DATA);
777:
778: if (m1 == 0) {
779: m_freem(m0);
780: return (ENOBUFS);
781: }
782: m1->m_len = 1;
783: *(mtod(m1, u_char *)) = 0;
784: m->m_next = m1;
785: }
786: }
787: m = m_gethdr(M_DONTWAIT, MT_HEADER);
788: if (m == 0) {
789: m_freem(m0);
790: return (ENOBUFS);
791: }
792: /*
793: * Fill in mbuf with extended SP header
794: * and addresses and length put into network format.
795: */
796: MH_ALIGN(m, sizeof (struct spidp));
797: m->m_len = sizeof (struct spidp);
798: m->m_next = m0;
799: si = mtod(m, struct spidp *);
800: si->si_i = *cb->s_idp;
801: si->si_s = cb->s_shdr;
802: if ((cb->s_flags & SF_PI) && (cb->s_flags & SF_HO)) {
803: register struct sphdr *sh;
804: if (m0->m_len < sizeof (*sh)) {
805: if((m0 = m_pullup(m0, sizeof(*sh))) == NULL) {
806: (void) m_free(m);
807: m_freem(m0);
808: return (EINVAL);
809: }
810: m->m_next = m0;
811: }
812: sh = mtod(m0, struct sphdr *);
813: si->si_dt = sh->sp_dt;
814: si->si_cc |= sh->sp_cc & SP_EM;
815: m0->m_len -= sizeof (*sh);
816: m0->m_data += sizeof (*sh);
817: len -= sizeof (*sh);
818: }
819: len += sizeof(*si);
820: if ((cb->s_flags2 & SF_NEWCALL) && recordp) {
821: si->si_cc |= SP_EM;
822: spp_newchecks[8]++;
823: }
824: if (cb->s_oobflags & SF_SOOB) {
825: /*
826: * Per jqj@cornell:
827: * make sure OB packets convey exactly 1 byte.
828: * If the packet is 1 byte or larger, we
829: * have already guaranted there to be at least
830: * one garbage byte for the checksum, and
831: * extra bytes shouldn't hurt!
832: */
833: if (len > sizeof(*si)) {
834: si->si_cc |= SP_OB;
835: len = (1 + sizeof(*si));
836: }
837: }
838: si->si_len = htons((u_short)len);
839: m->m_pkthdr.len = ((len - 1) | 1) + 1;
840: /*
841: * queue stuff up for output
842: */
843: sbappendrecord(sb, m);
844: cb->s_seq++;
845: }
846: #ifdef notdef
847: idle = (cb->s_smax == (cb->s_rack - 1));
848: #endif
849: again:
850: sendalot = 0;
851: off = cb->s_snxt - cb->s_rack;
852: win = min(cb->s_swnd, (cb->s_cwnd/CUNIT));
853:
854: /*
855: * If in persist timeout with window of 0, send a probe.
856: * Otherwise, if window is small but nonzero
857: * and timer expired, send what we can and go into
858: * transmit state.
859: */
860: if (cb->s_force == 1 + SPPT_PERSIST) {
861: if (win != 0) {
862: cb->s_timer[SPPT_PERSIST] = 0;
863: cb->s_rxtshift = 0;
864: }
865: }
866: span = cb->s_seq - cb->s_rack;
867: len = min(span, win) - off;
868:
869: if (len < 0) {
870: /*
871: * Window shrank after we went into it.
872: * If window shrank to 0, cancel pending
873: * restransmission and pull s_snxt back
874: * to (closed) window. We will enter persist
875: * state below. If the widndow didn't close completely,
876: * just wait for an ACK.
877: */
878: len = 0;
879: if (win == 0) {
880: cb->s_timer[SPPT_REXMT] = 0;
881: cb->s_snxt = cb->s_rack;
882: }
883: }
884: if (len > 1)
885: sendalot = 1;
886: rcv_win = sbspace(&so->so_rcv);
887:
888: /*
889: * Send if we owe peer an ACK.
890: */
891: if (cb->s_oobflags & SF_SOOB) {
892: /*
893: * must transmit this out of band packet
894: */
895: cb->s_oobflags &= ~ SF_SOOB;
896: sendalot = 1;
897: sppstat.spps_sndurg++;
898: goto found;
899: }
900: if (cb->s_flags & SF_ACKNOW)
901: goto send;
902: if (cb->s_state < TCPS_ESTABLISHED)
903: goto send;
904: /*
905: * Silly window can't happen in spp.
906: * Code from tcp deleted.
907: */
908: if (len)
909: goto send;
910: /*
911: * Compare available window to amount of window
912: * known to peer (as advertised window less
913: * next expected input.) If the difference is at least two
914: * packets or at least 35% of the mximum possible window,
915: * then want to send a window update to peer.
916: */
917: if (rcv_win > 0) {
918: u_short delta = 1 + cb->s_alo - cb->s_ack;
919: int adv = rcv_win - (delta * cb->s_mtu);
920:
921: if ((so->so_rcv.sb_cc == 0 && adv >= (2 * cb->s_mtu)) ||
922: (100 * adv / so->so_rcv.sb_hiwat >= 35)) {
923: sppstat.spps_sndwinup++;
924: cb->s_flags |= SF_ACKNOW;
925: goto send;
926: }
927:
928: }
929: /*
930: * Many comments from tcp_output.c are appropriate here
931: * including . . .
932: * If send window is too small, there is data to transmit, and no
933: * retransmit or persist is pending, then go to persist state.
934: * If nothing happens soon, send when timer expires:
935: * if window is nonzero, transmit what we can,
936: * otherwise send a probe.
937: */
938: if (so->so_snd.sb_cc && cb->s_timer[SPPT_REXMT] == 0 &&
939: cb->s_timer[SPPT_PERSIST] == 0) {
940: cb->s_rxtshift = 0;
941: spp_setpersist(cb);
942: }
943: /*
944: * No reason to send a packet, just return.
945: */
946: cb->s_outx = 1;
947: return (0);
948:
949: send:
950: /*
951: * Find requested packet.
952: */
953: si = 0;
954: if (len > 0) {
955: cb->s_want = cb->s_snxt;
956: for (m = sb->sb_mb; m; m = m->m_act) {
957: si = mtod(m, struct spidp *);
958: if (SSEQ_LEQ(cb->s_snxt, si->si_seq))
959: break;
960: }
961: found:
962: if (si) {
963: if (si->si_seq == cb->s_snxt)
964: cb->s_snxt++;
965: else
966: sppstat.spps_sndvoid++, si = 0;
967: }
968: }
969: /*
970: * update window
971: */
972: if (rcv_win < 0)
973: rcv_win = 0;
974: alo = cb->s_ack - 1 + (rcv_win / ((short)cb->s_mtu));
975: if (SSEQ_LT(alo, cb->s_alo))
976: alo = cb->s_alo;
977:
978: if (si) {
979: /*
980: * must make a copy of this packet for
981: * idp_output to monkey with
982: */
983: m = m_copy(dtom(si), 0, (int)M_COPYALL);
984: if (m == NULL) {
985: return (ENOBUFS);
986: }
987: si = mtod(m, struct spidp *);
988: if (SSEQ_LT(si->si_seq, cb->s_smax))
989: sppstat.spps_sndrexmitpack++;
990: else
991: sppstat.spps_sndpack++;
992: } else if (cb->s_force || cb->s_flags & SF_ACKNOW) {
993: /*
994: * Must send an acknowledgement or a probe
995: */
996: if (cb->s_force)
997: sppstat.spps_sndprobe++;
998: if (cb->s_flags & SF_ACKNOW)
999: sppstat.spps_sndacks++;
1000: m = m_gethdr(M_DONTWAIT, MT_HEADER);
1001: if (m == 0)
1002: return (ENOBUFS);
1003: /*
1004: * Fill in mbuf with extended SP header
1005: * and addresses and length put into network format.
1006: */
1007: MH_ALIGN(m, sizeof (struct spidp));
1008: m->m_len = sizeof (*si);
1009: m->m_pkthdr.len = sizeof (*si);
1010: si = mtod(m, struct spidp *);
1011: si->si_i = *cb->s_idp;
1012: si->si_s = cb->s_shdr;
1013: si->si_seq = cb->s_smax + 1;
1014: si->si_len = htons(sizeof (*si));
1015: si->si_cc |= SP_SP;
1016: } else {
1017: cb->s_outx = 3;
1018: if (so->so_options & SO_DEBUG || traceallspps)
1019: spp_trace(SA_OUTPUT, cb->s_state, cb, si, 0);
1020: return (0);
1021: }
1022: /*
1023: * Stuff checksum and output datagram.
1024: */
1025: if ((si->si_cc & SP_SP) == 0) {
1026: if (cb->s_force != (1 + SPPT_PERSIST) ||
1027: cb->s_timer[SPPT_PERSIST] == 0) {
1028: /*
1029: * If this is a new packet and we are not currently
1030: * timing anything, time this one.
1031: */
1032: if (SSEQ_LT(cb->s_smax, si->si_seq)) {
1033: cb->s_smax = si->si_seq;
1034: if (cb->s_rtt == 0) {
1035: sppstat.spps_segstimed++;
1036: cb->s_rtseq = si->si_seq;
1037: cb->s_rtt = 1;
1038: }
1039: }
1040: /*
1041: * Set rexmt timer if not currently set,
1042: * Initial value for retransmit timer is smoothed
1043: * round-trip time + 2 * round-trip time variance.
1044: * Initialize shift counter which is used for backoff
1045: * of retransmit time.
1046: */
1047: if (cb->s_timer[SPPT_REXMT] == 0 &&
1048: cb->s_snxt != cb->s_rack) {
1049: cb->s_timer[SPPT_REXMT] = cb->s_rxtcur;
1050: if (cb->s_timer[SPPT_PERSIST]) {
1051: cb->s_timer[SPPT_PERSIST] = 0;
1052: cb->s_rxtshift = 0;
1053: }
1054: }
1055: } else if (SSEQ_LT(cb->s_smax, si->si_seq)) {
1056: cb->s_smax = si->si_seq;
1057: }
1058: } else if (cb->s_state < TCPS_ESTABLISHED) {
1059: if (cb->s_rtt == 0)
1060: cb->s_rtt = 1; /* Time initial handshake */
1061: if (cb->s_timer[SPPT_REXMT] == 0)
1062: cb->s_timer[SPPT_REXMT] = cb->s_rxtcur;
1063: }
1064: {
1065: /*
1066: * Do not request acks when we ack their data packets or
1067: * when we do a gratuitous window update.
1068: */
1069: if (((si->si_cc & SP_SP) == 0) || cb->s_force)
1070: si->si_cc |= SP_SA;
1071: si->si_seq = htons(si->si_seq);
1072: si->si_alo = htons(alo);
1073: si->si_ack = htons(cb->s_ack);
1074:
1075: if (idpcksum) {
1076: si->si_sum = 0;
1077: len = ntohs(si->si_len);
1078: if (len & 1)
1079: len++;
1080: si->si_sum = ns_cksum(m, len);
1081: } else
1082: si->si_sum = 0xffff;
1083:
1084: cb->s_outx = 4;
1085: if (so->so_options & SO_DEBUG || traceallspps)
1086: spp_trace(SA_OUTPUT, cb->s_state, cb, si, 0);
1087:
1088: if (so->so_options & SO_DONTROUTE)
1089: error = ns_output(m, (struct route *)0, NS_ROUTETOIF);
1090: else
1091: error = ns_output(m, &cb->s_nspcb->nsp_route, 0);
1092: }
1093: if (error) {
1094: return (error);
1095: }
1096: sppstat.spps_sndtotal++;
1097: /*
1098: * Data sent (as far as we can tell).
1099: * If this advertises a larger window than any other segment,
1100: * then remember the size of the advertized window.
1101: * Any pending ACK has now been sent.
1102: */
1103: cb->s_force = 0;
1104: cb->s_flags &= ~(SF_ACKNOW|SF_DELACK);
1105: if (SSEQ_GT(alo, cb->s_alo))
1106: cb->s_alo = alo;
1107: if (sendalot)
1108: goto again;
1109: cb->s_outx = 5;
1110: return (0);
1111: }
1112:
1113: int spp_do_persist_panics = 0;
1114:
1115: spp_setpersist(cb)
1116: register struct sppcb *cb;
1117: {
1118: register t = ((cb->s_srtt >> 2) + cb->s_rttvar) >> 1;
1119: extern int spp_backoff[];
1120:
1121: if (cb->s_timer[SPPT_REXMT] && spp_do_persist_panics)
1122: panic("spp_output REXMT");
1123: /*
1124: * Start/restart persistance timer.
1125: */
1126: SPPT_RANGESET(cb->s_timer[SPPT_PERSIST],
1127: t*spp_backoff[cb->s_rxtshift],
1128: SPPTV_PERSMIN, SPPTV_PERSMAX);
1129: if (cb->s_rxtshift < SPP_MAXRXTSHIFT)
1130: cb->s_rxtshift++;
1131: }
1132: /*ARGSUSED*/
1133: spp_ctloutput(req, so, level, name, value)
1134: int req;
1135: struct socket *so;
1136: int name;
1137: struct mbuf **value;
1138: {
1139: register struct mbuf *m;
1140: struct nspcb *nsp = sotonspcb(so);
1141: register struct sppcb *cb;
1142: int mask, error = 0;
1143:
1144: if (level != NSPROTO_SPP) {
1145: /* This will have to be changed when we do more general
1146: stacking of protocols */
1147: return (idp_ctloutput(req, so, level, name, value));
1148: }
1149: if (nsp == NULL) {
1150: error = EINVAL;
1151: goto release;
1152: } else
1153: cb = nstosppcb(nsp);
1154:
1155: switch (req) {
1156:
1157: case PRCO_GETOPT:
1158: if (value == NULL)
1159: return (EINVAL);
1160: m = m_get(M_DONTWAIT, MT_DATA);
1161: if (m == NULL)
1162: return (ENOBUFS);
1163: switch (name) {
1164:
1165: case SO_HEADERS_ON_INPUT:
1166: mask = SF_HI;
1167: goto get_flags;
1168:
1169: case SO_HEADERS_ON_OUTPUT:
1170: mask = SF_HO;
1171: get_flags:
1172: m->m_len = sizeof(short);
1173: *mtod(m, short *) = cb->s_flags & mask;
1174: break;
1175:
1176: case SO_MTU:
1177: m->m_len = sizeof(u_short);
1178: *mtod(m, short *) = cb->s_mtu;
1179: break;
1180:
1181: case SO_LAST_HEADER:
1182: m->m_len = sizeof(struct sphdr);
1183: *mtod(m, struct sphdr *) = cb->s_rhdr;
1184: break;
1185:
1186: case SO_DEFAULT_HEADERS:
1187: m->m_len = sizeof(struct spidp);
1188: *mtod(m, struct sphdr *) = cb->s_shdr;
1189: break;
1190:
1191: default:
1192: error = EINVAL;
1193: }
1194: *value = m;
1195: break;
1196:
1197: case PRCO_SETOPT:
1198: if (value == 0 || *value == 0) {
1199: error = EINVAL;
1200: break;
1201: }
1202: switch (name) {
1203: int *ok;
1204:
1205: case SO_HEADERS_ON_INPUT:
1206: mask = SF_HI;
1207: goto set_head;
1208:
1209: case SO_HEADERS_ON_OUTPUT:
1210: mask = SF_HO;
1211: set_head:
1212: if (cb->s_flags & SF_PI) {
1213: ok = mtod(*value, int *);
1214: if (*ok)
1215: cb->s_flags |= mask;
1216: else
1217: cb->s_flags &= ~mask;
1218: } else error = EINVAL;
1219: break;
1220:
1221: case SO_MTU:
1222: cb->s_mtu = *(mtod(*value, u_short *));
1223: break;
1224:
1225: #ifdef SF_NEWCALL
1226: case SO_NEWCALL:
1227: ok = mtod(*value, int *);
1228: if (*ok) {
1229: cb->s_flags2 |= SF_NEWCALL;
1230: spp_newchecks[5]++;
1231: } else {
1232: cb->s_flags2 &= ~SF_NEWCALL;
1233: spp_newchecks[6]++;
1234: }
1235: break;
1236: #endif
1237:
1238: case SO_DEFAULT_HEADERS:
1239: {
1240: register struct sphdr *sp
1241: = mtod(*value, struct sphdr *);
1242: cb->s_dt = sp->sp_dt;
1243: cb->s_cc = sp->sp_cc & SP_EM;
1244: }
1245: break;
1246:
1247: default:
1248: error = EINVAL;
1249: }
1250: m_freem(*value);
1251: break;
1252: }
1253: release:
1254: return (error);
1255: }
1256:
1257: /*ARGSUSED*/
1258: spp_usrreq(so, req, m, nam, controlp)
1259: struct socket *so;
1260: int req;
1261: struct mbuf *m, *nam, *controlp;
1262: {
1263: struct nspcb *nsp = sotonspcb(so);
1264: register struct sppcb *cb;
1265: int s = splnet();
1266: int error = 0, ostate;
1267: struct mbuf *mm;
1268: register struct sockbuf *sb;
1269:
1270: if (req == PRU_CONTROL)
1271: return (ns_control(so, (int)m, (caddr_t)nam,
1272: (struct ifnet *)controlp));
1273: if (nsp == NULL) {
1274: if (req != PRU_ATTACH) {
1275: error = EINVAL;
1276: goto release;
1277: }
1278: } else
1279: cb = nstosppcb(nsp);
1280:
1281: ostate = cb ? cb->s_state : 0;
1282:
1283: switch (req) {
1284:
1285: case PRU_ATTACH:
1286: if (nsp != NULL) {
1287: error = EISCONN;
1288: break;
1289: }
1290: error = ns_pcballoc(so, &nspcb);
1291: if (error)
1292: break;
1293: if (so->so_snd.sb_hiwat == 0 || so->so_rcv.sb_hiwat == 0) {
1294: error = soreserve(so, (u_long) 3072, (u_long) 3072);
1295: if (error)
1296: break;
1297: }
1298: nsp = sotonspcb(so);
1299:
1300: mm = m_getclr(M_DONTWAIT, MT_PCB);
1301: sb = &so->so_snd;
1302:
1303: if (mm == NULL) {
1304: error = ENOBUFS;
1305: break;
1306: }
1307: cb = mtod(mm, struct sppcb *);
1308: mm = m_getclr(M_DONTWAIT, MT_HEADER);
1309: if (mm == NULL) {
1310: (void) m_free(dtom(m));
1311: error = ENOBUFS;
1312: break;
1313: }
1314: cb->s_idp = mtod(mm, struct idp *);
1315: cb->s_state = TCPS_LISTEN;
1316: cb->s_smax = -1;
1317: cb->s_swl1 = -1;
1318: cb->s_q.si_next = cb->s_q.si_prev = &cb->s_q;
1319: cb->s_nspcb = nsp;
1320: cb->s_mtu = 576 - sizeof (struct spidp);
1321: cb->s_cwnd = sbspace(sb) * CUNIT / cb->s_mtu;
1322: cb->s_ssthresh = cb->s_cwnd;
1323: cb->s_cwmx = sbspace(sb) * CUNIT /
1324: (2 * sizeof (struct spidp));
1325: /* Above is recomputed when connecting to account
1326: for changed buffering or mtu's */
1327: cb->s_rtt = SPPTV_SRTTBASE;
1328: cb->s_rttvar = SPPTV_SRTTDFLT << 2;
1329: SPPT_RANGESET(cb->s_rxtcur,
1330: ((SPPTV_SRTTBASE >> 2) + (SPPTV_SRTTDFLT << 2)) >> 1,
1331: SPPTV_MIN, SPPTV_REXMTMAX);
1332: nsp->nsp_pcb = (caddr_t) cb;
1333: break;
1334:
1335: case PRU_DETACH:
1336: if (nsp == NULL) {
1337: error = ENOTCONN;
1338: break;
1339: }
1340: if (cb->s_state > TCPS_LISTEN)
1341: cb = spp_disconnect(cb);
1342: else
1343: cb = spp_close(cb);
1344: break;
1345:
1346: case PRU_BIND:
1347: error = ns_pcbbind(nsp, nam);
1348: break;
1349:
1350: case PRU_LISTEN:
1351: if (nsp->nsp_lport == 0)
1352: error = ns_pcbbind(nsp, (struct mbuf *)0);
1353: if (error == 0)
1354: cb->s_state = TCPS_LISTEN;
1355: break;
1356:
1357: /*
1358: * Initiate connection to peer.
1359: * Enter SYN_SENT state, and mark socket as connecting.
1360: * Start keep-alive timer, setup prototype header,
1361: * Send initial system packet requesting connection.
1362: */
1363: case PRU_CONNECT:
1364: if (nsp->nsp_lport == 0) {
1365: error = ns_pcbbind(nsp, (struct mbuf *)0);
1366: if (error)
1367: break;
1368: }
1369: error = ns_pcbconnect(nsp, nam);
1370: if (error)
1371: break;
1372: soisconnecting(so);
1373: sppstat.spps_connattempt++;
1374: cb->s_state = TCPS_SYN_SENT;
1375: cb->s_did = 0;
1376: spp_template(cb);
1377: cb->s_timer[SPPT_KEEP] = SPPTV_KEEP;
1378: cb->s_force = 1 + SPPTV_KEEP;
1379: /*
1380: * Other party is required to respond to
1381: * the port I send from, but he is not
1382: * required to answer from where I am sending to,
1383: * so allow wildcarding.
1384: * original port I am sending to is still saved in
1385: * cb->s_dport.
1386: */
1387: nsp->nsp_fport = 0;
1388: error = spp_output(cb, (struct mbuf *) 0);
1389: break;
1390:
1391: case PRU_CONNECT2:
1392: error = EOPNOTSUPP;
1393: break;
1394:
1395: /*
1396: * We may decide later to implement connection closing
1397: * handshaking at the spp level optionally.
1398: * here is the hook to do it:
1399: */
1400: case PRU_DISCONNECT:
1401: cb = spp_disconnect(cb);
1402: break;
1403:
1404: /*
1405: * Accept a connection. Essentially all the work is
1406: * done at higher levels; just return the address
1407: * of the peer, storing through addr.
1408: */
1409: case PRU_ACCEPT: {
1410: struct sockaddr_ns *sns = mtod(nam, struct sockaddr_ns *);
1411:
1412: nam->m_len = sizeof (struct sockaddr_ns);
1413: sns->sns_family = AF_NS;
1414: sns->sns_addr = nsp->nsp_faddr;
1415: break;
1416: }
1417:
1418: case PRU_SHUTDOWN:
1419: socantsendmore(so);
1420: cb = spp_usrclosed(cb);
1421: if (cb)
1422: error = spp_output(cb, (struct mbuf *) 0);
1423: break;
1424:
1425: /*
1426: * After a receive, possibly send acknowledgment
1427: * updating allocation.
1428: */
1429: case PRU_RCVD:
1430: cb->s_flags |= SF_RVD;
1431: (void) spp_output(cb, (struct mbuf *) 0);
1432: cb->s_flags &= ~SF_RVD;
1433: break;
1434:
1435: case PRU_ABORT:
1436: (void) spp_drop(cb, ECONNABORTED);
1437: break;
1438:
1439: case PRU_SENSE:
1440: case PRU_CONTROL:
1441: m = NULL;
1442: error = EOPNOTSUPP;
1443: break;
1444:
1445: case PRU_RCVOOB:
1446: if ((cb->s_oobflags & SF_IOOB) || so->so_oobmark ||
1447: (so->so_state & SS_RCVATMARK)) {
1448: m->m_len = 1;
1449: *mtod(m, caddr_t) = cb->s_iobc;
1450: break;
1451: }
1452: error = EINVAL;
1453: break;
1454:
1455: case PRU_SENDOOB:
1456: if (sbspace(&so->so_snd) < -512) {
1457: error = ENOBUFS;
1458: break;
1459: }
1460: cb->s_oobflags |= SF_SOOB;
1461: /* fall into */
1462: case PRU_SEND:
1463: if (controlp) {
1464: u_short *p = mtod(controlp, u_short *);
1465: spp_newchecks[2]++;
1466: if ((p[0] == 5) && p[1] == 1) { /* XXXX, for testing */
1467: cb->s_shdr.sp_dt = *(u_char *)(&p[2]);
1468: spp_newchecks[3]++;
1469: }
1470: m_freem(controlp);
1471: }
1472: controlp = NULL;
1473: error = spp_output(cb, m);
1474: m = NULL;
1475: break;
1476:
1477: case PRU_SOCKADDR:
1478: ns_setsockaddr(nsp, nam);
1479: break;
1480:
1481: case PRU_PEERADDR:
1482: ns_setpeeraddr(nsp, nam);
1483: break;
1484:
1485: case PRU_SLOWTIMO:
1486: cb = spp_timers(cb, (int)nam);
1487: req |= ((int)nam) << 8;
1488: break;
1489:
1490: case PRU_FASTTIMO:
1491: case PRU_PROTORCV:
1492: case PRU_PROTOSEND:
1493: error = EOPNOTSUPP;
1494: break;
1495:
1496: default:
1497: panic("sp_usrreq");
1498: }
1499: if (cb && (so->so_options & SO_DEBUG || traceallspps))
1500: spp_trace(SA_USER, (u_char)ostate, cb, (struct spidp *)0, req);
1501: release:
1502: if (controlp != NULL)
1503: m_freem(controlp);
1504: if (m != NULL)
1505: m_freem(m);
1506: splx(s);
1507: return (error);
1508: }
1509:
1510: spp_usrreq_sp(so, req, m, nam, controlp)
1511: struct socket *so;
1512: int req;
1513: struct mbuf *m, *nam, *controlp;
1514: {
1515: int error = spp_usrreq(so, req, m, nam, controlp);
1516:
1517: if (req == PRU_ATTACH && error == 0) {
1518: struct nspcb *nsp = sotonspcb(so);
1519: ((struct sppcb *)nsp->nsp_pcb)->s_flags |=
1520: (SF_HI | SF_HO | SF_PI);
1521: }
1522: return (error);
1523: }
1524:
1525: /*
1526: * Create template to be used to send spp packets on a connection.
1527: * Called after host entry created, fills
1528: * in a skeletal spp header (choosing connection id),
1529: * minimizing the amount of work necessary when the connection is used.
1530: */
1531: spp_template(cb)
1532: register struct sppcb *cb;
1533: {
1534: register struct nspcb *nsp = cb->s_nspcb;
1535: register struct idp *idp = cb->s_idp;
1536: register struct sockbuf *sb = &(nsp->nsp_socket->so_snd);
1537:
1538: idp->idp_pt = NSPROTO_SPP;
1539: idp->idp_sna = nsp->nsp_laddr;
1540: idp->idp_dna = nsp->nsp_faddr;
1541: cb->s_sid = htons(spp_iss);
1542: spp_iss += SPP_ISSINCR/2;
1543: cb->s_alo = 1;
1544: cb->s_cwnd = (sbspace(sb) * CUNIT) / cb->s_mtu;
1545: cb->s_ssthresh = cb->s_cwnd; /* Try to expand fast to full complement
1546: of large packets */
1547: cb->s_cwmx = (sbspace(sb) * CUNIT) / (2 * sizeof(struct spidp));
1548: cb->s_cwmx = max(cb->s_cwmx, cb->s_cwnd);
1549: /* But allow for lots of little packets as well */
1550: }
1551:
1552: /*
1553: * Close a SPIP control block:
1554: * discard spp control block itself
1555: * discard ns protocol control block
1556: * wake up any sleepers
1557: */
1558: struct sppcb *
1559: spp_close(cb)
1560: register struct sppcb *cb;
1561: {
1562: register struct spidp_q *s;
1563: struct nspcb *nsp = cb->s_nspcb;
1564: struct socket *so = nsp->nsp_socket;
1565: register struct mbuf *m;
1566:
1567: s = cb->s_q.si_next;
1568: while (s != &(cb->s_q)) {
1569: s = s->si_next;
1570: m = dtom(s->si_prev);
1571: remque(s->si_prev);
1572: m_freem(m);
1573: }
1574: (void) m_free(dtom(cb->s_idp));
1575: (void) m_free(dtom(cb));
1576: nsp->nsp_pcb = 0;
1577: soisdisconnected(so);
1578: ns_pcbdetach(nsp);
1579: sppstat.spps_closed++;
1580: return ((struct sppcb *)0);
1581: }
1582: /*
1583: * Someday we may do level 3 handshaking
1584: * to close a connection or send a xerox style error.
1585: * For now, just close.
1586: */
1587: struct sppcb *
1588: spp_usrclosed(cb)
1589: register struct sppcb *cb;
1590: {
1591: return (spp_close(cb));
1592: }
1593: struct sppcb *
1594: spp_disconnect(cb)
1595: register struct sppcb *cb;
1596: {
1597: return (spp_close(cb));
1598: }
1599: /*
1600: * Drop connection, reporting
1601: * the specified error.
1602: */
1603: struct sppcb *
1604: spp_drop(cb, errno)
1605: register struct sppcb *cb;
1606: int errno;
1607: {
1608: struct socket *so = cb->s_nspcb->nsp_socket;
1609:
1610: /*
1611: * someday, in the xerox world
1612: * we will generate error protocol packets
1613: * announcing that the socket has gone away.
1614: */
1615: if (TCPS_HAVERCVDSYN(cb->s_state)) {
1616: sppstat.spps_drops++;
1617: cb->s_state = TCPS_CLOSED;
1618: /*(void) tcp_output(cb);*/
1619: } else
1620: sppstat.spps_conndrops++;
1621: so->so_error = errno;
1622: return (spp_close(cb));
1623: }
1624:
1625: spp_abort(nsp)
1626: struct nspcb *nsp;
1627: {
1628:
1629: (void) spp_close((struct sppcb *)nsp->nsp_pcb);
1630: }
1631:
1632: int spp_backoff[SPP_MAXRXTSHIFT+1] =
1633: { 1, 2, 4, 8, 16, 32, 64, 64, 64, 64, 64, 64, 64 };
1634: /*
1635: * Fast timeout routine for processing delayed acks
1636: */
1637: spp_fasttimo()
1638: {
1639: register struct nspcb *nsp;
1640: register struct sppcb *cb;
1641: int s = splnet();
1642:
1643: nsp = nspcb.nsp_next;
1644: if (nsp)
1645: for (; nsp != &nspcb; nsp = nsp->nsp_next)
1646: if ((cb = (struct sppcb *)nsp->nsp_pcb) &&
1647: (cb->s_flags & SF_DELACK)) {
1648: cb->s_flags &= ~SF_DELACK;
1649: cb->s_flags |= SF_ACKNOW;
1650: sppstat.spps_delack++;
1651: (void) spp_output(cb, (struct mbuf *) 0);
1652: }
1653: splx(s);
1654: }
1655:
1656: /*
1657: * spp protocol timeout routine called every 500 ms.
1658: * Updates the timers in all active pcb's and
1659: * causes finite state machine actions if timers expire.
1660: */
1661: spp_slowtimo()
1662: {
1663: register struct nspcb *ip, *ipnxt;
1664: register struct sppcb *cb;
1665: int s = splnet();
1666: register int i;
1667:
1668: /*
1669: * Search through tcb's and update active timers.
1670: */
1671: ip = nspcb.nsp_next;
1672: if (ip == 0) {
1673: splx(s);
1674: return;
1675: }
1676: while (ip != &nspcb) {
1677: cb = nstosppcb(ip);
1678: ipnxt = ip->nsp_next;
1679: if (cb == 0)
1680: goto tpgone;
1681: for (i = 0; i < SPPT_NTIMERS; i++) {
1682: if (cb->s_timer[i] && --cb->s_timer[i] == 0) {
1683: (void) spp_usrreq(cb->s_nspcb->nsp_socket,
1684: PRU_SLOWTIMO, (struct mbuf *)0,
1685: (struct mbuf *)i, (struct mbuf *)0,
1686: (struct mbuf *)0);
1687: if (ipnxt->nsp_prev != ip)
1688: goto tpgone;
1689: }
1690: }
1691: cb->s_idle++;
1692: if (cb->s_rtt)
1693: cb->s_rtt++;
1694: tpgone:
1695: ip = ipnxt;
1696: }
1697: spp_iss += SPP_ISSINCR/PR_SLOWHZ; /* increment iss */
1698: splx(s);
1699: }
1700: /*
1701: * SPP timer processing.
1702: */
1703: struct sppcb *
1704: spp_timers(cb, timer)
1705: register struct sppcb *cb;
1706: int timer;
1707: {
1708: long rexmt;
1709: int win;
1710:
1711: cb->s_force = 1 + timer;
1712: switch (timer) {
1713:
1714: /*
1715: * 2 MSL timeout in shutdown went off. TCP deletes connection
1716: * control block.
1717: */
1718: case SPPT_2MSL:
1719: printf("spp: SPPT_2MSL went off for no reason\n");
1720: cb->s_timer[timer] = 0;
1721: break;
1722:
1723: /*
1724: * Retransmission timer went off. Message has not
1725: * been acked within retransmit interval. Back off
1726: * to a longer retransmit interval and retransmit one packet.
1727: */
1728: case SPPT_REXMT:
1729: if (++cb->s_rxtshift > SPP_MAXRXTSHIFT) {
1730: cb->s_rxtshift = SPP_MAXRXTSHIFT;
1731: sppstat.spps_timeoutdrop++;
1732: cb = spp_drop(cb, ETIMEDOUT);
1733: break;
1734: }
1735: sppstat.spps_rexmttimeo++;
1736: rexmt = ((cb->s_srtt >> 2) + cb->s_rttvar) >> 1;
1737: rexmt *= spp_backoff[cb->s_rxtshift];
1738: SPPT_RANGESET(cb->s_rxtcur, rexmt, SPPTV_MIN, SPPTV_REXMTMAX);
1739: cb->s_timer[SPPT_REXMT] = cb->s_rxtcur;
1740: /*
1741: * If we have backed off fairly far, our srtt
1742: * estimate is probably bogus. Clobber it
1743: * so we'll take the next rtt measurement as our srtt;
1744: * move the current srtt into rttvar to keep the current
1745: * retransmit times until then.
1746: */
1747: if (cb->s_rxtshift > SPP_MAXRXTSHIFT / 4 ) {
1748: cb->s_rttvar += (cb->s_srtt >> 2);
1749: cb->s_srtt = 0;
1750: }
1751: cb->s_snxt = cb->s_rack;
1752: /*
1753: * If timing a packet, stop the timer.
1754: */
1755: cb->s_rtt = 0;
1756: /*
1757: * See very long discussion in tcp_timer.c about congestion
1758: * window and sstrhesh
1759: */
1760: win = min(cb->s_swnd, (cb->s_cwnd/CUNIT)) / 2;
1761: if (win < 2)
1762: win = 2;
1763: cb->s_cwnd = CUNIT;
1764: cb->s_ssthresh = win * CUNIT;
1765: (void) spp_output(cb, (struct mbuf *) 0);
1766: break;
1767:
1768: /*
1769: * Persistance timer into zero window.
1770: * Force a probe to be sent.
1771: */
1772: case SPPT_PERSIST:
1773: sppstat.spps_persisttimeo++;
1774: spp_setpersist(cb);
1775: (void) spp_output(cb, (struct mbuf *) 0);
1776: break;
1777:
1778: /*
1779: * Keep-alive timer went off; send something
1780: * or drop connection if idle for too long.
1781: */
1782: case SPPT_KEEP:
1783: sppstat.spps_keeptimeo++;
1784: if (cb->s_state < TCPS_ESTABLISHED)
1785: goto dropit;
1786: if (cb->s_nspcb->nsp_socket->so_options & SO_KEEPALIVE) {
1787: if (cb->s_idle >= SPPTV_MAXIDLE)
1788: goto dropit;
1789: sppstat.spps_keepprobe++;
1790: (void) spp_output(cb, (struct mbuf *) 0);
1791: } else
1792: cb->s_idle = 0;
1793: cb->s_timer[SPPT_KEEP] = SPPTV_KEEP;
1794: break;
1795: dropit:
1796: sppstat.spps_keepdrops++;
1797: cb = spp_drop(cb, ETIMEDOUT);
1798: break;
1799: }
1800: return (cb);
1801: }
1802: #ifndef lint
1803: int SppcbSize = sizeof (struct sppcb);
1804: int NspcbSize = sizeof (struct nspcb);
1805: #endif lint
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.