blob: 69cd9d7ac987a4d95f25f0e93566fd1fb176aaa0 [file] [log] [blame]
Emeric Brun2b920a12010-09-23 18:30:22 +02001/*
Emeric Brunb3971ab2015-05-12 18:49:09 +02002 * Peer synchro management.
Emeric Brun2b920a12010-09-23 18:30:22 +02003 *
4 * Copyright 2010 EXCELIANCE, Emeric Brun <ebrun@exceliance.fr>
5 *
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.
10 *
11 */
12
13#include <errno.h>
14#include <fcntl.h>
15#include <stdio.h>
16#include <stdlib.h>
17#include <string.h>
18
19#include <sys/socket.h>
20#include <sys/stat.h>
21#include <sys/types.h>
22
23#include <common/compat.h>
24#include <common/config.h>
25#include <common/time.h>
Frédéric Lécaille523cc9e2016-10-12 17:30:30 +020026#include <common/standard.h>
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +020027#include <common/hathreads.h>
Emeric Brun2b920a12010-09-23 18:30:22 +020028
29#include <types/global.h>
Willy Tarreau3fdb3662012-11-12 00:42:33 +010030#include <types/listener.h>
31#include <types/obj_type.h>
Emeric Brun2b920a12010-09-23 18:30:22 +020032#include <types/peers.h>
Frédéric Lécaille95679dc2019-04-15 10:25:27 +020033#include <types/stats.h>
Emeric Brun2b920a12010-09-23 18:30:22 +020034
35#include <proto/acl.h>
Willy Tarreau8a8d83b2015-04-13 13:24:54 +020036#include <proto/applet.h>
Willy Tarreauc7e42382012-08-24 19:22:53 +020037#include <proto/channel.h>
Frédéric Lécaille95679dc2019-04-15 10:25:27 +020038#include <proto/cli.h>
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +020039#include <proto/dict.h>
Emeric Brun2b920a12010-09-23 18:30:22 +020040#include <proto/fd.h>
Willy Tarreaud1d48d42015-03-13 16:15:46 +010041#include <proto/frontend.h>
Emeric Brun2b920a12010-09-23 18:30:22 +020042#include <proto/log.h>
43#include <proto/hdr_idx.h>
Willy Tarreau53a47662017-08-28 10:53:00 +020044#include <proto/mux_pt.h>
Frédéric Lécaille1055e682018-04-26 14:35:21 +020045#include <proto/peers.h>
Emeric Brun2b920a12010-09-23 18:30:22 +020046#include <proto/proxy.h>
Willy Tarreaufeb76402015-04-03 14:10:06 +020047#include <proto/session.h>
Willy Tarreau87b09662015-04-03 00:22:06 +020048#include <proto/stream.h>
Willy Tarreau22ec1ea2014-11-27 20:45:39 +010049#include <proto/signal.h>
50#include <proto/stick_table.h>
Emeric Brun2b920a12010-09-23 18:30:22 +020051#include <proto/stream_interface.h>
Emeric Brun2b920a12010-09-23 18:30:22 +020052#include <proto/task.h>
Emeric Brun2b920a12010-09-23 18:30:22 +020053
54
55/*******************************/
56/* Current peer learning state */
57/*******************************/
58
59/******************************/
Emeric Brunb3971ab2015-05-12 18:49:09 +020060/* Current peers section resync state */
Emeric Brun2b920a12010-09-23 18:30:22 +020061/******************************/
Frédéric Lécailleaba44a22019-03-26 10:18:07 +010062#define PEERS_F_RESYNC_LOCAL 0x00000001 /* Learn from local finished or no more needed */
63#define PEERS_F_RESYNC_REMOTE 0x00000002 /* Learn from remote finished or no more needed */
64#define PEERS_F_RESYNC_ASSIGN 0x00000004 /* A peer was assigned to learn our lesson */
65#define PEERS_F_RESYNC_PROCESS 0x00000008 /* The assigned peer was requested for resync */
66#define PEERS_F_DONOTSTOP 0x00010000 /* Main table sync task block process during soft stop
67 to push data to new process */
Emeric Brun2b920a12010-09-23 18:30:22 +020068
Frédéric Lécailleaba44a22019-03-26 10:18:07 +010069#define PEERS_RESYNC_STATEMASK (PEERS_F_RESYNC_LOCAL|PEERS_F_RESYNC_REMOTE)
70#define PEERS_RESYNC_FROMLOCAL 0x00000000
71#define PEERS_RESYNC_FROMREMOTE PEERS_F_RESYNC_LOCAL
72#define PEERS_RESYNC_FINISHED (PEERS_F_RESYNC_LOCAL|PEERS_F_RESYNC_REMOTE)
Emeric Brunb3971ab2015-05-12 18:49:09 +020073
74/***********************************/
75/* Current shared table sync state */
76/***********************************/
Frédéric Lécailleaba44a22019-03-26 10:18:07 +010077#define SHTABLE_F_TEACH_STAGE1 0x00000001 /* Teach state 1 complete */
78#define SHTABLE_F_TEACH_STAGE2 0x00000002 /* Teach state 2 complete */
Emeric Brun2b920a12010-09-23 18:30:22 +020079
80/******************************/
81/* Remote peer teaching state */
82/******************************/
Frédéric Lécailleaba44a22019-03-26 10:18:07 +010083#define PEER_F_TEACH_PROCESS 0x00000001 /* Teach a lesson to current peer */
84#define PEER_F_TEACH_FINISHED 0x00000008 /* Teach conclude, (wait for confirm) */
85#define PEER_F_TEACH_COMPLETE 0x00000010 /* All that we know already taught to current peer, used only for a local peer */
86#define PEER_F_LEARN_ASSIGN 0x00000100 /* Current peer was assigned for a lesson */
87#define PEER_F_LEARN_NOTUP2DATE 0x00000200 /* Learn from peer finished but peer is not up to date */
88#define PEER_F_ALIVE 0x20000000 /* Used to flag a peer a alive. */
89#define PEER_F_HEARTBEAT 0x40000000 /* Heartbeat message to send. */
90#define PEER_F_DWNGRD 0x80000000 /* When this flag is enabled, we must downgrade the supported version announced during peer sessions. */
Emeric Brun2b920a12010-09-23 18:30:22 +020091
Frédéric Lécailleaba44a22019-03-26 10:18:07 +010092#define PEER_TEACH_RESET ~(PEER_F_TEACH_PROCESS|PEER_F_TEACH_FINISHED) /* PEER_F_TEACH_COMPLETE should never be reset */
93#define PEER_LEARN_RESET ~(PEER_F_LEARN_ASSIGN|PEER_F_LEARN_NOTUP2DATE)
Emeric Brun2b920a12010-09-23 18:30:22 +020094
Frédéric Lécaille54bff832019-03-26 10:25:20 +010095#define PEER_RESYNC_TIMEOUT 5000 /* 5 seconds */
96#define PEER_RECONNECT_TIMEOUT 5000 /* 5 seconds */
Frédéric Lécaille645635d2019-02-11 17:49:39 +010097#define PEER_HEARTBEAT_TIMEOUT 3000 /* 3 seconds */
98
Emeric Brunb3971ab2015-05-12 18:49:09 +020099/*****************************/
100/* Sync message class */
101/*****************************/
102enum {
103 PEER_MSG_CLASS_CONTROL = 0,
104 PEER_MSG_CLASS_ERROR,
105 PEER_MSG_CLASS_STICKTABLE = 10,
106 PEER_MSG_CLASS_RESERVED = 255,
107};
108
109/*****************************/
110/* control message types */
111/*****************************/
112enum {
113 PEER_MSG_CTRL_RESYNCREQ = 0,
114 PEER_MSG_CTRL_RESYNCFINISHED,
115 PEER_MSG_CTRL_RESYNCPARTIAL,
116 PEER_MSG_CTRL_RESYNCCONFIRM,
Frédéric Lécaille645635d2019-02-11 17:49:39 +0100117 PEER_MSG_CTRL_HEARTBEAT,
Emeric Brunb3971ab2015-05-12 18:49:09 +0200118};
119
120/*****************************/
121/* error message types */
122/*****************************/
123enum {
124 PEER_MSG_ERR_PROTOCOL = 0,
125 PEER_MSG_ERR_SIZELIMIT,
126};
127
Emeric Brunc329cd02020-06-02 11:17:42 +0200128/* network key types;
129 * network types were directly and mistakenly
130 * mapped on sample types, to keep backward
131 * compatiblitiy we keep those values but
132 * we now use a internal/network mapping
133 * to avoid further mistakes adding or
134 * modifying internals types
135 */
136enum {
137 PEER_KT_ANY = 0, /* any type */
138 PEER_KT_RESV1, /* UNUSED */
139 PEER_KT_SINT, /* signed 64bits integer type */
140 PEER_KT_RESV3, /* UNUSED */
141 PEER_KT_IPV4, /* ipv4 type */
142 PEER_KT_IPV6, /* ipv6 type */
143 PEER_KT_STR, /* char string type */
144 PEER_KT_BIN, /* buffer type */
145 PEER_KT_TYPES /* number of types, must always be last */
146};
147
148/* Map used to retrieve network type from internal type
149 * Note: Undeclared mapping maps entry to PEER_KT_ANY == 0
150 */
151static int peer_net_key_type[SMP_TYPES] = {
152 [SMP_T_SINT] = PEER_KT_SINT,
153 [SMP_T_IPV4] = PEER_KT_IPV4,
154 [SMP_T_IPV6] = PEER_KT_IPV6,
155 [SMP_T_STR] = PEER_KT_STR,
156 [SMP_T_BIN] = PEER_KT_BIN,
157};
158
159/* Map used to retrieve internal type from external type
160 * Note: Undeclared mapping maps entry to SMP_T_ANY == 0
161 */
162static int peer_int_key_type[PEER_KT_TYPES] = {
163 [PEER_KT_SINT] = SMP_T_SINT,
164 [PEER_KT_IPV4] = SMP_T_IPV4,
165 [PEER_KT_IPV6] = SMP_T_IPV6,
166 [PEER_KT_STR] = SMP_T_STR,
167 [PEER_KT_BIN] = SMP_T_BIN,
168};
169
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100170/*
171 * Parameters used by functions to build peer protocol messages. */
172struct peer_prep_params {
173 struct {
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +0100174 struct peer *peer;
175 } hello;
176 struct {
177 unsigned int st1;
178 } error_status;
179 struct {
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100180 struct stksess *stksess;
181 struct shared_table *shared_table;
182 unsigned int updateid;
183 int use_identifier;
184 int use_timed;
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200185 struct peer *peer;
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100186 } updt;
187 struct {
188 struct shared_table *shared_table;
189 } swtch;
190 struct {
191 struct shared_table *shared_table;
192 } ack;
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +0100193 struct {
194 unsigned char head[2];
195 } control;
196 struct {
197 unsigned char head[2];
198 } error;
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100199};
Emeric Brunb3971ab2015-05-12 18:49:09 +0200200
201/*******************************/
202/* stick table sync mesg types */
203/* Note: ids >= 128 contains */
204/* id message cotains data */
205/*******************************/
Olivier Houchard33992262018-10-16 18:49:26 +0200206#define PEER_MSG_STKT_UPDATE 0x80
207#define PEER_MSG_STKT_INCUPDATE 0x81
208#define PEER_MSG_STKT_DEFINE 0x82
209#define PEER_MSG_STKT_SWITCH 0x83
210#define PEER_MSG_STKT_ACK 0x84
211#define PEER_MSG_STKT_UPDATE_TIMED 0x85
212#define PEER_MSG_STKT_INCUPDATE_TIMED 0x86
Frédéric Lécaille36fb77e2019-06-04 08:28:19 +0200213/* All the stick-table message identifiers abova have the #7 bit set */
214#define PEER_MSG_STKT_BIT 7
215#define PEER_MSG_STKT_BIT_MASK (1 << PEER_MSG_STKT_BIT)
Emeric Brun2b920a12010-09-23 18:30:22 +0200216
Frédéric Lécaille39143342019-05-24 14:32:27 +0200217/* The maximum length of an encoded data length. */
218#define PEER_MSG_ENC_LENGTH_MAXLEN 5
219
Frédéric Lécaille32b55732019-06-03 18:29:51 +0200220/* Minimum 64-bits value encoded with 2 bytes */
221#define PEER_ENC_2BYTES_MIN 0xf0 /* 0xf0 (or 240) */
222/* 3 bytes */
223#define PEER_ENC_3BYTES_MIN ((1ULL << 11) | PEER_ENC_2BYTES_MIN) /* 0x8f0 (or 2288) */
224/* 4 bytes */
225#define PEER_ENC_4BYTES_MIN ((1ULL << 18) | PEER_ENC_3BYTES_MIN) /* 0x408f0 (or 264432) */
226/* 5 bytes */
227#define PEER_ENC_5BYTES_MIN ((1ULL << 25) | PEER_ENC_4BYTES_MIN) /* 0x20408f0 (or 33818864) */
228/* 6 bytes */
229#define PEER_ENC_6BYTES_MIN ((1ULL << 32) | PEER_ENC_5BYTES_MIN) /* 0x1020408f0 (or 4328786160) */
230/* 7 bytes */
231#define PEER_ENC_7BYTES_MIN ((1ULL << 39) | PEER_ENC_6BYTES_MIN) /* 0x81020408f0 (or 554084600048) */
232/* 8 bytes */
233#define PEER_ENC_8BYTES_MIN ((1ULL << 46) | PEER_ENC_7BYTES_MIN) /* 0x4081020408f0 (or 70922828777712) */
234/* 9 bytes */
235#define PEER_ENC_9BYTES_MIN ((1ULL << 53) | PEER_ENC_8BYTES_MIN) /* 0x204081020408f0 (or 9078122083518704) */
236/* 10 bytes */
237#define PEER_ENC_10BYTES_MIN ((1ULL << 60) | PEER_ENC_9BYTES_MIN) /* 0x10204081020408f0 (or 1161999626690365680) */
238
239/* #7 bit used to detect the last byte to be encoded */
240#define PEER_ENC_STOP_BIT 7
241/* The byte minimum value with #7 bit set */
242#define PEER_ENC_STOP_BYTE (1 << PEER_ENC_STOP_BIT)
243/* The left most number of bits set for PEER_ENC_2BYTES_MIN */
244#define PEER_ENC_2BYTES_MIN_BITS 4
245
Frédéric Lécaille39143342019-05-24 14:32:27 +0200246#define PEER_MSG_HEADER_LEN 2
247
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200248#define PEER_STKT_CACHE_MAX_ENTRIES 128
249
Emeric Brun2b920a12010-09-23 18:30:22 +0200250/**********************************/
251/* Peer Session IO handler states */
252/**********************************/
253
Willy Tarreaue4d927a2013-12-01 12:47:35 +0100254enum {
255 PEER_SESS_ST_ACCEPT = 0, /* Initial state for session create by an accept, must be zero! */
256 PEER_SESS_ST_GETVERSION, /* Validate supported protocol version */
257 PEER_SESS_ST_GETHOST, /* Validate host ID correspond to local host id */
258 PEER_SESS_ST_GETPEER, /* Validate peer ID correspond to a known remote peer id */
Willy Tarreaue4d927a2013-12-01 12:47:35 +0100259 /* after this point, data were possibly exchanged */
260 PEER_SESS_ST_SENDSUCCESS, /* Send ret code 200 (success) and wait for message */
261 PEER_SESS_ST_CONNECT, /* Initial state for session create on a connect, push presentation into buffer */
262 PEER_SESS_ST_GETSTATUS, /* Wait for the welcome message */
263 PEER_SESS_ST_WAITMSG, /* Wait for data messages */
264 PEER_SESS_ST_EXIT, /* Exit with status code */
Emeric Brunb3971ab2015-05-12 18:49:09 +0200265 PEER_SESS_ST_ERRPROTO, /* Send error proto message before exit */
266 PEER_SESS_ST_ERRSIZE, /* Send error size message before exit */
Willy Tarreaue4d927a2013-12-01 12:47:35 +0100267 PEER_SESS_ST_END, /* Killed session */
268};
Emeric Brun2b920a12010-09-23 18:30:22 +0200269
Willy Tarreaue4d927a2013-12-01 12:47:35 +0100270/***************************************************/
271/* Peer Session status code - part of the protocol */
272/***************************************************/
Emeric Brun2b920a12010-09-23 18:30:22 +0200273
Frédéric Lécailleaba44a22019-03-26 10:18:07 +0100274#define PEER_SESS_SC_CONNECTCODE 100 /* connect in progress */
275#define PEER_SESS_SC_CONNECTEDCODE 110 /* tcp connect success */
Emeric Brun2b920a12010-09-23 18:30:22 +0200276
Frédéric Lécailleaba44a22019-03-26 10:18:07 +0100277#define PEER_SESS_SC_SUCCESSCODE 200 /* accept or connect successful */
Emeric Brun2b920a12010-09-23 18:30:22 +0200278
Frédéric Lécailleaba44a22019-03-26 10:18:07 +0100279#define PEER_SESS_SC_TRYAGAIN 300 /* try again later */
Emeric Brun2b920a12010-09-23 18:30:22 +0200280
Frédéric Lécailleaba44a22019-03-26 10:18:07 +0100281#define PEER_SESS_SC_ERRPROTO 501 /* error protocol */
282#define PEER_SESS_SC_ERRVERSION 502 /* unknown protocol version */
283#define PEER_SESS_SC_ERRHOST 503 /* bad host name */
284#define PEER_SESS_SC_ERRPEER 504 /* unknown peer */
Emeric Brun2b920a12010-09-23 18:30:22 +0200285
286#define PEER_SESSION_PROTO_NAME "HAProxyS"
Frédéric Lécaille523cc9e2016-10-12 17:30:30 +0200287#define PEER_MAJOR_VER 2
288#define PEER_MINOR_VER 1
289#define PEER_DWNGRD_MINOR_VER 0
Emeric Brun2b920a12010-09-23 18:30:22 +0200290
Willy Tarreau6254a922019-01-29 17:45:23 +0100291static size_t proto_len = sizeof(PEER_SESSION_PROTO_NAME) - 1;
Frédéric Lécailleed2b4a62017-07-13 09:07:09 +0200292struct peers *cfg_peers = NULL;
Emeric Brun9ef2ad72019-04-02 17:22:01 +0200293static void peer_session_forceshutdown(struct peer *peer);
Emeric Brun2b920a12010-09-23 18:30:22 +0200294
Frédéric Lécaille6c391982019-06-06 11:34:03 +0200295static struct ebpt_node *dcache_tx_insert(struct dcache *dc,
296 struct dcache_tx_entry *i);
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200297static inline void flush_dcache(struct peer *peer);
298
Frédéric Lécaille95679dc2019-04-15 10:25:27 +0200299static const char *statuscode_str(int statuscode)
300{
301 switch (statuscode) {
302 case PEER_SESS_SC_CONNECTCODE:
303 return "CONN";
304 case PEER_SESS_SC_CONNECTEDCODE:
305 return "HSHK";
306 case PEER_SESS_SC_SUCCESSCODE:
307 return "ESTA";
308 case PEER_SESS_SC_TRYAGAIN:
309 return "RETR";
310 case PEER_SESS_SC_ERRPROTO:
311 return "PROT";
312 case PEER_SESS_SC_ERRVERSION:
313 return "VERS";
314 case PEER_SESS_SC_ERRHOST:
315 return "NAME";
316 case PEER_SESS_SC_ERRPEER:
317 return "UNKN";
318 default:
319 return "NONE";
320 }
321}
322
Emeric Brun18928af2017-03-29 16:32:53 +0200323/* This function encode an uint64 to 'dynamic' length format.
324 The encoded value is written at address *str, and the
325 caller must assure that size after *str is large enought.
326 At return, the *str is set at the next Byte after then
327 encoded integer. The function returns then length of the
328 encoded integer in Bytes */
Emeric Brunb3971ab2015-05-12 18:49:09 +0200329int intencode(uint64_t i, char **str) {
330 int idx = 0;
331 unsigned char *msg;
332
Emeric Brunb3971ab2015-05-12 18:49:09 +0200333 msg = (unsigned char *)*str;
Frédéric Lécaille32b55732019-06-03 18:29:51 +0200334 if (i < PEER_ENC_2BYTES_MIN) {
Emeric Brunb3971ab2015-05-12 18:49:09 +0200335 msg[0] = (unsigned char)i;
336 *str = (char *)&msg[idx+1];
337 return (idx+1);
338 }
339
Frédéric Lécaille32b55732019-06-03 18:29:51 +0200340 msg[idx] =(unsigned char)i | PEER_ENC_2BYTES_MIN;
341 i = (i - PEER_ENC_2BYTES_MIN) >> PEER_ENC_2BYTES_MIN_BITS;
342 while (i >= PEER_ENC_STOP_BYTE) {
343 msg[++idx] = (unsigned char)i | PEER_ENC_STOP_BYTE;
344 i = (i - PEER_ENC_STOP_BYTE) >> PEER_ENC_STOP_BIT;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200345 }
346 msg[++idx] = (unsigned char)i;
347 *str = (char *)&msg[idx+1];
348 return (idx+1);
349}
350
351
352/* This function returns the decoded integer or 0
353 if decode failed
354 *str point on the beginning of the integer to decode
355 at the end of decoding *str point on the end of the
356 encoded integer or to null if end is reached */
Emeric Brun18928af2017-03-29 16:32:53 +0200357uint64_t intdecode(char **str, char *end)
358{
Emeric Brunb3971ab2015-05-12 18:49:09 +0200359 unsigned char *msg;
Emeric Brun18928af2017-03-29 16:32:53 +0200360 uint64_t i;
361 int shift;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200362
363 if (!*str)
364 return 0;
365
366 msg = (unsigned char *)*str;
Emeric Brun18928af2017-03-29 16:32:53 +0200367 if (msg >= (unsigned char *)end)
368 goto fail;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200369
Emeric Brun18928af2017-03-29 16:32:53 +0200370 i = *(msg++);
Frédéric Lécaille32b55732019-06-03 18:29:51 +0200371 if (i >= PEER_ENC_2BYTES_MIN) {
372 shift = PEER_ENC_2BYTES_MIN_BITS;
Emeric Brun18928af2017-03-29 16:32:53 +0200373 do {
374 if (msg >= (unsigned char *)end)
375 goto fail;
376 i += (uint64_t)*msg << shift;
Frédéric Lécaille32b55732019-06-03 18:29:51 +0200377 shift += PEER_ENC_STOP_BIT;
378 } while (*(msg++) >= PEER_ENC_STOP_BYTE);
Emeric Brunb3971ab2015-05-12 18:49:09 +0200379 }
Frédéric Lécaillea8725ec2019-01-22 10:31:39 +0100380 *str = (char *)msg;
381 return i;
Emeric Brun18928af2017-03-29 16:32:53 +0200382
Frédéric Lécaillea8725ec2019-01-22 10:31:39 +0100383 fail:
384 *str = NULL;
385 return 0;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200386}
Emeric Brun2b920a12010-09-23 18:30:22 +0200387
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +0100388/*
389 * Build a "hello" peer protocol message.
390 * Return the number of written bytes written to build this messages if succeeded,
391 * 0 if not.
392 */
393static int peer_prepare_hellomsg(char *msg, size_t size, struct peer_prep_params *p)
394{
395 int min_ver, ret;
396 struct peer *peer;
397
398 peer = p->hello.peer;
399 min_ver = (peer->flags & PEER_F_DWNGRD) ? PEER_DWNGRD_MINOR_VER : PEER_MINOR_VER;
400 /* Prepare headers */
401 ret = snprintf(msg, size, PEER_SESSION_PROTO_NAME " %u.%u\n%s\n%s %d %d\n",
402 PEER_MAJOR_VER, min_ver, peer->id, localpeer, (int)getpid(), relative_pid);
403 if (ret >= size)
404 return 0;
405
406 return ret;
407}
408
409/*
410 * Build a "handshake succeeded" status message.
411 * Return the number of written bytes written to build this messages if succeeded,
412 * 0 if not.
413 */
414static int peer_prepare_status_successmsg(char *msg, size_t size, struct peer_prep_params *p)
415{
416 int ret;
417
418 ret = snprintf(msg, size, "%d\n", PEER_SESS_SC_SUCCESSCODE);
419 if (ret >= size)
420 return 0;
421
422 return ret;
423}
424
425/*
426 * Build an error status message.
427 * Return the number of written bytes written to build this messages if succeeded,
428 * 0 if not.
429 */
430static int peer_prepare_status_errormsg(char *msg, size_t size, struct peer_prep_params *p)
431{
432 int ret;
433 unsigned int st1;
434
435 st1 = p->error_status.st1;
436 ret = snprintf(msg, size, "%d\n", st1);
437 if (ret >= size)
438 return 0;
439
440 return ret;
441}
442
Frédéric Lécaille523cc9e2016-10-12 17:30:30 +0200443/* Set the stick-table UPDATE message type byte at <msg_type> address,
444 * depending on <use_identifier> and <use_timed> boolean parameters.
445 * Always successful.
446 */
447static inline void peer_set_update_msg_type(char *msg_type, int use_identifier, int use_timed)
448{
449 if (use_timed) {
450 if (use_identifier)
451 *msg_type = PEER_MSG_STKT_UPDATE_TIMED;
452 else
453 *msg_type = PEER_MSG_STKT_INCUPDATE_TIMED;
454 }
455 else {
456 if (use_identifier)
457 *msg_type = PEER_MSG_STKT_UPDATE;
458 else
459 *msg_type = PEER_MSG_STKT_INCUPDATE;
460 }
Frédéric Lécaille523cc9e2016-10-12 17:30:30 +0200461}
Emeric Brun2b920a12010-09-23 18:30:22 +0200462/*
Emeric Brunb3971ab2015-05-12 18:49:09 +0200463 * This prepare the data update message on the stick session <ts>, <st> is the considered
464 * stick table.
Joseph Herlant82b2f542018-11-15 12:19:14 -0800465 * <msg> is a buffer of <size> to receive data message content
Emeric Brunb3971ab2015-05-12 18:49:09 +0200466 * If function returns 0, the caller should consider we were unable to encode this message (TODO:
467 * check size)
Emeric Brun2b920a12010-09-23 18:30:22 +0200468 */
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100469static int peer_prepare_updatemsg(char *msg, size_t size, struct peer_prep_params *p)
Emeric Brun2b920a12010-09-23 18:30:22 +0200470{
471 uint32_t netinteger;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200472 unsigned short datalen;
473 char *cursor, *datamsg;
Emeric Brun94900952015-06-11 18:25:54 +0200474 unsigned int data_type;
475 void *data_ptr;
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100476 struct stksess *ts;
477 struct shared_table *st;
478 unsigned int updateid;
479 int use_identifier;
480 int use_timed;
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200481 struct peer *peer;
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100482
483 ts = p->updt.stksess;
484 st = p->updt.shared_table;
485 updateid = p->updt.updateid;
486 use_identifier = p->updt.use_identifier;
487 use_timed = p->updt.use_timed;
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200488 peer = p->updt.peer;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200489
Frédéric Lécaille0e8db972019-05-24 14:34:34 +0200490 cursor = datamsg = msg + PEER_MSG_HEADER_LEN + PEER_MSG_ENC_LENGTH_MAXLEN;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200491
Emeric Brun2b920a12010-09-23 18:30:22 +0200492 /* construct message */
Emeric Brunb3971ab2015-05-12 18:49:09 +0200493
494 /* check if we need to send the update identifer */
Emeric Brun819fc6f2017-06-13 19:37:32 +0200495 if (!st->last_pushed || updateid < st->last_pushed || ((updateid - st->last_pushed) != 1)) {
Emeric Bruna6a09982015-09-22 15:34:19 +0200496 use_identifier = 1;
Emeric Brun2b920a12010-09-23 18:30:22 +0200497 }
Emeric Brunb3971ab2015-05-12 18:49:09 +0200498
499 /* encode update identifier if needed */
500 if (use_identifier) {
Emeric Brun819fc6f2017-06-13 19:37:32 +0200501 netinteger = htonl(updateid);
Emeric Brunb3971ab2015-05-12 18:49:09 +0200502 memcpy(cursor, &netinteger, sizeof(netinteger));
503 cursor += sizeof(netinteger);
Emeric Brun2b920a12010-09-23 18:30:22 +0200504 }
505
Frédéric Lécaille523cc9e2016-10-12 17:30:30 +0200506 if (use_timed) {
507 netinteger = htonl(tick_remain(now_ms, ts->expire));
508 memcpy(cursor, &netinteger, sizeof(netinteger));
509 cursor += sizeof(netinteger);
510 }
511
Emeric Brunb3971ab2015-05-12 18:49:09 +0200512 /* encode the key */
Thierry FOURNIER5d24ebc2015-07-24 08:46:42 +0200513 if (st->table->type == SMP_T_STR) {
Emeric Brun2b920a12010-09-23 18:30:22 +0200514 int stlen = strlen((char *)ts->key.key);
515
Emeric Brunb3971ab2015-05-12 18:49:09 +0200516 intencode(stlen, &cursor);
517 memcpy(cursor, ts->key.key, stlen);
518 cursor += stlen;
Emeric Brun2b920a12010-09-23 18:30:22 +0200519 }
Thierry FOURNIER5d24ebc2015-07-24 08:46:42 +0200520 else if (st->table->type == SMP_T_SINT) {
Emeric Brun2b920a12010-09-23 18:30:22 +0200521 netinteger = htonl(*((uint32_t *)ts->key.key));
Emeric Brunb3971ab2015-05-12 18:49:09 +0200522 memcpy(cursor, &netinteger, sizeof(netinteger));
523 cursor += sizeof(netinteger);
Emeric Brun2b920a12010-09-23 18:30:22 +0200524 }
525 else {
Emeric Brunb3971ab2015-05-12 18:49:09 +0200526 memcpy(cursor, ts->key.key, st->table->key_size);
527 cursor += st->table->key_size;
Emeric Brun2b920a12010-09-23 18:30:22 +0200528 }
529
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100530 HA_RWLOCK_RDLOCK(STK_SESS_LOCK, &ts->lock);
Emeric Brunb3971ab2015-05-12 18:49:09 +0200531 /* encode values */
Emeric Brun94900952015-06-11 18:25:54 +0200532 for (data_type = 0 ; data_type < STKTABLE_DATA_TYPES ; data_type++) {
Emeric Brunb3971ab2015-05-12 18:49:09 +0200533
Emeric Brun94900952015-06-11 18:25:54 +0200534 data_ptr = stktable_data_ptr(st->table, ts, data_type);
535 if (data_ptr) {
536 switch (stktable_data_types[data_type].std_type) {
537 case STD_T_SINT: {
538 int data;
539
540 data = stktable_data_cast(data_ptr, std_t_sint);
541 intencode(data, &cursor);
542 break;
543 }
544 case STD_T_UINT: {
545 unsigned int data;
546
547 data = stktable_data_cast(data_ptr, std_t_uint);
548 intencode(data, &cursor);
549 break;
550 }
551 case STD_T_ULL: {
552 unsigned long long data;
553
554 data = stktable_data_cast(data_ptr, std_t_ull);
555 intencode(data, &cursor);
556 break;
557 }
558 case STD_T_FRQP: {
559 struct freq_ctr_period *frqp;
560
561 frqp = &stktable_data_cast(data_ptr, std_t_frqp);
562 intencode((unsigned int)(now_ms - frqp->curr_tick), &cursor);
563 intencode(frqp->curr_ctr, &cursor);
564 intencode(frqp->prev_ctr, &cursor);
565 break;
566 }
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200567 case STD_T_DICT: {
568 struct dict_entry *de;
Frédéric Lécaille6c391982019-06-06 11:34:03 +0200569 struct ebpt_node *cached_de;
Willy Tarreau237f8ae2019-06-06 16:40:43 +0200570 struct dcache_tx_entry cde = { };
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200571 char *beg, *end;
572 size_t value_len, data_len;
573 struct dcache *dc;
574
575 de = stktable_data_cast(data_ptr, std_t_dict);
Frédéric Lécailled9203ca2019-11-13 17:50:34 +0100576 if (!de) {
577 /* No entry */
578 intencode(0, &cursor);
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200579 break;
Frédéric Lécailled9203ca2019-11-13 17:50:34 +0100580 }
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200581
582 dc = peer->dcache;
Frédéric Lécaille6c391982019-06-06 11:34:03 +0200583 cde.entry.key = de;
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200584 cached_de = dcache_tx_insert(dc, &cde);
Frédéric Lécaillefd827932019-06-07 10:34:04 +0200585 if (cached_de == &cde.entry) {
586 if (cde.id + 1 >= PEER_ENC_2BYTES_MIN)
587 break;
588 /* Encode the length of the remaining data -> 1 */
589 intencode(1, &cursor);
590 /* Encode the cache entry ID */
591 intencode(cde.id + 1, &cursor);
592 }
593 else {
594 /* Leave enough room to encode the remaining data length. */
595 end = beg = cursor + PEER_MSG_ENC_LENGTH_MAXLEN;
596 /* Encode the dictionary entry key */
597 intencode(cde.id + 1, &end);
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200598 /* Encode the length of the dictionary entry data */
Frédéric Lécaillefd827932019-06-07 10:34:04 +0200599 value_len = de->len;
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200600 intencode(value_len, &end);
601 /* Copy the data */
602 memcpy(end, de->value.key, value_len);
603 end += value_len;
Frédéric Lécaillefd827932019-06-07 10:34:04 +0200604 /* Encode the length of the data */
605 data_len = end - beg;
606 intencode(data_len, &cursor);
607 memmove(cursor, beg, data_len);
608 cursor += data_len;
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200609 }
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200610 break;
611 }
Emeric Brun94900952015-06-11 18:25:54 +0200612 }
613 }
Emeric Brunb3971ab2015-05-12 18:49:09 +0200614 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100615 HA_RWLOCK_RDUNLOCK(STK_SESS_LOCK, &ts->lock);
Emeric Brunb3971ab2015-05-12 18:49:09 +0200616
617 /* Compute datalen */
618 datalen = (cursor - datamsg);
619
620 /* prepare message header */
621 msg[0] = PEER_MSG_CLASS_STICKTABLE;
Frédéric Lécaille523cc9e2016-10-12 17:30:30 +0200622 peer_set_update_msg_type(&msg[1], use_identifier, use_timed);
Emeric Brunb3971ab2015-05-12 18:49:09 +0200623 cursor = &msg[2];
624 intencode(datalen, &cursor);
625
626 /* move data after header */
627 memmove(cursor, datamsg, datalen);
628
629 /* return header size + data_len */
630 return (cursor - msg) + datalen;
631}
632
633/*
634 * This prepare the switch table message to targeted share table <st>.
Joseph Herlant82b2f542018-11-15 12:19:14 -0800635 * <msg> is a buffer of <size> to receive data message content
Emeric Brunb3971ab2015-05-12 18:49:09 +0200636 * If function returns 0, the caller should consider we were unable to encode this message (TODO:
637 * check size)
638 */
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100639static int peer_prepare_switchmsg(char *msg, size_t size, struct peer_prep_params *params)
Emeric Brunb3971ab2015-05-12 18:49:09 +0200640{
641 int len;
642 unsigned short datalen;
Willy Tarreau83061a82018-07-13 11:56:34 +0200643 struct buffer *chunk;
Frédéric Lécaille37a72542017-07-06 15:02:16 +0200644 char *cursor, *datamsg, *chunkp, *chunkq;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200645 uint64_t data = 0;
Emeric Brun94900952015-06-11 18:25:54 +0200646 unsigned int data_type;
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100647 struct shared_table *st;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200648
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100649 st = params->swtch.shared_table;
Frédéric Lécaille39143342019-05-24 14:32:27 +0200650 cursor = datamsg = msg + PEER_MSG_HEADER_LEN + PEER_MSG_ENC_LENGTH_MAXLEN;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200651
652 /* Encode data */
653
654 /* encode local id */
655 intencode(st->local_id, &cursor);
656
657 /* encode table name */
Frédéric Lécaille7fcc24d2019-03-20 15:09:45 +0100658 len = strlen(st->table->nid);
Emeric Brunb3971ab2015-05-12 18:49:09 +0200659 intencode(len, &cursor);
Frédéric Lécaille7fcc24d2019-03-20 15:09:45 +0100660 memcpy(cursor, st->table->nid, len);
Emeric Brunb3971ab2015-05-12 18:49:09 +0200661 cursor += len;
662
663 /* encode table type */
664
Emeric Brunc329cd02020-06-02 11:17:42 +0200665 intencode(peer_net_key_type[st->table->type], &cursor);
Emeric Brunb3971ab2015-05-12 18:49:09 +0200666
667 /* encode table key size */
668 intencode(st->table->key_size, &cursor);
669
Frédéric Lécaille37a72542017-07-06 15:02:16 +0200670 chunk = get_trash_chunk();
Willy Tarreau843b7cb2018-07-13 10:54:26 +0200671 chunkp = chunkq = chunk->area;
Emeric Brun94900952015-06-11 18:25:54 +0200672 /* encode available known data types in table */
673 for (data_type = 0 ; data_type < STKTABLE_DATA_TYPES ; data_type++) {
674 if (st->table->data_ofs[data_type]) {
675 switch (stktable_data_types[data_type].std_type) {
676 case STD_T_SINT:
677 case STD_T_UINT:
678 case STD_T_ULL:
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200679 case STD_T_DICT:
Frédéric Lécaille37a72542017-07-06 15:02:16 +0200680 data |= 1 << data_type;
681 break;
Emeric Brun94900952015-06-11 18:25:54 +0200682 case STD_T_FRQP:
683 data |= 1 << data_type;
Frédéric Lécaille37a72542017-07-06 15:02:16 +0200684 intencode(data_type, &chunkq);
685 intencode(st->table->data_arg[data_type].u, &chunkq);
Emeric Brun94900952015-06-11 18:25:54 +0200686 break;
687 }
688 }
Emeric Brunb3971ab2015-05-12 18:49:09 +0200689 }
690 intencode(data, &cursor);
691
Frédéric Lécaille37a72542017-07-06 15:02:16 +0200692 /* Encode stick-table entries duration. */
693 intencode(st->table->expire, &cursor);
694
695 if (chunkq > chunkp) {
Willy Tarreau843b7cb2018-07-13 10:54:26 +0200696 chunk->data = chunkq - chunkp;
697 memcpy(cursor, chunk->area, chunk->data);
698 cursor += chunk->data;
Frédéric Lécaille37a72542017-07-06 15:02:16 +0200699 }
700
Emeric Brunb3971ab2015-05-12 18:49:09 +0200701 /* Compute datalen */
702 datalen = (cursor - datamsg);
Emeric Brun2b920a12010-09-23 18:30:22 +0200703
Emeric Brunb3971ab2015-05-12 18:49:09 +0200704 /* prepare message header */
705 msg[0] = PEER_MSG_CLASS_STICKTABLE;
706 msg[1] = PEER_MSG_STKT_DEFINE;
707 cursor = &msg[2];
708 intencode(datalen, &cursor);
Emeric Brun2b920a12010-09-23 18:30:22 +0200709
Emeric Brunb3971ab2015-05-12 18:49:09 +0200710 /* move data after header */
711 memmove(cursor, datamsg, datalen);
712
713 /* return header size + data_len */
714 return (cursor - msg) + datalen;
Emeric Brun2b920a12010-09-23 18:30:22 +0200715}
716
Emeric Brunb3971ab2015-05-12 18:49:09 +0200717/*
718 * This prepare the acknowledge message on the stick session <ts>, <st> is the considered
719 * stick table.
Joseph Herlant82b2f542018-11-15 12:19:14 -0800720 * <msg> is a buffer of <size> to receive data message content
Emeric Brunb3971ab2015-05-12 18:49:09 +0200721 * If function returns 0, the caller should consider we were unable to encode this message (TODO:
722 * check size)
723 */
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100724static int peer_prepare_ackmsg(char *msg, size_t size, struct peer_prep_params *p)
Emeric Brunb3971ab2015-05-12 18:49:09 +0200725{
726 unsigned short datalen;
727 char *cursor, *datamsg;
728 uint32_t netinteger;
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100729 struct shared_table *st;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200730
Frédéric Lécaille39143342019-05-24 14:32:27 +0200731 cursor = datamsg = msg + PEER_MSG_HEADER_LEN + PEER_MSG_ENC_LENGTH_MAXLEN;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200732
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100733 st = p->ack.shared_table;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200734 intencode(st->remote_id, &cursor);
735 netinteger = htonl(st->last_get);
736 memcpy(cursor, &netinteger, sizeof(netinteger));
737 cursor += sizeof(netinteger);
738
739 /* Compute datalen */
740 datalen = (cursor - datamsg);
741
742 /* prepare message header */
743 msg[0] = PEER_MSG_CLASS_STICKTABLE;
Emeric Brune1ab8082015-08-21 11:48:54 +0200744 msg[1] = PEER_MSG_STKT_ACK;
Emeric Brunb3971ab2015-05-12 18:49:09 +0200745 cursor = &msg[2];
746 intencode(datalen, &cursor);
747
748 /* move data after header */
749 memmove(cursor, datamsg, datalen);
750
751 /* return header size + data_len */
752 return (cursor - msg) + datalen;
753}
Emeric Brun2b920a12010-09-23 18:30:22 +0200754
755/*
Emeric Brun9ef2ad72019-04-02 17:22:01 +0200756 * Function to deinit connected peer
757 */
758void __peer_session_deinit(struct peer *peer)
759{
760 struct stream_interface *si;
761 struct stream *s;
762 struct peers *peers;
763
764 if (!peer->appctx)
765 return;
766
767 si = peer->appctx->owner;
768 if (!si)
769 return;
770
771 s = si_strm(si);
772 if (!s)
773 return;
774
775 peers = strm_fe(s)->parent;
776 if (!peers)
777 return;
778
779 if (peer->appctx->st0 == PEER_SESS_ST_WAITMSG)
780 HA_ATOMIC_SUB(&connected_peers, 1);
781
782 HA_ATOMIC_SUB(&active_peers, 1);
783
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +0200784 flush_dcache(peer);
785
Emeric Brun9ef2ad72019-04-02 17:22:01 +0200786 /* Re-init current table pointers to force announcement on re-connect */
787 peer->remote_table = peer->last_local_table = NULL;
788 peer->appctx = NULL;
789 if (peer->flags & PEER_F_LEARN_ASSIGN) {
790 /* unassign current peer for learning */
791 peer->flags &= ~(PEER_F_LEARN_ASSIGN);
792 peers->flags &= ~(PEERS_F_RESYNC_ASSIGN|PEERS_F_RESYNC_PROCESS);
793
794 /* reschedule a resync */
795 peers->resync_timeout = tick_add(now_ms, MS_TO_TICKS(5000));
796 }
797 /* reset teaching and learning flags to 0 */
798 peer->flags &= PEER_TEACH_RESET;
799 peer->flags &= PEER_LEARN_RESET;
800 task_wakeup(peers->sync_task, TASK_WOKEN_MSG);
801}
802
803/*
Emeric Brun2b920a12010-09-23 18:30:22 +0200804 * Callback to release a session with a peer
805 */
Willy Tarreau00a37f02015-04-13 12:05:19 +0200806static void peer_session_release(struct appctx *appctx)
Emeric Brun2b920a12010-09-23 18:30:22 +0200807{
Vincent Bernat3c2f2f22016-04-03 13:48:42 +0200808 struct peer *peer = appctx->ctx.peers.ptr;
Emeric Brun2b920a12010-09-23 18:30:22 +0200809
Willy Tarreau7b4b4992013-12-01 09:15:12 +0100810 /* appctx->ctx.peers.ptr is not a peer session */
Willy Tarreaue4d927a2013-12-01 12:47:35 +0100811 if (appctx->st0 < PEER_SESS_ST_SENDSUCCESS)
Emeric Brun2b920a12010-09-23 18:30:22 +0200812 return;
813
814 /* peer session identified */
Emeric Brunb3971ab2015-05-12 18:49:09 +0200815 if (peer) {
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100816 HA_SPIN_LOCK(PEER_LOCK, &peer->lock);
Emeric Brun9ef2ad72019-04-02 17:22:01 +0200817 if (peer->appctx == appctx)
818 __peer_session_deinit(peer);
Frédéric Lécaillec77aa3b2020-10-14 11:50:26 +0200819 peer->flags &= ~PEER_F_ALIVE;
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100820 HA_SPIN_UNLOCK(PEER_LOCK, &peer->lock);
Emeric Brun2b920a12010-09-23 18:30:22 +0200821 }
822}
823
Frédéric Lécaille523cc9e2016-10-12 17:30:30 +0200824/* Retrieve the major and minor versions of peers protocol
825 * announced by a remote peer. <str> is a null-terminated
826 * string with the following format: "<maj_ver>.<min_ver>".
827 */
828static int peer_get_version(const char *str,
829 unsigned int *maj_ver, unsigned int *min_ver)
830{
831 unsigned int majv, minv;
832 const char *pos, *saved;
833 const char *end;
834
835 saved = pos = str;
836 end = str + strlen(str);
837
838 majv = read_uint(&pos, end);
839 if (saved == pos || *pos++ != '.')
840 return -1;
841
842 saved = pos;
843 minv = read_uint(&pos, end);
844 if (saved == pos || pos != end)
845 return -1;
846
847 *maj_ver = majv;
848 *min_ver = minv;
849
850 return 0;
851}
Emeric Brun2b920a12010-09-23 18:30:22 +0200852
853/*
Frédéric Lécaillece025572019-01-21 13:38:06 +0100854 * Parse a line terminated by an optional '\r' character, followed by a mandatory
855 * '\n' character.
856 * Returns 1 if succeeded or 0 if a '\n' character could not be found, and -1 if
857 * a line could not be read because the communication channel is closed.
858 */
859static inline int peer_getline(struct appctx *appctx)
860{
861 int n;
862 struct stream_interface *si = appctx->owner;
863
864 n = co_getline(si_oc(si), trash.area, trash.size);
865 if (!n)
866 return 0;
867
868 if (n < 0 || trash.area[n - 1] != '\n') {
869 appctx->st0 = PEER_SESS_ST_END;
870 return -1;
871 }
872
873 if (n > 1 && (trash.area[n - 2] == '\r'))
874 trash.area[n - 2] = 0;
875 else
876 trash.area[n - 1] = 0;
877
878 co_skip(si_oc(si), n);
879
880 return n;
881}
882
883/*
Frédéric Lécailleec44ea82019-01-22 15:54:53 +0100884 * Send a message after having called <peer_prepare_msg> to build it.
885 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
886 * Returns -1 if there was not enough room left to send the message,
887 * any other negative returned value must be considered as an error with an appcxt st0
888 * returned value equal to PEER_SESS_ST_END.
889 */
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100890static inline int peer_send_msg(struct appctx *appctx,
891 int (*peer_prepare_msg)(char *, size_t, struct peer_prep_params *),
892 struct peer_prep_params *params)
Frédéric Lécailleec44ea82019-01-22 15:54:53 +0100893{
894 int ret, msglen;
895 struct stream_interface *si = appctx->owner;
896
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100897 msglen = peer_prepare_msg(trash.area, trash.size, params);
Frédéric Lécailleec44ea82019-01-22 15:54:53 +0100898 if (!msglen) {
899 /* internal error: message does not fit in trash */
900 appctx->st0 = PEER_SESS_ST_END;
901 return 0;
902 }
903
904 /* message to buffer */
905 ret = ci_putblk(si_ic(si), trash.area, msglen);
906 if (ret <= 0) {
907 if (ret == -1) {
908 /* No more write possible */
909 si_rx_room_blk(si);
910 return -1;
911 }
912 appctx->st0 = PEER_SESS_ST_END;
913 }
914
915 return ret;
916}
917
918/*
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +0100919 * Send a hello message.
920 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
921 * Returns -1 if there was not enough room left to send the message,
922 * any other negative returned value must be considered as an error with an appcxt st0
923 * returned value equal to PEER_SESS_ST_END.
924 */
925static inline int peer_send_hellomsg(struct appctx *appctx, struct peer *peer)
926{
927 struct peer_prep_params p = {
928 .hello.peer = peer,
929 };
930
931 return peer_send_msg(appctx, peer_prepare_hellomsg, &p);
932}
933
934/*
935 * Send a success peer handshake status message.
936 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
937 * Returns -1 if there was not enough room left to send the message,
938 * any other negative returned value must be considered as an error with an appcxt st0
939 * returned value equal to PEER_SESS_ST_END.
940 */
941static inline int peer_send_status_successmsg(struct appctx *appctx)
942{
943 return peer_send_msg(appctx, peer_prepare_status_successmsg, NULL);
944}
945
946/*
947 * Send a peer handshake status error message.
948 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
949 * Returns -1 if there was not enough room left to send the message,
950 * any other negative returned value must be considered as an error with an appcxt st0
951 * returned value equal to PEER_SESS_ST_END.
952 */
953static inline int peer_send_status_errormsg(struct appctx *appctx)
954{
955 struct peer_prep_params p = {
956 .error_status.st1 = appctx->st1,
957 };
958
959 return peer_send_msg(appctx, peer_prepare_status_errormsg, &p);
960}
961
962/*
Frédéric Lécailleec44ea82019-01-22 15:54:53 +0100963 * Send a stick-table switch message.
964 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
965 * Returns -1 if there was not enough room left to send the message,
966 * any other negative returned value must be considered as an error with an appcxt st0
967 * returned value equal to PEER_SESS_ST_END.
968 */
969static inline int peer_send_switchmsg(struct shared_table *st, struct appctx *appctx)
970{
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100971 struct peer_prep_params p = {
972 .swtch.shared_table = st,
973 };
974
975 return peer_send_msg(appctx, peer_prepare_switchmsg, &p);
Frédéric Lécailleec44ea82019-01-22 15:54:53 +0100976}
977
978/*
979 * Send a stick-table update acknowledgement message.
980 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
981 * Returns -1 if there was not enough room left to send the message,
982 * any other negative returned value must be considered as an error with an appcxt st0
983 * returned value equal to PEER_SESS_ST_END.
984 */
985static inline int peer_send_ackmsg(struct shared_table *st, struct appctx *appctx)
986{
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +0100987 struct peer_prep_params p = {
988 .ack.shared_table = st,
989 };
990
991 return peer_send_msg(appctx, peer_prepare_ackmsg, &p);
Frédéric Lécailleec44ea82019-01-22 15:54:53 +0100992}
993
994/*
Frédéric Lécaille87f554c2019-01-22 17:26:50 +0100995 * Send a stick-table update message.
996 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
997 * Returns -1 if there was not enough room left to send the message,
998 * any other negative returned value must be considered as an error with an appcxt st0
999 * returned value equal to PEER_SESS_ST_END.
1000 */
1001static inline int peer_send_updatemsg(struct shared_table *st, struct appctx *appctx, struct stksess *ts,
1002 unsigned int updateid, int use_identifier, int use_timed)
1003{
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +01001004 struct peer_prep_params p = {
1005 .updt.stksess = ts,
1006 .updt.shared_table = st,
1007 .updt.updateid = updateid,
1008 .updt.use_identifier = use_identifier,
1009 .updt.use_timed = use_timed,
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +02001010 .updt.peer = appctx->ctx.peers.ptr,
Frédéric Lécailled5fe14b2019-01-24 10:33:40 +01001011 };
1012
1013 return peer_send_msg(appctx, peer_prepare_updatemsg, &p);
Frédéric Lécaille87f554c2019-01-22 17:26:50 +01001014}
1015
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +01001016/*
1017 * Build a peer protocol control class message.
1018 * Returns the number of written bytes used to build the message if succeeded,
1019 * 0 if not.
1020 */
1021static int peer_prepare_control_msg(char *msg, size_t size, struct peer_prep_params *p)
1022{
1023 if (size < sizeof p->control.head)
1024 return 0;
1025
1026 msg[0] = p->control.head[0];
1027 msg[1] = p->control.head[1];
1028
1029 return 2;
1030}
Frédéric Lécaille6a8303d2019-01-22 22:25:17 +01001031
1032/*
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +01001033 * Send a stick-table synchronization request message.
1034 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
1035 * Returns -1 if there was not enough room left to send the message,
1036 * any other negative returned value must be considered as an error with an appctx st0
1037 * returned value equal to PEER_SESS_ST_END.
1038 */
1039static inline int peer_send_resync_reqmsg(struct appctx *appctx)
1040{
1041 struct peer_prep_params p = {
1042 .control.head = { PEER_MSG_CLASS_CONTROL, PEER_MSG_CTRL_RESYNCREQ, },
1043 };
1044
1045 return peer_send_msg(appctx, peer_prepare_control_msg, &p);
1046}
1047
1048/*
1049 * Send a stick-table synchronization confirmation message.
1050 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
1051 * Returns -1 if there was not enough room left to send the message,
1052 * any other negative returned value must be considered as an error with an appctx st0
1053 * returned value equal to PEER_SESS_ST_END.
1054 */
1055static inline int peer_send_resync_confirmsg(struct appctx *appctx)
1056{
1057 struct peer_prep_params p = {
1058 .control.head = { PEER_MSG_CLASS_CONTROL, PEER_MSG_CTRL_RESYNCCONFIRM, },
1059 };
1060
1061 return peer_send_msg(appctx, peer_prepare_control_msg, &p);
1062}
1063
1064/*
1065 * Send a stick-table synchronization finished message.
1066 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
1067 * Returns -1 if there was not enough room left to send the message,
1068 * any other negative returned value must be considered as an error with an appctx st0
1069 * returned value equal to PEER_SESS_ST_END.
1070 */
Emeric Brundeda2a62020-03-16 10:51:01 +01001071static inline int peer_send_resync_finishedmsg(struct appctx *appctx, struct peers *peers)
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +01001072{
1073 struct peer_prep_params p = {
1074 .control.head = { PEER_MSG_CLASS_CONTROL, },
1075 };
1076
Emeric Brundeda2a62020-03-16 10:51:01 +01001077 p.control.head[1] = (peers->flags & PEERS_RESYNC_STATEMASK) == PEERS_RESYNC_FINISHED ?
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +01001078 PEER_MSG_CTRL_RESYNCFINISHED : PEER_MSG_CTRL_RESYNCPARTIAL;
1079
1080 return peer_send_msg(appctx, peer_prepare_control_msg, &p);
1081}
1082
1083/*
Frédéric Lécaille645635d2019-02-11 17:49:39 +01001084 * Send a heartbeat message.
1085 * Return 0 if the message could not be built modifying the appctx st0 to PEER_SESS_ST_END value.
1086 * Returns -1 if there was not enough room left to send the message,
1087 * any other negative returned value must be considered as an error with an appctx st0
1088 * returned value equal to PEER_SESS_ST_END.
1089 */
1090static inline int peer_send_heartbeatmsg(struct appctx *appctx)
1091{
1092 struct peer_prep_params p = {
1093 .control.head = { PEER_MSG_CLASS_CONTROL, PEER_MSG_CTRL_HEARTBEAT, },
1094 };
1095
1096 return peer_send_msg(appctx, peer_prepare_control_msg, &p);
1097}
1098
1099/*
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +01001100 * Build a peer protocol error class message.
1101 * Returns the number of written bytes used to build the message if succeeded,
1102 * 0 if not.
1103 */
1104static int peer_prepare_error_msg(char *msg, size_t size, struct peer_prep_params *p)
1105{
1106 if (size < sizeof p->error.head)
1107 return 0;
1108
1109 msg[0] = p->error.head[0];
1110 msg[1] = p->error.head[1];
1111
1112 return 2;
1113}
1114
1115/*
1116 * Send a "size limit reached" error message.
1117 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
1118 * Returns -1 if there was not enough room left to send the message,
1119 * any other negative returned value must be considered as an error with an appctx st0
1120 * returned value equal to PEER_SESS_ST_END.
1121 */
1122static inline int peer_send_error_size_limitmsg(struct appctx *appctx)
1123{
1124 struct peer_prep_params p = {
1125 .error.head = { PEER_MSG_CLASS_ERROR, PEER_MSG_ERR_SIZELIMIT, },
1126 };
1127
1128 return peer_send_msg(appctx, peer_prepare_error_msg, &p);
1129}
1130
1131/*
1132 * Send a "peer protocol" error message.
1133 * Return 0 if the message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
1134 * Returns -1 if there was not enough room left to send the message,
1135 * any other negative returned value must be considered as an error with an appctx st0
1136 * returned value equal to PEER_SESS_ST_END.
1137 */
1138static inline int peer_send_error_protomsg(struct appctx *appctx)
1139{
1140 struct peer_prep_params p = {
1141 .error.head = { PEER_MSG_CLASS_ERROR, PEER_MSG_ERR_PROTOCOL, },
1142 };
1143
1144 return peer_send_msg(appctx, peer_prepare_error_msg, &p);
1145}
1146
1147/*
Frédéric Lécaille6a8303d2019-01-22 22:25:17 +01001148 * Function used to lookup for recent stick-table updates associated with
1149 * <st> shared stick-table when a lesson must be taught a peer (PEER_F_LEARN_ASSIGN flag set).
1150 */
1151static inline struct stksess *peer_teach_process_stksess_lookup(struct shared_table *st)
1152{
1153 struct eb32_node *eb;
1154
1155 eb = eb32_lookup_ge(&st->table->updates, st->last_pushed+1);
1156 if (!eb) {
1157 eb = eb32_first(&st->table->updates);
1158 if (!eb || ((int)(eb->key - st->last_pushed) <= 0)) {
1159 st->table->commitupdate = st->last_pushed = st->table->localupdate;
1160 return NULL;
1161 }
1162 }
1163
1164 if ((int)(eb->key - st->table->localupdate) > 0) {
1165 st->table->commitupdate = st->last_pushed = st->table->localupdate;
1166 return NULL;
1167 }
1168
1169 return eb32_entry(eb, struct stksess, upd);
1170}
1171
1172/*
1173 * Function used to lookup for recent stick-table updates associated with
1174 * <st> shared stick-table during teach state 1 step.
1175 */
1176static inline struct stksess *peer_teach_stage1_stksess_lookup(struct shared_table *st)
1177{
1178 struct eb32_node *eb;
1179
1180 eb = eb32_lookup_ge(&st->table->updates, st->last_pushed+1);
1181 if (!eb) {
1182 st->flags |= SHTABLE_F_TEACH_STAGE1;
1183 eb = eb32_first(&st->table->updates);
1184 if (eb)
1185 st->last_pushed = eb->key - 1;
1186 return NULL;
1187 }
1188
1189 return eb32_entry(eb, struct stksess, upd);
1190}
1191
1192/*
1193 * Function used to lookup for recent stick-table updates associated with
1194 * <st> shared stick-table during teach state 2 step.
1195 */
1196static inline struct stksess *peer_teach_stage2_stksess_lookup(struct shared_table *st)
1197{
1198 struct eb32_node *eb;
1199
1200 eb = eb32_lookup_ge(&st->table->updates, st->last_pushed+1);
1201 if (!eb || eb->key > st->teaching_origin) {
1202 st->flags |= SHTABLE_F_TEACH_STAGE2;
1203 return NULL;
1204 }
1205
1206 return eb32_entry(eb, struct stksess, upd);
1207}
1208
1209/*
1210 * Generic function to emit update messages for <st> stick-table when a lesson must
1211 * be taught to the peer <p>.
1212 * <locked> must be set to 1 if the shared table <st> is already locked when entering
1213 * this function, 0 if not.
1214 *
1215 * This function temporary unlock/lock <st> when it sends stick-table updates or
1216 * when decrementing its refcount in case of any error when it sends this updates.
1217 *
1218 * Return 0 if any message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
1219 * Returns -1 if there was not enough room left to send the message,
1220 * any other negative returned value must be considered as an error with an appcxt st0
1221 * returned value equal to PEER_SESS_ST_END.
1222 * If it returns 0 or -1, this function leave <st> locked if already locked when entering this function
1223 * unlocked if not already locked when entering this function.
1224 */
1225static inline int peer_send_teachmsgs(struct appctx *appctx, struct peer *p,
1226 struct stksess *(*peer_stksess_lookup)(struct shared_table *),
1227 struct shared_table *st, int locked)
1228{
1229 int ret, new_pushed, use_timed;
1230
1231 ret = 1;
1232 use_timed = 0;
1233 if (st != p->last_local_table) {
1234 ret = peer_send_switchmsg(st, appctx);
1235 if (ret <= 0)
1236 return ret;
1237
1238 p->last_local_table = st;
1239 }
1240
1241 if (peer_stksess_lookup != peer_teach_process_stksess_lookup)
1242 use_timed = !(p->flags & PEER_F_DWNGRD);
1243
1244 /* We force new pushed to 1 to force identifier in update message */
1245 new_pushed = 1;
1246
1247 if (!locked)
1248 HA_SPIN_LOCK(STK_TABLE_LOCK, &st->table->lock);
1249
1250 while (1) {
1251 struct stksess *ts;
1252 unsigned updateid;
1253
1254 /* push local updates */
1255 ts = peer_stksess_lookup(st);
1256 if (!ts)
1257 break;
1258
1259 updateid = ts->upd.key;
1260 ts->ref_cnt++;
1261 HA_SPIN_UNLOCK(STK_TABLE_LOCK, &st->table->lock);
1262
1263 ret = peer_send_updatemsg(st, appctx, ts, updateid, new_pushed, use_timed);
1264 if (ret <= 0) {
1265 HA_SPIN_LOCK(STK_TABLE_LOCK, &st->table->lock);
1266 ts->ref_cnt--;
1267 if (!locked)
1268 HA_SPIN_UNLOCK(STK_TABLE_LOCK, &st->table->lock);
1269 return ret;
1270 }
1271
1272 HA_SPIN_LOCK(STK_TABLE_LOCK, &st->table->lock);
1273 ts->ref_cnt--;
1274 st->last_pushed = updateid;
1275
1276 if (peer_stksess_lookup == peer_teach_process_stksess_lookup &&
1277 (int)(st->last_pushed - st->table->commitupdate) > 0)
1278 st->table->commitupdate = st->last_pushed;
1279
1280 /* identifier may not needed in next update message */
1281 new_pushed = 0;
1282 }
1283
1284 out:
1285 if (!locked)
1286 HA_SPIN_UNLOCK(STK_TABLE_LOCK, &st->table->lock);
1287 return 1;
1288}
1289
1290/*
1291 * Function to emit update messages for <st> stick-table when a lesson must
1292 * be taught to the peer <p> (PEER_F_LEARN_ASSIGN flag set).
1293 *
1294 * Note that <st> shared stick-table is locked when calling this function.
1295 *
1296 * Return 0 if any message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
1297 * Returns -1 if there was not enough room left to send the message,
1298 * any other negative returned value must be considered as an error with an appcxt st0
1299 * returned value equal to PEER_SESS_ST_END.
1300 */
1301static inline int peer_send_teach_process_msgs(struct appctx *appctx, struct peer *p,
1302 struct shared_table *st)
1303{
1304 return peer_send_teachmsgs(appctx, p, peer_teach_process_stksess_lookup, st, 1);
1305}
1306
1307/*
1308 * Function to emit update messages for <st> stick-table when a lesson must
1309 * be taught to the peer <p> during teach state 1 step.
1310 *
1311 * Return 0 if any message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
1312 * Returns -1 if there was not enough room left to send the message,
1313 * any other negative returned value must be considered as an error with an appcxt st0
1314 * returned value equal to PEER_SESS_ST_END.
1315 */
1316static inline int peer_send_teach_stage1_msgs(struct appctx *appctx, struct peer *p,
1317 struct shared_table *st)
1318{
1319 return peer_send_teachmsgs(appctx, p, peer_teach_stage1_stksess_lookup, st, 0);
1320}
1321
1322/*
1323 * Function to emit update messages for <st> stick-table when a lesson must
1324 * be taught to the peer <p> during teach state 1 step.
1325 *
1326 * Return 0 if any message could not be built modifying the appcxt st0 to PEER_SESS_ST_END value.
1327 * Returns -1 if there was not enough room left to send the message,
1328 * any other negative returned value must be considered as an error with an appcxt st0
1329 * returned value equal to PEER_SESS_ST_END.
1330 */
1331static inline int peer_send_teach_stage2_msgs(struct appctx *appctx, struct peer *p,
1332 struct shared_table *st)
1333{
1334 return peer_send_teachmsgs(appctx, p, peer_teach_stage2_stksess_lookup, st, 0);
1335}
1336
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001337
1338/*
1339 * Function used to parse a stick-table update message after it has been received
1340 * by <p> peer with <msg_cur> as address of the pointer to the position in the
1341 * receipt buffer with <msg_end> being position of the end of the stick-table message.
1342 * Update <msg_curr> accordingly to the peer protocol specs if no peer protocol error
1343 * was encountered.
1344 * <exp> must be set if the stick-table entry expires.
1345 * <updt> must be set for PEER_MSG_STKT_UPDATE or PEER_MSG_STKT_UPDATE_TIMED stick-table
1346 * messages, in this case the stick-table udpate message is received with a stick-table
1347 * update ID.
1348 * <totl> is the length of the stick-table update message computed upon receipt.
1349 */
Frédéric Lécaille444243c2019-01-24 15:40:11 +01001350static int peer_treat_updatemsg(struct appctx *appctx, struct peer *p, int updt, int exp,
1351 char **msg_cur, char *msg_end, int msg_len, int totl)
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001352{
1353 struct stream_interface *si = appctx->owner;
1354 struct shared_table *st = p->remote_table;
1355 struct stksess *ts, *newts;
1356 uint32_t update;
1357 int expire;
1358 unsigned int data_type;
1359 void *data_ptr;
1360
1361 /* Here we have data message */
1362 if (!st)
1363 goto ignore_msg;
1364
1365 expire = MS_TO_TICKS(st->table->expire);
1366
1367 if (updt) {
Willy Tarreau1e82a142019-01-29 11:08:06 +01001368 if (msg_len < sizeof(update))
1369 goto malformed_exit;
1370
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001371 memcpy(&update, *msg_cur, sizeof(update));
1372 *msg_cur += sizeof(update);
1373 st->last_get = htonl(update);
1374 }
1375 else {
1376 st->last_get++;
1377 }
1378
1379 if (exp) {
1380 size_t expire_sz = sizeof expire;
1381
Willy Tarreau1e82a142019-01-29 11:08:06 +01001382 if (*msg_cur + expire_sz > msg_end)
1383 goto malformed_exit;
1384
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001385 memcpy(&expire, *msg_cur, expire_sz);
1386 *msg_cur += expire_sz;
1387 expire = ntohl(expire);
1388 }
1389
1390 newts = stksess_new(st->table, NULL);
1391 if (!newts)
1392 goto ignore_msg;
1393
1394 if (st->table->type == SMP_T_STR) {
1395 unsigned int to_read, to_store;
1396
1397 to_read = intdecode(msg_cur, msg_end);
Willy Tarreau1e82a142019-01-29 11:08:06 +01001398 if (!*msg_cur)
1399 goto malformed_free_newts;
1400
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001401 to_store = MIN(to_read, st->table->key_size - 1);
Willy Tarreau1e82a142019-01-29 11:08:06 +01001402 if (*msg_cur + to_store > msg_end)
1403 goto malformed_free_newts;
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001404
1405 memcpy(newts->key.key, *msg_cur, to_store);
1406 newts->key.key[to_store] = 0;
1407 *msg_cur += to_read;
1408 }
1409 else if (st->table->type == SMP_T_SINT) {
1410 unsigned int netinteger;
1411
Willy Tarreau1e82a142019-01-29 11:08:06 +01001412 if (*msg_cur + sizeof(netinteger) > msg_end)
1413 goto malformed_free_newts;
1414
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001415 memcpy(&netinteger, *msg_cur, sizeof(netinteger));
1416 netinteger = ntohl(netinteger);
1417 memcpy(newts->key.key, &netinteger, sizeof(netinteger));
1418 *msg_cur += sizeof(netinteger);
1419 }
1420 else {
Willy Tarreau1e82a142019-01-29 11:08:06 +01001421 if (*msg_cur + st->table->key_size > msg_end)
1422 goto malformed_free_newts;
1423
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001424 memcpy(newts->key.key, *msg_cur, st->table->key_size);
1425 *msg_cur += st->table->key_size;
1426 }
1427
1428 /* lookup for existing entry */
1429 ts = stktable_set_entry(st->table, newts);
1430 if (ts != newts) {
1431 stksess_free(st->table, newts);
1432 newts = NULL;
1433 }
1434
1435 HA_RWLOCK_WRLOCK(STK_SESS_LOCK, &ts->lock);
1436
1437 for (data_type = 0 ; data_type < STKTABLE_DATA_TYPES ; data_type++) {
Willy Tarreau1e82a142019-01-29 11:08:06 +01001438 uint64_t decoded_int;
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001439
1440 if (!((1 << data_type) & st->remote_data))
1441 continue;
1442
Willy Tarreau1e82a142019-01-29 11:08:06 +01001443 decoded_int = intdecode(msg_cur, msg_end);
1444 if (!*msg_cur)
1445 goto malformed_unlock;
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001446
Willy Tarreau1e82a142019-01-29 11:08:06 +01001447 switch (stktable_data_types[data_type].std_type) {
1448 case STD_T_SINT:
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001449 data_ptr = stktable_data_ptr(st->table, ts, data_type);
1450 if (data_ptr)
Willy Tarreau1e82a142019-01-29 11:08:06 +01001451 stktable_data_cast(data_ptr, std_t_sint) = decoded_int;
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001452 break;
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001453
Willy Tarreau1e82a142019-01-29 11:08:06 +01001454 case STD_T_UINT:
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001455 data_ptr = stktable_data_ptr(st->table, ts, data_type);
1456 if (data_ptr)
Willy Tarreau1e82a142019-01-29 11:08:06 +01001457 stktable_data_cast(data_ptr, std_t_uint) = decoded_int;
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001458 break;
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001459
Willy Tarreau1e82a142019-01-29 11:08:06 +01001460 case STD_T_ULL:
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001461 data_ptr = stktable_data_ptr(st->table, ts, data_type);
1462 if (data_ptr)
Willy Tarreau1e82a142019-01-29 11:08:06 +01001463 stktable_data_cast(data_ptr, std_t_ull) = decoded_int;
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001464 break;
Willy Tarreau1e82a142019-01-29 11:08:06 +01001465
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001466 case STD_T_FRQP: {
1467 struct freq_ctr_period data;
1468
1469 /* First bit is reserved for the freq_ctr_period lock
1470 Note: here we're still protected by the stksess lock
1471 so we don't need to update the update the freq_ctr_period
1472 using its internal lock */
1473
Willy Tarreau1e82a142019-01-29 11:08:06 +01001474 data.curr_tick = tick_add(now_ms, -decoded_int) & ~0x1;
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001475 data.curr_ctr = intdecode(msg_cur, msg_end);
Willy Tarreau1e82a142019-01-29 11:08:06 +01001476 if (!*msg_cur)
1477 goto malformed_unlock;
1478
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001479 data.prev_ctr = intdecode(msg_cur, msg_end);
Willy Tarreau1e82a142019-01-29 11:08:06 +01001480 if (!*msg_cur)
1481 goto malformed_unlock;
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001482
1483 data_ptr = stktable_data_ptr(st->table, ts, data_type);
1484 if (data_ptr)
1485 stktable_data_cast(data_ptr, std_t_frqp) = data;
1486 break;
1487 }
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +02001488 case STD_T_DICT: {
1489 struct buffer *chunk;
1490 size_t data_len, value_len;
1491 unsigned int id;
1492 struct dict_entry *de;
1493 struct dcache *dc;
Frédéric Lécaille344e9482019-06-05 10:20:09 +02001494 char *end;
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +02001495
Frédéric Lécailled9203ca2019-11-13 17:50:34 +01001496 if (!decoded_int) {
1497 /* No entry. */
1498 break;
1499 }
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +02001500 data_len = decoded_int;
1501 if (*msg_cur + data_len > msg_end)
1502 goto malformed_unlock;
1503
Frédéric Lécaille344e9482019-06-05 10:20:09 +02001504 /* Compute the end of the current data, <msg_end> being at the end of
1505 * the entire message.
1506 */
1507 end = *msg_cur + data_len;
1508 id = intdecode(msg_cur, end);
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +02001509 if (!*msg_cur || !id)
1510 goto malformed_unlock;
1511
1512 dc = p->dcache;
Frédéric Lécaille344e9482019-06-05 10:20:09 +02001513 if (*msg_cur == end) {
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +02001514 /* Dictionary entry key without value. */
Frédéric Lécaille506fe342020-11-12 19:53:11 +01001515 if (id > dc->max_entries) {
1516 goto malformed_unlock;
1517 }
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +02001518 /* IDs sent over the network are numbered from 1. */
1519 de = dc->rx[id - 1].de;
1520 }
1521 else {
1522 chunk = get_trash_chunk();
Frédéric Lécaille344e9482019-06-05 10:20:09 +02001523 value_len = intdecode(msg_cur, end);
1524 if (!*msg_cur || *msg_cur + value_len > end ||
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +02001525 unlikely(value_len + 1 >= chunk->size))
1526 goto malformed_unlock;
1527
1528 chunk_memcpy(chunk, *msg_cur, value_len);
1529 chunk->area[chunk->data] = '\0';
Frédéric Lécaille56aec0d2019-06-06 14:14:15 +02001530 *msg_cur += value_len;
1531
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +02001532 de = dict_insert(&server_name_dict, chunk->area);
1533 dc->rx[id - 1].de = de;
1534 }
1535 if (de) {
1536 data_ptr = stktable_data_ptr(st->table, ts, data_type);
1537 if (data_ptr)
1538 stktable_data_cast(data_ptr, std_t_dict) = de;
1539 }
1540 break;
1541 }
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001542 }
1543 }
1544 /* Force new expiration */
1545 ts->expire = tick_add(now_ms, expire);
1546
1547 HA_RWLOCK_WRUNLOCK(STK_SESS_LOCK, &ts->lock);
1548 stktable_touch_remote(st->table, ts, 1);
1549 return 1;
1550
1551 ignore_msg:
1552 /* skip consumed message */
1553 co_skip(si_oc(si), totl);
1554 return 0;
Willy Tarreau1e82a142019-01-29 11:08:06 +01001555
1556 malformed_unlock:
1557 /* malformed message */
1558 HA_RWLOCK_WRUNLOCK(STK_SESS_LOCK, &ts->lock);
1559 stktable_touch_remote(st->table, ts, 1);
1560 appctx->st0 = PEER_SESS_ST_ERRPROTO;
1561 return 0;
1562
1563 malformed_free_newts:
1564 /* malformed message */
1565 stksess_free(st->table, newts);
1566 malformed_exit:
1567 appctx->st0 = PEER_SESS_ST_ERRPROTO;
1568 return 0;
Frédéric Lécaille168a34b2019-01-23 11:16:57 +01001569}
1570
Frédéric Lécaille87f554c2019-01-22 17:26:50 +01001571/*
Frédéric Lécailled27b0942019-01-23 17:31:37 +01001572 * Function used to parse a stick-table update acknowledgement message after it
1573 * has been received by <p> peer with <msg_cur> as address of the pointer to the position in the
1574 * receipt buffer with <msg_end> being the position of the end of the stick-table message.
1575 * Update <msg_curr> accordingly to the peer protocol specs if no peer protocol error
1576 * was encountered.
1577 * Return 1 if succeeded, 0 if not with the appctx state st0 set to PEER_SESS_ST_ERRPROTO.
1578 */
1579static inline int peer_treat_ackmsg(struct appctx *appctx, struct peer *p,
1580 char **msg_cur, char *msg_end)
1581{
1582 /* ack message */
1583 uint32_t table_id ;
1584 uint32_t update;
1585 struct shared_table *st;
1586
1587 table_id = intdecode(msg_cur, msg_end);
1588 if (!*msg_cur || (*msg_cur + sizeof(update) > msg_end)) {
1589 /* malformed message */
1590 appctx->st0 = PEER_SESS_ST_ERRPROTO;
1591 return 0;
1592 }
1593
1594 memcpy(&update, *msg_cur, sizeof(update));
1595 update = ntohl(update);
1596
1597 for (st = p->tables; st; st = st->next) {
1598 if (st->local_id == table_id) {
1599 st->update = update;
1600 break;
1601 }
1602 }
1603
1604 return 1;
1605}
1606
1607/*
1608 * Function used to parse a stick-table switch message after it has been received
1609 * by <p> peer with <msg_cur> as address of the pointer to the position in the
1610 * receipt buffer with <msg_end> being the position of the end of the stick-table message.
1611 * Update <msg_curr> accordingly to the peer protocol specs if no peer protocol error
1612 * was encountered.
1613 * Return 1 if succeeded, 0 if not with the appctx state st0 set to PEER_SESS_ST_ERRPROTO.
1614 */
1615static inline int peer_treat_switchmsg(struct appctx *appctx, struct peer *p,
1616 char **msg_cur, char *msg_end)
1617{
1618 struct shared_table *st;
1619 int table_id;
1620
1621 table_id = intdecode(msg_cur, msg_end);
1622 if (!*msg_cur) {
1623 /* malformed message */
1624 appctx->st0 = PEER_SESS_ST_ERRPROTO;
1625 return 0;
1626 }
1627
1628 p->remote_table = NULL;
1629 for (st = p->tables; st; st = st->next) {
1630 if (st->remote_id == table_id) {
1631 p->remote_table = st;
1632 break;
1633 }
1634 }
1635
1636 return 1;
1637}
1638
1639/*
1640 * Function used to parse a stick-table definition message after it has been received
1641 * by <p> peer with <msg_cur> as address of the pointer to the position in the
1642 * receipt buffer with <msg_end> being the position of the end of the stick-table message.
1643 * Update <msg_curr> accordingly to the peer protocol specs if no peer protocol error
1644 * was encountered.
1645 * <totl> is the length of the stick-table update message computed upon receipt.
1646 * Return 1 if succeeded, 0 if not with the appctx state st0 set to PEER_SESS_ST_ERRPROTO.
1647 */
1648static inline int peer_treat_definemsg(struct appctx *appctx, struct peer *p,
1649 char **msg_cur, char *msg_end, int totl)
1650{
1651 struct stream_interface *si = appctx->owner;
1652 int table_id_len;
1653 struct shared_table *st;
1654 int table_type;
1655 int table_keylen;
1656 int table_id;
1657 uint64_t table_data;
1658
1659 table_id = intdecode(msg_cur, msg_end);
Willy Tarreau6f731f32019-01-29 11:11:23 +01001660 if (!*msg_cur)
1661 goto malformed_exit;
Frédéric Lécailled27b0942019-01-23 17:31:37 +01001662
1663 table_id_len = intdecode(msg_cur, msg_end);
Willy Tarreau6f731f32019-01-29 11:11:23 +01001664 if (!*msg_cur)
1665 goto malformed_exit;
Frédéric Lécailled27b0942019-01-23 17:31:37 +01001666
1667 p->remote_table = NULL;
Willy Tarreau6f731f32019-01-29 11:11:23 +01001668 if (!table_id_len || (*msg_cur + table_id_len) >= msg_end)
1669 goto malformed_exit;
Frédéric Lécailled27b0942019-01-23 17:31:37 +01001670
1671 for (st = p->tables; st; st = st->next) {
1672 /* Reset IDs */
1673 if (st->remote_id == table_id)
1674 st->remote_id = 0;
1675
Frédéric Lécaille7fcc24d2019-03-20 15:09:45 +01001676 if (!p->remote_table && (table_id_len == strlen(st->table->nid)) &&
1677 (memcmp(st->table->nid, *msg_cur, table_id_len) == 0))
Frédéric Lécailled27b0942019-01-23 17:31:37 +01001678 p->remote_table = st;
1679 }
1680
1681 if (!p->remote_table)
1682 goto ignore_msg;
1683
1684 *msg_cur += table_id_len;
Willy Tarreau6f731f32019-01-29 11:11:23 +01001685 if (*msg_cur >= msg_end)
1686 goto malformed_exit;
Frédéric Lécailled27b0942019-01-23 17:31:37 +01001687
1688 table_type = intdecode(msg_cur, msg_end);
Willy Tarreau6f731f32019-01-29 11:11:23 +01001689 if (!*msg_cur)
1690 goto malformed_exit;
Frédéric Lécailled27b0942019-01-23 17:31:37 +01001691
1692 table_keylen = intdecode(msg_cur, msg_end);
Willy Tarreau6f731f32019-01-29 11:11:23 +01001693 if (!*msg_cur)
1694 goto malformed_exit;
Frédéric Lécailled27b0942019-01-23 17:31:37 +01001695
1696 table_data = intdecode(msg_cur, msg_end);
Willy Tarreau6f731f32019-01-29 11:11:23 +01001697 if (!*msg_cur)
1698 goto malformed_exit;
Frédéric Lécailled27b0942019-01-23 17:31:37 +01001699
Emeric Brunc329cd02020-06-02 11:17:42 +02001700 if (p->remote_table->table->type != peer_int_key_type[table_type]
Frédéric Lécailled27b0942019-01-23 17:31:37 +01001701 || p->remote_table->table->key_size != table_keylen) {
1702 p->remote_table = NULL;
1703 goto ignore_msg;
1704 }
1705
1706 p->remote_table->remote_data = table_data;
1707 p->remote_table->remote_id = table_id;
1708 return 1;
1709
1710 ignore_msg:
1711 co_skip(si_oc(si), totl);
1712 return 0;
Willy Tarreau6f731f32019-01-29 11:11:23 +01001713
1714 malformed_exit:
1715 /* malformed message */
1716 appctx->st0 = PEER_SESS_ST_ERRPROTO;
1717 return 0;
Frédéric Lécailled27b0942019-01-23 17:31:37 +01001718}
1719
1720/*
Willy Tarreaue6ea2a62020-11-13 14:10:20 +01001721 * Receive a stick-table message or pre-parse any other message.
1722 * The message's header will be sent into <msg_head> which must be at least
1723 * <msg_head_sz> bytes long (at least 7 to store 32-bit variable lengths).
1724 * The first two bytes are always read, and the rest is only read if the
1725 * first bytes indicate a stick-table message. If the message is a stick-table
1726 * message, the varint is decoded and the equivalent number of bytes will be
1727 * copied into the trash at trash.area. <totl> is incremented by the number of
1728 * bytes read EVEN IN CASE OF INCOMPLETE MESSAGES.
Frédéric Lécaille95203f22019-01-23 19:38:11 +01001729 * Returns 1 if there was no error, if not, returns 0 if not enough data were available,
1730 * -1 if there was an error updating the appctx state st0 accordingly.
1731 */
1732static inline int peer_recv_msg(struct appctx *appctx, char *msg_head, size_t msg_head_sz,
1733 uint32_t *msg_len, int *totl)
1734{
1735 int reql;
1736 struct stream_interface *si = appctx->owner;
Willy Tarreaue6ea2a62020-11-13 14:10:20 +01001737 char *cur;
Frédéric Lécaille95203f22019-01-23 19:38:11 +01001738
1739 reql = co_getblk(si_oc(si), msg_head, 2 * sizeof(char), *totl);
1740 if (reql <= 0) /* closed or EOL not found */
1741 goto incomplete;
1742
1743 *totl += reql;
1744
Frédéric Lécaille36fb77e2019-06-04 08:28:19 +02001745 if (!(msg_head[1] & PEER_MSG_STKT_BIT_MASK))
Frédéric Lécaille95203f22019-01-23 19:38:11 +01001746 return 1;
1747
Willy Tarreaue6ea2a62020-11-13 14:10:20 +01001748 /* This is a stick-table message, let's go on */
1749
Frédéric Lécaille95203f22019-01-23 19:38:11 +01001750 /* Read and Decode message length */
Willy Tarreaue6ea2a62020-11-13 14:10:20 +01001751 msg_head += *totl;
1752 msg_head_sz -= *totl;
1753 reql = co_data(si_oc(si)) - *totl;
1754 if (reql > msg_head_sz)
1755 reql = msg_head_sz;
1756
1757 reql = co_getblk(si_oc(si), msg_head, reql, *totl);
Frédéric Lécaille95203f22019-01-23 19:38:11 +01001758 if (reql <= 0) /* closed */
1759 goto incomplete;
1760
Willy Tarreaue6ea2a62020-11-13 14:10:20 +01001761 cur = msg_head;
1762 *msg_len = intdecode(&cur, cur + reql);
1763 if (!cur) {
1764 /* the number is truncated, did we read enough ? */
1765 if (reql < msg_head_sz)
1766 goto incomplete;
Frédéric Lécaille95203f22019-01-23 19:38:11 +01001767
Willy Tarreaue6ea2a62020-11-13 14:10:20 +01001768 /* malformed message */
1769 appctx->st0 = PEER_SESS_ST_ERRPROTO;
1770 return -1;
Frédéric Lécaille95203f22019-01-23 19:38:11 +01001771 }
Willy Tarreaue6ea2a62020-11-13 14:10:20 +01001772 *totl += cur - msg_head;
Frédéric Lécaille95203f22019-01-23 19:38:11 +01001773
1774 /* Read message content */
1775 if (*msg_len) {
1776 if (*msg_len > trash.size) {
1777 /* Status code is not success, abort */
1778 appctx->st0 = PEER_SESS_ST_ERRSIZE;
1779 return -1;
1780 }
1781
1782 reql = co_getblk(si_oc(si), trash.area, *msg_len, *totl);
1783 if (reql <= 0) /* closed */
1784 goto incomplete;
1785 *totl += reql;
1786 }
1787
1788 return 1;
1789
1790 incomplete:
Willy Tarreau3660fae2020-11-26 17:06:04 +01001791 if (reql < 0 || (si_oc(si)->flags & (CF_SHUTW|CF_SHUTW_NOW))) {
1792 /* there was an error or the message was truncated */
Frédéric Lécaille95203f22019-01-23 19:38:11 +01001793 appctx->st0 = PEER_SESS_ST_END;
1794 return -1;
1795 }
1796
1797 return 0;
1798}
Frédéric Lécaille444243c2019-01-24 15:40:11 +01001799
1800/*
1801 * Treat the awaited message with <msg_head> as header.*
1802 * Return 1 if succeeded, 0 if not.
1803 */
1804static inline int peer_treat_awaited_msg(struct appctx *appctx, struct peer *peer, unsigned char *msg_head,
1805 char **msg_cur, char *msg_end, int msg_len, int totl)
1806{
1807 struct stream_interface *si = appctx->owner;
1808 struct stream *s = si_strm(si);
1809 struct peers *peers = strm_fe(s)->parent;
1810
1811 if (msg_head[0] == PEER_MSG_CLASS_CONTROL) {
1812 if (msg_head[1] == PEER_MSG_CTRL_RESYNCREQ) {
1813 struct shared_table *st;
1814 /* Reset message: remote need resync */
1815
1816 /* prepare tables fot a global push */
1817 for (st = peer->tables; st; st = st->next) {
1818 st->teaching_origin = st->last_pushed = st->table->update;
1819 st->flags = 0;
1820 }
1821
1822 /* reset teaching flags to 0 */
1823 peer->flags &= PEER_TEACH_RESET;
1824
1825 /* flag to start to teach lesson */
1826 peer->flags |= PEER_F_TEACH_PROCESS;
1827 }
1828 else if (msg_head[1] == PEER_MSG_CTRL_RESYNCFINISHED) {
1829 if (peer->flags & PEER_F_LEARN_ASSIGN) {
1830 peer->flags &= ~PEER_F_LEARN_ASSIGN;
1831 peers->flags &= ~(PEERS_F_RESYNC_ASSIGN|PEERS_F_RESYNC_PROCESS);
1832 peers->flags |= (PEERS_F_RESYNC_LOCAL|PEERS_F_RESYNC_REMOTE);
1833 }
1834 peer->confirm++;
1835 }
1836 else if (msg_head[1] == PEER_MSG_CTRL_RESYNCPARTIAL) {
1837 if (peer->flags & PEER_F_LEARN_ASSIGN) {
1838 peer->flags &= ~PEER_F_LEARN_ASSIGN;
1839 peers->flags &= ~(PEERS_F_RESYNC_ASSIGN|PEERS_F_RESYNC_PROCESS);
1840
1841 peer->flags |= PEER_F_LEARN_NOTUP2DATE;
Frédéric Lécaille54bff832019-03-26 10:25:20 +01001842 peers->resync_timeout = tick_add(now_ms, MS_TO_TICKS(PEER_RESYNC_TIMEOUT));
Frédéric Lécaille444243c2019-01-24 15:40:11 +01001843 task_wakeup(peers->sync_task, TASK_WOKEN_MSG);
1844 }
1845 peer->confirm++;
1846 }
1847 else if (msg_head[1] == PEER_MSG_CTRL_RESYNCCONFIRM) {
1848 struct shared_table *st;
1849
1850 /* If stopping state */
1851 if (stopping) {
1852 /* Close session, push resync no more needed */
1853 peer->flags |= PEER_F_TEACH_COMPLETE;
1854 appctx->st0 = PEER_SESS_ST_END;
1855 return 0;
1856 }
1857 for (st = peer->tables; st; st = st->next) {
1858 st->update = st->last_pushed = st->teaching_origin;
1859 st->flags = 0;
1860 }
1861
1862 /* reset teaching flags to 0 */
1863 peer->flags &= PEER_TEACH_RESET;
1864 }
Frédéric Lécaille645635d2019-02-11 17:49:39 +01001865 else if (msg_head[1] == PEER_MSG_CTRL_HEARTBEAT) {
Frédéric Lécaille54bff832019-03-26 10:25:20 +01001866 peer->reconnect = tick_add(now_ms, MS_TO_TICKS(PEER_RECONNECT_TIMEOUT));
Frédéric Lécaille5d072702019-11-06 11:51:26 +01001867 peer->rx_hbt++;
Frédéric Lécaille645635d2019-02-11 17:49:39 +01001868 }
Frédéric Lécaille444243c2019-01-24 15:40:11 +01001869 }
1870 else if (msg_head[0] == PEER_MSG_CLASS_STICKTABLE) {
1871 if (msg_head[1] == PEER_MSG_STKT_DEFINE) {
1872 if (!peer_treat_definemsg(appctx, peer, msg_cur, msg_end, totl))
1873 return 0;
1874 }
1875 else if (msg_head[1] == PEER_MSG_STKT_SWITCH) {
1876 if (!peer_treat_switchmsg(appctx, peer, msg_cur, msg_end))
1877 return 0;
1878 }
1879 else if (msg_head[1] == PEER_MSG_STKT_UPDATE ||
1880 msg_head[1] == PEER_MSG_STKT_INCUPDATE ||
1881 msg_head[1] == PEER_MSG_STKT_UPDATE_TIMED ||
1882 msg_head[1] == PEER_MSG_STKT_INCUPDATE_TIMED) {
1883 int update, expire;
1884
1885 update = msg_head[1] == PEER_MSG_STKT_UPDATE || msg_head[1] == PEER_MSG_STKT_UPDATE_TIMED;
1886 expire = msg_head[1] == PEER_MSG_STKT_UPDATE_TIMED || msg_head[1] == PEER_MSG_STKT_INCUPDATE_TIMED;
1887 if (!peer_treat_updatemsg(appctx, peer, update, expire,
1888 msg_cur, msg_end, msg_len, totl))
1889 return 0;
1890
1891 }
1892 else if (msg_head[1] == PEER_MSG_STKT_ACK) {
1893 if (!peer_treat_ackmsg(appctx, peer, msg_cur, msg_end))
1894 return 0;
1895 }
1896 }
1897 else if (msg_head[0] == PEER_MSG_CLASS_RESERVED) {
1898 appctx->st0 = PEER_SESS_ST_ERRPROTO;
1899 return 0;
1900 }
1901
1902 return 1;
1903}
Frédéric Lécaille25e1d5e2019-01-24 17:33:48 +01001904
1905
1906/*
1907 * Send any message to <peer> peer.
1908 * Returns 1 if succeeded, or -1 or 0 if failed.
1909 * -1 means an internal error occured, 0 is for a peer protocol error leading
1910 * to a peer state change (from the peer I/O handler point of view).
1911 */
1912static inline int peer_send_msgs(struct appctx *appctx, struct peer *peer)
1913{
1914 int repl;
1915 struct stream_interface *si = appctx->owner;
1916 struct stream *s = si_strm(si);
1917 struct peers *peers = strm_fe(s)->parent;
1918
1919 /* Need to request a resync */
1920 if ((peer->flags & PEER_F_LEARN_ASSIGN) &&
1921 (peers->flags & PEERS_F_RESYNC_ASSIGN) &&
1922 !(peers->flags & PEERS_F_RESYNC_PROCESS)) {
1923
1924 repl = peer_send_resync_reqmsg(appctx);
1925 if (repl <= 0)
1926 return repl;
1927
1928 peers->flags |= PEERS_F_RESYNC_PROCESS;
1929 }
1930
1931 /* Nothing to read, now we start to write */
1932 if (peer->tables) {
1933 struct shared_table *st;
1934 struct shared_table *last_local_table;
1935
1936 last_local_table = peer->last_local_table;
1937 if (!last_local_table)
1938 last_local_table = peer->tables;
1939 st = last_local_table->next;
1940
1941 while (1) {
1942 if (!st)
1943 st = peer->tables;
1944
1945 /* It remains some updates to ack */
1946 if (st->last_get != st->last_acked) {
1947 repl = peer_send_ackmsg(st, appctx);
1948 if (repl <= 0)
1949 return repl;
1950
1951 st->last_acked = st->last_get;
1952 }
1953
1954 if (!(peer->flags & PEER_F_TEACH_PROCESS)) {
1955 HA_SPIN_LOCK(STK_TABLE_LOCK, &st->table->lock);
1956 if (!(peer->flags & PEER_F_LEARN_ASSIGN) &&
1957 ((int)(st->last_pushed - st->table->localupdate) < 0)) {
1958
1959 repl = peer_send_teach_process_msgs(appctx, peer, st);
1960 if (repl <= 0) {
1961 HA_SPIN_UNLOCK(STK_TABLE_LOCK, &st->table->lock);
1962 return repl;
1963 }
1964 }
1965 HA_SPIN_UNLOCK(STK_TABLE_LOCK, &st->table->lock);
1966 }
1967 else {
1968 if (!(st->flags & SHTABLE_F_TEACH_STAGE1)) {
1969 repl = peer_send_teach_stage1_msgs(appctx, peer, st);
1970 if (repl <= 0)
1971 return repl;
1972 }
1973
1974 if (!(st->flags & SHTABLE_F_TEACH_STAGE2)) {
1975 repl = peer_send_teach_stage2_msgs(appctx, peer, st);
1976 if (repl <= 0)
1977 return repl;
1978 }
1979 }
1980
1981 if (st == last_local_table)
1982 break;
1983 st = st->next;
1984 }
1985 }
1986
1987 if ((peer->flags & PEER_F_TEACH_PROCESS) && !(peer->flags & PEER_F_TEACH_FINISHED)) {
Emeric Brundeda2a62020-03-16 10:51:01 +01001988 repl = peer_send_resync_finishedmsg(appctx, peers);
Frédéric Lécaille25e1d5e2019-01-24 17:33:48 +01001989 if (repl <= 0)
1990 return repl;
1991
1992 /* flag finished message sent */
1993 peer->flags |= PEER_F_TEACH_FINISHED;
1994 }
1995
1996 /* Confirm finished or partial messages */
1997 while (peer->confirm) {
1998 repl = peer_send_resync_confirmsg(appctx);
1999 if (repl <= 0)
2000 return repl;
2001
2002 peer->confirm--;
2003 }
2004
2005 return 1;
2006}
2007
Frédéric Lécaille95203f22019-01-23 19:38:11 +01002008/*
Frédéric Lécaille3f0fb9d2019-01-25 08:30:29 +01002009 * Read and parse a first line of a "hello" peer protocol message.
2010 * Returns 0 if could not read a line, -1 if there was a read error or
2011 * the line is malformed, 1 if succeeded.
2012 */
2013static inline int peer_getline_version(struct appctx *appctx,
2014 unsigned int *maj_ver, unsigned int *min_ver)
2015{
2016 int reql;
2017
2018 reql = peer_getline(appctx);
2019 if (!reql)
2020 return 0;
2021
2022 if (reql < 0)
2023 return -1;
2024
2025 /* test protocol */
2026 if (strncmp(PEER_SESSION_PROTO_NAME " ", trash.area, proto_len + 1) != 0) {
2027 appctx->st0 = PEER_SESS_ST_EXIT;
2028 appctx->st1 = PEER_SESS_SC_ERRPROTO;
2029 return -1;
2030 }
2031 if (peer_get_version(trash.area + proto_len + 1, maj_ver, min_ver) == -1 ||
2032 *maj_ver != PEER_MAJOR_VER || *min_ver > PEER_MINOR_VER) {
2033 appctx->st0 = PEER_SESS_ST_EXIT;
2034 appctx->st1 = PEER_SESS_SC_ERRVERSION;
2035 return -1;
2036 }
2037
2038 return 1;
2039}
2040
2041/*
2042 * Read and parse a second line of a "hello" peer protocol message.
2043 * Returns 0 if could not read a line, -1 if there was a read error or
2044 * the line is malformed, 1 if succeeded.
2045 */
2046static inline int peer_getline_host(struct appctx *appctx)
2047{
2048 int reql;
2049
2050 reql = peer_getline(appctx);
2051 if (!reql)
2052 return 0;
2053
2054 if (reql < 0)
2055 return -1;
2056
2057 /* test hostname match */
2058 if (strcmp(localpeer, trash.area) != 0) {
2059 appctx->st0 = PEER_SESS_ST_EXIT;
2060 appctx->st1 = PEER_SESS_SC_ERRHOST;
2061 return -1;
2062 }
2063
2064 return 1;
2065}
2066
2067/*
2068 * Read and parse a last line of a "hello" peer protocol message.
2069 * Returns 0 if could not read a character, -1 if there was a read error or
2070 * the line is malformed, 1 if succeeded.
2071 * Set <curpeer> accordingly (the remote peer sending the "hello" message).
2072 */
2073static inline int peer_getline_last(struct appctx *appctx, struct peer **curpeer)
2074{
2075 char *p;
2076 int reql;
2077 struct peer *peer;
2078 struct stream_interface *si = appctx->owner;
2079 struct stream *s = si_strm(si);
2080 struct peers *peers = strm_fe(s)->parent;
2081
2082 reql = peer_getline(appctx);
2083 if (!reql)
2084 return 0;
2085
2086 if (reql < 0)
2087 return -1;
2088
2089 /* parse line "<peer name> <pid> <relative_pid>" */
2090 p = strchr(trash.area, ' ');
2091 if (!p) {
2092 appctx->st0 = PEER_SESS_ST_EXIT;
2093 appctx->st1 = PEER_SESS_SC_ERRPROTO;
2094 return -1;
2095 }
2096 *p = 0;
2097
2098 /* lookup known peer */
2099 for (peer = peers->remote; peer; peer = peer->next) {
2100 if (strcmp(peer->id, trash.area) == 0)
2101 break;
2102 }
2103
2104 /* if unknown peer */
2105 if (!peer) {
2106 appctx->st0 = PEER_SESS_ST_EXIT;
2107 appctx->st1 = PEER_SESS_SC_ERRPEER;
2108 return -1;
2109 }
2110 *curpeer = peer;
2111
2112 return 1;
2113}
2114
2115/*
Frédéric Lécaille4b2fd9b2019-01-25 08:58:41 +01002116 * Init <peer> peer after having accepted it at peer protocol level.
2117 */
2118static inline void init_accepted_peer(struct peer *peer, struct peers *peers)
2119{
2120 struct shared_table *st;
2121
Frédéric Lécaillec77aa3b2020-10-14 11:50:26 +02002122 peer->heartbeat = tick_add(now_ms, MS_TO_TICKS(PEER_HEARTBEAT_TIMEOUT));
Frédéric Lécaille4b2fd9b2019-01-25 08:58:41 +01002123 /* Register status code */
2124 peer->statuscode = PEER_SESS_SC_SUCCESSCODE;
2125
2126 /* Awake main task */
2127 task_wakeup(peers->sync_task, TASK_WOKEN_MSG);
2128
2129 /* Init confirm counter */
2130 peer->confirm = 0;
2131
2132 /* Init cursors */
2133 for (st = peer->tables; st ; st = st->next) {
2134 st->last_get = st->last_acked = 0;
2135 st->teaching_origin = st->last_pushed = st->update;
2136 }
2137
2138 /* reset teaching and learning flags to 0 */
2139 peer->flags &= PEER_TEACH_RESET;
2140 peer->flags &= PEER_LEARN_RESET;
2141
2142 /* if current peer is local */
2143 if (peer->local) {
2144 /* if current host need resyncfrom local and no process assined */
2145 if ((peers->flags & PEERS_RESYNC_STATEMASK) == PEERS_RESYNC_FROMLOCAL &&
2146 !(peers->flags & PEERS_F_RESYNC_ASSIGN)) {
2147 /* assign local peer for a lesson, consider lesson already requested */
2148 peer->flags |= PEER_F_LEARN_ASSIGN;
2149 peers->flags |= (PEERS_F_RESYNC_ASSIGN|PEERS_F_RESYNC_PROCESS);
2150 }
2151
2152 }
2153 else if ((peers->flags & PEERS_RESYNC_STATEMASK) == PEERS_RESYNC_FROMREMOTE &&
2154 !(peers->flags & PEERS_F_RESYNC_ASSIGN)) {
2155 /* assign peer for a lesson */
2156 peer->flags |= PEER_F_LEARN_ASSIGN;
2157 peers->flags |= PEERS_F_RESYNC_ASSIGN;
2158 }
2159}
2160
2161/*
2162 * Init <peer> peer after having connected it at peer protocol level.
2163 */
2164static inline void init_connected_peer(struct peer *peer, struct peers *peers)
2165{
2166 struct shared_table *st;
2167
Frédéric Lécaillec77aa3b2020-10-14 11:50:26 +02002168 peer->heartbeat = tick_add(now_ms, MS_TO_TICKS(PEER_HEARTBEAT_TIMEOUT));
Frédéric Lécaille4b2fd9b2019-01-25 08:58:41 +01002169 /* Init cursors */
2170 for (st = peer->tables; st ; st = st->next) {
2171 st->last_get = st->last_acked = 0;
2172 st->teaching_origin = st->last_pushed = st->update;
2173 }
2174
2175 /* Init confirm counter */
2176 peer->confirm = 0;
2177
2178 /* reset teaching and learning flags to 0 */
2179 peer->flags &= PEER_TEACH_RESET;
2180 peer->flags &= PEER_LEARN_RESET;
2181
2182 /* If current peer is local */
2183 if (peer->local) {
2184 /* flag to start to teach lesson */
2185 peer->flags |= PEER_F_TEACH_PROCESS;
2186 }
2187 else if ((peers->flags & PEERS_RESYNC_STATEMASK) == PEERS_RESYNC_FROMREMOTE &&
2188 !(peers->flags & PEERS_F_RESYNC_ASSIGN)) {
2189 /* If peer is remote and resync from remote is needed,
2190 and no peer currently assigned */
2191
2192 /* assign peer for a lesson */
2193 peer->flags |= PEER_F_LEARN_ASSIGN;
2194 peers->flags |= PEERS_F_RESYNC_ASSIGN;
2195 }
2196}
2197
2198/*
Emeric Brun2b920a12010-09-23 18:30:22 +02002199 * IO Handler to handle message exchance with a peer
2200 */
Willy Tarreau00a37f02015-04-13 12:05:19 +02002201static void peer_io_handler(struct appctx *appctx)
Emeric Brun2b920a12010-09-23 18:30:22 +02002202{
Willy Tarreau00a37f02015-04-13 12:05:19 +02002203 struct stream_interface *si = appctx->owner;
Willy Tarreau87b09662015-04-03 00:22:06 +02002204 struct stream *s = si_strm(si);
Vincent Bernat3c2f2f22016-04-03 13:48:42 +02002205 struct peers *curpeers = strm_fe(s)->parent;
Emeric Brun80527f52017-06-19 17:46:37 +02002206 struct peer *curpeer = NULL;
Emeric Brun2b920a12010-09-23 18:30:22 +02002207 int reql = 0;
2208 int repl = 0;
Frédéric Lécaille523cc9e2016-10-12 17:30:30 +02002209 unsigned int maj_ver, min_ver;
Willy Tarreau2d372c22018-11-05 17:12:27 +01002210 int prev_state;
Emeric Brun2b920a12010-09-23 18:30:22 +02002211
Joseph Herlant82b2f542018-11-15 12:19:14 -08002212 /* Check if the input buffer is available. */
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +01002213 if (si_ic(si)->buf.size == 0) {
2214 si_rx_room_blk(si);
2215 goto out;
2216 }
Christopher Fauleta73e59b2016-12-09 17:30:18 +01002217
Emeric Brun2b920a12010-09-23 18:30:22 +02002218 while (1) {
Willy Tarreau2d372c22018-11-05 17:12:27 +01002219 prev_state = appctx->st0;
Emeric Brun2b920a12010-09-23 18:30:22 +02002220switchstate:
Frédéric Lécaille523cc9e2016-10-12 17:30:30 +02002221 maj_ver = min_ver = (unsigned int)-1;
Willy Tarreau7b4b4992013-12-01 09:15:12 +01002222 switch(appctx->st0) {
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002223 case PEER_SESS_ST_ACCEPT:
Willy Tarreau2d372c22018-11-05 17:12:27 +01002224 prev_state = appctx->st0;
Willy Tarreau7b4b4992013-12-01 09:15:12 +01002225 appctx->ctx.peers.ptr = NULL;
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002226 appctx->st0 = PEER_SESS_ST_GETVERSION;
Emeric Brun2b920a12010-09-23 18:30:22 +02002227 /* fall through */
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002228 case PEER_SESS_ST_GETVERSION:
Willy Tarreau2d372c22018-11-05 17:12:27 +01002229 prev_state = appctx->st0;
Frédéric Lécaille3f0fb9d2019-01-25 08:30:29 +01002230 reql = peer_getline_version(appctx, &maj_ver, &min_ver);
2231 if (reql <= 0) {
2232 if (!reql)
2233 goto out;
Emeric Brun2b920a12010-09-23 18:30:22 +02002234 goto switchstate;
2235 }
2236
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002237 appctx->st0 = PEER_SESS_ST_GETHOST;
Emeric Brun2b920a12010-09-23 18:30:22 +02002238 /* fall through */
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002239 case PEER_SESS_ST_GETHOST:
Willy Tarreau2d372c22018-11-05 17:12:27 +01002240 prev_state = appctx->st0;
Frédéric Lécaille3f0fb9d2019-01-25 08:30:29 +01002241 reql = peer_getline_host(appctx);
2242 if (reql <= 0) {
2243 if (!reql)
2244 goto out;
Emeric Brun2b920a12010-09-23 18:30:22 +02002245 goto switchstate;
2246 }
2247
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002248 appctx->st0 = PEER_SESS_ST_GETPEER;
Emeric Brun2b920a12010-09-23 18:30:22 +02002249 /* fall through */
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002250 case PEER_SESS_ST_GETPEER: {
Willy Tarreau2d372c22018-11-05 17:12:27 +01002251 prev_state = appctx->st0;
Frédéric Lécaille3f0fb9d2019-01-25 08:30:29 +01002252 reql = peer_getline_last(appctx, &curpeer);
2253 if (reql <= 0) {
2254 if (!reql)
2255 goto out;
Emeric Brun2b920a12010-09-23 18:30:22 +02002256 goto switchstate;
2257 }
Emeric Brun2b920a12010-09-23 18:30:22 +02002258
Christopher Faulet2a944ee2017-11-07 10:42:54 +01002259 HA_SPIN_LOCK(PEER_LOCK, &curpeer->lock);
Willy Tarreau9df94c22016-10-31 18:42:52 +01002260 if (curpeer->appctx && curpeer->appctx != appctx) {
Emeric Brunb3971ab2015-05-12 18:49:09 +02002261 if (curpeer->local) {
2262 /* Local connection, reply a retry */
2263 appctx->st0 = PEER_SESS_ST_EXIT;
2264 appctx->st1 = PEER_SESS_SC_TRYAGAIN;
2265 goto switchstate;
Emeric Brun2b920a12010-09-23 18:30:22 +02002266 }
Emeric Brun80527f52017-06-19 17:46:37 +02002267
2268 /* we're killing a connection, we must apply a random delay before
2269 * retrying otherwise the other end will do the same and we can loop
2270 * for a while.
2271 */
Willy Tarreau861c4ef2020-03-08 00:42:37 +01002272 curpeer->reconnect = tick_add(now_ms, MS_TO_TICKS(50 + ha_random() % 2000));
Emeric Brun9ef2ad72019-04-02 17:22:01 +02002273 peer_session_forceshutdown(curpeer);
Frédéric Lécaillec77aa3b2020-10-14 11:50:26 +02002274 curpeer->heartbeat = TICK_ETERNITY;
Emeric Brun2b920a12010-09-23 18:30:22 +02002275 }
Frédéric Lécaille523cc9e2016-10-12 17:30:30 +02002276 if (maj_ver != (unsigned int)-1 && min_ver != (unsigned int)-1) {
2277 if (min_ver == PEER_DWNGRD_MINOR_VER) {
2278 curpeer->flags |= PEER_F_DWNGRD;
2279 }
2280 else {
2281 curpeer->flags &= ~PEER_F_DWNGRD;
2282 }
2283 }
Emeric Brunb3971ab2015-05-12 18:49:09 +02002284 curpeer->appctx = appctx;
Frédéric Lécaillec77aa3b2020-10-14 11:50:26 +02002285 curpeer->flags |= PEER_F_ALIVE;
Emeric Brunb3971ab2015-05-12 18:49:09 +02002286 appctx->ctx.peers.ptr = curpeer;
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002287 appctx->st0 = PEER_SESS_ST_SENDSUCCESS;
Olivier Houcharded879892019-03-08 18:53:43 +01002288 _HA_ATOMIC_ADD(&active_peers, 1);
Emeric Brun2b920a12010-09-23 18:30:22 +02002289 /* fall through */
2290 }
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002291 case PEER_SESS_ST_SENDSUCCESS: {
Willy Tarreau2d372c22018-11-05 17:12:27 +01002292 prev_state = appctx->st0;
Emeric Brun80527f52017-06-19 17:46:37 +02002293 if (!curpeer) {
2294 curpeer = appctx->ctx.peers.ptr;
Christopher Faulet2a944ee2017-11-07 10:42:54 +01002295 HA_SPIN_LOCK(PEER_LOCK, &curpeer->lock);
Emeric Brun80527f52017-06-19 17:46:37 +02002296 if (curpeer->appctx != appctx) {
2297 appctx->st0 = PEER_SESS_ST_END;
2298 goto switchstate;
2299 }
2300 }
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +01002301
2302 repl = peer_send_status_successmsg(appctx);
Emeric Brun2b920a12010-09-23 18:30:22 +02002303 if (repl <= 0) {
2304 if (repl == -1)
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +01002305 goto out;
Emeric Brun2b920a12010-09-23 18:30:22 +02002306 goto switchstate;
2307 }
2308
Frédéric Lécaille4b2fd9b2019-01-25 08:58:41 +01002309 init_accepted_peer(curpeer, curpeers);
Emeric Brunb3971ab2015-05-12 18:49:09 +02002310
Emeric Brun2b920a12010-09-23 18:30:22 +02002311 /* switch to waiting message state */
Olivier Houcharded879892019-03-08 18:53:43 +01002312 _HA_ATOMIC_ADD(&connected_peers, 1);
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002313 appctx->st0 = PEER_SESS_ST_WAITMSG;
Emeric Brun2b920a12010-09-23 18:30:22 +02002314 goto switchstate;
2315 }
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002316 case PEER_SESS_ST_CONNECT: {
Willy Tarreau2d372c22018-11-05 17:12:27 +01002317 prev_state = appctx->st0;
Emeric Brun80527f52017-06-19 17:46:37 +02002318 if (!curpeer) {
2319 curpeer = appctx->ctx.peers.ptr;
Christopher Faulet2a944ee2017-11-07 10:42:54 +01002320 HA_SPIN_LOCK(PEER_LOCK, &curpeer->lock);
Emeric Brun80527f52017-06-19 17:46:37 +02002321 if (curpeer->appctx != appctx) {
2322 appctx->st0 = PEER_SESS_ST_END;
2323 goto switchstate;
2324 }
2325 }
Emeric Brun2b920a12010-09-23 18:30:22 +02002326
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +01002327 repl = peer_send_hellomsg(appctx, curpeer);
Emeric Brun2b920a12010-09-23 18:30:22 +02002328 if (repl <= 0) {
2329 if (repl == -1)
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +01002330 goto out;
Emeric Brun2b920a12010-09-23 18:30:22 +02002331 goto switchstate;
2332 }
2333
2334 /* switch to the waiting statuscode state */
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002335 appctx->st0 = PEER_SESS_ST_GETSTATUS;
Emeric Brun2b920a12010-09-23 18:30:22 +02002336 /* fall through */
2337 }
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002338 case PEER_SESS_ST_GETSTATUS: {
Willy Tarreau2d372c22018-11-05 17:12:27 +01002339 prev_state = appctx->st0;
Emeric Brun80527f52017-06-19 17:46:37 +02002340 if (!curpeer) {
2341 curpeer = appctx->ctx.peers.ptr;
Christopher Faulet2a944ee2017-11-07 10:42:54 +01002342 HA_SPIN_LOCK(PEER_LOCK, &curpeer->lock);
Emeric Brun80527f52017-06-19 17:46:37 +02002343 if (curpeer->appctx != appctx) {
2344 appctx->st0 = PEER_SESS_ST_END;
2345 goto switchstate;
2346 }
2347 }
2348
Willy Tarreau2bb4a962014-11-28 11:11:05 +01002349 if (si_ic(si)->flags & CF_WRITE_PARTIAL)
Emeric Brunb3971ab2015-05-12 18:49:09 +02002350 curpeer->statuscode = PEER_SESS_SC_CONNECTEDCODE;
Emeric Brun2b920a12010-09-23 18:30:22 +02002351
Frédéric Lécaillece025572019-01-21 13:38:06 +01002352 reql = peer_getline(appctx);
2353 if (!reql)
2354 goto out;
Emeric Brun2b920a12010-09-23 18:30:22 +02002355
Frédéric Lécaillece025572019-01-21 13:38:06 +01002356 if (reql < 0)
2357 goto switchstate;
Emeric Brun2b920a12010-09-23 18:30:22 +02002358
2359 /* Register status code */
Willy Tarreau843b7cb2018-07-13 10:54:26 +02002360 curpeer->statuscode = atoi(trash.area);
Emeric Brun2b920a12010-09-23 18:30:22 +02002361
2362 /* Awake main task */
Frédéric Lécailleed2b4a62017-07-13 09:07:09 +02002363 task_wakeup(curpeers->sync_task, TASK_WOKEN_MSG);
Emeric Brun2b920a12010-09-23 18:30:22 +02002364
2365 /* If status code is success */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002366 if (curpeer->statuscode == PEER_SESS_SC_SUCCESSCODE) {
Frédéric Lécaille4b2fd9b2019-01-25 08:58:41 +01002367 init_connected_peer(curpeer, curpeers);
Emeric Brun2b920a12010-09-23 18:30:22 +02002368 }
2369 else {
Frédéric Lécaille523cc9e2016-10-12 17:30:30 +02002370 if (curpeer->statuscode == PEER_SESS_SC_ERRVERSION)
2371 curpeer->flags |= PEER_F_DWNGRD;
Emeric Brun2b920a12010-09-23 18:30:22 +02002372 /* Status code is not success, abort */
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002373 appctx->st0 = PEER_SESS_ST_END;
Emeric Brun2b920a12010-09-23 18:30:22 +02002374 goto switchstate;
2375 }
Olivier Houcharded879892019-03-08 18:53:43 +01002376 _HA_ATOMIC_ADD(&connected_peers, 1);
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002377 appctx->st0 = PEER_SESS_ST_WAITMSG;
Emeric Brun2b920a12010-09-23 18:30:22 +02002378 /* fall through */
2379 }
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002380 case PEER_SESS_ST_WAITMSG: {
Emeric Brunb3971ab2015-05-12 18:49:09 +02002381 uint32_t msg_len = 0;
Willy Tarreau843b7cb2018-07-13 10:54:26 +02002382 char *msg_cur = trash.area;
2383 char *msg_end = trash.area;
Willy Tarreaue6ea2a62020-11-13 14:10:20 +01002384 unsigned char msg_head[7]; // 2 + 5 for varint32
Emeric Brun2b920a12010-09-23 18:30:22 +02002385 int totl = 0;
2386
Willy Tarreau2d372c22018-11-05 17:12:27 +01002387 prev_state = appctx->st0;
Emeric Brun80527f52017-06-19 17:46:37 +02002388 if (!curpeer) {
2389 curpeer = appctx->ctx.peers.ptr;
Christopher Faulet2a944ee2017-11-07 10:42:54 +01002390 HA_SPIN_LOCK(PEER_LOCK, &curpeer->lock);
Emeric Brun80527f52017-06-19 17:46:37 +02002391 if (curpeer->appctx != appctx) {
2392 appctx->st0 = PEER_SESS_ST_END;
2393 goto switchstate;
2394 }
2395 }
2396
Frédéric Lécaille95203f22019-01-23 19:38:11 +01002397 reql = peer_recv_msg(appctx, (char *)msg_head, sizeof msg_head, &msg_len, &totl);
2398 if (reql <= 0) {
2399 if (reql == -1)
2400 goto switchstate;
Frédéric Lécaillebe825e52019-01-24 18:28:44 +01002401 goto send_msgs;
Emeric Brunb3971ab2015-05-12 18:49:09 +02002402 }
Willy Tarreau86a446e2013-11-25 23:02:37 +01002403
Frédéric Lécaille95203f22019-01-23 19:38:11 +01002404 msg_end += msg_len;
Frédéric Lécaille444243c2019-01-24 15:40:11 +01002405 if (!peer_treat_awaited_msg(appctx, curpeer, msg_head, &msg_cur, msg_end, msg_len, totl))
Emeric Brun2b920a12010-09-23 18:30:22 +02002406 goto switchstate;
Frédéric Lécaillebe825e52019-01-24 18:28:44 +01002407
Frédéric Lécaille045e0d42019-03-21 11:12:32 +01002408 curpeer->flags |= PEER_F_ALIVE;
2409
Emeric Brun2b920a12010-09-23 18:30:22 +02002410 /* skip consumed message */
Willy Tarreau06d80a92017-10-19 14:32:15 +02002411 co_skip(si_oc(si), totl);
Emeric Brun2b920a12010-09-23 18:30:22 +02002412 /* loop on that state to peek next message */
Willy Tarreau72d6c162013-04-11 16:14:13 +02002413 goto switchstate;
2414
Frédéric Lécaillebe825e52019-01-24 18:28:44 +01002415send_msgs:
Frédéric Lécaille645635d2019-02-11 17:49:39 +01002416 if (curpeer->flags & PEER_F_HEARTBEAT) {
2417 curpeer->flags &= ~PEER_F_HEARTBEAT;
2418 repl = peer_send_heartbeatmsg(appctx);
2419 if (repl <= 0) {
2420 if (repl == -1)
2421 goto out;
2422 goto switchstate;
2423 }
Frédéric Lécaille5d072702019-11-06 11:51:26 +01002424 curpeer->tx_hbt++;
Frédéric Lécaille645635d2019-02-11 17:49:39 +01002425 }
Frédéric Lécaillebe825e52019-01-24 18:28:44 +01002426 /* we get here when a peer_recv_msg() returns 0 in reql */
Frédéric Lécaille25e1d5e2019-01-24 17:33:48 +01002427 repl = peer_send_msgs(appctx, curpeer);
2428 if (repl <= 0) {
2429 if (repl == -1)
2430 goto out;
2431 goto switchstate;
Emeric Brun597b26e2016-08-12 11:23:31 +02002432 }
2433
Emeric Brun2b920a12010-09-23 18:30:22 +02002434 /* noting more to do */
2435 goto out;
2436 }
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002437 case PEER_SESS_ST_EXIT:
Willy Tarreau2d372c22018-11-05 17:12:27 +01002438 if (prev_state == PEER_SESS_ST_WAITMSG)
Olivier Houcharded879892019-03-08 18:53:43 +01002439 _HA_ATOMIC_SUB(&connected_peers, 1);
Willy Tarreau2d372c22018-11-05 17:12:27 +01002440 prev_state = appctx->st0;
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +01002441 if (peer_send_status_errormsg(appctx) == -1)
2442 goto out;
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002443 appctx->st0 = PEER_SESS_ST_END;
Emeric Brunb3971ab2015-05-12 18:49:09 +02002444 goto switchstate;
2445 case PEER_SESS_ST_ERRSIZE: {
Willy Tarreau2d372c22018-11-05 17:12:27 +01002446 if (prev_state == PEER_SESS_ST_WAITMSG)
Olivier Houcharded879892019-03-08 18:53:43 +01002447 _HA_ATOMIC_SUB(&connected_peers, 1);
Willy Tarreau2d372c22018-11-05 17:12:27 +01002448 prev_state = appctx->st0;
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +01002449 if (peer_send_error_size_limitmsg(appctx) == -1)
2450 goto out;
Emeric Brunb3971ab2015-05-12 18:49:09 +02002451 appctx->st0 = PEER_SESS_ST_END;
2452 goto switchstate;
2453 }
2454 case PEER_SESS_ST_ERRPROTO: {
Frédéric Lécaille9a88a832019-11-07 15:22:33 +01002455 if (curpeer)
2456 curpeer->proto_err++;
Willy Tarreau2d372c22018-11-05 17:12:27 +01002457 if (prev_state == PEER_SESS_ST_WAITMSG)
Olivier Houcharded879892019-03-08 18:53:43 +01002458 _HA_ATOMIC_SUB(&connected_peers, 1);
Willy Tarreau2d372c22018-11-05 17:12:27 +01002459 prev_state = appctx->st0;
Frédéric Lécaille7d0ceee2019-01-24 14:24:05 +01002460 if (peer_send_error_protomsg(appctx) == -1)
2461 goto out;
Emeric Brunb3971ab2015-05-12 18:49:09 +02002462 appctx->st0 = PEER_SESS_ST_END;
Willy Tarreau2d372c22018-11-05 17:12:27 +01002463 prev_state = appctx->st0;
Emeric Brun2b920a12010-09-23 18:30:22 +02002464 /* fall through */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002465 }
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002466 case PEER_SESS_ST_END: {
Willy Tarreau2d372c22018-11-05 17:12:27 +01002467 if (prev_state == PEER_SESS_ST_WAITMSG)
Olivier Houcharded879892019-03-08 18:53:43 +01002468 _HA_ATOMIC_SUB(&connected_peers, 1);
Willy Tarreau2d372c22018-11-05 17:12:27 +01002469 prev_state = appctx->st0;
Emeric Brun80527f52017-06-19 17:46:37 +02002470 if (curpeer) {
Christopher Faulet2a944ee2017-11-07 10:42:54 +01002471 HA_SPIN_UNLOCK(PEER_LOCK, &curpeer->lock);
Emeric Brun80527f52017-06-19 17:46:37 +02002472 curpeer = NULL;
2473 }
Willy Tarreau73b013b2012-05-21 16:31:45 +02002474 si_shutw(si);
2475 si_shutr(si);
Willy Tarreau2bb4a962014-11-28 11:11:05 +01002476 si_ic(si)->flags |= CF_READ_NULL;
Willy Tarreau828824a2015-04-19 17:20:03 +02002477 goto out;
Emeric Brun2b920a12010-09-23 18:30:22 +02002478 }
2479 }
2480 }
2481out:
Willy Tarreau2bb4a962014-11-28 11:11:05 +01002482 si_oc(si)->flags |= CF_READ_DONTWAIT;
Emeric Brun80527f52017-06-19 17:46:37 +02002483
2484 if (curpeer)
Christopher Faulet2a944ee2017-11-07 10:42:54 +01002485 HA_SPIN_UNLOCK(PEER_LOCK, &curpeer->lock);
Emeric Brun2b920a12010-09-23 18:30:22 +02002486 return;
2487}
2488
Willy Tarreau30576452015-04-13 13:50:30 +02002489static struct applet peer_applet = {
Willy Tarreau3fdb3662012-11-12 00:42:33 +01002490 .obj_type = OBJ_TYPE_APPLET,
Willy Tarreaub24281b2011-02-13 13:16:36 +01002491 .name = "<PEER>", /* used for logging */
2492 .fct = peer_io_handler,
Aman Gupta9a13e842012-04-02 18:57:53 -07002493 .release = peer_session_release,
Willy Tarreaub24281b2011-02-13 13:16:36 +01002494};
Emeric Brun2b920a12010-09-23 18:30:22 +02002495
Emeric Brun9ef2ad72019-04-02 17:22:01 +02002496
Emeric Brun2b920a12010-09-23 18:30:22 +02002497/*
2498 * Use this function to force a close of a peer session
2499 */
Emeric Brun9ef2ad72019-04-02 17:22:01 +02002500static void peer_session_forceshutdown(struct peer *peer)
Emeric Brun2b920a12010-09-23 18:30:22 +02002501{
Emeric Brun9ef2ad72019-04-02 17:22:01 +02002502 struct appctx *appctx = peer->appctx;
2503
Frédéric Lécaille5df11902017-06-13 16:39:57 +02002504 /* Note that the peer sessions which have just been created
2505 * (->st0 == PEER_SESS_ST_CONNECT) must not
2506 * be shutdown, if not, the TCP session will never be closed
2507 * and stay in CLOSE_WAIT state after having been closed by
2508 * the remote side.
2509 */
2510 if (!appctx || appctx->st0 == PEER_SESS_ST_CONNECT)
Willy Tarreau7b4b4992013-12-01 09:15:12 +01002511 return;
2512
Willy Tarreau81bc3b02016-10-31 17:37:39 +01002513 if (appctx->applet != &peer_applet)
2514 return;
2515
Emeric Brun9ef2ad72019-04-02 17:22:01 +02002516 __peer_session_deinit(peer);
2517
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002518 appctx->st0 = PEER_SESS_ST_END;
Willy Tarreau78c0c502016-10-31 17:32:20 +01002519 appctx_wakeup(appctx);
Emeric Brun2b920a12010-09-23 18:30:22 +02002520}
2521
Willy Tarreau91d96282015-03-13 15:47:26 +01002522/* Pre-configures a peers frontend to accept incoming connections */
2523void peers_setup_frontend(struct proxy *fe)
2524{
2525 fe->last_change = now.tv_sec;
Frédéric Lécaillec06b5d42018-04-26 10:06:41 +02002526 fe->cap = PR_CAP_FE | PR_CAP_BE;
Willy Tarreau91d96282015-03-13 15:47:26 +01002527 fe->maxconn = 0;
2528 fe->conn_retries = CONN_RETRIES;
2529 fe->timeout.client = MS_TO_TICKS(5000);
Willy Tarreaud1d48d42015-03-13 16:15:46 +01002530 fe->accept = frontend_accept;
Willy Tarreauf87ab942015-03-13 15:55:16 +01002531 fe->default_target = &peer_applet.obj_type;
Willy Tarreau91d96282015-03-13 15:47:26 +01002532 fe->options2 |= PR_O2_INDEPSTR | PR_O2_SMARTCON | PR_O2_SMARTACC;
Willy Tarreau0fca4832015-05-01 19:12:05 +02002533 fe->bind_proc = 0; /* will be filled by users */
Willy Tarreau91d96282015-03-13 15:47:26 +01002534}
2535
Emeric Brun2b920a12010-09-23 18:30:22 +02002536/*
Willy Tarreaubd55e312010-11-11 10:55:09 +01002537 * Create a new peer session in assigned state (connect will start automatically)
Emeric Brun2b920a12010-09-23 18:30:22 +02002538 */
Willy Tarreau9df94c22016-10-31 18:42:52 +01002539static struct appctx *peer_session_create(struct peers *peers, struct peer *peer)
Emeric Brun2b920a12010-09-23 18:30:22 +02002540{
Willy Tarreau04b92862017-09-15 11:01:04 +02002541 struct proxy *p = peers->peers_fe; /* attached frontend */
Willy Tarreau7b4b4992013-12-01 09:15:12 +01002542 struct appctx *appctx;
Willy Tarreau15b5e142015-04-04 14:38:25 +02002543 struct session *sess;
Willy Tarreau87b09662015-04-03 00:22:06 +02002544 struct stream *s;
Willy Tarreau32e3c6a2013-10-11 19:34:20 +02002545 struct connection *conn;
Olivier Houchard9aaf7782017-09-13 18:30:23 +02002546 struct conn_stream *cs;
Emeric Brun2b920a12010-09-23 18:30:22 +02002547
Frédéric Lécaille54152712021-01-18 15:14:39 +01002548 peer->new_conn++;
Frédéric Lécaille54bff832019-03-26 10:25:20 +01002549 peer->reconnect = tick_add(now_ms, MS_TO_TICKS(PEER_RECONNECT_TIMEOUT));
Frédéric Lécaillec77aa3b2020-10-14 11:50:26 +02002550 peer->heartbeat = TICK_ETERNITY;
Emeric Brunb3971ab2015-05-12 18:49:09 +02002551 peer->statuscode = PEER_SESS_SC_CONNECTCODE;
Willy Tarreaud990baf2015-04-05 00:32:03 +02002552 s = NULL;
2553
Emeric Brun1138fd02017-06-19 12:38:55 +02002554 appctx = appctx_new(&peer_applet, tid_bit);
Willy Tarreaud990baf2015-04-05 00:32:03 +02002555 if (!appctx)
2556 goto out_close;
2557
2558 appctx->st0 = PEER_SESS_ST_CONNECT;
Emeric Brunb3971ab2015-05-12 18:49:09 +02002559 appctx->ctx.peers.ptr = (void *)peer;
Willy Tarreaud990baf2015-04-05 00:32:03 +02002560
Willy Tarreau04b92862017-09-15 11:01:04 +02002561 sess = session_new(p, NULL, &appctx->obj_type);
Willy Tarreau15b5e142015-04-04 14:38:25 +02002562 if (!sess) {
Christopher Faulet767a84b2017-11-24 16:50:31 +01002563 ha_alert("out of memory in peer_session_create().\n");
Willy Tarreaud990baf2015-04-05 00:32:03 +02002564 goto out_free_appctx;
Emeric Brun2b920a12010-09-23 18:30:22 +02002565 }
2566
Willy Tarreau87787ac2017-08-28 16:22:54 +02002567 if ((s = stream_new(sess, &appctx->obj_type)) == NULL) {
Christopher Faulet767a84b2017-11-24 16:50:31 +01002568 ha_alert("Failed to initialize stream in peer_session_create().\n");
Willy Tarreau87787ac2017-08-28 16:22:54 +02002569 goto out_free_sess;
Willy Tarreau8baf9062015-04-05 00:46:36 +02002570 }
2571
Willy Tarreau342bfb12015-04-05 01:35:34 +02002572 /* The tasks below are normally what is supposed to be done by
2573 * fe->accept().
2574 */
Willy Tarreaue7dff022015-04-03 01:14:29 +02002575 s->flags = SF_ASSIGNED|SF_ADDR_SET;
Emeric Brun2b920a12010-09-23 18:30:22 +02002576
Willy Tarreau6e2979c2015-04-27 13:21:15 +02002577 /* applet is waiting for data */
Willy Tarreau0cd3bd62018-11-06 18:46:37 +01002578 si_cant_get(&s->si[0]);
Willy Tarreau6e2979c2015-04-27 13:21:15 +02002579 appctx_wakeup(appctx);
2580
Willy Tarreau3ed35ef2013-10-24 11:51:38 +02002581 /* initiate an outgoing connection */
Willy Tarreaudbd02672017-12-06 17:39:53 +01002582 s->si[1].flags |= SI_FL_NOLINGER;
Willy Tarreau3ed35ef2013-10-24 11:51:38 +02002583 si_set_state(&s->si[1], SI_ST_ASS);
Willy Tarreau3ed35ef2013-10-24 11:51:38 +02002584
Willy Tarreau32e3c6a2013-10-11 19:34:20 +02002585 /* automatically prepare the stream interface to connect to the
Willy Tarreaub363a1f2013-10-01 10:45:07 +02002586 * pre-initialized connection in si->conn.
2587 */
Willy Tarreau32e3c6a2013-10-11 19:34:20 +02002588 if (unlikely((conn = conn_new()) == NULL))
Willy Tarreau8baf9062015-04-05 00:46:36 +02002589 goto out_free_strm;
Willy Tarreau32e3c6a2013-10-11 19:34:20 +02002590
Olivier Houchard9aaf7782017-09-13 18:30:23 +02002591 if (unlikely((cs = cs_new(conn)) == NULL))
2592 goto out_free_conn;
2593
Frédéric Lécaille1055e682018-04-26 14:35:21 +02002594 conn->target = s->target = peer_session_target(peer, s);
Willy Tarreaube373152018-09-06 11:45:30 +02002595 memcpy(&conn->addr.to, &peer->addr, sizeof(conn->addr.to));
2596
Frédéric Lécaille1055e682018-04-26 14:35:21 +02002597 conn_prepare(conn, peer->proto, peer_xprt(peer));
Olivier Houchardef60ff32019-01-29 19:00:33 +01002598 if (conn_install_mux(conn, &mux_pt_ops, cs, s->be, NULL) < 0)
2599 goto out_free_cs;
Olivier Houchard9aaf7782017-09-13 18:30:23 +02002600 si_attach_cs(&s->si[1], cs);
Willy Tarreau32e3c6a2013-10-11 19:34:20 +02002601
Emeric Brun2b920a12010-09-23 18:30:22 +02002602 s->do_log = NULL;
Emeric Brun2b920a12010-09-23 18:30:22 +02002603 s->uniq_id = 0;
Emeric Brun2b920a12010-09-23 18:30:22 +02002604
Willy Tarreau22ec1ea2014-11-27 20:45:39 +01002605 s->res.flags |= CF_READ_DONTWAIT;
Willy Tarreau696a2912014-11-24 11:36:57 +01002606
Emeric Brunb3971ab2015-05-12 18:49:09 +02002607 peer->appctx = appctx;
Willy Tarreau87787ac2017-08-28 16:22:54 +02002608 task_wakeup(s->task, TASK_WOKEN_INIT);
Olivier Houcharded879892019-03-08 18:53:43 +01002609 _HA_ATOMIC_ADD(&active_peers, 1);
Willy Tarreau9df94c22016-10-31 18:42:52 +01002610 return appctx;
Emeric Brun2b920a12010-09-23 18:30:22 +02002611
2612 /* Error unrolling */
Olivier Houchardef60ff32019-01-29 19:00:33 +01002613out_free_cs:
2614 cs_free(cs);
Olivier Houchard9aaf7782017-09-13 18:30:23 +02002615 out_free_conn:
2616 conn_free(conn);
Willy Tarreau15b5e142015-04-04 14:38:25 +02002617 out_free_strm:
Emeric Brun2b920a12010-09-23 18:30:22 +02002618 LIST_DEL(&s->list);
Willy Tarreaubafbe012017-11-24 17:34:44 +01002619 pool_free(pool_head_stream, s);
Willy Tarreau15b5e142015-04-04 14:38:25 +02002620 out_free_sess:
Willy Tarreau11c36242015-04-04 15:54:03 +02002621 session_free(sess);
Willy Tarreaud990baf2015-04-05 00:32:03 +02002622 out_free_appctx:
2623 appctx_free(appctx);
Emeric Brun2b920a12010-09-23 18:30:22 +02002624 out_close:
Willy Tarreaub21d08e2016-10-31 17:46:57 +01002625 return NULL;
Emeric Brun2b920a12010-09-23 18:30:22 +02002626}
2627
2628/*
Frédéric Lécaille645635d2019-02-11 17:49:39 +01002629 * Task processing function to manage re-connect, peer session
2630 * tasks wakeup on local update and heartbeat.
Emeric Brun2b920a12010-09-23 18:30:22 +02002631 */
Olivier Houchard9f6af332018-05-25 14:04:04 +02002632static struct task *process_peer_sync(struct task * task, void *context, unsigned short state)
Emeric Brun2b920a12010-09-23 18:30:22 +02002633{
Olivier Houchard9f6af332018-05-25 14:04:04 +02002634 struct peers *peers = context;
Emeric Brunb3971ab2015-05-12 18:49:09 +02002635 struct peer *ps;
2636 struct shared_table *st;
Emeric Brun2b920a12010-09-23 18:30:22 +02002637
2638 task->expire = TICK_ETERNITY;
2639
Emeric Brunb3971ab2015-05-12 18:49:09 +02002640 if (!peers->peers_fe) {
Willy Tarreau46dc1ca2015-05-01 18:32:13 +02002641 /* this one was never started, kill it */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002642 signal_unregister_handler(peers->sighandler);
Olivier Houchard3f795f72019-04-17 22:51:06 +02002643 task_destroy(peers->sync_task);
Willy Tarreau37bb7be2015-09-21 15:24:58 +02002644 peers->sync_task = NULL;
Willy Tarreau46dc1ca2015-05-01 18:32:13 +02002645 return NULL;
2646 }
2647
Emeric Brun80527f52017-06-19 17:46:37 +02002648 /* Acquire lock for all peers of the section */
2649 for (ps = peers->remote; ps; ps = ps->next)
Christopher Faulet2a944ee2017-11-07 10:42:54 +01002650 HA_SPIN_LOCK(PEER_LOCK, &ps->lock);
Emeric Brun80527f52017-06-19 17:46:37 +02002651
Emeric Brun2b920a12010-09-23 18:30:22 +02002652 if (!stopping) {
2653 /* Normal case (not soft stop)*/
Emeric Brunb3971ab2015-05-12 18:49:09 +02002654
2655 if (((peers->flags & PEERS_RESYNC_STATEMASK) == PEERS_RESYNC_FROMLOCAL) &&
2656 (!nb_oldpids || tick_is_expired(peers->resync_timeout, now_ms)) &&
2657 !(peers->flags & PEERS_F_RESYNC_ASSIGN)) {
Emeric Brun2b920a12010-09-23 18:30:22 +02002658 /* Resync from local peer needed
2659 no peer was assigned for the lesson
2660 and no old local peer found
2661 or resync timeout expire */
2662
2663 /* flag no more resync from local, to try resync from remotes */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002664 peers->flags |= PEERS_F_RESYNC_LOCAL;
Emeric Brun2b920a12010-09-23 18:30:22 +02002665
2666 /* reschedule a resync */
Frédéric Lécaille54bff832019-03-26 10:25:20 +01002667 peers->resync_timeout = tick_add(now_ms, MS_TO_TICKS(PEER_RESYNC_TIMEOUT));
Emeric Brun2b920a12010-09-23 18:30:22 +02002668 }
2669
2670 /* For each session */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002671 for (ps = peers->remote; ps; ps = ps->next) {
Emeric Brun2b920a12010-09-23 18:30:22 +02002672 /* For each remote peers */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002673 if (!ps->local) {
Willy Tarreau9df94c22016-10-31 18:42:52 +01002674 if (!ps->appctx) {
2675 /* no active peer connection */
Emeric Brun2b920a12010-09-23 18:30:22 +02002676 if (ps->statuscode == 0 ||
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002677 ((ps->statuscode == PEER_SESS_SC_CONNECTCODE ||
Willy Tarreaub4e34da2015-05-20 10:39:04 +02002678 ps->statuscode == PEER_SESS_SC_SUCCESSCODE ||
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002679 ps->statuscode == PEER_SESS_SC_CONNECTEDCODE) &&
Emeric Brun2b920a12010-09-23 18:30:22 +02002680 tick_is_expired(ps->reconnect, now_ms))) {
2681 /* connection never tried
Willy Tarreau9df94c22016-10-31 18:42:52 +01002682 * or previous peer connection established with success
2683 * or previous peer connection failed while connecting
Emeric Brun2b920a12010-09-23 18:30:22 +02002684 * and reconnection timer is expired */
2685
2686 /* retry a connect */
Willy Tarreau9df94c22016-10-31 18:42:52 +01002687 ps->appctx = peer_session_create(peers, ps);
Emeric Brun2b920a12010-09-23 18:30:22 +02002688 }
Willy Tarreaub4e34da2015-05-20 10:39:04 +02002689 else if (!tick_is_expired(ps->reconnect, now_ms)) {
Emeric Brun2b920a12010-09-23 18:30:22 +02002690 /* If previous session failed during connection
2691 * but reconnection timer is not expired */
2692
2693 /* reschedule task for reconnect */
2694 task->expire = tick_first(task->expire, ps->reconnect);
2695 }
2696 /* else do nothing */
Willy Tarreau9df94c22016-10-31 18:42:52 +01002697 } /* !ps->appctx */
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002698 else if (ps->statuscode == PEER_SESS_SC_SUCCESSCODE) {
Willy Tarreau9df94c22016-10-31 18:42:52 +01002699 /* current peer connection is active and established */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002700 if (((peers->flags & PEERS_RESYNC_STATEMASK) == PEERS_RESYNC_FROMREMOTE) &&
2701 !(peers->flags & PEERS_F_RESYNC_ASSIGN) &&
Emeric Brun2b920a12010-09-23 18:30:22 +02002702 !(ps->flags & PEER_F_LEARN_NOTUP2DATE)) {
2703 /* Resync from a remote is needed
2704 * and no peer was assigned for lesson
2705 * and current peer may be up2date */
2706
2707 /* assign peer for the lesson */
2708 ps->flags |= PEER_F_LEARN_ASSIGN;
Emeric Brunb3971ab2015-05-12 18:49:09 +02002709 peers->flags |= PEERS_F_RESYNC_ASSIGN;
Emeric Brun2b920a12010-09-23 18:30:22 +02002710
Willy Tarreau9df94c22016-10-31 18:42:52 +01002711 /* wake up peer handler to handle a request of resync */
Willy Tarreaue5843b32015-04-27 18:40:14 +02002712 appctx_wakeup(ps->appctx);
Emeric Brun2b920a12010-09-23 18:30:22 +02002713 }
Emeric Brunb3971ab2015-05-12 18:49:09 +02002714 else {
Frédéric Lécaille645635d2019-02-11 17:49:39 +01002715 int update_to_push = 0;
2716
Emeric Brunb3971ab2015-05-12 18:49:09 +02002717 /* Awake session if there is data to push */
2718 for (st = ps->tables; st ; st = st->next) {
2719 if ((int)(st->last_pushed - st->table->localupdate) < 0) {
Willy Tarreau9df94c22016-10-31 18:42:52 +01002720 /* wake up the peer handler to push local updates */
Frédéric Lécaille645635d2019-02-11 17:49:39 +01002721 update_to_push = 1;
Frédéric Lécaille045e0d42019-03-21 11:12:32 +01002722 /* There is no need to send a heartbeat message
2723 * when some updates must be pushed. The remote
2724 * peer will consider <ps> peer as alive when it will
2725 * receive these updates.
2726 */
Frédéric Lécaille645635d2019-02-11 17:49:39 +01002727 ps->flags &= ~PEER_F_HEARTBEAT;
Frédéric Lécaille045e0d42019-03-21 11:12:32 +01002728 /* Re-schedule another one later. */
Frédéric Lécaille645635d2019-02-11 17:49:39 +01002729 ps->heartbeat = tick_add(now_ms, MS_TO_TICKS(PEER_HEARTBEAT_TIMEOUT));
Frédéric Lécaille045e0d42019-03-21 11:12:32 +01002730 /* We are going to send updates, let's ensure we will
2731 * come back to send heartbeat messages or to reconnect.
2732 */
2733 task->expire = tick_first(ps->reconnect, ps->heartbeat);
Emeric Brunb3971ab2015-05-12 18:49:09 +02002734 appctx_wakeup(ps->appctx);
2735 break;
2736 }
2737 }
Frédéric Lécaille045e0d42019-03-21 11:12:32 +01002738 /* When there are updates to send we do not reconnect
2739 * and do not send heartbeat message either.
2740 */
2741 if (!update_to_push) {
2742 if (tick_is_expired(ps->reconnect, now_ms)) {
2743 if (ps->flags & PEER_F_ALIVE) {
2744 /* This peer was alive during a 'reconnect' period.
2745 * Flag it as not alive again for the next period.
2746 */
2747 ps->flags &= ~PEER_F_ALIVE;
Frédéric Lécaille54bff832019-03-26 10:25:20 +01002748 ps->reconnect = tick_add(now_ms, MS_TO_TICKS(PEER_RECONNECT_TIMEOUT));
Frédéric Lécaille045e0d42019-03-21 11:12:32 +01002749 }
2750 else {
Willy Tarreau861c4ef2020-03-08 00:42:37 +01002751 ps->reconnect = tick_add(now_ms, MS_TO_TICKS(50 + ha_random() % 2000));
Frédéric Lécaillec77aa3b2020-10-14 11:50:26 +02002752 ps->heartbeat = TICK_ETERNITY;
Emeric Brun9ef2ad72019-04-02 17:22:01 +02002753 peer_session_forceshutdown(ps);
Frédéric Lécaille9a88a832019-11-07 15:22:33 +01002754 ps->no_hbt++;
Frédéric Lécaille045e0d42019-03-21 11:12:32 +01002755 }
2756 }
2757 else if (tick_is_expired(ps->heartbeat, now_ms)) {
2758 ps->heartbeat = tick_add(now_ms, MS_TO_TICKS(PEER_HEARTBEAT_TIMEOUT));
2759 ps->flags |= PEER_F_HEARTBEAT;
2760 appctx_wakeup(ps->appctx);
2761 }
Frédéric Lécailleb7405c12019-03-27 14:32:39 +01002762 task->expire = tick_first(ps->reconnect, ps->heartbeat);
Frédéric Lécaille645635d2019-02-11 17:49:39 +01002763 }
Emeric Brun2b920a12010-09-23 18:30:22 +02002764 }
2765 /* else do nothing */
2766 } /* SUCCESSCODE */
2767 } /* !ps->peer->local */
2768 } /* for */
2769
2770 /* Resync from remotes expired: consider resync is finished */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002771 if (((peers->flags & PEERS_RESYNC_STATEMASK) == PEERS_RESYNC_FROMREMOTE) &&
2772 !(peers->flags & PEERS_F_RESYNC_ASSIGN) &&
2773 tick_is_expired(peers->resync_timeout, now_ms)) {
Emeric Brun2b920a12010-09-23 18:30:22 +02002774 /* Resync from remote peer needed
2775 * no peer was assigned for the lesson
2776 * and resync timeout expire */
2777
2778 /* flag no more resync from remote, consider resync is finished */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002779 peers->flags |= PEERS_F_RESYNC_REMOTE;
Emeric Brun2b920a12010-09-23 18:30:22 +02002780 }
2781
Emeric Brunb3971ab2015-05-12 18:49:09 +02002782 if ((peers->flags & PEERS_RESYNC_STATEMASK) != PEERS_RESYNC_FINISHED) {
Emeric Brun2b920a12010-09-23 18:30:22 +02002783 /* Resync not finished*/
Frédéric Lécaille5d6e5f82017-05-29 13:47:16 +02002784 /* reschedule task to resync timeout if not expired, to ended resync if needed */
2785 if (!tick_is_expired(peers->resync_timeout, now_ms))
2786 task->expire = tick_first(task->expire, peers->resync_timeout);
Emeric Brun2b920a12010-09-23 18:30:22 +02002787 }
2788 } /* !stopping */
2789 else {
2790 /* soft stop case */
Willy Tarreau086735a2018-11-05 15:09:47 +01002791 if (state & TASK_WOKEN_SIGNAL) {
Joseph Herlant82b2f542018-11-15 12:19:14 -08002792 /* We've just received the signal */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002793 if (!(peers->flags & PEERS_F_DONOTSTOP)) {
Emeric Brun2b920a12010-09-23 18:30:22 +02002794 /* add DO NOT STOP flag if not present */
Olivier Houcharded879892019-03-08 18:53:43 +01002795 _HA_ATOMIC_ADD(&jobs, 1);
Emeric Brunb3971ab2015-05-12 18:49:09 +02002796 peers->flags |= PEERS_F_DONOTSTOP;
2797 ps = peers->local;
2798 for (st = ps->tables; st ; st = st->next)
2799 st->table->syncing++;
Emeric Brun2b920a12010-09-23 18:30:22 +02002800 }
2801
2802 /* disconnect all connected peers */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002803 for (ps = peers->remote; ps; ps = ps->next) {
Emeric Brun80527f52017-06-19 17:46:37 +02002804 /* we're killing a connection, we must apply a random delay before
2805 * retrying otherwise the other end will do the same and we can loop
2806 * for a while.
2807 */
Willy Tarreau861c4ef2020-03-08 00:42:37 +01002808 ps->reconnect = tick_add(now_ms, MS_TO_TICKS(50 + ha_random() % 2000));
Willy Tarreau9df94c22016-10-31 18:42:52 +01002809 if (ps->appctx) {
Emeric Brun9ef2ad72019-04-02 17:22:01 +02002810 peer_session_forceshutdown(ps);
Emeric Brun2b920a12010-09-23 18:30:22 +02002811 }
2812 }
2813 }
Emeric Brun2b920a12010-09-23 18:30:22 +02002814
Emeric Brunb3971ab2015-05-12 18:49:09 +02002815 ps = peers->local;
Emeric Brun2b920a12010-09-23 18:30:22 +02002816 if (ps->flags & PEER_F_TEACH_COMPLETE) {
Emeric Brunb3971ab2015-05-12 18:49:09 +02002817 if (peers->flags & PEERS_F_DONOTSTOP) {
Emeric Brun2b920a12010-09-23 18:30:22 +02002818 /* resync of new process was complete, current process can die now */
Olivier Houcharded879892019-03-08 18:53:43 +01002819 _HA_ATOMIC_SUB(&jobs, 1);
Emeric Brunb3971ab2015-05-12 18:49:09 +02002820 peers->flags &= ~PEERS_F_DONOTSTOP;
2821 for (st = ps->tables; st ; st = st->next)
2822 st->table->syncing--;
Emeric Brun2b920a12010-09-23 18:30:22 +02002823 }
2824 }
Willy Tarreau9df94c22016-10-31 18:42:52 +01002825 else if (!ps->appctx) {
2826 /* If there's no active peer connection */
Emeric Brun2b920a12010-09-23 18:30:22 +02002827 if (ps->statuscode == 0 ||
Willy Tarreaue4d927a2013-12-01 12:47:35 +01002828 ps->statuscode == PEER_SESS_SC_SUCCESSCODE ||
2829 ps->statuscode == PEER_SESS_SC_CONNECTEDCODE ||
2830 ps->statuscode == PEER_SESS_SC_TRYAGAIN) {
Emeric Brun2b920a12010-09-23 18:30:22 +02002831 /* connection never tried
Willy Tarreau9df94c22016-10-31 18:42:52 +01002832 * or previous peer connection was successfully established
2833 * or previous tcp connect succeeded but init state incomplete
Emeric Brun2b920a12010-09-23 18:30:22 +02002834 * or during previous connect, peer replies a try again statuscode */
2835
2836 /* connect to the peer */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002837 peer_session_create(peers, ps);
Emeric Brun2b920a12010-09-23 18:30:22 +02002838 }
2839 else {
2840 /* Other error cases */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002841 if (peers->flags & PEERS_F_DONOTSTOP) {
Emeric Brun2b920a12010-09-23 18:30:22 +02002842 /* unable to resync new process, current process can die now */
Olivier Houcharded879892019-03-08 18:53:43 +01002843 _HA_ATOMIC_SUB(&jobs, 1);
Emeric Brunb3971ab2015-05-12 18:49:09 +02002844 peers->flags &= ~PEERS_F_DONOTSTOP;
2845 for (st = ps->tables; st ; st = st->next)
2846 st->table->syncing--;
Emeric Brun2b920a12010-09-23 18:30:22 +02002847 }
2848 }
2849 }
Emeric Brunb3971ab2015-05-12 18:49:09 +02002850 else if (ps->statuscode == PEER_SESS_SC_SUCCESSCODE ) {
Willy Tarreau9df94c22016-10-31 18:42:52 +01002851 /* current peer connection is active and established
2852 * wake up all peer handlers to push remaining local updates */
Emeric Brunb3971ab2015-05-12 18:49:09 +02002853 for (st = ps->tables; st ; st = st->next) {
2854 if ((int)(st->last_pushed - st->table->localupdate) < 0) {
Emeric Brunb3971ab2015-05-12 18:49:09 +02002855 appctx_wakeup(ps->appctx);
2856 break;
2857 }
2858 }
Emeric Brun2b920a12010-09-23 18:30:22 +02002859 }
2860 } /* stopping */
Emeric Brun80527f52017-06-19 17:46:37 +02002861
2862 /* Release lock for all peers of the section */
2863 for (ps = peers->remote; ps; ps = ps->next)
Christopher Faulet2a944ee2017-11-07 10:42:54 +01002864 HA_SPIN_UNLOCK(PEER_LOCK, &ps->lock);
Emeric Brun80527f52017-06-19 17:46:37 +02002865
Emeric Brun2b920a12010-09-23 18:30:22 +02002866 /* Wakeup for re-connect */
2867 return task;
2868}
2869
Emeric Brunb3971ab2015-05-12 18:49:09 +02002870
Emeric Brun2b920a12010-09-23 18:30:22 +02002871/*
Willy Tarreaud9443442018-10-15 11:18:03 +02002872 * returns 0 in case of error.
Emeric Brun2b920a12010-09-23 18:30:22 +02002873 */
Willy Tarreaud9443442018-10-15 11:18:03 +02002874int peers_init_sync(struct peers *peers)
Emeric Brun2b920a12010-09-23 18:30:22 +02002875{
Emeric Brun2b920a12010-09-23 18:30:22 +02002876 struct peer * curpeer;
Emeric Brun2b920a12010-09-23 18:30:22 +02002877
Emeric Brun2b920a12010-09-23 18:30:22 +02002878 for (curpeer = peers->remote; curpeer; curpeer = curpeer->next) {
Emeric Brun2b920a12010-09-23 18:30:22 +02002879 peers->peers_fe->maxconn += 3;
2880 }
2881
Emeric Brunc60def82017-09-27 14:59:38 +02002882 peers->sync_task = task_new(MAX_THREADS_MASK);
Willy Tarreaud9443442018-10-15 11:18:03 +02002883 if (!peers->sync_task)
2884 return 0;
2885
Emeric Brunb3971ab2015-05-12 18:49:09 +02002886 peers->sync_task->process = process_peer_sync;
Emeric Brunb3971ab2015-05-12 18:49:09 +02002887 peers->sync_task->context = (void *)peers;
2888 peers->sighandler = signal_register_task(0, peers->sync_task, 0);
2889 task_wakeup(peers->sync_task, TASK_WOKEN_INIT);
Willy Tarreaud9443442018-10-15 11:18:03 +02002890 return 1;
Emeric Brunb3971ab2015-05-12 18:49:09 +02002891}
2892
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002893/*
2894 * Allocate a cache a dictionary entries used upon transmission.
2895 */
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002896static struct dcache_tx *new_dcache_tx(size_t max_entries)
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002897{
2898 struct dcache_tx *d;
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002899 struct ebpt_node *entries;
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002900
2901 d = malloc(sizeof *d);
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002902 entries = calloc(max_entries, sizeof *entries);
2903 if (!d || !entries)
2904 goto err;
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002905
2906 d->lru_key = 0;
Frédéric Lécailleb65717f2019-06-07 14:25:25 +02002907 d->prev_lookup = NULL;
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002908 d->cached_entries = EB_ROOT_UNIQUE;
2909 d->entries = entries;
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002910
2911 return d;
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002912
2913 err:
2914 free(d);
2915 free(entries);
2916 return NULL;
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002917}
2918
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002919static void free_dcache_tx(struct dcache_tx *dc)
2920{
2921 free(dc->entries);
2922 dc->entries = NULL;
2923 free(dc);
2924}
2925
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002926/*
2927 * Allocate a cache of dictionary entries with <name> as name and <max_entries>
2928 * as maximum of entries.
2929 * Return the dictionay cache if succeeded, NULL if not.
2930 * Must be deallocated calling free_dcache().
2931 */
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002932static struct dcache *new_dcache(size_t max_entries)
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002933{
2934 struct dcache_tx *dc_tx;
2935 struct dcache *dc;
2936 struct dcache_rx *dc_rx;
2937
2938 dc = calloc(1, sizeof *dc);
2939 dc_tx = new_dcache_tx(max_entries);
2940 dc_rx = calloc(max_entries, sizeof *dc_rx);
2941 if (!dc || !dc_tx || !dc_rx)
2942 goto err;
2943
2944 dc->tx = dc_tx;
2945 dc->rx = dc_rx;
2946 dc->max_entries = max_entries;
2947
2948 return dc;
2949
2950 err:
2951 free(dc);
2952 free(dc_tx);
2953 free(dc_rx);
2954 return NULL;
2955}
2956
2957/*
2958 * Deallocate a cache of dictionary entries.
2959 */
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002960static inline void free_dcache(struct dcache *dc)
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002961{
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002962 free_dcache_tx(dc->tx);
2963 dc->tx = NULL;
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002964 free(dc->rx); dc->rx = NULL;
2965 free(dc);
2966}
2967
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002968
2969/*
2970 * Look for the dictionary entry with the value of <i> in <d> cache of dictionary
2971 * entries used upon transmission.
2972 * Return the entry if found, NULL if not.
2973 */
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002974static struct ebpt_node *dcache_tx_lookup_value(struct dcache_tx *d,
2975 struct dcache_tx_entry *i)
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002976{
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002977 return ebpt_lookup(&d->cached_entries, i->entry.key);
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002978}
2979
2980/*
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002981 * Flush <dc> cache.
2982 * Always succeeds.
2983 */
2984static inline void flush_dcache(struct peer *peer)
2985{
2986 int i;
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +02002987 struct dcache *dc = peer->dcache;
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002988
Frédéric Lécailled31dc822020-11-12 21:01:54 +01002989 for (i = 0; i < dc->max_entries; i++) {
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002990 ebpt_delete(&dc->tx->entries[i]);
Frédéric Lécailled31dc822020-11-12 21:01:54 +01002991 dc->tx->entries[i].key = NULL;
2992 }
2993 dc->tx->prev_lookup = NULL;
2994 dc->tx->lru_key = 0;
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002995
Frédéric Lécaille6c391982019-06-06 11:34:03 +02002996 memset(dc->rx, 0, dc->max_entries * sizeof *dc->rx);
Frédéric Lécaille74167b22019-05-28 19:02:42 +02002997}
2998
2999/*
3000 * Insert a dictionary entry in <dc> cache part used upon transmission (->tx)
3001 * with information provided by <i> dictionary cache entry (especially the value
3002 * to be inserted if not already). Return <i> if already present in the cache
Frédéric Lécaille6c391982019-06-06 11:34:03 +02003003 * or something different of <i> if not.
Frédéric Lécaille74167b22019-05-28 19:02:42 +02003004 */
Frédéric Lécaille6c391982019-06-06 11:34:03 +02003005static struct ebpt_node *dcache_tx_insert(struct dcache *dc, struct dcache_tx_entry *i)
Frédéric Lécaille74167b22019-05-28 19:02:42 +02003006{
3007 struct dcache_tx *dc_tx;
Frédéric Lécaille6c391982019-06-06 11:34:03 +02003008 struct ebpt_node *o;
Frédéric Lécaille74167b22019-05-28 19:02:42 +02003009
3010 dc_tx = dc->tx;
Frédéric Lécailleb65717f2019-06-07 14:25:25 +02003011
3012 if (dc_tx->prev_lookup && dc_tx->prev_lookup->key == i->entry.key) {
3013 o = dc_tx->prev_lookup;
3014 } else {
3015 o = dcache_tx_lookup_value(dc_tx, i);
3016 if (o) {
3017 /* Save it */
3018 dc_tx->prev_lookup = o;
3019 }
3020 }
3021
Frédéric Lécaille74167b22019-05-28 19:02:42 +02003022 if (o) {
Frédéric Lécaille6c391982019-06-06 11:34:03 +02003023 /* Copy the ID. */
3024 i->id = o - dc->tx->entries;
3025 return &i->entry;
Frédéric Lécaille74167b22019-05-28 19:02:42 +02003026 }
3027
Frédéric Lécaille6c391982019-06-06 11:34:03 +02003028 /* The new entry to put in cache */
Frédéric Lécailleb65717f2019-06-07 14:25:25 +02003029 dc_tx->prev_lookup = o = &dc_tx->entries[dc_tx->lru_key];
Frédéric Lécaille74167b22019-05-28 19:02:42 +02003030
Frédéric Lécaille6c391982019-06-06 11:34:03 +02003031 ebpt_delete(o);
3032 o->key = i->entry.key;
3033 ebpt_insert(&dc_tx->cached_entries, o);
3034 i->id = dc_tx->lru_key;
Frédéric Lécaille74167b22019-05-28 19:02:42 +02003035
Frédéric Lécaille6c391982019-06-06 11:34:03 +02003036 /* Update the index for the next entry to put in cache */
3037 dc_tx->lru_key = (dc_tx->lru_key + 1) & (dc->max_entries - 1);
Emeric Brunb3971ab2015-05-12 18:49:09 +02003038
Frédéric Lécaille74167b22019-05-28 19:02:42 +02003039 return o;
3040}
Emeric Brunb3971ab2015-05-12 18:49:09 +02003041
3042/*
Frédéric Lécaille8d78fa72019-05-20 18:22:52 +02003043 * Allocate a dictionary cache for each peer of <peers> section.
3044 * Return 1 if succeeded, 0 if not.
3045 */
3046int peers_alloc_dcache(struct peers *peers)
3047{
3048 struct peer *p;
3049
3050 for (p = peers->remote; p; p = p->next) {
3051 p->dcache = new_dcache(PEER_STKT_CACHE_MAX_ENTRIES);
3052 if (!p->dcache)
3053 return 0;
3054 }
3055
3056 return 1;
3057}
3058
3059/*
Emeric Brunb3971ab2015-05-12 18:49:09 +02003060 * Function used to register a table for sync on a group of peers
3061 *
3062 */
3063void peers_register_table(struct peers *peers, struct stktable *table)
3064{
3065 struct shared_table *st;
3066 struct peer * curpeer;
3067 int id = 0;
3068
3069 for (curpeer = peers->remote; curpeer; curpeer = curpeer->next) {
Vincent Bernat02779b62016-04-03 13:48:43 +02003070 st = calloc(1,sizeof(*st));
Emeric Brunb3971ab2015-05-12 18:49:09 +02003071 st->table = table;
3072 st->next = curpeer->tables;
3073 if (curpeer->tables)
3074 id = curpeer->tables->local_id;
3075 st->local_id = id + 1;
3076
3077 curpeer->tables = st;
3078 }
3079
3080 table->sync_task = peers->sync_task;
Emeric Brun2b920a12010-09-23 18:30:22 +02003081}
3082
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003083/*
3084 * Parse the "show peers" command arguments.
3085 * Returns 0 if succeeded, 1 if not with the ->msg of the appctx set as
3086 * error message.
3087 */
3088static int cli_parse_show_peers(char **args, char *payload, struct appctx *appctx, void *private)
3089{
3090 appctx->ctx.cfgpeers.target = NULL;
3091
3092 if (*args[2]) {
3093 struct peers *p;
3094
3095 for (p = cfg_peers; p; p = p->next) {
3096 if (!strcmp(p->id, args[2])) {
3097 appctx->ctx.cfgpeers.target = p;
3098 break;
3099 }
3100 }
3101
3102 if (!p) {
3103 appctx->ctx.cli.severity = LOG_ERR;
3104 appctx->ctx.cli.msg = "No such peers\n";
3105 appctx->st0 = CLI_ST_PRINT;
3106 return 1;
3107 }
3108 }
3109
3110 return 0;
3111}
3112
3113/*
3114 * This function dumps the peer state information of <peers> "peers" section.
3115 * Returns 0 if the output buffer is full and needs to be called again, non-zero if not.
3116 * Dedicated to be called by cli_io_handler_show_peers() cli I/O handler.
3117 */
3118static int peers_dump_head(struct buffer *msg, struct stream_interface *si, struct peers *peers)
3119{
3120 struct tm tm;
3121
3122 get_localtime(peers->last_change, &tm);
Emeric Brun0bbec0f2019-04-18 11:39:43 +02003123 chunk_appendf(msg, "%p: [%02d/%s/%04d:%02d:%02d:%02d] id=%s state=%d flags=0x%x resync_timeout=%s task_calls=%u\n",
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003124 peers,
3125 tm.tm_mday, monthname[tm.tm_mon], tm.tm_year+1900,
3126 tm.tm_hour, tm.tm_min, tm.tm_sec,
3127 peers->id, peers->state, peers->flags,
3128 peers->resync_timeout ?
3129 tick_is_expired(peers->resync_timeout, now_ms) ? "<PAST>" :
3130 human_time(TICKS_TO_MS(peers->resync_timeout - now_ms),
Emeric Brun0bbec0f2019-04-18 11:39:43 +02003131 TICKS_TO_MS(1000)) : "<NEVER>",
3132 peers->sync_task ? peers->sync_task->calls : 0);
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003133
3134 if (ci_putchk(si_ic(si), msg) == -1) {
3135 si_rx_room_blk(si);
3136 return 0;
3137 }
3138
3139 return 1;
3140}
3141
3142/*
3143 * This function dumps <peer> state information.
3144 * Returns 0 if the output buffer is full and needs to be called again, non-zero
3145 * if not. Dedicated to be called by cli_io_handler_show_peers() cli I/O handler.
3146 */
3147static int peers_dump_peer(struct buffer *msg, struct stream_interface *si, struct peer *peer)
3148{
3149 struct connection *conn;
3150 char pn[INET6_ADDRSTRLEN];
3151 struct stream_interface *peer_si;
3152 struct stream *peer_s;
3153 struct appctx *appctx;
3154 struct shared_table *st;
3155
3156 addr_to_str(&peer->addr, pn, sizeof pn);
Frédéric Lécaille85e72122020-10-05 12:33:07 +02003157 chunk_appendf(msg, " %p: id=%s(%s,%s) addr=%s:%d last_status=%s reconnect=%s confirm=%u tx_hbt=%u rx_hbt=%u no_hbt=%u new_conn=%u proto_err=%u\n",
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003158 peer, peer->id,
3159 peer->local ? "local" : "remote",
Frédéric Lécaille85e72122020-10-05 12:33:07 +02003160 peer->appctx ? "active" : "inactive",
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003161 pn, get_host_port(&peer->addr),
3162 statuscode_str(peer->statuscode),
3163 peer->reconnect ?
3164 tick_is_expired(peer->reconnect, now_ms) ? "<PAST>" :
3165 human_time(TICKS_TO_MS(peer->reconnect - now_ms),
3166 TICKS_TO_MS(1000)) : "<NEVER>",
Frédéric Lécaille9a88a832019-11-07 15:22:33 +01003167 peer->confirm, peer->tx_hbt, peer->rx_hbt,
3168 peer->no_hbt, peer->new_conn, peer->proto_err);
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003169
3170 chunk_appendf(&trash, " flags=0x%x", peer->flags);
3171
3172 appctx = peer->appctx;
3173 if (!appctx)
Frédéric Lécaille586f9f42019-11-06 10:41:03 +01003174 goto table_info;
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003175
Emeric Brun0bbec0f2019-04-18 11:39:43 +02003176 chunk_appendf(&trash, " appctx:%p st0=%d st1=%d task_calls=%u", appctx, appctx->st0, appctx->st1,
3177 appctx->t ? appctx->t->calls : 0);
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003178
3179 peer_si = peer->appctx->owner;
3180 if (!peer_si)
Frédéric Lécaille586f9f42019-11-06 10:41:03 +01003181 goto table_info;
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003182
3183 peer_s = si_strm(peer_si);
3184 if (!peer_s)
Frédéric Lécaille586f9f42019-11-06 10:41:03 +01003185 goto table_info;
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003186
3187 chunk_appendf(&trash, " state=%s", si_state_str(si_opposite(peer_si)->state));
3188
3189 conn = objt_conn(strm_orig(peer_s));
3190 if (conn)
3191 chunk_appendf(&trash, "\n xprt=%s", conn_get_xprt_name(conn));
3192
3193 switch (conn ? addr_to_str(&conn->addr.from, pn, sizeof(pn)) : AF_UNSPEC) {
3194 case AF_INET:
3195 case AF_INET6:
3196 chunk_appendf(&trash, " src=%s:%d", pn, get_host_port(&conn->addr.from));
3197 break;
3198 case AF_UNIX:
3199 chunk_appendf(&trash, " src=unix:%d", strm_li(peer_s)->luid);
3200 break;
3201 }
3202
3203 if (conn)
3204 conn_get_to_addr(conn);
3205
3206 switch (conn ? addr_to_str(&conn->addr.to, pn, sizeof(pn)) : AF_UNSPEC) {
3207 case AF_INET:
3208 case AF_INET6:
3209 chunk_appendf(&trash, " addr=%s:%d", pn, get_host_port(&conn->addr.to));
3210 break;
3211 case AF_UNIX:
3212 chunk_appendf(&trash, " addr=unix:%d", strm_li(peer_s)->luid);
3213 break;
3214 }
3215
Frédéric Lécaille586f9f42019-11-06 10:41:03 +01003216 table_info:
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003217 if (peer->remote_table)
3218 chunk_appendf(&trash, "\n remote_table:%p id=%s local_id=%d remote_id=%d",
3219 peer->remote_table,
3220 peer->remote_table->table->id,
3221 peer->remote_table->local_id,
3222 peer->remote_table->remote_id);
3223
3224 if (peer->last_local_table)
3225 chunk_appendf(&trash, "\n last_local_table:%p id=%s local_id=%d remote_id=%d",
3226 peer->last_local_table,
3227 peer->last_local_table->table->id,
3228 peer->last_local_table->local_id,
3229 peer->last_local_table->remote_id);
3230
3231 if (peer->tables) {
3232 chunk_appendf(&trash, "\n shared tables:");
3233 for (st = peer->tables; st; st = st->next) {
Frédéric Lécaille62b0b0b2019-05-29 16:20:41 +02003234 int i, count;
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003235 struct stktable *t;
Frédéric Lécaille62b0b0b2019-05-29 16:20:41 +02003236 struct dcache *dcache;
3237
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003238 t = st->table;
Frédéric Lécaille62b0b0b2019-05-29 16:20:41 +02003239 dcache = peer->dcache;
3240
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003241 chunk_appendf(&trash, "\n %p local_id=%d remote_id=%d "
3242 "flags=0x%x remote_data=0x%llx",
3243 st, st->local_id, st->remote_id,
3244 st->flags, (unsigned long long)st->remote_data);
3245 chunk_appendf(&trash, "\n last_acked=%u last_pushed=%u last_get=%u"
3246 " teaching_origin=%u update=%u",
3247 st->last_acked, st->last_pushed, st->last_get,
3248 st->teaching_origin, st->update);
3249 chunk_appendf(&trash, "\n table:%p id=%s update=%u localupdate=%u"
3250 " commitupdate=%u syncing=%u",
3251 t, t->id, t->update, t->localupdate, t->commitupdate, t->syncing);
Frédéric Lécaille6c391982019-06-06 11:34:03 +02003252 chunk_appendf(&trash, "\n TX dictionary cache:");
3253 count = 0;
3254 for (i = 0; i < dcache->max_entries; i++) {
3255 struct ebpt_node *node;
3256 struct dict_entry *de;
Frédéric Lécaille62b0b0b2019-05-29 16:20:41 +02003257
Frédéric Lécaille6c391982019-06-06 11:34:03 +02003258 node = &dcache->tx->entries[i];
3259 if (!node->key)
3260 break;
3261
3262 if (!count++)
3263 chunk_appendf(&trash, "\n ");
3264 de = node->key;
3265 chunk_appendf(&trash, " %3u -> %s", i, (char *)de->value.key);
3266 count &= 0x3;
Frédéric Lécaille62b0b0b2019-05-29 16:20:41 +02003267 }
3268 chunk_appendf(&trash, "\n RX dictionary cache:");
3269 count = 0;
3270 for (i = 0; i < dcache->max_entries; i++) {
3271 if (!count++)
3272 chunk_appendf(&trash, "\n ");
3273 chunk_appendf(&trash, " %3u -> %s", i,
3274 dcache->rx[i].de ?
3275 (char *)dcache->rx[i].de->value.key : "-");
3276 count &= 0x3;
3277 }
Frédéric Lécaille95679dc2019-04-15 10:25:27 +02003278 }
3279 }
3280
3281 end:
3282 chunk_appendf(&trash, "\n");
3283 if (ci_putchk(si_ic(si), msg) == -1) {
3284 si_rx_room_blk(si);
3285 return 0;
3286 }
3287
3288 return 1;
3289}
3290
3291/*
3292 * This function dumps all the peers of "peers" section.
3293 * Returns 0 if the output buffer is full and needs to be called
3294 * again, non-zero if not. It proceeds in an isolated thread, so
3295 * there is no thread safety issue here.
3296 */
3297static int cli_io_handler_show_peers(struct appctx *appctx)
3298{
3299 int show_all;
3300 int ret = 0, first_peers = 1;
3301 struct stream_interface *si = appctx->owner;
3302
3303 thread_isolate();
3304
3305 show_all = !appctx->ctx.cfgpeers.target;
3306
3307 chunk_reset(&trash);
3308
3309 while (appctx->st2 != STAT_ST_FIN) {
3310 switch (appctx->st2) {
3311 case STAT_ST_INIT:
3312 if (show_all)
3313 appctx->ctx.cfgpeers.peers = cfg_peers;
3314 else
3315 appctx->ctx.cfgpeers.peers = appctx->ctx.cfgpeers.target;
3316
3317 appctx->st2 = STAT_ST_LIST;
3318 /* fall through */
3319
3320 case STAT_ST_LIST:
3321 if (!appctx->ctx.cfgpeers.peers) {
3322 /* No more peers list. */
3323 appctx->st2 = STAT_ST_END;
3324 }
3325 else {
3326 if (!first_peers)
3327 chunk_appendf(&trash, "\n");
3328 else
3329 first_peers = 0;
3330 if (!peers_dump_head(&trash, si, appctx->ctx.cfgpeers.peers))
3331 goto out;
3332
3333 appctx->ctx.cfgpeers.peer = appctx->ctx.cfgpeers.peers->remote;
3334 appctx->ctx.cfgpeers.peers = appctx->ctx.cfgpeers.peers->next;
3335 appctx->st2 = STAT_ST_INFO;
3336 }
3337 break;
3338
3339 case STAT_ST_INFO:
3340 if (!appctx->ctx.cfgpeers.peer) {
3341 /* End of peer list */
3342 if (show_all)
3343 appctx->st2 = STAT_ST_LIST;
3344 else
3345 appctx->st2 = STAT_ST_END;
3346 }
3347 else {
3348 if (!peers_dump_peer(&trash, si, appctx->ctx.cfgpeers.peer))
3349 goto out;
3350
3351 appctx->ctx.cfgpeers.peer = appctx->ctx.cfgpeers.peer->next;
3352 }
3353 break;
3354
3355 case STAT_ST_END:
3356 appctx->st2 = STAT_ST_FIN;
3357 break;
3358 }
3359 }
3360 ret = 1;
3361 out:
3362 thread_release();
3363 return ret;
3364}
3365
3366/*
3367 * CLI keywords.
3368 */
3369static struct cli_kw_list cli_kws = {{ }, {
3370 { { "show", "peers", NULL }, "show peers [peers section]: dump some information about all the peers or this peers section", cli_parse_show_peers, cli_io_handler_show_peers, },
3371 {},
3372}};
3373
3374/* Register cli keywords */
3375INITCALL1(STG_REGISTER, cli_register_kw, &cli_kws);
3376