<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Recent changes to bugs</title><link>https://sourceforge.net/p/nsnam/bugs/</link><description>Recent changes to bugs</description><atom:link href="https://sourceforge.net/p/nsnam/bugs/feed.rss" rel="self"/><language>en</language><lastBuildDate>Wed, 10 Dec 2014 07:37:40 -0000</lastBuildDate><atom:link href="https://sourceforge.net/p/nsnam/bugs/feed.rss" rel="self" type="application/rss+xml"/><item><title>#80 A problem when I use FullTCP with SACK</title><link>https://sourceforge.net/p/nsnam/bugs/80/?limit=25#9b84/b28d</link><description>&lt;div class="markdown_content"&gt;&lt;p&gt;Hi &lt;/p&gt;
&lt;p&gt;I think this is a policy decision in implementation of SACK report.&lt;br /&gt;
Perhaps, to provide some kind of variable can avoid unnecessary timeout due to the sender cannot re-transmit the missing seq when "p-&amp;gt;next_ == NULL".&lt;/p&gt;&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Chien-Ming Chou</dc:creator><pubDate>Wed, 10 Dec 2014 07:37:40 -0000</pubDate><guid isPermaLink="false">https://sourceforge.net38a589e921c9c9403f171fb1cebadfc7220505a0</guid></item><item><title>#80 A problem when I use FullTCP with SACK</title><link>https://sourceforge.net/p/nsnam/bugs/80/?limit=25#9b84</link><description>&lt;div class="markdown_content"&gt;&lt;p&gt;Do you think this is a bug, or just a policy decision in how to implement the option?  You mentioned that changing the threshold to one may increase the number of unnecessary retransmissions.&lt;/p&gt;
&lt;p&gt;In such a case (if this is not strictly an error but an implementation choice) then the choices seem to be to leave it as it is, or to provide some kind of variable that controls whether two or one is the threshold value.&lt;/p&gt;&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Tom Henderson</dc:creator><pubDate>Wed, 10 Dec 2014 03:12:36 -0000</pubDate><guid isPermaLink="false">https://sourceforge.nete5679e7c5a332cc9f2e54595026c56c746df6e38</guid></item><item><title>#80 A problem when I use FullTCP with SACK</title><link>https://sourceforge.net/p/nsnam/bugs/80/?limit=25#ce85/be51</link><description>&lt;div class="markdown_content"&gt;&lt;p&gt;Hi Tom,&lt;/p&gt;
&lt;p&gt;According to my observation, current implementation of SACK report in ns2&lt;br /&gt;
only triggers when the number of missing packets (i.e., hold) are more than one.&lt;/p&gt;
&lt;p&gt;There is a trick part &lt;br /&gt;
if the packet retransmission of missing packets triggers by only one SACK's hold,&lt;br /&gt;
the frequency of packet retransmission will be increased to generate some redundancy retransmission packets. &lt;/p&gt;
&lt;p&gt;if the packet retransmission of missing packets trigger by at least two SACK's holds (i.e., current implementation in ns2), the packet retransmission might not trigger when the number of missing packets is only one. &lt;/p&gt;
&lt;p&gt;I have no good solution and only force to trigger packet retransmission when the number of hold is not zero.&lt;/p&gt;
&lt;p&gt;=== only insertion else if (p-&amp;gt;next_ == NULL){} in ReassemblyQueue::nexthole() === &lt;/p&gt;
&lt;div class="codehilite"&gt;&lt;pre&gt;    &lt;span class="c1"&gt;// seq# is covered by SACK region&lt;/span&gt;
    &lt;span class="c1"&gt;// so the hole is at the end of the region&lt;/span&gt;
    &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="p"&gt;((&lt;/span&gt;&lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;startseq_&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;=&lt;/span&gt; &lt;span class="n"&gt;seq&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;&amp;amp;&amp;amp;&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;endseq_&lt;/span&gt; &lt;span class="o"&gt;&amp;gt;=&lt;/span&gt; &lt;span class="n"&gt;seq&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
        &lt;span class="c1"&gt;//printf("p-&amp;gt;startseq_ &amp;lt;= seq) &amp;amp;&amp;amp; (p-&amp;gt;endseq_ &amp;gt;= seq),  p-&amp;gt;next_ %d\n", p-&amp;gt;next_);&lt;/span&gt;
        &lt;span class="c1"&gt;//printf("seq %d p-&amp;gt;startseq_ %d p-&amp;gt;endseq_ %d p-&amp;gt;next_ %d\n", seq, p-&amp;gt;startseq_, p-&amp;gt;endseq_, p-&amp;gt;next_);&lt;/span&gt;
        &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;next_&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
            &lt;span class="c1"&gt;//printf("p-&amp;gt;next_\n");&lt;/span&gt;
            &lt;span class="n"&gt;cnts&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;next_&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;nxtcnt&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;nxtbytes&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
        &lt;span class="p"&gt;}&lt;/span&gt;

        &lt;span class="k"&gt;else&lt;/span&gt; &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;next_&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="nb"&gt;NULL&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
            &lt;span class="n"&gt;nxtbytes&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;endseq_&lt;/span&gt; &lt;span class="o"&gt;-&lt;/span&gt; &lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;startseq_&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
            &lt;span class="n"&gt;nxtcnt&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
        &lt;span class="p"&gt;}&lt;/span&gt;

        &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;endseq_&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
    &lt;span class="p"&gt;}&lt;/span&gt;
&lt;/pre&gt;&lt;/div&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Chien-Ming Chou</dc:creator><pubDate>Fri, 05 Dec 2014 16:26:37 -0000</pubDate><guid isPermaLink="false">https://sourceforge.netd78f2b4167723f2c8125e2da9f759554f5e9d1ad</guid></item><item><title>#79 Patch for TORA memory corruption in IMEP layer</title><link>https://sourceforge.net/p/nsnam/bugs/79/?limit=25#71d0</link><description>&lt;div class="markdown_content"&gt;&lt;ul&gt;
&lt;li&gt;&lt;strong&gt;status&lt;/strong&gt;: open --&amp;gt; closed&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Group&lt;/strong&gt;:  --&amp;gt; v1.0 (example)&lt;/li&gt;
&lt;/ul&gt;&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Tom Henderson</dc:creator><pubDate>Sat, 29 Nov 2014 18:34:15 -0000</pubDate><guid isPermaLink="false">https://sourceforge.nete83896df76165874d0929a460d9b44efbe39f291</guid></item><item><title>#76 Problem compiling of nam-1.15 with ns-allinone-2.35</title><link>https://sourceforge.net/p/nsnam/bugs/76/?limit=25#59cd</link><description>&lt;div class="markdown_content"&gt;&lt;ul&gt;
&lt;li&gt;&lt;strong&gt;status&lt;/strong&gt;: open --&amp;gt; closed&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Group&lt;/strong&gt;:  --&amp;gt; v1.0 (example)&lt;/li&gt;
&lt;/ul&gt;&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Tom Henderson</dc:creator><pubDate>Tue, 25 Nov 2014 22:05:33 -0000</pubDate><guid isPermaLink="false">https://sourceforge.net6bf4c2217e0f63368a268893483bc23516a257f1</guid></item><item><title>#80 A problem when I use FullTCP with SACK</title><link>https://sourceforge.net/p/nsnam/bugs/80/?limit=25#ce85</link><description>&lt;div class="markdown_content"&gt;&lt;p&gt;can you provide a patch that you believe will fix this without side effects?&lt;/p&gt;&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Tom Henderson</dc:creator><pubDate>Tue, 25 Nov 2014 21:48:52 -0000</pubDate><guid isPermaLink="false">https://sourceforge.net65ebf86363625f2bc721dc47bb9dbc1af78b8831</guid></item><item><title>#81 Reporting a Problem Regarding CRCN Simulator</title><link>https://sourceforge.net/p/nsnam/bugs/81/?limit=25#0d25</link><description>&lt;div class="markdown_content"&gt;&lt;ul&gt;
&lt;li&gt;&lt;strong&gt;status&lt;/strong&gt;: open --&amp;gt; wont-fix&lt;/li&gt;
&lt;/ul&gt;&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Tom Henderson</dc:creator><pubDate>Tue, 25 Nov 2014 21:45:31 -0000</pubDate><guid isPermaLink="false">https://sourceforge.net392070aedd6e7ca0e1af3a3872b6f52e21509685</guid></item><item><title>Reporting a Problem Regarding CRCN Simulator</title><link>https://sourceforge.net/p/nsnam/bugs/81/</link><description>&lt;div class="markdown_content"&gt;&lt;p&gt;Package: CRCN Simulator based on ns-2&lt;/p&gt;
&lt;p&gt;Version: ns-2.31&lt;/p&gt;
&lt;p&gt;Operating System: Linux, Ubuntu 12.04&lt;/p&gt;
&lt;p&gt;Environment Variables:&lt;br /&gt;
LD_LIBRARY_PATH=/home/user/ns-allinone-2.31/otcl-1.13:/home/user/ns-allinone-2.31/lib:/home/user/ns-allinone-2.31/lib:$LD_LIBRARY_PATH&lt;br /&gt;
PATH=/home/user/ns-allinone-2.31/bin:/home/user/ns-allinone-2.31/tcl8.4.14/unix:/home/user/ns-allinone-2.31/tk8.4.14/unix:/home/user/ns-allinone-2.31/bin:$PATH&lt;br /&gt;
TCL_LIBRARY=/home/user/ns-allinone-2.31/tcl8.4.14/library&lt;/p&gt;
&lt;p&gt;Keywords: CRCN, ns-2.3, Segmentation Fault.&lt;/p&gt;
&lt;p&gt;Description of Problem:&lt;br /&gt;
CRCN (Cognitive Radio Cognitive Network) simulator is developed under ns-2.31. After successful installation of CRCN package into ns-2.31, I tried to change the MAX_CHANNEL in phy.h, mobilenode.h and topography.h files into 2. Once I executed the MRMAC.tcl example, I faced with a segmentation fault (core dumped) error.&lt;/p&gt;
&lt;p&gt;How Easily Reproducible:&lt;br /&gt;
Every time.&lt;/p&gt;
&lt;p&gt;Steps to Reproduce:&lt;br /&gt;
1. Install CRCN package using make command after installation of ns-2.31,&lt;br /&gt;
2. Try to change the value of MAX_CHANNEL(S) macro in phy.h, mobilenode.h and topography.h files into 2,&lt;br /&gt;
3. Run the MRMAC.tcl sample with no changes in the scripts.&lt;/p&gt;
&lt;p&gt;Actual Results:&lt;br /&gt;
You will see a segmentation fault (core dumped) error.&lt;/p&gt;
&lt;p&gt;Expected Results:&lt;br /&gt;
It should not show the above result and must work correctly showing "Starting Simulation ..." message at the end of simulation. &lt;/p&gt;
&lt;p&gt;Additional Information:&lt;br /&gt;
1. CRCN package could be downloaded via the following link&lt;br /&gt;
&lt;a href="http://faculty.uml.edu/Tricia_Chigan/Research/CRCN%20user%20code%203/CRCN%20user%20code%203/crcn.zip" rel="nofollow"&gt;http://faculty.uml.edu/Tricia_Chigan/Research/CRCN%20user%20code%203/CRCN%20user%20code%203/crcn.zip&lt;/a&gt;&lt;br /&gt;
2. Installation guide is accessible through this link&lt;br /&gt;
&lt;a href="http://faculty.uml.edu/Tricia_Chigan/Research/installation.htm" rel="nofollow"&gt;http://faculty.uml.edu/Tricia_Chigan/Research/installation.htm&lt;/a&gt;&lt;/p&gt;&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Naji</dc:creator><pubDate>Wed, 14 May 2014 20:42:55 -0000</pubDate><guid isPermaLink="false">https://sourceforge.netb04dce177ccc7567defebf827cd9609c94726c6b</guid></item><item><title>Reporting a Problem Regarding CRCN Simulator</title><link>https://sourceforge.net/p/nsnam/bugs/81/</link><description>&lt;div class="markdown_content"&gt;&lt;p&gt;Ticket 81 has been modified: Reporting a Problem Regarding CRCN Simulator&lt;br /&gt;
Edited By: Tom Henderson (tom_henderson)&lt;br /&gt;
Status updated: u'open' =&amp;gt; u'wont-fix'&lt;/p&gt;&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Naji</dc:creator><pubDate>Wed, 14 May 2014 20:42:55 -0000</pubDate><guid isPermaLink="false">https://sourceforge.net831fb2fa6feea8213c335bba1ca81eec6b365cc8</guid></item><item><title>A problem when I use FullTCP with SACK</title><link>https://sourceforge.net/p/nsnam/bugs/80/</link><description>&lt;div class="markdown_content"&gt;&lt;p&gt;Dear sir, &lt;/p&gt;
&lt;p&gt;When I used FullTCP with SACK, I found a problem that &lt;br /&gt;
the final one of SACK report cannot use due to non next one. &lt;br /&gt;
My description shows in the following:&lt;/p&gt;
&lt;p&gt;The code location is &lt;br /&gt;
int&lt;br /&gt;
SackFullTcpAgent::nxt_tseq()&lt;br /&gt;
{&lt;/p&gt;
&lt;div class="codehilite"&gt;&lt;pre&gt;&lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;in_recovery&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;highest_ack_&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;&lt;/span&gt; &lt;span class="n"&gt;recover_&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
&lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;seq&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;h_seqno_&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;

&lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="o"&gt;!&lt;/span&gt;&lt;span class="n"&gt;in_recovery&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
&lt;/pre&gt;&lt;/div&gt;
&lt;p&gt;//if (int(t_seqno_) &amp;gt; 1)&lt;br /&gt;
printf("%f: non-recovery nxt_tseq called w/t_seqno:%d\n",&lt;br /&gt;
now(), int(t_seqno_));&lt;br /&gt;
sq_.dumplist();&lt;br /&gt;
        return (t_seqno_);&lt;br /&gt;
    }&lt;/p&gt;
&lt;div class="codehilite"&gt;&lt;pre&gt;&lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;fcnt&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;   &lt;span class="c1"&gt;// following count-- the&lt;/span&gt;
        &lt;span class="c1"&gt;// count field in the block&lt;/span&gt;
        &lt;span class="c1"&gt;// after the seq# we are about&lt;/span&gt;
        &lt;span class="c1"&gt;// to send&lt;/span&gt;
&lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;fbytes&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="c1"&gt;// fcnt in bytes&lt;/span&gt;
&lt;/pre&gt;&lt;/div&gt;
&lt;p&gt;//if (int(t_seqno_) &amp;gt; 1)&lt;br /&gt;
printf("%f: recovery nxt_tseq called w/t_seqno:%d, seq:%d, mode:%d\n",&lt;br /&gt;
now(), int(t_seqno_), seq, sack_rtx_threshmode_);&lt;br /&gt;
sq_.dumplist();&lt;/p&gt;
&lt;div class="codehilite"&gt;&lt;pre&gt;&lt;span class="k"&gt;while&lt;/span&gt; &lt;span class="p"&gt;((&lt;/span&gt;&lt;span class="n"&gt;seq&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;sq_&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="n"&gt;nexthole&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;seq&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;fcnt&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;fbytes&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt; &lt;span class="o"&gt;&amp;gt;&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
    &lt;span class="c1"&gt;// if we have a following block&lt;/span&gt;
    &lt;span class="c1"&gt;// with a large enough count&lt;/span&gt;
    &lt;span class="c1"&gt;// we should use the seq# we get&lt;/span&gt;
    &lt;span class="c1"&gt;// from nexthole()&lt;/span&gt;

    &lt;span class="n"&gt;printf&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s"&gt;&amp;quot; next hole seq %d, h_seqno_ %d, fcnt %d sack_rtx_cthresh_ %d, sack_rtx_threshmode_ %d &lt;/span&gt;&lt;span class="se"&gt;\n&lt;/span&gt;&lt;span class="s"&gt;&amp;quot;&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="kt"&gt;int&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;seq&lt;/span&gt;&lt;span class="p"&gt;),&lt;/span&gt; &lt;span class="n"&gt;h_seqno_&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;fcnt&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;sack_rtx_cthresh_&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;sack_rtx_threshmode_&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;

    &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;sack_rtx_threshmode_&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt; &lt;span class="o"&gt;||&lt;/span&gt;
        &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;sack_rtx_threshmode_&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="o"&gt;&amp;amp;&amp;amp;&lt;/span&gt; &lt;span class="n"&gt;fcnt&lt;/span&gt; &lt;span class="o"&gt;&amp;gt;=&lt;/span&gt; &lt;span class="n"&gt;sack_rtx_cthresh_&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;||&lt;/span&gt;
        &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;sack_rtx_threshmode_&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;2&lt;/span&gt; &lt;span class="o"&gt;&amp;amp;&amp;amp;&lt;/span&gt; &lt;span class="n"&gt;fbytes&lt;/span&gt; &lt;span class="o"&gt;&amp;gt;=&lt;/span&gt; &lt;span class="n"&gt;sack_rtx_bthresh_&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;||&lt;/span&gt;
        &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;sack_rtx_threshmode_&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;3&lt;/span&gt; &lt;span class="o"&gt;&amp;amp;&amp;amp;&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;fcnt&lt;/span&gt; &lt;span class="o"&gt;&amp;gt;=&lt;/span&gt; &lt;span class="n"&gt;sack_rtx_cthresh_&lt;/span&gt; &lt;span class="o"&gt;||&lt;/span&gt; &lt;span class="n"&gt;fbytes&lt;/span&gt; &lt;span class="o"&gt;&amp;gt;=&lt;/span&gt; &lt;span class="n"&gt;sack_rtx_bthresh_&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt; &lt;span class="o"&gt;||&lt;/span&gt;
        &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;sack_rtx_threshmode_&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;4&lt;/span&gt; &lt;span class="o"&gt;&amp;amp;&amp;amp;&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;fcnt&lt;/span&gt; &lt;span class="o"&gt;&amp;gt;=&lt;/span&gt; &lt;span class="n"&gt;sack_rtx_cthresh_&lt;/span&gt; &lt;span class="o"&gt;&amp;amp;&amp;amp;&lt;/span&gt; &lt;span class="n"&gt;fbytes&lt;/span&gt; &lt;span class="o"&gt;&amp;gt;=&lt;/span&gt; &lt;span class="n"&gt;sack_rtx_bthresh_&lt;/span&gt;&lt;span class="p"&gt;)))&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
&lt;/pre&gt;&lt;/div&gt;
&lt;p&gt;//if (int(t_seqno_) &amp;gt; 1)&lt;br /&gt;
printf("%f: nxt_tseq returning %d\n", now(), int(seq));&lt;br /&gt;
            // adjust h_seqno, as we may have&lt;br /&gt;
            // been "jumped ahead" by learning&lt;br /&gt;
            // about a filled hole&lt;br /&gt;
            if (seq &amp;gt; h_seqno_)&lt;br /&gt;
                h_seqno_ = seq;&lt;br /&gt;
            return (seq);&lt;br /&gt;
        } else if (fcnt &amp;lt;= 0)&lt;br /&gt;
            break;&lt;br /&gt;
        else {&lt;br /&gt;
            seq += maxseg_;&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
//if (int(t_seqno_) &amp;gt; 1)&lt;br /&gt;
printf("%f: nxt_tseq returning %d\n", now(), int(t_seqno_));&lt;br /&gt;
    return (t_seqno_);&lt;br /&gt;
}&lt;/p&gt;
&lt;p&gt;when the code execute "seq = sq_.nexthole(seq, fcnt, fbytes)"&lt;br /&gt;
It will call "rq.cc" to select nexthold()&lt;/p&gt;
&lt;p&gt;int&lt;br /&gt;
ReassemblyQueue::nexthole(TcpSeq seq, int&amp;amp; nxtcnt, int&amp;amp; nxtbytes)&lt;br /&gt;
{&lt;br /&gt;
    printf(" ReassemblyQueue::nexthole \n");&lt;br /&gt;
    nxtbytes = nxtcnt = -1;&lt;br /&gt;
    hint_ = head_;&lt;/p&gt;
&lt;div class="codehilite"&gt;&lt;pre&gt;&lt;span class="n"&gt;seginfo&lt;/span&gt;&lt;span class="o"&gt;*&lt;/span&gt; &lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;p&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;hint_&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="n"&gt;p&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;next_&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
    &lt;span class="c1"&gt;// seq# is prior to SACK region&lt;/span&gt;
    &lt;span class="c1"&gt;// so seq# is a legit hole&lt;/span&gt;
    &lt;span class="n"&gt;printf&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s"&gt;&amp;quot;seq %d p-&amp;gt;startseq_ %d p-&amp;gt;endseq_ %d&lt;/span&gt;&lt;span class="se"&gt;\n&lt;/span&gt;&lt;span class="s"&gt;&amp;quot;&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;seq&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;startseq_&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;endseq_&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
    &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;startseq_&lt;/span&gt; &lt;span class="o"&gt;&amp;gt;&lt;/span&gt; &lt;span class="n"&gt;seq&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
        &lt;span class="n"&gt;printf&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s"&gt;&amp;quot;p-&amp;gt;startseq_ &amp;gt; seq&lt;/span&gt;&lt;span class="se"&gt;\n&lt;/span&gt;&lt;span class="s"&gt;&amp;quot;&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
        &lt;span class="n"&gt;cnts&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;nxtcnt&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;nxtbytes&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
        &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;seq&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
    &lt;span class="p"&gt;}&lt;/span&gt;

    &lt;span class="c1"&gt;// seq# is covered by SACK region&lt;/span&gt;
    &lt;span class="c1"&gt;// so the hole is at the end of the region&lt;/span&gt;
    &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="p"&gt;((&lt;/span&gt;&lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;startseq_&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;=&lt;/span&gt; &lt;span class="n"&gt;seq&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;&amp;amp;&amp;amp;&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;endseq_&lt;/span&gt; &lt;span class="o"&gt;&amp;gt;=&lt;/span&gt; &lt;span class="n"&gt;seq&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
        &lt;span class="n"&gt;printf&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s"&gt;&amp;quot;p-&amp;gt;startseq_ &amp;lt;= seq) &amp;amp;&amp;amp; (p-&amp;gt;endseq_ &amp;gt;= seq),  p-&amp;gt;next_ %d&lt;/span&gt;&lt;span class="se"&gt;\n&lt;/span&gt;&lt;span class="s"&gt;&amp;quot;&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;next_&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
        &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;next_&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
            &lt;span class="n"&gt;printf&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s"&gt;&amp;quot;p-&amp;gt;next_&lt;/span&gt;&lt;span class="se"&gt;\n&lt;/span&gt;&lt;span class="s"&gt;&amp;quot;&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
            &lt;span class="n"&gt;cnts&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;next_&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;nxtcnt&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;nxtbytes&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
        &lt;span class="p"&gt;}&lt;/span&gt;
        &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;endseq_&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
    &lt;span class="p"&gt;}&lt;/span&gt;
&lt;span class="p"&gt;}&lt;/span&gt;
&lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
&lt;/pre&gt;&lt;/div&gt;
&lt;p&gt;}&lt;/p&gt;
&lt;p&gt;For example, my sq_.dumplist() shows as follows:&lt;br /&gt;
FIFO &lt;span&gt;[size:33878]&lt;/span&gt;: &lt;span&gt;[-&amp;gt;285358, 286661&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;287964, 289267&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;290570, 291873&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;293176, 294479&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;295782, 297085&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;298388, 299691&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;300994, 302297&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;303600, 304903&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;306206, 307509&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;308812, 310115&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;311418, 312721&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;314024, 315327&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;316630, 317933&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;319236, 320539&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;321842, 323145&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;324448, 325751&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;327054, 328357&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;329660, 330963&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;332266, 333569&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;334872, 336175&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;337478, 338781&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;340084, 341387&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;342690, 343993&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;345296, 346599&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;347902, 349205&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;350508, 351811&amp;lt;-]&lt;/span&gt;&lt;br /&gt;
&lt;span&gt;[-&amp;gt;350508, 351811&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;347902, 349205&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;345296, 346599&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;342690, 343993&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;340084, 341387&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;337478, 338781&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;334872, 336175&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;332266, 333569&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;329660, 330963&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;327054, 328357&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;324448, 325751&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;321842, 323145&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;319236, 320539&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;316630, 317933&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;314024, 315327&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;311418, 312721&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;308812, 310115&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;306206, 307509&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;303600, 304903&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;300994, 302297&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;298388, 299691&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;295782, 297085&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;293176, 294479&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;290570, 291873&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;287964, 289267&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;285358, 286661&amp;lt;-]&lt;/span&gt;&lt;br /&gt;
LIFO: &lt;span&gt;[-&amp;gt;350508, 351811&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;347902, 349205&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;345296, 346599&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;342690, 343993&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;340084, 341387&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;337478, 338781&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;334872, 336175&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;332266, 333569&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;329660, 330963&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;327054, 328357&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;324448, 325751&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;321842, 323145&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;319236, 320539&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;316630, 317933&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;314024, 315327&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;311418, 312721&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;308812, 310115&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;306206, 307509&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;303600, 304903&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;300994, 302297&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;298388, 299691&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;295782, 297085&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;293176, 294479&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;290570, 291873&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;287964, 289267&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;285358, 286661&amp;lt;-]&lt;/span&gt;&lt;br /&gt;
&lt;span&gt;[-&amp;gt;285358, 286661&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;287964, 289267&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;290570, 291873&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;293176, 294479&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;295782, 297085&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;298388, 299691&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;300994, 302297&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;303600, 304903&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;306206, 307509&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;308812, 310115&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;311418, 312721&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;314024, 315327&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;316630, 317933&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;319236, 320539&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;321842, 323145&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;324448, 325751&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;327054, 328357&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;329660, 330963&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;332266, 333569&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;334872, 336175&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;337478, 338781&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;340084, 341387&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;342690, 343993&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;345296, 346599&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;347902, 349205&amp;lt;-]&lt;/span&gt;&lt;span&gt;[-&amp;gt;350508, 351811&amp;lt;-]&lt;/span&gt;&lt;br /&gt;
RCVNXT: 284055&lt;/p&gt;
&lt;p&gt;ReassemblyQueue::nexthole &lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 285358 p-&amp;gt;endseq_ 286661&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 287964 p-&amp;gt;endseq_ 289267&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 290570 p-&amp;gt;endseq_ 291873&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 293176 p-&amp;gt;endseq_ 294479&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 295782 p-&amp;gt;endseq_ 297085&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 298388 p-&amp;gt;endseq_ 299691&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 300994 p-&amp;gt;endseq_ 302297&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 303600 p-&amp;gt;endseq_ 304903&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 306206 p-&amp;gt;endseq_ 307509&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 308812 p-&amp;gt;endseq_ 310115&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 311418 p-&amp;gt;endseq_ 312721&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 314024 p-&amp;gt;endseq_ 315327&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 316630 p-&amp;gt;endseq_ 317933&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 319236 p-&amp;gt;endseq_ 320539&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 321842 p-&amp;gt;endseq_ 323145&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 324448 p-&amp;gt;endseq_ 325751&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 327054 p-&amp;gt;endseq_ 328357&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 329660 p-&amp;gt;endseq_ 330963&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 332266 p-&amp;gt;endseq_ 333569&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 334872 p-&amp;gt;endseq_ 336175&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 337478 p-&amp;gt;endseq_ 338781&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 340084 p-&amp;gt;endseq_ 341387&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 342690 p-&amp;gt;endseq_ 343993&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 345296 p-&amp;gt;endseq_ 346599&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 347902 p-&amp;gt;endseq_ 349205&lt;br /&gt;
seq 350508 p-&amp;gt;startseq_ 350508 p-&amp;gt;endseq_ 351811     &amp;lt;-- target&lt;br /&gt;
p-&amp;gt;startseq_ &amp;lt;= seq) &amp;amp;&amp;amp; (p-&amp;gt;endseq_ &amp;gt;= seq),  p-&amp;gt;next_ 0&lt;br /&gt;
 next hole seq 351811, h_seqno_ 350508, fcnt -1 sack_rtx_cthresh_ 1, sack_rtx_threshmode_ 1 &lt;br /&gt;
5.800364: nxt_tseq returning 371356&lt;/p&gt;
&lt;p&gt;In this case, the nxt_tseq returning should be "351811", but it is final one log in the SACK report. The cnts() will not execute in this case (due to final one so that p-&amp;gt;next_ == NULL).&lt;/p&gt;
&lt;div class="codehilite"&gt;&lt;pre&gt;&lt;span class="kr"&gt;if&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;p&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;next_&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;            &lt;span class="o"&gt;&amp;lt;---&lt;/span&gt; here&lt;span class="o"&gt;!!!&lt;/span&gt; 
printf&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s"&gt;&amp;quot;p-&amp;gt;next_\n&amp;quot;&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
cnts&lt;span class="p"&gt;(&lt;/span&gt;p&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;next_&lt;span class="p"&gt;,&lt;/span&gt; nxtcnt&lt;span class="p"&gt;,&lt;/span&gt; nxtbytes&lt;span class="p"&gt;);&lt;/span&gt;
&lt;span class="p"&gt;}&lt;/span&gt;
&lt;/pre&gt;&lt;/div&gt;
&lt;p&gt;The fcnt value always is 0 in SackFullTcpAgent::nxt_tseq().&lt;br /&gt;
Therefore, the return value is return (t_seqno_), NOT return (seq);&lt;/p&gt;
&lt;p&gt;The gap can only send when the sender got more SACK report (i.e. p-&amp;gt;next_ of nexthole != 0).&lt;/p&gt;
&lt;p&gt;In this period, it will happen unnecessary timeout due to the sender cannot retransmit the missing seq. &lt;/p&gt;&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Chien-Ming Chou</dc:creator><pubDate>Wed, 05 Mar 2014 09:52:27 -0000</pubDate><guid isPermaLink="false">https://sourceforge.net6a721ade46efafb52cf34fc64525acdfee760ef2</guid></item></channel></rss>