Mercurial > hg > nginx
view src/core/ngx_queue.c @ 9299:2706b60dc225
Core: error logging rate limiting.
With this change, error logging to files can be rate-limited with
the "rate=" parameter. The parameter specifies allowed log messages
rate to a particular file (per worker), in messages per second (m/s).
By default, "rate=1000m/s" is used.
Rate limiting is implemented using the "leaky bucket" method, similarly
to the limit_req module.
Maximum burst size is set to the number of log messages per second
for each severity level, so "error" messages are logged even if the
rate limit is hit by "info" messages (but not vice versa). When the
limit is reached for a particular level, the "too many log messages,
limiting" message is logged at this level.
If debug logging is enabled, either for the particular log file or for
the particular connection, rate limiting is not used.
author | Maxim Dounin <mdounin@mdounin.ru> |
---|---|
date | Tue, 25 Jun 2024 22:58:56 +0300 |
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); } }