blob: a8f8586fce3cef959dd4707328857f8219cf10c2 [file] [log] [blame]
Willy Tarreaubaaee002006-06-26 02:48:02 +02001/*
Willy Tarreau5b4c2b52009-10-03 11:21:53 +02002 * include/types/backend.h
3 * This file assembles definitions for backends
4 *
5 * Copyright (C) 2000-2009 Willy Tarreau - w@1wt.eu
6 *
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation, version 2.1
10 * exclusively.
11 *
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with this library; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
Willy Tarreaubaaee002006-06-26 02:48:02 +020021
22#ifndef _TYPES_BACKEND_H
23#define _TYPES_BACKEND_H
24
Willy Tarreaue3ba5f02006-06-29 18:54:54 +020025#include <common/config.h>
Willy Tarreau5b4c2b52009-10-03 11:21:53 +020026#include <types/lb_fwlc.h>
27#include <types/lb_fwrr.h>
28#include <types/lb_map.h>
29#include <types/server.h>
Willy Tarreaue3ba5f02006-06-29 18:54:54 +020030
Willy Tarreauf3e49f92009-10-03 12:21:20 +020031/* Parameters for lbprm.algo */
32
33/* Lower bits define the kind of load balancing method, which means the type of
34 * algorithm, and which criterion it is based on. For this reason, those bits
35 * also include information about dependencies, so that the config parser can
36 * detect incompatibilities.
Willy Tarreaudf366142007-11-30 16:23:20 +010037 */
38
Willy Tarreauf3e49f92009-10-03 12:21:20 +020039/* LB parameters. Depends on the LB kind. Right now, only hashing uses this. */
40#define BE_LB_HASH_SRC 0x00000 /* hash source IP */
41#define BE_LB_HASH_URI 0x00001 /* hash HTTP URI */
42#define BE_LB_HASH_PRM 0x00002 /* hash HTTP URL parameter */
43#define BE_LB_HASH_HDR 0x00003 /* hash HTTP header value */
44#define BE_LB_HASH_RDP 0x00004 /* hash RDP cookie value */
Willy Tarreau9757a382009-10-03 12:56:50 +020045
46#define BE_LB_RR_DYN 0x00000 /* dynamic round robin (default) */
47#define BE_LB_RR_STATIC 0x00001 /* static round robin */
Willy Tarreauf3e49f92009-10-03 12:21:20 +020048#define BE_LB_PARM 0x000FF /* mask to get/clear the LB param */
49
50/* Required input(s) */
51#define BE_LB_NEED_NONE 0x00000 /* no input needed */
52#define BE_LB_NEED_ADDR 0x00100 /* only source address needed */
53#define BE_LB_NEED_DATA 0x00200 /* some payload is needed */
54#define BE_LB_NEED_HTTP 0x00400 /* an HTTP request is needed */
55/* not used: 0x0800 */
56#define BE_LB_NEED 0x00F00 /* mask to get/clear dependencies */
57
58/* Algorithm */
59#define BE_LB_KIND_NONE 0x00000 /* algorithm not set */
60#define BE_LB_KIND_RR 0x01000 /* round-robin */
61#define BE_LB_KIND_LC 0x02000 /* least connections */
62#define BE_LB_KIND_HI 0x03000 /* hash of input (see hash inputs below) */
63#define BE_LB_KIND 0x07000 /* mask to get/clear LB algorithm */
64
65/* All known variants of load balancing algorithms. These can be cleared using
66 * the BE_LB_ALGO mask. For a check, using BE_LB_KIND is preferred.
67 */
68#define BE_LB_ALGO_NONE (BE_LB_KIND_NONE | BE_LB_NEED_NONE) /* not defined */
69#define BE_LB_ALGO_RR (BE_LB_KIND_RR | BE_LB_NEED_NONE) /* round robin */
70#define BE_LB_ALGO_LC (BE_LB_KIND_LC | BE_LB_NEED_NONE) /* least connections */
Willy Tarreau9757a382009-10-03 12:56:50 +020071#define BE_LB_ALGO_SRR (BE_LB_KIND_RR | BE_LB_NEED_NONE | BE_LB_RR_STATIC) /* static round robin */
Willy Tarreauf3e49f92009-10-03 12:21:20 +020072#define BE_LB_ALGO_SH (BE_LB_KIND_HI | BE_LB_NEED_ADDR | BE_LB_HASH_SRC) /* hash: source IP */
73#define BE_LB_ALGO_UH (BE_LB_KIND_HI | BE_LB_NEED_HTTP | BE_LB_HASH_URI) /* hash: HTTP URI */
74#define BE_LB_ALGO_PH (BE_LB_KIND_HI | BE_LB_NEED_HTTP | BE_LB_HASH_PRM) /* hash: HTTP URL parameter */
75#define BE_LB_ALGO_HH (BE_LB_KIND_HI | BE_LB_NEED_HTTP | BE_LB_HASH_HDR) /* hash: HTTP header value */
76#define BE_LB_ALGO_RCH (BE_LB_KIND_HI | BE_LB_NEED_DATA | BE_LB_HASH_RDP) /* hash: RDP cookie value */
77#define BE_LB_ALGO (BE_LB_KIND | BE_LB_NEED | BE_LB_PARM ) /* mask to clear algo */
78
79/* Higher bits define how a given criterion is mapped to a server. In fact it
80 * designates the LB function by itself. The dynamic algorithms will also have
81 * the DYN bit set. These flags are automatically set at the end of the parsing.
82 */
83#define BE_LB_LKUP_NONE 0x00000 /* not defined */
84#define BE_LB_LKUP_MAP 0x10000 /* static map based lookup */
85#define BE_LB_LKUP_RRTREE 0x20000 /* FWRR tree lookup */
86#define BE_LB_LKUP_LCTREE 0x30000 /* FWLC tree lookup */
87#define BE_LB_LKUP 0x70000 /* mask to get just the LKUP value */
88
89/* additional properties */
90#define BE_LB_PROP_DYN 0x80000 /* bit to indicate a dynamic algorithm */
91
Willy Tarreaudf366142007-11-30 16:23:20 +010092
Willy Tarreaub625a082007-11-26 01:15:43 +010093
94/* various constants */
Willy Tarreaub698f0f2007-12-02 11:01:23 +010095
matt.farnsworth@nokia.com1c2ab962008-04-14 20:47:37 +020096/* The scale factor between user weight and effective weight allows smooth
Willy Tarreaub698f0f2007-12-02 11:01:23 +010097 * weight modulation even with small weights (eg: 1). It should not be too high
98 * though because it limits the number of servers in FWRR mode in order to
99 * prevent any integer overflow. The max number of servers per backend is
100 * limited to about 2^32/255^2/scale ~= 66051/scale. A scale of 16 looks like
101 * a good value, as it allows more than 4000 servers per backend while leaving
102 * modulation steps of about 6% for servers with the lowest weight (1).
103 */
104#define BE_WEIGHT_SCALE 16
Willy Tarreaub625a082007-11-26 01:15:43 +0100105
Willy Tarreau5b4c2b52009-10-03 11:21:53 +0200106/* LB parameters for all algorithms */
107struct lbprm {
Willy Tarreauf3e49f92009-10-03 12:21:20 +0200108 int algo; /* load balancing algorithm and variants: BE_LB_* */
Willy Tarreau5b4c2b52009-10-03 11:21:53 +0200109 int tot_wact, tot_wbck; /* total effective weights of active and backup servers */
110 int tot_weight; /* total effective weight of servers participating to LB */
111 int tot_used; /* total number of servers used for LB */
112 int wmult; /* ratio between user weight and effective weight */
113 int wdiv; /* ratio between effective weight and user weight */
114 struct server *fbck; /* first backup server when !PR_O_USE_ALL_BK, or NULL */
115 struct lb_map map; /* LB parameters for map-based algorithms */
116 struct lb_fwrr fwrr;
117 struct lb_fwlc fwlc;
118 /* Call backs for some actions. Some may be NULL (thus should be ignored). */
119 void (*update_server_eweight)(struct server *); /* to be called after eweight change */
120 void (*set_server_status_up)(struct server *); /* to be called after status changes to UP */
121 void (*set_server_status_down)(struct server *); /* to be called after status changes to DOWN */
122 void (*server_take_conn)(struct server *); /* to be called when connection is assigned */
123 void (*server_drop_conn)(struct server *); /* to be called when connection is dropped */
124};
125
Willy Tarreaubaaee002006-06-26 02:48:02 +0200126#endif /* _TYPES_BACKEND_H */
127
128/*
129 * Local variables:
130 * c-indent-level: 8
131 * c-basic-offset: 8
132 * End:
133 */