* Copyright (c) 1991 The Regents of the University of California.
* %sccs.include.redist.c%
* @(#)tp_subr.c 7.21 (Berkeley) %G%
/***********************************************************
Copyright IBM Corporation 1987
Permission to use, copy, modify, and distribute this software and its
documentation for any purpose and without fee is hereby granted,
provided that the above copyright notice appear in all copies and that
both that copyright notice and this permission notice appear in
supporting documentation, and that the name of IBM not be
used in advertising or publicity pertaining to distribution of the
software without specific, written prior permission.
IBM DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING
ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL
IBM BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR
ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
******************************************************************/
* ARGO Project, Computer Sciences Dept., University of Wisconsin - Madison
* $Header: tp_subr.c,v 5.3 88/11/18 17:28:43 nhall Exp $
* $Source: /usr/argo/sys/netiso/RCS/tp_subr.c,v $
* The main work of data transfer is done here.
* These routines are called from tp.trans.
* They include the routines that check the validity of acks and Xacks,
* (tp_goodack() and tp_goodXack() )
* take packets from socket buffers and send them (tp_send()),
* drop the data from the socket buffers (tp_sbdrop()),
* and put incoming packet data into socket buffers (tp_stash()).
#include <sys/socketvar.h>
#include <netiso/tp_ip.h>
#include <netiso/argo_debug.h>
#include <netiso/tp_timer.h>
#include <netiso/tp_param.h>
#include <netiso/tp_stat.h>
#include <netiso/tp_pcb.h>
#include <netiso/tp_tpdu.h>
#include <netiso/tp_trace.h>
#include <netiso/tp_meas.h>
#include <netiso/tp_seq.h>
int tp_emit(), tp_sbdrop();
* tp.trans, when an XAK arrives
* FUNCTION and ARGUMENTS:
* Determines if the sequence number (seq) from the XAK
* acks anything new. If so, drop the appropriate tpdu
* from the XPD send queue.
* Returns 1 if it did this, 0 if the ack caused no action.
seq
, tpcb
->tp_Xuna
, tpcb
->tp_Xsndnxt
, tpcb
->tp_sndnew
,
if ( seq
== tpcb
->tp_Xuna
) {
tpcb
->tp_Xuna
= tpcb
->tp_Xsndnxt
;
/* DROP 1 packet from the Xsnd socket buf - just so happens
* that only one packet can be there at any time
* so drop the whole thing. If you allow > 1 packet
* the socket buffer, then you'll have to keep
* track of how many characters went w/ each XPD tpdu, so this
dump_mbuf(tpcb
->tp_Xsnd
.sb_mb
,
"tp_goodXack Xsnd before sbdrop");
"goodXack: dropping cc ",
(int)(tpcb
->tp_Xsnd
.sb_cc
),
sbdroprecord(&tpcb
->tp_Xsnd
);
* FUNCTION and ARGUMENTS:
* smoothed average round trip time (*rtt)
* roundtrip time variance (*rtv) - actually deviation, not variance
* given the new value (diff)
register struct tp_pcb
*tpcb
;
int delta
, elapsed
= ticks
- tpcb
->tp_rttemit
;
* rtt is the smoothed round trip time in machine clock ticks (hz).
* It is stored as a fixed point number, unscaled (unlike the tcp
* srtt). The rationale here is that it is only significant to the
* nearest unit of slowtimo, which is at least 8 machine clock ticks
* so there is no need to scale. The smoothing is done according
* to the same formula as TCP (rtt = rtt*7/8 + measured_rtt/8).
delta
= elapsed
- tpcb
->tp_rtt
;
if ((tpcb
->tp_rtt
+= (delta
>> TP_RTT_ALPHA
)) <= 0)
* rtv is a smoothed accumulated mean difference, unscaled
* for reasons expressed above.
* It is smoothed with an alpha of .75, and the round trip timer
* will be set to rtt + 4*rtv, also as TCP does.
if ((tpcb
->tp_rtv
+= ((delta
- tpcb
->tp_rtv
) >> TP_RTV_ALPHA
)) <= 0)
* No rtt measurement yet - use the unsmoothed rtt.
* Set the variance to half the rtt (so our first
* retransmit happens at 3*rtt)
tpcb
->tp_rtv
= elapsed
>> 1;
* Quoting TCP: "the retransmit should happen at rtt + 4 * rttvar.
* Because of the way we do the smoothing, srtt and rttvar
* will each average +1/2 tick of bias. When we compute
* the retransmit timer, we want 1/2 tick of rounding and
* 1 extra tick because of +-1/2 tick uncertainty in the
* firing of the timer. The bias will give us exactly the
* 1.5 tick we need. But, because the bias is
* statistical, we have to test that we don't drop below
* the minimum feasible timer (which is 2 ticks)."
TP_RANGESET(tpcb
->tp_dt_ticks
, TP_REXMTVAL(tpcb
),
tpcb
->tp_peer_acktime
, 128 /* XXX */);
printf("%s tpcb 0x%x, elapsed %d, delta %d, rtt %d, rtv %d, old %d\n",
"tp_rtt_rtv:",tpcb
,elapsed
,delta
,tpcb
->tp_rtt
,tpcb
->tp_rtv
,old
);
tpcb
->tp_rxtcur
= tpcb
->tp_dt_ticks
;
* tp.trans when an AK arrives
* FUNCTION and ARGUMENTS:
* Given (cdt), the credit from the AK tpdu, and
* (seq), the sequence number from the AK tpdu,
* tp_goodack() determines if the AK acknowledges something in the send
* window, and if so, drops the appropriate packets from the retransmission
* list, computes the round trip time, and updates the retransmission timer
* based on the new smoothed round trip time.
* EITHER it actually acked something heretofore unacknowledged
* OR no news but the credit should be processed.
* If something heretofore unacked was acked with this sequence number,
* the appropriate tpdus are dropped from the retransmission control list,
* by calling tp_sbdrop().
* No need to see the tpdu itself.
tp_goodack(tpcb
, cdt
, seq
, subseq
)
register struct tp_pcb
*tpcb
;
int bang
= 0; /* bang --> ack for something heretofore unacked */
printf("goodack tpcb 0x%x seq 0x%x cdt %d una 0x%x new 0x%x nxt 0x%x\n",
tpcb
, seq
, cdt
, tpcb
->tp_snduna
, tpcb
->tp_sndnew
, tpcb
->tp_sndnxt
);
seq
,cdt
, tpcb
->tp_snduna
,tpcb
->tp_sndnew
,subseq
);
tpmeas(tpcb
->tp_lref
, TPtime_ack_rcvd
, (struct timeval
*)0, seq
, 0, 0);
if (seq
== tpcb
->tp_snduna
) {
if (subseq
< tpcb
->tp_r_subseq
||
(subseq
== tpcb
->tp_r_subseq
&& cdt
<= tpcb
->tp_fcredit
)) {
printf("goodack discard : tpcb 0x%x subseq %d r_subseq %d\n",
tpcb
, subseq
, tpcb
->tp_r_subseq
);
if (cdt
== tpcb
->tp_fcredit
/*&& thus subseq > tpcb->tp_r_subseq */) {
tpcb
->tp_r_subseq
= subseq
;
if (tpcb
->tp_timer
[TM_data_retrans
] == 0)
else if (++tpcb
->tp_dupacks
== tprexmtthresh
) {
/* partner went out of his way to signal with different
subsequences that he has the same lack of an expected
packet. This may be an early indiciation of a loss */
SeqNum onxt
= tpcb
->tp_sndnxt
;
struct mbuf
*onxt_m
= tpcb
->tp_sndnxt_m
;
u_int win
= min(tpcb
->tp_fcredit
,
tpcb
->tp_cong_win
/ tpcb
->tp_l_tpdusize
) / 2;
printf("%s tpcb 0x%x seq 0x%x rttseq 0x%x onxt 0x%x\n",
"goodack dupacks:", tpcb
, seq
, tpcb
->tp_rttseq
, onxt
);
tpcb
->tp_ssthresh
= win
* tpcb
->tp_l_tpdusize
;
tpcb
->tp_timer
[TM_data_retrans
] = 0;
tpcb
->tp_sndnxt
= tpcb
->tp_snduna
;
tpcb
->tp_cong_win
= tpcb
->tp_l_tpdusize
;
tpcb
->tp_cong_win
= tpcb
->tp_ssthresh
+
tpcb
->tp_dupacks
* tpcb
->tp_l_tpdusize
;
if (SEQ_GT(tpcb
, onxt
, tpcb
->tp_sndnxt
)) {
tpcb
->tp_sndnxt_m
= onxt_m
;
} else if (tpcb
->tp_dupacks
> tprexmtthresh
) {
tpcb
->tp_cong_win
+= tpcb
->tp_l_tpdusize
;
} else if (SEQ_LT(tpcb
, seq
, tpcb
->tp_snduna
))
* If the congestion window was inflated to account
* for the other side's cached packets, retract it.
if (tpcb
->tp_dupacks
> tprexmtthresh
&&
tpcb
->tp_cong_win
> tpcb
->tp_ssthresh
)
tpcb
->tp_cong_win
= tpcb
->tp_ssthresh
;
tpcb
->tp_r_subseq
= subseq
;
old_fcredit
= tpcb
->tp_fcredit
;
if (cdt
> tpcb
->tp_maxfcredit
)
tpcb
->tp_maxfcredit
= cdt
;
if (IN_SWINDOW(tpcb
, seq
, tpcb
->tp_snduna
, tpcb
->tp_sndnew
)) {
bytes_acked
= tp_sbdrop(tpcb
, seq
);
* If transmit timer is running and timed sequence
* number was acked, update smoothed round trip time.
* Since we now have an rtt measurement, cancel the
* timer backoff (cf., Phil Karn's retransmit alg.).
* Recompute the initial retransmit timer.
if (tpcb
->tp_rttemit
&& SEQ_GT(tpcb
, seq
, tpcb
->tp_rttseq
))
* If all outstanding data is acked, stop retransmit timer.
* If there is more data to be acked, restart retransmit
* timer, using current (possibly backed-off) value.
* OSI combines the keepalive and persistance functions.
* So, there is no persistance timer per se, to restart.
if (tpcb
->tp_class
!= TP_CLASS_0
)
tpcb
->tp_timer
[TM_data_retrans
] =
(seq
== tpcb
->tp_sndnew
) ? 0 : tpcb
->tp_rxtcur
;
* When new data is acked, open the congestion window.
* If the window gives us less than ssthresh packets
* in flight, open exponentially (maxseg per packet).
* Otherwise open linearly: maxseg per window
* (maxseg^2 / cwnd per packet), plus a constant
* fraction of a packet (maxseg/8) to help larger windows
u_int cw
= tpcb
->tp_cong_win
, incr
= tpcb
->tp_l_tpdusize
;
incr
= min(incr
, bytes_acked
);
if (cw
> tpcb
->tp_ssthresh
)
incr
= incr
* incr
/ cw
+ incr
/ 8;
min(cw
+ incr
, tpcb
->tp_sock
->so_snd
.sb_hiwat
);
if (SEQ_LT(tpcb
, tpcb
->tp_sndnxt
, seq
)) {
if( cdt
!= 0 && old_fcredit
== 0 ) {
/* The following might mean that the window shrunk */
if (tpcb
->tp_timer
[TM_data_retrans
]) {
tpcb
->tp_timer
[TM_data_retrans
] = 0;
tpcb
->tp_timer
[TM_sendack
] = tpcb
->tp_dt_ticks
;
if (tpcb
->tp_sndnxt
!= tpcb
->tp_snduna
) {
tpcb
->tp_sndnxt
= tpcb
->tp_snduna
;
bang
|= (old_fcredit
< cdt
);
printf("goodack returns 0x%x, cdt 0x%x ocdt 0x%x cwin 0x%x\n",
bang
, cdt
, old_fcredit
, tpcb
->tp_cong_win
);
/* if (bang) XXXXX Very bad to remove this test, but somethings broken */
* FUNCTION and ARGUMENTS:
* drops everything up TO but not INCLUDING seq # (seq)
* from the retransmission queue.
register struct tp_pcb
*tpcb
;
struct sockbuf
*sb
= &tpcb
->tp_sock
->so_snd
;
register int i
= SEQ_SUB(tpcb
, seq
, tpcb
->tp_snduna
);
int oldcc
= sb
->sb_cc
, oldi
= i
;
if (i
>= tpcb
->tp_seqhalf
)
printf("tp_spdropping too much -- should panic");
printf("tp_sbdroping %d pkts %d bytes on %x at 0x%x\n",
oldi
, oldcc
- sb
->sb_cc
, tpcb
, seq
);
if (sb
->sb_flags
& SB_NOTIFY
)
sowwakeup(tpcb
->tp_sock
);
return (oldcc
- sb
->sb_cc
);
* tp.trans on user send request, arrival of AK and arrival of XAK
* FUNCTION and ARGUMENTS:
* Emits tpdus starting at sequence number (tpcb->tp_sndnxt).
* Emits until a) runs out of data, or b) runs into an XPD mark, or
* c) it hits seq number (highseq) limited by cong or credit.
* If you want XPD to buffer > 1 du per socket buffer, you can
* modifiy this to issue XPD tpdus also, but then it'll have
* to take some argument(s) to distinguish between the type of DU to
* When something is sent for the first time, its time-of-send
* is stashed (in system clock ticks rather than pf_slowtimo ticks).
* When the ack arrives, the smoothed round-trip time is figured
register struct tp_pcb
*tpcb
;
struct sockbuf
*sb
= &tpcb
->tp_sock
->so_snd
;
SeqNum highseq
, checkseq
;
int idle
, idleticks
, off
, cong_win
;
int send_start_time
= ticks
;
SeqNum oldnxt
= tpcb
->tp_sndnxt
;
#endif /* TP_PERF_MEAS */
idle
= (tpcb
->tp_snduna
== tpcb
->tp_sndnew
);
idleticks
= tpcb
->tp_inact_ticks
- tpcb
->tp_timer
[TM_inact
];
if (idleticks
> tpcb
->tp_dt_ticks
)
* We have been idle for "a while" and no acks are
* expected to clock out any data we send --
* slow start to get ack "clock" running again.
tpcb
->tp_cong_win
= tpcb
->tp_l_tpdusize
;
cong_win
= tpcb
->tp_cong_win
;
highseq
= SEQ(tpcb
, tpcb
->tp_fcredit
+ tpcb
->tp_snduna
);
highseq
= SEQ_MIN(tpcb
, highseq
, tpcb
->tp_sndnew
);
printf("tp_send enter tpcb 0x%x nxt 0x%x win %d high 0x%x\n",
tpcb
, tpcb
->tp_sndnxt
, cong_win
, highseq
);
tptraceTPCB( TPPTmisc
, "tp_send sndnew snduna",
tpcb
->tp_sndnew
, tpcb
->tp_snduna
, 0, 0);
tptraceTPCB( TPPTmisc
, "tp_send tpcb->tp_sndnxt win fcredit congwin",
tpcb
->tp_sndnxt
, cong_win
, tpcb
->tp_fcredit
, tpcb
->tp_cong_win
);
tptraceTPCB( TPPTmisc
, "tp_send 2 nxt high fcredit congwin",
tpcb
->tp_sndnxt
, highseq
, tpcb
->tp_fcredit
, cong_win
);
off
= SEQ_SUB(tpcb
, tpcb
->tp_sndnxt
, tpcb
->tp_snduna
);
for (m
= sb
->sb_mb
; m
&& off
> 0; m
= m
->m_next
)
* Avoid silly window syndrome here . . . figure out how!
checkseq
= tpcb
->tp_sndnum
;
if (idle
&& SEQ_LT(tpcb
, tpcb
->tp_sndnum
, highseq
))
checkseq
= highseq
; /* i.e. DON'T retain highest assigned packet */
while ((SEQ_LT(tpcb
, tpcb
->tp_sndnxt
, highseq
)) && m
&& cong_win
> 0) {
eotsdu
= (m
->m_flags
& M_EOR
) != 0;
if (tpcb
->tp_sndnxt
== checkseq
&& eotsdu
== 0 &&
len
< (tpcb
->tp_l_tpdusize
/ 2))
break; /* Nagle . . . . . */
/* make a copy - mb goes into the retransmission list
* while m gets emitted. m_copy won't copy a zero-length mbuf.
m
= m_copy(mb
, 0, M_COPYALL
);
"tp_send mcopy nxt high eotsdu len",
tpcb
->tp_sndnxt
, highseq
, eotsdu
, len
);
printf("tp_sending tpcb 0x%x nxt 0x%x\n",
/* when headers are precomputed, may need to fill
if (tpcb
->tp_sock
->so_error
=
tp_emit(DT_TPDU_type
, tpcb
, tpcb
->tp_sndnxt
, eotsdu
, m
)) {
if (tpcb
->tp_sndnxt
== tpcb
->tp_sndnew
) {
SEQ_INC(tpcb
, tpcb
->tp_sndnew
);
* Time this transmission if not a retransmission and
* not currently timing anything.
if (tpcb
->tp_rttemit
== 0) {
tpcb
->tp_rttemit
= ticks
;
tpcb
->tp_rttseq
= tpcb
->tp_sndnxt
;
tpcb
->tp_sndnxt
= tpcb
->tp_sndnew
;
SEQ_INC(tpcb
, tpcb
->tp_sndnxt
);
* Set retransmit timer if not currently set.
* Initial value for retransmit timer is smoothed
* round-trip time + 2 * round-trip time variance.
* Initialize shift counter which is used for backoff
if (tpcb
->tp_timer
[TM_data_retrans
] == 0 &&
tpcb
->tp_class
!= TP_CLASS_0
) {
tpcb
->tp_timer
[TM_data_retrans
] = tpcb
->tp_dt_ticks
;
tpcb
->tp_timer
[TM_sendack
] = tpcb
->tp_keepalive_ticks
;
if (SEQ_GT(tpcb
, tpcb
->tp_sndnew
, tpcb
->tp_sndnum
))
int elapsed
= ticks
- send_start_time
, *t
;
npkts
= SEQ_SUB(tpcb
, tpcb
->tp_sndnxt
, oldnxt
);
t
= &(tpcb
->tp_p_meas
->tps_sendtime
[npkts
]);
*t
+= (t
- elapsed
) >> TP_RTT_ALPHA
;
IncPStat(tpcb
, tps_win_lim_by_data
[npkts
] );
IncPStat(tpcb
, tps_win_lim_by_cdt
[npkts
] );
/* not true with congestion-window being used */
now
.tv_sec
= elapsed
/ hz
;
now
.tv_usec
= (elapsed
- (hz
* now
.tv_sec
)) * 1000000 / hz
;
TPsbsend
, &elapsed
, newseq
, tpcb
->tp_Nwindow
, npkts
);
#endif /* TP_PERF_MEAS */
"tp_send at end: new nxt eotsdu error",
tpcb
->tp_sndnew
, tpcb
->tp_sndnxt
, eotsdu
, tpcb
->tp_sock
->so_error
);
tp_packetize(tpcb
, m
, eotsdu
)
register struct tp_pcb
*tpcb
;
register struct sockbuf
*sb
= &tpcb
->tp_sock
->so_snd
;
int maxsize
= tpcb
->tp_l_tpdusize
- tp_headersize(DT_TPDU_type
, tpcb
)
- (tpcb
->tp_use_checksum
?4:0) ;
int totlen
= m
->m_pkthdr
.len
;
* Pre-packetize the data in the sockbuf
* according to negotiated mtu. Do it here
* where we can safely wait for mbufs.
* This presumes knowledge of sockbuf conventions.
* TODO: allocate space for header and fill it in (once!).
printf("SEND BF: maxsize %d totlen %d eotsdu %d sndnum 0x%x\n",
maxsize
, totlen
, eotsdu
, tpcb
->tp_sndnum
);
if (tpcb
->tp_oktonagle
) {
if ((n
= sb
->sb_mb
) == 0)
SEQ_INC(tpcb
, tpcb
->tp_sndnum
);
if (totlen
+ n
->m_pkthdr
.len
< maxsize
) {
/* There is an unsent packet with space, combine data */
n
->m_pkthdr
.len
+= totlen
;
if ((m
= m_split(n
, maxsize
, M_WAIT
)) == 0)
SEQ_INC(tpcb
, tpcb
->tp_sndnum
);
n
->m_flags
|= M_EOR
; /* XXX belongs at end */
SEQ_DEC(tpcb
, tpcb
->tp_sndnum
);
printf("SEND out: oktonagle %d sndnum 0x%x\n",
tpcb
->tp_oktonagle
, tpcb
->tp_sndnum
);
* tp.trans on arrival of a DT tpdu
* FUNCTION, ARGUMENTS, and RETURN VALUE:
* a) something new arrived and it's got eotsdu_reached bit on,
* b) this arrival was caused other out-of-sequence things to be
* c) this arrival is the highest seq # for which we last gave credit
* (sender just sent a whole window)
* In other words, returns 1 if tp should send an ack immediately, 0 if
* the ack can wait a while.
* Note: this implementation no longer renegs on credit, (except
* when debugging option D_RENEG is on, for the purpose of testing
* ack subsequencing), so we don't need to check for incoming tpdus
* being in a reneged portion of the window.
register struct tp_pcb
*tpcb
;
register struct tp_event
*e
;
register int ack_reason
= tpcb
->tp_ack_strat
& ACK_STRAT_EACH
;
/* 0--> delay acks until full window */
#define E e->ATTR(DT_TPDU)
#define E e->ev_union.EV_DT_TPDU
register struct mbuf
*n
= E
.e_data
;
dump_mbuf(tpcb
->tp_sock
->so_rcv
.sb_mb
,
"stash: so_rcv before appending");
"stash: e_data before appending");
PStat(tpcb
, Nb_from_ll
) += E
.e_datalen
;
tpmeas(tpcb
->tp_lref
, TPtime_from_ll
, &e
->e_time
,
E
.e_seq
, (u_int
)PStat(tpcb
, Nb_from_ll
), (u_int
)E
.e_datalen
);
if (E
.e_seq
== tpcb
->tp_rcvnxt
) {
printf("stash EQ: seq 0x%x datalen 0x%x eot 0x%x\n",
E
.e_seq
, E
.e_datalen
, E
.e_eot
);
tptraceTPCB(TPPTmisc
, "stash EQ: seq len eot",
E
.e_seq
, E
.e_datalen
, E
.e_eot
, 0);
sbappend(&tpcb
->tp_sock
->so_rcv
, E
.e_data
);
SEQ_INC( tpcb
, tpcb
->tp_rcvnxt
);
* move chains from the reassembly queue to the socket buffer
register struct mbuf
**mp
;
mp
= tpcb
->tp_rsyq
+ (tpcb
->tp_rcvnxt
% tpcb
->tp_maxlcredit
);
mplim
= tpcb
->tp_rsyq
+ tpcb
->tp_maxlcredit
;
while (tpcb
->tp_rsycnt
&& *mp
) {
sbappend(&tpcb
->tp_sock
->so_rcv
, *mp
);
SEQ_INC(tpcb
, tpcb
->tp_rcvnxt
);
ack_reason
|= ACK_REORDER
;
dump_mbuf(tpcb
->tp_sock
->so_rcv
.sb_mb
,
"stash: so_rcv after appending");
register struct mbuf
**mp
;
tptraceTPCB(TPPTmisc
, "stash Reseq: seq rcvnxt lcdt",
E
.e_seq
, tpcb
->tp_rcvnxt
, tpcb
->tp_lcredit
, 0);
uwe
= SEQ(tpcb
, tpcb
->tp_rcvnxt
+ tpcb
->tp_maxlcredit
);
if (tpcb
->tp_rsyq
== 0 ||
!IN_RWINDOW(tpcb
, E
.e_seq
, tpcb
->tp_rcvnxt
, uwe
)) {
} else if (*(mp
= tpcb
->tp_rsyq
+ (E
.e_seq
% tpcb
->tp_maxlcredit
))) {
printf("tp_stash - drop & ack\n");
/* retransmission - drop it and force an ack */
IncPStat(tpcb
, tps_n_ack_cuz_dup
);
/* there were some comments of historical interest here. */
if ( E
.e_seq
== tpcb
->tp_sent_uwe
)
ack_reason
|= ACK_STRAT_FULLWIN
;
"end of stash, eot, ack_reason, sent_uwe ",
E
.e_eot
, ack_reason
, tpcb
->tp_sent_uwe
, 0);
if ( ack_reason
== ACK_DONT
) {
IncStat( ts_ackreason
[ACK_DONT
] );
if(ack_reason
& ACK_STRAT_EACH
) {
IncPStat(tpcb
, tps_n_ack_cuz_strat
);
} else if(ack_reason
& ACK_STRAT_FULLWIN
) {
IncPStat(tpcb
, tps_n_ack_cuz_fullwin
);
} else if(ack_reason
& ACK_REORDER
) {
IncPStat(tpcb
, tps_n_ack_cuz_reorder
);
tpmeas(tpcb
->tp_lref
, TPtime_ack_sent
, 0,
SEQ_ADD(tpcb
, E
.e_seq
, 1), 0, 0);
/* keep track of all reasons that apply */
for( i
=1; i
<_ACK_NUM_REASONS_
;i
++) {
if( ack_reason
& (1<<i
) )
IncStat( ts_ackreason
[i
] );
* tp_rsyflush - drop all the packets on the reassembly queue.
* Do this when closing the socket, or when somebody has changed
* the space avaible in the receive socket (XXX).
register struct tp_pcb
*tpcb
;
register struct mbuf
*m
, **mp
;
for (mp
== tpcb
->tp_rsyq
+ tpcb
->tp_maxlcredit
;
printf("tp_rsyflush %x\n", tpcb
);
free((caddr_t
)tpcb
->tp_rsyq
, M_PCB
);
register struct tp_pcb
*tpcb
;
register struct socket
*so
= tpcb
->tp_sock
;
int maxcredit
= tpcb
->tp_xtd_format
? 0xffff : 0xf;
int old_credit
= tpcb
->tp_maxlcredit
;
tpcb
->tp_maxlcredit
= maxcredit
= min(maxcredit
,
(so
->so_rcv
.sb_hiwat
+ tpcb
->tp_l_tpdusize
)/ tpcb
->tp_l_tpdusize
);
if (old_credit
== tpcb
->tp_maxlcredit
&& tpcb
->tp_rsyq
!= 0)
maxcredit
*= sizeof(struct mbuf
*);
if (rsyq
= (caddr_t
)malloc(maxcredit
, M_PCB
, M_NOWAIT
))
tpcb
->tp_rsyq
= (struct mbuf
**)rsyq
;
register struct mbuf
*n
, *m
;
register int len
= 0, mbcnt
= 0, pktlen
;
struct sockbuf
*sb
= &tpcb
->tp_sock
->so_snd
;
for (n
= sb
->sb_mb
; n
; n
= n
->m_nextpkt
) {
if ((n
->m_flags
& M_PKTHDR
) == 0)
panic("tpsbcheck nohdr");
pktlen
= len
+ n
->m_pkthdr
.len
;
for (m
= n
; m
; m
= m
->m_next
) {
mbcnt
+= m
->m_ext
.ext_size
;
printf("test %d; len %d != pktlen %d on mbuf 0x%x\n",
panic("tpsbcheck short");
if (len
!= sb
->sb_cc
|| mbcnt
!= sb
->sb_mbcnt
) {
printf("test %d: cc %d != %d || mbcnt %d != %d\n", i
, len
, sb
->sb_cc
,