2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* IPVS: Source Hashing scheduling module
|
|
|
|
*
|
|
|
|
* Authors: Wensong Zhang <wensong@gnuchina.org>
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public License
|
|
|
|
* as published by the Free Software Foundation; either version
|
|
|
|
* 2 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* Changes:
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The sh algorithm is to select server by the hash key of source IP
|
|
|
|
* address. The pseudo code is as follows:
|
|
|
|
*
|
|
|
|
* n <- servernode[src_ip];
|
|
|
|
* if (n is dead) OR
|
|
|
|
* (n is overloaded) or (n.weight <= 0) then
|
|
|
|
* return NULL;
|
|
|
|
*
|
|
|
|
* return n;
|
|
|
|
*
|
|
|
|
* Notes that servernode is a 256-bucket hash table that maps the hash
|
|
|
|
* index derived from packet source IP address to the current server
|
|
|
|
* array. If the sh scheduler is used in cache cluster, it is good to
|
|
|
|
* combine it with cache_bypass feature. When the statically assigned
|
|
|
|
* server is dead or overloaded, the load balancer can bypass the cache
|
|
|
|
* server and send requests to the original server directly.
|
|
|
|
*
|
2011-12-08 15:55:09 +00:00
|
|
|
* The weight destination attribute can be used to control the
|
|
|
|
* distribution of connections to the destinations in servernode. The
|
|
|
|
* greater the weight, the more connections the destination
|
|
|
|
* will receive.
|
|
|
|
*
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
|
|
|
|
2009-07-30 21:29:44 +00:00
|
|
|
#define KMSG_COMPONENT "IPVS"
|
|
|
|
#define pr_fmt(fmt) KMSG_COMPONENT ": " fmt
|
|
|
|
|
2005-12-27 04:43:12 +00:00
|
|
|
#include <linux/ip.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 08:04:11 +00:00
|
|
|
#include <linux/slab.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/kernel.h>
|
2005-12-27 04:43:12 +00:00
|
|
|
#include <linux/skbuff.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
#include <net/ip_vs.h>
|
|
|
|
|
2013-06-19 09:54:25 +00:00
|
|
|
#include <net/tcp.h>
|
|
|
|
#include <linux/udp.h>
|
|
|
|
#include <linux/sctp.h>
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* IPVS SH bucket
|
|
|
|
*/
|
|
|
|
struct ip_vs_sh_bucket {
|
2013-03-22 09:46:46 +00:00
|
|
|
struct ip_vs_dest __rcu *dest; /* real server (cache) */
|
2005-04-16 22:20:36 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* for IPVS SH entry hash table
|
|
|
|
*/
|
|
|
|
#ifndef CONFIG_IP_VS_SH_TAB_BITS
|
|
|
|
#define CONFIG_IP_VS_SH_TAB_BITS 8
|
|
|
|
#endif
|
|
|
|
#define IP_VS_SH_TAB_BITS CONFIG_IP_VS_SH_TAB_BITS
|
|
|
|
#define IP_VS_SH_TAB_SIZE (1 << IP_VS_SH_TAB_BITS)
|
|
|
|
#define IP_VS_SH_TAB_MASK (IP_VS_SH_TAB_SIZE - 1)
|
|
|
|
|
2013-03-22 09:46:46 +00:00
|
|
|
struct ip_vs_sh_state {
|
|
|
|
struct rcu_head rcu_head;
|
2013-05-29 12:33:51 +00:00
|
|
|
struct ip_vs_sh_bucket buckets[IP_VS_SH_TAB_SIZE];
|
2013-03-22 09:46:46 +00:00
|
|
|
};
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2013-06-19 09:54:25 +00:00
|
|
|
/* Helper function to determine if server is unavailable */
|
|
|
|
static inline bool is_unavailable(struct ip_vs_dest *dest)
|
|
|
|
{
|
|
|
|
return atomic_read(&dest->weight) <= 0 ||
|
|
|
|
dest->flags & IP_VS_DEST_F_OVERLOAD;
|
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* Returns hash value for IPVS SH entry
|
|
|
|
*/
|
2013-06-19 09:54:25 +00:00
|
|
|
static inline unsigned int
|
|
|
|
ip_vs_sh_hashkey(int af, const union nf_inet_addr *addr,
|
|
|
|
__be16 port, unsigned int offset)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2008-11-01 13:13:19 +00:00
|
|
|
__be32 addr_fold = addr->ip;
|
|
|
|
|
|
|
|
#ifdef CONFIG_IP_VS_IPV6
|
|
|
|
if (af == AF_INET6)
|
|
|
|
addr_fold = addr->ip6[0]^addr->ip6[1]^
|
|
|
|
addr->ip6[2]^addr->ip6[3];
|
|
|
|
#endif
|
2013-06-19 09:54:25 +00:00
|
|
|
return (offset + (ntohs(port) + ntohl(addr_fold))*2654435761UL) &
|
|
|
|
IP_VS_SH_TAB_MASK;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Get ip_vs_dest associated with supplied parameters.
|
|
|
|
*/
|
|
|
|
static inline struct ip_vs_dest *
|
2013-06-19 09:54:25 +00:00
|
|
|
ip_vs_sh_get(struct ip_vs_service *svc, struct ip_vs_sh_state *s,
|
|
|
|
const union nf_inet_addr *addr, __be16 port)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2013-06-19 09:54:25 +00:00
|
|
|
unsigned int hash = ip_vs_sh_hashkey(svc->af, addr, port, 0);
|
|
|
|
struct ip_vs_dest *dest = rcu_dereference(s->buckets[hash].dest);
|
|
|
|
|
|
|
|
return (!dest || is_unavailable(dest)) ? NULL : dest;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-09-27 10:06:23 +00:00
|
|
|
/* As ip_vs_sh_get, but with fallback if selected server is unavailable
|
|
|
|
*
|
|
|
|
* The fallback strategy loops around the table starting from a "random"
|
|
|
|
* point (in fact, it is chosen to be the original hash value to make the
|
|
|
|
* algorithm deterministic) to find a new server.
|
|
|
|
*/
|
2013-06-19 09:54:25 +00:00
|
|
|
static inline struct ip_vs_dest *
|
|
|
|
ip_vs_sh_get_fallback(struct ip_vs_service *svc, struct ip_vs_sh_state *s,
|
|
|
|
const union nf_inet_addr *addr, __be16 port)
|
|
|
|
{
|
2013-09-27 10:06:23 +00:00
|
|
|
unsigned int offset, roffset;
|
|
|
|
unsigned int hash, ihash;
|
2013-06-19 09:54:25 +00:00
|
|
|
struct ip_vs_dest *dest;
|
|
|
|
|
2013-09-27 10:06:23 +00:00
|
|
|
/* first try the dest it's supposed to go to */
|
|
|
|
ihash = ip_vs_sh_hashkey(svc->af, addr, port, 0);
|
|
|
|
dest = rcu_dereference(s->buckets[ihash].dest);
|
|
|
|
if (!dest)
|
|
|
|
return NULL;
|
|
|
|
if (!is_unavailable(dest))
|
|
|
|
return dest;
|
|
|
|
|
|
|
|
IP_VS_DBG_BUF(6, "SH: selected unavailable server %s:%d, reselecting",
|
2014-09-16 21:09:00 +00:00
|
|
|
IP_VS_DBG_ADDR(dest->af, &dest->addr), ntohs(dest->port));
|
2013-09-27 10:06:23 +00:00
|
|
|
|
|
|
|
/* if the original dest is unavailable, loop around the table
|
|
|
|
* starting from ihash to find a new dest
|
|
|
|
*/
|
2013-06-19 09:54:25 +00:00
|
|
|
for (offset = 0; offset < IP_VS_SH_TAB_SIZE; offset++) {
|
2013-09-27 10:06:23 +00:00
|
|
|
roffset = (offset + ihash) % IP_VS_SH_TAB_SIZE;
|
|
|
|
hash = ip_vs_sh_hashkey(svc->af, addr, port, roffset);
|
2013-06-19 09:54:25 +00:00
|
|
|
dest = rcu_dereference(s->buckets[hash].dest);
|
|
|
|
if (!dest)
|
|
|
|
break;
|
2013-09-27 10:06:23 +00:00
|
|
|
if (!is_unavailable(dest))
|
2013-06-19 09:54:25 +00:00
|
|
|
return dest;
|
2013-09-27 10:06:23 +00:00
|
|
|
IP_VS_DBG_BUF(6, "SH: selected unavailable "
|
|
|
|
"server %s:%d (offset %d), reselecting",
|
2014-09-16 21:09:00 +00:00
|
|
|
IP_VS_DBG_ADDR(dest->af, &dest->addr),
|
2013-09-27 10:06:23 +00:00
|
|
|
ntohs(dest->port), roffset);
|
2013-06-19 09:54:25 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* Assign all the hash buckets of the specified table with the service.
|
|
|
|
*/
|
|
|
|
static int
|
2013-03-22 09:46:46 +00:00
|
|
|
ip_vs_sh_reassign(struct ip_vs_sh_state *s, struct ip_vs_service *svc)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
struct ip_vs_sh_bucket *b;
|
|
|
|
struct list_head *p;
|
|
|
|
struct ip_vs_dest *dest;
|
2011-12-08 15:55:09 +00:00
|
|
|
int d_count;
|
2013-03-22 09:46:46 +00:00
|
|
|
bool empty;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2013-03-22 09:46:46 +00:00
|
|
|
b = &s->buckets[0];
|
2005-04-16 22:20:36 +00:00
|
|
|
p = &svc->destinations;
|
2013-03-22 09:46:46 +00:00
|
|
|
empty = list_empty(p);
|
2011-12-08 15:55:09 +00:00
|
|
|
d_count = 0;
|
2005-04-16 22:20:36 +00:00
|
|
|
for (i=0; i<IP_VS_SH_TAB_SIZE; i++) {
|
2013-03-22 09:46:46 +00:00
|
|
|
dest = rcu_dereference_protected(b->dest, 1);
|
|
|
|
if (dest)
|
|
|
|
ip_vs_dest_put(dest);
|
|
|
|
if (empty)
|
|
|
|
RCU_INIT_POINTER(b->dest, NULL);
|
|
|
|
else {
|
2005-04-16 22:20:36 +00:00
|
|
|
if (p == &svc->destinations)
|
|
|
|
p = p->next;
|
|
|
|
|
|
|
|
dest = list_entry(p, struct ip_vs_dest, n_list);
|
2013-03-22 09:46:46 +00:00
|
|
|
ip_vs_dest_hold(dest);
|
|
|
|
RCU_INIT_POINTER(b->dest, dest);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2011-12-08 15:55:09 +00:00
|
|
|
IP_VS_DBG_BUF(6, "assigned i: %d dest: %s weight: %d\n",
|
2014-09-16 21:09:00 +00:00
|
|
|
i, IP_VS_DBG_ADDR(dest->af, &dest->addr),
|
2011-12-08 15:55:09 +00:00
|
|
|
atomic_read(&dest->weight));
|
|
|
|
|
|
|
|
/* Don't move to next dest until filling weight */
|
|
|
|
if (++d_count >= atomic_read(&dest->weight)) {
|
|
|
|
p = p->next;
|
|
|
|
d_count = 0;
|
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
b++;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Flush all the hash buckets of the specified table.
|
|
|
|
*/
|
2013-03-22 09:46:46 +00:00
|
|
|
static void ip_vs_sh_flush(struct ip_vs_sh_state *s)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
struct ip_vs_sh_bucket *b;
|
2013-03-22 09:46:46 +00:00
|
|
|
struct ip_vs_dest *dest;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2013-03-22 09:46:46 +00:00
|
|
|
b = &s->buckets[0];
|
2005-04-16 22:20:36 +00:00
|
|
|
for (i=0; i<IP_VS_SH_TAB_SIZE; i++) {
|
2013-03-22 09:46:46 +00:00
|
|
|
dest = rcu_dereference_protected(b->dest, 1);
|
|
|
|
if (dest) {
|
|
|
|
ip_vs_dest_put(dest);
|
|
|
|
RCU_INIT_POINTER(b->dest, NULL);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
b++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int ip_vs_sh_init_svc(struct ip_vs_service *svc)
|
|
|
|
{
|
2013-03-22 09:46:46 +00:00
|
|
|
struct ip_vs_sh_state *s;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
/* allocate the SH table for this service */
|
2013-03-22 09:46:46 +00:00
|
|
|
s = kzalloc(sizeof(struct ip_vs_sh_state), GFP_KERNEL);
|
|
|
|
if (s == NULL)
|
2005-04-16 22:20:36 +00:00
|
|
|
return -ENOMEM;
|
2011-08-29 21:17:25 +00:00
|
|
|
|
2013-03-22 09:46:46 +00:00
|
|
|
svc->sched_data = s;
|
2005-04-16 22:20:36 +00:00
|
|
|
IP_VS_DBG(6, "SH hash table (memory=%Zdbytes) allocated for "
|
|
|
|
"current service\n",
|
|
|
|
sizeof(struct ip_vs_sh_bucket)*IP_VS_SH_TAB_SIZE);
|
|
|
|
|
2013-03-22 09:46:46 +00:00
|
|
|
/* assign the hash buckets with current dests */
|
|
|
|
ip_vs_sh_reassign(s, svc);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-03-22 09:46:50 +00:00
|
|
|
static void ip_vs_sh_done_svc(struct ip_vs_service *svc)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2013-03-22 09:46:46 +00:00
|
|
|
struct ip_vs_sh_state *s = svc->sched_data;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
/* got to clean up hash buckets here */
|
2013-03-22 09:46:46 +00:00
|
|
|
ip_vs_sh_flush(s);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
/* release the table itself */
|
2013-03-22 09:46:46 +00:00
|
|
|
kfree_rcu(s, rcu_head);
|
2005-04-16 22:20:36 +00:00
|
|
|
IP_VS_DBG(6, "SH hash table (memory=%Zdbytes) released\n",
|
|
|
|
sizeof(struct ip_vs_sh_bucket)*IP_VS_SH_TAB_SIZE);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-03-22 09:46:46 +00:00
|
|
|
static int ip_vs_sh_dest_changed(struct ip_vs_service *svc,
|
|
|
|
struct ip_vs_dest *dest)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2013-03-22 09:46:46 +00:00
|
|
|
struct ip_vs_sh_state *s = svc->sched_data;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
/* assign the hash buckets with the updated service */
|
2013-03-22 09:46:46 +00:00
|
|
|
ip_vs_sh_reassign(s, svc);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-06-19 09:54:25 +00:00
|
|
|
/* Helper function to get port number */
|
|
|
|
static inline __be16
|
|
|
|
ip_vs_sh_get_port(const struct sk_buff *skb, struct ip_vs_iphdr *iph)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2013-06-19 09:54:25 +00:00
|
|
|
__be16 port;
|
|
|
|
struct tcphdr _tcph, *th;
|
|
|
|
struct udphdr _udph, *uh;
|
|
|
|
sctp_sctphdr_t _sctph, *sh;
|
|
|
|
|
|
|
|
switch (iph->protocol) {
|
|
|
|
case IPPROTO_TCP:
|
|
|
|
th = skb_header_pointer(skb, iph->len, sizeof(_tcph), &_tcph);
|
2013-08-06 09:20:23 +00:00
|
|
|
if (unlikely(th == NULL))
|
|
|
|
return 0;
|
2013-06-19 09:54:25 +00:00
|
|
|
port = th->source;
|
|
|
|
break;
|
|
|
|
case IPPROTO_UDP:
|
|
|
|
uh = skb_header_pointer(skb, iph->len, sizeof(_udph), &_udph);
|
2013-08-06 09:20:23 +00:00
|
|
|
if (unlikely(uh == NULL))
|
|
|
|
return 0;
|
2013-06-19 09:54:25 +00:00
|
|
|
port = uh->source;
|
|
|
|
break;
|
|
|
|
case IPPROTO_SCTP:
|
|
|
|
sh = skb_header_pointer(skb, iph->len, sizeof(_sctph), &_sctph);
|
2013-08-06 09:20:23 +00:00
|
|
|
if (unlikely(sh == NULL))
|
|
|
|
return 0;
|
2013-06-19 09:54:25 +00:00
|
|
|
port = sh->source;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
port = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
return port;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Source Hashing scheduling
|
|
|
|
*/
|
|
|
|
static struct ip_vs_dest *
|
2013-06-16 06:09:36 +00:00
|
|
|
ip_vs_sh_schedule(struct ip_vs_service *svc, const struct sk_buff *skb,
|
|
|
|
struct ip_vs_iphdr *iph)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
struct ip_vs_dest *dest;
|
2013-03-22 09:46:46 +00:00
|
|
|
struct ip_vs_sh_state *s;
|
2013-06-19 09:54:25 +00:00
|
|
|
__be16 port = 0;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
IP_VS_DBG(6, "ip_vs_sh_schedule(): Scheduling...\n");
|
|
|
|
|
2013-06-19 09:54:25 +00:00
|
|
|
if (svc->flags & IP_VS_SVC_F_SCHED_SH_PORT)
|
|
|
|
port = ip_vs_sh_get_port(skb, iph);
|
|
|
|
|
2013-03-22 09:46:46 +00:00
|
|
|
s = (struct ip_vs_sh_state *) svc->sched_data;
|
2013-06-19 09:54:25 +00:00
|
|
|
|
|
|
|
if (svc->flags & IP_VS_SVC_F_SCHED_SH_FALLBACK)
|
|
|
|
dest = ip_vs_sh_get_fallback(svc, s, &iph->saddr, port);
|
|
|
|
else
|
|
|
|
dest = ip_vs_sh_get(svc, s, &iph->saddr, port);
|
|
|
|
|
|
|
|
if (!dest) {
|
2011-02-11 13:01:12 +00:00
|
|
|
ip_vs_scheduler_err(svc, "no destination available");
|
2005-04-16 22:20:36 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2008-11-01 13:13:19 +00:00
|
|
|
IP_VS_DBG_BUF(6, "SH: source IP address %s --> server %s:%d\n",
|
2013-06-16 06:09:36 +00:00
|
|
|
IP_VS_DBG_ADDR(svc->af, &iph->saddr),
|
2014-09-16 21:09:00 +00:00
|
|
|
IP_VS_DBG_ADDR(dest->af, &dest->addr),
|
2008-11-01 13:13:19 +00:00
|
|
|
ntohs(dest->port));
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
return dest;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* IPVS SH Scheduler structure
|
|
|
|
*/
|
|
|
|
static struct ip_vs_scheduler ip_vs_sh_scheduler =
|
|
|
|
{
|
|
|
|
.name = "sh",
|
|
|
|
.refcnt = ATOMIC_INIT(0),
|
|
|
|
.module = THIS_MODULE,
|
2008-08-10 09:18:02 +00:00
|
|
|
.n_list = LIST_HEAD_INIT(ip_vs_sh_scheduler.n_list),
|
2005-04-16 22:20:36 +00:00
|
|
|
.init_service = ip_vs_sh_init_svc,
|
|
|
|
.done_service = ip_vs_sh_done_svc,
|
2013-03-22 09:46:46 +00:00
|
|
|
.add_dest = ip_vs_sh_dest_changed,
|
|
|
|
.del_dest = ip_vs_sh_dest_changed,
|
|
|
|
.upd_dest = ip_vs_sh_dest_changed,
|
2005-04-16 22:20:36 +00:00
|
|
|
.schedule = ip_vs_sh_schedule,
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
static int __init ip_vs_sh_init(void)
|
|
|
|
{
|
|
|
|
return register_ip_vs_scheduler(&ip_vs_sh_scheduler);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void __exit ip_vs_sh_cleanup(void)
|
|
|
|
{
|
|
|
|
unregister_ip_vs_scheduler(&ip_vs_sh_scheduler);
|
2013-03-22 09:46:53 +00:00
|
|
|
synchronize_rcu();
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
module_init(ip_vs_sh_init);
|
|
|
|
module_exit(ip_vs_sh_cleanup);
|
|
|
|
MODULE_LICENSE("GPL");
|