blob: 6b73a3954234125a8c047499fe7af16a4cd5ff9e [file] [log] [blame]
Willy Tarreaubaaee002006-06-26 02:48:02 +02001/*
Willy Tarreau5ab04ec2011-03-20 10:32:26 +01002 * include/types/server.h
3 * This file defines everything related to servers.
4 *
Willy Tarreauf09c6602012-02-13 17:12:08 +01005 * Copyright (C) 2000-2012 Willy Tarreau - w@1wt.eu
Willy Tarreau5ab04ec2011-03-20 10:32:26 +01006 *
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_SERVER_H
23#define _TYPES_SERVER_H
24
25#include <netinet/in.h>
26#include <arpa/inet.h>
27
Emeric Brunc6545ac2012-05-18 15:46:21 +020028#ifdef USE_OPENSSL
29#include <openssl/ssl.h>
30#endif
31
Willy Tarreaue3ba5f02006-06-29 18:54:54 +020032#include <common/config.h>
Willy Tarreau2dd0d472006-06-29 17:53:05 +020033#include <common/mini-clist.h>
Willy Tarreau45cb4fb2009-10-26 21:10:04 +010034#include <eb32tree.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020035
Willy Tarreauda92e2f2012-07-06 09:40:59 +020036#include <types/connection.h>
Krzysztof Piotr Oledzki052d4fd2009-10-04 14:52:57 +020037#include <types/counters.h>
Willy Tarreau7f062c42009-03-05 18:43:00 +010038#include <types/freq_ctr.h>
Willy Tarreau3fdb3662012-11-12 00:42:33 +010039#include <types/obj_type.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020040#include <types/proxy.h>
41#include <types/queue.h>
42#include <types/task.h>
Krzysztof Piotr Oledzki09605412009-09-23 22:09:24 +020043#include <types/checks.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +020044
45
46/* server flags */
Willy Tarreau77074d52006-11-12 23:57:19 +010047#define SRV_RUNNING 0x0001 /* the server is UP */
48#define SRV_BACKUP 0x0002 /* this server is a backup server */
49#define SRV_MAPPORTS 0x0004 /* this server uses mapped ports */
Willy Tarreauef9a3602012-12-08 22:29:20 +010050/* unused: 0x0008 */
Willy Tarreau77074d52006-11-12 23:57:19 +010051#define SRV_CHECKED 0x0010 /* this server needs to be checked */
Willy Tarreau48494c02007-11-30 10:41:39 +010052#define SRV_GOINGDOWN 0x0020 /* this server says that it's going down (404) */
Willy Tarreau9909fc12007-11-30 17:42:05 +010053#define SRV_WARMINGUP 0x0040 /* this server is warming up after a failure */
Cyril Bontécd19e512010-01-31 22:34:03 +010054#define SRV_MAINTAIN 0x0080 /* this server is in maintenance mode */
Simon Horman8c3d0be2013-11-25 10:46:40 +090055#define SRV_DRAIN 0x0100 /* this server has been requested to drain its connections */
56/* unused: 0x0200, 0x0400 */
Willy Tarreau5ab04ec2011-03-20 10:32:26 +010057#define SRV_SEND_PROXY 0x0800 /* this server talks the PROXY protocol */
Simon Hormanfa461682011-06-25 09:39:49 +090058#define SRV_NON_STICK 0x1000 /* never add connections allocated to this server to a stick table */
Simon Hormand60d6912013-11-25 10:46:36 +090059#define SRV_AGENT_CHECKED 0x2000 /* this server needs to be checked using an agent check.
60 * This is run independently of the main check whose
61 * presence is indicated by the SRV_CHECKED flag */
Willy Tarreaubaaee002006-06-26 02:48:02 +020062
63/* function which act on servers need to return various errors */
64#define SRV_STATUS_OK 0 /* everything is OK. */
65#define SRV_STATUS_INTERNAL 1 /* other unrecoverable errors. */
66#define SRV_STATUS_NOSRV 2 /* no server is available */
67#define SRV_STATUS_FULL 3 /* the/all server(s) are saturated */
68#define SRV_STATUS_QUEUED 4 /* the/all server(s) are saturated but the connection was queued */
69
Willy Tarreauc7dd71a2007-11-30 08:33:21 +010070/* bits for s->result used for health-checks */
71#define SRV_CHK_UNKNOWN 0x0000 /* initialized to this by default */
Willy Tarreaud3aac702012-11-23 11:32:12 +010072#define SRV_CHK_FAILED 0x0001 /* server check failed, flag has precedence over SRV_CHK_PASSED */
73#define SRV_CHK_PASSED 0x0002 /* server check succeeded unless FAILED is also set */
Willy Tarreauc7dd71a2007-11-30 08:33:21 +010074#define SRV_CHK_DISABLE 0x0004 /* server returned a "disable" code */
Willy Tarreaubaaee002006-06-26 02:48:02 +020075
Simon Hormancd5d7b62013-02-24 17:23:38 +090076/* check flags */
77#define CHK_STATE_RUNNING 0x0001 /* this check is currently running */
Simon Horman671b6f02013-11-25 10:46:39 +090078#define CHK_STATE_DISABLED 0x0002 /* this check is currently administratively disabled */
Simon Hormancd5d7b62013-02-24 17:23:38 +090079
Willy Tarreaub698f0f2007-12-02 11:01:23 +010080/* various constants */
81#define SRV_UWGHT_RANGE 256
Godbacha34bdc02013-07-22 07:44:53 +080082#define SRV_UWGHT_MAX (SRV_UWGHT_RANGE)
Willy Tarreaub698f0f2007-12-02 11:01:23 +010083#define SRV_EWGHT_RANGE (SRV_UWGHT_RANGE * BE_WEIGHT_SCALE)
84#define SRV_EWGHT_MAX (SRV_UWGHT_MAX * BE_WEIGHT_SCALE)
85
Emeric Brun89675492012-10-05 13:48:26 +020086#ifdef USE_OPENSSL
87/* server ssl options */
88#define SRV_SSL_O_NONE 0x0000
Emeric Brun992adc92012-10-11 18:36:21 +020089#define SRV_SSL_O_NO_VMASK 0x000F /* force version mask */
Emeric Brun89675492012-10-05 13:48:26 +020090#define SRV_SSL_O_NO_SSLV3 0x0001 /* disable SSLv3 */
91#define SRV_SSL_O_NO_TLSV10 0x0002 /* disable TLSv1.0 */
92#define SRV_SSL_O_NO_TLSV11 0x0004 /* disable TLSv1.1 */
93#define SRV_SSL_O_NO_TLSV12 0x0008 /* disable TLSv1.2 */
94/* 0x000F reserved for 'no' protocol version options */
Emeric Brun992adc92012-10-11 18:36:21 +020095#define SRV_SSL_O_USE_VMASK 0x00F0 /* force version mask */
96#define SRV_SSL_O_USE_SSLV3 0x0010 /* force SSLv3 */
97#define SRV_SSL_O_USE_TLSV10 0x0020 /* force TLSv1.0 */
98#define SRV_SSL_O_USE_TLSV11 0x0040 /* force TLSv1.1 */
99#define SRV_SSL_O_USE_TLSV12 0x0080 /* force TLSv1.2 */
Emeric Brun8694b9a2012-10-05 14:39:07 +0200100/* 0x00F0 reserved for 'force' protocol version options */
Emeric Brunf9c5c472012-10-11 15:28:34 +0200101#define SRV_SSL_O_NO_TLS_TICKETS 0x0100 /* disable session resumption tickets */
Emeric Brun89675492012-10-05 13:48:26 +0200102#endif
103
Willy Tarreau6b2e11b2009-10-01 07:52:15 +0200104/* A tree occurrence is a descriptor of a place in a tree, with a pointer back
105 * to the server itself.
106 */
107struct server;
108struct tree_occ {
109 struct server *server;
110 struct eb32_node node;
111};
112
Simon Horman66183002013-02-23 10:16:43 +0900113struct check {
114 struct connection *conn; /* connection state for health checks */
115
116 short port; /* the port to use for the health checks */
117 struct buffer *bi, *bo; /* input and output buffers to send/recv check */
118 struct task *task; /* the task associated to the health check processing, NULL if disabled */
119 struct timeval start; /* last health check start time */
120 long duration; /* time in ms took to finish last health check */
121 short status, code; /* check result, check code */
122 char desc[HCHK_DESC_LEN]; /* health check descritpion */
123 int use_ssl; /* use SSL for health checks */
124 int send_proxy; /* send a PROXY protocol header with checks */
125 int inter, fastinter, downinter; /* checks: time in milliseconds */
Simon Horman28b5ffc2013-02-24 07:25:29 +0900126 int result; /* health-check result : SRV_CHK_* */
Simon Hormancd5d7b62013-02-24 17:23:38 +0900127 int state; /* health-check result : CHK_* */
Simon Horman58c32972013-11-25 10:46:38 +0900128 int health; /* 0 to rise-1 = bad;
129 * rise to rise+fall-1 = good */
130 int rise, fall; /* time in iterations */
Simon Horman4a741432013-02-23 15:35:38 +0900131 int type; /* Check type, one of PR_O2_*_CHK */
Simon Horman66183002013-02-23 10:16:43 +0900132 struct server *server; /* back-pointer to server */
133};
134
Willy Tarreaubaaee002006-06-26 02:48:02 +0200135struct server {
Willy Tarreau3fdb3662012-11-12 00:42:33 +0100136 enum obj_type obj_type; /* object type == OBJ_TYPE_SERVER */
Willy Tarreaubaaee002006-06-26 02:48:02 +0200137 struct server *next;
138 int state; /* server state (SRV_*) */
Willy Tarreaub625a082007-11-26 01:15:43 +0100139 int prev_state; /* server state before last change (SRV_*) */
Krzysztof Piotr Oledzki09605412009-09-23 22:09:24 +0200140 int cklen; /* the len of the cookie, to speed up checks */
Willy Tarreau21d2af32008-02-14 20:25:24 +0100141 int rdr_len; /* the length of the redirection prefix */
Willy Tarreau91b6f322007-03-25 21:03:01 +0200142 char *cookie; /* the id set in the cookie */
Willy Tarreau21d2af32008-02-14 20:25:24 +0100143 char *rdr_pfx; /* the redirection prefix */
Willy Tarreau91b6f322007-03-25 21:03:01 +0200144
145 struct proxy *proxy; /* the proxy this server belongs to */
Willy Tarreau7c669d72008-06-20 15:04:11 +0200146 int served; /* # of active sessions currently being served (ie not pending) */
Willy Tarreauac68c5d2009-10-04 23:12:44 +0200147 int cur_sess; /* number of currently active sessions (including syn_sent) */
Willy Tarreau91b6f322007-03-25 21:03:01 +0200148 unsigned maxconn, minconn; /* max # of active sessions (0 = unlimited), min# for dynamic limit. */
Willy Tarreauac68c5d2009-10-04 23:12:44 +0200149 int nbpend; /* number of pending connections */
Elijah Epifanovacafc5f2007-10-25 20:15:38 +0200150 int maxqueue; /* maximum number of pending connections allowed */
Willy Tarreau7b815632011-10-21 18:51:57 +0200151 struct freq_ctr sess_per_sec; /* sessions per second on this server */
Willy Tarreauac68c5d2009-10-04 23:12:44 +0200152 struct srvcounters counters; /* statistics counters */
153
Willy Tarreau91b6f322007-03-25 21:03:01 +0200154 struct list pendconns; /* pending connections */
Simon Hormanaf514952011-06-21 14:34:57 +0900155 struct list actconns; /* active connections */
Willy Tarreau2e993902011-10-31 11:53:20 +0100156 struct task *warmup; /* the task dedicated to the warmup when slowstart is set */
Willy Tarreau91b6f322007-03-25 21:03:01 +0200157
Willy Tarreauef9a3602012-12-08 22:29:20 +0100158 struct conn_src conn_src; /* connection source settings */
Willy Tarreau91b6f322007-03-25 21:03:01 +0200159
Willy Tarreau44267702011-10-28 15:35:33 +0200160 struct server *tracknext, *track; /* next server in a tracking list, tracked server */
Krzysztof Piotr Oledzkic8b16fc2008-02-18 01:26:35 +0100161 char *trackit; /* temporary variable to make assignment deferrable */
Krzysztof Piotr Oledzki97f07b82009-12-15 22:31:24 +0100162 int consecutive_errors; /* current number of consecutive errors */
Krzysztof Piotr Oledzki97f07b82009-12-15 22:31:24 +0100163 int consecutive_errors_limit; /* number of consecutive errors that triggers an event */
164 short observe, onerror; /* observing mode: one of HANA_OBS_*; what to do on error: on of ANA_ONERR_* */
Justin Karnegeseb2c24a2012-05-24 15:28:52 -0700165 short onmarkeddown; /* what to do when marked down: one of HANA_ONMARKEDDOWN_* */
166 short onmarkedup; /* what to do when marked up: one of HANA_ONMARKEDUP_* */
Willy Tarreau9909fc12007-11-30 17:42:05 +0100167 int slowstart; /* slowstart time in seconds (ms in the conf) */
Willy Tarreau91b6f322007-03-25 21:03:01 +0200168
169 char *id; /* just for identification */
Willy Tarreau975c50b2009-10-10 19:34:06 +0200170 unsigned iweight,uweight, eweight; /* initial weight, user-specified weight, and effective weight */
Willy Tarreau417fae02007-03-25 21:16:40 +0200171 unsigned wscore; /* weight score, used during srv map computation */
Willy Tarreaub625a082007-11-26 01:15:43 +0100172 unsigned prev_eweight; /* eweight before last change */
173 unsigned rweight; /* remainer of weight in the current LB tree */
174 unsigned npos, lpos; /* next and last positions in the LB tree */
175 struct eb32_node lb_node; /* node used for tree-based load balancing */
176 struct eb_root *lb_tree; /* we want to know in what tree the server is */
177 struct server *next_full; /* next server in the temporary full list */
Willy Tarreau6b2e11b2009-10-01 07:52:15 +0200178 unsigned lb_nodes_tot; /* number of allocated lb_nodes (C-HASH) */
179 unsigned lb_nodes_now; /* number of lb_nodes placed in the tree (C-HASH) */
180 struct tree_occ *lb_nodes; /* lb_nodes_tot * struct tree_occ */
Willy Tarreau91b6f322007-03-25 21:03:01 +0200181
Willy Tarreau7b815632011-10-21 18:51:57 +0200182 /* warning, these structs are huge, keep them at the bottom */
183 struct sockaddr_storage addr; /* the address to connect to */
Willy Tarreau26d8c592012-05-07 18:12:14 +0200184 struct protocol *proto; /* server address protocol */
Willy Tarreauf7bc57c2012-10-03 00:19:48 +0200185 struct xprt_ops *xprt; /* transport-layer operations */
Krzysztof Oledzki85130942007-10-22 16:21:10 +0200186 unsigned down_time; /* total time the server was down */
187 time_t last_change; /* last time, when the state was changed */
188
Willy Tarreauf09c6602012-02-13 17:12:08 +0100189 int puid; /* proxy-unique server ID, used for SNMP, and "first" LB algo */
Krzysztof Piotr Oledzki052d4fd2009-10-04 14:52:57 +0200190
Simon Horman66183002013-02-23 10:16:43 +0900191 struct { /* configuration used by health-check and agent-check */
Willy Tarreauf4288ee2012-09-28 18:13:10 +0200192 struct protocol *proto; /* server address protocol for health checks */
193 struct xprt_ops *xprt; /* transport layer operations for health checks */
Willy Tarreau5b3a2022012-09-28 15:01:02 +0200194 struct sockaddr_storage addr; /* the address to check, if different from <addr> */
Simon Horman66183002013-02-23 10:16:43 +0900195 } check_common;
196
197 struct check check; /* health-check specific configuration */
Simon Hormand60d6912013-11-25 10:46:36 +0900198 struct check agent; /* agent specific configuration */
Nick Chalk57b1bf72010-03-16 15:50:46 +0000199
Emeric Brunc6545ac2012-05-18 15:46:21 +0200200#ifdef USE_OPENSSL
Emeric Brun01f8e2f2012-05-18 16:02:00 +0200201 int use_ssl; /* ssl enabled */
Emeric Brunc6545ac2012-05-18 15:46:21 +0200202 struct {
203 SSL_CTX *ctx;
204 SSL_SESSION *reused_sess;
Willy Tarreaud7aacbf2012-09-03 23:34:19 +0200205 char *ciphers; /* cipher suite to use if non-null */
Emeric Brun89675492012-10-05 13:48:26 +0200206 int options; /* ssl options */
Emeric Brunef42d922012-10-11 16:11:36 +0200207 int verify; /* verify method (set of SSL_VERIFY_* flags) */
Evan Broderbe554312013-06-27 00:05:25 -0700208 char *verify_host; /* hostname of certificate must match this host */
Emeric Brunef42d922012-10-11 16:11:36 +0200209 char *ca_file; /* CAfile to use on verify */
210 char *crl_file; /* CRLfile to use on verify */
Emeric Bruna7aa3092012-10-26 12:58:00 +0200211 char *client_crt; /* client certificate to send */
Emeric Brunc6545ac2012-05-18 15:46:21 +0200212 } ssl_ctx;
213#endif
Willy Tarreau90a570f2009-10-04 20:54:54 +0200214 struct {
215 const char *file; /* file where the section appears */
216 int line; /* line where the section appears */
Willy Tarreau53fb4ae2009-10-04 23:04:08 +0200217 struct eb32_node id; /* place in the tree of used IDs */
Willy Tarreau90a570f2009-10-04 20:54:54 +0200218 } conf; /* config information */
Willy Tarreaubaaee002006-06-26 02:48:02 +0200219};
220
Willy Tarreau21faa912012-10-10 08:27:36 +0200221/* Descriptor for a "server" keyword. The ->parse() function returns 0 in case of
222 * success, or a combination of ERR_* flags if an error is encountered. The
223 * function pointer can be NULL if not implemented. The function also has an
224 * access to the current "server" config line. The ->skip value tells the parser
225 * how many words have to be skipped after the keyword. If the function needs to
226 * parse more keywords, it needs to update cur_arg.
227 */
228struct srv_kw {
229 const char *kw;
230 int (*parse)(char **args, int *cur_arg, struct proxy *px, struct server *srv, char **err);
231 int skip; /* nb min of args to skip, for use when kw is not handled */
232 int default_ok; /* non-zero if kw is supported in default-server section */
233};
234
235/*
236 * A keyword list. It is a NULL-terminated array of keywords. It embeds a
237 * struct list in order to be linked to other lists, allowing it to easily
238 * be declared where it is needed, and linked without duplicating data nor
239 * allocating memory. It is also possible to indicate a scope for the keywords.
240 */
241struct srv_kw_list {
242 const char *scope;
243 struct list list;
244 struct srv_kw kw[VAR_ARRAY];
245};
Willy Tarreaubaaee002006-06-26 02:48:02 +0200246
247#endif /* _TYPES_SERVER_H */
248
249/*
250 * Local variables:
251 * c-indent-level: 8
252 * c-basic-offset: 8
253 * End:
254 */