Searched refs:snd_holes (Results 1 - 5 of 5) sorted by relevance
/freebsd-10-stable/sys/netinet/ |
H A D | tcp_sack.c | 314 TAILQ_INSERT_AFTER(&tp->snd_holes, after, hole, scblink); 316 TAILQ_INSERT_TAIL(&tp->snd_holes, hole, scblink); 337 TAILQ_REMOVE(&tp->snd_holes, hole, scblink); 345 * tp->snd_holes is an ordered list of holes (oldest to newest, in terms of 367 if (SEQ_LT(tp->snd_una, th_ack) && !TAILQ_EMPTY(&tp->snd_holes)) { 415 if (TAILQ_EMPTY(&tp->snd_holes)) 426 * SACK holes (snd_holes) are traversed from their tails with just 473 KASSERT(!TAILQ_EMPTY(&tp->snd_holes), 475 cur = TAILQ_LAST(&tp->snd_holes, sackhole_head); /* Last SACK hole. */ 568 while ((q = TAILQ_FIRST(&tp->snd_holes)) ! [all...] |
H A D | tcp_var.h | 191 TAILQ_HEAD(sackhole_head, sackhole) snd_holes; member in struct:tcpcb
|
H A D | tcp_input.c | 1742 TAILQ_EMPTY(&tp->snd_holes)) { 2494 !TAILQ_EMPTY(&tp->snd_holes)))
|
H A D | tcp_usrreq.c | 2165 db_printf("snd_numholes: %d snd_holes first: %p\n", 2166 tp->snd_numholes, TAILQ_FIRST(&tp->snd_holes));
|
H A D | tcp_subr.c | 904 TAILQ_INIT(&tp->snd_holes);
|
Completed in 99 milliseconds