tcp cubic 算法分析注释

static void bictcp_cong_avoid(struct sock *sk, u32 ack, u32 in_flight)
{
struct tcp_sock *tp = tcp_sk(sk);
struct bictcp *ca = inet_csk_ca(sk);


if (!tcp_is_cwnd_limited(sk, in_flight))
return;


/*  after(ack, ca->end_seq): 表示end_seq-ack < 0 返回1, end_seq-ack >= 0 返回0*/
if (tp->snd_cwnd <= tp->snd_ssthresh) {
/*如果ack 包的序号大于,前面ACK 过数据*/
if (hystart && after(ack, ca->end_seq))
bictcp_hystart_reset(sk);
tcp_slow_start(tp);
} else {
bictcp_update(ca, tp->snd_cwnd);
tcp_cong_avoid_ai(tp, ca->cnt);
}


}


static u32 bictcp_recalc_ssthresh(struct sock *sk)
{
const struct tcp_sock *tp = tcp_sk(sk);
struct bictcp *ca = inet_csk_ca(sk);


ca->epoch_start = 0; /* end of epoch */


/* Wmax and fast convergence */
/*如果第二拥塞, 并且cwnd 值小于前面一次的cwnd, 进入该流程*/
if (tp->snd_cwnd < ca->last_max_cwnd && fast_convergence)
/*如果beta =1024, 那么ca->last_max