Lines Matching defs:num_saved
281 int num_head, num_saved, i;
301 * blocks into saved_blks[]. num_saved will have the number of the
304 num_saved = 0;
348 if ((num_saved >= 1) &&
349 SEQ_GEQ(saved_blks[num_saved-1].start, start) &&
350 SEQ_LEQ(saved_blks[num_saved-1].end, end))
351 num_saved--;
352 saved_blks[num_saved].start = start;
353 saved_blks[num_saved].end = end;
354 num_saved++;
361 if ((num_saved >= 1) &&
362 SEQ_GEQ(saved_blks[num_saved-1].start, start) &&
363 SEQ_LEQ(saved_blks[num_saved-1].end, end))
364 num_saved--;
368 saved_blks[num_saved].start = start;
369 saved_blks[num_saved].end = end;
370 num_saved++;
389 if (num_saved >= MAX_SACK_BLKS)
390 num_saved--;
396 if (num_saved > 0) {
401 sizeof(struct sackblk) * num_saved);
405 tp->rcv_numsacks = num_head + num_saved;
412 int num_saved, i;
420 num_saved = 0;
433 saved_blks[num_saved].start = start;
434 saved_blks[num_saved].end = end;
435 num_saved++;
437 if (num_saved > 0) {
442 sizeof(struct sackblk) * num_saved);
444 tp->rcv_numsacks = num_saved;