2006-12-05 00:46:13 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (C) Igor Sysoev
|
2012-01-18 23:07:43 +08:00
|
|
|
* Copyright (C) Nginx, Inc.
|
2006-12-05 00:46:13 +08:00
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#include <ngx_config.h>
|
|
|
|
#include <ngx_core.h>
|
|
|
|
#include <ngx_http.h>
|
|
|
|
|
|
|
|
|
2008-03-24 21:04:02 +08:00
|
|
|
static ngx_int_t ngx_http_upstream_cmp_servers(const void *one,
|
|
|
|
const void *two);
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
static ngx_http_upstream_rr_peer_t *ngx_http_upstream_get_peer(
|
|
|
|
ngx_http_upstream_rr_peer_data_t *rrp);
|
2007-07-29 00:04:01 +08:00
|
|
|
|
2011-07-23 00:30:17 +08:00
|
|
|
#if (NGX_HTTP_SSL)
|
|
|
|
|
|
|
|
static ngx_int_t ngx_http_upstream_empty_set_session(ngx_peer_connection_t *pc,
|
|
|
|
void *data);
|
|
|
|
static void ngx_http_upstream_empty_save_session(ngx_peer_connection_t *pc,
|
|
|
|
void *data);
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
2007-07-29 00:04:01 +08:00
|
|
|
|
2006-12-05 00:46:13 +08:00
|
|
|
ngx_int_t
|
|
|
|
ngx_http_upstream_init_round_robin(ngx_conf_t *cf,
|
|
|
|
ngx_http_upstream_srv_conf_t *us)
|
|
|
|
{
|
|
|
|
ngx_url_t u;
|
2012-06-04 07:22:41 +08:00
|
|
|
ngx_uint_t i, j, n, w;
|
2006-12-05 00:46:13 +08:00
|
|
|
ngx_http_upstream_server_t *server;
|
2007-08-09 21:54:33 +08:00
|
|
|
ngx_http_upstream_rr_peers_t *peers, *backup;
|
2006-12-05 00:46:13 +08:00
|
|
|
|
|
|
|
us->peer.init = ngx_http_upstream_init_round_robin_peer;
|
|
|
|
|
|
|
|
if (us->servers) {
|
|
|
|
server = us->servers->elts;
|
|
|
|
|
2007-08-09 21:54:33 +08:00
|
|
|
n = 0;
|
2012-06-04 07:22:41 +08:00
|
|
|
w = 0;
|
2007-08-09 21:54:33 +08:00
|
|
|
|
2006-12-05 00:46:13 +08:00
|
|
|
for (i = 0; i < us->servers->nelts; i++) {
|
2007-08-09 21:54:33 +08:00
|
|
|
if (server[i].backup) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2006-12-05 00:46:13 +08:00
|
|
|
n += server[i].naddrs;
|
2012-06-04 07:22:41 +08:00
|
|
|
w += server[i].naddrs * server[i].weight;
|
2006-12-05 00:46:13 +08:00
|
|
|
}
|
|
|
|
|
2012-04-03 05:29:35 +08:00
|
|
|
if (n == 0) {
|
|
|
|
ngx_log_error(NGX_LOG_EMERG, cf->log, 0,
|
|
|
|
"no servers in upstream \"%V\" in %s:%ui",
|
|
|
|
&us->host, us->file_name, us->line);
|
|
|
|
return NGX_ERROR;
|
|
|
|
}
|
|
|
|
|
2006-12-05 00:46:13 +08:00
|
|
|
peers = ngx_pcalloc(cf->pool, sizeof(ngx_http_upstream_rr_peers_t)
|
|
|
|
+ sizeof(ngx_http_upstream_rr_peer_t) * (n - 1));
|
|
|
|
if (peers == NULL) {
|
|
|
|
return NGX_ERROR;
|
|
|
|
}
|
|
|
|
|
2007-08-09 21:54:33 +08:00
|
|
|
peers->single = (n == 1);
|
2006-12-05 00:46:13 +08:00
|
|
|
peers->number = n;
|
2012-06-04 07:22:41 +08:00
|
|
|
peers->weighted = (w != n);
|
|
|
|
peers->total_weight = w;
|
2006-12-05 00:46:13 +08:00
|
|
|
peers->name = &us->host;
|
|
|
|
|
|
|
|
n = 0;
|
|
|
|
|
|
|
|
for (i = 0; i < us->servers->nelts; i++) {
|
|
|
|
for (j = 0; j < server[i].naddrs; j++) {
|
2007-08-09 21:54:33 +08:00
|
|
|
if (server[i].backup) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2006-12-05 00:46:13 +08:00
|
|
|
peers->peer[n].sockaddr = server[i].addrs[j].sockaddr;
|
|
|
|
peers->peer[n].socklen = server[i].addrs[j].socklen;
|
|
|
|
peers->peer[n].name = server[i].addrs[j].name;
|
|
|
|
peers->peer[n].max_fails = server[i].max_fails;
|
|
|
|
peers->peer[n].fail_timeout = server[i].fail_timeout;
|
|
|
|
peers->peer[n].down = server[i].down;
|
2012-05-14 17:58:07 +08:00
|
|
|
peers->peer[n].weight = server[i].weight;
|
|
|
|
peers->peer[n].effective_weight = server[i].weight;
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
peers->peer[n].current_weight = 0;
|
2006-12-05 00:46:13 +08:00
|
|
|
n++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
us->peer.data = peers;
|
|
|
|
|
2007-08-09 23:28:17 +08:00
|
|
|
ngx_sort(&peers->peer[0], (size_t) n,
|
|
|
|
sizeof(ngx_http_upstream_rr_peer_t),
|
|
|
|
ngx_http_upstream_cmp_servers);
|
|
|
|
|
2007-08-09 21:54:33 +08:00
|
|
|
/* backup servers */
|
|
|
|
|
|
|
|
n = 0;
|
2012-06-04 07:22:41 +08:00
|
|
|
w = 0;
|
2007-08-09 21:54:33 +08:00
|
|
|
|
|
|
|
for (i = 0; i < us->servers->nelts; i++) {
|
|
|
|
if (!server[i].backup) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
n += server[i].naddrs;
|
2012-06-04 07:22:41 +08:00
|
|
|
w += server[i].naddrs * server[i].weight;
|
2007-08-09 21:54:33 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
if (n == 0) {
|
|
|
|
return NGX_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
backup = ngx_pcalloc(cf->pool, sizeof(ngx_http_upstream_rr_peers_t)
|
|
|
|
+ sizeof(ngx_http_upstream_rr_peer_t) * (n - 1));
|
|
|
|
if (backup == NULL) {
|
|
|
|
return NGX_ERROR;
|
|
|
|
}
|
|
|
|
|
|
|
|
peers->single = 0;
|
|
|
|
backup->single = 0;
|
|
|
|
backup->number = n;
|
2012-06-04 07:22:41 +08:00
|
|
|
backup->weighted = (w != n);
|
|
|
|
backup->total_weight = w;
|
2007-08-09 21:54:33 +08:00
|
|
|
backup->name = &us->host;
|
|
|
|
|
|
|
|
n = 0;
|
|
|
|
|
|
|
|
for (i = 0; i < us->servers->nelts; i++) {
|
|
|
|
for (j = 0; j < server[i].naddrs; j++) {
|
|
|
|
if (!server[i].backup) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
backup->peer[n].sockaddr = server[i].addrs[j].sockaddr;
|
|
|
|
backup->peer[n].socklen = server[i].addrs[j].socklen;
|
|
|
|
backup->peer[n].name = server[i].addrs[j].name;
|
|
|
|
backup->peer[n].weight = server[i].weight;
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
backup->peer[n].effective_weight = server[i].weight;
|
|
|
|
backup->peer[n].current_weight = 0;
|
2007-08-09 21:54:33 +08:00
|
|
|
backup->peer[n].max_fails = server[i].max_fails;
|
|
|
|
backup->peer[n].fail_timeout = server[i].fail_timeout;
|
|
|
|
backup->peer[n].down = server[i].down;
|
|
|
|
n++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
peers->next = backup;
|
|
|
|
|
2007-08-09 23:28:17 +08:00
|
|
|
ngx_sort(&backup->peer[0], (size_t) n,
|
|
|
|
sizeof(ngx_http_upstream_rr_peer_t),
|
|
|
|
ngx_http_upstream_cmp_servers);
|
|
|
|
|
2006-12-05 00:46:13 +08:00
|
|
|
return NGX_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* an upstream implicitly defined by proxy_pass, etc. */
|
|
|
|
|
2006-12-13 00:46:16 +08:00
|
|
|
if (us->port == 0 && us->default_port == 0) {
|
|
|
|
ngx_log_error(NGX_LOG_EMERG, cf->log, 0,
|
|
|
|
"no port in upstream \"%V\" in %s:%ui",
|
2007-09-16 01:11:06 +08:00
|
|
|
&us->host, us->file_name, us->line);
|
2006-12-13 00:46:16 +08:00
|
|
|
return NGX_ERROR;
|
|
|
|
}
|
|
|
|
|
2006-12-05 00:46:13 +08:00
|
|
|
ngx_memzero(&u, sizeof(ngx_url_t));
|
|
|
|
|
|
|
|
u.host = us->host;
|
2006-12-13 23:06:46 +08:00
|
|
|
u.port = (in_port_t) (us->port ? us->port : us->default_port);
|
2006-12-05 00:46:13 +08:00
|
|
|
|
2007-10-08 16:55:12 +08:00
|
|
|
if (ngx_inet_resolve_host(cf->pool, &u) != NGX_OK) {
|
2006-12-05 00:46:13 +08:00
|
|
|
if (u.err) {
|
|
|
|
ngx_log_error(NGX_LOG_EMERG, cf->log, 0,
|
2006-12-11 16:59:30 +08:00
|
|
|
"%s in upstream \"%V\" in %s:%ui",
|
2007-09-16 01:11:06 +08:00
|
|
|
u.err, &us->host, us->file_name, us->line);
|
2006-12-05 00:46:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
return NGX_ERROR;
|
|
|
|
}
|
|
|
|
|
|
|
|
n = u.naddrs;
|
|
|
|
|
|
|
|
peers = ngx_pcalloc(cf->pool, sizeof(ngx_http_upstream_rr_peers_t)
|
|
|
|
+ sizeof(ngx_http_upstream_rr_peer_t) * (n - 1));
|
|
|
|
if (peers == NULL) {
|
|
|
|
return NGX_ERROR;
|
|
|
|
}
|
|
|
|
|
2007-08-09 21:54:33 +08:00
|
|
|
peers->single = (n == 1);
|
2006-12-05 00:46:13 +08:00
|
|
|
peers->number = n;
|
2012-06-04 07:22:41 +08:00
|
|
|
peers->weighted = 0;
|
|
|
|
peers->total_weight = n;
|
2006-12-05 00:46:13 +08:00
|
|
|
peers->name = &us->host;
|
|
|
|
|
|
|
|
for (i = 0; i < u.naddrs; i++) {
|
2007-10-10 21:58:47 +08:00
|
|
|
peers->peer[i].sockaddr = u.addrs[i].sockaddr;
|
|
|
|
peers->peer[i].socklen = u.addrs[i].socklen;
|
|
|
|
peers->peer[i].name = u.addrs[i].name;
|
|
|
|
peers->peer[i].weight = 1;
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
peers->peer[i].effective_weight = 1;
|
|
|
|
peers->peer[i].current_weight = 0;
|
2007-10-10 21:58:47 +08:00
|
|
|
peers->peer[i].max_fails = 1;
|
|
|
|
peers->peer[i].fail_timeout = 10;
|
2006-12-05 00:46:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
us->peer.data = peers;
|
|
|
|
|
2007-08-09 21:54:33 +08:00
|
|
|
/* implicitly defined upstream has no backup servers */
|
|
|
|
|
2006-12-05 00:46:13 +08:00
|
|
|
return NGX_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-03-24 21:04:02 +08:00
|
|
|
static ngx_int_t
|
2007-08-09 23:28:17 +08:00
|
|
|
ngx_http_upstream_cmp_servers(const void *one, const void *two)
|
|
|
|
{
|
|
|
|
ngx_http_upstream_rr_peer_t *first, *second;
|
|
|
|
|
|
|
|
first = (ngx_http_upstream_rr_peer_t *) one;
|
|
|
|
second = (ngx_http_upstream_rr_peer_t *) two;
|
|
|
|
|
|
|
|
return (first->weight < second->weight);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-12-05 00:46:13 +08:00
|
|
|
ngx_int_t
|
|
|
|
ngx_http_upstream_init_round_robin_peer(ngx_http_request_t *r,
|
|
|
|
ngx_http_upstream_srv_conf_t *us)
|
|
|
|
{
|
|
|
|
ngx_uint_t n;
|
|
|
|
ngx_http_upstream_rr_peer_data_t *rrp;
|
|
|
|
|
|
|
|
rrp = r->upstream->peer.data;
|
|
|
|
|
|
|
|
if (rrp == NULL) {
|
|
|
|
rrp = ngx_palloc(r->pool, sizeof(ngx_http_upstream_rr_peer_data_t));
|
|
|
|
if (rrp == NULL) {
|
|
|
|
return NGX_ERROR;
|
|
|
|
}
|
|
|
|
|
|
|
|
r->upstream->peer.data = rrp;
|
|
|
|
}
|
|
|
|
|
|
|
|
rrp->peers = us->peer.data;
|
|
|
|
rrp->current = 0;
|
|
|
|
|
2011-08-19 01:04:52 +08:00
|
|
|
n = rrp->peers->number;
|
|
|
|
|
|
|
|
if (rrp->peers->next && rrp->peers->next->number > n) {
|
|
|
|
n = rrp->peers->next->number;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (n <= 8 * sizeof(uintptr_t)) {
|
2006-12-05 00:46:13 +08:00
|
|
|
rrp->tried = &rrp->data;
|
|
|
|
rrp->data = 0;
|
|
|
|
|
|
|
|
} else {
|
2011-08-19 01:04:52 +08:00
|
|
|
n = (n + (8 * sizeof(uintptr_t) - 1)) / (8 * sizeof(uintptr_t));
|
2006-12-05 00:46:13 +08:00
|
|
|
|
|
|
|
rrp->tried = ngx_pcalloc(r->pool, n * sizeof(uintptr_t));
|
|
|
|
if (rrp->tried == NULL) {
|
|
|
|
return NGX_ERROR;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
r->upstream->peer.get = ngx_http_upstream_get_round_robin_peer;
|
2007-11-27 21:34:13 +08:00
|
|
|
r->upstream->peer.free = ngx_http_upstream_free_round_robin_peer;
|
|
|
|
r->upstream->peer.tries = rrp->peers->number;
|
|
|
|
#if (NGX_HTTP_SSL)
|
|
|
|
r->upstream->peer.set_session =
|
|
|
|
ngx_http_upstream_set_round_robin_peer_session;
|
|
|
|
r->upstream->peer.save_session =
|
|
|
|
ngx_http_upstream_save_round_robin_peer_session;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
return NGX_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
ngx_int_t
|
|
|
|
ngx_http_upstream_create_round_robin_peer(ngx_http_request_t *r,
|
|
|
|
ngx_http_upstream_resolved_t *ur)
|
|
|
|
{
|
|
|
|
u_char *p;
|
|
|
|
size_t len;
|
|
|
|
ngx_uint_t i, n;
|
|
|
|
struct sockaddr_in *sin;
|
|
|
|
ngx_http_upstream_rr_peers_t *peers;
|
|
|
|
ngx_http_upstream_rr_peer_data_t *rrp;
|
|
|
|
|
|
|
|
rrp = r->upstream->peer.data;
|
|
|
|
|
|
|
|
if (rrp == NULL) {
|
|
|
|
rrp = ngx_palloc(r->pool, sizeof(ngx_http_upstream_rr_peer_data_t));
|
|
|
|
if (rrp == NULL) {
|
|
|
|
return NGX_ERROR;
|
|
|
|
}
|
|
|
|
|
|
|
|
r->upstream->peer.data = rrp;
|
|
|
|
}
|
|
|
|
|
|
|
|
peers = ngx_pcalloc(r->pool, sizeof(ngx_http_upstream_rr_peers_t)
|
|
|
|
+ sizeof(ngx_http_upstream_rr_peer_t) * (ur->naddrs - 1));
|
|
|
|
if (peers == NULL) {
|
|
|
|
return NGX_ERROR;
|
|
|
|
}
|
|
|
|
|
|
|
|
peers->single = (ur->naddrs == 1);
|
|
|
|
peers->number = ur->naddrs;
|
|
|
|
peers->name = &ur->host;
|
|
|
|
|
2008-12-24 03:35:12 +08:00
|
|
|
if (ur->sockaddr) {
|
|
|
|
peers->peer[0].sockaddr = ur->sockaddr;
|
|
|
|
peers->peer[0].socklen = ur->socklen;
|
|
|
|
peers->peer[0].name = ur->host;
|
|
|
|
peers->peer[0].weight = 1;
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
peers->peer[0].effective_weight = 1;
|
|
|
|
peers->peer[0].current_weight = 0;
|
2008-12-24 03:35:12 +08:00
|
|
|
peers->peer[0].max_fails = 1;
|
|
|
|
peers->peer[0].fail_timeout = 10;
|
2007-11-27 21:34:13 +08:00
|
|
|
|
2008-12-24 03:35:12 +08:00
|
|
|
} else {
|
2007-11-27 21:34:13 +08:00
|
|
|
|
2008-12-24 03:35:12 +08:00
|
|
|
for (i = 0; i < ur->naddrs; i++) {
|
2007-11-27 21:34:13 +08:00
|
|
|
|
2008-12-24 03:35:12 +08:00
|
|
|
len = NGX_INET_ADDRSTRLEN + sizeof(":65536") - 1;
|
2007-11-27 21:34:13 +08:00
|
|
|
|
2008-12-24 03:35:12 +08:00
|
|
|
p = ngx_pnalloc(r->pool, len);
|
|
|
|
if (p == NULL) {
|
|
|
|
return NGX_ERROR;
|
|
|
|
}
|
2007-11-27 21:34:13 +08:00
|
|
|
|
2008-12-24 03:35:12 +08:00
|
|
|
len = ngx_inet_ntop(AF_INET, &ur->addrs[i], p, NGX_INET_ADDRSTRLEN);
|
|
|
|
len = ngx_sprintf(&p[len], ":%d", ur->port) - p;
|
2007-11-27 21:34:13 +08:00
|
|
|
|
2008-12-24 03:35:12 +08:00
|
|
|
sin = ngx_pcalloc(r->pool, sizeof(struct sockaddr_in));
|
|
|
|
if (sin == NULL) {
|
|
|
|
return NGX_ERROR;
|
|
|
|
}
|
|
|
|
|
|
|
|
sin->sin_family = AF_INET;
|
|
|
|
sin->sin_port = htons(ur->port);
|
|
|
|
sin->sin_addr.s_addr = ur->addrs[i];
|
|
|
|
|
|
|
|
peers->peer[i].sockaddr = (struct sockaddr *) sin;
|
|
|
|
peers->peer[i].socklen = sizeof(struct sockaddr_in);
|
|
|
|
peers->peer[i].name.len = len;
|
|
|
|
peers->peer[i].name.data = p;
|
|
|
|
peers->peer[i].weight = 1;
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
peers->peer[i].effective_weight = 1;
|
|
|
|
peers->peer[i].current_weight = 0;
|
2008-12-24 03:35:12 +08:00
|
|
|
peers->peer[i].max_fails = 1;
|
|
|
|
peers->peer[i].fail_timeout = 10;
|
|
|
|
}
|
2007-11-27 21:34:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
rrp->peers = peers;
|
|
|
|
rrp->current = 0;
|
|
|
|
|
|
|
|
if (rrp->peers->number <= 8 * sizeof(uintptr_t)) {
|
|
|
|
rrp->tried = &rrp->data;
|
|
|
|
rrp->data = 0;
|
|
|
|
|
|
|
|
} else {
|
|
|
|
n = (rrp->peers->number + (8 * sizeof(uintptr_t) - 1))
|
|
|
|
/ (8 * sizeof(uintptr_t));
|
|
|
|
|
|
|
|
rrp->tried = ngx_pcalloc(r->pool, n * sizeof(uintptr_t));
|
|
|
|
if (rrp->tried == NULL) {
|
|
|
|
return NGX_ERROR;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
r->upstream->peer.get = ngx_http_upstream_get_round_robin_peer;
|
2006-12-05 00:46:13 +08:00
|
|
|
r->upstream->peer.free = ngx_http_upstream_free_round_robin_peer;
|
|
|
|
r->upstream->peer.tries = rrp->peers->number;
|
|
|
|
#if (NGX_HTTP_SSL)
|
2011-07-23 00:30:17 +08:00
|
|
|
r->upstream->peer.set_session = ngx_http_upstream_empty_set_session;
|
|
|
|
r->upstream->peer.save_session = ngx_http_upstream_empty_save_session;
|
2006-12-05 00:46:13 +08:00
|
|
|
#endif
|
|
|
|
|
|
|
|
return NGX_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
ngx_int_t
|
|
|
|
ngx_http_upstream_get_round_robin_peer(ngx_peer_connection_t *pc, void *data)
|
|
|
|
{
|
|
|
|
ngx_http_upstream_rr_peer_data_t *rrp = data;
|
|
|
|
|
2007-08-09 21:54:33 +08:00
|
|
|
ngx_int_t rc;
|
|
|
|
ngx_uint_t i, n;
|
|
|
|
ngx_connection_t *c;
|
|
|
|
ngx_http_upstream_rr_peer_t *peer;
|
|
|
|
ngx_http_upstream_rr_peers_t *peers;
|
2006-12-05 00:46:13 +08:00
|
|
|
|
|
|
|
ngx_log_debug1(NGX_LOG_DEBUG_HTTP, pc->log, 0,
|
|
|
|
"get rr peer, try: %ui", pc->tries);
|
|
|
|
|
|
|
|
/* ngx_lock_mutex(rrp->peers->mutex); */
|
|
|
|
|
|
|
|
if (rrp->peers->last_cached) {
|
|
|
|
|
|
|
|
/* cached connection */
|
|
|
|
|
|
|
|
c = rrp->peers->cached[rrp->peers->last_cached];
|
|
|
|
rrp->peers->last_cached--;
|
|
|
|
|
|
|
|
/* ngx_unlock_mutex(ppr->peers->mutex); */
|
|
|
|
|
|
|
|
#if (NGX_THREADS)
|
|
|
|
c->read->lock = c->read->own_lock;
|
|
|
|
c->write->lock = c->write->own_lock;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
pc->connection = c;
|
|
|
|
pc->cached = 1;
|
|
|
|
|
|
|
|
return NGX_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
pc->cached = 0;
|
|
|
|
pc->connection = NULL;
|
|
|
|
|
2007-08-09 21:54:33 +08:00
|
|
|
if (rrp->peers->single) {
|
2006-12-05 00:46:13 +08:00
|
|
|
peer = &rrp->peers->peer[0];
|
|
|
|
|
|
|
|
} else {
|
|
|
|
|
|
|
|
/* there are several peers */
|
|
|
|
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
peer = ngx_http_upstream_get_peer(rrp);
|
2006-12-05 00:46:13 +08:00
|
|
|
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
if (peer == NULL) {
|
|
|
|
goto failed;
|
2006-12-05 00:46:13 +08:00
|
|
|
}
|
|
|
|
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
ngx_log_debug2(NGX_LOG_DEBUG_HTTP, pc->log, 0,
|
|
|
|
"get rr peer, current: %ui %i",
|
|
|
|
rrp->current, peer->current_weight);
|
2006-12-05 00:46:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
pc->sockaddr = peer->sockaddr;
|
|
|
|
pc->socklen = peer->socklen;
|
|
|
|
pc->name = &peer->name;
|
|
|
|
|
|
|
|
/* ngx_unlock_mutex(rrp->peers->mutex); */
|
|
|
|
|
2007-08-09 21:54:33 +08:00
|
|
|
if (pc->tries == 1 && rrp->peers->next) {
|
|
|
|
pc->tries += rrp->peers->next->number;
|
|
|
|
}
|
|
|
|
|
2006-12-05 00:46:13 +08:00
|
|
|
return NGX_OK;
|
|
|
|
|
|
|
|
failed:
|
|
|
|
|
2007-08-09 21:54:33 +08:00
|
|
|
peers = rrp->peers;
|
|
|
|
|
|
|
|
if (peers->next) {
|
|
|
|
|
|
|
|
/* ngx_unlock_mutex(peers->mutex); */
|
|
|
|
|
|
|
|
ngx_log_debug0(NGX_LOG_DEBUG_HTTP, pc->log, 0, "backup servers");
|
|
|
|
|
|
|
|
rrp->peers = peers->next;
|
|
|
|
pc->tries = rrp->peers->number;
|
|
|
|
|
|
|
|
n = rrp->peers->number / (8 * sizeof(uintptr_t)) + 1;
|
2007-08-14 21:35:52 +08:00
|
|
|
for (i = 0; i < n; i++) {
|
2007-08-09 21:54:33 +08:00
|
|
|
rrp->tried[i] = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
rc = ngx_http_upstream_get_round_robin_peer(pc, rrp);
|
|
|
|
|
|
|
|
if (rc != NGX_BUSY) {
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* ngx_lock_mutex(peers->mutex); */
|
|
|
|
}
|
|
|
|
|
2006-12-05 00:46:13 +08:00
|
|
|
/* all peers failed, mark them as live for quick recovery */
|
|
|
|
|
2007-08-09 21:54:33 +08:00
|
|
|
for (i = 0; i < peers->number; i++) {
|
|
|
|
peers->peer[i].fails = 0;
|
2006-12-05 00:46:13 +08:00
|
|
|
}
|
|
|
|
|
2007-08-09 21:54:33 +08:00
|
|
|
/* ngx_unlock_mutex(peers->mutex); */
|
2006-12-05 00:46:13 +08:00
|
|
|
|
2007-08-09 21:54:33 +08:00
|
|
|
pc->name = peers->name;
|
2006-12-05 00:46:13 +08:00
|
|
|
|
|
|
|
return NGX_BUSY;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
static ngx_http_upstream_rr_peer_t *
|
|
|
|
ngx_http_upstream_get_peer(ngx_http_upstream_rr_peer_data_t *rrp)
|
2007-07-29 00:04:01 +08:00
|
|
|
{
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
time_t now;
|
|
|
|
uintptr_t m;
|
|
|
|
ngx_int_t total;
|
|
|
|
ngx_uint_t i, n;
|
|
|
|
ngx_http_upstream_rr_peer_t *peer, *best;
|
2007-07-29 00:04:01 +08:00
|
|
|
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
now = ngx_time();
|
2007-07-29 00:04:01 +08:00
|
|
|
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
best = NULL;
|
|
|
|
total = 0;
|
2007-07-29 00:04:01 +08:00
|
|
|
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
for (i = 0; i < rrp->peers->number; i++) {
|
2007-07-29 00:04:01 +08:00
|
|
|
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
n = i / (8 * sizeof(uintptr_t));
|
|
|
|
m = (uintptr_t) 1 << i % (8 * sizeof(uintptr_t));
|
2007-07-29 00:04:01 +08:00
|
|
|
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
if (rrp->tried[n] & m) {
|
|
|
|
continue;
|
|
|
|
}
|
2007-07-29 00:04:01 +08:00
|
|
|
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
peer = &rrp->peers->peer[i];
|
2007-07-29 00:04:01 +08:00
|
|
|
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
if (peer->down) {
|
|
|
|
continue;
|
|
|
|
}
|
2007-07-29 00:04:01 +08:00
|
|
|
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
if (peer->max_fails
|
|
|
|
&& peer->fails >= peer->max_fails
|
|
|
|
&& now - peer->checked <= peer->fail_timeout)
|
|
|
|
{
|
|
|
|
continue;
|
|
|
|
}
|
2007-07-29 00:04:01 +08:00
|
|
|
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
peer->current_weight += peer->effective_weight;
|
|
|
|
total += peer->effective_weight;
|
2007-07-29 00:04:01 +08:00
|
|
|
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
if (peer->effective_weight < peer->weight) {
|
|
|
|
peer->effective_weight++;
|
2007-07-29 00:04:01 +08:00
|
|
|
}
|
|
|
|
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
if (best == NULL || peer->current_weight > best->current_weight) {
|
|
|
|
best = peer;
|
2011-08-19 00:52:38 +08:00
|
|
|
}
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
}
|
2011-08-19 00:52:38 +08:00
|
|
|
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
if (best == NULL) {
|
|
|
|
return NULL;
|
2007-07-29 00:04:01 +08:00
|
|
|
}
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
|
|
|
|
i = best - &rrp->peers->peer[0];
|
|
|
|
|
|
|
|
rrp->current = i;
|
|
|
|
|
|
|
|
n = i / (8 * sizeof(uintptr_t));
|
|
|
|
m = (uintptr_t) 1 << i % (8 * sizeof(uintptr_t));
|
|
|
|
|
|
|
|
rrp->tried[n] |= m;
|
|
|
|
|
|
|
|
best->current_weight -= total;
|
|
|
|
best->checked = now;
|
|
|
|
|
|
|
|
return best;
|
2007-07-29 00:04:01 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-12-05 00:46:13 +08:00
|
|
|
void
|
|
|
|
ngx_http_upstream_free_round_robin_peer(ngx_peer_connection_t *pc, void *data,
|
|
|
|
ngx_uint_t state)
|
|
|
|
{
|
|
|
|
ngx_http_upstream_rr_peer_data_t *rrp = data;
|
|
|
|
|
|
|
|
time_t now;
|
|
|
|
ngx_http_upstream_rr_peer_t *peer;
|
|
|
|
|
|
|
|
ngx_log_debug2(NGX_LOG_DEBUG_HTTP, pc->log, 0,
|
|
|
|
"free rr peer %ui %ui", pc->tries, state);
|
|
|
|
|
|
|
|
if (state == 0 && pc->tries == 0) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* TODO: NGX_PEER_KEEPALIVE */
|
|
|
|
|
2007-08-09 21:54:33 +08:00
|
|
|
if (rrp->peers->single) {
|
2006-12-05 00:46:13 +08:00
|
|
|
pc->tries = 0;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2011-10-12 22:22:48 +08:00
|
|
|
peer = &rrp->peers->peer[rrp->current];
|
|
|
|
|
2006-12-05 00:46:13 +08:00
|
|
|
if (state & NGX_PEER_FAILED) {
|
|
|
|
now = ngx_time();
|
|
|
|
|
|
|
|
/* ngx_lock_mutex(rrp->peers->mutex); */
|
|
|
|
|
|
|
|
peer->fails++;
|
|
|
|
peer->accessed = now;
|
2011-10-12 22:22:48 +08:00
|
|
|
peer->checked = now;
|
2006-12-05 00:46:13 +08:00
|
|
|
|
2008-08-26 22:34:16 +08:00
|
|
|
if (peer->max_fails) {
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
peer->effective_weight -= peer->weight / peer->max_fails;
|
2008-08-26 22:34:16 +08:00
|
|
|
}
|
2007-07-29 00:04:01 +08:00
|
|
|
|
|
|
|
ngx_log_debug2(NGX_LOG_DEBUG_HTTP, pc->log, 0,
|
|
|
|
"free rr peer failed: %ui %i",
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
rrp->current, peer->effective_weight);
|
2007-07-29 00:04:01 +08:00
|
|
|
|
Upstream: smooth weighted round-robin balancing.
For edge case weights like { 5, 1, 1 } we now produce { a, a, b, a, c, a, a }
sequence instead of { c, b, a, a, a, a, a } produced previously.
Algorithm is as follows: on each peer selection we increase current_weight
of each eligible peer by its weight, select peer with greatest current_weight
and reduce its current_weight by total number of weight points distributed
among peers.
In case of { 5, 1, 1 } weights this gives the following sequence of
current_weight's:
a b c
0 0 0 (initial state)
5 1 1 (a selected)
-2 1 1
3 2 2 (a selected)
-4 2 2
1 3 3 (b selected)
1 -4 3
6 -3 4 (a selected)
-1 -3 4
4 -2 5 (c selected)
4 -2 -2
9 -1 -1 (a selected)
2 -1 -1
7 0 0 (a selected)
0 0 0
To preserve weight reduction in case of failures the effective_weight
variable was introduced, which usually matches peer's weight, but is
reduced temporarily on peer failures.
This change also fixes loop with backup servers and proxy_next_upstream
http_404 (ticket #47), and skipping alive upstreams in some cases if there
are multiple dead ones (ticket #64).
2012-05-14 17:57:20 +08:00
|
|
|
if (peer->effective_weight < 0) {
|
|
|
|
peer->effective_weight = 0;
|
2006-12-05 00:46:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* ngx_unlock_mutex(rrp->peers->mutex); */
|
2011-10-12 22:22:48 +08:00
|
|
|
|
|
|
|
} else {
|
|
|
|
|
|
|
|
/* mark peer live if check passed */
|
|
|
|
|
|
|
|
if (peer->accessed < peer->checked) {
|
|
|
|
peer->fails = 0;
|
|
|
|
}
|
2006-12-05 00:46:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
if (pc->tries) {
|
|
|
|
pc->tries--;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* ngx_unlock_mutex(rrp->peers->mutex); */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#if (NGX_HTTP_SSL)
|
|
|
|
|
2007-07-11 05:04:37 +08:00
|
|
|
ngx_int_t
|
|
|
|
ngx_http_upstream_set_round_robin_peer_session(ngx_peer_connection_t *pc,
|
|
|
|
void *data)
|
2006-12-05 00:46:13 +08:00
|
|
|
{
|
|
|
|
ngx_http_upstream_rr_peer_data_t *rrp = data;
|
|
|
|
|
2007-07-11 05:04:37 +08:00
|
|
|
ngx_int_t rc;
|
2006-12-05 00:46:13 +08:00
|
|
|
ngx_ssl_session_t *ssl_session;
|
|
|
|
ngx_http_upstream_rr_peer_t *peer;
|
|
|
|
|
2007-07-11 05:04:37 +08:00
|
|
|
peer = &rrp->peers->peer[rrp->current];
|
|
|
|
|
|
|
|
/* TODO: threads only mutex */
|
|
|
|
/* ngx_lock_mutex(rrp->peers->mutex); */
|
|
|
|
|
|
|
|
ssl_session = peer->ssl_session;
|
|
|
|
|
|
|
|
rc = ngx_ssl_set_session(pc->connection, ssl_session);
|
|
|
|
|
|
|
|
ngx_log_debug2(NGX_LOG_DEBUG_HTTP, pc->log, 0,
|
2007-08-31 20:13:12 +08:00
|
|
|
"set session: %p:%d",
|
|
|
|
ssl_session, ssl_session ? ssl_session->references : 0);
|
2007-07-11 05:04:37 +08:00
|
|
|
|
|
|
|
/* ngx_unlock_mutex(rrp->peers->mutex); */
|
|
|
|
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
ngx_http_upstream_save_round_robin_peer_session(ngx_peer_connection_t *pc,
|
|
|
|
void *data)
|
|
|
|
{
|
|
|
|
ngx_http_upstream_rr_peer_data_t *rrp = data;
|
|
|
|
|
|
|
|
ngx_ssl_session_t *old_ssl_session, *ssl_session;
|
|
|
|
ngx_http_upstream_rr_peer_t *peer;
|
|
|
|
|
2006-12-05 00:46:13 +08:00
|
|
|
ssl_session = ngx_ssl_get_session(pc->connection);
|
|
|
|
|
|
|
|
if (ssl_session == NULL) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2007-07-11 05:04:37 +08:00
|
|
|
ngx_log_debug2(NGX_LOG_DEBUG_HTTP, pc->log, 0,
|
2007-08-31 20:13:12 +08:00
|
|
|
"save session: %p:%d", ssl_session, ssl_session->references);
|
2007-07-11 05:04:37 +08:00
|
|
|
|
2006-12-05 00:46:13 +08:00
|
|
|
peer = &rrp->peers->peer[rrp->current];
|
|
|
|
|
2007-07-11 05:04:37 +08:00
|
|
|
/* TODO: threads only mutex */
|
2006-12-05 00:46:13 +08:00
|
|
|
/* ngx_lock_mutex(rrp->peers->mutex); */
|
2007-07-11 05:04:37 +08:00
|
|
|
|
|
|
|
old_ssl_session = peer->ssl_session;
|
2006-12-05 00:46:13 +08:00
|
|
|
peer->ssl_session = ssl_session;
|
2007-07-11 05:04:37 +08:00
|
|
|
|
2006-12-05 00:46:13 +08:00
|
|
|
/* ngx_unlock_mutex(rrp->peers->mutex); */
|
|
|
|
|
2007-07-11 05:04:37 +08:00
|
|
|
if (old_ssl_session) {
|
|
|
|
|
|
|
|
ngx_log_debug2(NGX_LOG_DEBUG_HTTP, pc->log, 0,
|
2007-08-31 20:13:12 +08:00
|
|
|
"old session: %p:%d",
|
2007-07-11 05:04:37 +08:00
|
|
|
old_ssl_session, old_ssl_session->references);
|
|
|
|
|
2006-12-05 00:46:13 +08:00
|
|
|
/* TODO: may block */
|
2007-07-11 05:04:37 +08:00
|
|
|
|
|
|
|
ngx_ssl_free_session(old_ssl_session);
|
2006-12-05 00:46:13 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-07-23 00:30:17 +08:00
|
|
|
|
|
|
|
static ngx_int_t
|
|
|
|
ngx_http_upstream_empty_set_session(ngx_peer_connection_t *pc, void *data)
|
|
|
|
{
|
|
|
|
return NGX_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
ngx_http_upstream_empty_save_session(ngx_peer_connection_t *pc, void *data)
|
|
|
|
{
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2006-12-05 00:46:13 +08:00
|
|
|
#endif
|