Mercurial > hg > nginx
annotate src/core/ngx_queue.c @ 8998:308ac307b3e6 quic
QUIC: improved debug logging.
- wording in log->action is adjusted to match function names.
- connection close steps are made obvious and start with "quic close" prefix:
*1 quic close initiated rc:-4
*1 quic close silent drain:0 timedout:1
*1 quic close resumed rc:-1
*1 quic close resumed rc:-1
*1 quic close resumed rc:-4
*1 quic close completed
this makes it easy to understand if particular "close" record is an initial
cause or lasting process, or the final one.
- cases of close without quic connection now logged as "packet rejected":
*14 quic run
*14 quic packet rx long flags:ec version:1
*14 quic packet rx hs len:61
*14 quic packet rx dcid len:20 00000000000002c32f60e4aa2b90a64a39dc4228
*14 quic packet rx scid len:8 81190308612cd019
*14 quic expected initial, got handshake
*14 quic packet done rc:-1 level:hs decr:0 pn:0 perr:0
*14 quic packet rejected rc:-1, cleanup connection
*14 reusable connection: 0
this makes it easy to spot early packet rejection and avoid confuse with
quic connection closing (which in fact was not even created).
- packet processing summary now uses same prefix "quic packet done rc:"
- added debug to places where packet was rejected without any reason logged
| author | Vladimir Homutov <vl@nginx.com> |
|---|---|
| date | Tue, 01 Feb 2022 15:43:56 +0300 |
| parents | d620f497c50f |
| children | 3038bd4d7816 |
| rev | line source |
|---|---|
| 2026 | 1 |
| 2 /* | |
| 3 * Copyright (C) Igor Sysoev | |
| 4412 | 4 * Copyright (C) Nginx, Inc. |
| 2026 | 5 */ |
| 6 | |
| 7 | |
| 8 #include <ngx_config.h> | |
| 9 #include <ngx_core.h> | |
| 10 | |
| 11 | |
| 12 /* | |
| 13 * find the middle queue element if the queue has odd number of elements | |
| 14 * or the first element of the queue's second part otherwise | |
| 15 */ | |
| 16 | |
| 17 ngx_queue_t * | |
| 18 ngx_queue_middle(ngx_queue_t *queue) | |
| 19 { | |
| 20 ngx_queue_t *middle, *next; | |
| 21 | |
| 22 middle = ngx_queue_head(queue); | |
| 23 | |
| 24 if (middle == ngx_queue_last(queue)) { | |
| 25 return middle; | |
| 26 } | |
| 27 | |
| 28 next = ngx_queue_head(queue); | |
| 29 | |
| 30 for ( ;; ) { | |
| 31 middle = ngx_queue_next(middle); | |
| 32 | |
| 33 next = ngx_queue_next(next); | |
| 34 | |
| 35 if (next == ngx_queue_last(queue)) { | |
| 36 return middle; | |
| 37 } | |
| 38 | |
| 39 next = ngx_queue_next(next); | |
| 40 | |
| 41 if (next == ngx_queue_last(queue)) { | |
| 42 return middle; | |
| 43 } | |
| 44 } | |
| 45 } | |
| 46 | |
| 47 | |
| 48 /* the stable insertion sort */ | |
| 49 | |
| 50 void | |
| 51 ngx_queue_sort(ngx_queue_t *queue, | |
| 52 ngx_int_t (*cmp)(const ngx_queue_t *, const ngx_queue_t *)) | |
| 53 { | |
| 54 ngx_queue_t *q, *prev, *next; | |
| 55 | |
| 56 q = ngx_queue_head(queue); | |
| 57 | |
| 58 if (q == ngx_queue_last(queue)) { | |
| 59 return; | |
| 60 } | |
| 61 | |
| 62 for (q = ngx_queue_next(q); q != ngx_queue_sentinel(queue); q = next) { | |
| 63 | |
| 64 prev = ngx_queue_prev(q); | |
| 65 next = ngx_queue_next(q); | |
| 66 | |
| 67 ngx_queue_remove(q); | |
| 68 | |
| 69 do { | |
| 70 if (cmp(prev, q) <= 0) { | |
| 71 break; | |
| 72 } | |
| 73 | |
| 74 prev = ngx_queue_prev(prev); | |
| 75 | |
| 76 } while (prev != ngx_queue_sentinel(queue)); | |
| 77 | |
| 78 ngx_queue_insert_after(prev, q); | |
| 79 } | |
| 80 } |