mirror of https://github.com/nginx/nginx
An official read-only mirror of http://hg.nginx.org/nginx/ which is updated hourly. Pull requests on GitHub cannot be accepted and will be automatically closed. The proper way to submit changes to nginx is via the nginx development mailing list, see http:
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
79 lines
1.4 KiB
79 lines
1.4 KiB
|
|
/*
|
|
* Copyright (C) Igor Sysoev
|
|
*/
|
|
|
|
|
|
#include <ngx_config.h>
|
|
#include <ngx_core.h>
|
|
|
|
|
|
/*
|
|
* 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 insertion 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, *prev, *next;
|
|
|
|
q = ngx_queue_head(queue);
|
|
|
|
if (q == ngx_queue_last(queue)) {
|
|
return;
|
|
}
|
|
|
|
for (q = ngx_queue_next(q); q != ngx_queue_sentinel(queue); q = next) {
|
|
|
|
prev = ngx_queue_prev(q);
|
|
next = ngx_queue_next(q);
|
|
|
|
ngx_queue_remove(q);
|
|
|
|
do {
|
|
if (cmp(prev, q) <= 0) {
|
|
break;
|
|
}
|
|
|
|
prev = ngx_queue_prev(prev);
|
|
|
|
} while (prev != ngx_queue_sentinel(queue));
|
|
|
|
ngx_queue_insert_after(prev, q);
|
|
}
|
|
}
|
|
|