Mercurial > hg > nginx
view src/core/ngx_queue.c @ 9196:6c8595b77e66
QUIC: path aware in-flight bytes accounting.
On-packet acknowledgement is made path aware, as per RFC 9000, Section 9.4:
Packets sent on the old path MUST NOT contribute to congestion control
or RTT estimation for the new path.
To make this possible in a single congestion control context, the first packet
to be sent after the new path has been validated, which includes resetting the
congestion controller and RTT estimator, is now remembered in the connection.
Packets sent previously, such as on the old path, are not taken into account.
Note that although the packet number is saved per-connection, the added checks
affect application level packets only. For non-application level packets,
which are only processed prior to the handshake is complete, the remembered
packet number remains set to zero.
author | Sergey Kandaurov <pluknet@nginx.com> |
---|---|
date | Tue, 12 Dec 2023 20:21:12 +0400 |
parents | 3038bd4d7816 |
children |
line wrap: on
line source
/* * Copyright (C) Igor Sysoev * Copyright (C) Nginx, Inc. */ #include <ngx_config.h> #include <ngx_core.h> static void ngx_queue_merge(ngx_queue_t *queue, ngx_queue_t *tail, ngx_int_t (*cmp)(const ngx_queue_t *, const ngx_queue_t *)); /* * find the middle queue element if the queue has odd number of elements * or the first element of the queue's second part otherwise */ ngx_queue_t * ngx_queue_middle(ngx_queue_t *queue) { ngx_queue_t *middle, *next; middle = ngx_queue_head(queue); if (middle == ngx_queue_last(queue)) { return middle; } next = ngx_queue_head(queue); for ( ;; ) { middle = ngx_queue_next(middle); next = ngx_queue_next(next); if (next == ngx_queue_last(queue)) { return middle; } next = ngx_queue_next(next); if (next == ngx_queue_last(queue)) { return middle; } } } /* the stable merge sort */ void ngx_queue_sort(ngx_queue_t *queue, ngx_int_t (*cmp)(const ngx_queue_t *, const ngx_queue_t *)) { ngx_queue_t *q, tail; q = ngx_queue_head(queue); if (q == ngx_queue_last(queue)) { return; } q = ngx_queue_middle(queue); ngx_queue_split(queue, q, &tail); ngx_queue_sort(queue, cmp); ngx_queue_sort(&tail, cmp); ngx_queue_merge(queue, &tail, cmp); } static void ngx_queue_merge(ngx_queue_t *queue, ngx_queue_t *tail, ngx_int_t (*cmp)(const ngx_queue_t *, const ngx_queue_t *)) { ngx_queue_t *q1, *q2; q1 = ngx_queue_head(queue); q2 = ngx_queue_head(tail); for ( ;; ) { if (q1 == ngx_queue_sentinel(queue)) { ngx_queue_add(queue, tail); break; } if (q2 == ngx_queue_sentinel(tail)) { break; } if (cmp(q1, q2) <= 0) { q1 = ngx_queue_next(q1); continue; } ngx_queue_remove(q2); ngx_queue_insert_before(q1, q2); q2 = ngx_queue_head(tail); } }