Lines Matching defs:saved_blks
178 struct sackblk head_blk,mid_blk,saved_blks[MAX_SACK_BLKS];
190 saved_blks[0].start = rcv_start;
191 saved_blks[0].end = rcv_end;
193 saved_blks[0].start = saved_blks[0].end = 0;
236 saved_blks[0].start = SEQ_MAX(rcv_start, head_blk.start);
237 saved_blks[0].end = SEQ_MIN(rcv_end, head_blk.end);
245 !((mid_blk.start == saved_blks[0].start) &&
246 (mid_blk.end == saved_blks[0].end))) ||
248 saved_blks[n].start = mid_blk.start;
249 saved_blks[n++].end = mid_blk.end;
255 saved_blks[n++] = tp->sackblks[j];
260 if (SEQ_LT(saved_blks[i].start, saved_blks[i].end)) {
261 tp->sackblks[j++] = saved_blks[i];
280 struct sackblk head_blk, saved_blks[MAX_SACK_BLKS];
301 * blocks into saved_blks[]. num_saved will have the number of the
349 SEQ_GEQ(saved_blks[num_saved-1].start, start) &&
350 SEQ_LEQ(saved_blks[num_saved-1].end, end))
352 saved_blks[num_saved].start = start;
353 saved_blks[num_saved].end = end;
362 SEQ_GEQ(saved_blks[num_saved-1].start, start) &&
363 SEQ_LEQ(saved_blks[num_saved-1].end, end))
368 saved_blks[num_saved].start = start;
369 saved_blks[num_saved].end = end;
400 bcopy(saved_blks, &tp->sackblks[num_head],
411 struct sackblk saved_blks[MAX_SACK_BLKS];
433 saved_blks[num_saved].start = start;
434 saved_blks[num_saved].end = end;
441 bcopy(saved_blks, &tp->sackblks[0],