2 * IPVS: Source Hashing scheduling module
4 * Authors: Wensong Zhang <wensong@gnuchina.org>
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version
9 * 2 of the License, or (at your option) any later version.
16 * The sh algorithm is to select server by the hash key of source IP
17 * address. The pseudo code is as follows:
19 * n <- servernode[src_ip];
21 * (n is overloaded) or (n.weight <= 0) then
26 * Notes that servernode is a 256-bucket hash table that maps the hash
27 * index derived from packet source IP address to the current server
28 * array. If the sh scheduler is used in cache cluster, it is good to
29 * combine it with cache_bypass feature. When the statically assigned
30 * server is dead or overloaded, the load balancer can bypass the cache
31 * server and send requests to the original server directly.
33 * The weight destination attribute can be used to control the
34 * distribution of connections to the destinations in servernode. The
35 * greater the weight, the more connections the destination
40 #define KMSG_COMPONENT "IPVS"
41 #define pr_fmt(fmt) KMSG_COMPONENT ": " fmt
44 #include <linux/slab.h>
45 #include <linux/module.h>
46 #include <linux/kernel.h>
47 #include <linux/skbuff.h>
49 #include <net/ip_vs.h>
55 struct ip_vs_sh_bucket
{
56 struct ip_vs_dest __rcu
*dest
; /* real server (cache) */
60 * for IPVS SH entry hash table
62 #ifndef CONFIG_IP_VS_SH_TAB_BITS
63 #define CONFIG_IP_VS_SH_TAB_BITS 8
65 #define IP_VS_SH_TAB_BITS CONFIG_IP_VS_SH_TAB_BITS
66 #define IP_VS_SH_TAB_SIZE (1 << IP_VS_SH_TAB_BITS)
67 #define IP_VS_SH_TAB_MASK (IP_VS_SH_TAB_SIZE - 1)
69 struct ip_vs_sh_state
{
70 struct ip_vs_sh_bucket buckets
[IP_VS_SH_TAB_SIZE
];
71 struct rcu_head rcu_head
;
75 * Returns hash value for IPVS SH entry
77 static inline unsigned int ip_vs_sh_hashkey(int af
, const union nf_inet_addr
*addr
)
79 __be32 addr_fold
= addr
->ip
;
81 #ifdef CONFIG_IP_VS_IPV6
83 addr_fold
= addr
->ip6
[0]^addr
->ip6
[1]^
84 addr
->ip6
[2]^addr
->ip6
[3];
86 return (ntohl(addr_fold
)*2654435761UL) & IP_VS_SH_TAB_MASK
;
91 * Get ip_vs_dest associated with supplied parameters.
93 static inline struct ip_vs_dest
*
94 ip_vs_sh_get(int af
, struct ip_vs_sh_state
*s
, const union nf_inet_addr
*addr
)
96 return rcu_dereference(s
->buckets
[ip_vs_sh_hashkey(af
, addr
)].dest
);
101 * Assign all the hash buckets of the specified table with the service.
104 ip_vs_sh_reassign(struct ip_vs_sh_state
*s
, struct ip_vs_service
*svc
)
107 struct ip_vs_sh_bucket
*b
;
109 struct ip_vs_dest
*dest
;
114 p
= &svc
->destinations
;
115 empty
= list_empty(p
);
117 for (i
=0; i
<IP_VS_SH_TAB_SIZE
; i
++) {
118 dest
= rcu_dereference_protected(b
->dest
, 1);
120 ip_vs_dest_put(dest
);
122 RCU_INIT_POINTER(b
->dest
, NULL
);
124 if (p
== &svc
->destinations
)
127 dest
= list_entry(p
, struct ip_vs_dest
, n_list
);
128 ip_vs_dest_hold(dest
);
129 RCU_INIT_POINTER(b
->dest
, dest
);
131 IP_VS_DBG_BUF(6, "assigned i: %d dest: %s weight: %d\n",
132 i
, IP_VS_DBG_ADDR(svc
->af
, &dest
->addr
),
133 atomic_read(&dest
->weight
));
135 /* Don't move to next dest until filling weight */
136 if (++d_count
>= atomic_read(&dest
->weight
)) {
149 * Flush all the hash buckets of the specified table.
151 static void ip_vs_sh_flush(struct ip_vs_sh_state
*s
)
154 struct ip_vs_sh_bucket
*b
;
155 struct ip_vs_dest
*dest
;
158 for (i
=0; i
<IP_VS_SH_TAB_SIZE
; i
++) {
159 dest
= rcu_dereference_protected(b
->dest
, 1);
161 ip_vs_dest_put(dest
);
162 RCU_INIT_POINTER(b
->dest
, NULL
);
169 static int ip_vs_sh_init_svc(struct ip_vs_service
*svc
)
171 struct ip_vs_sh_state
*s
;
173 /* allocate the SH table for this service */
174 s
= kzalloc(sizeof(struct ip_vs_sh_state
), GFP_KERNEL
);
179 IP_VS_DBG(6, "SH hash table (memory=%Zdbytes) allocated for "
181 sizeof(struct ip_vs_sh_bucket
)*IP_VS_SH_TAB_SIZE
);
183 /* assign the hash buckets with current dests */
184 ip_vs_sh_reassign(s
, svc
);
190 static void ip_vs_sh_done_svc(struct ip_vs_service
*svc
)
192 struct ip_vs_sh_state
*s
= svc
->sched_data
;
194 /* got to clean up hash buckets here */
197 /* release the table itself */
198 kfree_rcu(s
, rcu_head
);
199 IP_VS_DBG(6, "SH hash table (memory=%Zdbytes) released\n",
200 sizeof(struct ip_vs_sh_bucket
)*IP_VS_SH_TAB_SIZE
);
204 static int ip_vs_sh_dest_changed(struct ip_vs_service
*svc
,
205 struct ip_vs_dest
*dest
)
207 struct ip_vs_sh_state
*s
= svc
->sched_data
;
209 /* assign the hash buckets with the updated service */
210 ip_vs_sh_reassign(s
, svc
);
217 * If the dest flags is set with IP_VS_DEST_F_OVERLOAD,
218 * consider that the server is overloaded here.
220 static inline int is_overloaded(struct ip_vs_dest
*dest
)
222 return dest
->flags
& IP_VS_DEST_F_OVERLOAD
;
227 * Source Hashing scheduling
229 static struct ip_vs_dest
*
230 ip_vs_sh_schedule(struct ip_vs_service
*svc
, const struct sk_buff
*skb
)
232 struct ip_vs_dest
*dest
;
233 struct ip_vs_sh_state
*s
;
234 struct ip_vs_iphdr iph
;
236 ip_vs_fill_iph_addr_only(svc
->af
, skb
, &iph
);
238 IP_VS_DBG(6, "ip_vs_sh_schedule(): Scheduling...\n");
240 s
= (struct ip_vs_sh_state
*) svc
->sched_data
;
241 dest
= ip_vs_sh_get(svc
->af
, s
, &iph
.saddr
);
243 || !(dest
->flags
& IP_VS_DEST_F_AVAILABLE
)
244 || atomic_read(&dest
->weight
) <= 0
245 || is_overloaded(dest
)) {
246 ip_vs_scheduler_err(svc
, "no destination available");
250 IP_VS_DBG_BUF(6, "SH: source IP address %s --> server %s:%d\n",
251 IP_VS_DBG_ADDR(svc
->af
, &iph
.saddr
),
252 IP_VS_DBG_ADDR(svc
->af
, &dest
->addr
),
260 * IPVS SH Scheduler structure
262 static struct ip_vs_scheduler ip_vs_sh_scheduler
=
265 .refcnt
= ATOMIC_INIT(0),
266 .module
= THIS_MODULE
,
267 .n_list
= LIST_HEAD_INIT(ip_vs_sh_scheduler
.n_list
),
268 .init_service
= ip_vs_sh_init_svc
,
269 .done_service
= ip_vs_sh_done_svc
,
270 .add_dest
= ip_vs_sh_dest_changed
,
271 .del_dest
= ip_vs_sh_dest_changed
,
272 .upd_dest
= ip_vs_sh_dest_changed
,
273 .schedule
= ip_vs_sh_schedule
,
277 static int __init
ip_vs_sh_init(void)
279 return register_ip_vs_scheduler(&ip_vs_sh_scheduler
);
283 static void __exit
ip_vs_sh_cleanup(void)
285 unregister_ip_vs_scheduler(&ip_vs_sh_scheduler
);
290 module_init(ip_vs_sh_init
);
291 module_exit(ip_vs_sh_cleanup
);
292 MODULE_LICENSE("GPL");