154 	u64 s0 = tfrc_rx_hist_loss_prev(h)->tfrchrx_seqno,  in __do_track_loss()  local
157 	if (!dccp_loss_free(s0, s1, n1)) {	/* gap between S0 and S1 */  in __do_track_loss()
165 	u64 s0 = tfrc_rx_hist_loss_prev(h)->tfrchrx_seqno,  in __one_after_loss()  local
175 	/* S0  <  S2  <  S1 */  in __one_after_loss()
177 	if (dccp_loss_free(s0, s2, n2)) {  in __one_after_loss()
181 			/* hole is filled: S0, S2, and S1 are consecutive */  in __one_after_loss()
188 	} else {	/* gap between S0 and S2 */  in __one_after_loss()
190 		 * Reorder history to insert S2 between S0 and S1  in __one_after_loss()
202 	u64 s0 = tfrc_rx_hist_loss_prev(h)->tfrchrx_seqno,  in __two_after_loss()  local
225 	/* S0  <  S3  <  S1 */  in __two_after_loss()
227 	if (dccp_loss_free(s0, s3, n3)) {  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()
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()
266 	 * At this stage we know already that there is a gap between S0 and S1  in __three_after_loss()
267 	 * (since S0 was the highest sequence number received before detecting  in __three_after_loss()