Lines Matching full:s3
205 s3 = DCCP_SKB_CB(skb)->dccpd_seq; in __two_after_loss() local
207 if (likely(dccp_delta_seqno(s2, s3) > 0)) { /* S2 < S3 */ in __two_after_loss()
213 /* S3 < S2 */ in __two_after_loss()
215 if (dccp_delta_seqno(s1, s3) > 0) { /* S1 < S3 < S2 */ in __two_after_loss()
217 * Reorder history to insert S3 between S1 and S2 in __two_after_loss()
225 /* S0 < S3 < S1 */ in __two_after_loss()
227 if (dccp_loss_free(s0, s3, n3)) { in __two_after_loss()
230 if (dccp_loss_free(s3, s1, n1)) { in __two_after_loss()
231 /* hole between S0 and S1 filled by S3 */ in __two_after_loss()
235 /* entire hole filled by S0, S3, S1, S2 */ in __two_after_loss()
244 } else /* gap exists between S3 and S1, loss_count stays at 2 */ in __two_after_loss()
251 * The remaining case: S0 < S3 < S1 < S2; gap between S0 and S3 in __two_after_loss()
252 * Reorder history to insert S3 between S0 and S1. in __two_after_loss()
269 * check for other possible gaps between S1/S2 and between S2/S3. in __three_after_loss()
273 s3 = tfrc_rx_hist_entry(h, 3)->tfrchrx_seqno; in __three_after_loss() local
279 if (dccp_loss_free(s2, s3, n3)) { in __three_after_loss()
280 /* no gap between S2 and S3: entire hole is filled */ in __three_after_loss()
284 /* gap between S2 and S3 */ in __three_after_loss()