blob: 1a433cfa3b9ad6ecc550422c43f7f3eee1aab7c0 [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 *
Willy Tarreau3ebb1162012-02-13 16:57:44 +01005 * Copyright (C) 2000-2012 Willy Tarreau - w@1wt.eu
Willy Tarreau5b4c2b52009-10-03 11:21:53 +02006 *
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 Tarreau6b2e11b2009-10-01 07:52:15 +020026#include <types/lb_chash.h>
Willy Tarreauf09c6602012-02-13 17:12:08 +010027#include <types/lb_fas.h>
Willy Tarreau5b4c2b52009-10-03 11:21:53 +020028#include <types/lb_fwlc.h>
29#include <types/lb_fwrr.h>
30#include <types/lb_map.h>
31#include <types/server.h>
Willy Tarreaue3ba5f02006-06-29 18:54:54 +020032
Willy Tarreauf3e49f92009-10-03 12:21:20 +020033/* Parameters for lbprm.algo */
34
35/* Lower bits define the kind of load balancing method, which means the type of
36 * algorithm, and which criterion it is based on. For this reason, those bits
37 * also include information about dependencies, so that the config parser can
38 * detect incompatibilities.
Willy Tarreaudf366142007-11-30 16:23:20 +010039 */
40
Willy Tarreau3ebb1162012-02-13 16:57:44 +010041/* LB parameters are on the lower 8 bits. Depends on the LB kind. */
42
43/* BE_LB_HASH_* is used with BE_LB_KIND_HI */
Willy Tarreauf3e49f92009-10-03 12:21:20 +020044#define BE_LB_HASH_SRC 0x00000 /* hash source IP */
45#define BE_LB_HASH_URI 0x00001 /* hash HTTP URI */
46#define BE_LB_HASH_PRM 0x00002 /* hash HTTP URL parameter */
47#define BE_LB_HASH_HDR 0x00003 /* hash HTTP header value */
48#define BE_LB_HASH_RDP 0x00004 /* hash RDP cookie value */
Willy Tarreau9757a382009-10-03 12:56:50 +020049
Willy Tarreau3ebb1162012-02-13 16:57:44 +010050/* BE_LB_RR_* is used with BE_LB_KIND_RR */
Willy Tarreau9757a382009-10-03 12:56:50 +020051#define BE_LB_RR_DYN 0x00000 /* dynamic round robin (default) */
52#define BE_LB_RR_STATIC 0x00001 /* static round robin */
Willy Tarreau3ebb1162012-02-13 16:57:44 +010053
54/* BE_LB_CB_* is used with BE_LB_KIND_CB */
55#define BE_LB_CB_LC 0x00000 /* least-connections */
Willy Tarreauf09c6602012-02-13 17:12:08 +010056#define BE_LB_CB_FAS 0x00001 /* first available server (opposite of leastconn) */
Willy Tarreau3ebb1162012-02-13 16:57:44 +010057
Willy Tarreauf3e49f92009-10-03 12:21:20 +020058#define BE_LB_PARM 0x000FF /* mask to get/clear the LB param */
59
60/* Required input(s) */
61#define BE_LB_NEED_NONE 0x00000 /* no input needed */
62#define BE_LB_NEED_ADDR 0x00100 /* only source address needed */
63#define BE_LB_NEED_DATA 0x00200 /* some payload is needed */
64#define BE_LB_NEED_HTTP 0x00400 /* an HTTP request is needed */
65/* not used: 0x0800 */
66#define BE_LB_NEED 0x00F00 /* mask to get/clear dependencies */
67
68/* Algorithm */
69#define BE_LB_KIND_NONE 0x00000 /* algorithm not set */
70#define BE_LB_KIND_RR 0x01000 /* round-robin */
Willy Tarreau3ebb1162012-02-13 16:57:44 +010071#define BE_LB_KIND_CB 0x02000 /* connection-based */
Willy Tarreau6b2e11b2009-10-01 07:52:15 +020072#define BE_LB_KIND_HI 0x03000 /* hash of input (see hash inputs above) */
Willy Tarreauf3e49f92009-10-03 12:21:20 +020073#define BE_LB_KIND 0x07000 /* mask to get/clear LB algorithm */
74
75/* All known variants of load balancing algorithms. These can be cleared using
76 * the BE_LB_ALGO mask. For a check, using BE_LB_KIND is preferred.
77 */
78#define BE_LB_ALGO_NONE (BE_LB_KIND_NONE | BE_LB_NEED_NONE) /* not defined */
79#define BE_LB_ALGO_RR (BE_LB_KIND_RR | BE_LB_NEED_NONE) /* round robin */
Willy Tarreau3ebb1162012-02-13 16:57:44 +010080#define BE_LB_ALGO_LC (BE_LB_KIND_CB | BE_LB_NEED_NONE | BE_LB_CB_LC) /* least connections */
Willy Tarreauf09c6602012-02-13 17:12:08 +010081#define BE_LB_ALGO_FAS (BE_LB_KIND_CB | BE_LB_NEED_NONE | BE_LB_CB_FAS) /* first available server */
Willy Tarreau9757a382009-10-03 12:56:50 +020082#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 +020083#define BE_LB_ALGO_SH (BE_LB_KIND_HI | BE_LB_NEED_ADDR | BE_LB_HASH_SRC) /* hash: source IP */
84#define BE_LB_ALGO_UH (BE_LB_KIND_HI | BE_LB_NEED_HTTP | BE_LB_HASH_URI) /* hash: HTTP URI */
85#define BE_LB_ALGO_PH (BE_LB_KIND_HI | BE_LB_NEED_HTTP | BE_LB_HASH_PRM) /* hash: HTTP URL parameter */
86#define BE_LB_ALGO_HH (BE_LB_KIND_HI | BE_LB_NEED_HTTP | BE_LB_HASH_HDR) /* hash: HTTP header value */
87#define BE_LB_ALGO_RCH (BE_LB_KIND_HI | BE_LB_NEED_DATA | BE_LB_HASH_RDP) /* hash: RDP cookie value */
88#define BE_LB_ALGO (BE_LB_KIND | BE_LB_NEED | BE_LB_PARM ) /* mask to clear algo */
89
90/* Higher bits define how a given criterion is mapped to a server. In fact it
91 * designates the LB function by itself. The dynamic algorithms will also have
92 * the DYN bit set. These flags are automatically set at the end of the parsing.
93 */
94#define BE_LB_LKUP_NONE 0x00000 /* not defined */
95#define BE_LB_LKUP_MAP 0x10000 /* static map based lookup */
96#define BE_LB_LKUP_RRTREE 0x20000 /* FWRR tree lookup */
97#define BE_LB_LKUP_LCTREE 0x30000 /* FWLC tree lookup */
Willy Tarreau6b2e11b2009-10-01 07:52:15 +020098#define BE_LB_LKUP_CHTREE 0x40000 /* consistent hash */
Willy Tarreauf09c6602012-02-13 17:12:08 +010099#define BE_LB_LKUP_FSTREE 0x50000 /* FAS tree lookup */
Willy Tarreauf3e49f92009-10-03 12:21:20 +0200100#define BE_LB_LKUP 0x70000 /* mask to get just the LKUP value */
101
102/* additional properties */
103#define BE_LB_PROP_DYN 0x80000 /* bit to indicate a dynamic algorithm */
104
Willy Tarreau6b2e11b2009-10-01 07:52:15 +0200105/* hash types */
106#define BE_LB_HASH_MAP 0x000000 /* map-based hash (default) */
107#define BE_LB_HASH_CONS 0x100000 /* consistent hashbit to indicate a dynamic algorithm */
Willy Tarreau798a39c2010-11-24 15:04:29 +0100108#define BE_LB_HASH_AVAL 0x200000 /* run an avalanche hash before a map */
109#define BE_LB_HASH_TYPE 0x300000 /* get/clear hash types */
Willy Tarreaub625a082007-11-26 01:15:43 +0100110
Bhaskar98634f02013-10-29 23:30:51 -0400111/* BE_LB_HFCN_* is the hash function, to be used with BE_LB_HASH_FUNC */
112#define BE_LB_HFCN_SDBM 0x000000 /* sdbm hash */
113#define BE_LB_HFCN_DJB2 0x400000 /* djb2 hash */
114#define BE_LB_HASH_FUNC 0xC00000 /* get/clear hash function */
115
116
Willy Tarreaub625a082007-11-26 01:15:43 +0100117/* various constants */
Willy Tarreaub698f0f2007-12-02 11:01:23 +0100118
matt.farnsworth@nokia.com1c2ab962008-04-14 20:47:37 +0200119/* The scale factor between user weight and effective weight allows smooth
Willy Tarreaub698f0f2007-12-02 11:01:23 +0100120 * weight modulation even with small weights (eg: 1). It should not be too high
121 * though because it limits the number of servers in FWRR mode in order to
122 * prevent any integer overflow. The max number of servers per backend is
Godbacha34bdc02013-07-22 07:44:53 +0800123 * limited to about (2^32-1)/256^2/scale ~= 65535.9999/scale. A scale of 16
124 * looks like a good value, as it allows 4095 servers per backend while leaving
Willy Tarreaub698f0f2007-12-02 11:01:23 +0100125 * modulation steps of about 6% for servers with the lowest weight (1).
126 */
127#define BE_WEIGHT_SCALE 16
Willy Tarreaub625a082007-11-26 01:15:43 +0100128
Willy Tarreau5b4c2b52009-10-03 11:21:53 +0200129/* LB parameters for all algorithms */
130struct lbprm {
Willy Tarreauf3e49f92009-10-03 12:21:20 +0200131 int algo; /* load balancing algorithm and variants: BE_LB_* */
Willy Tarreau5b4c2b52009-10-03 11:21:53 +0200132 int tot_wact, tot_wbck; /* total effective weights of active and backup servers */
133 int tot_weight; /* total effective weight of servers participating to LB */
134 int tot_used; /* total number of servers used for LB */
135 int wmult; /* ratio between user weight and effective weight */
136 int wdiv; /* ratio between effective weight and user weight */
137 struct server *fbck; /* first backup server when !PR_O_USE_ALL_BK, or NULL */
138 struct lb_map map; /* LB parameters for map-based algorithms */
139 struct lb_fwrr fwrr;
140 struct lb_fwlc fwlc;
Willy Tarreau6b2e11b2009-10-01 07:52:15 +0200141 struct lb_chash chash;
Willy Tarreauf09c6602012-02-13 17:12:08 +0100142 struct lb_fas fas;
Willy Tarreau9580d162012-05-19 19:07:40 +0200143 /* Call backs for some actions. Any of them may be NULL (thus should be ignored). */
Willy Tarreau5b4c2b52009-10-03 11:21:53 +0200144 void (*update_server_eweight)(struct server *); /* to be called after eweight change */
145 void (*set_server_status_up)(struct server *); /* to be called after status changes to UP */
146 void (*set_server_status_down)(struct server *); /* to be called after status changes to DOWN */
147 void (*server_take_conn)(struct server *); /* to be called when connection is assigned */
148 void (*server_drop_conn)(struct server *); /* to be called when connection is dropped */
149};
150
Willy Tarreaubaaee002006-06-26 02:48:02 +0200151#endif /* _TYPES_BACKEND_H */
152
153/*
154 * Local variables:
155 * c-indent-level: 8
156 * c-basic-offset: 8
157 * End:
158 */