mirror of
https://git.haproxy.org/git/haproxy.git/
synced 2025-09-28 17:21:32 +02:00
af75665cb7
Add several callbacks to quic_cc_algo struct which are only called by BBR. ->get_drs() may be used to retrieve the delivery rate sampling information from an congestion algorithm struct (quic_cc). ->on_transmit() must be called before sending any packet a QUIC sender. ->on_ack_rcvd() must be called after having received an ACK. ->on_pkt_lost() must be called after having detected a packet loss. ->congestion_event() must be called after any congestion event detection Modify quic_cc.c to call ->event only if defined. This is not the case for BBR.
68 lines
2.1 KiB
C
68 lines
2.1 KiB
C
/*
|
|
* Congestion controller handling.
|
|
*
|
|
* This file contains definitions for QUIC congestion control.
|
|
*
|
|
* Copyright 2019 HAProxy Technologies, Frederic Lecaille <flecaille@haproxy.com>
|
|
*
|
|
* This library is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
* License as published by the Free Software Foundation, version 2.1
|
|
* exclusively.
|
|
*
|
|
* This library is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
* License along with this library; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*/
|
|
|
|
#include <haproxy/quic_cc.h>
|
|
#include <haproxy/quic_pacing.h>
|
|
|
|
struct quic_cc_algo *default_quic_cc_algo = &quic_cc_algo_cubic;
|
|
|
|
/*
|
|
* Initialize <cc> congestion control with <algo> as algorithm depending on <ipv4>
|
|
* a boolean which is true for an IPv4 path.
|
|
*/
|
|
void quic_cc_init(struct quic_cc *cc,
|
|
struct quic_cc_algo *algo, struct quic_conn *qc)
|
|
{
|
|
cc->qc = qc;
|
|
cc->algo = algo;
|
|
if (cc->algo->init)
|
|
(cc->algo->init(cc));
|
|
}
|
|
|
|
/* Send <ev> event to <cc> congestion controller. */
|
|
void quic_cc_event(struct quic_cc *cc, struct quic_cc_event *ev)
|
|
{
|
|
if (cc->algo->event)
|
|
cc->algo->event(cc, ev);
|
|
}
|
|
|
|
void quic_cc_state_trace(struct buffer *buf, const struct quic_cc *cc)
|
|
{
|
|
cc->algo->state_trace(buf, cc);
|
|
}
|
|
|
|
/* Return rate in nanoseconds between each datagram emission for a smooth pacing. */
|
|
uint quic_cc_default_pacing_rate(const struct quic_cc *cc)
|
|
{
|
|
struct quic_cc_path *path = container_of(cc, struct quic_cc_path, cc);
|
|
return path->loss.srtt * 1000000 / (path->cwnd / path->mtu + 1);
|
|
}
|
|
|
|
/* Return the max number of datagrams which can be emitted in a burst with
|
|
* pacing. Must return a strictly positive value.
|
|
*/
|
|
uint quic_cc_default_pacing_burst(const struct quic_cc *cc)
|
|
{
|
|
struct quic_cc_path *path = container_of(cc, struct quic_cc_path, cc);
|
|
return path->pacing_burst;
|
|
}
|