xref: /illumos-gate/usr/src/uts/common/inet/sctp/sctp_output.c (revision b1d7ec75953cd517f5b7c3d9cb427ff8ec5d7d07)
1 /*
2  * CDDL HEADER START
3  *
4  * The contents of this file are subject to the terms of the
5  * Common Development and Distribution License (the "License").
6  * You may not use this file except in compliance with the License.
7  *
8  * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
9  * or http://www.opensolaris.org/os/licensing.
10  * See the License for the specific language governing permissions
11  * and limitations under the License.
12  *
13  * When distributing Covered Code, include this CDDL HEADER in each
14  * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15  * If applicable, add the following below this CDDL HEADER, with the
16  * fields enclosed by brackets "[]" replaced with your own identifying
17  * information: Portions Copyright [yyyy] [name of copyright owner]
18  *
19  * CDDL HEADER END
20  */
21 
22 /*
23  * Copyright (c) 2004, 2010, Oracle and/or its affiliates. All rights reserved.
24  */
25 
26 #include <sys/types.h>
27 #include <sys/systm.h>
28 #include <sys/stream.h>
29 #include <sys/cmn_err.h>
30 #define	_SUN_TPI_VERSION 2
31 #include <sys/tihdr.h>
32 #include <sys/socket.h>
33 #include <sys/stropts.h>
34 #include <sys/strsun.h>
35 #include <sys/strsubr.h>
36 #include <sys/socketvar.h>
37 #include <inet/common.h>
38 #include <inet/mi.h>
39 #include <inet/ip.h>
40 #include <inet/ip_ire.h>
41 #include <inet/ip6.h>
42 #include <inet/sctp_ip.h>
43 #include <inet/ipclassifier.h>
44 
45 /*
46  * PR-SCTP comments.
47  *
48  * A message can expire before it gets to the transmit list (i.e. it is still
49  * in the unsent list - unchunked), after it gets to the transmit list, but
50  * before transmission has actually started, or after transmission has begun.
51  * Accordingly, we check for the status of a message in sctp_chunkify() when
52  * the message is being transferred from the unsent list to the transmit list;
53  * in sctp_get_msg_to_send(), when we get the next chunk from the transmit
54  * list and in sctp_rexmit() when we get the next chunk to be (re)transmitted.
55  * When we nuke a message in sctp_chunkify(), all we need to do is take it
56  * out of the unsent list and update sctp_unsent; when a message is deemed
57  * timed-out in sctp_get_msg_to_send() we can just take it out of the transmit
58  * list, update sctp_unsent IFF transmission for the message has not yet begun
59  * (i.e. !SCTP_CHUNK_ISSENT(meta->b_cont)). However, if transmission for the
60  * message has started, then we cannot just take it out of the list, we need
61  * to send Forward TSN chunk to the peer so that the peer can clear its
62  * fragment list for this message. However, we cannot just send the Forward
63  * TSN in sctp_get_msg_to_send() because there might be unacked chunks for
64  * messages preceeding this abandoned message. So, we send a Forward TSN
65  * IFF all messages prior to this abandoned message has been SACKd, if not
66  * we defer sending the Forward TSN to sctp_cumack(), which will check for
67  * this condition and send the Forward TSN via sctp_check_abandoned_msg(). In
68  * sctp_rexmit() when we check for retransmissions, we need to determine if
69  * the advanced peer ack point can be moved ahead, and if so, send a Forward
70  * TSN to the peer instead of retransmitting the chunk. Note that when
71  * we send a Forward TSN for a message, there may be yet unsent chunks for
72  * this message; we need to mark all such chunks as abandoned, so that
73  * sctp_cumack() can take the message out of the transmit list, additionally
74  * sctp_unsent need to be adjusted. Whenever sctp_unsent is updated (i.e.
75  * decremented when a message/chunk is deemed abandoned), sockfs needs to
76  * be notified so that it can adjust its idea of the queued message.
77  */
78 
79 #include "sctp_impl.h"
80 
81 static struct kmem_cache	*sctp_kmem_ftsn_set_cache;
82 static mblk_t			*sctp_chunkify(sctp_t *, int, int, int);
83 
84 #ifdef	DEBUG
85 static boolean_t	sctp_verify_chain(mblk_t *, mblk_t *);
86 #endif
87 
88 /*
89  * Called to allocate a header mblk when sending data to SCTP.
90  * Data will follow in b_cont of this mblk.
91  */
92 mblk_t *
93 sctp_alloc_hdr(const char *name, int nlen, const char *control, int clen,
94     int flags)
95 {
96 	mblk_t *mp;
97 	struct T_unitdata_req *tudr;
98 	size_t size;
99 	int error;
100 
101 	size = sizeof (*tudr) + _TPI_ALIGN_TOPT(nlen) + clen;
102 	size = MAX(size, sizeof (sctp_msg_hdr_t));
103 	if (flags & SCTP_CAN_BLOCK) {
104 		mp = allocb_wait(size, BPRI_MED, 0, &error);
105 	} else {
106 		mp = allocb(size, BPRI_MED);
107 	}
108 	if (mp) {
109 		tudr = (struct T_unitdata_req *)mp->b_rptr;
110 		tudr->PRIM_type = T_UNITDATA_REQ;
111 		tudr->DEST_length = nlen;
112 		tudr->DEST_offset = sizeof (*tudr);
113 		tudr->OPT_length = clen;
114 		tudr->OPT_offset = (t_scalar_t)(sizeof (*tudr) +
115 		    _TPI_ALIGN_TOPT(nlen));
116 		if (nlen > 0)
117 			bcopy(name, tudr + 1, nlen);
118 		if (clen > 0)
119 			bcopy(control, (char *)tudr + tudr->OPT_offset, clen);
120 		mp->b_wptr += (tudr ->OPT_offset + clen);
121 		mp->b_datap->db_type = M_PROTO;
122 	}
123 	return (mp);
124 }
125 
126 /*ARGSUSED2*/
127 int
128 sctp_sendmsg(sctp_t *sctp, mblk_t *mp, int flags)
129 {
130 	sctp_faddr_t	*fp = NULL;
131 	struct T_unitdata_req	*tudr;
132 	int		error = 0;
133 	mblk_t		*mproto = mp;
134 	in6_addr_t	*addr;
135 	in6_addr_t	tmpaddr;
136 	uint16_t	sid = sctp->sctp_def_stream;
137 	uint32_t	ppid = sctp->sctp_def_ppid;
138 	uint32_t	context = sctp->sctp_def_context;
139 	uint16_t	msg_flags = sctp->sctp_def_flags;
140 	sctp_msg_hdr_t	*sctp_msg_hdr;
141 	uint32_t	msg_len = 0;
142 	uint32_t	timetolive = sctp->sctp_def_timetolive;
143 	conn_t		*connp = sctp->sctp_connp;
144 
145 	ASSERT(DB_TYPE(mproto) == M_PROTO);
146 
147 	mp = mp->b_cont;
148 	ASSERT(mp == NULL || DB_TYPE(mp) == M_DATA);
149 
150 	tudr = (struct T_unitdata_req *)mproto->b_rptr;
151 	ASSERT(tudr->PRIM_type == T_UNITDATA_REQ);
152 
153 	/* Get destination address, if specified */
154 	if (tudr->DEST_length > 0) {
155 		sin_t *sin;
156 		sin6_t *sin6;
157 
158 		sin = (struct sockaddr_in *)
159 		    (mproto->b_rptr + tudr->DEST_offset);
160 		switch (sin->sin_family) {
161 		case AF_INET:
162 			if (tudr->DEST_length < sizeof (*sin)) {
163 				return (EINVAL);
164 			}
165 			IN6_IPADDR_TO_V4MAPPED(sin->sin_addr.s_addr, &tmpaddr);
166 			addr = &tmpaddr;
167 			break;
168 		case AF_INET6:
169 			if (tudr->DEST_length < sizeof (*sin6)) {
170 				return (EINVAL);
171 			}
172 			sin6 = (struct sockaddr_in6 *)
173 			    (mproto->b_rptr + tudr->DEST_offset);
174 			addr = &sin6->sin6_addr;
175 			break;
176 		default:
177 			return (EAFNOSUPPORT);
178 		}
179 		fp = sctp_lookup_faddr(sctp, addr);
180 		if (fp == NULL) {
181 			return (EINVAL);
182 		}
183 	}
184 	/* Ancillary Data? */
185 	if (tudr->OPT_length > 0) {
186 		struct cmsghdr		*cmsg;
187 		char			*cend;
188 		struct sctp_sndrcvinfo	*sndrcv;
189 
190 		cmsg = (struct cmsghdr *)(mproto->b_rptr + tudr->OPT_offset);
191 		cend = ((char *)cmsg + tudr->OPT_length);
192 		ASSERT(cend <= (char *)mproto->b_wptr);
193 
194 		for (;;) {
195 			if ((char *)(cmsg + 1) > cend ||
196 			    ((char *)cmsg + cmsg->cmsg_len) > cend) {
197 				break;
198 			}
199 			if ((cmsg->cmsg_level == IPPROTO_SCTP) &&
200 			    (cmsg->cmsg_type == SCTP_SNDRCV)) {
201 				if (cmsg->cmsg_len <
202 				    (sizeof (*sndrcv) + sizeof (*cmsg))) {
203 					return (EINVAL);
204 				}
205 				sndrcv = (struct sctp_sndrcvinfo *)(cmsg + 1);
206 				sid = sndrcv->sinfo_stream;
207 				msg_flags = sndrcv->sinfo_flags;
208 				ppid = sndrcv->sinfo_ppid;
209 				context = sndrcv->sinfo_context;
210 				timetolive = sndrcv->sinfo_timetolive;
211 				break;
212 			}
213 			if (cmsg->cmsg_len > 0)
214 				cmsg = CMSG_NEXT(cmsg);
215 			else
216 				break;
217 		}
218 	}
219 	if (msg_flags & MSG_ABORT) {
220 		if (mp && mp->b_cont) {
221 			mblk_t *pump = msgpullup(mp, -1);
222 			if (!pump) {
223 				return (ENOMEM);
224 			}
225 			freemsg(mp);
226 			mp = pump;
227 			mproto->b_cont = mp;
228 		}
229 		RUN_SCTP(sctp);
230 		sctp_user_abort(sctp, mp);
231 		freemsg(mproto);
232 		goto done2;
233 	}
234 	if (mp == NULL)
235 		goto done;
236 
237 	RUN_SCTP(sctp);
238 
239 	/* Reject any new data requests if we are shutting down */
240 	if (sctp->sctp_state > SCTPS_ESTABLISHED ||
241 	    (sctp->sctp_connp->conn_state_flags & CONN_CLOSING)) {
242 		error = EPIPE;
243 		goto unlock_done;
244 	}
245 
246 	/* Re-use the mproto to store relevant info. */
247 	ASSERT(MBLKSIZE(mproto) >= sizeof (*sctp_msg_hdr));
248 
249 	mproto->b_rptr = mproto->b_datap->db_base;
250 	mproto->b_wptr = mproto->b_rptr + sizeof (*sctp_msg_hdr);
251 
252 	sctp_msg_hdr = (sctp_msg_hdr_t *)mproto->b_rptr;
253 	bzero(sctp_msg_hdr, sizeof (*sctp_msg_hdr));
254 	sctp_msg_hdr->smh_context = context;
255 	sctp_msg_hdr->smh_sid = sid;
256 	sctp_msg_hdr->smh_ppid = ppid;
257 	sctp_msg_hdr->smh_flags = msg_flags;
258 	sctp_msg_hdr->smh_ttl = MSEC_TO_TICK(timetolive);
259 	sctp_msg_hdr->smh_tob = ddi_get_lbolt64();
260 	for (; mp != NULL; mp = mp->b_cont)
261 		msg_len += MBLKL(mp);
262 	sctp_msg_hdr->smh_msglen = msg_len;
263 
264 	/* User requested specific destination */
265 	SCTP_SET_CHUNK_DEST(mproto, fp);
266 
267 	if (sctp->sctp_state >= SCTPS_COOKIE_ECHOED &&
268 	    sid >= sctp->sctp_num_ostr) {
269 		/* Send sendfail event */
270 		sctp_sendfail_event(sctp, dupmsg(mproto), SCTP_ERR_BAD_SID,
271 		    B_FALSE);
272 		error = EINVAL;
273 		goto unlock_done;
274 	}
275 
276 	/* no data */
277 	if (msg_len == 0) {
278 		sctp_sendfail_event(sctp, dupmsg(mproto),
279 		    SCTP_ERR_NO_USR_DATA, B_FALSE);
280 		error = EINVAL;
281 		goto unlock_done;
282 	}
283 
284 	/* Add it to the unsent list */
285 	if (sctp->sctp_xmit_unsent == NULL) {
286 		sctp->sctp_xmit_unsent = sctp->sctp_xmit_unsent_tail = mproto;
287 	} else {
288 		sctp->sctp_xmit_unsent_tail->b_next = mproto;
289 		sctp->sctp_xmit_unsent_tail = mproto;
290 	}
291 	sctp->sctp_unsent += msg_len;
292 	BUMP_LOCAL(sctp->sctp_msgcount);
293 	/*
294 	 * Notify sockfs if the tx queue is full.
295 	 */
296 	if (SCTP_TXQ_LEN(sctp) >= connp->conn_sndbuf) {
297 		sctp->sctp_txq_full = 1;
298 		sctp->sctp_ulp_xmitted(sctp->sctp_ulpd, B_TRUE);
299 	}
300 	if (sctp->sctp_state == SCTPS_ESTABLISHED)
301 		sctp_output(sctp, UINT_MAX);
302 done2:
303 	WAKE_SCTP(sctp);
304 	return (0);
305 unlock_done:
306 	WAKE_SCTP(sctp);
307 done:
308 	return (error);
309 }
310 
311 /*
312  * While there are messages on sctp_xmit_unsent, detach each one. For each:
313  * allocate space for the chunk header, fill in the data chunk, and fill in
314  * the chunk header. Then append it to sctp_xmit_tail.
315  * Return after appending as many bytes as required (bytes_to_send).
316  * We also return if we've appended one or more chunks, and find a subsequent
317  * unsent message is too big to fit in the segment.
318  */
319 mblk_t *
320 sctp_chunkify(sctp_t *sctp, int mss, int firstseg_len, int bytes_to_send)
321 {
322 	mblk_t			*mp;
323 	mblk_t			*chunk_mp;
324 	mblk_t			*chunk_head;
325 	mblk_t			*chunk_hdr;
326 	mblk_t			*chunk_tail = NULL;
327 	int			count;
328 	int			chunksize;
329 	sctp_data_hdr_t		*sdc;
330 	mblk_t			*mdblk = sctp->sctp_xmit_unsent;
331 	sctp_faddr_t		*fp;
332 	sctp_faddr_t		*fp1;
333 	size_t			xtralen;
334 	sctp_msg_hdr_t		*msg_hdr;
335 	sctp_stack_t		*sctps = sctp->sctp_sctps;
336 	sctp_msg_hdr_t		*next_msg_hdr;
337 	size_t			nextlen;
338 	int			remaining_len = mss - firstseg_len;
339 
340 	ASSERT(remaining_len >= 0);
341 
342 	fp = SCTP_CHUNK_DEST(mdblk);
343 	if (fp == NULL)
344 		fp = sctp->sctp_current;
345 	if (fp->isv4)
346 		xtralen = sctp->sctp_hdr_len + sctps->sctps_wroff_xtra +
347 		    sizeof (*sdc);
348 	else
349 		xtralen = sctp->sctp_hdr6_len + sctps->sctps_wroff_xtra +
350 		    sizeof (*sdc);
351 	count = chunksize = remaining_len - sizeof (*sdc);
352 nextmsg:
353 	next_msg_hdr = (sctp_msg_hdr_t *)sctp->sctp_xmit_unsent->b_rptr;
354 	nextlen = next_msg_hdr->smh_msglen;
355 	/*
356 	 * Will the entire next message fit in the current packet ?
357 	 * if not, leave it on the unsent list.
358 	 */
359 	if ((firstseg_len != 0) && (nextlen > remaining_len))
360 		return (NULL);
361 
362 	chunk_mp = mdblk->b_cont;
363 
364 	/*
365 	 * If this partially chunked, we ignore the next one for now and
366 	 * use the one already present. For the unchunked bits, we use the
367 	 * length of the last chunk.
368 	 */
369 	if (SCTP_IS_MSG_CHUNKED(mdblk)) {
370 		int	chunk_len;
371 
372 		ASSERT(chunk_mp->b_next != NULL);
373 		mdblk->b_cont = chunk_mp->b_next;
374 		chunk_mp->b_next = NULL;
375 		SCTP_MSG_CLEAR_CHUNKED(mdblk);
376 		mp = mdblk->b_cont;
377 		while (mp->b_next != NULL)
378 			mp = mp->b_next;
379 		chunk_len = ntohs(((sctp_data_hdr_t *)mp->b_rptr)->sdh_len);
380 		if (fp->sfa_pmss - chunk_len > sizeof (*sdc))
381 			count = chunksize = fp->sfa_pmss - chunk_len;
382 		else
383 			count = chunksize = fp->sfa_pmss;
384 		count = chunksize = count - sizeof (*sdc);
385 	} else {
386 		msg_hdr = (sctp_msg_hdr_t *)mdblk->b_rptr;
387 		if (SCTP_MSG_TO_BE_ABANDONED(mdblk, msg_hdr, sctp)) {
388 			sctp->sctp_xmit_unsent = mdblk->b_next;
389 			if (sctp->sctp_xmit_unsent == NULL)
390 				sctp->sctp_xmit_unsent_tail = NULL;
391 			ASSERT(sctp->sctp_unsent >= msg_hdr->smh_msglen);
392 			sctp->sctp_unsent -= msg_hdr->smh_msglen;
393 			mdblk->b_next = NULL;
394 			BUMP_LOCAL(sctp->sctp_prsctpdrop);
395 			/*
396 			 * Update ULP the amount of queued data, which is
397 			 * sent-unack'ed + unsent.
398 			 */
399 			if (!SCTP_IS_DETACHED(sctp))
400 				SCTP_TXQ_UPDATE(sctp);
401 			sctp_sendfail_event(sctp, mdblk, 0, B_FALSE);
402 			goto try_next;
403 		}
404 		mdblk->b_cont = NULL;
405 	}
406 	msg_hdr = (sctp_msg_hdr_t *)mdblk->b_rptr;
407 nextchunk:
408 	chunk_head = chunk_mp;
409 	chunk_tail = NULL;
410 
411 	/* Skip as many mblk's as we need */
412 	while (chunk_mp != NULL && ((count - MBLKL(chunk_mp)) >= 0)) {
413 		count -= MBLKL(chunk_mp);
414 		chunk_tail = chunk_mp;
415 		chunk_mp = chunk_mp->b_cont;
416 	}
417 	/* Split the chain, if needed */
418 	if (chunk_mp != NULL) {
419 		if (count > 0) {
420 			mblk_t	*split_mp = dupb(chunk_mp);
421 
422 			if (split_mp == NULL) {
423 				if (mdblk->b_cont == NULL) {
424 					mdblk->b_cont = chunk_head;
425 				} else  {
426 					SCTP_MSG_SET_CHUNKED(mdblk);
427 					ASSERT(chunk_head->b_next == NULL);
428 					chunk_head->b_next = mdblk->b_cont;
429 					mdblk->b_cont = chunk_head;
430 				}
431 				return (sctp->sctp_xmit_tail);
432 			}
433 			if (chunk_tail != NULL) {
434 				chunk_tail->b_cont = split_mp;
435 				chunk_tail = chunk_tail->b_cont;
436 			} else {
437 				chunk_head = chunk_tail = split_mp;
438 			}
439 			chunk_tail->b_wptr = chunk_tail->b_rptr + count;
440 			chunk_mp->b_rptr = chunk_tail->b_wptr;
441 			count = 0;
442 		} else if (chunk_tail == NULL) {
443 			goto next;
444 		} else {
445 			chunk_tail->b_cont = NULL;
446 		}
447 	}
448 	/* Alloc chunk hdr, if needed */
449 	if (DB_REF(chunk_head) > 1 ||
450 	    ((intptr_t)chunk_head->b_rptr) & (SCTP_ALIGN - 1) ||
451 	    MBLKHEAD(chunk_head) < sizeof (*sdc)) {
452 		if ((chunk_hdr = allocb(xtralen, BPRI_MED)) == NULL) {
453 			if (mdblk->b_cont == NULL) {
454 				if (chunk_mp != NULL)
455 					linkb(chunk_head, chunk_mp);
456 				mdblk->b_cont = chunk_head;
457 			} else {
458 				SCTP_MSG_SET_CHUNKED(mdblk);
459 				if (chunk_mp != NULL)
460 					linkb(chunk_head, chunk_mp);
461 				ASSERT(chunk_head->b_next == NULL);
462 				chunk_head->b_next = mdblk->b_cont;
463 				mdblk->b_cont = chunk_head;
464 			}
465 			return (sctp->sctp_xmit_tail);
466 		}
467 		chunk_hdr->b_rptr += xtralen - sizeof (*sdc);
468 		chunk_hdr->b_wptr = chunk_hdr->b_rptr + sizeof (*sdc);
469 		chunk_hdr->b_cont = chunk_head;
470 	} else {
471 		chunk_hdr = chunk_head;
472 		chunk_hdr->b_rptr -= sizeof (*sdc);
473 	}
474 	ASSERT(chunk_hdr->b_datap->db_ref == 1);
475 	sdc = (sctp_data_hdr_t *)chunk_hdr->b_rptr;
476 	sdc->sdh_id = CHUNK_DATA;
477 	sdc->sdh_flags = 0;
478 	sdc->sdh_len = htons(sizeof (*sdc) + chunksize - count);
479 	ASSERT(sdc->sdh_len);
480 	sdc->sdh_sid = htons(msg_hdr->smh_sid);
481 	/*
482 	 * We defer assigning the SSN just before sending the chunk, else
483 	 * if we drop the chunk in sctp_get_msg_to_send(), we would need
484 	 * to send a Forward TSN to let the peer know. Some more comments
485 	 * about this in sctp_impl.h for SCTP_CHUNK_SENT.
486 	 */
487 	sdc->sdh_payload_id = msg_hdr->smh_ppid;
488 
489 	if (mdblk->b_cont == NULL) {
490 		mdblk->b_cont = chunk_hdr;
491 		SCTP_DATA_SET_BBIT(sdc);
492 	} else {
493 		mp = mdblk->b_cont;
494 		while (mp->b_next != NULL)
495 			mp = mp->b_next;
496 		mp->b_next = chunk_hdr;
497 	}
498 
499 	bytes_to_send -= (chunksize - count);
500 	if (chunk_mp != NULL) {
501 next:
502 		count = chunksize = fp->sfa_pmss - sizeof (*sdc);
503 		goto nextchunk;
504 	}
505 	SCTP_DATA_SET_EBIT(sdc);
506 	sctp->sctp_xmit_unsent = mdblk->b_next;
507 	if (mdblk->b_next == NULL) {
508 		sctp->sctp_xmit_unsent_tail = NULL;
509 	}
510 	mdblk->b_next = NULL;
511 
512 	if (sctp->sctp_xmit_tail == NULL) {
513 		sctp->sctp_xmit_head = sctp->sctp_xmit_tail = mdblk;
514 	} else {
515 		mp = sctp->sctp_xmit_tail;
516 		while (mp->b_next != NULL)
517 			mp = mp->b_next;
518 		mp->b_next = mdblk;
519 		mdblk->b_prev = mp;
520 	}
521 try_next:
522 	if (bytes_to_send > 0 && sctp->sctp_xmit_unsent != NULL) {
523 		mdblk = sctp->sctp_xmit_unsent;
524 		fp1 = SCTP_CHUNK_DEST(mdblk);
525 		if (fp1 == NULL)
526 			fp1 = sctp->sctp_current;
527 		if (fp == fp1) {
528 			size_t len = MBLKL(mdblk->b_cont);
529 			if ((count > 0) &&
530 			    ((len > fp->sfa_pmss - sizeof (*sdc)) ||
531 			    (len <= count))) {
532 				count -= sizeof (*sdc);
533 				count = chunksize = count - (count & 0x3);
534 			} else {
535 				count = chunksize = fp->sfa_pmss -
536 				    sizeof (*sdc);
537 			}
538 		} else {
539 			if (fp1->isv4)
540 				xtralen = sctp->sctp_hdr_len;
541 			else
542 				xtralen = sctp->sctp_hdr6_len;
543 			xtralen += sctps->sctps_wroff_xtra + sizeof (*sdc);
544 			count = chunksize = fp1->sfa_pmss - sizeof (*sdc);
545 			fp = fp1;
546 		}
547 		goto nextmsg;
548 	}
549 	return (sctp->sctp_xmit_tail);
550 }
551 
552 void
553 sctp_free_msg(mblk_t *ump)
554 {
555 	mblk_t *mp, *nmp;
556 
557 	for (mp = ump->b_cont; mp; mp = nmp) {
558 		nmp = mp->b_next;
559 		mp->b_next = mp->b_prev = NULL;
560 		freemsg(mp);
561 	}
562 	ASSERT(!ump->b_prev);
563 	ump->b_next = NULL;
564 	freeb(ump);
565 }
566 
567 mblk_t *
568 sctp_add_proto_hdr(sctp_t *sctp, sctp_faddr_t *fp, mblk_t *mp, int sacklen,
569     int *error)
570 {
571 	int hdrlen;
572 	uchar_t *hdr;
573 	int isv4 = fp->isv4;
574 	sctp_stack_t	*sctps = sctp->sctp_sctps;
575 
576 	if (error != NULL)
577 		*error = 0;
578 
579 	if (isv4) {
580 		hdrlen = sctp->sctp_hdr_len;
581 		hdr = sctp->sctp_iphc;
582 	} else {
583 		hdrlen = sctp->sctp_hdr6_len;
584 		hdr = sctp->sctp_iphc6;
585 	}
586 	/*
587 	 * A reject|blackhole could mean that the address is 'down'. Similarly,
588 	 * it is possible that the address went down, we tried to send an
589 	 * heartbeat and ended up setting fp->saddr as unspec because we
590 	 * didn't have any usable source address.  In either case
591 	 * sctp_get_dest() will try find an IRE, if available, and set
592 	 * the source address, if needed.  If we still don't have any
593 	 * usable source address, fp->state will be SCTP_FADDRS_UNREACH and
594 	 * we return EHOSTUNREACH.
595 	 */
596 	ASSERT(fp->ixa->ixa_ire != NULL);
597 	if ((fp->ixa->ixa_ire->ire_flags & (RTF_REJECT|RTF_BLACKHOLE)) ||
598 	    SCTP_IS_ADDR_UNSPEC(fp->isv4, fp->saddr)) {
599 		sctp_get_dest(sctp, fp);
600 		if (fp->state == SCTP_FADDRS_UNREACH) {
601 			if (error != NULL)
602 				*error = EHOSTUNREACH;
603 			return (NULL);
604 		}
605 	}
606 	/* Copy in IP header. */
607 	if ((mp->b_rptr - mp->b_datap->db_base) <
608 	    (sctps->sctps_wroff_xtra + hdrlen + sacklen) || DB_REF(mp) > 2) {
609 		mblk_t *nmp;
610 
611 		/*
612 		 * This can happen if IP headers are adjusted after
613 		 * data was moved into chunks, or during retransmission,
614 		 * or things like snoop is running.
615 		 */
616 		nmp = allocb(sctps->sctps_wroff_xtra + hdrlen + sacklen,
617 		    BPRI_MED);
618 		if (nmp == NULL) {
619 			if (error !=  NULL)
620 				*error = ENOMEM;
621 			return (NULL);
622 		}
623 		nmp->b_rptr += sctps->sctps_wroff_xtra;
624 		nmp->b_wptr = nmp->b_rptr + hdrlen + sacklen;
625 		nmp->b_cont = mp;
626 		mp = nmp;
627 	} else {
628 		mp->b_rptr -= (hdrlen + sacklen);
629 	}
630 	bcopy(hdr, mp->b_rptr, hdrlen);
631 	if (sacklen) {
632 		sctp_fill_sack(sctp, mp->b_rptr + hdrlen, sacklen);
633 	}
634 	if (fp != sctp->sctp_current) {
635 		/* change addresses in header */
636 		if (isv4) {
637 			ipha_t *iph = (ipha_t *)mp->b_rptr;
638 
639 			IN6_V4MAPPED_TO_IPADDR(&fp->faddr, iph->ipha_dst);
640 			if (!IN6_IS_ADDR_V4MAPPED_ANY(&fp->saddr)) {
641 				IN6_V4MAPPED_TO_IPADDR(&fp->saddr,
642 				    iph->ipha_src);
643 			} else if (sctp->sctp_bound_to_all) {
644 				iph->ipha_src = INADDR_ANY;
645 			}
646 		} else {
647 			ip6_t *ip6h = (ip6_t *)mp->b_rptr;
648 
649 			ip6h->ip6_dst = fp->faddr;
650 			if (!IN6_IS_ADDR_UNSPECIFIED(&fp->saddr)) {
651 				ip6h->ip6_src = fp->saddr;
652 			} else if (sctp->sctp_bound_to_all) {
653 				ip6h->ip6_src = ipv6_all_zeros;
654 			}
655 		}
656 	}
657 	return (mp);
658 }
659 
660 /*
661  * SCTP requires every chunk to be padded so that the total length
662  * is a multiple of SCTP_ALIGN.  This function returns a mblk with
663  * the specified pad length.
664  */
665 static mblk_t *
666 sctp_get_padding(sctp_t *sctp, int pad)
667 {
668 	mblk_t *fill;
669 
670 	ASSERT(pad < SCTP_ALIGN);
671 	ASSERT(sctp->sctp_pad_mp != NULL);
672 	if ((fill = dupb(sctp->sctp_pad_mp)) != NULL) {
673 		fill->b_wptr += pad;
674 		return (fill);
675 	}
676 
677 	/*
678 	 * The memory saving path of reusing the sctp_pad_mp
679 	 * fails may be because it has been dupb() too
680 	 * many times (DBLK_REFMAX).  Use the memory consuming
681 	 * path of allocating the pad mblk.
682 	 */
683 	if ((fill = allocb(SCTP_ALIGN, BPRI_MED)) != NULL) {
684 		/* Zero it out.  SCTP_ALIGN is sizeof (int32_t) */
685 		*(int32_t *)fill->b_rptr = 0;
686 		fill->b_wptr += pad;
687 	}
688 	return (fill);
689 }
690 
691 static mblk_t *
692 sctp_find_fast_rexmit_mblks(sctp_t *sctp, int *total, sctp_faddr_t **fp)
693 {
694 	mblk_t		*meta;
695 	mblk_t		*start_mp = NULL;
696 	mblk_t		*end_mp = NULL;
697 	mblk_t		*mp, *nmp;
698 	mblk_t		*fill;
699 	sctp_data_hdr_t	*sdh;
700 	int		msglen;
701 	int		extra;
702 	sctp_msg_hdr_t	*msg_hdr;
703 	sctp_faddr_t	*old_fp = NULL;
704 	sctp_faddr_t	*chunk_fp;
705 	sctp_stack_t	*sctps = sctp->sctp_sctps;
706 
707 	for (meta = sctp->sctp_xmit_head; meta != NULL; meta = meta->b_next) {
708 		msg_hdr = (sctp_msg_hdr_t *)meta->b_rptr;
709 		if (SCTP_IS_MSG_ABANDONED(meta) ||
710 		    SCTP_MSG_TO_BE_ABANDONED(meta, msg_hdr, sctp)) {
711 			continue;
712 		}
713 		for (mp = meta->b_cont; mp != NULL; mp = mp->b_next) {
714 			if (SCTP_CHUNK_WANT_REXMIT(mp)) {
715 				/*
716 				 * Use the same peer address to do fast
717 				 * retransmission.  If the original peer
718 				 * address is dead, switch to the current
719 				 * one.  Record the old one so that we
720 				 * will pick the chunks sent to the old
721 				 * one for fast retransmission.
722 				 */
723 				chunk_fp = SCTP_CHUNK_DEST(mp);
724 				if (*fp == NULL) {
725 					*fp = chunk_fp;
726 					if ((*fp)->state != SCTP_FADDRS_ALIVE) {
727 						old_fp = *fp;
728 						*fp = sctp->sctp_current;
729 					}
730 				} else if (old_fp == NULL && *fp != chunk_fp) {
731 					continue;
732 				} else if (old_fp != NULL &&
733 				    old_fp != chunk_fp) {
734 					continue;
735 				}
736 
737 				sdh = (sctp_data_hdr_t *)mp->b_rptr;
738 				msglen = ntohs(sdh->sdh_len);
739 				if ((extra = msglen & (SCTP_ALIGN - 1)) != 0) {
740 					extra = SCTP_ALIGN - extra;
741 				}
742 
743 				/*
744 				 * We still return at least the first message
745 				 * even if that message cannot fit in as
746 				 * PMTU may have changed.
747 				 */
748 				if (*total + msglen + extra >
749 				    (*fp)->sfa_pmss && start_mp != NULL) {
750 					return (start_mp);
751 				}
752 				if ((nmp = dupmsg(mp)) == NULL)
753 					return (start_mp);
754 				if (extra > 0) {
755 					fill = sctp_get_padding(sctp, extra);
756 					if (fill != NULL) {
757 						linkb(nmp, fill);
758 					} else {
759 						return (start_mp);
760 					}
761 				}
762 				BUMP_MIB(&sctps->sctps_mib, sctpOutFastRetrans);
763 				BUMP_LOCAL(sctp->sctp_rxtchunks);
764 				SCTP_CHUNK_CLEAR_REXMIT(mp);
765 				if (start_mp == NULL) {
766 					start_mp = nmp;
767 				} else {
768 					linkb(end_mp, nmp);
769 				}
770 				end_mp = nmp;
771 				*total += msglen + extra;
772 				dprint(2, ("sctp_find_fast_rexmit_mblks: "
773 				    "tsn %x\n", sdh->sdh_tsn));
774 			}
775 		}
776 	}
777 	/* Clear the flag as there is no more message to be fast rexmitted. */
778 	sctp->sctp_chk_fast_rexmit = B_FALSE;
779 	return (start_mp);
780 }
781 
782 /* A debug function just to make sure that a mblk chain is not broken */
783 #ifdef	DEBUG
784 static boolean_t
785 sctp_verify_chain(mblk_t *head, mblk_t *tail)
786 {
787 	mblk_t	*mp = head;
788 
789 	if (head == NULL || tail == NULL)
790 		return (B_TRUE);
791 	while (mp != NULL) {
792 		if (mp == tail)
793 			return (B_TRUE);
794 		mp = mp->b_next;
795 	}
796 	return (B_FALSE);
797 }
798 #endif
799 
800 /*
801  * Gets the next unsent chunk to transmit. Messages that are abandoned are
802  * skipped. A message can be abandoned if it has a non-zero timetolive and
803  * transmission has not yet started or if it is a partially reliable
804  * message and its time is up (assuming we are PR-SCTP aware).
805  * We only return a chunk if it will fit entirely in the current packet.
806  * 'cansend' is used to determine if need to try and chunkify messages from
807  * the unsent list, if any, and also as an input to sctp_chunkify() if so.
808  *
809  * firstseg_len indicates the space already used, cansend represents remaining
810  * space in the window, ((sfa_pmss - firstseg_len) can therefore reasonably
811  * be used to compute the cansend arg).
812  */
813 mblk_t *
814 sctp_get_msg_to_send(sctp_t *sctp, mblk_t **mp, mblk_t *meta, int  *error,
815     int32_t firstseg_len, uint32_t cansend, sctp_faddr_t *fp)
816 {
817 	mblk_t		*mp1;
818 	sctp_msg_hdr_t	*msg_hdr;
819 	mblk_t		*tmp_meta;
820 	sctp_faddr_t	*fp1;
821 
822 	ASSERT(error != NULL && mp != NULL);
823 	*error = 0;
824 
825 	ASSERT(sctp->sctp_current != NULL);
826 
827 chunkified:
828 	while (meta != NULL) {
829 		tmp_meta = meta->b_next;
830 		msg_hdr = (sctp_msg_hdr_t *)meta->b_rptr;
831 		mp1 = meta->b_cont;
832 		if (SCTP_IS_MSG_ABANDONED(meta))
833 			goto next_msg;
834 		if (!SCTP_MSG_TO_BE_ABANDONED(meta, msg_hdr, sctp)) {
835 			while (mp1 != NULL) {
836 				if (SCTP_CHUNK_CANSEND(mp1)) {
837 					*mp = mp1;
838 #ifdef	DEBUG
839 					ASSERT(sctp_verify_chain(
840 					    sctp->sctp_xmit_head, meta));
841 #endif
842 					return (meta);
843 				}
844 				mp1 = mp1->b_next;
845 			}
846 			goto next_msg;
847 		}
848 		/*
849 		 * If we come here and the first chunk is sent, then we
850 		 * we are PR-SCTP aware, in which case if the cumulative
851 		 * TSN has moved upto or beyond the first chunk (which
852 		 * means all the previous messages have been cumulative
853 		 * SACK'd), then we send a Forward TSN with the last
854 		 * chunk that was sent in this message. If we can't send
855 		 * a Forward TSN because previous non-abandoned messages
856 		 * have not been acked then we will defer the Forward TSN
857 		 * to sctp_rexmit() or sctp_cumack().
858 		 */
859 		if (SCTP_CHUNK_ISSENT(mp1)) {
860 			*error = sctp_check_abandoned_msg(sctp, meta);
861 			if (*error != 0) {
862 #ifdef	DEBUG
863 				ASSERT(sctp_verify_chain(sctp->sctp_xmit_head,
864 				    sctp->sctp_xmit_tail));
865 #endif
866 				return (NULL);
867 			}
868 			goto next_msg;
869 		}
870 		BUMP_LOCAL(sctp->sctp_prsctpdrop);
871 		ASSERT(sctp->sctp_unsent >= msg_hdr->smh_msglen);
872 		if (meta->b_prev == NULL) {
873 			ASSERT(sctp->sctp_xmit_head == meta);
874 			sctp->sctp_xmit_head = tmp_meta;
875 			if (sctp->sctp_xmit_tail == meta)
876 				sctp->sctp_xmit_tail = tmp_meta;
877 			meta->b_next = NULL;
878 			if (tmp_meta != NULL)
879 				tmp_meta->b_prev = NULL;
880 		} else if (meta->b_next == NULL) {
881 			if (sctp->sctp_xmit_tail == meta)
882 				sctp->sctp_xmit_tail = meta->b_prev;
883 			meta->b_prev->b_next = NULL;
884 			meta->b_prev = NULL;
885 		} else {
886 			meta->b_prev->b_next = tmp_meta;
887 			tmp_meta->b_prev = meta->b_prev;
888 			if (sctp->sctp_xmit_tail == meta)
889 				sctp->sctp_xmit_tail = tmp_meta;
890 			meta->b_prev = NULL;
891 			meta->b_next = NULL;
892 		}
893 		sctp->sctp_unsent -= msg_hdr->smh_msglen;
894 		/*
895 		 * Update ULP the amount of queued data, which is
896 		 * sent-unack'ed + unsent.
897 		 */
898 		if (!SCTP_IS_DETACHED(sctp))
899 			SCTP_TXQ_UPDATE(sctp);
900 		sctp_sendfail_event(sctp, meta, 0, B_TRUE);
901 next_msg:
902 		meta = tmp_meta;
903 	}
904 	/* chunkify, if needed */
905 	if (cansend > 0 && sctp->sctp_xmit_unsent != NULL) {
906 		ASSERT(sctp->sctp_unsent > 0);
907 		if (fp == NULL) {
908 			fp = SCTP_CHUNK_DEST(sctp->sctp_xmit_unsent);
909 			if (fp == NULL || fp->state != SCTP_FADDRS_ALIVE)
910 				fp = sctp->sctp_current;
911 		} else {
912 			/*
913 			 * If user specified destination, try to honor that.
914 			 */
915 			fp1 = SCTP_CHUNK_DEST(sctp->sctp_xmit_unsent);
916 			if (fp1 != NULL && fp1->state == SCTP_FADDRS_ALIVE &&
917 			    fp1 != fp) {
918 				goto chunk_done;
919 			}
920 		}
921 		meta = sctp_chunkify(sctp, fp->sfa_pmss, firstseg_len, cansend);
922 		if (meta == NULL)
923 			goto chunk_done;
924 		/*
925 		 * sctp_chunkify() won't advance sctp_xmit_tail if it adds
926 		 * new chunk(s) to the tail, so we need to skip the
927 		 * sctp_xmit_tail, which would have already been processed.
928 		 * This could happen when there is unacked chunks, but
929 		 * nothing new to send.
930 		 * When sctp_chunkify() is called when the transmit queue
931 		 * is empty then we need to start from sctp_xmit_tail.
932 		 */
933 		if (SCTP_CHUNK_ISSENT(sctp->sctp_xmit_tail->b_cont)) {
934 #ifdef	DEBUG
935 			mp1 = sctp->sctp_xmit_tail->b_cont;
936 			while (mp1 != NULL) {
937 				ASSERT(!SCTP_CHUNK_CANSEND(mp1));
938 				mp1 = mp1->b_next;
939 			}
940 #endif
941 			if ((meta = sctp->sctp_xmit_tail->b_next) == NULL)
942 				goto chunk_done;
943 		}
944 		goto chunkified;
945 	}
946 chunk_done:
947 #ifdef	DEBUG
948 	ASSERT(sctp_verify_chain(sctp->sctp_xmit_head, sctp->sctp_xmit_tail));
949 #endif
950 	return (NULL);
951 }
952 
953 void
954 sctp_fast_rexmit(sctp_t *sctp)
955 {
956 	mblk_t		*mp, *head;
957 	int		pktlen = 0;
958 	sctp_faddr_t	*fp = NULL;
959 	sctp_stack_t	*sctps = sctp->sctp_sctps;
960 
961 	ASSERT(sctp->sctp_xmit_head != NULL);
962 	mp = sctp_find_fast_rexmit_mblks(sctp, &pktlen, &fp);
963 	if (mp == NULL) {
964 		SCTP_KSTAT(sctps, sctp_fr_not_found);
965 		return;
966 	}
967 	if ((head = sctp_add_proto_hdr(sctp, fp, mp, 0, NULL)) == NULL) {
968 		freemsg(mp);
969 		SCTP_KSTAT(sctps, sctp_fr_add_hdr);
970 		return;
971 	}
972 	if ((pktlen > fp->sfa_pmss) && fp->isv4) {
973 		ipha_t *iph = (ipha_t *)head->b_rptr;
974 
975 		iph->ipha_fragment_offset_and_flags = 0;
976 	}
977 
978 	sctp_set_iplen(sctp, head, fp->ixa);
979 	(void) conn_ip_output(head, fp->ixa);
980 	BUMP_LOCAL(sctp->sctp_opkts);
981 	sctp->sctp_active = fp->lastactive = ddi_get_lbolt64();
982 }
983 
984 void
985 sctp_output(sctp_t *sctp, uint_t num_pkt)
986 {
987 	mblk_t			*mp = NULL;
988 	mblk_t			*nmp;
989 	mblk_t			*head;
990 	mblk_t			*meta = sctp->sctp_xmit_tail;
991 	mblk_t			*fill = NULL;
992 	uint16_t 		chunklen;
993 	uint32_t 		cansend;
994 	int32_t			seglen;
995 	int32_t			xtralen;
996 	int32_t			sacklen;
997 	int32_t			pad = 0;
998 	int32_t			pathmax;
999 	int			extra;
1000 	int64_t			now = ddi_get_lbolt64();
1001 	sctp_faddr_t		*fp;
1002 	sctp_faddr_t		*lfp;
1003 	sctp_data_hdr_t		*sdc;
1004 	int			error;
1005 	boolean_t		notsent = B_TRUE;
1006 	sctp_stack_t		*sctps = sctp->sctp_sctps;
1007 
1008 	if (sctp->sctp_ftsn == sctp->sctp_lastacked + 1) {
1009 		sacklen = 0;
1010 	} else {
1011 		/* send a SACK chunk */
1012 		sacklen = sizeof (sctp_chunk_hdr_t) +
1013 		    sizeof (sctp_sack_chunk_t) +
1014 		    (sizeof (sctp_sack_frag_t) * sctp->sctp_sack_gaps);
1015 		lfp = sctp->sctp_lastdata;
1016 		ASSERT(lfp != NULL);
1017 		if (lfp->state != SCTP_FADDRS_ALIVE)
1018 			lfp = sctp->sctp_current;
1019 	}
1020 
1021 	cansend = sctp->sctp_frwnd;
1022 	if (sctp->sctp_unsent < cansend)
1023 		cansend = sctp->sctp_unsent;
1024 
1025 	/*
1026 	 * Start persist timer if unable to send or when
1027 	 * trying to send into a zero window. This timer
1028 	 * ensures the blocked send attempt is retried.
1029 	 */
1030 	if ((cansend < sctp->sctp_current->sfa_pmss / 2) &&
1031 	    (sctp->sctp_unacked != 0) &&
1032 	    (sctp->sctp_unacked < sctp->sctp_current->sfa_pmss) &&
1033 	    !sctp->sctp_ndelay ||
1034 	    (cansend == 0 && sctp->sctp_unacked == 0 &&
1035 	    sctp->sctp_unsent != 0)) {
1036 		head = NULL;
1037 		fp = sctp->sctp_current;
1038 		goto unsent_data;
1039 	}
1040 	if (meta != NULL)
1041 		mp = meta->b_cont;
1042 	while (cansend > 0 && num_pkt-- != 0) {
1043 		pad = 0;
1044 
1045 		/*
1046 		 * Find first segment eligible for transmit.
1047 		 */
1048 		while (mp != NULL) {
1049 			if (SCTP_CHUNK_CANSEND(mp))
1050 				break;
1051 			mp = mp->b_next;
1052 		}
1053 		if (mp == NULL) {
1054 			meta = sctp_get_msg_to_send(sctp, &mp,
1055 			    meta == NULL ? NULL : meta->b_next, &error, sacklen,
1056 			    cansend, NULL);
1057 			if (error != 0 || meta == NULL) {
1058 				head = NULL;
1059 				fp = sctp->sctp_current;
1060 				goto unsent_data;
1061 			}
1062 			sctp->sctp_xmit_tail =  meta;
1063 		}
1064 
1065 		sdc = (sctp_data_hdr_t *)mp->b_rptr;
1066 		seglen = ntohs(sdc->sdh_len);
1067 		xtralen = sizeof (*sdc);
1068 		chunklen = seglen - xtralen;
1069 
1070 		/*
1071 		 * Check rwnd.
1072 		 */
1073 		if (chunklen > cansend) {
1074 			head = NULL;
1075 			fp = SCTP_CHUNK_DEST(meta);
1076 			if (fp == NULL || fp->state != SCTP_FADDRS_ALIVE)
1077 				fp = sctp->sctp_current;
1078 			goto unsent_data;
1079 		}
1080 		if ((extra = seglen & (SCTP_ALIGN - 1)) != 0)
1081 			extra = SCTP_ALIGN - extra;
1082 
1083 		/*
1084 		 * Pick destination address, and check cwnd.
1085 		 */
1086 		if (sacklen > 0 && (seglen + extra <= lfp->cwnd - lfp->suna) &&
1087 		    (seglen + sacklen + extra <= lfp->sfa_pmss)) {
1088 			/*
1089 			 * Only include SACK chunk if it can be bundled
1090 			 * with a data chunk, and sent to sctp_lastdata.
1091 			 */
1092 			pathmax = lfp->cwnd - lfp->suna;
1093 
1094 			fp = lfp;
1095 			if ((nmp = dupmsg(mp)) == NULL) {
1096 				head = NULL;
1097 				goto unsent_data;
1098 			}
1099 			SCTP_CHUNK_CLEAR_FLAGS(nmp);
1100 			head = sctp_add_proto_hdr(sctp, fp, nmp, sacklen,
1101 			    &error);
1102 			if (head == NULL) {
1103 				/*
1104 				 * If none of the source addresses are
1105 				 * available (i.e error == EHOSTUNREACH),
1106 				 * pretend we have sent the data. We will
1107 				 * eventually time out trying to retramsmit
1108 				 * the data if the interface never comes up.
1109 				 * If we have already sent some stuff (i.e.,
1110 				 * notsent is B_FALSE) then we are fine, else
1111 				 * just mark this packet as sent.
1112 				 */
1113 				if (notsent && error == EHOSTUNREACH) {
1114 					SCTP_CHUNK_SENT(sctp, mp, sdc,
1115 					    fp, chunklen, meta);
1116 				}
1117 				freemsg(nmp);
1118 				SCTP_KSTAT(sctps, sctp_output_failed);
1119 				goto unsent_data;
1120 			}
1121 			seglen += sacklen;
1122 			xtralen += sacklen;
1123 			sacklen = 0;
1124 		} else {
1125 			fp = SCTP_CHUNK_DEST(meta);
1126 			if (fp == NULL || fp->state != SCTP_FADDRS_ALIVE)
1127 				fp = sctp->sctp_current;
1128 			/*
1129 			 * If we haven't sent data to this destination for
1130 			 * a while, do slow start again.
1131 			 */
1132 			if (now - fp->lastactive > fp->rto) {
1133 				SET_CWND(fp, fp->sfa_pmss,
1134 				    sctps->sctps_slow_start_after_idle);
1135 			}
1136 
1137 			pathmax = fp->cwnd - fp->suna;
1138 			if (seglen + extra > pathmax) {
1139 				head = NULL;
1140 				goto unsent_data;
1141 			}
1142 			if ((nmp = dupmsg(mp)) == NULL) {
1143 				head = NULL;
1144 				goto unsent_data;
1145 			}
1146 			SCTP_CHUNK_CLEAR_FLAGS(nmp);
1147 			head = sctp_add_proto_hdr(sctp, fp, nmp, 0, &error);
1148 			if (head == NULL) {
1149 				/*
1150 				 * If none of the source addresses are
1151 				 * available (i.e error == EHOSTUNREACH),
1152 				 * pretend we have sent the data. We will
1153 				 * eventually time out trying to retramsmit
1154 				 * the data if the interface never comes up.
1155 				 * If we have already sent some stuff (i.e.,
1156 				 * notsent is B_FALSE) then we are fine, else
1157 				 * just mark this packet as sent.
1158 				 */
1159 				if (notsent && error == EHOSTUNREACH) {
1160 					SCTP_CHUNK_SENT(sctp, mp, sdc,
1161 					    fp, chunklen, meta);
1162 				}
1163 				freemsg(nmp);
1164 				SCTP_KSTAT(sctps, sctp_output_failed);
1165 				goto unsent_data;
1166 			}
1167 		}
1168 		fp->lastactive = now;
1169 		if (pathmax > fp->sfa_pmss)
1170 			pathmax = fp->sfa_pmss;
1171 		SCTP_CHUNK_SENT(sctp, mp, sdc, fp, chunklen, meta);
1172 		mp = mp->b_next;
1173 
1174 		/* Use this chunk to measure RTT? */
1175 		if (sctp->sctp_out_time == 0) {
1176 			sctp->sctp_out_time = now;
1177 			sctp->sctp_rtt_tsn = sctp->sctp_ltsn - 1;
1178 			ASSERT(sctp->sctp_rtt_tsn == ntohl(sdc->sdh_tsn));
1179 		}
1180 		if (extra > 0) {
1181 			fill = sctp_get_padding(sctp, extra);
1182 			if (fill != NULL) {
1183 				linkb(head, fill);
1184 				pad = extra;
1185 				seglen += extra;
1186 			} else {
1187 				goto unsent_data;
1188 			}
1189 		}
1190 		/*
1191 		 * Bundle chunks. We linkb() the chunks together to send
1192 		 * downstream in a single packet.
1193 		 * Partial chunks MUST NOT be bundled with full chunks, so we
1194 		 * rely on sctp_get_msg_to_send() to only return messages that
1195 		 * will fit entirely in the current packet.
1196 		 */
1197 		while (seglen < pathmax) {
1198 			int32_t		new_len;
1199 			int32_t		new_xtralen;
1200 
1201 			while (mp != NULL) {
1202 				if (SCTP_CHUNK_CANSEND(mp))
1203 					break;
1204 				mp = mp->b_next;
1205 			}
1206 			if (mp == NULL) {
1207 				meta = sctp_get_msg_to_send(sctp, &mp,
1208 				    meta->b_next, &error, seglen,
1209 				    (seglen - xtralen) >= cansend ? 0 :
1210 				    cansend - seglen, fp);
1211 				if (error != 0)
1212 					break;
1213 				/* If no more eligible chunks, cease bundling */
1214 				if (meta == NULL)
1215 					break;
1216 				sctp->sctp_xmit_tail =  meta;
1217 			}
1218 			ASSERT(mp != NULL);
1219 			if (!SCTP_CHUNK_ISSENT(mp) && SCTP_CHUNK_DEST(meta) &&
1220 			    fp != SCTP_CHUNK_DEST(meta)) {
1221 				break;
1222 			}
1223 			sdc = (sctp_data_hdr_t *)mp->b_rptr;
1224 			chunklen = ntohs(sdc->sdh_len);
1225 			if ((extra = chunklen  & (SCTP_ALIGN - 1)) != 0)
1226 				extra = SCTP_ALIGN - extra;
1227 
1228 			new_len = seglen + chunklen;
1229 			new_xtralen = xtralen + sizeof (*sdc);
1230 			chunklen -= sizeof (*sdc);
1231 
1232 			if (new_len - new_xtralen > cansend ||
1233 			    new_len + extra > pathmax) {
1234 				break;
1235 			}
1236 			if ((nmp = dupmsg(mp)) == NULL)
1237 				break;
1238 			if (extra > 0) {
1239 				fill = sctp_get_padding(sctp, extra);
1240 				if (fill != NULL) {
1241 					pad += extra;
1242 					new_len += extra;
1243 					linkb(nmp, fill);
1244 				} else {
1245 					freemsg(nmp);
1246 					break;
1247 				}
1248 			}
1249 			seglen = new_len;
1250 			xtralen = new_xtralen;
1251 			SCTP_CHUNK_CLEAR_FLAGS(nmp);
1252 			SCTP_CHUNK_SENT(sctp, mp, sdc, fp, chunklen, meta);
1253 			linkb(head, nmp);
1254 			mp = mp->b_next;
1255 		}
1256 		if ((seglen > fp->sfa_pmss) && fp->isv4) {
1257 			ipha_t *iph = (ipha_t *)head->b_rptr;
1258 
1259 			/*
1260 			 * Path MTU is different from what we thought it would
1261 			 * be when we created chunks, or IP headers have grown.
1262 			 * Need to clear the DF bit.
1263 			 */
1264 			iph->ipha_fragment_offset_and_flags = 0;
1265 		}
1266 		/* xmit segment */
1267 		ASSERT(cansend >= seglen - pad - xtralen);
1268 		cansend -= (seglen - pad - xtralen);
1269 		dprint(2, ("sctp_output: Sending packet %d bytes, tsn %x "
1270 		    "ssn %d to %p (rwnd %d, cansend %d, lastack_rxd %x)\n",
1271 		    seglen - xtralen, ntohl(sdc->sdh_tsn),
1272 		    ntohs(sdc->sdh_ssn), (void *)fp, sctp->sctp_frwnd,
1273 		    cansend, sctp->sctp_lastack_rxd));
1274 		sctp_set_iplen(sctp, head, fp->ixa);
1275 		(void) conn_ip_output(head, fp->ixa);
1276 		BUMP_LOCAL(sctp->sctp_opkts);
1277 		/* arm rto timer (if not set) */
1278 		if (!fp->timer_running)
1279 			SCTP_FADDR_TIMER_RESTART(sctp, fp, fp->rto);
1280 		notsent = B_FALSE;
1281 	}
1282 	sctp->sctp_active = now;
1283 	return;
1284 unsent_data:
1285 	/* arm persist timer (if rto timer not set) */
1286 	if (!fp->timer_running)
1287 		SCTP_FADDR_TIMER_RESTART(sctp, fp, fp->rto);
1288 	if (head != NULL)
1289 		freemsg(head);
1290 }
1291 
1292 /*
1293  * The following two functions initialize and destroy the cache
1294  * associated with the sets used for PR-SCTP.
1295  */
1296 void
1297 sctp_ftsn_sets_init(void)
1298 {
1299 	sctp_kmem_ftsn_set_cache = kmem_cache_create("sctp_ftsn_set_cache",
1300 	    sizeof (sctp_ftsn_set_t), 0, NULL, NULL, NULL, NULL,
1301 	    NULL, 0);
1302 }
1303 
1304 void
1305 sctp_ftsn_sets_fini(void)
1306 {
1307 	kmem_cache_destroy(sctp_kmem_ftsn_set_cache);
1308 }
1309 
1310 
1311 /* Free PR-SCTP sets */
1312 void
1313 sctp_free_ftsn_set(sctp_ftsn_set_t *s)
1314 {
1315 	sctp_ftsn_set_t *p;
1316 
1317 	while (s != NULL) {
1318 		p = s->next;
1319 		s->next = NULL;
1320 		kmem_cache_free(sctp_kmem_ftsn_set_cache, s);
1321 		s = p;
1322 	}
1323 }
1324 
1325 /*
1326  * Given a message meta block, meta, this routine creates or modifies
1327  * the set that will be used to generate a Forward TSN chunk. If the
1328  * entry for stream id, sid, for this message already exists, the
1329  * sequence number, ssn, is updated if it is greater than the existing
1330  * one. If an entry for this sid does not exist, one is created if
1331  * the size does not exceed fp->sfa_pmss. We return false in case
1332  * or an error.
1333  */
1334 boolean_t
1335 sctp_add_ftsn_set(sctp_ftsn_set_t **s, sctp_faddr_t *fp, mblk_t *meta,
1336     uint_t *nsets, uint32_t *slen)
1337 {
1338 	sctp_ftsn_set_t		*p;
1339 	sctp_msg_hdr_t		*msg_hdr = (sctp_msg_hdr_t *)meta->b_rptr;
1340 	uint16_t		sid = htons(msg_hdr->smh_sid);
1341 	/* msg_hdr->smh_ssn is already in NBO */
1342 	uint16_t		ssn = msg_hdr->smh_ssn;
1343 
1344 	ASSERT(s != NULL && nsets != NULL);
1345 	ASSERT((*nsets == 0 && *s == NULL) || (*nsets > 0 && *s != NULL));
1346 
1347 	if (*s == NULL) {
1348 		ASSERT((*slen + sizeof (uint32_t)) <= fp->sfa_pmss);
1349 		*s = kmem_cache_alloc(sctp_kmem_ftsn_set_cache, KM_NOSLEEP);
1350 		if (*s == NULL)
1351 			return (B_FALSE);
1352 		(*s)->ftsn_entries.ftsn_sid = sid;
1353 		(*s)->ftsn_entries.ftsn_ssn = ssn;
1354 		(*s)->next = NULL;
1355 		*nsets = 1;
1356 		*slen += sizeof (uint32_t);
1357 		return (B_TRUE);
1358 	}
1359 	for (p = *s; p->next != NULL; p = p->next) {
1360 		if (p->ftsn_entries.ftsn_sid == sid) {
1361 			if (SSN_GT(ssn, p->ftsn_entries.ftsn_ssn))
1362 				p->ftsn_entries.ftsn_ssn = ssn;
1363 			return (B_TRUE);
1364 		}
1365 	}
1366 	/* the last one */
1367 	if (p->ftsn_entries.ftsn_sid == sid) {
1368 		if (SSN_GT(ssn, p->ftsn_entries.ftsn_ssn))
1369 			p->ftsn_entries.ftsn_ssn = ssn;
1370 	} else {
1371 		if ((*slen + sizeof (uint32_t)) > fp->sfa_pmss)
1372 			return (B_FALSE);
1373 		p->next = kmem_cache_alloc(sctp_kmem_ftsn_set_cache,
1374 		    KM_NOSLEEP);
1375 		if (p->next == NULL)
1376 			return (B_FALSE);
1377 		p = p->next;
1378 		p->ftsn_entries.ftsn_sid = sid;
1379 		p->ftsn_entries.ftsn_ssn = ssn;
1380 		p->next = NULL;
1381 		(*nsets)++;
1382 		*slen += sizeof (uint32_t);
1383 	}
1384 	return (B_TRUE);
1385 }
1386 
1387 /*
1388  * Given a set of stream id - sequence number pairs, this routing creates
1389  * a Forward TSN chunk. The cumulative TSN (advanced peer ack point)
1390  * for the chunk is obtained from sctp->sctp_adv_pap. The caller
1391  * will add the IP/SCTP header.
1392  */
1393 mblk_t *
1394 sctp_make_ftsn_chunk(sctp_t *sctp, sctp_faddr_t *fp, sctp_ftsn_set_t *sets,
1395     uint_t nsets, uint32_t seglen)
1396 {
1397 	mblk_t			*ftsn_mp;
1398 	sctp_chunk_hdr_t	*ch_hdr;
1399 	uint32_t		*advtsn;
1400 	uint16_t		schlen;
1401 	size_t			xtralen;
1402 	ftsn_entry_t		*ftsn_entry;
1403 	sctp_stack_t	*sctps = sctp->sctp_sctps;
1404 
1405 	seglen += sizeof (sctp_chunk_hdr_t);
1406 	if (fp->isv4)
1407 		xtralen = sctp->sctp_hdr_len + sctps->sctps_wroff_xtra;
1408 	else
1409 		xtralen = sctp->sctp_hdr6_len + sctps->sctps_wroff_xtra;
1410 	ftsn_mp = allocb(xtralen + seglen, BPRI_MED);
1411 	if (ftsn_mp == NULL)
1412 		return (NULL);
1413 	ftsn_mp->b_rptr += xtralen;
1414 	ftsn_mp->b_wptr = ftsn_mp->b_rptr + seglen;
1415 
1416 	ch_hdr = (sctp_chunk_hdr_t *)ftsn_mp->b_rptr;
1417 	ch_hdr->sch_id = CHUNK_FORWARD_TSN;
1418 	ch_hdr->sch_flags = 0;
1419 	/*
1420 	 * The cast here should not be an issue since seglen is
1421 	 * the length of the Forward TSN chunk.
1422 	 */
1423 	schlen = (uint16_t)seglen;
1424 	U16_TO_ABE16(schlen, &(ch_hdr->sch_len));
1425 
1426 	advtsn = (uint32_t *)(ch_hdr + 1);
1427 	U32_TO_ABE32(sctp->sctp_adv_pap, advtsn);
1428 	ftsn_entry = (ftsn_entry_t *)(advtsn + 1);
1429 	while (nsets > 0) {
1430 		ASSERT((uchar_t *)&ftsn_entry[1] <= ftsn_mp->b_wptr);
1431 		ftsn_entry->ftsn_sid = sets->ftsn_entries.ftsn_sid;
1432 		ftsn_entry->ftsn_ssn = sets->ftsn_entries.ftsn_ssn;
1433 		ftsn_entry++;
1434 		sets = sets->next;
1435 		nsets--;
1436 	}
1437 	return (ftsn_mp);
1438 }
1439 
1440 /*
1441  * Given a starting message, the routine steps through all the
1442  * messages whose TSN is less than sctp->sctp_adv_pap and creates
1443  * ftsn sets. The ftsn sets is then used to create an Forward TSN
1444  * chunk. All the messages, that have chunks that are included in the
1445  * ftsn sets, are flagged abandonded. If a message is partially sent
1446  * and is deemed abandoned, all remaining unsent chunks are marked
1447  * abandoned and are deducted from sctp_unsent.
1448  */
1449 void
1450 sctp_make_ftsns(sctp_t *sctp, mblk_t *meta, mblk_t *mp, mblk_t **nmp,
1451     sctp_faddr_t *fp, uint32_t *seglen)
1452 {
1453 	mblk_t		*mp1 = mp;
1454 	mblk_t		*mp_head = mp;
1455 	mblk_t		*meta_head = meta;
1456 	mblk_t		*head;
1457 	sctp_ftsn_set_t	*sets = NULL;
1458 	uint_t		nsets = 0;
1459 	uint16_t	clen;
1460 	sctp_data_hdr_t	*sdc;
1461 	uint32_t	sacklen;
1462 	uint32_t	adv_pap = sctp->sctp_adv_pap;
1463 	uint32_t	unsent = 0;
1464 	boolean_t	ubit;
1465 	sctp_stack_t	*sctps = sctp->sctp_sctps;
1466 
1467 	*seglen = sizeof (uint32_t);
1468 
1469 	sdc  = (sctp_data_hdr_t *)mp1->b_rptr;
1470 	while (meta != NULL &&
1471 	    SEQ_GEQ(sctp->sctp_adv_pap, ntohl(sdc->sdh_tsn))) {
1472 		/*
1473 		 * Skip adding FTSN sets for un-ordered messages as they do
1474 		 * not have SSNs.
1475 		 */
1476 		ubit = SCTP_DATA_GET_UBIT(sdc);
1477 		if (!ubit &&
1478 		    !sctp_add_ftsn_set(&sets, fp, meta, &nsets, seglen)) {
1479 			meta = NULL;
1480 			sctp->sctp_adv_pap = adv_pap;
1481 			goto ftsn_done;
1482 		}
1483 		while (mp1 != NULL && SCTP_CHUNK_ISSENT(mp1)) {
1484 			sdc = (sctp_data_hdr_t *)mp1->b_rptr;
1485 			adv_pap = ntohl(sdc->sdh_tsn);
1486 			mp1 = mp1->b_next;
1487 		}
1488 		meta = meta->b_next;
1489 		if (meta != NULL) {
1490 			mp1 = meta->b_cont;
1491 			if (!SCTP_CHUNK_ISSENT(mp1))
1492 				break;
1493 			sdc  = (sctp_data_hdr_t *)mp1->b_rptr;
1494 		}
1495 	}
1496 ftsn_done:
1497 	/*
1498 	 * Can't compare with sets == NULL, since we don't add any
1499 	 * sets for un-ordered messages.
1500 	 */
1501 	if (meta == meta_head)
1502 		return;
1503 	*nmp = sctp_make_ftsn_chunk(sctp, fp, sets, nsets, *seglen);
1504 	sctp_free_ftsn_set(sets);
1505 	if (*nmp == NULL)
1506 		return;
1507 	if (sctp->sctp_ftsn == sctp->sctp_lastacked + 1) {
1508 		sacklen = 0;
1509 	} else {
1510 		sacklen = sizeof (sctp_chunk_hdr_t) +
1511 		    sizeof (sctp_sack_chunk_t) +
1512 		    (sizeof (sctp_sack_frag_t) * sctp->sctp_sack_gaps);
1513 		if (*seglen + sacklen > sctp->sctp_lastdata->sfa_pmss) {
1514 			/* piggybacked SACK doesn't fit */
1515 			sacklen = 0;
1516 		} else {
1517 			fp = sctp->sctp_lastdata;
1518 		}
1519 	}
1520 	head = sctp_add_proto_hdr(sctp, fp, *nmp, sacklen, NULL);
1521 	if (head == NULL) {
1522 		freemsg(*nmp);
1523 		*nmp = NULL;
1524 		SCTP_KSTAT(sctps, sctp_send_ftsn_failed);
1525 		return;
1526 	}
1527 	*seglen += sacklen;
1528 	*nmp = head;
1529 
1530 	/*
1531 	 * XXXNeed to optimise this, the reason it is done here is so
1532 	 * that we don't have to undo in case of failure.
1533 	 */
1534 	mp1 = mp_head;
1535 	sdc  = (sctp_data_hdr_t *)mp1->b_rptr;
1536 	while (meta_head != NULL &&
1537 	    SEQ_GEQ(sctp->sctp_adv_pap, ntohl(sdc->sdh_tsn))) {
1538 		if (!SCTP_IS_MSG_ABANDONED(meta_head))
1539 			SCTP_MSG_SET_ABANDONED(meta_head);
1540 		while (mp1 != NULL && SCTP_CHUNK_ISSENT(mp1)) {
1541 			sdc = (sctp_data_hdr_t *)mp1->b_rptr;
1542 			if (!SCTP_CHUNK_ISACKED(mp1)) {
1543 				clen = ntohs(sdc->sdh_len) - sizeof (*sdc);
1544 				SCTP_CHUNK_SENT(sctp, mp1, sdc, fp, clen,
1545 				    meta_head);
1546 			}
1547 			mp1 = mp1->b_next;
1548 		}
1549 		while (mp1 != NULL) {
1550 			sdc = (sctp_data_hdr_t *)mp1->b_rptr;
1551 			if (!SCTP_CHUNK_ABANDONED(mp1)) {
1552 				ASSERT(!SCTP_CHUNK_ISSENT(mp1));
1553 				unsent += ntohs(sdc->sdh_len) - sizeof (*sdc);
1554 				SCTP_ABANDON_CHUNK(mp1);
1555 			}
1556 			mp1 = mp1->b_next;
1557 		}
1558 		meta_head = meta_head->b_next;
1559 		if (meta_head != NULL) {
1560 			mp1 = meta_head->b_cont;
1561 			if (!SCTP_CHUNK_ISSENT(mp1))
1562 				break;
1563 			sdc  = (sctp_data_hdr_t *)mp1->b_rptr;
1564 		}
1565 	}
1566 	if (unsent > 0) {
1567 		ASSERT(sctp->sctp_unsent >= unsent);
1568 		sctp->sctp_unsent -= unsent;
1569 		/*
1570 		 * Update ULP the amount of queued data, which is
1571 		 * sent-unack'ed + unsent.
1572 		 */
1573 		if (!SCTP_IS_DETACHED(sctp))
1574 			SCTP_TXQ_UPDATE(sctp);
1575 	}
1576 }
1577 
1578 /*
1579  * This function steps through messages starting at meta and checks if
1580  * the message is abandoned. It stops when it hits an unsent chunk or
1581  * a message that has all its chunk acked. This is the only place
1582  * where the sctp_adv_pap is moved forward to indicated abandoned
1583  * messages.
1584  */
1585 void
1586 sctp_check_adv_ack_pt(sctp_t *sctp, mblk_t *meta, mblk_t *mp)
1587 {
1588 	uint32_t	tsn = sctp->sctp_adv_pap;
1589 	sctp_data_hdr_t	*sdc;
1590 	sctp_msg_hdr_t	*msg_hdr;
1591 
1592 	ASSERT(mp != NULL);
1593 	sdc = (sctp_data_hdr_t *)mp->b_rptr;
1594 	ASSERT(SEQ_GT(ntohl(sdc->sdh_tsn), sctp->sctp_lastack_rxd));
1595 	msg_hdr = (sctp_msg_hdr_t *)meta->b_rptr;
1596 	if (!SCTP_IS_MSG_ABANDONED(meta) &&
1597 	    !SCTP_MSG_TO_BE_ABANDONED(meta, msg_hdr, sctp)) {
1598 		return;
1599 	}
1600 	while (meta != NULL) {
1601 		while (mp != NULL && SCTP_CHUNK_ISSENT(mp)) {
1602 			sdc = (sctp_data_hdr_t *)mp->b_rptr;
1603 			tsn = ntohl(sdc->sdh_tsn);
1604 			mp = mp->b_next;
1605 		}
1606 		if (mp != NULL)
1607 			break;
1608 		/*
1609 		 * We continue checking for successive messages only if there
1610 		 * is a chunk marked for retransmission. Else, we might
1611 		 * end up sending FTSN prematurely for chunks that have been
1612 		 * sent, but not yet acked.
1613 		 */
1614 		if ((meta = meta->b_next) != NULL) {
1615 			msg_hdr = (sctp_msg_hdr_t *)meta->b_rptr;
1616 			if (!SCTP_IS_MSG_ABANDONED(meta) &&
1617 			    !SCTP_MSG_TO_BE_ABANDONED(meta, msg_hdr, sctp)) {
1618 				break;
1619 			}
1620 			for (mp = meta->b_cont; mp != NULL; mp = mp->b_next) {
1621 				if (!SCTP_CHUNK_ISSENT(mp)) {
1622 					sctp->sctp_adv_pap = tsn;
1623 					return;
1624 				}
1625 				if (SCTP_CHUNK_WANT_REXMIT(mp))
1626 					break;
1627 			}
1628 			if (mp == NULL)
1629 				break;
1630 		}
1631 	}
1632 	sctp->sctp_adv_pap = tsn;
1633 }
1634 
1635 
1636 /*
1637  * Determine if we should bundle a data chunk with the chunk being
1638  * retransmitted.  We bundle if
1639  *
1640  * - the chunk is sent to the same destination and unack'ed.
1641  *
1642  * OR
1643  *
1644  * - the chunk is unsent, i.e. new data.
1645  */
1646 #define	SCTP_CHUNK_RX_CANBUNDLE(mp, fp)					\
1647 	(!SCTP_CHUNK_ABANDONED((mp)) && 				\
1648 	((SCTP_CHUNK_ISSENT((mp)) && (SCTP_CHUNK_DEST(mp) == (fp) &&	\
1649 	!SCTP_CHUNK_ISACKED(mp))) ||					\
1650 	(((mp)->b_flag & (SCTP_CHUNK_FLAG_REXMIT|SCTP_CHUNK_FLAG_SENT)) != \
1651 	SCTP_CHUNK_FLAG_SENT)))
1652 
1653 /*
1654  * Retransmit first segment which hasn't been acked with cumtsn or send
1655  * a Forward TSN chunk, if appropriate.
1656  */
1657 void
1658 sctp_rexmit(sctp_t *sctp, sctp_faddr_t *oldfp)
1659 {
1660 	mblk_t		*mp;
1661 	mblk_t		*nmp = NULL;
1662 	mblk_t		*head;
1663 	mblk_t		*meta = sctp->sctp_xmit_head;
1664 	mblk_t		*fill;
1665 	uint32_t	seglen = 0;
1666 	uint32_t	sacklen;
1667 	uint16_t	chunklen;
1668 	int		extra;
1669 	sctp_data_hdr_t	*sdc;
1670 	sctp_faddr_t	*fp;
1671 	uint32_t	adv_pap = sctp->sctp_adv_pap;
1672 	boolean_t	do_ftsn = B_FALSE;
1673 	boolean_t	ftsn_check = B_TRUE;
1674 	uint32_t	first_ua_tsn;
1675 	sctp_msg_hdr_t	*mhdr;
1676 	sctp_stack_t	*sctps = sctp->sctp_sctps;
1677 	int		error;
1678 
1679 	while (meta != NULL) {
1680 		for (mp = meta->b_cont; mp != NULL; mp = mp->b_next) {
1681 			uint32_t	tsn;
1682 
1683 			if (!SCTP_CHUNK_ISSENT(mp))
1684 				goto window_probe;
1685 			/*
1686 			 * We break in the following cases -
1687 			 *
1688 			 *	if the advanced peer ack point includes the next
1689 			 *	chunk to be retransmited - possibly the Forward
1690 			 * 	TSN was lost.
1691 			 *
1692 			 *	if we are PRSCTP aware and the next chunk to be
1693 			 *	retransmitted is now abandoned
1694 			 *
1695 			 *	if the next chunk to be retransmitted is for
1696 			 *	the dest on which the timer went off. (this
1697 			 *	message is not abandoned).
1698 			 *
1699 			 * We check for Forward TSN only for the first
1700 			 * eligible chunk to be retransmitted. The reason
1701 			 * being if the first eligible chunk is skipped (say
1702 			 * it was sent to a destination other than oldfp)
1703 			 * then we cannot advance the cum TSN via Forward
1704 			 * TSN chunk.
1705 			 *
1706 			 * Also, ftsn_check is B_TRUE only for the first
1707 			 * eligible chunk, it  will be B_FALSE for all
1708 			 * subsequent candidate messages for retransmission.
1709 			 */
1710 			sdc = (sctp_data_hdr_t *)mp->b_rptr;
1711 			tsn = ntohl(sdc->sdh_tsn);
1712 			if (SEQ_GT(tsn, sctp->sctp_lastack_rxd)) {
1713 				if (sctp->sctp_prsctp_aware && ftsn_check) {
1714 					if (SEQ_GEQ(sctp->sctp_adv_pap, tsn)) {
1715 						ASSERT(sctp->sctp_prsctp_aware);
1716 						do_ftsn = B_TRUE;
1717 						goto out;
1718 					} else {
1719 						sctp_check_adv_ack_pt(sctp,
1720 						    meta, mp);
1721 						if (SEQ_GT(sctp->sctp_adv_pap,
1722 						    adv_pap)) {
1723 							do_ftsn = B_TRUE;
1724 							goto out;
1725 						}
1726 					}
1727 					ftsn_check = B_FALSE;
1728 				}
1729 				if (SCTP_CHUNK_DEST(mp) == oldfp)
1730 					goto out;
1731 			}
1732 		}
1733 		meta = meta->b_next;
1734 		if (meta != NULL && sctp->sctp_prsctp_aware) {
1735 			mhdr = (sctp_msg_hdr_t *)meta->b_rptr;
1736 
1737 			while (meta != NULL && (SCTP_IS_MSG_ABANDONED(meta) ||
1738 			    SCTP_MSG_TO_BE_ABANDONED(meta, mhdr, sctp))) {
1739 				meta = meta->b_next;
1740 			}
1741 		}
1742 	}
1743 window_probe:
1744 	/*
1745 	 * Retransmit fired for a destination which didn't have
1746 	 * any unacked data pending.
1747 	 */
1748 	if (sctp->sctp_unacked == 0 && sctp->sctp_unsent != 0) {
1749 		/*
1750 		 * Send a window probe. Inflate frwnd to allow
1751 		 * sending one segment.
1752 		 */
1753 		if (sctp->sctp_frwnd < (oldfp->sfa_pmss - sizeof (*sdc)))
1754 			sctp->sctp_frwnd = oldfp->sfa_pmss - sizeof (*sdc);
1755 
1756 		/* next TSN to send */
1757 		sctp->sctp_rxt_nxttsn = sctp->sctp_ltsn;
1758 
1759 		/*
1760 		 * The above sctp_frwnd adjustment is coarse.  The "changed"
1761 		 * sctp_frwnd may allow us to send more than 1 packet.  So
1762 		 * tell sctp_output() to send only 1 packet.
1763 		 */
1764 		sctp_output(sctp, 1);
1765 
1766 		/* Last sent TSN */
1767 		sctp->sctp_rxt_maxtsn = sctp->sctp_ltsn - 1;
1768 		ASSERT(sctp->sctp_rxt_maxtsn >= sctp->sctp_rxt_nxttsn);
1769 		sctp->sctp_zero_win_probe = B_TRUE;
1770 		BUMP_MIB(&sctps->sctps_mib, sctpOutWinProbe);
1771 	}
1772 	return;
1773 out:
1774 	/*
1775 	 * After a time out, assume that everything has left the network.  So
1776 	 * we can clear rxt_unacked for the original peer address.
1777 	 */
1778 	oldfp->rxt_unacked = 0;
1779 
1780 	/*
1781 	 * If we were probing for zero window, don't adjust retransmission
1782 	 * variables, but the timer is still backed off.
1783 	 */
1784 	if (sctp->sctp_zero_win_probe) {
1785 		mblk_t	*pkt;
1786 		uint_t	pkt_len;
1787 
1788 		/*
1789 		 * Get the Zero Win Probe for retrasmission, sctp_rxt_nxttsn
1790 		 * and sctp_rxt_maxtsn will specify the ZWP packet.
1791 		 */
1792 		fp = oldfp;
1793 		if (oldfp->state != SCTP_FADDRS_ALIVE)
1794 			fp = sctp_rotate_faddr(sctp, oldfp);
1795 		pkt = sctp_rexmit_packet(sctp, &meta, &mp, fp, &pkt_len);
1796 		if (pkt != NULL) {
1797 			ASSERT(pkt_len <= fp->sfa_pmss);
1798 			sctp_set_iplen(sctp, pkt, fp->ixa);
1799 			(void) conn_ip_output(pkt, fp->ixa);
1800 			BUMP_LOCAL(sctp->sctp_opkts);
1801 		} else {
1802 			SCTP_KSTAT(sctps, sctp_ss_rexmit_failed);
1803 		}
1804 
1805 		/*
1806 		 * The strikes will be clear by sctp_faddr_alive() when the
1807 		 * other side sends us an ack.
1808 		 */
1809 		oldfp->strikes++;
1810 		sctp->sctp_strikes++;
1811 
1812 		SCTP_CALC_RXT(sctp, oldfp, sctp->sctp_rto_max);
1813 		if (oldfp != fp && oldfp->suna != 0)
1814 			SCTP_FADDR_TIMER_RESTART(sctp, oldfp, fp->rto);
1815 		SCTP_FADDR_TIMER_RESTART(sctp, fp, fp->rto);
1816 		BUMP_MIB(&sctps->sctps_mib, sctpOutWinProbe);
1817 		return;
1818 	}
1819 
1820 	/*
1821 	 * Enter slowstart for this destination
1822 	 */
1823 	oldfp->ssthresh = oldfp->cwnd / 2;
1824 	if (oldfp->ssthresh < 2 * oldfp->sfa_pmss)
1825 		oldfp->ssthresh = 2 * oldfp->sfa_pmss;
1826 	oldfp->cwnd = oldfp->sfa_pmss;
1827 	oldfp->pba = 0;
1828 	fp = sctp_rotate_faddr(sctp, oldfp);
1829 	ASSERT(fp != NULL);
1830 	sdc = (sctp_data_hdr_t *)mp->b_rptr;
1831 
1832 	first_ua_tsn = ntohl(sdc->sdh_tsn);
1833 	if (do_ftsn) {
1834 		sctp_make_ftsns(sctp, meta, mp, &nmp, fp, &seglen);
1835 		if (nmp == NULL) {
1836 			sctp->sctp_adv_pap = adv_pap;
1837 			goto restart_timer;
1838 		}
1839 		head = nmp;
1840 		/*
1841 		 * Move to the next unabandoned chunk. XXXCheck if meta will
1842 		 * always be marked abandoned.
1843 		 */
1844 		while (meta != NULL && SCTP_IS_MSG_ABANDONED(meta))
1845 			meta = meta->b_next;
1846 		if (meta != NULL)
1847 			mp = mp->b_cont;
1848 		else
1849 			mp = NULL;
1850 		goto try_bundle;
1851 	}
1852 	seglen = ntohs(sdc->sdh_len);
1853 	chunklen = seglen - sizeof (*sdc);
1854 	if ((extra = seglen & (SCTP_ALIGN - 1)) != 0)
1855 		extra = SCTP_ALIGN - extra;
1856 
1857 	/* Find out if we need to piggyback SACK. */
1858 	if (sctp->sctp_ftsn == sctp->sctp_lastacked + 1) {
1859 		sacklen = 0;
1860 	} else {
1861 		sacklen = sizeof (sctp_chunk_hdr_t) +
1862 		    sizeof (sctp_sack_chunk_t) +
1863 		    (sizeof (sctp_sack_frag_t) * sctp->sctp_sack_gaps);
1864 		if (seglen + sacklen > sctp->sctp_lastdata->sfa_pmss) {
1865 			/* piggybacked SACK doesn't fit */
1866 			sacklen = 0;
1867 		} else {
1868 			/*
1869 			 * OK, we have room to send SACK back.  But we
1870 			 * should send it back to the last fp where we
1871 			 * receive data from, unless sctp_lastdata equals
1872 			 * oldfp, then we should probably not send it
1873 			 * back to that fp.  Also we should check that
1874 			 * the fp is alive.
1875 			 */
1876 			if (sctp->sctp_lastdata != oldfp &&
1877 			    sctp->sctp_lastdata->state == SCTP_FADDRS_ALIVE) {
1878 				fp = sctp->sctp_lastdata;
1879 			}
1880 		}
1881 	}
1882 
1883 	/*
1884 	 * Cancel RTT measurement if the retransmitted TSN is before the
1885 	 * TSN used for timimg.
1886 	 */
1887 	if (sctp->sctp_out_time != 0 &&
1888 	    SEQ_GEQ(sctp->sctp_rtt_tsn, sdc->sdh_tsn)) {
1889 		sctp->sctp_out_time = 0;
1890 	}
1891 	/* Clear the counter as the RTT calculation may be off. */
1892 	fp->rtt_updates = 0;
1893 	oldfp->rtt_updates = 0;
1894 
1895 	/*
1896 	 * After a timeout, we should change the current faddr so that
1897 	 * new chunks will be sent to the alternate address.
1898 	 */
1899 	sctp_set_faddr_current(sctp, fp);
1900 
1901 	nmp = dupmsg(mp);
1902 	if (nmp == NULL)
1903 		goto restart_timer;
1904 	if (extra > 0) {
1905 		fill = sctp_get_padding(sctp, extra);
1906 		if (fill != NULL) {
1907 			linkb(nmp, fill);
1908 			seglen += extra;
1909 		} else {
1910 			freemsg(nmp);
1911 			goto restart_timer;
1912 		}
1913 	}
1914 	SCTP_CHUNK_CLEAR_FLAGS(nmp);
1915 	head = sctp_add_proto_hdr(sctp, fp, nmp, sacklen, NULL);
1916 	if (head == NULL) {
1917 		freemsg(nmp);
1918 		SCTP_KSTAT(sctps, sctp_rexmit_failed);
1919 		goto restart_timer;
1920 	}
1921 	seglen += sacklen;
1922 
1923 	SCTP_CHUNK_SENT(sctp, mp, sdc, fp, chunklen, meta);
1924 
1925 	mp = mp->b_next;
1926 
1927 try_bundle:
1928 	/* We can at least and at most send 1 packet at timeout. */
1929 	while (seglen < fp->sfa_pmss) {
1930 		int32_t new_len;
1931 
1932 		/* Go through the list to find more chunks to be bundled. */
1933 		while (mp != NULL) {
1934 			/* Check if the chunk can be bundled. */
1935 			if (SCTP_CHUNK_RX_CANBUNDLE(mp, oldfp))
1936 				break;
1937 			mp = mp->b_next;
1938 		}
1939 		/* Go to the next message. */
1940 		if (mp == NULL) {
1941 			for (meta = meta->b_next; meta != NULL;
1942 			    meta = meta->b_next) {
1943 				mhdr = (sctp_msg_hdr_t *)meta->b_rptr;
1944 
1945 				if (SCTP_IS_MSG_ABANDONED(meta) ||
1946 				    SCTP_MSG_TO_BE_ABANDONED(meta, mhdr,
1947 				    sctp)) {
1948 					continue;
1949 				}
1950 
1951 				mp = meta->b_cont;
1952 				goto try_bundle;
1953 			}
1954 			/*
1955 			 * Check if there is a new message which potentially
1956 			 * could be bundled with this retransmission.
1957 			 */
1958 			meta = sctp_get_msg_to_send(sctp, &mp, NULL, &error,
1959 			    seglen, fp->sfa_pmss - seglen, NULL);
1960 			if (error != 0 || meta == NULL) {
1961 				/* No more chunk to be bundled. */
1962 				break;
1963 			} else {
1964 				goto try_bundle;
1965 			}
1966 		}
1967 
1968 		sdc = (sctp_data_hdr_t *)mp->b_rptr;
1969 		new_len = ntohs(sdc->sdh_len);
1970 		chunklen = new_len - sizeof (*sdc);
1971 
1972 		if ((extra = new_len & (SCTP_ALIGN - 1)) != 0)
1973 			extra = SCTP_ALIGN - extra;
1974 		if ((new_len = seglen + new_len + extra) > fp->sfa_pmss)
1975 			break;
1976 		if ((nmp = dupmsg(mp)) == NULL)
1977 			break;
1978 
1979 		if (extra > 0) {
1980 			fill = sctp_get_padding(sctp, extra);
1981 			if (fill != NULL) {
1982 				linkb(nmp, fill);
1983 			} else {
1984 				freemsg(nmp);
1985 				break;
1986 			}
1987 		}
1988 		linkb(head, nmp);
1989 
1990 		SCTP_CHUNK_CLEAR_FLAGS(nmp);
1991 		SCTP_CHUNK_SENT(sctp, mp, sdc, fp, chunklen, meta);
1992 
1993 		seglen = new_len;
1994 		mp = mp->b_next;
1995 	}
1996 done_bundle:
1997 	if ((seglen > fp->sfa_pmss) && fp->isv4) {
1998 		ipha_t *iph = (ipha_t *)head->b_rptr;
1999 
2000 		/*
2001 		 * Path MTU is different from path we thought it would
2002 		 * be when we created chunks, or IP headers have grown.
2003 		 * Need to clear the DF bit.
2004 		 */
2005 		iph->ipha_fragment_offset_and_flags = 0;
2006 	}
2007 	fp->rxt_unacked += seglen;
2008 
2009 	dprint(2, ("sctp_rexmit: Sending packet %d bytes, tsn %x "
2010 	    "ssn %d to %p (rwnd %d, lastack_rxd %x)\n",
2011 	    seglen, ntohl(sdc->sdh_tsn), ntohs(sdc->sdh_ssn),
2012 	    (void *)fp, sctp->sctp_frwnd, sctp->sctp_lastack_rxd));
2013 
2014 	sctp->sctp_rexmitting = B_TRUE;
2015 	sctp->sctp_rxt_nxttsn = first_ua_tsn;
2016 	sctp->sctp_rxt_maxtsn = sctp->sctp_ltsn - 1;
2017 	sctp_set_iplen(sctp, head, fp->ixa);
2018 	(void) conn_ip_output(head, fp->ixa);
2019 	BUMP_LOCAL(sctp->sctp_opkts);
2020 
2021 	/*
2022 	 * Restart the oldfp timer with exponential backoff and
2023 	 * the new fp timer for the retransmitted chunks.
2024 	 */
2025 restart_timer:
2026 	oldfp->strikes++;
2027 	sctp->sctp_strikes++;
2028 	SCTP_CALC_RXT(sctp, oldfp, sctp->sctp_rto_max);
2029 	/*
2030 	 * If there is still some data in the oldfp, restart the
2031 	 * retransmission timer.  If there is no data, the heartbeat will
2032 	 * continue to run so it will do its job in checking the reachability
2033 	 * of the oldfp.
2034 	 */
2035 	if (oldfp != fp && oldfp->suna != 0)
2036 		SCTP_FADDR_TIMER_RESTART(sctp, oldfp, oldfp->rto);
2037 
2038 	/*
2039 	 * Should we restart the timer of the new fp?  If there is
2040 	 * outstanding data to the new fp, the timer should be
2041 	 * running already.  So restarting it means that the timer
2042 	 * will fire later for those outstanding data.  But if
2043 	 * we don't restart it, the timer will fire too early for the
2044 	 * just retransmitted chunks to the new fp.  The reason is that we
2045 	 * don't keep a timestamp on when a chunk is retransmitted.
2046 	 * So when the timer fires, it will just search for the
2047 	 * chunk with the earliest TSN sent to new fp.  This probably
2048 	 * is the chunk we just retransmitted.  So for now, let's
2049 	 * be conservative and restart the timer of the new fp.
2050 	 */
2051 	SCTP_FADDR_TIMER_RESTART(sctp, fp, fp->rto);
2052 
2053 	sctp->sctp_active = ddi_get_lbolt64();
2054 }
2055 
2056 /*
2057  * This function is called by sctp_ss_rexmit() to create a packet
2058  * to be retransmitted to the given fp.  The given meta and mp
2059  * parameters are respectively the sctp_msg_hdr_t and the mblk of the
2060  * first chunk to be retransmitted.  This is also called when we want
2061  * to retransmit a zero window probe from sctp_rexmit() or when we
2062  * want to retransmit the zero window probe after the window has
2063  * opened from sctp_got_sack().
2064  */
2065 mblk_t *
2066 sctp_rexmit_packet(sctp_t *sctp, mblk_t **meta, mblk_t **mp, sctp_faddr_t *fp,
2067     uint_t *packet_len)
2068 {
2069 	uint32_t	seglen = 0;
2070 	uint16_t	chunklen;
2071 	int		extra;
2072 	mblk_t		*nmp;
2073 	mblk_t		*head;
2074 	mblk_t		*fill;
2075 	sctp_data_hdr_t	*sdc;
2076 	sctp_msg_hdr_t	*mhdr;
2077 
2078 	sdc = (sctp_data_hdr_t *)(*mp)->b_rptr;
2079 	seglen = ntohs(sdc->sdh_len);
2080 	chunklen = seglen - sizeof (*sdc);
2081 	if ((extra = seglen & (SCTP_ALIGN - 1)) != 0)
2082 		extra = SCTP_ALIGN - extra;
2083 
2084 	nmp = dupmsg(*mp);
2085 	if (nmp == NULL)
2086 		return (NULL);
2087 	if (extra > 0) {
2088 		fill = sctp_get_padding(sctp, extra);
2089 		if (fill != NULL) {
2090 			linkb(nmp, fill);
2091 			seglen += extra;
2092 		} else {
2093 			freemsg(nmp);
2094 			return (NULL);
2095 		}
2096 	}
2097 	SCTP_CHUNK_CLEAR_FLAGS(nmp);
2098 	head = sctp_add_proto_hdr(sctp, fp, nmp, 0, NULL);
2099 	if (head == NULL) {
2100 		freemsg(nmp);
2101 		return (NULL);
2102 	}
2103 	SCTP_CHUNK_SENT(sctp, *mp, sdc, fp, chunklen, *meta);
2104 	/*
2105 	 * Don't update the TSN if we are doing a Zero Win Probe.
2106 	 */
2107 	if (!sctp->sctp_zero_win_probe)
2108 		sctp->sctp_rxt_nxttsn = ntohl(sdc->sdh_tsn);
2109 	*mp = (*mp)->b_next;
2110 
2111 try_bundle:
2112 	while (seglen < fp->sfa_pmss) {
2113 		int32_t new_len;
2114 
2115 		/*
2116 		 * Go through the list to find more chunks to be bundled.
2117 		 * We should only retransmit sent by unack'ed chunks.  Since
2118 		 * they were sent before, the peer's receive window should
2119 		 * be able to receive them.
2120 		 */
2121 		while (*mp != NULL) {
2122 			/* Check if the chunk can be bundled. */
2123 			if (SCTP_CHUNK_ISSENT(*mp) && !SCTP_CHUNK_ISACKED(*mp))
2124 				break;
2125 			*mp = (*mp)->b_next;
2126 		}
2127 		/* Go to the next message. */
2128 		if (*mp == NULL) {
2129 			for (*meta = (*meta)->b_next; *meta != NULL;
2130 			    *meta = (*meta)->b_next) {
2131 				mhdr = (sctp_msg_hdr_t *)(*meta)->b_rptr;
2132 
2133 				if (SCTP_IS_MSG_ABANDONED(*meta) ||
2134 				    SCTP_MSG_TO_BE_ABANDONED(*meta, mhdr,
2135 				    sctp)) {
2136 					continue;
2137 				}
2138 
2139 				*mp = (*meta)->b_cont;
2140 				goto try_bundle;
2141 			}
2142 			/* No more chunk to be bundled. */
2143 			break;
2144 		}
2145 
2146 		sdc = (sctp_data_hdr_t *)(*mp)->b_rptr;
2147 		/* Don't bundle chunks beyond sctp_rxt_maxtsn. */
2148 		if (SEQ_GT(ntohl(sdc->sdh_tsn), sctp->sctp_rxt_maxtsn))
2149 			break;
2150 		new_len = ntohs(sdc->sdh_len);
2151 		chunklen = new_len - sizeof (*sdc);
2152 
2153 		if ((extra = new_len & (SCTP_ALIGN - 1)) != 0)
2154 			extra = SCTP_ALIGN - extra;
2155 		if ((new_len = seglen + new_len + extra) > fp->sfa_pmss)
2156 			break;
2157 		if ((nmp = dupmsg(*mp)) == NULL)
2158 			break;
2159 
2160 		if (extra > 0) {
2161 			fill = sctp_get_padding(sctp, extra);
2162 			if (fill != NULL) {
2163 				linkb(nmp, fill);
2164 			} else {
2165 				freemsg(nmp);
2166 				break;
2167 			}
2168 		}
2169 		linkb(head, nmp);
2170 
2171 		SCTP_CHUNK_CLEAR_FLAGS(nmp);
2172 		SCTP_CHUNK_SENT(sctp, *mp, sdc, fp, chunklen, *meta);
2173 		/*
2174 		 * Don't update the TSN if we are doing a Zero Win Probe.
2175 		 */
2176 		if (!sctp->sctp_zero_win_probe)
2177 			sctp->sctp_rxt_nxttsn = ntohl(sdc->sdh_tsn);
2178 
2179 		seglen = new_len;
2180 		*mp = (*mp)->b_next;
2181 	}
2182 	*packet_len = seglen;
2183 	fp->rxt_unacked += seglen;
2184 	return (head);
2185 }
2186 
2187 /*
2188  * sctp_ss_rexmit() is called when we get a SACK after a timeout which
2189  * advances the cum_tsn but the cum_tsn is still less than what we have sent
2190  * (sctp_rxt_maxtsn) at the time of the timeout.  This SACK is a "partial"
2191  * SACK.  We retransmit unacked chunks without having to wait for another
2192  * timeout.  The rationale is that the SACK should not be "partial" if all the
2193  * lost chunks have been retransmitted.  Since the SACK is "partial,"
2194  * the chunks between the cum_tsn and the sctp_rxt_maxtsn should still
2195  * be missing.  It is better for us to retransmit them now instead
2196  * of waiting for a timeout.
2197  */
2198 void
2199 sctp_ss_rexmit(sctp_t *sctp)
2200 {
2201 	mblk_t		*meta;
2202 	mblk_t		*mp;
2203 	mblk_t		*pkt;
2204 	sctp_faddr_t	*fp;
2205 	uint_t		pkt_len;
2206 	uint32_t	tot_wnd;
2207 	sctp_data_hdr_t	*sdc;
2208 	int		burst;
2209 	sctp_stack_t	*sctps = sctp->sctp_sctps;
2210 
2211 	ASSERT(!sctp->sctp_zero_win_probe);
2212 
2213 	/*
2214 	 * If the last cum ack is smaller than what we have just
2215 	 * retransmitted, simply return.
2216 	 */
2217 	if (SEQ_GEQ(sctp->sctp_lastack_rxd, sctp->sctp_rxt_nxttsn))
2218 		sctp->sctp_rxt_nxttsn = sctp->sctp_lastack_rxd + 1;
2219 	else
2220 		return;
2221 	ASSERT(SEQ_LEQ(sctp->sctp_rxt_nxttsn, sctp->sctp_rxt_maxtsn));
2222 
2223 	/*
2224 	 * After a timer fires, sctp_current should be set to the new
2225 	 * fp where the retransmitted chunks are sent.
2226 	 */
2227 	fp = sctp->sctp_current;
2228 
2229 	/*
2230 	 * Since we are retransmitting, we only need to use cwnd to determine
2231 	 * how much we can send as we were allowed (by peer's receive window)
2232 	 * to send those retransmitted chunks previously when they are first
2233 	 * sent.  If we record how much we have retransmitted but
2234 	 * unacknowledged using rxt_unacked, then the amount we can now send
2235 	 * is equal to cwnd minus rxt_unacked.
2236 	 *
2237 	 * The field rxt_unacked is incremented when we retransmit a packet
2238 	 * and decremented when we got a SACK acknowledging something.  And
2239 	 * it is reset when the retransmission timer fires as we assume that
2240 	 * all packets have left the network after a timeout.  If this
2241 	 * assumption is not true, it means that after a timeout, we can
2242 	 * get a SACK acknowledging more than rxt_unacked (its value only
2243 	 * contains what is retransmitted when the timer fires).  So
2244 	 * rxt_unacked will become very big (it is an unsiged int so going
2245 	 * negative means that the value is huge).  This is the reason we
2246 	 * always send at least 1 MSS bytes.
2247 	 *
2248 	 * The reason why we do not have an accurate count is that we
2249 	 * only know how many packets are outstanding (using the TSN numbers).
2250 	 * But we do not know how many bytes those packets contain.  To
2251 	 * have an accurate count, we need to walk through the send list.
2252 	 * As it is not really important to have an accurate count during
2253 	 * retransmission, we skip this walk to save some time.  This should
2254 	 * not make the retransmission too aggressive to cause congestion.
2255 	 */
2256 	if (fp->cwnd <= fp->rxt_unacked)
2257 		tot_wnd = fp->sfa_pmss;
2258 	else
2259 		tot_wnd = fp->cwnd - fp->rxt_unacked;
2260 
2261 	/* Find the first unack'ed chunk */
2262 	for (meta = sctp->sctp_xmit_head; meta != NULL; meta = meta->b_next) {
2263 		sctp_msg_hdr_t	*mhdr = (sctp_msg_hdr_t *)meta->b_rptr;
2264 
2265 		if (SCTP_IS_MSG_ABANDONED(meta) ||
2266 		    SCTP_MSG_TO_BE_ABANDONED(meta, mhdr, sctp)) {
2267 			continue;
2268 		}
2269 
2270 		for (mp = meta->b_cont; mp != NULL; mp = mp->b_next) {
2271 			/* Again, this may not be possible */
2272 			if (!SCTP_CHUNK_ISSENT(mp))
2273 				return;
2274 			sdc = (sctp_data_hdr_t *)mp->b_rptr;
2275 			if (ntohl(sdc->sdh_tsn) == sctp->sctp_rxt_nxttsn)
2276 				goto found_msg;
2277 		}
2278 	}
2279 
2280 	/* Everything is abandoned... */
2281 	return;
2282 
2283 found_msg:
2284 	if (!fp->timer_running)
2285 		SCTP_FADDR_TIMER_RESTART(sctp, fp, fp->rto);
2286 	pkt = sctp_rexmit_packet(sctp, &meta, &mp, fp, &pkt_len);
2287 	if (pkt == NULL) {
2288 		SCTP_KSTAT(sctps, sctp_ss_rexmit_failed);
2289 		return;
2290 	}
2291 	if ((pkt_len > fp->sfa_pmss) && fp->isv4) {
2292 		ipha_t	*iph = (ipha_t *)pkt->b_rptr;
2293 
2294 		/*
2295 		 * Path MTU is different from path we thought it would
2296 		 * be when we created chunks, or IP headers have grown.
2297 		 *  Need to clear the DF bit.
2298 		 */
2299 		iph->ipha_fragment_offset_and_flags = 0;
2300 	}
2301 	sctp_set_iplen(sctp, pkt, fp->ixa);
2302 	(void) conn_ip_output(pkt, fp->ixa);
2303 	BUMP_LOCAL(sctp->sctp_opkts);
2304 
2305 	/* Check and see if there is more chunk to be retransmitted. */
2306 	if (tot_wnd <= pkt_len || tot_wnd - pkt_len < fp->sfa_pmss ||
2307 	    meta == NULL)
2308 		return;
2309 	if (mp == NULL)
2310 		meta = meta->b_next;
2311 	if (meta == NULL)
2312 		return;
2313 
2314 	/* Retransmit another packet if the window allows. */
2315 	for (tot_wnd -= pkt_len, burst = sctps->sctps_maxburst - 1;
2316 	    meta != NULL && burst > 0; meta = meta->b_next, burst--) {
2317 		if (mp == NULL)
2318 			mp = meta->b_cont;
2319 		for (; mp != NULL; mp = mp->b_next) {
2320 			/* Again, this may not be possible */
2321 			if (!SCTP_CHUNK_ISSENT(mp))
2322 				return;
2323 			if (!SCTP_CHUNK_ISACKED(mp))
2324 				goto found_msg;
2325 		}
2326 	}
2327 }
2328