Lines Matching defs:end
143 head_blk.end = rcv_end;
153 tcp_seq end = tp->sackblks[i].end;
154 if (SEQ_GEQ(start, end) || SEQ_LEQ(start, tp->rcv_nxt)) {
158 } else if (SEQ_LEQ(head_blk.start, end) &&
159 SEQ_GEQ(head_blk.end, start)) {
166 if (SEQ_LT(head_blk.end, end))
167 head_blk.end = end;
173 saved_blks[num_saved].end = end;
219 tp->sackblks[i].start = tp->sackblks[i].end=0;
228 tcp_sackhole_alloc(struct tcpcb *tp, tcp_seq start, tcp_seq end)
243 hole->end = end;
268 tcp_sackhole_insert(struct tcpcb *tp, tcp_seq start, tcp_seq end,
274 hole = tcp_sackhole_alloc(tp, start, end);
327 sack_blocks[num_sack_blks++].end = th_ack;
335 sack.end = ntohl(sack.end);
336 if (SEQ_GT(sack.end, sack.start) &&
339 SEQ_LEQ(sack.end, tp->snd_max))
357 if (SEQ_GT(sack_blocks[i].end, sack_blocks[j].end)) {
394 tp->snd_fack = sblkp->end;
410 SEQ_LT(tp->snd_fack, sblkp->end))
411 tp->snd_fack = sblkp->end;
413 } else if (SEQ_LT(tp->snd_fack, sblkp->end))
415 tp->snd_fack = sblkp->end;
423 if (SEQ_GEQ(sblkp->start, cur->end)) {
431 if (SEQ_LEQ(sblkp->end, cur->start)) {
442 if (SEQ_GEQ(sblkp->end, cur->end)) {
454 cur->start = sblkp->end;
458 /* Data acks at least the end of hole */
459 if (SEQ_GEQ(sblkp->end, cur->end)) {
460 /* Move end of hole backward */
461 cur->end = sblkp->start;
462 cur->rxmit = SEQ_MIN(cur->rxmit, cur->end);
468 temp = tcp_sackhole_insert(tp, sblkp->end,
469 cur->end, cur);
477 cur->end = sblkp->start;
479 cur->end);
552 if (SEQ_LT(p->rxmit, p->end)) {
573 * with (rxmit == end). But, for all holes following the current hint,
576 * one node following the current hint with (start == rxmit == end).
577 * But that can't happen, (start == end) means that all the data in that hole
590 if (hole == NULL || SEQ_LT(hole->rxmit, hole->end))
593 if (SEQ_LT(hole->rxmit, hole->end)) {
628 * i) snd_nxt lies between end of one hole and beginning of another
629 * ii) snd_nxt lies between end of last hole and snd_fack
632 if (SEQ_LT(tp->snd_nxt, cur->end))
641 if (SEQ_LT(tp->snd_nxt, cur->end))