blob: 130c370f7a0230fcb8ad8db0f18481acb4770195 [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
Godbachf2dd68d2014-12-10 10:21:30 +080046/* server states. Only SRV_ST_STOPPED indicates a down server. */
Willy Tarreauc93cd162014-05-13 15:54:22 +020047enum srv_state {
Willy Tarreau892337c2014-05-13 23:41:20 +020048 SRV_ST_STOPPED = 0, /* the server is down. Please keep set to zero. */
49 SRV_ST_STARTING, /* the server is warming up (up but throttled) */
50 SRV_ST_RUNNING, /* the server is fully up */
51 SRV_ST_STOPPING, /* the server is up but soft-stopping (eg: 404) */
Willy Tarreauc93cd162014-05-13 15:54:22 +020052};
53
Willy Tarreaubfc7b7a2014-05-22 16:14:34 +020054/* Administrative status : a server runs in one of these 3 stats :
55 * - READY : normal mode
56 * - DRAIN : takes no new visitor, equivalent to weight == 0
57 * - MAINT : maintenance mode, no more traffic nor health checks.
58 *
59 * Each server may be in maintenance by itself or may inherit this status from
60 * another server it tracks. It can also be in drain mode by itself or inherit
61 * it from another server. Let's store these origins here as flags. These flags
62 * are combined this way :
63 *
64 * FMAINT IMAINT FDRAIN IDRAIN Resulting state
65 * 0 0 0 0 READY
66 * 0 0 0 1 DRAIN
67 * 0 0 1 x DRAIN
68 * 0 1 x x MAINT
69 * 1 x x x MAINT
70 *
71 * This can be simplified this way :
72 *
73 * state_str = (state & MAINT) ? "MAINT" : (state & DRAIN) : "DRAIN" : "READY"
Willy Tarreau20125212014-05-13 19:44:56 +020074 */
75enum srv_admin {
76 SRV_ADMF_FMAINT = 0x1, /* the server was explicitly forced into maintenance */
77 SRV_ADMF_IMAINT = 0x2, /* the server has inherited the maintenance status from a tracked server */
78 SRV_ADMF_MAINT = 0x3, /* mask to check if any maintenance flag is present */
Willy Tarreaubfc7b7a2014-05-22 16:14:34 +020079 SRV_ADMF_FDRAIN = 0x4, /* the server was explicitly forced into drain state */
80 SRV_ADMF_IDRAIN = 0x8, /* the server has inherited the drain status from a tracked server */
81 SRV_ADMF_DRAIN = 0xC, /* mask to check if any drain flag is present */
Willy Tarreau20125212014-05-13 19:44:56 +020082};
83
Willy Tarreaubaaee002006-06-26 02:48:02 +020084/* server flags */
Willy Tarreauc93cd162014-05-13 15:54:22 +020085#define SRV_F_BACKUP 0x0001 /* this server is a backup server */
86#define SRV_F_MAPPORTS 0x0002 /* this server uses mapped ports */
87#define SRV_F_NON_STICK 0x0004 /* never add connections allocated to this server to a stick table */
KOVACS Krisztianb3e54fe2014-11-17 15:11:45 +010088#define SRV_F_USE_NS_FROM_PP 0x0008 /* use namespace associated with connection if present */
Baptiste Assmann7cc419a2015-07-07 22:02:20 +020089#define SRV_F_FORCED_ID 0x0010 /* server's ID was forced in the configuration */
Willy Tarreaubaaee002006-06-26 02:48:02 +020090
David Safb76832014-05-08 23:42:08 -040091/* configured server options for send-proxy (server->pp_opts) */
92#define SRV_PP_V1 0x0001 /* proxy protocol version 1 */
93#define SRV_PP_V2 0x0002 /* proxy protocol version 2 */
94#define SRV_PP_V2_SSL 0x0004 /* proxy protocol version 2 with SSL*/
95#define SRV_PP_V2_SSL_CN 0x0008 /* proxy protocol version 2 with SSL and CN*/
96
Willy Tarreaubaaee002006-06-26 02:48:02 +020097/* function which act on servers need to return various errors */
98#define SRV_STATUS_OK 0 /* everything is OK. */
99#define SRV_STATUS_INTERNAL 1 /* other unrecoverable errors. */
100#define SRV_STATUS_NOSRV 2 /* no server is available */
101#define SRV_STATUS_FULL 3 /* the/all server(s) are saturated */
102#define SRV_STATUS_QUEUED 4 /* the/all server(s) are saturated but the connection was queued */
103
Willy Tarreaub698f0f2007-12-02 11:01:23 +0100104/* various constants */
105#define SRV_UWGHT_RANGE 256
Godbacha34bdc02013-07-22 07:44:53 +0800106#define SRV_UWGHT_MAX (SRV_UWGHT_RANGE)
Willy Tarreaub698f0f2007-12-02 11:01:23 +0100107#define SRV_EWGHT_RANGE (SRV_UWGHT_RANGE * BE_WEIGHT_SCALE)
108#define SRV_EWGHT_MAX (SRV_UWGHT_MAX * BE_WEIGHT_SCALE)
109
Emeric Brun89675492012-10-05 13:48:26 +0200110#ifdef USE_OPENSSL
111/* server ssl options */
112#define SRV_SSL_O_NONE 0x0000
Emeric Brun992adc92012-10-11 18:36:21 +0200113#define SRV_SSL_O_NO_VMASK 0x000F /* force version mask */
Emeric Brun89675492012-10-05 13:48:26 +0200114#define SRV_SSL_O_NO_SSLV3 0x0001 /* disable SSLv3 */
115#define SRV_SSL_O_NO_TLSV10 0x0002 /* disable TLSv1.0 */
116#define SRV_SSL_O_NO_TLSV11 0x0004 /* disable TLSv1.1 */
117#define SRV_SSL_O_NO_TLSV12 0x0008 /* disable TLSv1.2 */
118/* 0x000F reserved for 'no' protocol version options */
Emeric Brun992adc92012-10-11 18:36:21 +0200119#define SRV_SSL_O_USE_VMASK 0x00F0 /* force version mask */
120#define SRV_SSL_O_USE_SSLV3 0x0010 /* force SSLv3 */
121#define SRV_SSL_O_USE_TLSV10 0x0020 /* force TLSv1.0 */
122#define SRV_SSL_O_USE_TLSV11 0x0040 /* force TLSv1.1 */
123#define SRV_SSL_O_USE_TLSV12 0x0080 /* force TLSv1.2 */
Emeric Brun8694b9a2012-10-05 14:39:07 +0200124/* 0x00F0 reserved for 'force' protocol version options */
Emeric Brunf9c5c472012-10-11 15:28:34 +0200125#define SRV_SSL_O_NO_TLS_TICKETS 0x0100 /* disable session resumption tickets */
Willy Tarreau2a3fb1c2015-02-05 16:47:07 +0100126#define SRV_SSL_O_NO_REUSE 0x200 /* disable session reuse */
Emeric Brun89675492012-10-05 13:48:26 +0200127#endif
128
Simon Horman98637e52014-06-20 12:30:16 +0900129struct pid_list {
130 struct list list;
131 pid_t pid;
132 struct task *t;
133 int status;
134 int exited;
135};
136
Willy Tarreau6b2e11b2009-10-01 07:52:15 +0200137/* A tree occurrence is a descriptor of a place in a tree, with a pointer back
138 * to the server itself.
139 */
140struct server;
141struct tree_occ {
142 struct server *server;
143 struct eb32_node node;
144};
145
Willy Tarreaubaaee002006-06-26 02:48:02 +0200146struct server {
Willy Tarreau3fdb3662012-11-12 00:42:33 +0100147 enum obj_type obj_type; /* object type == OBJ_TYPE_SERVER */
Willy Tarreau892337c2014-05-13 23:41:20 +0200148 enum srv_state state, prev_state; /* server state among SRV_ST_* */
Willy Tarreau20125212014-05-13 19:44:56 +0200149 enum srv_admin admin, prev_admin; /* server maintenance status : SRV_ADMF_* */
Willy Tarreauc93cd162014-05-13 15:54:22 +0200150 unsigned char flags; /* server flags (SRV_F_*) */
Willy Tarreaubaaee002006-06-26 02:48:02 +0200151 struct server *next;
Krzysztof Piotr Oledzki09605412009-09-23 22:09:24 +0200152 int cklen; /* the len of the cookie, to speed up checks */
Willy Tarreau21d2af32008-02-14 20:25:24 +0100153 int rdr_len; /* the length of the redirection prefix */
Willy Tarreau91b6f322007-03-25 21:03:01 +0200154 char *cookie; /* the id set in the cookie */
Willy Tarreau21d2af32008-02-14 20:25:24 +0100155 char *rdr_pfx; /* the redirection prefix */
David Safb76832014-05-08 23:42:08 -0400156 int pp_opts; /* proxy protocol options (SRV_PP_*) */
Willy Tarreau91b6f322007-03-25 21:03:01 +0200157
158 struct proxy *proxy; /* the proxy this server belongs to */
Willy Tarreau7c669d72008-06-20 15:04:11 +0200159 int served; /* # of active sessions currently being served (ie not pending) */
Willy Tarreauac68c5d2009-10-04 23:12:44 +0200160 int cur_sess; /* number of currently active sessions (including syn_sent) */
Willy Tarreau91b6f322007-03-25 21:03:01 +0200161 unsigned maxconn, minconn; /* max # of active sessions (0 = unlimited), min# for dynamic limit. */
Willy Tarreauac68c5d2009-10-04 23:12:44 +0200162 int nbpend; /* number of pending connections */
Elijah Epifanovacafc5f2007-10-25 20:15:38 +0200163 int maxqueue; /* maximum number of pending connections allowed */
Willy Tarreau7b815632011-10-21 18:51:57 +0200164 struct freq_ctr sess_per_sec; /* sessions per second on this server */
Willy Tarreauac68c5d2009-10-04 23:12:44 +0200165 struct srvcounters counters; /* statistics counters */
166
Willy Tarreau91b6f322007-03-25 21:03:01 +0200167 struct list pendconns; /* pending connections */
Simon Hormanaf514952011-06-21 14:34:57 +0900168 struct list actconns; /* active connections */
Willy Tarreau2e993902011-10-31 11:53:20 +0100169 struct task *warmup; /* the task dedicated to the warmup when slowstart is set */
Willy Tarreau91b6f322007-03-25 21:03:01 +0200170
Willy Tarreauef9a3602012-12-08 22:29:20 +0100171 struct conn_src conn_src; /* connection source settings */
Willy Tarreau91b6f322007-03-25 21:03:01 +0200172
Willy Tarreau1a53a3a2013-12-11 15:27:05 +0100173 struct server *track; /* the server we're currently tracking, if any */
174 struct server *trackers; /* the list of servers tracking us, if any */
175 struct server *tracknext; /* next server tracking <track> in <track>'s trackers list */
Krzysztof Piotr Oledzkic8b16fc2008-02-18 01:26:35 +0100176 char *trackit; /* temporary variable to make assignment deferrable */
Krzysztof Piotr Oledzki97f07b82009-12-15 22:31:24 +0100177 int consecutive_errors; /* current number of consecutive errors */
Krzysztof Piotr Oledzki97f07b82009-12-15 22:31:24 +0100178 int consecutive_errors_limit; /* number of consecutive errors that triggers an event */
179 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 -0700180 short onmarkeddown; /* what to do when marked down: one of HANA_ONMARKEDDOWN_* */
181 short onmarkedup; /* what to do when marked up: one of HANA_ONMARKEDUP_* */
Willy Tarreau9909fc12007-11-30 17:42:05 +0100182 int slowstart; /* slowstart time in seconds (ms in the conf) */
Willy Tarreau91b6f322007-03-25 21:03:01 +0200183
184 char *id; /* just for identification */
Willy Tarreau975c50b2009-10-10 19:34:06 +0200185 unsigned iweight,uweight, eweight; /* initial weight, user-specified weight, and effective weight */
Willy Tarreau417fae02007-03-25 21:16:40 +0200186 unsigned wscore; /* weight score, used during srv map computation */
Willy Tarreaub625a082007-11-26 01:15:43 +0100187 unsigned prev_eweight; /* eweight before last change */
188 unsigned rweight; /* remainer of weight in the current LB tree */
189 unsigned npos, lpos; /* next and last positions in the LB tree */
190 struct eb32_node lb_node; /* node used for tree-based load balancing */
191 struct eb_root *lb_tree; /* we want to know in what tree the server is */
192 struct server *next_full; /* next server in the temporary full list */
Willy Tarreau6b2e11b2009-10-01 07:52:15 +0200193 unsigned lb_nodes_tot; /* number of allocated lb_nodes (C-HASH) */
194 unsigned lb_nodes_now; /* number of lb_nodes placed in the tree (C-HASH) */
195 struct tree_occ *lb_nodes; /* lb_nodes_tot * struct tree_occ */
Willy Tarreau91b6f322007-03-25 21:03:01 +0200196
KOVACS Krisztianb3e54fe2014-11-17 15:11:45 +0100197 const struct netns_entry *netns; /* contains network namespace name or NULL. Network namespace comes from configuration */
Willy Tarreau7b815632011-10-21 18:51:57 +0200198 /* warning, these structs are huge, keep them at the bottom */
199 struct sockaddr_storage addr; /* the address to connect to */
Willy Tarreauf7bc57c2012-10-03 00:19:48 +0200200 struct xprt_ops *xprt; /* transport-layer operations */
Krzysztof Oledzki85130942007-10-22 16:21:10 +0200201 unsigned down_time; /* total time the server was down */
202 time_t last_change; /* last time, when the state was changed */
203
Willy Tarreauf09c6602012-02-13 17:12:08 +0100204 int puid; /* proxy-unique server ID, used for SNMP, and "first" LB algo */
Krzysztof Piotr Oledzki052d4fd2009-10-04 14:52:57 +0200205
Simon Horman66183002013-02-23 10:16:43 +0900206 struct check check; /* health-check specific configuration */
Simon Hormand60d6912013-11-25 10:46:36 +0900207 struct check agent; /* agent specific configuration */
Nick Chalk57b1bf72010-03-16 15:50:46 +0000208
Baptiste Assmanna68ca962015-04-14 01:15:08 +0200209 char *resolvers_id; /* resolvers section used by this server */
210 char *hostname; /* server hostname */
211 struct dns_resolution *resolution; /* server name resolution */
212 int resolver_family_priority; /* which IP family should the resolver use when both are returned */
213
Emeric Brunc6545ac2012-05-18 15:46:21 +0200214#ifdef USE_OPENSSL
Emeric Brun01f8e2f2012-05-18 16:02:00 +0200215 int use_ssl; /* ssl enabled */
Emeric Brunc6545ac2012-05-18 15:46:21 +0200216 struct {
217 SSL_CTX *ctx;
218 SSL_SESSION *reused_sess;
Willy Tarreaud7aacbf2012-09-03 23:34:19 +0200219 char *ciphers; /* cipher suite to use if non-null */
Emeric Brun89675492012-10-05 13:48:26 +0200220 int options; /* ssl options */
Emeric Brunef42d922012-10-11 16:11:36 +0200221 int verify; /* verify method (set of SSL_VERIFY_* flags) */
Evan Broderbe554312013-06-27 00:05:25 -0700222 char *verify_host; /* hostname of certificate must match this host */
Emeric Brunef42d922012-10-11 16:11:36 +0200223 char *ca_file; /* CAfile to use on verify */
224 char *crl_file; /* CRLfile to use on verify */
Emeric Bruna7aa3092012-10-26 12:58:00 +0200225 char *client_crt; /* client certificate to send */
Willy Tarreau732eac42015-07-09 11:40:25 +0200226 struct sample_expr *sni; /* sample expression for SNI */
Emeric Brunc6545ac2012-05-18 15:46:21 +0200227 } ssl_ctx;
228#endif
Willy Tarreau90a570f2009-10-04 20:54:54 +0200229 struct {
230 const char *file; /* file where the section appears */
231 int line; /* line where the section appears */
Willy Tarreau53fb4ae2009-10-04 23:04:08 +0200232 struct eb32_node id; /* place in the tree of used IDs */
Willy Tarreau90a570f2009-10-04 20:54:54 +0200233 } conf; /* config information */
Willy Tarreaubaaee002006-06-26 02:48:02 +0200234};
235
Willy Tarreau21faa912012-10-10 08:27:36 +0200236/* Descriptor for a "server" keyword. The ->parse() function returns 0 in case of
237 * success, or a combination of ERR_* flags if an error is encountered. The
238 * function pointer can be NULL if not implemented. The function also has an
239 * access to the current "server" config line. The ->skip value tells the parser
240 * how many words have to be skipped after the keyword. If the function needs to
241 * parse more keywords, it needs to update cur_arg.
242 */
243struct srv_kw {
244 const char *kw;
245 int (*parse)(char **args, int *cur_arg, struct proxy *px, struct server *srv, char **err);
246 int skip; /* nb min of args to skip, for use when kw is not handled */
247 int default_ok; /* non-zero if kw is supported in default-server section */
248};
249
250/*
251 * A keyword list. It is a NULL-terminated array of keywords. It embeds a
252 * struct list in order to be linked to other lists, allowing it to easily
253 * be declared where it is needed, and linked without duplicating data nor
254 * allocating memory. It is also possible to indicate a scope for the keywords.
255 */
256struct srv_kw_list {
257 const char *scope;
258 struct list list;
259 struct srv_kw kw[VAR_ARRAY];
260};
Willy Tarreaubaaee002006-06-26 02:48:02 +0200261
262#endif /* _TYPES_SERVER_H */
263
264/*
265 * Local variables:
266 * c-indent-level: 8
267 * c-basic-offset: 8
268 * End:
269 */