157 	if (!dccp_loss_free(s0, s1, n1)) {	/* gap between S0 and S1 */  in __do_track_loss()
185 			/* gap between S2 and S1: just update loss_prev */  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()
217 		 * Reorder history to insert S3 between S1 and S2  in __two_after_loss()
231 			/* hole between S0 and S1 filled by S3 */  in __two_after_loss()
239 				/* gap remains between S1 and 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()
266 	 * At this stage we know already that there is a gap between S0 and S1  in __three_after_loss()
269 	 * check for other possible gaps between S1/S2 and between S2/S3.  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()
289 	} else {	/* gap between S1 and S2 */  in __three_after_loss()