RepoMirrors/haproxy
1
0
Fork 0
mirror of http://git.haproxy.org/git/haproxy.git/ synced 2025-02-19 04:07:04 +00:00
Code Issues Packages Projects Releases Wiki Activity

MEDIUM: quic: merge contiguous/overlapping buffered ack stream range

Browse Source 
Transfer throughput was deteriorated since recent rework of QUIC MUX
txbuf allocator. This was partially restorated with the commit to
decount individual in-order ACK from the MUX buffer window.

To fully retrieve the old performance level, all ACKs must be decounted
when handled by QUIC streamdesc layer, event out-of-order ranges.
However, this is not easily implemented as several ranges may exist in
parallel with overlap on the underlying data. It would cause
miscalculation for QUIC MUX buffer window if such ranges were blindly
reported.

The proper solution is to first implement merge of contiguous or
overlapping ACK data ranges to reduce the number of stored ranges to the
minimal. This is the purpose of this patch. This is implemented in a new
static function named qc_stream_buf_store_ack() into streamdesc layer.

The merge algorithm is simple enough. First, it ensures the newly added
range is not already fully covered by a preexisting entry. Then, it
checks if there is contiguity/overlap with one or several ranges
starting at the same of a greater offset. If true, the newly added entry
is extended to cover them all, and all contiguous/overlapped ranges are
removed. Finally, if there is contiguity or overlap with an entry
starting at a smaller offset, no new range is instantiated and instead
the smaller offset is extended.

Now that contiguous or overlapped ranges cannot exits anymore, ACK data
ranges tree instiatiation can used EB_ROOT_UNIQUE.

Outside of the longer term objective which is to decount out-of-order
ACKs from MUX txbuf window, this commit could also improve some
performance and/or memory usage for connections where stream data
fragmentation and packet reording is high.
This commit is contained in:
Amaury Denoyelle 2024-10-02 10:23:21 +02:00
parent e7578084b0
commit ae3e768d32
1 changed files with 83 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

97
src/quic_stream.c
View File

@ -145,6 +145,87 @@ void qc_stream_desc_release(struct qc_stream_desc *stream,
}
}
/* Store an out-of-order stream ACK for <buf>. This corresponds to a frame
* starting at <offset> of length <len> with <fin> set if FIN is present.
*
* Returns 0 on success or a negative error code if the new range cannot be
* stored due to a fatal error.
*/
static int qc_stream_buf_store_ack(struct qc_stream_buf *buf,
uint64_t offset, uint64_t len, int fin)
{
struct eb64_node *less, *more;
struct qc_stream_ack *ack, *ack_less = NULL, *ack_more = NULL;
int ret = 0;
more = eb64_lookup_ge(&buf->ack_tree, offset);
if (more)
ack_more = eb64_entry(more, struct qc_stream_ack, offset_node);
/* Ranges are always merged before insertion so there could be no
* overlapping or just contiguous different ranges. No need to use
* <ack_less> if an existing range already starts at requested offset.
*/
less = eb64_lookup_le(&buf->ack_tree, offset);
if (less && more != less)
ack_less = eb64_entry(less, struct qc_stream_ack, offset_node);
/* Ensure that offset:len range has not been already acknowledged, at least partially. */
if ((ack_more && offset == ack_more->offset_node.key && offset + len <= ack_more->offset_node.key) ||
(ack_less && ack_less->offset_node.key + ack_less->len >= offset + len)) {
goto end;
}
/* If current range is contiguous or overlapping with one or several
* superior ranges, extend current range and delete superior ranges.
*/
while (ack_more && offset + len >= ack_more->offset_node.key) {
struct eb64_node *next;
if (offset + len < ack_more->offset_node.key + ack_more->len) {
/* Extend current range to cover the next entry. */
len += (ack_more->offset_node.key + ack_more->len) - (offset + len);
fin = ack_more->fin;
}
/* Remove the next range as it is covered by the current one. */
next = eb64_next(more);
eb64_delete(more);
pool_free(pool_head_quic_stream_ack, ack_more);
more = next;
ack_more = more ? eb64_entry(more, struct qc_stream_ack, offset_node) : NULL;
}
/* If there is a contiguous or overlapping smaller range, extend it
* without adding a new entry.
*/
if (ack_less &&
ack_less->offset_node.key + ack_less->len >= offset) {
/* Extend previous entry to fully cover the current range. */
ack_less->len += (offset + len) -
(ack_less->offset_node.key + ack_less->len);
ack_less->fin = fin;
}
else {
/* Store a new ACK stream range. */
ack = pool_alloc(pool_head_quic_stream_ack);
if (!ack) {
ret = -1;
goto end;
}
ack->offset_node.key = offset;
ack->len = len;
ack->fin = fin;
eb64_insert(&buf->ack_tree, &ack->offset_node);
}
end:
return ret;
}
/* Acknowledges data for buffer <buf> attached to <stream> instance. This covers
* the range strating at <offset> and of length <len>, with <fin> sets for the
* last stream frame.
@ -243,22 +324,10 @@ int qc_stream_desc_ack(struct qc_stream_desc *stream,
stream->flags &= ~QC_SD_FL_WAIT_FOR_FIN;
}
else if (offset > stream->ack_offset) {
struct qc_stream_ack *ack;
buf_node = eb64_lookup_le(&stream->buf_tree, offset);
BUG_ON(!buf_node); /* Cannot acknowledged a STREAM frame for a non existing buffer. */
stream_buf = eb64_entry(buf_node, struct qc_stream_buf, offset_node);
ack = pool_alloc(pool_head_quic_stream_ack);
if (!ack)
return -1;
ack->offset_node.key = offset;
ack->len = len;
ack->fin = fin;
eb64_insert(&stream_buf->ack_tree, &ack->offset_node);
ret = 1;
ret = qc_stream_buf_store_ack(stream_buf, offset, len, fin);
}
else if (offset + len > stream->ack_offset) {
/* Buf list cannot be empty if there is still unacked data. */
@ -355,7 +424,7 @@ struct buffer *qc_stream_buf_alloc(struct qc_stream_desc *stream,
if (!stream->buf)
return NULL;
stream->buf->ack_tree = EB_ROOT;
stream->buf->ack_tree = EB_ROOT_UNIQUE;
stream->buf->buf = BUF_NULL;
stream->buf->offset_node.key = offset;